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

  /src/external/gpl3/gcc/dist/gcc/
tree-vect-loop-manip.cc 526 tree nitems_step = build_int_cst (iv_type, vf); local
536 nitems_step = gimple_build (preheader_seq, MULT_EXPR, iv_type,
537 nitems_step, iv_factor);
578 index_before_incr, nitems_step);
583 create_iv (nitems_total, MINUS_EXPR, nitems_step, NULL_TREE, loop,
589 nitems_step));
592 *compare_step = nitems_step;
598 create_iv (build_int_cst (iv_type, 0), PLUS_EXPR, nitems_step, NULL_TREE, local
618 -[infinite-prec] NITEMS_STEP
625 -[sat] NITEMS_STEP
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-vect-loop-manip.cc 447 tree nitems_step = build_int_cst (iv_type, vf); local
457 nitems_step = gimple_build (preheader_seq, MULT_EXPR, iv_type,
458 nitems_step, iv_factor);
470 create_iv (build_int_cst (iv_type, 0), nitems_step, NULL_TREE, loop, local
489 -[infinite-prec] NITEMS_STEP
496 -[sat] NITEMS_STEP
498 And since NITEMS_SKIP < NITEMS_STEP, we can reassociate this as:
500 NITEMS_TOTAL -[sat] (NITEMS_STEP - NITEMS_SKIP)
506 nitems_step);
519 /* The first vector iteration can handle at most NITEMS_STEP
    [all...]

Completed in 118 milliseconds