/dragonfly/contrib/wpa_supplicant/src/crypto/ |
H A D | sha1-pbkdf2.c | 15 size_t ssid_len, int iterations, unsigned int count, in pbkdf2_sha1_f() argument 45 for (i = 1; i < iterations; i++) { in pbkdf2_sha1_f() 73 int iterations, u8 *buf, size_t buflen) in pbkdf2_sha1() argument 82 if (pbkdf2_sha1_f(passphrase, ssid, ssid_len, iterations, in pbkdf2_sha1()
|
H A D | sha1.h | 26 int iterations, u8 *buf, size_t buflen);
|
/dragonfly/contrib/ldns/ldns/ |
H A D | dnssec_sign.h | 150 uint16_t iterations, 272 uint16_t iterations, 303 uint16_t iterations, 359 uint16_t iterations, 382 …e, ldns_key_list *key_list, uint8_t algorithm, uint8_t flags, uint16_t iterations, uint8_t salt_le…
|
H A D | dnssec.h | 260 uint16_t iterations, 282 ldns_rdf *ldns_nsec3_hash_name(const ldns_rdf *name, uint8_t algorithm, uint16_t iterations, uint8_… 297 uint16_t iterations, 309 uint16_t iterations,
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | tree-ssa-loop-unswitch.c | 276 HOST_WIDE_INT iterations; in tree_unswitch_single_loop() local 300 iterations = estimated_loop_iterations_int (loop); in tree_unswitch_single_loop() 301 if (iterations < 0) in tree_unswitch_single_loop() 302 iterations = likely_max_loop_iterations_int (loop); in tree_unswitch_single_loop() 303 if (iterations >= 0 && iterations <= 1) in tree_unswitch_single_loop() 506 HOST_WIDE_INT iterations; in tree_unswitch_outer_loop() local 520 iterations = estimated_loop_iterations_int (loop); in tree_unswitch_outer_loop() 521 if (iterations < 0) in tree_unswitch_outer_loop() 522 iterations = likely_max_loop_iterations_int (loop); in tree_unswitch_outer_loop() 523 if (iterations >= 0 && iterations <= 1) in tree_unswitch_outer_loop()
|
H A D | predict.def | 54 /* Use number of loop iterations determined by # of iterations 57 DEF_PREDICTOR (PRED_LOOP_ITERATIONS, "loop iterations", PROB_UNINITIALIZED, 72 /* Use number of loop iterations guessed by the contents of the loop. */ 73 DEF_PREDICTOR (PRED_LOOP_ITERATIONS_GUESSED, "guessed loop iterations", 76 /* Use number of loop iterations guessed by the contents of the loop. */ 77 DEF_PREDICTOR (PRED_LOOP_ITERATIONS_MAX, "guessed loop iterations", 148 /* Use number of loop iterations determined by # of iterations analysis
|
H A D | loop-doloop.c | 420 widest_int iterations; in doloop_modify() local 468 if (get_max_loop_iterations (loop, &iterations) in doloop_modify() 469 && wi::leu_p (iterations, in doloop_modify() 611 widest_int iterations, iterations_max; in doloop_optimize() local 665 iterations = widest_int::from (rtx_mode_t (desc->niter_expr, mode), in doloop_optimize() 668 iterations = 0; in doloop_optimize() 674 if (!targetm.can_use_doloop_p (iterations, iterations_max, level, in doloop_optimize()
|
H A D | loop-unroll.c | 353 widest_int iterations; in decide_unroll_constant_iterations() local 420 || ((get_estimated_loop_iterations (loop, &iterations) in decide_unroll_constant_iterations() 421 || get_likely_max_loop_iterations (loop, &iterations)) in decide_unroll_constant_iterations() 422 && wi::ltu_p (iterations, 2 * nunroll))) in decide_unroll_constant_iterations() 673 widest_int iterations; in decide_unroll_runtime_iterations() local 728 if ((get_estimated_loop_iterations (loop, &iterations) in decide_unroll_runtime_iterations() 729 || get_likely_max_loop_iterations (loop, &iterations)) in decide_unroll_runtime_iterations() 730 && wi::ltu_p (iterations, 2 * nunroll)) in decide_unroll_runtime_iterations() 1158 widest_int iterations; in decide_unroll_stupid() local 1214 if ((get_estimated_loop_iterations (loop, &iterations) in decide_unroll_stupid() [all …]
|
H A D | params.def | 115 "max-early-inliner-iterations", 367 "max-iterations-to-track", 368 "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates.", 373 "max-iterations-computation-cost", 417 "align-loop-iterations", 428 We need to cut the maximal predicted iterations to large enough iterations 433 "max-predicted-iterations", 434 "The maximum number of loop iterations we predict statically.", 542 "Average number of iterations of a loop.", 1140 "max-tail-merge-iterations", [all …]
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | loop-doloop.c | 602 rtx iterations, count; in doloop_optimize() local 660 iterations = desc->const_iter ? desc->niter_expr : const0_rtx; in doloop_optimize() 669 doloop_seq = gen_doloop_end (doloop_reg, iterations, iterations_max, in doloop_optimize() 687 iterations = simplify_gen_unary (ZERO_EXTEND, word_mode, in doloop_optimize() 688 iterations, mode); in doloop_optimize() 695 iterations = lowpart_subreg (word_mode, iterations, mode); in doloop_optimize() 699 doloop_seq = gen_doloop_end (doloop_reg, iterations, iterations_max, in doloop_optimize()
|
H A D | predict.def | 54 /* Use number of loop iterations determined by # of iterations 57 DEF_PREDICTOR (PRED_LOOP_ITERATIONS, "loop iterations", PROB_ALWAYS, 64 /* Use number of loop iterations guessed by the contents of the loop. */ 65 DEF_PREDICTOR (PRED_LOOP_ITERATIONS_GUESSED, "guessed loop iterations",
|
H A D | params.def | 103 /* Limit of iterations of early inliner. This basically bounds number of 107 "max-early-inliner-iterations", 327 for analysis of # of iterations of the loop tries to evaluate. */ 329 "max-iterations-to-track", 330 "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates", 335 "max-iterations-computation-cost", 373 "align-loop-iterations", 384 We need to cut the maximal predicted iterations to large enough iterations 389 "max-predicted-iterations", 390 "The maximum number of loop iterations we predict statically", [all …]
|
/dragonfly/contrib/ldns/drill/ |
H A D | dnssec.c | 304 uint32_t iterations; in ldns_nsec3_exact_match() local 341 iterations = ldns_nsec3_iterations(nsec); in ldns_nsec3_exact_match() 353 hashed_sname = ldns_nsec3_hash_name(sname, algorithm, iterations, salt_length, salt); in ldns_nsec3_exact_match() 406 uint32_t iterations; in ldns_nsec3_closest_encloser() local 436 iterations = ldns_nsec3_iterations(nsec); in ldns_nsec3_closest_encloser() 463 hashed_sname = ldns_nsec3_hash_name(sname, algorithm, iterations, salt_length, salt); in ldns_nsec3_closest_encloser()
|
/dragonfly/contrib/ldns/ |
H A D | dnssec.c | 108 uint32_t iterations; in ldns_dnssec_nsec3_closest_encloser() local 148 iterations, in ldns_dnssec_nsec3_closest_encloser() 874 uint16_t iterations, in ldns_dnssec_create_nsec3() argument 893 iterations, in ldns_dnssec_create_nsec3() 904 iterations, in ldns_dnssec_create_nsec3() 1010 uint16_t iterations, in ldns_nsec3_hash_name() argument 1110 uint16_t iterations, in ldns_nsec3_add_param_rdfs() argument 1202 iterations, in ldns_create_nsec3() 1221 iterations, in ldns_create_nsec3() 1371 uint16_t iterations; in ldns_nsec3_hash_name_frm_nsec3() local [all …]
|
H A D | dnssec_sign.c | 875 uint16_t iterations, argument 944 iterations, 1008 uint16_t iterations, argument 1013 flags, iterations, salt_length, salt, NULL); 1450 uint16_t iterations, argument 1467 uint16_t iterations, argument 1515 iterations, 1549 iterations, 1590 uint16_t iterations, argument 1596 func, arg, algorithm, flags, iterations, salt_length, salt, [all …]
|
/dragonfly/contrib/cryptsetup/luks/ |
H A D | pbkdf.c | 212 const char *salt, size_t saltLen, unsigned int iterations, in PBKDF2_HMAC() argument 216 iterations, (unsigned int)dKeyLen, dKey, 0); in PBKDF2_HMAC()
|
H A D | pbkdf.h | 10 const char *salt, size_t saltLen, unsigned int iterations,
|
/dragonfly/contrib/gcc-4.7/gcc/doc/ |
H A D | loop.texi | 17 variable analysis and number of iterations analysis). 26 * Number of iterations:: Number of iterations analysis. 259 extra iterations to make the number of iterations divisible by unroll 418 @node Number of iterations 419 @section Number of iterations analysis 420 @cindex Number of iterations analysis 424 number of iterations of a loop in GCC is defined as the number of 442 that gives number of iterations. The number of iterations is defined as 455 number of iterations -- @code{find_loop_niter} on GIMPLE and 458 repeated calls to number of iterations are not so costly -- [all …]
|
/dragonfly/contrib/file/magic/Magdir/ |
H A D | luks | 50 # mk-digest-iter; iterations parameter for master key PBKDF2 51 >164 ubelong x \b, %u MK iterations 117 #>4 ubelong x \b, %u iterations
|
/dragonfly/sys/dev/drm/amd/lib/ |
H A D | chash.c | 465 u64 iterations) in chash_self_test() argument 472 if (key_size == 4 && iterations > 0xffffffff) in chash_self_test() 484 for (add_count = 0, rmv_count = 0; add_count < iterations; in chash_self_test()
|
/dragonfly/contrib/wpa_supplicant/wpa_supplicant/ |
H A D | scan.c | 1645 scan_plan.iterations = 0; in wpa_supplicant_req_sched_scan() 2728 scan_plan.iterations = 0; in wpas_start_pno() 2895 &scan_plan->iterations); in wpas_sched_scan_plans_set() 2912 scan_plan->iterations = 0; in wpas_sched_scan_plans_set() 2916 if (!scan_plan->iterations) { in wpas_sched_scan_plans_set() 2923 if (scan_plan->iterations > in wpas_sched_scan_plans_set() 2927 num, scan_plan->iterations, in wpas_sched_scan_plans_set() 2929 scan_plan->iterations = in wpas_sched_scan_plans_set() 2935 num, scan_plan->interval, scan_plan->iterations); in wpas_sched_scan_plans_set() 2943 if (cstr_token(cmd, " ", &context) || scan_plans[num - 1].iterations) { in wpas_sched_scan_plans_set()
|
H A D | autoscan.c | 99 scan_plans[0].iterations = 0; in autoscan_init()
|
/dragonfly/contrib/wpa_supplicant/src/drivers/ |
H A D | driver_nl80211_scan.c | 451 if (scan_plans[i].iterations > in nl80211_sched_scan_add_scan_plans() 455 i, scan_plans[i].iterations); in nl80211_sched_scan_add_scan_plans() 459 if (scan_plans[i].iterations && in nl80211_sched_scan_add_scan_plans() 461 scan_plans[i].iterations)) in nl80211_sched_scan_add_scan_plans() 472 if (!scan_plans[i].iterations) in nl80211_sched_scan_add_scan_plans()
|
/dragonfly/lib/libhammer/ |
H A D | stats.c | 173 if (libhammer_stats_btree_iterations(&bstats->iterations) < 0) in libhammer_btree_stats()
|
H A D | libhammer.h | 111 int64_t iterations; member
|