Searched refs:countof (Results 1 - 25 of 45) sorted by relevance

12

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/wget/src/
H A Dptimer.c139 for (i = 0; i < countof (clocks); i++)
154 if (i == countof (clocks))
H A Dhtml-url.c207 interesting_tags = make_nocase_string_hash_table (countof (known_tags));
211 for (i = 0; i < countof (known_tags); i++)
242 for (i = 0; i < countof (additional_attributes); i++)
244 for (i = 0; i < countof (tag_url_attributes); i++)
423 for (i = 0; i < countof (tag_url_attributes); i++)
447 const size_t size = countof (tag_url_attributes);
H A Dhash.c53 # ifndef countof
54 # define countof(x) (sizeof (x) / sizeof ((x)[0])) macro
227 for (i = *prime_offset; i < countof (primes); i++)
H A Dwget.h226 static char a[] = "foo"; -- countof(a) == 4 (note terminating \0)
227 int a[5] = {1, 2}; -- countof(a) == 5
228 char *a[] = { -- countof(a) == 3
231 #define countof(array) (sizeof (array) / sizeof ((array)[0])) macro
H A Dinit.c313 int lo = 0, hi = countof (commands) - 1;
815 assert (0 <= comind && ((size_t) comind) < countof (commands));
1274 int ok = decode_string (val, choices, countof (choices), place);
1386 int ok = decode_string (val, choices, countof (choices), &prefer_family);
1442 int ok = decode_string (val, choices, countof (choices), &regex_type);
1525 int ok = decode_string (val, choices, countof (choices), place);
1814 for (i = 1; i < countof(commands); ++i)
1842 for (i = 0; i < countof(test_array); ++i)
H A Dutils.c374 if (argcount < countof (saved_lengths))
388 if (argcount < countof (saved_lengths))
1560 for (i = 0; i < countof (powers); i++)
1565 if ((n / 1024) < 1024 || i == countof (powers) - 1)
2515 for (i = 0; i < countof(test_array); ++i)
2552 for (i = 0; i < countof(test_array); ++i)
H A Dmain.c335 static struct option long_options[2 * countof (option_data) + 1];
352 for (i = 0; i < countof (option_data); i++)
408 assert (o <= countof (long_options));
792 for (i = 0; i < countof (help); i++)
H A Dres.c637 for (i = 0; i < countof(test_array); ++i)
H A Durl.c952 assert (error_code >= 0 && ((size_t) error_code) < countof (parse_errors));
2283 for (i = 0; i < countof (tests); i++)
2310 for (i = 0; i < countof(test_array); ++i)
2344 for (i = 0; i < countof(test_array); ++i)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/wget/src/
H A Dptimer.c139 for (i = 0; i < countof (clocks); i++)
154 if (i == countof (clocks))
H A Dhtml-url.c207 interesting_tags = make_nocase_string_hash_table (countof (known_tags));
211 for (i = 0; i < countof (known_tags); i++)
242 for (i = 0; i < countof (additional_attributes); i++)
244 for (i = 0; i < countof (tag_url_attributes); i++)
423 for (i = 0; i < countof (tag_url_attributes); i++)
447 const size_t size = countof (tag_url_attributes);
H A Dhash.c53 # ifndef countof
54 # define countof(x) (sizeof (x) / sizeof ((x)[0])) macro
227 for (i = *prime_offset; i < countof (primes); i++)
H A Dwget.h226 static char a[] = "foo"; -- countof(a) == 4 (note terminating \0)
227 int a[5] = {1, 2}; -- countof(a) == 5
228 char *a[] = { -- countof(a) == 3
231 #define countof(array) (sizeof (array) / sizeof ((array)[0])) macro
H A Dinit.c313 int lo = 0, hi = countof (commands) - 1;
815 assert (0 <= comind && ((size_t) comind) < countof (commands));
1274 int ok = decode_string (val, choices, countof (choices), place);
1386 int ok = decode_string (val, choices, countof (choices), &prefer_family);
1442 int ok = decode_string (val, choices, countof (choices), &regex_type);
1525 int ok = decode_string (val, choices, countof (choices), place);
1814 for (i = 1; i < countof(commands); ++i)
1842 for (i = 0; i < countof(test_array); ++i)
H A Dutils.c374 if (argcount < countof (saved_lengths))
388 if (argcount < countof (saved_lengths))
1560 for (i = 0; i < countof (powers); i++)
1565 if ((n / 1024) < 1024 || i == countof (powers) - 1)
2515 for (i = 0; i < countof(test_array); ++i)
2552 for (i = 0; i < countof(test_array); ++i)
H A Dmain.c335 static struct option long_options[2 * countof (option_data) + 1];
352 for (i = 0; i < countof (option_data); i++)
408 assert (o <= countof (long_options));
792 for (i = 0; i < countof (help); i++)
H A Dres.c637 for (i = 0; i < countof(test_array); ++i)
H A Durl.c952 assert (error_code >= 0 && ((size_t) error_code) < countof (parse_errors));
2283 for (i = 0; i < countof (tests); i++)
2310 for (i = 0; i < countof(test_array); ++i)
2344 for (i = 0; i < countof(test_array); ++i)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/wget/src/
H A Dptimer.c139 for (i = 0; i < countof (clocks); i++)
154 if (i == countof (clocks))
H A Dhtml-url.c207 interesting_tags = make_nocase_string_hash_table (countof (known_tags));
211 for (i = 0; i < countof (known_tags); i++)
242 for (i = 0; i < countof (additional_attributes); i++)
244 for (i = 0; i < countof (tag_url_attributes); i++)
423 for (i = 0; i < countof (tag_url_attributes); i++)
447 const size_t size = countof (tag_url_attributes);
H A Dhash.c53 # ifndef countof
54 # define countof(x) (sizeof (x) / sizeof ((x)[0])) macro
227 for (i = *prime_offset; i < countof (primes); i++)
H A Dwget.h226 static char a[] = "foo"; -- countof(a) == 4 (note terminating \0)
227 int a[5] = {1, 2}; -- countof(a) == 5
228 char *a[] = { -- countof(a) == 3
231 #define countof(array) (sizeof (array) / sizeof ((array)[0])) macro
H A Dinit.c313 int lo = 0, hi = countof (commands) - 1;
815 assert (0 <= comind && ((size_t) comind) < countof (commands));
1274 int ok = decode_string (val, choices, countof (choices), place);
1386 int ok = decode_string (val, choices, countof (choices), &prefer_family);
1442 int ok = decode_string (val, choices, countof (choices), &regex_type);
1525 int ok = decode_string (val, choices, countof (choices), place);
1814 for (i = 1; i < countof(commands); ++i)
1842 for (i = 0; i < countof(test_array); ++i)
H A Dutils.c374 if (argcount < countof (saved_lengths))
388 if (argcount < countof (saved_lengths))
1560 for (i = 0; i < countof (powers); i++)
1565 if ((n / 1024) < 1024 || i == countof (powers) - 1)
2515 for (i = 0; i < countof(test_array); ++i)
2552 for (i = 0; i < countof(test_array); ++i)
H A Dmain.c335 static struct option long_options[2 * countof (option_data) + 1];
352 for (i = 0; i < countof (option_data); i++)
408 assert (o <= countof (long_options));
792 for (i = 0; i < countof (help); i++)

Completed in 249 milliseconds

12