26     SortConcatItem **vals;  member
41     if (list->vals == NULL) {  in sort_concat_step()
42         list->vals = (SortConcatItem**)calloc(100, sizeof(SortConcatItem*));  in sort_concat_step()
43         if (list->vals == NULL) return;  in sort_concat_step()
49 …  list->vals = (SortConcatItem**)realloc(list->vals, sizeof(SortConcatItem*)*(list->length + 100));  in sort_concat_step()
50         if (list->vals == NULL) return;  in sort_concat_step()
54     list->vals[list->count] = (SortConcatItem*)calloc(1, sizeof(SortConcatItem));  in sort_concat_step()
55     if (list->vals[list->count] == NULL) return;  in sort_concat_step()
60     if (idx == 0 || val == NULL || sz == 0) {free(list->vals[list->count]); return;}  in sort_concat_step()
64     list->vals[list->count]->val = (unsigned char*)calloc(sz, sizeof(unsigned char));  in sort_concat_step()
65     if (list->vals[list->count]->val == NULL)  in sort_concat_step()
66         {free(list->vals[list->count]); return;}  in sort_concat_step()
67     list->vals[list->count]->index = idx;  in sort_concat_step()
68     list->vals[list->count]->length = sz;  in sort_concat_step()
69     memcpy(list->vals[list->count]->val, val, sz);  in sort_concat_step()
78         free(list->vals[i]->val);  in sort_concat_free()
79         free(list->vals[i]);  in sort_concat_free()
81     free(list->vals);  in sort_concat_free()
93         sz += list->vals[i]->length;  in sort_concat_do_finalize()
102         if (list->vals[i]->length > 0) {  in sort_concat_do_finalize()
103             memcpy(pos, list->vals[i]->val, list->vals[i]->length);  in sort_concat_do_finalize()
104             pos += list->vals[i]->length;  in sort_concat_do_finalize()
119     if (list != NULL && list->vals != NULL && list->count > 0) {  in sort_concat_finalize()
120         qsort(list->vals, list->count, sizeof(list->vals[0]), sort_concat_cmp);  in sort_concat_finalize()
134     if (list != NULL && list->vals != NULL && list->count > 0) {  in sort_concat_finalize2()
135         qsort(list->vals, list->count, sizeof(list->vals[0]), sort_concat_cmp);  in sort_concat_finalize2()
150     if (list != NULL && list->vals != NULL && list->count > 0) {  in sort_concat_finalize3()
151         qsort(list->vals, list->count, sizeof(list->vals[0]), sort_concat_cmp);  in sort_concat_finalize3()
170     IdentifiersConcatItem **vals;  member
185     if (list->vals == NULL) {  in identifiers_concat_step()
186         list->vals = (IdentifiersConcatItem**)calloc(100, sizeof(IdentifiersConcatItem*));  in identifiers_concat_step()
187         if (list->vals == NULL) return;  in identifiers_concat_step()
193 …list->vals = (IdentifiersConcatItem**)realloc(list->vals, sizeof(IdentifiersConcatItem*)*(list->le…  in identifiers_concat_step()
194         if (list->vals == NULL) return;  in identifiers_concat_step()
198     list->vals[list->count] = (IdentifiersConcatItem*)calloc(1, sizeof(IdentifiersConcatItem));  in identifiers_concat_step()
199     if (list->vals[list->count] == NULL) return;  in identifiers_concat_step()
206     list->vals[list->count]->val = (char*)calloc(len+1, sizeof(char));  in identifiers_concat_step()
207     if (list->vals[list->count]->val == NULL) return;  in identifiers_concat_step()
208     snprintf(list->vals[list->count]->val, len+1, "%s:%s", key, val);  in identifiers_concat_step()
209     list->vals[list->count]->length = len;  in identifiers_concat_step()
223     if (list == NULL || list->vals == NULL || list->count < 1) return;  in identifiers_concat_finalize()
226         sz += list->vals[i]->length;  in identifiers_concat_finalize()
235         item = list->vals[i];  in identifiers_concat_finalize()
247     free(list->vals);  in identifiers_concat_finalize()