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

  /src/external/gpl3/gcc/dist/gcc/
tree-vect-loop-manip.cc 3268 unsigned int lowest_vf = constant_lower_bound (vf);
3416 wi::to_wide (build_int_cst (type, lowest_vf)),
3608 epilog->nb_iterations_upper_bound -= lowest_vf;
3610 epilog->nb_iterations_likely_upper_bound -= lowest_vf;
3612 epilog->nb_iterations_estimate -= lowest_vf;
tree-vect-loop.cc 2313 unsigned lowest_vf local
2320 lowest_vf))
2325 % lowest_vf + gap);
11880 unsigned int lowest_vf = constant_lower_bound (vf); local
11972 && known_eq (lowest_vf, vf))
11976 LOOP_VINFO_INT_NITERS (loop_vinfo) / lowest_vf);
12216 bias_for_lowest += lowest_vf - min_first_active;
12227 lowest_vf) - 1
12229 lowest_vf) - 1);
12255 + bias_for_lowest, lowest_vf) -
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-vect-loop.cc 9670 unsigned int lowest_vf = constant_lower_bound (vf); local
9752 && known_eq (lowest_vf, vf))
9756 LOOP_VINFO_INT_NITERS (loop_vinfo) / lowest_vf);
9985 bias_for_lowest += lowest_vf - min_first_active;
9996 lowest_vf) - 1
9998 lowest_vf) - 1);
10024 + bias_for_lowest, lowest_vf) - 1
10026 + bias_for_lowest, lowest_vf) - 1);
tree-vect-loop-manip.cc 2748 unsigned int lowest_vf = constant_lower_bound (vf); local
2755 && known_eq (vf, lowest_vf))
2763 = eiters % lowest_vf + LOOP_VINFO_PEELING_FOR_GAPS (loop_vinfo);

Completed in 66 milliseconds