Searched refs:max_n (Results 1 – 8 of 8) sorted by relevance
240 unsigned long max_n = 0; in glob_range() local273 max_n = strtoul(pattern, &endp, 10); in glob_range()299 (min_n == max_n && step_n != 1) || in glob_range()300 (min_n != max_n && (min_n > max_n || step_n > (max_n - min_n)))) in glob_range()307 pat->content.NumRange.max_n = max_n; in glob_range()310 if(multiply(amount, ((pat->content.NumRange.max_n - in glob_range()545 if(pat->content.NumRange.ptr_n > pat->content.NumRange.max_n) { in glob_next_url()
50 unsigned long max_n; member
185 const int max_n = 32; in clock_set_pll5() local198 if (clk > 24000000 * k * max_n / m) { in clock_set_pll5()200 if (clk > 24000000 * k * max_n / m) in clock_set_pll5()
267 const std::int32_t max_n = 1024; in main() local272 std::uint8_t* right = new std::uint8_t[max_n * max_k]; in main()273 std::uint8_t* result = new std::uint8_t[max_m * max_n]; in main()274 float* result_float = new float[max_m * max_n]; in main()275 std::int32_t* result_i32 = new std::int32_t[max_m * max_n]; in main()
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()
52 int GetBytes(int max_n, const uint8_t** out) override;
28 virtual int GetBytes(int max_n, const uint8_t** array) = 0;
1069 const u32 max_m = 1 << 5, max_n = 1 << 10, max_p = 1 << 3, in clock_set_display_rate() local1094 if (divn >= max_n) in clock_set_display_rate()1098 if (divn + 1 < max_n && diff > cf / 2) { in clock_set_display_rate()