Lines Matching refs:list1
134 static bool equal_list (const struct format_arg_list *list1,
137 (struct format_arg_list *list1,
142 (struct format_arg_list *list1,
300 equal_list (const struct format_arg_list *list1,
305 VERIFY_LIST (list1);
308 n = list1->initial.count;
313 const struct format_arg * e1 = &list1->initial.element[i];
320 n = list1->repeated.count;
325 const struct format_arg * e1 = &list1->repeated.element[i];
1110 /* Memory effects: list1 and list2 are freed. The result, if non-NULL, is
1113 make_intersected_list (struct format_arg_list *list1,
1118 VERIFY_LIST (list1);
1121 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1122 /* Step 1: Ensure list1->repeated.length == list2->repeated.length. */
1124 unsigned int n1 = list1->repeated.length;
1130 unfold_loop (list1, m1);
1132 /* Now list1->repeated.length = list2->repeated.length = lcm(n1,n2). */
1135 if (list1->repeated.length > 0 || list2->repeated.length > 0)
1137 from the initial segments of list1 and list2. If both have a
1139 list1->initial.length == list2->initial.length. */
1141 unsigned int m = MAX (list1->initial.length, list2->initial.length);
1143 if (list1->repeated.length > 0)
1144 rotate_loop (list1, m);
1149 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1151 ASSERT (list1->initial.length == list2->initial.length);
1152 ASSERT (list1->repeated.length == list2->repeated.length);
1166 /* Step 4: Elementwise intersection of list1->initial, list2->initial. */
1173 e1 = list1->initial.element; c1 = list1->initial.count;
1211 if (list1->repeated.count == 0 && list2->repeated.count == 0)
1216 /* list1 longer than list2. */
1223 /* list2 longer than list1. */
1230 else if (list1->repeated.count == 0)
1244 if ((c1 > 0 ? e1->presence : list1->repeated.element[0].presence)
1254 /* Step 5: Elementwise intersection of list1->repeated, list2->repeated. */
1261 e1 = list1->repeated.element; c1 = list1->repeated.count;
1305 free_list (list1);
1340 /* Memory effects: list1 and list2 are freed if non-NULL. The result,
1343 intersection (struct format_arg_list *list1, struct format_arg_list *list2)
1345 if (list1 != NULL)
1348 return make_intersected_list (list1, list2);
1351 free_list (list1);
1473 /* Memory effects: list1 and list2 are freed. The result is freshly
1476 make_union_list (struct format_arg_list *list1, struct format_arg_list *list2)
1480 VERIFY_LIST (list1);
1483 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1485 /* Step 1: Ensure list1->repeated.length == list2->repeated.length. */
1487 unsigned int n1 = list1->repeated.length;
1493 unfold_loop (list1, m1);
1495 /* Now list1->repeated.length = list2->repeated.length = lcm(n1,n2). */
1498 /* Step 2: Ensure that list1->initial.length == list2->initial.length. */
1500 unsigned int m = MAX (list1->initial.length, list2->initial.length);
1502 rotate_loop (list1, m);
1506 ASSERT (list1->initial.length == list2->initial.length);
1507 ASSERT (list1->repeated.length == list2->repeated.length);
1509 else if (list1->repeated.length > 0)
1512 initial segment of list1. */
1513 if (list2->initial.length >= list1->initial.length)
1515 rotate_loop (list1, list2->initial.length);
1516 if (list1->repeated.element[0].presence == FCT_REQUIRED)
1517 rotate_loop (list1, list1->initial.length + 1);
1524 if (list1->initial.length >= list2->initial.length)
1526 rotate_loop (list2, list1->initial.length);
1543 /* Step 4: Elementwise union of list1->initial, list2->initial. */
1550 e1 = list1->initial.element; c1 = list1->initial.count;
1583 /* list2 already terminated, but still more elements in list1->initial.
1623 /* list1 already terminated, but still more elements in list2->initial.
1625 ASSERT (list1->repeated.count == 0);
1664 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1665 /* Step 5: Elementwise union of list1->repeated, list2->repeated. */
1672 e1 = list1->repeated.element; c1 = list1->repeated.count;
1704 else if (list1->repeated.length > 0)
1707 initial segment. Just copy the repeated segment of list1. */
1710 result->repeated.count = list1->repeated.count;
1714 for (i = 0; i < list1->repeated.count; i++)
1716 &list1->repeated.element[i]);
1717 result->repeated.length = list1->repeated.length;
1735 free_list (list1);
1779 /* Memory effects: list1 and list2 are freed if non-NULL. The result,
1782 union (struct format_arg_list *list1, struct format_arg_list *list2)
1784 if (list1 != NULL)
1787 return make_union_list (list1, list2);
1789 return list1;