Lines Matching defs:list2
138 const struct format_arg_list *list2);
141 struct format_arg_list *list2);
146 struct format_arg_list *list2);
304 const struct format_arg_list *list2)
309 VERIFY_LIST (list2);
312 if (n != list2->initial.count)
317 const struct format_arg * e2 = &list2->initial.element[i];
324 if (n != list2->repeated.count)
329 const struct format_arg * e2 = &list2->repeated.element[i];
1123 /* Memory effects: list1 and list2 are freed. The result, if non-NULL, is
1127 struct format_arg_list *list2)
1132 VERIFY_LIST (list2);
1134 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1135 /* Step 1: Ensure list1->repeated.length == list2->repeated.length. */
1138 unsigned int n2 = list2->repeated.length;
1144 unfold_loop (list2, m2);
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);
1158 if (list2->repeated.length > 0)
1159 rotate_loop (list2, 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. */
1187 e2 = list2->initial.element; c2 = list2->initial.count;
1224 if (list1->repeated.count == 0 && list2->repeated.count == 0)
1229 /* list1 longer than list2. */
1236 /* list2 longer than list1. */
1247 if ((c2 > 0 ? e2->presence : list2->repeated.element[0].presence)
1253 else if (list2->repeated.count == 0)
1267 /* Step 5: Elementwise intersection of list1->repeated, list2->repeated. */
1275 e2 = list2->repeated.element; c2 = list2->repeated.count;
1319 free_list (list2);
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)
1360 if (list2 != NULL)
1361 return make_intersected_list (list1, list2);
1370 if (list2 != NULL)
1372 free_list (list2);
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)
1504 VERIFY_LIST (list2);
1506 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1508 /* Step 1: Ensure list1->repeated.length == list2->repeated.length. */
1511 unsigned int n2 = list2->repeated.length;
1517 unfold_loop (list2, m2);
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);
1526 rotate_loop (list2, m);
1529 ASSERT (list1->initial.length == list2->initial.length);
1530 ASSERT (list1->repeated.length == list2->repeated.length);
1536 if (list2->initial.length >= list1->initial.length)
1538 rotate_loop (list1, list2->initial.length);
1543 else if (list2->repeated.length > 0)
1546 initial segment of list2. */
1547 if (list1->initial.length >= list2->initial.length)
1549 rotate_loop (list2, list1->initial.length);
1550 if (list2->repeated.element[0].presence == FCT_REQUIRED)
1551 rotate_loop (list2, list2->initial.length + 1);
1566 /* Step 4: Elementwise union of list1->initial, list2->initial. */
1574 e2 = list2->initial.element; c2 = list2->initial.count;
1606 /* list2 already terminated, but still more elements in list1->initial.
1608 ASSERT (list2->repeated.count == 0);
1646 /* list1 already terminated, but still more elements in list2->initial.
1687 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1688 /* Step 5: Elementwise union of list1->repeated, list2->repeated. */
1696 e2 = list2->repeated.element; c2 = list2->repeated.count;
1742 else if (list2->repeated.length > 0)
1745 initial segment. Just copy the repeated segment of list2. */
1748 result->repeated.count = list2->repeated.count;
1752 for (i = 0; i < list2->repeated.count; i++)
1754 &list2->repeated.element[i]);
1755 result->repeated.length = list2->repeated.length;
1759 free_list (list2);
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)
1809 if (list2 != NULL)
1810 return make_union_list (list1, list2);
1816 if (list2 != NULL)
1817 return list2;