Lines Matching defs:roots
3386 vec<stmt_vec_info> roots = vNULL;
3389 roots.create (1);
3390 roots.quick_push (stmt_info);
3394 roots,
3399 roots.release ();
3433 for (unsigned i = 0; i < bb_vinfo->roots.length (); ++i)
3435 vect_location = bb_vinfo->roots[i].roots[0]->stmt;
3437 for (unsigned j = 0; j < bb_vinfo->roots[i].stmts.length (); ++j)
3438 bb_vinfo->roots[i].stmts[j]
3439 = vect_stmt_to_vectorize (bb_vinfo->roots[i].stmts[j]);
3440 if (vect_build_slp_instance (bb_vinfo, bb_vinfo->roots[i].kind,
3441 bb_vinfo->roots[i].stmts,
3442 bb_vinfo->roots[i].roots,
3445 bb_vinfo->roots[i].stmts = vNULL;
3446 bb_vinfo->roots[i].roots = vNULL;
4085 /* Elide any permutations at BB reduction roots. */
4457 roots (vNULL)
4505 for (unsigned i = 0; i < roots.length (); ++i)
4507 roots[i].stmts.release ();
4508 roots[i].roots.release ();
4510 roots.release ();
4957 /* Prune from ROOTS all stmts that are computed as part of lanes of NODE
4961 vect_slp_prune_covered_roots (slp_tree node, hash_set<stmt_vec_info> &roots,
4971 roots.remove (vect_orig_stmt (stmt));
4976 vect_slp_prune_covered_roots (child, roots, visited);
5049 hash_set<stmt_vec_info> roots;
5052 roots.add (SLP_INSTANCE_ROOT_STMTS (instance)[0]);
5053 if (!roots.is_empty ())
5057 vect_slp_prune_covered_roots (SLP_INSTANCE_TREE (instance), roots,
5061 && !roots.contains (SLP_INSTANCE_ROOT_STMTS (instance)[0]))
5670 vec<stmt_vec_info> roots = vNULL;
5671 roots.safe_push (last);
5691 roots.safe_push (last);
5695 if (roots.length () > 1)
5696 std::swap(roots[0], roots[roots.length () - 1]);
5720 roots.safe_push (bb_vinfo->lookup_stmt (def_stmt));
5733 bb_vinfo->roots.safe_push (slp_root (slp_inst_kind_ctor,
5734 stmts, roots));
5737 roots.release ();
5793 vec<stmt_vec_info> roots;
5794 roots.create (chain_stmts.length ());
5796 roots.quick_push (bb_vinfo->lookup_stmt (chain_stmts[i]));
5797 bb_vinfo->roots.safe_push (slp_root (slp_inst_kind_bb_reduc,
5798 stmts, roots));
5892 && bb_vinfo->roots.is_empty ())
Indexes created Thu Apr 02 00:23:07 UTC 2026