| /freebsd-13.1/contrib/sendmail/libsm/ |
| H A D | b-strl.c | 67 long loops = LOOPS; 116 for (a = 0; a < loops; a++) 127 for (a = 0; a < loops; a++) 137 loops += loops; 138 if (loops < 0L || one > MAXTIME) 145 loops); 152 loops = LOOPS; 157 for (a = 0; a < loops; a++) 168 for (a = 0; a < loops; a++) 178 loops += loops; [all …]
|
| H A D | b-strcmp.c | 52 long loops; local 101 loops = LOOPS; 107 for (a = 0; a < loops; a++) 118 for (a = 0; a < loops; a++) 128 loops += loops; 129 if (loops < 0L || one > MAXTIME) 137 loops);
|
| /freebsd-13.1/share/examples/perfmon/ |
| H A D | perfmon.c | 54 int loops, i, sleeptime; in main() local 68 loops = 50; in main() 92 loops = getnum(optarg, 1, INT_MAX - 1); in main() 110 buf = malloc((loops + 1) * sizeof *buf); in main() 112 err(1, "malloc(%lu)", (unsigned long)(loops +1) * sizeof *buf); in main() 129 for (i = 0; i < loops; i++) { in main() 154 for (i = 1; i <= loops; i++) { in main() 158 printf("total: %f\nmean: %f\n", total, total / loops); in main()
|
| H A D | README | 12 -l n run `n' loops (default 50)
|
| /freebsd-13.1/contrib/cortex-strings/benchmarks/multi/ |
| H A D | harness.c | 277 int loops = 10000000; in main() local 298 loops = parse_int_arg(optarg, argv[0]); in main() 366 for (int i = 0; i < loops; i++) in main() 373 for (int i = 0; i < loops; i++) in main() 396 double bounced = 0.448730 * loops / 50000000; in main() 401 count, loops, src_alignment, dst_alignment, run_id, in main() 403 elapsed, loops, ptest->name, count, in main() 404 (double)loops*count/(elapsed - bounced)/(1024*1024)); in main()
|
| /freebsd-13.1/contrib/cortex-strings/scripts/ |
| H A D | bench.py | 58 def run(cache, variant, function, bytes, loops, alignment, run_id, quiet=False): argument 60 key = ':'.join('%s' % x for x in (variant, function, bytes, loops, alignment, run_id)) 113 loops = int(f / math.sqrt(max(1, mid))) 114 took = run(cache, variant, function, mid, loops, alignment, 0, 126 loops = int(f / math.sqrt(max(1, b))) 128 run(cache, variant, function, b, loops, alignment,
|
| H A D | plot.py | 47 bounces = pylab.array([(x.loops, x.rawtime) for x in r if x.test == 'bounce']) 56 bytes = r1.size * r1.loops 58 delta = pylab.polyval(fit, [r1.loops])
|
| H A D | libplot.py | 59 costs[(record.bytes, record.loops)] = record.elapsed 68 cost = costs.get((record.bytes, record.loops), None)
|
| H A D | plot-top.py | 33 vals = [match.bytes*match.loops/match.elapsed/(1024*1024) for
|
| H A D | plot-align.py | 32 vals = [match.bytes*match.loops/match.elapsed/(1024*1024) for
|
| /freebsd-13.1/contrib/netbsd-tests/net/in_cksum/ |
| H A D | in_cksum.c | 176 int loops, old_sum, off, len; in main() local 186 loops = 16; in main() 197 loops = atoi(optarg); in main() 211 for (; loops; --loops) { in main() 219 if (loops == 1) in main()
|
| /freebsd-13.1/contrib/ntp/lib/isc/ |
| H A D | hex.c | 55 unsigned int loops = 0; in isc_hex_totext() local 67 loops++; in isc_hex_totext() 69 (int)((loops + 1) * 2) >= wordlength) in isc_hex_totext() 71 loops = 0; in isc_hex_totext()
|
| H A D | base64.c | 57 unsigned int loops = 0; in isc_base64_totext() local 73 loops++; in isc_base64_totext() 75 (int)((loops + 1) * 4) >= wordlength) in isc_base64_totext() 77 loops = 0; in isc_base64_totext()
|
| H A D | base32.c | 60 unsigned int loops = 0; in base32_totext() local 107 loops++; in base32_totext() 109 (int)((loops + 1) * 8) >= wordlength) in base32_totext() 111 loops = 0; in base32_totext()
|
| /freebsd-13.1/sys/netpfil/ipfw/test/ |
| H A D | main.c | 21 int loops; member 207 for (i=0; i < c->loops; i++) { in mainloop() 258 DX(1, "done %d loops\n", c->loops); in dump() 454 c->loops = getnum(av[1], NULL, av[0]); in init() 509 if (c->loops <= 0) in init() 510 c->loops = 1; in init()
|
| /freebsd-13.1/sys/dev/sume/ |
| H A D | if_sume.c | 324 int ch, loops; in sume_intr_handler() local 347 loops = 0; in sume_intr_handler() 349 loops <= 5) { in sume_intr_handler() 401 loops++; in sume_intr_handler() 408 "%d\n", ch, vect, send->state, loops); in sume_intr_handler() 410 loops = 0; in sume_intr_handler() 412 SUME_MSI_RXDONE)) && loops < 5) { in sume_intr_handler() 521 loops++; in sume_intr_handler() 528 "%d\n", ch, vect, recv->state, loops); in sume_intr_handler()
|
| /freebsd-13.1/contrib/bmake/unit-tests/ |
| H A D | cond-func-defined.mk | 45 . info In .for loops, variable expressions for the loop variables are
|
| /freebsd-13.1/sys/dev/ioat/ |
| H A D | ioat_test.c | 366 uint32_t loops; in ioat_dma_test() local 482 for (loops = 0;; loops++) { in ioat_dma_test() 483 if (test->duration == 0 && loops >= test->transactions) in ioat_dma_test()
|
| /freebsd-13.1/usr.bin/dtc/ |
| H A D | HACKING | 29 Most iterator loops use the new loop syntax and the `auto` type for type 30 deduction. Range-based `for` loops generally improve the readability of the
|
| /freebsd-13.1/contrib/netbsd-tests/usr.bin/config/ |
| H A D | d_loop | 8 # This tests how well the code that look for orphans handle loops.
|
| /freebsd-13.1/tools/tools/syscall_timing/ |
| H A D | syscall_timing.c | 1028 uintmax_t iterations, k, loops; in main() local 1032 loops = 10; in main() 1048 loops = ll; in main() 1074 if (loops < 1) in main() 1075 loops = 1; in main() 1138 for (k = 0; k < loops; k++) { in main()
|
| /freebsd-13.1/sys/kern/ |
| H A D | subr_pctrie.c | 489 int loops = 0; in pctrie_lookup_ge() local 516 KASSERT(++loops < 1000, in pctrie_lookup_ge() 604 int loops = 0; in pctrie_lookup_le() local 634 KASSERT(++loops < 1000, in pctrie_lookup_le()
|
| /freebsd-13.1/sys/vm/ |
| H A D | vm_radix.c | 541 int loops = 0; in vm_radix_lookup_ge() local 567 KASSERT(++loops < 1000, in vm_radix_lookup_ge() 653 int loops = 0; in vm_radix_lookup_le() local 682 KASSERT(++loops < 1000, in vm_radix_lookup_le()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SpillPlacement.h | 47 const MachineLoopInfo *loops; variable
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Passes/ |
| H A D | PassRegistry.def | 159 FUNCTION_ANALYSIS("loops", LoopAnalysis()) 287 FUNCTION_PASS("print<loops>", LoopPrinterPass(dbgs())) 317 FUNCTION_PASS("verify<loops>", LoopVerifierPass()) 363 "no-keep-loops;keep-loops;"
|