740 static Optional<unsigned> getInsertIndex(const Value *InsertInst,  in getInsertIndex()  function
4947         assert(getInsertIndex(V) != None && "Non-constant or undef index?");  in buildTree_rec()
4969         unsigned Idx = *getInsertIndex(VL[I]);  in buildTree_rec()
6177       unsigned OffsetBeg = *getInsertIndex(VL.front());  in getEntryCost()
6180         unsigned Idx = *getInsertIndex(V);  in getEntryCost()
6222         unsigned InsertIdx = *getInsertIndex(VL[PrevMask[I]]);  in getEntryCost()
6860   unsigned Idx1 = *getInsertIndex(IE1);  in areTwoInsertFromSameBuildVector()
6861   unsigned Idx2 = *getInsertIndex(IE2);  in areTwoInsertFromSameBuildVector()
6872           getInsertIndex(IE1).value_or(Idx2) == Idx2)  in areTwoInsertFromSameBuildVector()
6879           getInsertIndex(IE2).value_or(Idx1) == Idx1)  in areTwoInsertFromSameBuildVector()
6898   unsigned Idx1 = *getInsertIndex(IE1);  in isFirstInsertElement()
6899   unsigned Idx2 = *getInsertIndex(IE2);  in isFirstInsertElement()
6908         getInsertIndex(I1).value_or(Idx2) != Idx2)  in isFirstInsertElement()
6911         getInsertIndex(I2).value_or(Idx1) != Idx1)  in isFirstInsertElement()
7083         Optional<unsigned> InsertIdx = getInsertIndex(VU);  in getTreeCost()
7103                    getInsertIndex(IEBase).value_or(*InsertIdx) == *InsertIdx))  in getTreeCost()
7110                   int Idx = *getInsertIndex(IEBase);  in getTreeCost()
7959       unsigned Offset = *getInsertIndex(VL0);  in vectorizeTree()
7977         unsigned InsertIdx = *getInsertIndex(Scalar);  in vectorizeTree()
8549           Optional<unsigned> InsertIdx = getInsertIndex(VU);  in vectorizeTree()
8574                      getInsertIndex(IEBase).value_or(Idx) == Idx))  in vectorizeTree()
8580                     int IEIdx = *getInsertIndex(IEBase);  in vectorizeTree()
11534         getInsertIndex(LastInsertInst, OperandOffset);  in findBuildAggregate_rec()