/third_party/gettext/gettext-tools/src/ |
D | str-list.c | 39 slp->nitems = 0; in string_list_init() 52 slp->nitems = 0; in string_list_alloc() 64 if (slp->nitems >= slp->nitems_max) in string_list_append() 74 slp->item[slp->nitems++] = xstrdup (s); in string_list_append() 86 for (j = 0; j < slp->nitems; ++j) in string_list_append_unique() 91 if (slp->nitems >= slp->nitems_max) in string_list_append_unique() 100 slp->item[slp->nitems++] = xstrdup (s); in string_list_append_unique() 110 for (j = 0; j < slp->nitems; ++j) in string_list_destroy() 123 for (j = 0; j < slp->nitems; ++j) in string_list_free() 142 for (j = 0; j < slp->nitems; ++j) in string_list_concat() [all …]
|
D | message.c | 242 for (j = 0; j < mp->comment->nitems; ++j) in message_copy() 247 for (j = 0; j < mp->comment_dot->nitems; ++j) in message_copy() 278 mlp->nitems = 0; in message_list_alloc() 293 for (j = 0; j < mlp->nitems; ++j) in message_list_free() 342 if (mlp->nitems >= mlp->nitems_max) in message_list_append() 350 mlp->item[mlp->nitems++] = mp; in message_list_append() 365 if (mlp->nitems >= mlp->nitems_max) in message_list_prepend() 373 for (j = mlp->nitems; j > 0; j--) in message_list_prepend() 376 mlp->nitems++; in message_list_prepend() 391 if (mlp->nitems >= mlp->nitems_max) in message_list_insert_at() [all …]
|
D | cldr-plural-exp.c | 59 while (ranges->nitems-- > 0) in cldr_plural_range_list_free() 60 cldr_plural_range_free (ranges->items[ranges->nitems]); in cldr_plural_range_list_free() 98 while (rules->nitems-- > 0) in cldr_plural_rule_list_free() 99 cldr_plural_rule_free (rules->items[rules->nitems]); in cldr_plural_rule_list_free() 136 for (i = 0; i < relation->ranges->nitems; i++) in eval_relation() 164 for (i = 0; i < relation->ranges->nitems; i++) in eval_relation() 322 for (i = 0; i < condition->value.relation->ranges->nitems; i++) in find_largest_number() 358 for (i = 0; i < relation->ranges->nitems; i++) in apply_condition() 389 && relation->ranges->nitems > 1) in print_relation() 391 for (i = 0; i < relation->ranges->nitems; i++) in print_relation() [all …]
|
D | write-catalog.c | 104 for (k = 0; k < mdlp->nitems; k++) in msgdomain_list_print() 108 if (!(mlp->nitems == 0 in msgdomain_list_print() 109 || (mlp->nitems == 1 && is_header (mlp->item[0])))) in msgdomain_list_print() 121 if (!output_syntax->supports_multiple_domains && mdlp->nitems > 1) in msgdomain_list_print() 138 for (k = 0; k < mdlp->nitems; k++) in msgdomain_list_print() 143 for (j = 0; j < mlp->nitems; j++) in msgdomain_list_print() 172 for (k = 0; k < mdlp->nitems; k++) in msgdomain_list_print() 177 for (j = 0; j < mlp->nitems; j++) in msgdomain_list_print() 369 for (k = 0; k < mdlp->nitems; k++) in msgdomain_list_sort_by_msgid() 373 if (mlp->nitems > 0) in msgdomain_list_sort_by_msgid() [all …]
|
D | locating-rule.c | 66 size_t nitems; member 82 size_t nitems; member 156 if (rule->doc_rules.nitems > 0) in locating_rule_match() 174 for (i = 0, target = NULL; i < rule->doc_rules.nitems; i++) in locating_rule_match() 199 for (i = 0; i < rules->nitems; i++) in locating_rule_list_locate() 269 if (rules->nitems == rules->nitems_max) in document_locating_rule_list_add() 277 memcpy (&rules->items[rules->nitems++], &rule, in document_locating_rule_list_add() 286 for (i = 0; i < rule->doc_rules.nitems; i++) in locating_rule_destroy() 355 if (rules->nitems == rules->nitems_max) in locating_rule_list_add_from_file() 362 memcpy (&rules->items[rules->nitems++], &rule, in locating_rule_list_add_from_file() [all …]
|
D | msgl-cat.c | 113 size_t nfiles = file_list->nitems; in catenate_msgdomain_list() 133 canon_charsets[n] = XNMALLOC (mdlp->nitems, const char *); in catenate_msgdomain_list() 134 for (k = 0; k < mdlp->nitems; k++) in catenate_msgdomain_list() 139 if (mlp->nitems > 0) in catenate_msgdomain_list() 141 for (j = 0; j < mlp->nitems; j++) in catenate_msgdomain_list() 224 identifications[n] = XNMALLOC (mdlp->nitems, const char *); in catenate_msgdomain_list() 225 for (k = 0; k < mdlp->nitems; k++) in catenate_msgdomain_list() 231 for (j = 0; j < mlp->nitems; j++) in catenate_msgdomain_list() 285 for (k = 0; k < mdlp->nitems; k++) in catenate_msgdomain_list() 293 for (j = 0; j < mlp->nitems; j++) in catenate_msgdomain_list() [all …]
|
D | msgcmp.c | 296 for (k = 0; k < mdlp->nitems; k++) in remove_obsoletes() 312 for (j = 0; j < refmlp->nitems; j++) in match_domain() 408 for (k = 0; k < ref->nitems; k++) in compare() 412 for (j = 0; j < mlp->nitems; j++) in compare() 448 for (k = 0; k < def->nitems; k++) in compare() 452 for (j = 0; j < mlp->nitems; j++) in compare() 493 for (k = 0; k < ref->nitems; k++) in compare() 518 for (k = 0; k < def->nitems; k++) in compare() 523 if (k > 0 || defmlp->nitems > 0) in compare() 539 for (k = 0; k < def->nitems; ++k) in compare() [all …]
|
D | msgmerge.c | 701 for (k = 0; k < mdlp->nitems; k++) in compendium() 715 for (k = 0; k < mdlp->nitems; k++) in msgdomain_list_stablesort_by_obsolete() 720 if (mlp->nitems > 0) in msgdomain_list_stablesort_by_obsolete() 722 message_ty **l1 = XNMALLOC (mlp->nitems, message_ty *); in msgdomain_list_stablesort_by_obsolete() 724 message_ty **l2 = XNMALLOC (mlp->nitems, message_ty *); in msgdomain_list_stablesort_by_obsolete() 732 for (j = 0; j < mlp->nitems; j++) in msgdomain_list_stablesort_by_obsolete() 847 for (i = 0; i < compendiums->nitems; i++) in definitions_init_comp_findex() 852 for (j = 0; j < mlp->nitems; j++) in definitions_init_comp_findex() 1319 for (j = 0; j < def->comment->nitems; ++j) in message_merge() 1326 for (j = 0; j < ref->comment_dot->nitems; ++j) in message_merge() [all …]
|
D | msgl-fsearch.c | 211 size_t count = mlp->nitems; in message_fuzzy_index_alloc() 329 if (mlp->nitems < mlp->nitems_max) in message_fuzzy_index_alloc() 331 mlp->nitems_max = mlp->nitems; in message_fuzzy_index_alloc() 353 size_t nitems; member 364 accu->nitems = 0; in mult_index_list_init() 375 size_t len1 = accu->nitems; in mult_index_list_accumulate() 448 accu->nitems = destptr - dest; in mult_index_list_accumulate() 477 if (accu->nitems > 1) in mult_index_list_sort() 478 qsort (accu->item, accu->nitems, sizeof (struct mult_index), in mult_index_list_sort() 571 count = accu.nitems; in message_fuzzy_index_search() [all …]
|
D | write-resources.c | 86 for (j = 0; j < mlp->nitems; j++) in execute_writing_input() 119 if (mlp->nitems != 0) in msgdomain_write_csharp_resources() 127 for (j = 0; j < mlp->nitems; j++) in msgdomain_write_csharp_resources() 146 for (j = 0; j < mlp->nitems; j++) in msgdomain_write_csharp_resources()
|
D | its.c | 77 size_t nitems; member 91 if (values->nitems == values->nitems_max) in its_value_list_append() 98 memcpy (&values->items[values->nitems++], &_value, in its_value_list_append() 108 for (i = 0; i < values->nitems; i++) in its_value_list_get_value() 124 for (i = 0; i < values->nitems; i++) in its_value_list_set_value() 135 if (i == values->nitems) in its_value_list_set_value() 145 for (i = 0; i < other->nitems; i++) in its_value_list_merge() 150 for (j = 0; j < values->nitems; j++) in its_value_list_merge() 163 if (j == values->nitems) in its_value_list_merge() 173 for (i = 0; i < values->nitems; i++) in its_value_list_destroy() [all …]
|
D | write-java.c | 176 unsigned int n = mlp->nitems; in compute_hashsize() 317 unsigned int n = mlp->nitems; in compute_table_items() 786 for (j = 0; j < mlp->nitems; j++) in write_java_code() 820 if (mlp->nitems > max_items_per_method) in write_java_code() 827 start_j < mlp->nitems; in write_java_code() 833 start_j, MIN (end_j, mlp->nitems)); in write_java_code() 840 if (mlp->nitems > max_items_per_method) in write_java_code() 846 start_j < mlp->nitems; in write_java_code() 852 0, mlp->nitems); in write_java_code() 864 for (j = 0; j < mlp->nitems; j++) in write_java_code() [all …]
|
D | msgl-equal.c | 122 i1 = (slp1 != NULL ? slp1->nitems : 0); in string_list_equal() 123 i2 = (slp2 != NULL ? slp2->nitems : 0); in string_list_equal() 216 i1 = mlp1->nitems; in message_list_equal() 217 i2 = mlp2->nitems; in message_list_equal() 242 i1 = mdlp1->nitems; in msgdomain_list_equal() 243 i2 = mdlp2->nitems; in msgdomain_list_equal()
|
D | msgl-ascii.c | 47 for (i = 0; i < slp->nitems; i++) in is_ascii_string_list() 95 for (j = 0; j < mlp->nitems; j++) in is_ascii_message_list() 107 for (k = 0; k < mdlp->nitems; k++) in is_ascii_msgdomain_list()
|
D | write-tcl.c | 120 for (j = 0; j < mlp->nitems; j++) in write_msg() 144 if (mlp->nitems == 0) in msgdomain_write_tcl() 153 for (j = 0; j < mlp->nitems; j++) in msgdomain_write_tcl() 172 for (j = 0; j < mlp->nitems; j++) in msgdomain_write_tcl()
|
D | x-ruby.c | 152 if (mdlp->nitems == 1 && mdlp2->nitems == 1) in extract_ruby() 158 for (j = 0; j < mlp->nitems; j++) in extract_ruby() 173 for (k = 0; k < mp2_comment_dot->nitems; k++) in extract_ruby()
|
/third_party/ffmpeg/libavcodec/ |
D | mjpegenc_huffman.c | 92 to->nitems = 0; in ff_mjpegenc_huffman_compute_bits() 93 from->nitems = 0; in ff_mjpegenc_huffman_compute_bits() 99 to->nitems = 0; in ff_mjpegenc_huffman_compute_bits() 108 while (i < size || j + 1 < from->nitems) { in ff_mjpegenc_huffman_compute_bits() 109 to->nitems++; in ff_mjpegenc_huffman_compute_bits() 110 to->item_idx[to->nitems] = to->item_idx[to->nitems - 1]; in ff_mjpegenc_huffman_compute_bits() 112 (j + 1 >= from->nitems || in ff_mjpegenc_huffman_compute_bits() 115 to->items[to->item_idx[to->nitems]++] = prob_table[i].value; in ff_mjpegenc_huffman_compute_bits() 116 to->probability[to->nitems - 1] = prob_table[i].prob; in ff_mjpegenc_huffman_compute_bits() 120 to->items[to->item_idx[to->nitems]++] = from->items[k]; in ff_mjpegenc_huffman_compute_bits() [all …]
|
D | magicyuvenc.c | 290 int nitems; ///< number of items in the list and probability ex. 4 member 313 to->nitems = 0; in magy_huffman_compute_bits() 314 from->nitems = 0; in magy_huffman_compute_bits() 320 to->nitems = 0; in magy_huffman_compute_bits() 329 while (i < size || j + 1 < from->nitems) { in magy_huffman_compute_bits() 330 to->nitems++; in magy_huffman_compute_bits() 331 to->item_idx[to->nitems] = to->item_idx[to->nitems - 1]; in magy_huffman_compute_bits() 333 (j + 1 >= from->nitems || in magy_huffman_compute_bits() 336 to->items[to->item_idx[to->nitems]++] = prob_table[i].value; in magy_huffman_compute_bits() 337 to->probability[to->nitems - 1] = prob_table[i].prob; in magy_huffman_compute_bits() [all …]
|
/third_party/curl/tests/libtest/ |
D | lib537.c | 104 rlim_t nitems, i; local 228 for(nitems = i = 1; nitems <= i; i *= 2) 229 nitems = i; 230 if(nitems > 0x7fff) 231 nitems = 0x40000; 233 num_open.rlim_max = sizeof(*memchunk) * nitems; 236 memchunk = malloc(sizeof(*memchunk) * (size_t)nitems); 239 nitems /= 2; 241 } while(nitems && !memchunk); 252 for(i = 0; i < nitems; i++) [all …]
|
D | lib518.c | 102 int nitems, i; in rlimit() local 254 for(nitems = i = 1; nitems <= i; i *= 2) in rlimit() 255 nitems = i; in rlimit() 256 if(nitems > 0x7fff) in rlimit() 257 nitems = 0x40000; in rlimit() 259 num_open.rlim_max = sizeof(*memchunk) * (size_t)nitems; in rlimit() 262 memchunk = malloc(sizeof(*memchunk) * (size_t)nitems); in rlimit() 265 nitems /= 2; in rlimit() 267 } while(nitems && !memchunk); in rlimit() 278 for(i = 0; i < nitems; i++) in rlimit()
|
/third_party/gettext/gettext-runtime/src/ |
D | envsubst.c | 311 size_t nitems; member 320 slp->nitems = 0; in string_list_init() 329 if (slp->nitems >= slp->nitems_max) in string_list_append() 339 slp->item[slp->nitems++] = s; in string_list_append() 356 if (slp->nitems > 0) in string_list_sort() 357 qsort (slp->item, slp->nitems, sizeof (slp->item[0]), cmp_string); in string_list_sort() 366 for (j = 0; j < slp->nitems; ++j) in string_list_member() 379 j2 = slp->nitems; in sorted_string_list_member() 410 for (j = 0; j < slp->nitems; ++j) in string_list_destroy()
|
/third_party/weston/tests/ |
D | xwayland-test.c | 65 unsigned long nitems, bytes; in TEST() local 87 &actual_format, &nitems, &bytes, in TEST() 97 &actual_format, &nitems, &bytes, in TEST() 100 assert(nitems); in TEST()
|
/third_party/python/Modules/_sqlite/ |
D | row.c | 110 Py_ssize_t nitems, i; in pysqlite_row_subscript() local 123 nitems = PyTuple_Size(self->description); in pysqlite_row_subscript() 125 for (i = 0; i < nitems; i++) { in pysqlite_row_subscript() 162 Py_ssize_t nitems, i; in pysqlite_row_keys() local 168 nitems = PyTuple_Size(self->description); in pysqlite_row_keys() 170 for (i = 0; i < nitems; i++) { in pysqlite_row_keys()
|
/third_party/toybox/toys/net/ |
D | netstat.c | 126 unsigned lport, rport, state, txq, rxq, num, uid, nitems; in show_ip() local 130 nitems = sscanf(toybuf, in show_ip() 137 if (nitems!=16) { in show_ip() 138 nitems = sscanf(toybuf, in show_ip() 143 if (nitems!=10) continue; in show_ip() 144 nitems = AF_INET; in show_ip() 145 } else nitems = AF_INET6; in show_ip() 152 addr2str(nitems, &laddr, lport, lip, TT.wpad, label); in show_ip() 153 addr2str(nitems, &raddr, rport, rip, TT.wpad, label); in show_ip()
|
/third_party/FreeBSD/lib/libc/gen/ |
D | fts.c | 122 size_t len, nitems; in fts_open() local 163 for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) { in fts_open() 193 if (compar && nitems > 1) in fts_open() 194 root = fts_sort(sp, root, nitems); in fts_open() 639 size_t dnamlen, len, maxlen, nitems; in fts_build() local 742 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) { in fts_build() 826 ++nitems; in fts_build() 852 if (descend && (type == BCHILD || !nitems) && in fts_build() 863 if (!nitems) { in fts_build() 870 if (sp->fts_compar && nitems > 1) in fts_build() [all …]
|