Home
last modified time | relevance | path

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

123

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DGraphTraits.h95 struct Inverse { struct
98 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
113 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
115 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
116 GraphTraits<Inverse<GraphType>>::nodes_end(G));
127 iterator_range<typename GraphTraits<Inverse<GraphType>>::ChildIteratorType>
129 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
130 GraphTraits<Inverse<GraphType>>::child_end(G));
H A DDepthFirstIterator.h261 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
262 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) in idf_iterator()
263 : df_iterator<Inverse<T>, SetTy, External>(V) {} in idf_iterator()
268 return idf_iterator<T>::begin(Inverse<T>(G)); in idf_begin()
273 return idf_iterator<T>::end(Inverse<T>(G)); in idf_end()
287 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V) in idf_ext_iterator()
293 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S); in idf_ext_begin()
298 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S); in idf_ext_end()
H A DPostOrderIterator.h217 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External> {
218 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) : in ipo_iterator()
219 po_iterator<Inverse<T>, SetType, External> (V) {} in ipo_iterator()
242 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) : in ipo_ext_iterator()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/
H A DCFG.h325 template <> struct GraphTraits<Inverse<BasicBlock*>> {
329 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
334 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
338 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
390 template <> struct GraphTraits<Inverse<Function*>> :
391 public GraphTraits<Inverse<BasicBlock*>> {
392 static NodeRef getEntryNode(Inverse<Function *> G) {
396 template <> struct GraphTraits<Inverse<const Function*>> :
397 public GraphTraits<Inverse<const BasicBlock*>> {
398 static NodeRef getEntryNode(Inverse<const Function *> G) {
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h98 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB)) in hasDedicatedExits()
202 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopPredecessor()
220 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopLatch()
312 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
313 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
318 std::for_each(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
319 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
431 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
474 for (const auto Pred : children<Inverse<BlockT *>>(PredBB)) { in discoverAndMapSubloop()
557 for (const auto Backedge : children<Inverse<BlockT *>>(Header)) { in analyze()
H A DInterval.h127 template <> struct GraphTraits<Inverse<Interval*>> {
131 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
H A DLoopInfo.h244 auto PredBegin = GraphTraits<Inverse<BlockT *>>::child_begin(Header); in isLoopLatch()
245 auto PredEnd = GraphTraits<Inverse<BlockT *>>::child_end(Header); in isLoopLatch()
255 for (const auto Pred : children<Inverse<BlockT *>>(H)) in getNumBackEdges()
337 for (const auto Pred : children<Inverse<BlockT *>>(H)) in getLoopLatches()
H A DIntervalIterator.h88 class IGT = GraphTraits<Inverse<NodeTy *>>>
H A DRegionInfo.h268 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
687 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/
H A DCFG.h1507 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1511 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1519 template <> struct GraphTraits<Inverse<clang::CFGBlock>>
1522 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock *>> {
1526 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1534 template <> struct GraphTraits<const Inverse<clang::CFGBlock>>
1568 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1569 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
1577 template <> struct GraphTraits<Inverse<const ::clang::CFG *>>
1578 : public GraphTraits<Inverse<const ::clang::CFGBlock *>> {
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineFunction.h1189 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1190 public GraphTraits<Inverse<MachineBasicBlock*>> {
1191 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1195 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1196 public GraphTraits<Inverse<const MachineBasicBlock*>> {
1197 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
H A DMachineBasicBlock.h1157 template <> struct GraphTraits<Inverse<MachineBasicBlock*>> {
1161 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
1169 template <> struct GraphTraits<Inverse<const MachineBasicBlock*>> {
1173 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
/netbsd-src/external/mpl/dhcp/dist/doc/
H A DIANA-arp-parameters22 The Inverse Address Resolution Protocol (IARP) specified in [RFC1293]
100 [RFC1293] Bradley, T., and C. Brown, "Inverse Address Resolution
/netbsd-src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/
H A Dimx53-usbarmory.dts5 * Copyright (C) 2015, Inverse Path
51 model = "Inverse Path USB armory";
/netbsd-src/crypto/external/bsd/openssl/dist/doc/man3/
H A DSSL_CONF_cmd.pod459 B<SessionTicket>: session ticket support, enabled by default. Inverse of
463 B<Compression>: SSL/TLS compression support, disabled by default. Inverse
468 is set by default. Inverse of B<SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS>.
472 B<DHSingle>: enable single use DH keys, set by default. Inverse of
475 B<ECDHSingle>: enable single use ECDH keys, set by default. Inverse of
501 default. Inverse of B<SSL_OP_NO_ENCRYPT_THEN_MAC>: that is,
524 default. Inverse of B<SSL_OP_NO_EXTENDED_MASTER_SECRET>: that is,
528 default. Inverse of B<SSL_OP_DISABLE_TLSEXT_CA_NAMES>: that is,
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Support/
H A DGenericDomTree.h702 Split<Inverse<NodeT *>>(NewBB);
841 SmallVector<NodeRef, 4> PredBlocks(children<Inverse<N>>(NewBB));
846 for (auto Pred : children<Inverse<N>>(NewBBSucc)) {
H A DCFGDiff.h137 std::conditional_t<InverseEdge, Inverse<NodePtr>, NodePtr>; in getChildren()
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
/netbsd-src/external/bsd/nvi/dist/gtk/
H A Dgtkviscreen.c655 #define Inverse(screen,y,x) \ macro
678 inverse = Inverse(vi,y,x); in draw_lines()
682 Inverse(vi,y,x+len) == inverse; ++len); in draw_lines()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
H A DVPlan.h1735 template <> struct GraphTraits<Inverse<VPBlockBase *>> {
1739 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
1795 struct GraphTraits<Inverse<VPRegionBlock *>>
1796 : public GraphTraits<Inverse<VPBlockBase *>> {
1800 static NodeRef getEntryNode(Inverse<GraphRef> N) {
/netbsd-src/crypto/external/bsd/openssl.old/dist/doc/man3/
H A DSSL_CONF_cmd.pod433 B<SessionTicket>: session ticket support, enabled by default. Inverse of
437 B<Compression>: SSL/TLS compression support, disabled by default. Inverse
442 is set by default. Inverse of B<SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS>.
446 B<DHSingle>: enable single use DH keys, set by default. Inverse of
449 B<ECDHSingle>: enable single use ECDH keys, set by default. Inverse of
476 default. Inverse of B<SSL_OP_NO_ENCRYPT_THEN_MAC>: that is,
/netbsd-src/external/lgpl3/gmp/dist/mpn/ia64/
H A Dmode1o.asm103 C Inverse Calculation:
/netbsd-src/external/mpl/bind/dist/tests/dns/testdata/dst/
H A Dtest2.data98 6.4. Inverse queries (Optional) 40
100 6.4.2. Inverse query and response example 41
101 6.4.3. Inverse query processing 42
2193 6.4. Inverse queries (Optional)
2195 Inverse queries are an optional part of the DNS. Name servers are not
2202 6.4.1. The contents of inverse queries and responses Inverse
2209 Inverse queries take the form of a single RR in the answer section of
2216 management and debugging activities. Inverse queries are NOT an
2256 6.4.2. Inverse query and response example The overall structure
2316 6.4.3. Inverse query processing
[all …]
H A Dtest1.data98 6.4. Inverse queries (Optional) 40
100 6.4.2. Inverse query and response example 41
101 6.4.3. Inverse query processing 42
2193 6.4. Inverse queries (Optional)
2195 Inverse queries are an optional part of the DNS. Name servers are not
2202 6.4.1. The contents of inverse queries and responses Inverse
2209 Inverse queries take the form of a single RR in the answer section of
2216 management and debugging activities. Inverse queries are NOT an
2256 6.4.2. Inverse query and response example The overall structure
2316 6.4.3. Inverse query processing
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DScalarEvolution.cpp10173 auto ProveViaCond = [&](const Value *Condition, bool Inverse) { in isBasicBlockEntryGuardedByCond() argument
10175 if (isImpliedCond(Pred, LHS, RHS, Condition, Inverse, Context)) in isBasicBlockEntryGuardedByCond()
10179 return isImpliedCond(P, LHS, RHS, Condition, Inverse, Context); in isBasicBlockEntryGuardedByCond()
10250 const Value *FoundCondValue, bool Inverse, in isImpliedCond() argument
10254 ConstantInt::getBool(FoundCondValue->getContext(), Inverse)) in isImpliedCond()
10266 if (!Inverse) in isImpliedCond()
10267 return isImpliedCond(Pred, LHS, RHS, Op0, Inverse, Context) || in isImpliedCond()
10268 isImpliedCond(Pred, LHS, RHS, Op1, Inverse, Context); in isImpliedCond()
10270 if (Inverse) in isImpliedCond()
10271 return isImpliedCond(Pred, LHS, RHS, Op0, Inverse, Context) || in isImpliedCond()
[all …]

123