HomeSort by: relevance | last modified time | path
    Searched defs:niters (Results 1 - 12 of 12) sorted by relevancy

  /src/external/bsd/jemalloc/dist/test/unit/
ticker.c 69 const uint64_t niters = 100 * 1000; local
76 for (uint64_t i = 0; i < niters; i++) {
86 expect_u64_ge(total_ticks , niters * ticks * 9 / 10,
88 expect_u64_le(total_ticks , niters * ticks * 11 / 10,
  /src/external/gpl3/gcc/dist/gcc/
gimple-loop-interchange.cc 1087 /* Prepare niters for both loops. */
1126 /* Scrap niters estimation of interchanged loops. */
1810 tree niters = number_of_latch_executions (loop); local
1811 niters = analyze_scalar_evolution (loop_outer (loop), niters);
1812 if (!niters || chrec_contains_undetermined (niters))
1820 niters = instantiate_scev (loop_preheader_edge (loop2),
1821 loop_outer (loop), niters);
1822 if (!evolution_function_is_invariant_p (niters, loop2->num)
    [all...]
tree-vectorizer.cc 1906 unsigned HOST_WIDE_INT niters
1915 other_factor = niters / other_likely_vf;
1917 && niters % other_likely_vf != 0)
1920 this_factor = niters / this_likely_vf;
1922 && niters % this_likely_vf != 0)
1904 unsigned HOST_WIDE_INT niters local
tree-predcom.cc 1013 tree niters = number_of_latch_executions (m_loop); local
1015 /* Don't do store elimination if niters info is unknown because stores
1018 eliminate_store_p = (niters != NULL_TREE && niters != chrec_dont_know);
1736 /* Returns a memory reference to DR in the (NITERS + ITER)-th iteration
1741 gimple_seq *stmts, tree niters = NULL_TREE)
1761 if (niters != NULL_TREE)
1763 niters = fold_convert (ssizetype, niters);
1764 new_offset = size_binop (MULT_EXPR, DR_STEP (dr), niters);
1930 tree niters = number_of_latch_executions (loop); local
3272 tree fini, niters = number_of_latch_executions (m_loop); local
    [all...]
tree-ssa-loop-ivopts.cc 592 hash_map<edge, tree_niter_desc *> *niters; member in struct:ivopts_data
1025 if (!data->niters)
1027 data->niters = new hash_map<edge, tree_niter_desc *>;
1031 slot = data->niters->get (exit);
1048 data->niters->put (exit, desc);
1083 data->niters = NULL;
3923 " unexpected niters.\n");
4288 int64_t niters = (int64_t) avg_loop_niter (data->current_loop); local
4289 return (cost + (round_up_p ? niters - 1 : 0)) / niters;
    [all...]
tree-vect-loop.cc 1267 peeled for reasons other than niters. */
1277 try to check whether the (variable) niters is known to be
1554 required by loop niters. */
1610 If min_ni_prec is less than the precision of the current niters,
1611 we perfer to still use the niters type. Prefer to use Pmode and
2925 dump_printf (MSG_NOTE, ", niters = %wd\n",
3256 /* Niters for peeled prolog loop. */
3267 /* Niters for at least one iteration of vectorized loop. */
4533 int niters = LOOP_VINFO_INT_NITERS (loop_vinfo); local
4534 peel_iters_prologue = MIN (niters, peel_iters_prologue)
11942 tree niters = vect_build_loop_niters (loop_vinfo); local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
gimple-loop-interchange.cc 1085 /* Prepare niters for both loops. */
1124 /* Scrap niters estimation of interchanged loops. */
1808 tree niters = number_of_latch_executions (loop); local
1809 niters = analyze_scalar_evolution (loop_outer (loop), niters);
1810 if (!niters || chrec_contains_undetermined (niters))
1818 niters = instantiate_scev (loop_preheader_edge (loop2),
1819 loop_outer (loop), niters);
1820 if (!evolution_function_is_invariant_p (niters, loop2->num)
    [all...]
tree-vectorizer.cc 1873 unsigned HOST_WIDE_INT niters
1882 other_factor = niters / other_likely_vf;
1884 && niters % other_likely_vf != 0)
1887 this_factor = niters / this_likely_vf;
1889 && niters % this_likely_vf != 0)
1871 unsigned HOST_WIDE_INT niters local
tree-predcom.cc 1013 tree niters = number_of_latch_executions (m_loop); local
1015 /* Don't do store elimination if niters info is unknown because stores
1018 eliminate_store_p = (niters != NULL_TREE && niters != chrec_dont_know);
1705 /* Returns a memory reference to DR in the (NITERS + ITER)-th iteration
1710 gimple_seq *stmts, tree niters = NULL_TREE)
1730 if (niters != NULL_TREE)
1732 niters = fold_convert (ssizetype, niters);
1733 new_offset = size_binop (MULT_EXPR, DR_STEP (dr), niters);
1899 tree niters = number_of_latch_executions (loop); local
3241 tree fini, niters = number_of_latch_executions (m_loop); local
    [all...]
tree-vect-loop-manip.cc 392 RGC belongs to loop LOOP. The loop originally iterated NITERS
402 NITERS * RGC->max_nscalars_per_iter * RGC->factor
411 (NITERS + NITERS_SKIP) * RGC->max_nscalars_per_iter * RGC->factor
426 rgroup_controls *rgc, tree niters,
446 tree nitems_total = niters;
686 loop. LOOP_VINFO describes the vectorization of LOOP. NITERS is
696 loop_vec_info loop_vinfo, tree niters,
706 tree orig_niters = niters;
708 /* Type of the initial value of NITERS. */
709 tree ni_actual_type = TREE_TYPE (niters);
1940 tree niters = fold_build2 (PLUS_EXPR, type, niters_prolog, local
3068 tree niters = fold_build2 (PLUS_EXPR, TREE_TYPE (niters_vector_mult_vf), local
    [all...]
tree-ssa-loop-ivopts.cc 592 hash_map<edge, tree_niter_desc *> *niters; member in struct:ivopts_data
1025 if (!data->niters)
1027 data->niters = new hash_map<edge, tree_niter_desc *>;
1031 slot = data->niters->get (exit);
1046 data->niters->put (exit, desc);
1081 data->niters = NULL;
3882 " unexpected niters.\n");
4247 int64_t niters = (int64_t) avg_loop_niter (data->current_loop); local
4248 return (cost + (round_up_p ? niters - 1 : 0)) / niters;
    [all...]
tree-vect-loop.cc 1050 peeled for reasons other than niters. */
1060 try to check whether the (variable) niters is known to be
1163 required by loop niters. */
1216 If min_ni_prec is less than the precision of the current niters,
1217 we perfer to still use the niters type. Prefer to use Pmode and
2409 dump_printf (MSG_NOTE, ", niters = %wd\n",
2638 /* Niters for peeled prolog loop. */
2649 /* Niters for at least one iteration of vectorized loop. */
3834 int niters = LOOP_VINFO_INT_NITERS (loop_vinfo); local
3835 peel_iters_prologue = MIN (niters, peel_iters_prologue)
9731 tree niters = vect_build_loop_niters (loop_vinfo); local
    [all...]

Completed in 59 milliseconds