2513                           const EdgeInfo &UserTreeIdx,  in newTreeEntry()  argument
2518     return newTreeEntry(VL, EntryState, Bundle, S, UserTreeIdx,  in newTreeEntry()
2526                           const EdgeInfo &UserTreeIdx,  in newTreeEntry()  argument
2579     if (UserTreeIdx.UserTE)  in newTreeEntry()
2580       Last->UserTreeIndices.push_back(UserTreeIdx);  in newTreeEntry()
4551                             const EdgeInfo &UserTreeIdx) {  in buildTree_rec()  argument
4557                                 &UserTreeIdx,  in buildTree_rec()
4586         newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);  in buildTree_rec()
4610       newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4621       newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4630     newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);  in buildTree_rec()
4637       newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);  in buildTree_rec()
4700       UserTreeIdx.UserTE &&  in buildTree_rec()
4701       UserTreeIdx.UserTE->State == TreeEntry::ScatterVectorize;  in buildTree_rec()
4716        sortPtrAccesses(VL, UserTreeIdx.UserTE->getMainOp()->getType(), *DL, *SE,  in buildTree_rec()
4725       newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4739         newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);  in buildTree_rec()
4751         newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4757     E->UserTreeIndices.push_back(UserTreeIdx);  in buildTree_rec()
4771         newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4783           newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4793       UserTreeIdx.UserTE &&  in buildTree_rec()
4794       UserTreeIdx.UserTE->State == TreeEntry::ScatterVectorize) {  in buildTree_rec()
4814     newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);  in buildTree_rec()
4823     newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);  in buildTree_rec()
4847     newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4867             newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4874           newTreeEntry(VL, Bundle, S, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
4904         newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4924         newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4934       newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
4956         newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx);  in buildTree_rec()
4981       TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5011           TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5017           TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5026                           UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
5033         newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5068           newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5075       TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5101           newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5109       TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5157       TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5193           newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5211           newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5233           newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5239       TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5301         newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5316           newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5346                                          UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
5353                 newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5364       newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5382         newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5401           newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5414               newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5429           newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5437       TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5460         newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5465       TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx,  in buildTree_rec()
5526       newTreeEntry(VL, None /*not vectorized*/, S, UserTreeIdx,  in buildTree_rec()