Lines Matching defs:sublist
941 /* Memory effects: Freshly allocated element's sublist. */
1986 struct format_arg_list *sublist)
2002 newconstraint.list = sublist;
2030 struct format_arg_list *sublist)
2033 *listp = add_listtype_constraint (*listp, position, type, sublist);
2038 by sublist. */
2039 /* Memory effects: sublist is freed. The result is freshly allocated. */
2041 make_repeated_list_of_lists (struct format_arg_list *sublist)
2043 if (sublist == NULL)
2062 listlist->repeated.element[0].list = sublist;
2081 /* Memory effects: sublist is freed. The result is freshly allocated. */
2083 make_repeated_list (struct format_arg_list *sublist, unsigned int period)
2091 VERIFY_LIST (sublist);
2095 if (sublist->repeated.count == 0)
2099 if (sublist->initial.length < period)
2102 return make_union_with_empty_list (sublist);
2104 srcseg = &sublist->initial;
2111 unsigned int Lp = sublist->repeated.length;
2114 unfold_loop (sublist, m);
2119 tmp.count = sublist->initial.count + sublist->repeated.count;
2122 for (i = 0; i < sublist->initial.count; i++)
2123 tmp.element[i] = sublist->initial.element[i];
2124 for (j = 0; j < sublist->repeated.count; i++, j++)
2125 tmp.element[i] = sublist->initial.element[j];
2126 tmp.length = sublist->initial.length + sublist->repeated.length;
2784 struct format_arg_list *sublist = make_unconstrained_list ();
2786 FAT_LIST, sublist);
2787 free_list (sublist);
3157 /* Each iteration uses a new sublist. */