Lines Matching refs:data
32 a->data = malloc(sizeof(*src->data) * src->size); in array_init_array()
34 if (src->data[i]) a->data[i] = src->data[i]->copy(src->data[i]); in array_init_array()
35 else a->data[i] = NULL; in array_init_array()
49 if (a->data[i]) a->data[i]->free(a->data[i]); in array_free()
53 if (a->data) free(a->data); in array_free()
65 a->data[i]->reset(a->data[i]); in array_reset()
78 du = a->data[a->used]; in array_pop()
79 a->data[a->used] = NULL; in array_pop()
99 …cmp = buffer_caseless_compare(key, keylen, a->data[a->sorted[pos]]->key->ptr, a->data[a->sorted[po… in array_get_index()
125 return a->data[ndx]; in array_get_element()
136 if (a->data[i] && a->data[i]->type == t) { in array_get_unused_element()
137 ds = a->data[i]; in array_get_unused_element()
140 a->data[i] = a->data[a->used]; in array_get_unused_element()
141 a->data[a->used] = NULL; in array_get_unused_element()
175 data_unset *old = a->data[ndx]; in array_replace()
176 a->data[ndx] = du; in array_replace()
195 if (a->data[ndx]->type == str->type) { in array_insert_unique()
196 str->insert_dup(a->data[ndx], str); in array_insert_unique()
212 a->data = malloc(sizeof(*a->data) * a->size); in array_insert_unique()
214 assert(a->data); in array_insert_unique()
216 for (j = a->used; j < a->size; j++) a->data[j] = NULL; in array_insert_unique()
219 a->data = realloc(a->data, sizeof(*a->data) * a->size); in array_insert_unique()
221 assert(a->data); in array_insert_unique()
223 for (j = a->used; j < a->size; j++) a->data[j] = NULL; in array_insert_unique()
229 if (a->data[ndx]) a->data[ndx]->free(a->data[ndx]); in array_insert_unique()
231 a->data[a->used++] = str; in array_insert_unique()
235 …uffer_caseless_compare(str->key->ptr, str->key->used, a->data[a->sorted[pos]]->key->ptr, a->data[a… in array_insert_unique()
264 data_unset *du = a->data[i]; in array_get_max_key_length()
283 data_unset *du = a->data[i]; in array_print()
301 data_unset *du = a->data[i]; in array_print()
314 data_unset *du = a->data[i]; in array_print()