Searched refs:num_vals (Results 1 – 6 of 6) sorted by relevance
622 int num_vals = 0; in resolve_parallel_copy() local629 for (int i = 0; i < num_vals; ++i) { in resolve_parallel_copy()634 src_idx = num_vals++; in resolve_parallel_copy()641 for (int i = 0; i < num_vals; ++i) { in resolve_parallel_copy()653 dest_idx = num_vals++; in resolve_parallel_copy()671 for (int i = 0; i < num_vals; i++) { in resolve_parallel_copy()705 assert(num_vals < num_copies * 2); in resolve_parallel_copy()713 values[num_vals].is_ssa = false; in resolve_parallel_copy()714 values[num_vals].reg.reg = reg; in resolve_parallel_copy()716 emit_copy(&state->builder, values[b], values[num_vals]); in resolve_parallel_copy()[all …]
129 if (fl->num_vals++ > fl->max_val) in lfsr_next()224 fl->num_vals = 0; in lfsr_reset()
19 uint64_t num_vals; member
431 int num_vals = ((j + 1) * length <= test->num_values) ? length : in test_unary() local434 for (i = 0; i < num_vals; ++i) { in test_unary()439 for (i = 0; i < num_vals; ++i) { in test_unary()
916 int num_vals; /* Number of values */ in ppd_mark_option() local926 num_vals = cupsParseOptions(choice, 0, &vals); in ppd_mark_option()928 for (i = 0, val = vals; i < num_vals; i ++, val ++) in ppd_mark_option()977 cupsFreeOptions(num_vals, vals); in ppd_mark_option()
121 mean = total / fl->num_vals; in main()