Lines Matching refs:list2
135 const struct format_arg_list *list2);
138 struct format_arg_list *list2);
143 struct format_arg_list *list2);
301 const struct format_arg_list *list2)
306 VERIFY_LIST (list2);
309 if (n != list2->initial.count)
314 const struct format_arg * e2 = &list2->initial.element[i];
321 if (n != list2->repeated.count)
326 const struct format_arg * e2 = &list2->repeated.element[i];
1110 /* Memory effects: list1 and list2 are freed. The result, if non-NULL, is
1114 struct format_arg_list *list2)
1119 VERIFY_LIST (list2);
1121 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1122 /* Step 1: Ensure list1->repeated.length == list2->repeated.length. */
1125 unsigned int n2 = list2->repeated.length;
1131 unfold_loop (list2, m2);
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);
1145 if (list2->repeated.length > 0)
1146 rotate_loop (list2, 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. */
1174 e2 = list2->initial.element; c2 = list2->initial.count;
1211 if (list1->repeated.count == 0 && list2->repeated.count == 0)
1216 /* list1 longer than list2. */
1223 /* list2 longer than list1. */
1234 if ((c2 > 0 ? e2->presence : list2->repeated.element[0].presence)
1240 else if (list2->repeated.count == 0)
1254 /* Step 5: Elementwise intersection of list1->repeated, list2->repeated. */
1262 e2 = list2->repeated.element; c2 = list2->repeated.count;
1306 free_list (list2);
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)
1347 if (list2 != NULL)
1348 return make_intersected_list (list1, list2);
1357 if (list2 != NULL)
1359 free_list (list2);
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)
1481 VERIFY_LIST (list2);
1483 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1485 /* Step 1: Ensure list1->repeated.length == list2->repeated.length. */
1488 unsigned int n2 = list2->repeated.length;
1494 unfold_loop (list2, m2);
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);
1503 rotate_loop (list2, m);
1506 ASSERT (list1->initial.length == list2->initial.length);
1507 ASSERT (list1->repeated.length == list2->repeated.length);
1513 if (list2->initial.length >= list1->initial.length)
1515 rotate_loop (list1, list2->initial.length);
1520 else if (list2->repeated.length > 0)
1523 initial segment of list2. */
1524 if (list1->initial.length >= list2->initial.length)
1526 rotate_loop (list2, list1->initial.length);
1527 if (list2->repeated.element[0].presence == FCT_REQUIRED)
1528 rotate_loop (list2, list2->initial.length + 1);
1543 /* Step 4: Elementwise union of list1->initial, list2->initial. */
1551 e2 = list2->initial.element; c2 = list2->initial.count;
1583 /* list2 already terminated, but still more elements in list1->initial.
1585 ASSERT (list2->repeated.count == 0);
1623 /* list1 already terminated, but still more elements in list2->initial.
1664 if (list1->repeated.length > 0 && list2->repeated.length > 0)
1665 /* Step 5: Elementwise union of list1->repeated, list2->repeated. */
1673 e2 = list2->repeated.element; c2 = list2->repeated.count;
1719 else if (list2->repeated.length > 0)
1722 initial segment. Just copy the repeated segment of list2. */
1725 result->repeated.count = list2->repeated.count;
1729 for (i = 0; i < list2->repeated.count; i++)
1731 &list2->repeated.element[i]);
1732 result->repeated.length = list2->repeated.length;
1736 free_list (list2);
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)
1786 if (list2 != NULL)
1787 return make_union_list (list1, list2);
1793 if (list2 != NULL)
1794 return list2;