Searched refs:Inverse (Results 1 - 25 of 27) sorted by relevance

12

/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h12 // This file also defines the marker class Inverse that is used to iterate over
81 // Inverse - This class is used as a little marker class to tell the graph
82 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
91 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
95 struct Inverse { struct in namespace:llvm
98 inline Inverse(const GraphType &G) : Graph(G) {} function in struct:llvm::Inverse
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<GraphTyp
[all...]
H A DDepthFirstIterator.h259 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
260 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V)
261 : df_iterator<Inverse<T>, SetTy, External>(V) {}
266 return idf_iterator<T>::begin(Inverse<T>(G));
271 return idf_iterator<T>::end(Inverse<T>(G));
285 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V)
291 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S);
296 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S);
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) :
217 po_iterator<Inverse<T>, SetType, External> (V) {}
240 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) :
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h319 // graph of basic blocks... and to walk it in inverse order. Inverse order for
323 template <> struct GraphTraits<Inverse<BasicBlock*>> {
327 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
332 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
336 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
384 // graph of basic blocks... and to walk it in inverse order. Inverse order for
388 template <> struct GraphTraits<Inverse<Function*>> :
389 public GraphTraits<Inverse<BasicBlock*>> {
390 static NodeRef getEntryNode(Inverse<Function *> G) {
394 template <> struct GraphTraits<Inverse<cons
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInterval.h130 template <> struct GraphTraits<Inverse<Interval*>> {
134 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
H A DLoopInfoImpl.h90 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB))
194 for (const auto Pred : children<Inverse<BlockT *>>(Header)) {
212 for (const auto Pred : children<Inverse<BlockT *>>(Header)) {
304 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB),
305 GraphTraits<Inverse<BlockT *>>::child_end(BB),
310 std::for_each(GraphTraits<Inverse<BlockT *>>::child_begin(BB),
311 GraphTraits<Inverse<BlockT *>>::child_end(BB),
420 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits;
463 for (const auto Pred : children<Inverse<BlockT *>>(PredBB)) {
546 for (const auto Backedge : children<Inverse<Block
[all...]
H A DMemorySSAUpdater.h56 std::pair<const GraphDiff<BasicBlock *> *, Inverse<BasicBlock *>>;
H A DIntervalIterator.h88 class IGT = GraphTraits<Inverse<NodeTy *>>>
H A DLoopInfo.h234 auto PredBegin = GraphTraits<Inverse<BlockT *>>::child_begin(Header);
235 auto PredEnd = GraphTraits<Inverse<BlockT *>>::child_end(Header);
245 for (const auto Pred : children<Inverse<BlockT *>>(H))
324 for (const auto Pred : children<Inverse<BlockT *>>(H))
H A DRegionInfo.h269 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
688 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
H A DMemorySSA.h1160 template <> struct GraphTraits<Inverse<MemoryAccess *>> {
H A DBlockFrequencyInfoImpl.h861 using Predecessor = GraphTraits<Inverse<const BlockT *>>;
H A DScalarEvolution.h1664 Value *FoundCondValue, bool Inverse);
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DCFGDiff.h48 // - GraphDiff<Inverse<BasicBlock *>> is equivalent to InverseGraph = true
51 // - second pair item is Inverse<BasicBlock *>, then InverseEdge = true (so it
59 // 2. std::pair<const GraphDiff<Inverse<BasicBlock *>> *, BasicBlock *>> :
63 // 3. std::pair<const GraphDiff<BasicBlock *> *, Inverse<BasicBlock *>>> :
67 // 4. std::pair<const GraphDiff<Inverse<BasicBlock *>> *, Inverse<BasicBlock *>>
246 struct GraphTraits<std::pair<const GraphDiff<T, B> *, Inverse<T>>>
247 : CFGViewChildren<Inverse<T>, B, true> {};
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
H A DGenericDomTree.h671 Split<Inverse<NodeT *>>(NewBB);
811 for (auto Pred : children<Inverse<N>>(NewBB))
817 for (auto Pred : children<Inverse<N>>(NewBBSucc)) {
H A DGenericDomTreeConstruction.h110 template <bool Inverse>
124 using Tag = std::integral_constant<bool, Inverse>;
138 auto &FutureChildren = (Inverse != IsPostDom) ? BUI->FuturePredecessors
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineFunction.h1119 // graph of basic blocks... and to walk it in inverse order. Inverse order for
1123 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1124 public GraphTraits<Inverse<MachineBasicBlock*>> {
1125 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1129 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1130 public GraphTraits<Inverse<const MachineBasicBlock*>> {
1131 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
H A DMachineBasicBlock.h970 // in inverse order. Inverse order for a function is considered
974 template <> struct GraphTraits<Inverse<MachineBasicBlock*>> {
978 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
986 template <> struct GraphTraits<Inverse<const MachineBasicBlock*>> {
990 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Analysis/
H A DCFG.h1495 template <> struct GraphTraits<Inverse< ::clang::CFGBlock *>> {
1499 static NodeRef getEntryNode(Inverse<::clang::CFGBlock *> G) {
1507 template <> struct GraphTraits<Inverse<clang::CFGBlock>>
1510 template <> struct GraphTraits<Inverse<const ::clang::CFGBlock *>> {
1514 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1522 template <> struct GraphTraits<const Inverse<clang::CFGBlock>>
1556 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1557 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
1565 template <> struct GraphTraits<Inverse<const ::clang::CFG *>>
1566 : public GraphTraits<Inverse<cons
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlan.h1452 // Inverse order specialization for VPBasicBlocks. Predecessors are used instead
1454 template <> struct GraphTraits<Inverse<VPBlockBase *>> {
1458 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
1514 struct GraphTraits<Inverse<VPRegionBlock *>>
1515 : public GraphTraits<Inverse<VPBlockBase *>> {
1519 static NodeRef getEntryNode(Inverse<GraphRef> N) {
/freebsd-13-stable/crypto/openssl/crypto/aes/asm/
H A Dvpaes-armv8.pl424 // Inverse mix columns
541 // Inverse mix columns
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolution.cpp9487 auto ProveViaCond = [&](Value *Condition, bool Inverse) {
9488 if (isImpliedCond(Pred, LHS, RHS, Condition, Inverse))
9493 isImpliedCond(NonStrictPredicate, LHS, RHS, Condition, Inverse);
9496 isImpliedCond(ICmpInst::ICMP_NE, LHS, RHS, Condition, Inverse);
9543 bool Inverse) {
9553 if (!Inverse)
9554 return isImpliedCond(Pred, LHS, RHS, BO->getOperand(0), Inverse) ||
9555 isImpliedCond(Pred, LHS, RHS, BO->getOperand(1), Inverse);
9557 if (Inverse)
9558 return isImpliedCond(Pred, LHS, RHS, BO->getOperand(0), Inverse) ||
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineCompares.cpp4761 bool Inverse = false; local
4766 Inverse = true;
4772 Inverse = true;
4778 Inverse = true;
4783 if (Inverse) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/
H A DConstantFold.cpp2188 Constant *Inverse = ConstantExpr::getBitCast(C1, CE2Op0->getType()); local
2189 return ConstantExpr::getICmp(pred, Inverse, CE2Op0);

Completed in 487 milliseconds

12