Searched refs:EdgeIdx (Results 1 – 3 of 3) sorted by relevance
270 for (uint64_t EdgeIdx = 0; EdgeIdx < Edges[Src].size(); EdgeIdx++) { in findAugmentingPath() local271 auto &Edge = Edges[Src][EdgeIdx]; in findAugmentingPath()279 Nodes[Dst].ParentEdgeIndex = EdgeIdx; in findAugmentingPath()343 auto EdgeIdx = Stack.top().second; in findAugmentingDAG() local346 if (EdgeIdx < Edges[NodeIdx].size()) { in findAugmentingDAG()347 auto &Edge = Edges[NodeIdx][EdgeIdx]; in findAugmentingDAG()
2104 EdgeInfo(TreeEntry *UserTE, unsigned EdgeIdx) in EdgeInfo()2105 : UserTE(UserTE), EdgeIdx(EdgeIdx) {} in EdgeInfo()2109 unsigned EdgeIdx = UINT_MAX; member2119 << " EdgeIdx:" << EdgeIdx << "}"; in dump()2124 return UserTE == Other.UserTE && EdgeIdx == Other.EdgeIdx; in operator ==()4093 S.getOpcode() == Instruction::Load && UserTreeIdx.EdgeIdx == UINT_MAX &&4102 std::make_pair(UserTreeIdx.UserTE, UserTreeIdx.EdgeIdx), Last);4190 if (UserTreeIdx.EdgeIdx != UINT_MAX || !UserTreeIdx.UserTE ||7357 TE->UserTreeIndex.EdgeIdx, Mask, MaskOrder); in reorderTopToBottom()7398 TE->UserTreeIndex.UserTE->reorderSplitNode(TE->UserTreeIndex.EdgeIdx, in reorderTopToBottom()[all …]