HomeSort by: relevance | last modified time | path
    Searched refs:SLP_TREE_LANE_PERMUTATION (Results 1 - 6 of 6) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
tree-vect-slp-patterns.cc 282 SLP_TREE_LANE_PERMUTATION (vnode) = zipped;
406 lane_permutation_t &lanes = SLP_TREE_LANE_PERMUTATION (node);
579 SLP_TREE_LANE_PERMUTATION (node).release ();
951 SLP_TREE_LANE_PERMUTATION (vnode) = perm;
1482 || SLP_TREE_LANE_PERMUTATION (node).length () % 2)
1487 unsigned l0 = SLP_TREE_LANE_PERMUTATION (node)[0].first;
1488 unsigned l1 = SLP_TREE_LANE_PERMUTATION (node)[1].first;
1510 for (unsigned i = 0; i < SLP_TREE_LANE_PERMUTATION (node).length (); ++i)
1512 std::pair<unsigned, unsigned> perm = SLP_TREE_LANE_PERMUTATION (node)[i];
1554 unsigned l0 = SLP_TREE_LANE_PERMUTATION (node)[0].first
    [all...]
tree-vect-slp.cc 119 SLP_TREE_LANE_PERMUTATION (this) = vNULL;
146 SLP_TREE_LANE_PERMUTATION (this).release ();
1823 SLP_TREE_LANE_PERMUTATION (perm) = lperm;
2039 SLP_TREE_LANE_PERMUTATION (node) = lperm;
2707 SLP_TREE_LANE_PERMUTATION (node).safe_push (std::make_pair (1, i));
2712 SLP_TREE_LANE_PERMUTATION (node).safe_push (std::make_pair (0, i));
2781 if (SLP_TREE_LANE_PERMUTATION (node).exists ())
2784 for (i = 0; i < SLP_TREE_LANE_PERMUTATION (node).length (); ++i)
2786 SLP_TREE_LANE_PERMUTATION (node)[i].first,
2787 SLP_TREE_LANE_PERMUTATION (node)[i].second)
    [all...]
tree-vectorizer.h 308 #define SLP_TREE_LANE_PERMUTATION(S) (S)->lane_permutation
  /src/external/gpl3/gcc.old/dist/gcc/
tree-vect-slp-patterns.cc 282 SLP_TREE_LANE_PERMUTATION (vnode) = zipped;
406 lane_permutation_t &lanes = SLP_TREE_LANE_PERMUTATION (node);
579 SLP_TREE_LANE_PERMUTATION (node).release ();
951 SLP_TREE_LANE_PERMUTATION (vnode) = perm;
1466 || SLP_TREE_LANE_PERMUTATION (node).length () % 2)
1471 unsigned l0 = SLP_TREE_LANE_PERMUTATION (node)[0].first;
1472 unsigned l1 = SLP_TREE_LANE_PERMUTATION (node)[1].first;
1494 for (unsigned i = 0; i < SLP_TREE_LANE_PERMUTATION (node).length (); ++i)
1496 std::pair<unsigned, unsigned> perm = SLP_TREE_LANE_PERMUTATION (node)[i];
1538 unsigned l0 = SLP_TREE_LANE_PERMUTATION (node)[0].first
    [all...]
tree-vect-slp.cc 106 SLP_TREE_LANE_PERMUTATION (this) = vNULL;
133 SLP_TREE_LANE_PERMUTATION (this).release ();
1622 SLP_TREE_LANE_PERMUTATION (perm) = lperm;
1814 SLP_TREE_LANE_PERMUTATION (node) = lperm;
2459 SLP_TREE_LANE_PERMUTATION (node).safe_push (std::make_pair (1, i));
2464 SLP_TREE_LANE_PERMUTATION (node).safe_push (std::make_pair (0, i));
2533 if (SLP_TREE_LANE_PERMUTATION (node).exists ())
2536 for (i = 0; i < SLP_TREE_LANE_PERMUTATION (node).length (); ++i)
2538 SLP_TREE_LANE_PERMUTATION (node)[i].first,
2539 SLP_TREE_LANE_PERMUTATION (node)[i].second)
    [all...]
tree-vectorizer.h 284 #define SLP_TREE_LANE_PERMUTATION(S) (S)->lane_permutation

Completed in 73 milliseconds