2309     SmallVector<EdgeInfo, 1> UserTreeIndices;  member
2489       for (const auto &EInfo : UserTreeIndices)  in dump()
2580       Last->UserTreeIndices.push_back(UserTreeIdx);  in newTreeEntry()
3280     return {N->UserTreeIndices.begin(), N->Container};  in child_begin()
3284     return {N->UserTreeIndices.end(), N->Container};  in child_end()
3771         if (UserTE->UserTreeIndices.size() != 1)  in reorderTopToBottom()
3773         if (all_of(UserTE->UserTreeIndices, [](const EdgeInfo &EI) {  in reorderTopToBottom()
3778         UserTE = UserTE->UserTreeIndices.back().UserTE;  in reorderTopToBottom()
3879           assert(all_of(TE->UserTreeIndices,  in reorderTopToBottom()
3934       if (any_of(TE->UserTreeIndices,  in canReorderOperands()
3954                    if (any_of(TE->UserTreeIndices,  in canReorderOperands()
4007           TE->UserTreeIndices.empty() || !TE->ReuseShuffleIndices.empty() ||  in reorderBottomToTop()
4008           !all_of(drop_begin(TE->UserTreeIndices),  in reorderBottomToTop()
4010                     return EI.UserTE == TE->UserTreeIndices.front().UserTE;  in reorderBottomToTop()
4018       for (EdgeInfo &EI : TE->UserTreeIndices) {  in reorderBottomToTop()
4102         for (const EdgeInfo &EI : OpTE->UserTreeIndices) {  in reorderBottomToTop()
4121                            all_of(Op.second->UserTreeIndices,  in reorderBottomToTop()
4757     E->UserTreeIndices.push_back(UserTreeIdx);  in buildTree_rec()
7882               !E->UserTreeIndices.empty()) &&  in vectorizeTree()