Searched refs:sorted (Results 1 – 8 of 8) sorted by relevance
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()54 if (a->sorted) free(a->sorted); in array_free()99 …cmp = buffer_caseless_compare(key, keylen, a->data[a->sorted[pos]]->key->ptr, a->data[a->sorted[po… in array_get_index()103 ndx = a->sorted[pos]; in array_get_index()213 a->sorted = malloc(sizeof(*a->sorted) * a->size); in array_insert_unique()215 assert(a->sorted); in array_insert_unique()220 a->sorted = realloc(a->sorted, sizeof(*a->sorted) * a->size); in array_insert_unique()222 assert(a->sorted); in array_insert_unique()241 memmove(a->sorted + (pos + 1), a->sorted + (pos), (ndx - pos) * sizeof(*a->sorted)); in array_insert_unique()[all …]
94 const buffer *prefix = a->data[a->sorted[j]]->key; in SETDEFAULTS_FUNC()96 const buffer *key = a->data[a->sorted[k]]->key; in SETDEFAULTS_FUNC()105 if (a->sorted[j] < a->sorted[k]) { in SETDEFAULTS_FUNC()
36 size_t *sorted; member
857 stp = lemp->sorted[i];866 stp = lemp->sorted[i];932 stp = lemp->sorted[i];962 stp = lemp->sorted[i];1443 lem.sorted = State_arrayof();2713 stp = lemp->sorted[i];3316 stp = lemp->sorted[i];3417 stp = lemp->sorted[i];3438 stp = lemp->sorted[i];3456 stp = lemp->sorted[i];[all …]
698 data_string *ds = (data_string *)p->ssi_vars->data[p->ssi_vars->sorted[i]]; in process_ssi_stmt()706 data_string *ds = (data_string *)p->ssi_cgi_env->data[p->ssi_cgi_env->sorted[i]]; in process_ssi_stmt()
640 size_t ndx = st->sorted[i]; in mod_status_handle_server_statistics()
108 static int sorted = 0; in scan_wday() local110 if ( ! sorted ) in scan_wday()115 sorted = 1; in scan_wday()140 static int sorted = 0; in scan_mon() local142 if ( ! sorted ) in scan_mon()147 sorted = 1; in scan_mon()
252 As you can see the list is always sorted by the load field.256 and the list is sorted again.259 FastCGI proc decreases and the list is sorted again (release proc: ...)