Lines Matching defs:EdgeInfo

1659   struct EdgeInfo {
1660     EdgeInfo() = default;
1661     EdgeInfo(TreeEntry *UserTE, unsigned EdgeIdx)
1669                                           const BoUpSLP::EdgeInfo &EI) {
1680     bool operator == (const EdgeInfo &Other) const {
3003         if (is_contained(E->UserTreeIndices, EdgeInfo(UserTE, OpIdx))) {
3053                      const EdgeInfo &EI, unsigned InterleaveFactor = 0);
3251     bool isOperandGatherNode(const EdgeInfo &UserEI) const {
3338     SmallVector<EdgeInfo, 1> UserTreeIndices;
3596                           const EdgeInfo &UserTreeIdx,
3613                           const EdgeInfo &UserTreeIdx,
4451             ChildIteratorType, SmallVector<BoUpSLP::EdgeInfo, 1>::iterator> {
4454     ChildIteratorType(SmallVector<BoUpSLP::EdgeInfo, 1>::iterator W,
5684              [](const EdgeInfo &EI) {
6008         if (all_of(UserTE->UserTreeIndices, [](const EdgeInfo &EI) {
6160                         [VF, &TE](const EdgeInfo &EI) {
6172             if (all_of(TE->UserTreeIndices, [&](const EdgeInfo &EI) {
6177                            [&](const EdgeInfo &EI) {
6237                  [UserTE](const EdgeInfo &EI) { return EI.UserTE != UserTE; }))
6260                               [UserTE, I](const EdgeInfo &EI) {
6315                   [TE](const EdgeInfo &EI) {
6324       for (EdgeInfo &EI : TE->UserTreeIndices)
6409         for (const EdgeInfo &EI : OpTE->UserTreeIndices) {
6429                                   [UserTE](const EdgeInfo &EI) {
6793   buildTree_rec(Roots, 0, EdgeInfo());
6800   buildTree_rec(Roots, 0, EdgeInfo());
7348                 buildTree_rec(SubSlice, 0, EdgeInfo(), InterleaveFactor);
7403     buildTree_rec(GatheredScalars, 0, EdgeInfo());
8097                             const EdgeInfo &UserTreeIdx,
9923           buildTree_rec(Slice, 0, EdgeInfo(&E, UINT_MAX));
11024                find_if(TE->UserTreeIndices, [&](const EdgeInfo &EI) {
11182           const EdgeInfo &EI =
11183               *find_if(E->UserTreeIndices, [](const EdgeInfo &EI) {
13078   const EdgeInfo &TEUseEI = TE == VectorizableTree.front().get()
13079                                 ? EdgeInfo(const_cast<TreeEntry *>(TE), 0)
13147       const EdgeInfo &UseEI = TEPtr->UserTreeIndices.front();
14241                                              [&](const EdgeInfo &Edge) {
14621                   [E, NodeIdx](const EdgeInfo &EI) {
14706     if (find_if(VE->UserTreeIndices, [&](const EdgeInfo &EI) {
14787             return find_if(TE->UserTreeIndices, [=](const EdgeInfo &EI) {
16875                     [&](const EdgeInfo &EI) {
18130                               [NodeIdx](const EdgeInfo &EI) {
18407                  [](const EdgeInfo &EI) {
18416               [&](const EdgeInfo &EI) {