Lines Matching defs:list1
137 static bool equal_list (const struct format_arg_list *list1,
140 (struct format_arg_list *list1,
145 (struct format_arg_list *list1,
303 equal_list (const struct format_arg_list *list1,
308 VERIFY_LIST (list1);
311 n = list1->initial.count;
316 const struct format_arg * e1 = &list1->initial.element[i];
323 n = list1->repeated.count;
328 const struct format_arg * e1 = &list1->repeated.element[i];
1123 /* Memory effects: list1 and list2 are freed. The result, if non-NULL, is
1126 make_intersected_list (struct format_arg_list *list1,
1131 VERIFY_LIST (list1);
1134 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1135 /* Step 1: Ensure list1->repeated.length == list2->repeated.length. */
1137 unsigned int n1 = list1->repeated.length;
1143 unfold_loop (list1, m1);
1145 /* Now list1->repeated.length = list2->repeated.length = lcm(n1,n2). */
1148 if (list1->repeated.length > 0 || list2->repeated.length > 0)
1150 from the initial segments of list1 and list2. If both have a
1152 list1->initial.length == list2->initial.length. */
1154 unsigned int m = MAX (list1->initial.length, list2->initial.length);
1156 if (list1->repeated.length > 0)
1157 rotate_loop (list1, m);
1162 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1164 ASSERT (list1->initial.length == list2->initial.length);
1165 ASSERT (list1->repeated.length == list2->repeated.length);
1179 /* Step 4: Elementwise intersection of list1->initial, list2->initial. */
1186 e1 = list1->initial.element; c1 = list1->initial.count;
1224 if (list1->repeated.count == 0 && list2->repeated.count == 0)
1229 /* list1 longer than list2. */
1236 /* list2 longer than list1. */
1243 else if (list1->repeated.count == 0)
1257 if ((c1 > 0 ? e1->presence : list1->repeated.element[0].presence)
1267 /* Step 5: Elementwise intersection of list1->repeated, list2->repeated. */
1274 e1 = list1->repeated.element; c1 = list1->repeated.count;
1318 free_list (list1);
1353 /* Memory effects: list1 and list2 are freed if non-NULL. The result,
1356 intersection (struct format_arg_list *list1, struct format_arg_list *list2)
1358 if (list1 != NULL)
1361 return make_intersected_list (list1, list2);
1364 free_list (list1);
1496 /* Memory effects: list1 and list2 are freed. The result is freshly
1499 make_union_list (struct format_arg_list *list1, struct format_arg_list *list2)
1503 VERIFY_LIST (list1);
1506 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1508 /* Step 1: Ensure list1->repeated.length == list2->repeated.length. */
1510 unsigned int n1 = list1->repeated.length;
1516 unfold_loop (list1, m1);
1518 /* Now list1->repeated.length = list2->repeated.length = lcm(n1,n2). */
1521 /* Step 2: Ensure that list1->initial.length == list2->initial.length. */
1523 unsigned int m = MAX (list1->initial.length, list2->initial.length);
1525 rotate_loop (list1, m);
1529 ASSERT (list1->initial.length == list2->initial.length);
1530 ASSERT (list1->repeated.length == list2->repeated.length);
1532 else if (list1->repeated.length > 0)
1535 initial segment of list1. */
1536 if (list2->initial.length >= list1->initial.length)
1538 rotate_loop (list1, list2->initial.length);
1539 if (list1->repeated.element[0].presence == FCT_REQUIRED)
1540 rotate_loop (list1, list1->initial.length + 1);
1547 if (list1->initial.length >= list2->initial.length)
1549 rotate_loop (list2, list1->initial.length);
1566 /* Step 4: Elementwise union of list1->initial, list2->initial. */
1573 e1 = list1->initial.element; c1 = list1->initial.count;
1606 /* list2 already terminated, but still more elements in list1->initial.
1646 /* list1 already terminated, but still more elements in list2->initial.
1648 ASSERT (list1->repeated.count == 0);
1687 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1688 /* Step 5: Elementwise union of list1->repeated, list2->repeated. */
1695 e1 = list1->repeated.element; c1 = list1->repeated.count;
1727 else if (list1->repeated.length > 0)
1730 initial segment. Just copy the repeated segment of list1. */
1733 result->repeated.count = list1->repeated.count;
1737 for (i = 0; i < list1->repeated.count; i++)
1739 &list1->repeated.element[i]);
1740 result->repeated.length = list1->repeated.length;
1758 free_list (list1);
1802 /* Memory effects: list1 and list2 are freed if non-NULL. The result,
1805 union (struct format_arg_list *list1, struct format_arg_list *list2)
1807 if (list1 != NULL)
1810 return make_union_list (list1, list2);
1812 return list1;