Lines Matching defs:sublist
944 /* Memory effects: Freshly allocated element's sublist. */
2009 struct format_arg_list *sublist)
2025 newconstraint.list = sublist;
2053 struct format_arg_list *sublist)
2056 *listp = add_listtype_constraint (*listp, position, type, sublist);
2061 by sublist. */
2062 /* Memory effects: sublist is freed. The result is freshly allocated. */
2064 make_repeated_list_of_lists (struct format_arg_list *sublist)
2066 if (sublist == NULL)
2085 listlist->repeated.element[0].list = sublist;
2104 /* Memory effects: sublist is freed. The result is freshly allocated. */
2106 make_repeated_list (struct format_arg_list *sublist, unsigned int period)
2114 VERIFY_LIST (sublist);
2118 if (sublist->repeated.count == 0)
2122 if (sublist->initial.length < period)
2125 return make_union_with_empty_list (sublist);
2127 srcseg = &sublist->initial;
2134 unsigned int Lp = sublist->repeated.length;
2137 unfold_loop (sublist, m);
2142 tmp.count = sublist->initial.count + sublist->repeated.count;
2145 for (i = 0; i < sublist->initial.count; i++)
2146 tmp.element[i] = sublist->initial.element[i];
2147 for (j = 0; j < sublist->repeated.count; i++, j++)
2148 tmp.element[i] = sublist->initial.element[j];
2149 tmp.length = sublist->initial.length + sublist->repeated.length;
2802 struct format_arg_list *sublist = make_unconstrained_list ();
2804 FAT_LIST, sublist);
2805 free_list (sublist);
3154 /* Each iteration uses a new sublist. */