8469   SmallVector<ShuffledInsertData> ShuffledInserts;  in vectorizeTree()  local
8556                 find_if(ShuffledInserts, [VU](const ShuffledInsertData &Data) {  in vectorizeTree()
8562             if (It == ShuffledInserts.end()) {  in vectorizeTree()
8563               (void)ShuffledInserts.emplace_back();  in vectorizeTree()
8564               It = std::next(ShuffledInserts.begin(),  in vectorizeTree()
8565                              ShuffledInserts.size() - 1);  in vectorizeTree()
8793   for (int I = 0, E = ShuffledInserts.size(); I < E; ++I) {  in vectorizeTree()
8795     sort(ShuffledInserts[I].InsertElements, isFirstInsertElement);  in vectorizeTree()
8796     InsertElementInst *FirstInsert = ShuffledInserts[I].InsertElements.front();  in vectorizeTree()
8797     InsertElementInst *LastInsert = ShuffledInserts[I].InsertElements.back();  in vectorizeTree()
8799     auto Vector = ShuffledInserts[I].ValueMasks.takeVector();  in vectorizeTree()
8826     auto It = ShuffledInserts[I].InsertElements.rbegin();  in vectorizeTree()
8829     if (It != ShuffledInserts[I].InsertElements.rend())  in vectorizeTree()
8832     while (It != ShuffledInserts[I].InsertElements.rend()) {  in vectorizeTree()
8848     for (InsertElementInst *IE : reverse(ShuffledInserts[I].InsertElements)) {  in vectorizeTree()