| /dragonfly/contrib/gcc-8.0/gcc/ |
| HD | hw-doloop.c | 38 dump_hwloops (hwloop_info loops) in dump_hwloops() argument 42 for (loop = loops; loop; loop = loop->next) in dump_hwloops() 61 for (ix = 0; loop->loops.iterate (ix, &i); ix++) in dump_hwloops() 347 hwloop_info loops = NULL; in discover_loops() local 398 loop->next = loops; in discover_loops() 399 loops = loop; in discover_loops() 417 for (loop = loops; loop; loop = loop->next) in discover_loops() 424 for (other = loops; other; other = other->next) in discover_loops() 433 loop->loops.safe_push (other); in discover_loops() 436 other->loops.safe_push (loop); in discover_loops() [all …]
|
| HD | cfgloop.h | 308 struct GTY (()) loops { struct 326 void init_loops_structure (struct function *, struct loops *, unsigned); argument 327 extern struct loops *flow_loops_find (struct loops *); 329 extern void flow_loops_free (struct loops *); 546 struct loops *loops = loops_for_fn (fn); in get_loops() local 547 if (!loops) in get_loops() 550 return loops->larray; in get_loops() 559 struct loops *loops = loops_for_fn (fn); in number_of_loops() local 560 if (!loops) in number_of_loops() 563 return vec_safe_length (loops->larray); in number_of_loops()
|
| HD | cfgloop.c | 208 flow_loops_free (struct loops *loops) in flow_loops_free() argument 210 if (loops->larray) in flow_loops_free() 216 FOR_EACH_VEC_SAFE_ELT (loops->larray, i, loop) in flow_loops_free() 224 vec_free (loops->larray); in flow_loops_free() 366 struct loops *loops, unsigned num_loops) in init_loops_structure() argument 370 memset (loops, 0, sizeof *loops); in init_loops_structure() 371 vec_alloc (loops->larray, num_loops); in init_loops_structure() 381 loops->larray->quick_push (root); in init_loops_structure() 382 loops->tree_root = root; in init_loops_structure() 422 struct loops * [all …]
|
| HD | omp-general.c | 120 struct omp_for_data_loop *loops) in omp_extract_for_data() argument 194 fd->loops = loops; in omp_extract_for_data() 196 fd->loops = &fd->loop; in omp_extract_for_data() 198 if (fd->ordered && fd->collapse == 1 && loops != NULL) in omp_extract_for_data() 200 fd->loops = loops; in omp_extract_for_data() 237 && (fd->ordered == 0 || loops == NULL)) in omp_extract_for_data() 239 else if (loops != NULL) in omp_extract_for_data() 240 loop = loops + i; in omp_extract_for_data() 395 if (fd->collapse > 1 || fd->tiling || (fd->ordered && loops)) in omp_extract_for_data() 403 else if (loops) in omp_extract_for_data() [all …]
|
| HD | omp-expand.c | 1434 const omp_for_data_loop *loop = &fd->loops[ix]; in expand_oacc_collapse_init() 1543 const omp_for_data_loop *loop = &fd->loops[ix]; in expand_oacc_collapse_vars() 1672 tree itype = TREE_TYPE (fd->loops[i].v); in expand_omp_for_init_counts() 1674 t = fold_binary (fd->loops[i].cond_code, boolean_type_node, in expand_omp_for_init_counts() 1675 fold_convert (itype, fd->loops[i].n1), in expand_omp_for_init_counts() 1676 fold_convert (itype, fd->loops[i].n2)); in expand_omp_for_init_counts() 1686 tree itype = TREE_TYPE (fd->loops[i].v); in expand_omp_for_init_counts() 1691 && ((t = fold_binary (fd->loops[i].cond_code, boolean_type_node, in expand_omp_for_init_counts() 1692 fold_convert (itype, fd->loops[i].n1), in expand_omp_for_init_counts() 1693 fold_convert (itype, fd->loops[i].n2))) in expand_omp_for_init_counts() [all …]
|
| HD | function.h | 238 struct loops *x_current_loops; 450 inline struct loops * 459 set_loops_for_fn (struct function *fn, struct loops *loops) in set_loops_for_fn() argument 461 gcc_checking_assert (fn->x_current_loops == NULL || loops == NULL); in set_loops_for_fn() 462 fn->x_current_loops = loops; in set_loops_for_fn()
|
| HD | omp-grid.c | 494 struct omp_for_data_loop *loops in grid_gfor_follows_tiling_pattern() local 497 omp_extract_for_data (gfor, &fd, loops); in grid_gfor_follows_tiling_pattern() 500 tree itype, type = TREE_TYPE (fd.loops[i].v); in grid_gfor_follows_tiling_pattern() 506 tree n1 = fold_convert (itype, fd.loops[i].n1); in grid_gfor_follows_tiling_pattern() 507 tree n2 = fold_convert (itype, fd.loops[i].n2); in grid_gfor_follows_tiling_pattern() 509 (fd.loops[i].cond_code == LT_EXPR ? -1 : 1)); in grid_gfor_follows_tiling_pattern() 510 t = fold_build2 (PLUS_EXPR, itype, fd.loops[i].step, t); in grid_gfor_follows_tiling_pattern() 513 if (TYPE_UNSIGNED (itype) && fd.loops[i].cond_code == GT_EXPR) in grid_gfor_follows_tiling_pattern() 516 fold_build1 (NEGATE_EXPR, itype, fd.loops[i].step)); in grid_gfor_follows_tiling_pattern() 518 t = fold_build2 (TRUNC_DIV_EXPR, itype, t, fd.loops[i].step); in grid_gfor_follows_tiling_pattern() [all …]
|
| /dragonfly/contrib/gcc-4.7/gcc/ |
| HD | hw-doloop.c | 44 dump_hwloops (hwloop_info loops) in dump_hwloops() argument 48 for (loop = loops; loop; loop = loop->next) in dump_hwloops() 67 for (ix = 0; VEC_iterate (hwloop_info, loop->loops, ix, i); ix++) in dump_hwloops() 356 hwloop_info loops = NULL; in discover_loops() local 406 loop->next = loops; in discover_loops() 407 loops = loop; in discover_loops() 425 for (loop = loops; loop; loop = loop->next) in discover_loops() 432 for (other = loops; other; other = other->next) in discover_loops() 441 VEC_safe_push (hwloop_info, heap, loop->loops, other); in discover_loops() 444 VEC_safe_push (hwloop_info, heap, other->loops, loop); in discover_loops() [all …]
|
| HD | loop-init.c | 45 struct loops *loops; in loop_optimizer_init() local 48 loops = ggc_alloc_cleared_loops (); in loop_optimizer_init() 52 flow_loops_find (loops); in loop_optimizer_init() 53 current_loops = loops; in loop_optimizer_init()
|
| HD | cfgloop.c | 204 flow_loops_free (struct loops *loops) in flow_loops_free() argument 206 if (loops->larray) in flow_loops_free() 212 FOR_EACH_VEC_ELT (loop_p, loops->larray, i, loop) in flow_loops_free() 220 VEC_free (loop_p, gc, loops->larray); in flow_loops_free() 350 init_loops_structure (struct loops *loops, unsigned num_loops) in init_loops_structure() argument 354 memset (loops, 0, sizeof *loops); in init_loops_structure() 355 loops->larray = VEC_alloc (loop_p, gc, num_loops); in init_loops_structure() 365 VEC_quick_push (loop_p, loops->larray, root); in init_loops_structure() 366 loops->tree_root = root; in init_loops_structure() 374 flow_loops_find (struct loops *loops) in flow_loops_find() argument [all …]
|
| HD | tree-loop-distribution.c | 560 rdg_flag_uses (struct graph *rdg, int u, bitmap partition, bitmap loops, in rdg_flag_uses() argument 576 rdg_flag_vertex_and_dependent (rdg, v, partition, loops, in rdg_flag_uses() 593 rdg_flag_vertex_and_dependent (rdg, v, partition, loops, in rdg_flag_uses() 615 rdg_flag_vertex_and_dependent (rdg, v, partition, loops, in rdg_flag_uses() 626 rdg_flag_vertex (struct graph *rdg, int v, bitmap partition, bitmap loops, in rdg_flag_vertex() argument 635 bitmap_set_bit (loops, loop->num); in rdg_flag_vertex() 649 bitmap loops, bitmap processed, in rdg_flag_vertex_and_dependent() argument 657 rdg_flag_uses (rdg, v, partition, loops, processed, part_has_writes); in rdg_flag_vertex_and_dependent() 659 rdg_flag_vertex (rdg, v, partition, loops, part_has_writes); in rdg_flag_vertex_and_dependent() 663 rdg_flag_vertex_and_dependent (rdg, x, partition, loops, processed, in rdg_flag_vertex_and_dependent() [all …]
|
| /dragonfly/sys/vm/ |
| HD | vm_pager.c | 415 int loops; in getpbuf() local 431 for (loops = BSWHSIZE; loops; --loops) { in getpbuf() 460 int loops; in getpbuf_kva() local 476 for (loops = BSWHSIZE; loops; --loops) { in getpbuf_kva() 509 int loops; in getpbuf_mem() local 525 for (loops = BSWHSIZE; loops; --loops) { in getpbuf_mem() 562 int loops; in trypbuf() local 564 for (loops = BSWHSIZE; loops; --loops) { in trypbuf() 594 int loops; in trypbuf_kva() local 596 for (loops = BSWHSIZE; loops; --loops) { in trypbuf_kva()
|
| /dragonfly/test/sysperf/ |
| HD | mbwtest.c | 22 static int bandwidth_test(char *buf, int loops, int bytes, char *msg); 30 int loops; in main() local 51 loops = 1000000LL * 1000 / 4 / us1; /* loops for 1/4 sec */ in main() 52 count1 = loops * 4096LL; in main() 54 us1 = bandwidth_test(buf, loops, 4096, NULL); /* best case timing */ in main() 144 bandwidth_test(char *buf, int loops, int bytes, char *msg) in bandwidth_test() argument 153 for (j = 0; j < loops; ++j) { in bandwidth_test() 165 us = stop_timing(msg, (long long)bytes * loops); in bandwidth_test()
|
| HD | pipe2.c | 19 int loops; in main() local 107 loops = j * 2 + 1; in main() 108 loops *= 2; in main() 112 for (j = loops; j; --j) { in main() 121 stop_timing(loops, "full duplex pipe / %dK bufs:", bytes / 1024); in main() 125 (double)loops * bytes * 1000000.0 / in main()
|
| HD | socketpair.c | 20 int loops; in main() local 107 loops = j * 2 + 1; in main() 111 for (j = loops; j; --j) { in main() 120 stop_timing(loops, "full duplex socketpair / %dK bufs:", bytes / 1024); in main() 124 (double)loops * bytes * 1000000.0 / in main()
|
| HD | memzero.c | 81 int loops; in test_using() local 89 loops = i * 2; in test_using() 91 for (i = loops - 1; i >= 0; --i) { in test_using() 97 stop_timing(loops, ctl); in test_using() 100 (double)loops * (double)bytes / (double)us); in test_using()
|
| HD | memcpy.c | 82 int loops; in test_using() local 90 loops = i * 2; in test_using() 92 for (i = loops - 1; i >= 0; --i) { in test_using() 98 stop_timing(loops, ctl); in test_using() 101 (double)loops * (double)bytes / (double)us); in test_using()
|
| HD | pipe1.c | 18 int loops; in main() local 53 loops = j; in main() 56 for (j = 0; j < loops; ++j) { in main()
|
| HD | randread.c | 44 int loops; in main() local 144 loops = 0; in main() 188 if (loops) { in main() 198 ++loops; in main()
|
| /dragonfly/contrib/gcc-4.7/gcc/doc/ |
| HD | loop.texi | 13 GCC provides extensive infrastructure for work with natural loops, i.e., 15 chapter describes representation of loops in GCC, both on GIMPLE and in 20 * Loop representation:: Representation and analysis of loops. 21 * Loop querying:: Getting information about loops. 37 This chapter describes the representation of loops in GCC, and functions 41 updated only by the optimization passes that deal with loops, but some 47 the loop. Loops with several latches may appear if several loops share 49 The representation of loops in GCC however allows only loops with a 50 single latch. During loop analysis, headers of such loops are split and 53 variables in the loops is used to determine whether the latches [all …]
|
| /dragonfly/contrib/mpc/src/ |
| HD | norm.c | 48 int loops; in mpc_norm() local 62 loops = 0; in mpc_norm() 66 loops++; in mpc_norm() 68 if (loops >= max_loops) { in mpc_norm() 92 } while (loops < max_loops && inexact != 0 in mpc_norm()
|
| HD | log.c | 30 int loops; in mpc_log() local 124 for (loops = 1; !ok && loops <= 2; loops++) { in mpc_log()
|
| /dragonfly/test/stress/webstress/ |
| HD | webstress.c | 297 int loops; in run_test() local 313 for (loops = 0; loop_count == 0 || loops < loop_count; ++loops) { in run_test() 374 if (report_interval && (loops + 1) % report_interval == 0) { in run_test() 386 loops = 0; in run_test()
|
| /dragonfly/sys/dev/drm/include/linux/ |
| HD | delay.h | 44 int loops = msecs; in mdelay() local 45 while (loops--) in mdelay()
|
| /dragonfly/sys/dev/video/bktr/ |
| HD | bktr_audio.c | 464 int auto_detect, loops; in msp_autodetect() 509 loops = 10; in msp_autodetect() 513 loops++; in msp_autodetect() 514 } while (auto_detect > 0xff && loops < 50); in msp_autodetect() 516 bktr_name(bktr), loops*10, auto_detect); in msp_autodetect()
|