Lines Matching refs:nelts
55 int nelts, int elt_size, int clear)
61 if (nelts < 1) {
62 nelts = 1;
66 res->elts = apr_pcalloc(p, nelts * elt_size);
69 res->elts = apr_palloc(p, nelts * elt_size);
74 res->nelts = 0; /* No active elements yet... */
75 res->nalloc = nelts; /* ...but this many allocated */
80 return ((a == NULL) || (a->nelts == 0));
84 int nelts, int elt_size)
89 make_array_core(res, p, nelts, elt_size, 1);
95 arr->nelts = 0;
104 return arr->elts + (arr->elt_size * (--arr->nelts));
109 if (arr->nelts == arr->nalloc) {
122 ++arr->nelts;
123 return arr->elts + (arr->elt_size * (arr->nelts - 1));
128 if (arr->nelts == arr->nalloc) {
139 ++arr->nelts;
140 return arr->elts + (arr->elt_size * (arr->nelts - 1));
148 if (dst->nelts + src->nelts > dst->nalloc) {
152 while (dst->nelts + src->nelts > new_size) {
163 memcpy(dst->elts + dst->nelts * elt_size, src->elts,
164 elt_size * src->nelts);
165 dst->nelts += src->nelts;
175 memcpy(res->elts, arr->elts, arr->elt_size * arr->nelts);
176 res->nelts = arr->nelts;
177 memset(res->elts + res->elt_size * res->nelts, 0,
178 res->elt_size * (res->nalloc - res->nelts));
194 res->nelts = arr->nelts;
195 res->nalloc = arr->nelts; /* Force overflow on push */
237 if (arr->nelts <= 0 || arr->elts == NULL) { /* Empty table? */
248 if (++i >= arr->nelts) {
269 if (++i >= arr->nelts) {
375 if (t->a.nelts == t->a.nalloc) {
397 return ((t == NULL) || (t->a.nelts == 0));
400 APR_DECLARE(apr_table_t *) apr_table_make(apr_pool_t *p, int nelts)
404 make_array_core(&t->a, p, nelts, sizeof(apr_table_entry_t), 0);
426 memcpy(new->a.elts, t->a.elts, t->a.nelts * sizeof(apr_table_entry_t));
427 new->a.nelts = t->a.nelts;
438 apr_table_t *new = apr_table_make(p, array->nelts);
441 for (i = 0; i < array->nelts; i++) {
455 for (i = 0; i < t->a.nelts; i++, next_elt++) {
467 t->a.nelts = 0;
512 t->index_first[hash] = t->a.nelts;
518 table_end =((apr_table_entry_t *) t->a.elts) + t->a.nelts;
535 t->a.nelts--;
565 t->index_last[hash] = t->a.nelts;
584 t->index_first[hash] = t->a.nelts;
590 table_end =((apr_table_entry_t *) t->a.elts) + t->a.nelts;
607 t->a.nelts--;
637 t->index_last[hash] = t->a.nelts;
669 t->a.nelts;
670 t->a.nelts--;
675 t->a.nelts--;
709 t->index_first[hash] = t->a.nelts;
728 t->index_last[hash] = t->a.nelts;
764 t->index_first[hash] = t->a.nelts;
783 t->index_last[hash] = t->a.nelts;
798 t->index_last[hash] = t->a.nelts;
800 t->index_first[hash] = t->a.nelts;
831 t->index_last[hash] = t->a.nelts;
833 t->index_first[hash] = t->a.nelts;
988 for (i = 0; rv && (i < t->a.nelts); ++i) {
1110 if (t->a.nelts <= 1) {
1119 apr_palloc(t->a.pool, t->a.nelts * sizeof(apr_table_entry_t*));
1122 i = t->a.nelts;
1132 sort_array = table_mergesort(t->a.pool, sort_array, t->a.nelts);
1137 sort_end = sort_array + t->a.nelts;
1195 apr_table_entry_t *last_elt = src + t->a.nelts;
1201 t->a.nelts -= (int)(last_elt - dst);
1209 const int n = t->a.nelts;
1236 if (a->a.nelts + b->a.nelts == 0) {