Searched refs:iterations (Results 1 - 25 of 47) sorted by relevance

12

/openbsd-current/usr.sbin/nsd/
H A Diterated_hash.h20 const unsigned char *in,int inlength,int iterations);
H A Diterated_hash.c26 const unsigned char *in, int inlength, int iterations)
43 assert(in && inlength > 0 && iterations >= 0);
44 for(n=0 ; n <= iterations ; ++n)
75 (void)in; (void)inlength; (void)iterations;
24 iterated_hash(unsigned char out[SHA_DIGEST_LENGTH], const unsigned char *salt, int saltlength, const unsigned char *in, int inlength, int iterations) argument
/openbsd-current/regress/sys/net/pf_trans/
H A Diocmd-limit.c45 "%s -c iocmd [-i iterations ]\n"
48 "\t-i number of iterations is 1 by default\n", progname);
75 result_DIOCGETRULES(unsigned int iterations, unsigned int limit) argument
79 * DIOCGETRULES must see EBUSY before iterations reach limit
82 rv = (iterations < limit) ? 0 : 1;
87 iterations, limit);
111 result_DIOCXEND(unsigned int iterations, unsigned int limit) argument
118 rv = (iterations < limit) ? 1 : 0;
122 "hits limit (%u)\n", iterations);
155 unsigned int iterations local
[all...]
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/compile/
H A D990527-1.c13 static int iterations, offset; variable
24 for (i = 0; i < iterations; i++)
H A D980408-1.c74 iterations; member in struct:_Image
/openbsd-current/gnu/usr.bin/gcc/gcc/
H A Ddoloop.c35 iterations to use special low-overhead looping instructions.
38 determinable number of iterations (either at compile or run-time).
44 2. The number of loop iterations is calculated and is stored
141 /* Return an estimate of the maximum number of loop iterations for the
232 number of iterations without any additional knowledge. */
400 number of loop iterations, ITERATIONS_MAX is a CONST_INT specifying
401 the maximum number of loop iterations, and DOLOOP_INSN is the
405 doloop_modify (loop, iterations, iterations_max,
408 rtx iterations;
426 if (GET_CODE (iterations)
560 rtx iterations; local
771 rtx iterations; local
[all...]
/openbsd-current/regress/sys/sys/tree/rb/
H A DMakefile5 remove-pfind node-iterations iteration-macros insert-next \
/openbsd-current/usr.bin/dig/lib/dns/rdata/generic/
H A Dnsec3param_51.c49 uint32_t iterations; local
64 iterations = uint16_fromregion(&sr);
73 snprintf(buf, sizeof(buf), "%u ", iterations);
106 /* hash(1), flags(1), iterations(2), saltlen(1) */
H A Dnsec3_50.c49 uint32_t iterations; local
69 iterations = uint16_fromregion(&sr);
71 snprintf(buf, sizeof(buf), "%u ", iterations);
/openbsd-current/gnu/llvm/clang/utils/analyzer/
H A DSATestBenchmark.py39 def __init__(self, projects: List[ProjectInfo], iterations: int,
42 self.iterations = iterations
66 for i in range(self.iterations):
/openbsd-current/gnu/llvm/libcxx/benchmarks/
H A Dformat.bench.cpp25 state.SetBytesProcessed(state.iterations() * size * sizeof(CharT));
H A Dformat_to.bench.cpp35 state.SetBytesProcessed(state.iterations() * size * sizeof(CharT));
50 state.SetBytesProcessed(state.iterations() * size * sizeof(CharT));
65 state.SetBytesProcessed(state.iterations() * size * sizeof(CharT));
78 state.SetBytesProcessed(state.iterations() * size * sizeof(CharT));
H A Dformat_to_n.bench.cpp35 state.SetBytesProcessed(state.iterations() * size * sizeof(CharT));
50 state.SetBytesProcessed(state.iterations() * size * sizeof(CharT));
65 state.SetBytesProcessed(state.iterations() * size * sizeof(CharT));
78 state.SetBytesProcessed(state.iterations() * size * sizeof(CharT));
H A Dformatted_size.bench.cpp25 state.SetBytesProcessed(state.iterations() * size * sizeof(CharT));
/openbsd-current/gnu/gcc/gcc/
H A Dloop-doloop.c39 iterations to use special low-overhead looping instructions.
42 determinable number of iterations (either at compile or run-time).
48 2. The number of loop iterations is calculated and is stored
153 describes the number of iterations of the loop. */
284 describes the loop, DESC describes the number of iterations of the
287 DOLOOP_SEQ. COUNT is the number of iterations of the LOOP. */
312 fputs (" iterations).\n", dump_file);
465 of iterations is non-negative. */
483 rtx iterations, count; local
514 /* If the estimate on number of iterations i
[all...]
/openbsd-current/gnu/llvm/compiler-rt/lib/scudo/standalone/benchmarks/
H A Dmalloc_benchmark.cpp45 State.SetBytesProcessed(uint64_t(State.iterations()) * uint64_t(NBytes));
91 State.SetBytesProcessed(uint64_t(State.iterations()) * uint64_t(NumIters) *
/openbsd-current/gnu/llvm/llvm/utils/
H A Dllvm-mca-compare.py18 iterations,
30 self.iterations = iterations
74 help="Draw plots of resource pressure per iterations for input files.",
214 print("\nITERATIONS: " + str(matrix_of_code_regions[0][0].iterations) + "\n")
409 summary.iterations += array_of_code_regions[i].iterations
421 summary.iterations = round(summary.iterations / len(array_of_code_regions), 2)
447 "Resource pressure per iterations",
[all...]
/openbsd-current/gnu/llvm/compiler-rt/lib/builtins/
H A Dfp_div_impl.inc17 // It uses 3 iterations for float32, 4 for float64 and 5 for float128,
19 // every iteration, the two modes are supported: N full-width iterations (as
131 // rep_t-sized iterations may be slower than the corresponding half-width
134 // NB: Using half-width iterations increases computation errors due to
138 // Starting with (n-1) half-width iterations
146 // Use 16-bit initial estimation in case we are using half-width iterations
179 // For half-width iterations, b_hw is used instead of b.
205 // any number of iterations, so just subtract 2 from the reciprocal
219 // For initial half-width iterations, U = 2^-HW
242 // Error estimations for full-precision iterations ar
[all...]
/openbsd-current/gnu/usr.bin/perl/lib/
H A DBenchmark.t85 # more iterations to see the time actually tick over. (You could
114 number of iterations allowed by this test by setting FAST_CPU=N
154 print "# in_threesecs=$in_threesecs iterations\n";
155 cmp_ok($in_threesecs, '>', 0, "iters returned positive iterations");
161 print "# in_threesecs_adj=$in_threesecs_adj adjusted iterations\n";
164 print "# from the 3 second run estimate $estimate iterations in 1 second...\n";
170 print "# in_onesec=$in_onesec iterations\n";
171 cmp_ok($in_onesec, '>', 0, "iters returned positive iterations");
177 print "# in_onesec_adj=$in_onesec_adj adjusted iterations\n";
187 print "# $in_again iterations\
[all...]
/openbsd-current/gnu/usr.bin/texinfo/info/
H A Decho-area.c936 int limit, iterations, max_label = 0;
965 /* How many iterations of the printing loop? */
966 iterations = (completions_found_index + (limit - 1)) / limit;
971 iterations = 1;
974 for (i = 0; i < iterations; i++)
997 l += iterations;
1027 if (calling_window->height > (iterations * 2)
1045 (compwin, -(compwin->height - (iterations + 2)));
933 int limit, iterations, max_label = 0; local
/openbsd-current/gnu/llvm/compiler-rt/lib/hwasan/
H A Dhwasan_linux.cpp320 uptr iterations = (uptr)tsd; local
321 if (iterations > 1) {
322 CHECK_EQ(0, pthread_setspecific(tsd_key, (void *)(iterations - 1)));
/openbsd-current/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp104 int iterations() const { function in class:__anon2882::DepChain
374 if (D->iterations() > HexagonVLCRIterationLim) {
377 << ".. Skipping because number of iterations > than the limit\n");
383 int Iters = D->iterations();
641 if (D->front() == I1 && D->back() == I2 && D->iterations() == Iters)
/openbsd-current/gnu/gcc/gcc/config/mcore/
H A Dlib1.asm67 // control iterations; skip across high order 0 bits in dividend
118 // control iterations; skip across high order 0 bits in dividend
155 // control iterations; skip across high order 0 bits in dividend
211 // control iterations; skip across high order 0 bits in dividend
/openbsd-current/gnu/usr.bin/gcc/gcc/config/mcore/
H A Dlib1.asm67 // control iterations; skip across high order 0 bits in dividend
118 // control iterations; skip across high order 0 bits in dividend
155 // control iterations; skip across high order 0 bits in dividend
211 // control iterations; skip across high order 0 bits in dividend
/openbsd-current/gnu/llvm/compiler-rt/lib/tsan/rtl/
H A Dtsan_interceptors_libdispatch.cpp505 TSAN_INTERCEPTOR(void, dispatch_apply, size_t iterations, argument
508 SCOPED_TSAN_INTERCEPTOR(dispatch_apply, iterations, queue, block);
524 REAL(dispatch_apply)(iterations, queue, new_block);
534 TSAN_INTERCEPTOR(void, dispatch_apply_f, size_t iterations, argument
537 SCOPED_TSAN_INTERCEPTOR(dispatch_apply_f, iterations, queue, context, work);
555 REAL(dispatch_apply_f)(iterations, queue, new_block, invoke_block_iteration);

Completed in 272 milliseconds

12