1030   struct EdgeInfo {  struct in llvm::slpvectorizer::BoUpSLP
1031     EdgeInfo() = default;
1032     EdgeInfo(TreeEntry *UserTE, unsigned EdgeIdx)  in EdgeInfo()  function
1040                                           const BoUpSLP::EdgeInfo &EI) {  in operator <<()
2132                      const EdgeInfo &EI);
2309     SmallVector<EdgeInfo, 1> UserTreeIndices;
2513                           const EdgeInfo &UserTreeIdx,  in newTreeEntry()
2526                           const EdgeInfo &UserTreeIdx,  in newTreeEntry()
3265             ChildIteratorType, SmallVector<BoUpSLP::EdgeInfo, 1>::iterator> {
3268     ChildIteratorType(SmallVector<BoUpSLP::EdgeInfo, 1>::iterator W,  in ChildIteratorType()
3773         if (all_of(UserTE->UserTreeIndices, [](const EdgeInfo &EI) {  in reorderTopToBottom()
3880                         [VF, &TE](const EdgeInfo &EI) {  in reorderTopToBottom()
3935                  [UserTE](const EdgeInfo &EI) { return EI.UserTE != UserTE; }))  in canReorderOperands()
3955                               [UserTE, I](const EdgeInfo &EI) {  in canReorderOperands()
4009                   [TE](const EdgeInfo &EI) {  in reorderBottomToTop()
4018       for (EdgeInfo &EI : TE->UserTreeIndices) {  in reorderBottomToTop()
4102         for (const EdgeInfo &EI : OpTE->UserTreeIndices) {  in reorderBottomToTop()
4122                                   [UserTE](const EdgeInfo &EI) {  in reorderBottomToTop()
4435   buildTree_rec(Roots, 0, EdgeInfo());  in buildTree()
4442   buildTree_rec(Roots, 0, EdgeInfo());  in buildTree()
4551                             const EdgeInfo &UserTreeIdx) {  in buildTree_rec()