Lines Matching defs:new
1292 static int __cil_ordered_lists_merge(struct cil_list *old, struct cil_list *new)
1299 struct cil_list_item *nfirst = new->head;
1313 /* Find a match between the new list and the old one */
1332 /* Prepend the beginning of the new list up to the first match to the old list */
1339 /* In the overlapping protion, add items from the new list not in the old list */
1349 /* Handle gap in old: old = (A C) new = (A B C) */
1361 /* Handle gap in new: old = (A B C) new = (A C) */
1376 /* Add the rest of the items from the new list */
1483 struct cil_list *new = NULL;
1490 cil_list_init(&new, CIL_CLASSORDER);
1509 cil_list_append(new, CIL_CLASS, datum);
1513 class_list->list = new;
1524 cil_list_destroy(&new, CIL_FALSE);
1533 struct cil_list *new = NULL;
1539 cil_list_init(&new, CIL_SIDORDER);
1553 cil_list_append(new, CIL_SID, datum);
1557 ordered->list = new;
1564 cil_list_destroy(&new, CIL_FALSE);
1587 struct cil_list *new = NULL;
1594 cil_list_init(&new, CIL_CATORDER);
1610 cil_list_append(new, CIL_CAT, cat);
1614 ordered->list = new;
1621 cil_list_destroy(&new, CIL_FALSE);
1630 struct cil_list *new = NULL;
1636 cil_list_init(&new, CIL_LIST_ITEM);
1649 cil_list_append(new, CIL_SENS, datum);
1653 ordered->list = new;
1660 cil_list_destroy(&new, CIL_FALSE);