Home
last modified time | relevance | path

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

12

/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DGraphTraits.h96 struct Inverse { struct
99 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() function
104 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
114 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
116 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
117 GraphTraits<Inverse<GraphType>>::nodes_end(G));
128 iterator_range<typename GraphTraits<Inverse<GraphType>>::ChildIteratorType>
130 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
131 GraphTraits<Inverse<GraphType>>::child_end(G));
H A DDepthFirstIterator.h260 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
261 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) in idf_iterator()
262 : df_iterator<Inverse<T>, SetTy, External>(V) {} in idf_iterator()
267 return idf_iterator<T>::begin(Inverse<T>(G)); in idf_begin()
272 return idf_iterator<T>::end(Inverse<T>(G)); in idf_end()
286 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V) in idf_ext_iterator()
292 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S); in idf_ext_begin()
297 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S); in idf_ext_end()
H A DPostOrderIterator.h215 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External> {
216 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) : in ipo_iterator()
217 po_iterator<Inverse<T>, SetType, External> (V) {} in ipo_iterator()
240 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) : in ipo_ext_iterator()
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFG.h327 template <> struct GraphTraits<Inverse<BasicBlock*>> {
331 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
336 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
340 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
392 template <> struct GraphTraits<Inverse<Function*>> :
393 public GraphTraits<Inverse<BasicBlock*>> {
394 static NodeRef getEntryNode(Inverse<Function *> G) {
398 template <> struct GraphTraits<Inverse<const Function*>> :
399 public GraphTraits<Inverse<const BasicBlock*>> {
400 static NodeRef getEntryNode(Inverse<const Function *> G) {
H A DCFGDiff.h277 std::pair<const GraphDiff<BasicBlock *, false> *, Inverse<BasicBlock *>>>
281 std::pair<const GraphDiff<BasicBlock *, true> *, Inverse<BasicBlock *>>>
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h92 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB)) in hasDedicatedExits()
103 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in getUniqueExitBlocks()
209 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopPredecessor()
229 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopLatch()
321 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
322 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
327 std::for_each(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
328 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
437 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
480 for (const auto Pred : children<Inverse<BlockT *>>(PredBB)) { in discoverAndMapSubloop()
[all …]
H A DInterval.h131 template <> struct GraphTraits<Inverse<Interval*>> {
135 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
H A DIteratedDominanceFrontier.h99 typedef IDFCalculator<Inverse<BasicBlock *>, true> ReverseIDFCalculator;
H A DLoopInfo.h221 auto PredBegin = GraphTraits<Inverse<BlockT *>>::child_begin(Header); in isLoopLatch()
222 auto PredEnd = GraphTraits<Inverse<BlockT *>>::child_end(Header); in isLoopLatch()
232 for (const auto Pred : children<Inverse<BlockT *>>(H)) in getNumBackEdges()
307 for (const auto Pred : children<Inverse<BlockT *>>(H)) in getLoopLatches()
H A DMemorySSAUpdater.h68 std::pair<const GraphDiff<BasicBlock *> *, Inverse<BasicBlock *>>;
H A DIntervalIterator.h89 class IGT = GraphTraits<Inverse<NodeTy *>>>
H A DRegionInfo.h270 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
690 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
H A DMemorySSA.h1155 template <> struct GraphTraits<Inverse<MemoryAccess *>> {
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineFunction.h996 template <> struct GraphTraits<Inverse<MachineFunction*>> :
997 public GraphTraits<Inverse<MachineBasicBlock*>> {
998 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1002 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1003 public GraphTraits<Inverse<const MachineBasicBlock*>> {
1004 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
H A DMachineBasicBlock.h870 template <> struct GraphTraits<Inverse<MachineBasicBlock*>> {
874 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
882 template <> struct GraphTraits<Inverse<const MachineBasicBlock*>> {
886 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCFG.h1258 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1262 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1270 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock *>> {
1274 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1313 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1314 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
1322 template <> struct GraphTraits<Inverse<const ::clang::CFG *>>
1323 : public GraphTraits<Inverse<const ::clang::CFGBlock *>> {
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DIteratedDominanceFrontier.cpp109 template class IDFCalculator<Inverse<BasicBlock *>, true>;
H A DScalarEvolution.cpp9539 auto ProveViaCond = [&](Value *Condition, bool Inverse) { in isLoopEntryGuardedByCond() argument
9540 if (isImpliedCond(Pred, LHS, RHS, Condition, Inverse)) in isLoopEntryGuardedByCond()
9548 isImpliedCond(ICmpInst::ICMP_NE, LHS, RHS, Condition, Inverse); in isLoopEntryGuardedByCond()
9595 bool Inverse) { in isImpliedCond() argument
9605 if (!Inverse) in isImpliedCond()
9606 return isImpliedCond(Pred, LHS, RHS, BO->getOperand(0), Inverse) || in isImpliedCond()
9607 isImpliedCond(Pred, LHS, RHS, BO->getOperand(1), Inverse); in isImpliedCond()
9609 if (Inverse) in isImpliedCond()
9610 return isImpliedCond(Pred, LHS, RHS, BO->getOperand(0), Inverse) || in isImpliedCond()
9611 isImpliedCond(Pred, LHS, RHS, BO->getOperand(1), Inverse); in isImpliedCond()
[all …]
/freebsd-12.1/sys/gnu/dts/arm/
H A Dimx53-usbarmory.dts5 * Copyright (C) 2015, Inverse Path
51 model = "Inverse Path USB armory";
/freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DVPlan.h1350 template <> struct GraphTraits<Inverse<VPBlockBase *>> {
1354 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
1410 struct GraphTraits<Inverse<VPRegionBlock *>>
1411 : public GraphTraits<Inverse<VPBlockBase *>> {
1415 static NodeRef getEntryNode(Inverse<GraphRef> N) {
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DGenericDomTree.h654 Split<Inverse<NodeT *>>(NewBB);
784 for (const auto &Pred : children<Inverse<N>>(NewBB))
790 for (const auto &Pred : children<Inverse<N>>(NewBBSucc)) {
H A DGenericDomTreeConstruction.h106 template <bool Inverse>
120 using Tag = std::integral_constant<bool, Inverse>;
134 auto &FutureChildren = (Inverse != IsPostDom) ? BUI->FuturePredecessors in Get()
/freebsd-12.1/crypto/openssl/doc/man3/
H A DSSL_CONF_cmd.pod422 B<SessionTicket>: session ticket support, enabled by default. Inverse of
426 B<Compression>: SSL/TLS compression support, enabled by default. Inverse
431 is set by default. Inverse of B<SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS>.
435 B<DHSingle>: enable single use DH keys, set by default. Inverse of
438 B<ECDHSingle>: enable single use ECDH keys, set by default. Inverse of
465 default. Inverse of B<SSL_OP_NO_ENCRYPT_THEN_MAC>: that is,
/freebsd-12.1/contrib/libdivsufsort/include/
H A Ddivsufsort.h.cmake115 * Inverse BW-transforms a given BWTed string.
/freebsd-12.1/contrib/llvm/lib/Transforms/InstCombine/
H A DInstCombineCompares.cpp4127 bool Inverse = false; in processUMulZExtIdiom() local
4132 Inverse = true; in processUMulZExtIdiom()
4138 Inverse = true; in processUMulZExtIdiom()
4144 Inverse = true; in processUMulZExtIdiom()
4149 if (Inverse) { in processUMulZExtIdiom()

12