Searched refs:EdgeIdx (Results 1 – 2 of 2) 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()
1182 EdgeInfo(TreeEntry *UserTE, unsigned EdgeIdx) in EdgeInfo()1183 : UserTE(UserTE), EdgeIdx(EdgeIdx) {} in EdgeInfo()1187 unsigned EdgeIdx = UINT_MAX; member1197 << " EdgeIdx:" << EdgeIdx << "}"; in dump()1202 return UserTE == Other.UserTE && EdgeIdx == Other.EdgeIdx; in operator ==()2528 UserTreeIndices.front().EdgeIdx == UserEI.EdgeIdx && in isOperandGatherNode()7853 EI.EdgeIdx != 0) && in getEntryCost()9428 if (TEUseEI.UserTE == UseEI.UserTE && TEUseEI.EdgeIdx < UseEI.EdgeIdx) in isGatherShuffledSingleRegisterEntry()9440 TEUseEI.EdgeIdx < UseEI.EdgeIdx || TEUseEI.UserTE != UseEI.UserTE) && in isGatherShuffledSingleRegisterEntry()10644 unsigned EdgeIdx = E->UserTreeIndices.back().EdgeIdx; in processBuildVector() local[all …]