Lines Matching refs:i
132 for (uint32_t i = 0; i < sz; ++i) { in array_free_data() local
133 if (data[i]) data[i]->fn->free(data[i]); in array_free_data()
147 for (uint32_t i = 0; i < src->used; ++i) { in array_copy_array() local
148 array_insert_unique(dst, src->data[i]->fn->copy(src->data[i])); in array_copy_array()
164 for (uint32_t i = 0; i < used; ++i) { in array_reset_data_strings() local
165 data_string * const ds = data[i]; in array_reset_data_strings()
189 for (uint32_t i = 0; i < len; ++i) { in array_caseless_compare() local
190 unsigned int ca = ((unsigned char *)a)[i]; in array_caseless_compare()
191 unsigned int cb = ((unsigned char *)b)[i]; in array_caseless_compare()
331 for (uint32_t i = a->used, sz = a->size; i < sz; ++i) { in array_get_unused_element()
332 if (data[i] && data[i]->type == t) { in array_get_unused_element()
333 data_unset * const ds = data[i]; in array_get_unused_element()
336 data[i] = data[a->used]; in array_get_unused_element()
455 uint32_t i = 0; in array_replace() local
456 while (i < a->used && a->data[i] != old) ++i; in array_replace()
457 force_assert(i != a->used); in array_replace()
458 a->data[i] = entry; in array_replace()
476 for (uint32_t i = 0; i < a->used; ++i) { in array_is_vlist() local
477 data_unset *du = a->data[i]; in array_is_vlist()
484 for (uint32_t i = 0; i < a->used; ++i) { in array_is_kvany() local
485 data_unset *du = a->data[i]; in array_is_kvany()
492 for (uint32_t i = 0; i < a->used; ++i) { in array_is_kvarray() local
493 data_unset *du = a->data[i]; in array_is_kvarray()
500 for (uint32_t i = 0; i < a->used; ++i) { in array_is_kvstring() local
501 data_unset *du = a->data[i]; in array_is_kvstring()
516 for (uint32_t i = 0; i < a->used; ++i) { in array_match_key_prefix_klen() local
517 const buffer * const key = &a->data[i]->key; in array_match_key_prefix_klen()
520 return a->data[i]; in array_match_key_prefix_klen()
528 for (uint32_t i = 0; i < a->used; ++i) { in array_match_key_prefix_nc_klen() local
529 const buffer * const key = &a->data[i]->key; in array_match_key_prefix_nc_klen()
532 return a->data[i]; in array_match_key_prefix_nc_klen()
557 for (uint32_t i = 0; i < a->used; ++i) { in array_match_value_prefix() local
558 const buffer * const value = &((data_string *)a->data[i])->value; in array_match_value_prefix()
571 for (uint32_t i = 0; i < a->used; ++i) { in array_match_value_prefix_nc() local
572 const buffer * const value = &((data_string *)a->data[i])->value; in array_match_value_prefix_nc()
586 for (uint32_t i = 0; i < a->used; ++i) { in array_match_key_suffix() local
587 const buffer * const key = &a->data[i]->key; in array_match_key_suffix()
590 return a->data[i]; in array_match_key_suffix()
601 for (uint32_t i = 0; i < a->used; ++i) { in array_match_key_suffix_nc() local
602 const buffer * const key = &a->data[i]->key; in array_match_key_suffix_nc()
605 return a->data[i]; in array_match_key_suffix_nc()
616 for (uint32_t i = 0; i < a->used; ++i) { in array_match_value_suffix() local
617 const buffer * const value = &((data_string *)a->data[i])->value; in array_match_value_suffix()
631 for (uint32_t i = 0; i < a->used; ++i) { in array_match_value_suffix_nc() local
632 const buffer * const value = &((data_string *)a->data[i])->value; in array_match_value_suffix_nc()
645 for (uint32_t i = 0; i < a->used; ++i) { in array_match_path_or_ext() local
647 const buffer * const key = &a->data[i]->key; in array_match_path_or_ext()
652 return a->data[i]; in array_match_path_or_ext()