Searched refs:max_n (Results 1 – 6 of 6) sorted by relevance
199 const std::int32_t max_n = 1024; in main() local204 std::uint8_t* right = new std::uint8_t[max_n * max_k]; in main()205 std::uint8_t* result = new std::uint8_t[max_m * max_n]; in main()206 float* result_float = new float[max_m * max_n]; in main()215 for (int n = min_n; n < max_n; n += 128) { in main()225 for (int n = min_n; n < max_n; n += 128) { in main()
234 unsigned long max_n = 0; in glob_range() local261 max_n = strtoul(pattern, &endp, 10); in glob_range()282 if(!endp || (min_n > max_n) || (step_n > (max_n - min_n)) || !step_n) in glob_range()289 pat->content.NumRange.max_n = max_n; in glob_range()292 if(multiply(amount, (pat->content.NumRange.max_n - in glob_range()523 if(pat->content.NumRange.ptr_n > pat->content.NumRange.max_n) { in glob_next_url()
50 unsigned long max_n; member
213 const int max_n = (subject.length() - pattern.length() + 1); in FindFirstCharacter() local219 DCHECK_GE(max_n - pos, 0); in FindFirstCharacter()222 (max_n - pos) * sizeof(SubjectChar))); in FindFirstCharacter()227 } while (++pos < max_n); in FindFirstCharacter()
418 uptr max_n; member424 if (data->current_n == data->max_n) in dl_iterate_phdr_cb()
559 int max_val = threshold-1, max_n = 0; in icvHoughLinesProbabalistic() local587 max_n = n; in icvHoughLinesProbabalistic()597 a = -ttab[max_n*2+1]; in icvHoughLinesProbabalistic()598 b = ttab[max_n*2]; in icvHoughLinesProbabalistic()