Lines Matching refs:items
67 must have at least `len' items. Sets buf[0] to zero if the there
96 tre_ast_node_t ***items)
99 tre_ast_node_t **array = *items;
105 /* If the array is already 1024 items large, give up -- there's
111 new_items = xrealloc(array, sizeof(*items) * *max_i);
114 *items = array = new_items;
125 tre_expand_ctype(tre_mem_t mem, tre_ctype_t class, tre_ast_node_t ***items,
149 status = tre_new_item(mem, min, max, i, max_i, items);
154 status = tre_new_item(mem, min, max, i, max_i, items);
251 tre_ast_node_t ***items, int *num_items,
261 /* Build an array of the items in the bracket expression. */
337 status = tre_expand_ctype(ctx->mem, class, items,
369 status = tre_new_item(ctx->mem, min, max, &i, &max_i, items);
372 ((tre_literal_t*)((*items)[i-1])->obj)->u.class = class;
391 &i, &max_i, items);
400 &i, &max_i, items);
423 tre_ast_node_t **items, *u, *n;
429 items = xmalloc(sizeof(*items) * max_i);
430 if (items == NULL)
441 &items, &i, &max_i);
448 qsort(items, (unsigned)i, sizeof(*items), tre_compare_items);
451 /* Build a union of the items in the array, negated if necessary. */
455 tre_literal_t *l = items[j]->obj;
512 node = items[j];
515 u = tre_ast_new_union(ctx->mem, node, items[j]);
572 xfree(items);