Lines Matching defs:NodeIdx

3072   /// operand number \p NodeIdx in entry \p E.
3073   TreeEntry *getMatchedVectorizedOperand(const TreeEntry *E, unsigned NodeIdx);
3075                                                unsigned NodeIdx) const {
3076     return const_cast<BoUpSLP *>(this)->getMatchedVectorizedOperand(E, NodeIdx);
3083   Value *vectorizeOperand(TreeEntry *E, unsigned NodeIdx, bool PostponedPHIs);
14608                                                          unsigned NodeIdx) {
14609   ArrayRef<Value *> VL = E->getOperand(NodeIdx);
14621                   [E, NodeIdx](const EdgeInfo &EI) {
14622                     return EI.UserTE == E && EI.EdgeIdx == NodeIdx;
14625                   [E, NodeIdx, VE](const std::unique_ptr<TreeEntry> &TE) {
14627                                {const_cast<TreeEntry *>(E), NodeIdx}) &&
14637 Value *BoUpSLP::vectorizeOperand(TreeEntry *E, unsigned NodeIdx,
14639   ValueList &VL = E->getOperand(NodeIdx);
14641   if (TreeEntry *VE = getMatchedVectorizedOperand(E, NodeIdx)) {
14707           return EI.UserTE == E && EI.EdgeIdx == NodeIdx;
14712                    TE->UserTreeIndices.front().EdgeIdx == NodeIdx;
14724                     [E, NodeIdx](const std::unique_ptr<TreeEntry> &TE) {
14725                       return TE->isOperandGatherNode({E, NodeIdx});
18122   unsigned NodeIdx = 0;
18124     NodeIdx = 1;
18127   if (VectorizableTree[NodeIdx]->isGather() ||
18128       (NodeIdx == 0 && !VectorizableTree[NodeIdx]->UserTreeIndices.empty()) ||
18129       (NodeIdx != 0 && any_of(VectorizableTree[NodeIdx]->UserTreeIndices,
18130                               [NodeIdx](const EdgeInfo &EI) {
18131                                 return EI.UserTE->Idx > NodeIdx;
18141   if (NodeIdx != 0 &&
18142       VectorizableTree[NodeIdx]->State == TreeEntry::Vectorize &&
18143       VectorizableTree[NodeIdx]->getOpcode() == Instruction::Trunc) {
18146     RootDemotes.push_back(NodeIdx);
18148     ++NodeIdx;
18152   if (AnalyzedMinBWVals.contains(VectorizableTree[NodeIdx]->Scalars.front()))
18352   bool IsTopRoot = NodeIdx == 0;
18353   while (NodeIdx < VectorizableTree.size() &&
18354          VectorizableTree[NodeIdx]->State == TreeEntry::Vectorize &&
18355          VectorizableTree[NodeIdx]->getOpcode() == Instruction::Trunc) {
18356     RootDemotes.push_back(NodeIdx);
18357     ++NodeIdx;
18361   while (NodeIdx < VectorizableTree.size()) {
18362     ArrayRef<Value *> TreeRoot = VectorizableTree[NodeIdx]->Scalars;
18370         *VectorizableTree[NodeIdx], IsTopRoot, IsProfitableToDemoteRoot, Limit,
18396       NodeIdx = VectorizableTree.size();
18402       } while (NewIdx <= NodeIdx && !ExtraBitWidthNodes.empty());
18403       NodeIdx = NewIdx;
18405           NodeIdx < VectorizableTree.size() &&
18406           any_of(VectorizableTree[NodeIdx]->UserTreeIndices,
18413           NodeIdx < VectorizableTree.size() &&
18415               VectorizableTree[NodeIdx]->UserTreeIndices,