Home
last modified time | relevance | path

Searched refs:Inverse (Results 1 – 25 of 31) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h123 struct Inverse { struct
126 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
131 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
141 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
143 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
144 GraphTraits<Inverse<GraphType>>::nodes_end(G));
155 iterator_range<typename GraphTraits<Inverse<GraphType>>::ChildIteratorType>
157 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
158 GraphTraits<Inverse<GraphType>>::child_end(G));
H A DDepthFirstIterator.h265 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
266 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) in idf_iterator()
267 : df_iterator<Inverse<T>, SetTy, External>(V) {} in idf_iterator()
272 return idf_iterator<T>::begin(Inverse<T>(G)); in idf_begin()
277 return idf_iterator<T>::end(Inverse<T>(G)); in idf_end()
291 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V) in idf_ext_iterator()
297 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S); in idf_ext_begin()
302 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S); in idf_ext_end()
H A DPostOrderIterator.h226 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External> {
227 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) : in ipo_iterator()
228 po_iterator<Inverse<T>, SetType, External> (V) {} in ipo_iterator()
251 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) : in ipo_ext_iterator()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h335 template <> struct GraphTraits<Inverse<BasicBlock*>> {
339 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
346 static_assert(GraphHasNodeNumbers<Inverse<BasicBlock *>>,
349 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
353 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
360 static_assert(GraphHasNodeNumbers<Inverse<const BasicBlock *>>,
424 template <> struct GraphTraits<Inverse<Function*>> :
425 public GraphTraits<Inverse<BasicBlock*>> {
426 static NodeRef getEntryNode(Inverse<Function *> G) {
437 template <> struct GraphTraits<Inverse<const Function*>> :
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCFG.h1506 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1510 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1518 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock *>> {
1522 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1561 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1562 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
1570 template <> struct GraphTraits<Inverse<const ::clang::CFG *>>
1571 : public GraphTraits<Inverse<const ::clang::CFGBlock *>> {
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h284 template <> struct GraphTraits<Inverse<VPBlockBase *>> {
288 static NodeRef getEntryNode(Inverse<NodeRef> B) {
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h1380 template <> struct GraphTraits<Inverse<MachineBasicBlock*>> {
1384 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
1397 static_assert(GraphHasNodeNumbers<Inverse<MachineBasicBlock *>>,
1400 template <> struct GraphTraits<Inverse<const MachineBasicBlock*>> {
1404 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
1417 static_assert(GraphHasNodeNumbers<Inverse<const MachineBasicBlock *>>,
H A DMachineFunction.h1539 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1540 public GraphTraits<Inverse<MachineBasicBlock*>> {
1541 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1552 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1553 public GraphTraits<Inverse<const MachineBasicBlock*>> {
1554 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
/freebsd/sys/contrib/device-tree/src/arm/nxp/imx/
H A Dimx53-usbarmory.dts5 * Copyright (C) 2015, Inverse Path
51 model = "Inverse Path USB armory";
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DCFGDiff.h137 std::conditional_t<InverseEdge, Inverse<NodePtr>, NodePtr>; in getChildren()
H A DGenericIteratedDominanceFrontier.h61 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
H A DGenericLoopInfoImpl.h462 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
H A DGenericDomTree.h775 Split<Inverse<NodeT *>>(NewBB);
H A DGenericDomTreeConstruction.h121 std::conditional_t<Inversed, Inverse<NodePtr>, NodePtr>; in getChildren()
/freebsd/crypto/openssl/doc/man3/
H A DSSL_CONF_cmd.pod554 B<SessionTicket>: session ticket support, enabled by default. Inverse of
558 B<Compression>: SSL/TLS compression support, disabled by default. Inverse
563 is set by default. Inverse of B<SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS>.
567 B<DHSingle>: enable single use DH keys, set by default. Inverse of
570 B<ECDHSingle>: enable single use ECDH keys, set by default. Inverse of
596 default. Inverse of B<SSL_OP_NO_ENCRYPT_THEN_MAC>: that is,
624 default. Inverse of B<SSL_OP_NO_EXTENDED_MASTER_SECRET>: that is,
628 default. Inverse of B<SSL_OP_DISABLE_TLSEXT_CA_NAMES>: that is,
639 default. Inverse of B<SSL_OP_NO_TX_CERTIFICATE_COMPRESSION>: that is,
643 default. Inverse of B<SSL_OP_NO_RX_CERTIFICATE_COMPRESSION>: that is,
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DRegionInfo.h266 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
685 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
H A DMemorySSA.h1211 template <> struct GraphTraits<Inverse<MemoryAccess *>> {
H A DBlockFrequencyInfoImpl.h851 using Predecessor = GraphTraits<Inverse<const BlockT *>>;
H A DScalarEvolution.h2014 bool Inverse,
/freebsd/contrib/libdivsufsort/include/
H A Ddivsufsort.h.cmake115 * Inverse BW-transforms a given BWTed string.
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLICM.cpp2425 bool Inverse = false; in hoistMinMax() local
2429 Inverse = true; in hoistMinMax()
2449 if (Inverse) in hoistMinMax()
2487 if (Inverse) in hoistMinMax()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolution.cpp11682 auto ProveViaCond = [&](const Value *Condition, bool Inverse) { in isBasicBlockEntryGuardedByCond() argument
11684 if (isImpliedCond(Pred, LHS, RHS, Condition, Inverse, CtxI)) in isBasicBlockEntryGuardedByCond()
11688 return isImpliedCond(P, LHS, RHS, Condition, Inverse, CtxI); in isBasicBlockEntryGuardedByCond()
11763 const Value *FoundCondValue, bool Inverse, in isImpliedCond() argument
11767 ConstantInt::getBool(FoundCondValue->getContext(), Inverse)) in isImpliedCond()
11779 if (!Inverse) in isImpliedCond()
11780 return isImpliedCond(Pred, LHS, RHS, Op0, Inverse, CtxI) || in isImpliedCond()
11781 isImpliedCond(Pred, LHS, RHS, Op1, Inverse, CtxI); in isImpliedCond()
11783 if (Inverse) in isImpliedCond()
11784 return isImpliedCond(Pred, LHS, RHS, Op0, Inverse, CtxI) || in isImpliedCond()
[all …]
/freebsd/crypto/heimdal/doc/
H A Dcopyright.texi427 Thanks to: Dan Hoey for his excellent Initial and Inverse permutation
/freebsd/contrib/llvm-project/clang/lib/CodeGen/
H A DCGBuiltin.cpp3313 Value *Inverse = Builder.CreateNot(ArgValue, "not"); in EmitBuiltinExpr() local
3314 Value *Tmp = Builder.CreateSelect(IsNeg, Inverse, ArgValue); in EmitBuiltinExpr()
/freebsd/contrib/llvm-project/llvm/include/llvm/Testing/Demangle/
H A DDemangleTestCases.inc12026 …vm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::SmallPtrSet<llvm::BasicBlock*, 16u>, true,…
12029 …vm::df_iterator<llvm::Inverse<llvm::BasicBlock*>, llvm::SmallPtrSet<llvm::BasicBlock*, 16u>, true,…
16373 …Inverse<llvm::BasicBlock*>, llvm::GraphTraits<llvm::Inverse<llvm::BasicBlock*>>>(llvm::DominatorTr…
16495 …Inverse<llvm::MachineBasicBlock*>, std::set<llvm::MachineBasicBlock*, std::less<llvm::MachineBasic…
16927 …Inverse<llvm::MachineBasicBlock*>, llvm::GraphTraits<llvm::Inverse<llvm::MachineBasicBlock*>>>(llv…
16934 …e<llvm::MachineFunction, llvm::Inverse<llvm::MachineBasicBlock*>>(llvm::DominatorTreeBase<llvm::Gr…
16935 …Inverse<llvm::MachineBasicBlock*>>>(llvm::DominatorTreeBase<llvm::GraphTraits<llvm::Inverse<llvm::…
16937 …Inverse<llvm::MachineBasicBlock*>>::NodeType* llvm::Eval<llvm::GraphTraits<llvm::Inverse<llvm::Mac…
21174 …m::Calculate<llvm::Function, llvm::Inverse<llvm::BasicBlock*>>(llvm::DominatorTreeBase<llvm::Graph…
21175 …::Inverse<llvm::BasicBlock*>>>(llvm::DominatorTreeBase<llvm::GraphTraits<llvm::Inverse<llvm::Basic…
[all …]

12