Home
last modified time | relevance | path

Searched refs:EdgeIdx (Results 1 – 3 of 3) sorted by relevance

/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp262 for (uint64_t EdgeIdx = 0; EdgeIdx < Edges[Src].size(); EdgeIdx++) { in findAugmentingPath() local
263 auto &Edge = Edges[Src][EdgeIdx]; in findAugmentingPath()
271 Nodes[Dst].ParentEdgeIndex = EdgeIdx; in findAugmentingPath()
335 auto EdgeIdx = Stack.top().second; in findAugmentingDAG() local
338 if (EdgeIdx < Edges[NodeIdx].size()) { in findAugmentingDAG()
339 auto &Edge = Edges[NodeIdx][EdgeIdx]; in findAugmentingDAG()
/llvm-project-15.0.7/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp291 for (unsigned EdgeIdx : Leaf.untested_edges()) in runStep() local
292 PrintNote("Edge " + llvm::to_string(*Leaf.getEdge(EdgeIdx))); in runStep()
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp1032 EdgeInfo(TreeEntry *UserTE, unsigned EdgeIdx) in EdgeInfo()
1033 : UserTE(UserTE), EdgeIdx(EdgeIdx) {} in EdgeInfo()
1037 unsigned EdgeIdx = UINT_MAX; member
1047 << " EdgeIdx:" << EdgeIdx << "}"; in dump()
3956 return EI.UserTE == UserTE && EI.EdgeIdx == I; in canReorderOperands()
4023 It->second.emplace_back(EI.EdgeIdx, TE); in reorderBottomToTop()