Searched refs:NodeIdx (Results 1 – 4 of 4) sorted by relevance
423 unsigned NodeIdx = addValue(Val, SMSNode::INVALID, SMSNode::INVALID); in insert() local427 Sparse[Idx] = NodeIdx; in insert()428 Dense[NodeIdx].Prev = NodeIdx; in insert()429 return iterator(this, NodeIdx, Idx); in insert()435 Dense[TailIdx].Next = NodeIdx; in insert()436 Dense[HeadIdx].Prev = NodeIdx; in insert()437 Dense[NodeIdx].Prev = TailIdx; in insert()439 return iterator(this, NodeIdx, Idx); in insert()
342 auto NodeIdx = Stack.top().first; in findAugmentingDAG() local346 if (EdgeIdx < Edges[NodeIdx].size()) { in findAugmentingDAG()347 auto &Edge = Edges[NodeIdx][EdgeIdx]; in findAugmentingDAG()359 Nodes[NodeIdx].Taken = true; in findAugmentingDAG()366 if (!Nodes[NodeIdx].Taken) { in findAugmentingDAG()367 Nodes[NodeIdx].Discovery = 0; in findAugmentingDAG()371 Nodes[NodeIdx].Finish = ++Time; in findAugmentingDAG()373 if (NodeIdx != Source) { in findAugmentingDAG()377 AugmentingOrder.push_back(NodeIdx); in findAugmentingDAG()
927 unsigned NodeIdx = getNodeIndexForInsert(BB);928 DomTreeNodes[NodeIdx] = std::move(Node);
3508 Value *vectorizeOperand(TreeEntry *E, unsigned NodeIdx);16960 Value *BoUpSLP::vectorizeOperand(TreeEntry *E, unsigned NodeIdx) { in vectorizeOperand() argument16961 return vectorizeTree(getOperandEntry(E, NodeIdx)); in vectorizeOperand()20504 unsigned NodeIdx = 0; in computeMinimumValueSizes() local20506 NodeIdx = 1; in computeMinimumValueSizes()20509 assert((VectorizableTree[NodeIdx]->isGather() || NodeIdx != 0 || in computeMinimumValueSizes()20510 !VectorizableTree[NodeIdx]->UserTreeIndex) && in computeMinimumValueSizes()20519 if (NodeIdx != 0 && in computeMinimumValueSizes()20520 VectorizableTree[NodeIdx]->State == TreeEntry::Vectorize && in computeMinimumValueSizes()20521 VectorizableTree[NodeIdx]->getOpcode() == Instruction::Trunc) { in computeMinimumValueSizes()[all …]