707   void newTreeEntry(ArrayRef<Value *> VL, bool Vectorized, int &UserTreeIdx,  in newTreeEntry()  argument
727     if (UserTreeIdx >= 0)  in newTreeEntry()
728       Last->UserTreeIndices.push_back(UserTreeIdx);  in newTreeEntry()
729     UserTreeIdx = idx;  in newTreeEntry()
1396                             int UserTreeIdx) {  in buildTree_rec()  argument
1402     newTreeEntry(VL, false, UserTreeIdx);  in buildTree_rec()
1409     newTreeEntry(VL, false, UserTreeIdx);  in buildTree_rec()
1416       newTreeEntry(VL, false, UserTreeIdx);  in buildTree_rec()
1423     newTreeEntry(VL, false, UserTreeIdx);  in buildTree_rec()
1435       newTreeEntry(VL, false, UserTreeIdx);  in buildTree_rec()
1445       newTreeEntry(VL, false, UserTreeIdx);  in buildTree_rec()
1450     E->UserTreeIndices.push_back(UserTreeIdx);  in buildTree_rec()
1464       newTreeEntry(VL, false, UserTreeIdx);  in buildTree_rec()
1475       newTreeEntry(VL, false, UserTreeIdx);  in buildTree_rec()
1489     newTreeEntry(VL, false, UserTreeIdx);  in buildTree_rec()
1509       newTreeEntry(VL, false, UserTreeIdx);  in buildTree_rec()
1526     newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1547             newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1552       newTreeEntry(VL, true, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1562         buildTree_rec(Operands, Depth + 1, UserTreeIdx);  in buildTree_rec()
1573         newTreeEntry(VL, /*Vectorized=*/true, UserTreeIdx,  in buildTree_rec()
1590         newTreeEntry(VL, /*Vectorized=*/true, UserTreeIdx, ReuseShuffleIndicies,  in buildTree_rec()
1595       newTreeEntry(VL, /*Vectorized=*/false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1611         newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1624           newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1654             newTreeEntry(VL, /*Vectorized=*/true, UserTreeIdx,  in buildTree_rec()
1661             newTreeEntry(VL, /*Vectorized=*/true, UserTreeIdx,  in buildTree_rec()
1671       newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1691           newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1697       newTreeEntry(VL, true, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1706         buildTree_rec(Operands, Depth + 1, UserTreeIdx);  in buildTree_rec()
1720           newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1727       newTreeEntry(VL, true, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1736         buildTree_rec(Operands, Depth + 1, UserTreeIdx);  in buildTree_rec()
1759       newTreeEntry(VL, true, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1767         buildTree_rec(Left, Depth + 1, UserTreeIdx);  in buildTree_rec()
1768         buildTree_rec(Right, Depth + 1, UserTreeIdx);  in buildTree_rec()
1778         buildTree_rec(Operands, Depth + 1, UserTreeIdx);  in buildTree_rec()
1788           newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1802           newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1814           newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1819       newTreeEntry(VL, true, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1827         buildTree_rec(Operands, Depth + 1, UserTreeIdx);  in buildTree_rec()
1836           newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1841       newTreeEntry(VL, true, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1848       buildTree_rec(Operands, Depth + 1, UserTreeIdx);  in buildTree_rec()
1859         newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1873           newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1884             newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1896           newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1903       newTreeEntry(VL, true, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1911         buildTree_rec(Operands, Depth + 1, UserTreeIdx);  in buildTree_rec()
1920         newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1924       newTreeEntry(VL, true, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()
1931         buildTree_rec(Left, Depth + 1, UserTreeIdx);  in buildTree_rec()
1932         buildTree_rec(Right, Depth + 1, UserTreeIdx);  in buildTree_rec()
1942         buildTree_rec(Operands, Depth + 1, UserTreeIdx);  in buildTree_rec()
1948       newTreeEntry(VL, false, UserTreeIdx, ReuseShuffleIndicies);  in buildTree_rec()