Home
last modified time | relevance | path

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

12

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DGraphTraits.h97 struct Inverse { struct
100 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() function
105 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
115 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
117 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
118 GraphTraits<Inverse<GraphType>>::nodes_end(G));
129 iterator_range<typename GraphTraits<Inverse<GraphType>>::ChildIteratorType>
131 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
132 GraphTraits<Inverse<GraphType>>::child_end(G));
H A DDepthFirstIterator.h262 struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
263 idf_iterator(const df_iterator<Inverse<T>, SetTy, External> &V) in idf_iterator()
264 : df_iterator<Inverse<T>, SetTy, External>(V) {} in idf_iterator()
269 return idf_iterator<T>::begin(Inverse<T>(G)); in idf_begin()
274 return idf_iterator<T>::end(Inverse<T>(G)); in idf_end()
288 idf_ext_iterator(const df_iterator<Inverse<T>, SetTy, true> &V) in idf_ext_iterator()
294 return idf_ext_iterator<T, SetTy>::begin(Inverse<T>(G), S); in idf_ext_begin()
299 return idf_ext_iterator<T, SetTy>::end(Inverse<T>(G), S); in idf_ext_end()
H A DPostOrderIterator.h218 struct ipo_iterator : public po_iterator<Inverse<T>, SetType, External> {
219 ipo_iterator(const po_iterator<Inverse<T>, SetType, External> &V) : in ipo_iterator()
220 po_iterator<Inverse<T>, SetType, External> (V) {} in ipo_iterator()
243 ipo_ext_iterator(const po_iterator<Inverse<T>, SetType, true> &V) : in ipo_ext_iterator()
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DRegionGraphTraits.h37 struct GraphTraits<Inverse<mlir::Block *>> {
41 static NodeRef getEntryNode(Inverse<NodeRef> inverseGraph) {
69 struct GraphTraits<Inverse<mlir::Region *>>
70 : public GraphTraits<Inverse<mlir::Block *>> {
71 using GraphType = Inverse<mlir::Region *>;
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DCFG.h324 template <> struct GraphTraits<Inverse<BasicBlock*>> {
328 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
333 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
337 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
389 template <> struct GraphTraits<Inverse<Function*>> :
390 public GraphTraits<Inverse<BasicBlock*>> {
391 static NodeRef getEntryNode(Inverse<Function *> G) {
395 template <> struct GraphTraits<Inverse<const Function*>> :
396 public GraphTraits<Inverse<const BasicBlock*>> {
397 static NodeRef getEntryNode(Inverse<const Function *> G) {
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DLoopInfoImpl.h97 for (BlockT *Predecessor : children<Inverse<BlockT *>>(EB)) in hasDedicatedExits()
201 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopPredecessor()
219 for (const auto Pred : children<Inverse<BlockT *>>(Header)) { in getLoopLatch()
311 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
312 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
318 llvm::make_range(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
319 GraphTraits<Inverse<BlockT *>>::child_end(BB))) in verifyLoop()
429 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
471 for (const auto Pred : children<Inverse<BlockT *>>(PredBB)) { in discoverAndMapSubloop()
554 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.h260 auto PredBegin = GraphTraits<Inverse<BlockT *>>::child_begin(Header); in isLoopLatch()
261 auto PredEnd = GraphTraits<Inverse<BlockT *>>::child_end(Header); in isLoopLatch()
271 for (const auto Pred : children<Inverse<BlockT *>>(H)) in getNumBackEdges()
353 for (const auto Pred : children<Inverse<BlockT *>>(H)) in getLoopLatches()
H A DIntervalIterator.h87 class IGT = GraphTraits<Inverse<NodeTy *>>>
H A DRegionInfo.h268 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
687 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
H A DBlockFrequencyInfoImpl.h860 using Predecessor = GraphTraits<Inverse<const BlockT *>>;
1549 for (const BlockT *DstBB : children<Inverse<const BlockT *>>(SrcBB)) {
H A DMemorySSA.h1195 template <> struct GraphTraits<Inverse<MemoryAccess *>> {
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineFunction.h1322 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1323 public GraphTraits<Inverse<MachineBasicBlock*>> {
1324 static NodeRef getEntryNode(Inverse<MachineFunction *> G) {
1328 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1329 public GraphTraits<Inverse<const MachineBasicBlock*>> {
1330 static NodeRef getEntryNode(Inverse<const MachineFunction *> G) {
H A DMachineBasicBlock.h1185 template <> struct GraphTraits<Inverse<MachineBasicBlock*>> {
1189 static NodeRef getEntryNode(Inverse<MachineBasicBlock *> G) {
1197 template <> struct GraphTraits<Inverse<const MachineBasicBlock*>> {
1201 static NodeRef getEntryNode(Inverse<const MachineBasicBlock *> G) {
/llvm-project-15.0.7/bolt/lib/Passes/
H A DMCF.cpp93 void updateEdgeWeight<Inverse<BinaryBasicBlock *>>(EdgeWeightMap &EdgeWeights, in updateEdgeWeight()
104 typedef GraphTraits<Inverse<NodeT>> InvTraits; in computeEdgeWeights()
449 computeEdgeWeights<Inverse<BinaryBasicBlock *>>(BF, PredEdgeWeights); in estimateEdgeCounts()
/llvm-project-15.0.7/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<const ::clang::CFGBlock *>> {
1523 static NodeRef getEntryNode(Inverse<const ::clang::CFGBlock *> G) {
1562 template <> struct GraphTraits<Inverse< ::clang::CFG *>>
1563 : public GraphTraits<Inverse< ::clang::CFGBlock *>> {
1571 template <> struct GraphTraits<Inverse<const ::clang::CFG *>>
1572 : public GraphTraits<Inverse<const ::clang::CFGBlock *>> {
/llvm-project-15.0.7/clang/unittests/Format/
H A DDefinitionBlockSeparatorTest.cpp47 bool Inverse = true) { in _verifyFormat() argument
57 if (Inverse) { in _verifyFormat()
/llvm-project-15.0.7/bolt/include/bolt/Core/
H A DBinaryBasicBlock.h1007 template <> struct GraphTraits<Inverse<bolt::BinaryBasicBlock *>> {
1010 static NodeRef getEntryNode(Inverse<bolt::BinaryBasicBlock *> G) {
1019 template <> struct GraphTraits<Inverse<const bolt::BinaryBasicBlock *>> {
1022 static NodeRef getEntryNode(Inverse<const bolt::BinaryBasicBlock *> G) {
H A DBinaryFunction.h2367 struct GraphTraits<Inverse<bolt::BinaryFunction *>>
2368 : public GraphTraits<Inverse<bolt::BinaryBasicBlock *>> {
2369 static NodeRef getEntryNode(Inverse<bolt::BinaryFunction *> G) {
2375 struct GraphTraits<Inverse<const bolt::BinaryFunction *>>
2376 : public GraphTraits<Inverse<const bolt::BinaryBasicBlock *>> {
2377 static NodeRef getEntryNode(Inverse<const bolt::BinaryFunction *> G) {
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DCFGDiff.h137 std::conditional_t<InverseEdge, Inverse<NodePtr>, NodePtr>; in getChildren()
H A DGenericIteratedDominanceFrontier.h60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
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)) {
/llvm-project-15.0.7/mlir/test/Dialect/Linalg/
H A Dtransform-tile-and-fuse.mlir62 // Inverse the order of the payload ops passed to the tile_to_foreach_thread_op
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DVPlan.h2283 template <> struct GraphTraits<Inverse<VPBlockBase *>> {
2287 static NodeRef getEntryNode(Inverse<NodeRef> B) { return B.Graph; }
2343 struct GraphTraits<Inverse<VPRegionBlock *>>
2344 : public GraphTraits<Inverse<VPBlockBase *>> {
2348 static NodeRef getEntryNode(Inverse<GraphRef> N) {
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DScalarEvolution.cpp11162 auto ProveViaCond = [&](const Value *Condition, bool Inverse) { in isBasicBlockEntryGuardedByCond() argument
11164 if (isImpliedCond(Pred, LHS, RHS, Condition, Inverse, CtxI)) in isBasicBlockEntryGuardedByCond()
11168 return isImpliedCond(P, LHS, RHS, Condition, Inverse, CtxI); in isBasicBlockEntryGuardedByCond()
11248 ConstantInt::getBool(FoundCondValue->getContext(), Inverse)) in isImpliedCond()
11260 if (!Inverse) in isImpliedCond()
11261 return isImpliedCond(Pred, LHS, RHS, Op0, Inverse, CtxI) || in isImpliedCond()
11262 isImpliedCond(Pred, LHS, RHS, Op1, Inverse, CtxI); in isImpliedCond()
11264 if (Inverse) in isImpliedCond()
11265 return isImpliedCond(Pred, LHS, RHS, Op0, Inverse, CtxI) || in isImpliedCond()
11266 isImpliedCond(Pred, LHS, RHS, Op1, Inverse, CtxI); in isImpliedCond()
[all …]

12