28 	a->size = src->size;  in array_init_array()
32 	a->data = malloc(sizeof(*src->data) * src->size);  in array_init_array()
33 	for (i = 0; i < src->size; i++) {  in array_init_array()
38 	a->sorted = malloc(sizeof(*src->sorted)   * src->size);  in array_init_array()
39 	memcpy(a->sorted, src->sorted, sizeof(*src->sorted)   * src->size);  in array_init_array()
48 		for (i = 0; i < a->size; i++) {  in array_free()
135 	for (i = a->used; i < a->size; i++) {  in array_get_unused_element()
210 	if (a->size == 0) {  in array_insert_unique()
211 		a->size   = 16;  in array_insert_unique()
212 		a->data   = malloc(sizeof(*a->data)     * a->size);  in array_insert_unique()
213 		a->sorted = malloc(sizeof(*a->sorted)   * a->size);  in array_insert_unique()
216 		for (j = a->used; j < a->size; j++) a->data[j] = NULL;  in array_insert_unique()
217 	} else if (a->size == a->used) {  in array_insert_unique()
218 		a->size  += 16;  in array_insert_unique()
219 		a->data   = realloc(a->data,   sizeof(*a->data)   * a->size);  in array_insert_unique()
220 		a->sorted = realloc(a->sorted, sizeof(*a->sorted) * a->size);  in array_insert_unique()
223 		for (j = a->used; j < a->size; j++) a->data[j] = NULL;  in array_insert_unique()