119     memset(a->data+a->used, 0, (a->size-a->used)*sizeof(*a->data));  in array_extend()
138 	a->used = 0;  in array_free_data()
147 	for (uint32_t i = 0; i < src->used; ++i) {  in array_copy_array()
162 	const uint32_t used = a->used;  in array_reset_data_strings()  local
163 	a->used = 0;  in array_reset_data_strings()
164 	for (uint32_t i = 0; i < used; ++i) {  in array_reset_data_strings()
176 	force_assert(a->used != 0);
178 	a->used --;
179 	du = a->data[a->used];
180 	force_assert(a->sorted[a->used] == du); /* only works on "simple" lists */
181 	a->data[a->used] = NULL;
215     return array_keycmp(k, klen, b->ptr, b->used-1);  in array_keycmpb()
229     uint_fast32_t lower = 0, upper = a->used;  in array_get_index_ext()
263     uint_fast32_t lower = 0, upper = a->used;  in array_get_index()
270         int cmp = array_keycmp(k, klen, b->ptr, b->used-1);  in array_get_index()
301     const uint32_t last_ndx = --a->used;  in array_extract_element_klen()
323     data_unset * const du = (a->used < a->size) ? a->data[a->used] : NULL;  in array_get_unused_element()
325         a->data[a->used] = NULL;/* make empty slot at a->used for next insert */  in array_get_unused_element()
331 	for (uint32_t i = a->used, sz = a->size; i < sz; ++i) {  in array_get_unused_element()
336 			data[i] = data[a->used];  in array_get_unused_element()
337 			data[a->used] = NULL;  in array_get_unused_element()
349     if (a->used < a->size) {  in array_insert_data_at_pos()
350         data_unset * const prev = a->data[a->used];  in array_insert_data_at_pos()
358     uint_fast32_t ndx = a->used++;  in array_insert_data_at_pos()
420     data_string * const ds = array_insert_string_at_pos(a, a->used);  in array_insert_value()
432         array_insert_data_at_pos(a, entry, a->used);  in array_find_or_insert()
456     while (i < a->used && a->data[i] != old) ++i;  in array_replace()
457     force_assert(i != a->used);  in array_replace()
476 	for (uint32_t i = 0; i < a->used; ++i) {  in array_is_vlist()
484 	for (uint32_t i = 0; i < a->used; ++i) {  in array_is_kvany()
492 	for (uint32_t i = 0; i < a->used; ++i) {  in array_is_kvarray()
500 	for (uint32_t i = 0; i < a->used; ++i) {  in array_is_kvstring()
516     for (uint32_t i = 0; i < a->used; ++i) {  in array_match_key_prefix_klen()
528     for (uint32_t i = 0; i < a->used; ++i) {  in array_match_key_prefix_nc_klen()
557     for (uint32_t i = 0; i < a->used; ++i) {  in array_match_value_prefix()
571     for (uint32_t i = 0; i < a->used; ++i) {  in array_match_value_prefix_nc()
586     for (uint32_t i = 0; i < a->used; ++i) {  in array_match_key_suffix()
601     for (uint32_t i = 0; i < a->used; ++i) {  in array_match_key_suffix_nc()
616     for (uint32_t i = 0; i < a->used; ++i) {  in array_match_value_suffix()
631     for (uint32_t i = 0; i < a->used; ++i) {  in array_match_value_suffix_nc()
645     for (uint32_t i = 0; i < a->used; ++i) {  in array_match_path_or_ext()