Lines Matching defs:item
90 struct cil_list_item *item;
91 cil_list_for_each(item, macro->params) {
92 struct cil_param *param = item->data;
1209 struct cil_list_item *item = NULL;
1215 item = (*ordered_lists)->head;
1216 while (item != NULL) {
1217 struct cil_list_item *next = item->next;
1218 struct cil_ordered_list *ordered = item->data;
1220 free(item);
1221 item = next;
1233 static struct cil_list_item *__cil_ordered_item_insert(struct cil_list *old, struct cil_list_item *curr, struct cil_list_item *item)
1235 if (item->flavor == CIL_SID) {
1236 struct cil_sid *sid = item->data;
1242 } else if (item->flavor == CIL_CLASS) {
1243 struct cil_class *class = item->data;
1249 } else if (item->flavor == CIL_CAT) {
1250 struct cil_cat *cat = item->data;
1256 } else if (item->flavor == CIL_SENS) {
1257 struct cil_sens *sens = item->data;
1265 return cil_list_insert(old, curr, item->flavor, item->data);
1390 struct cil_list_item *item = NULL;
1397 cil_list_for_each(item, unordered_list->list) {
1398 if (cil_list_contains(merged, item->data)) {
1399 /* item was declared in an ordered statement, which supersedes
1401 if (item->flavor == CIL_CLASS) {
1402 cil_log(CIL_WARN, "Ignoring '%s' as it has already been declared in classorder.\n", ((struct cil_class*)(item->data))->datum.name);
1407 ret = __cil_ordered_item_insert(merged, merged->tail, item);
2366 struct cil_list_item *item = NULL;
2383 cil_list_for_each(item, block->bi_nodes) {
2384 rc = cil_copy_ast(db, current, item->data);
2666 struct cil_list_item * item = NULL;
2686 cil_list_for_each(item, trace) {
2687 curr = item->data;
2738 struct cil_list_item *item;
2760 cil_list_for_each(item, macro->params) {
2761 enum cil_flavor flavor = ((struct cil_param*)item->data)->flavor;
2768 if (item->flavor != CIL_PARAM) {
3009 (((struct cil_param*)item->data)->flavor));
3014 arg->param_str = ((struct cil_param*)item->data)->str;
3089 struct cil_list_item *item;
3096 cil_list_for_each(item, call->args) {
3097 struct cil_args *arg = item->data;
3221 struct cil_list_item *item;
3233 cil_list_for_each(item, call->args) {
3234 struct cil_args * arg = item->data;
3561 struct cil_stack_item *item;
3563 cil_stack_for_each(stack, i, item) {
3564 if (block_node == (struct cil_tree_node *)item->data) {
4151 struct cil_list_item *item;
4152 cil_list_for_each(item, extra_args.abstract_blocks) {
4153 cil_mark_subtree_abstract(item->data);
4210 struct cil_list_item *item;
4214 cil_list_for_each(item, extra_args.to_destroy) {
4215 has_decls = cil_tree_subtree_has_decl(item->data);
4251 cil_list_for_each(item, extra_args.to_destroy) {
4252 cil_tree_children_destroy(item->data);