HomeSort by relevance Sort by last modified time
    Searched refs:cl_head (Results 1 - 18 of 18) sorted by null

  /external/selinux/libsepol/cil/test/unit/
test_cil_list.c 70 test_new_item->data = test_tree->root->cl_head->cl_head->next->cl_head;
98 test_new_item->data = test_tree->root->cl_head->cl_head->next->cl_head;
105 test_new_item->data = test_tree->root->cl_head->cl_head->next->cl_head->next;
134 test_new_item->data = test_tree->root->cl_head->cl_head->next->cl_head
    [all...]
test_cil_build_ast.c 70 test_current = test_tree->root->cl_head->cl_head;
80 test_avrule->classpermset->class_str = cil_strdup(test_current->next->next->next->cl_head->data);
86 test_current = test_current->next->next->next->cl_head->next->cl_head;
101 test_current = test_tree->root->cl_head->cl_head;
111 test_avrule->classpermset->class_str = cil_strdup(test_current->next->next->next->cl_head->data);
132 test_current = test_tree->root->cl_head->cl_head;
    [all...]
test_cil_resolve_ast.c 82 struct cil_tree_node *test_curr = test_db->ast->root->cl_head->cl_head;
106 struct cil_tree_node *test_curr = test_db->ast->root->cl_head->cl_head;
145 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next->next, args);
165 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args);
184 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args);
204 int rc = cil_resolve_classmapping(test_db->ast->root->cl_head->next->next, args);
228 int rc2 = cil_resolve_call1(test_db->ast->root->cl_head->next->next->next, args);
232 int rc3 = cil_resolve_call2(test_db->ast->root->cl_head->next->next->next, args)
    [all...]
test_cil_copy_ast.c 65 cil_set_to_list(test_tree->root->cl_head, cil_l, 1);
87 cil_set_to_list(test_tree->root->cl_head, cil_l, 1);
111 cil_set_to_list(test_tree->root->cl_head, cil_l, 1);
159 cil_gen_block(test_db, test_tree->root->cl_head->cl_head, test_ast_node, 0);
200 cil_gen_perm(test_db, test_tree->root->cl_head->cl_head->next->next->cl_head, test_ast_node);
203 cil_gen_perm(test_db, test_tree->root->cl_head->cl_head->next->next->cl_head->next, test_ast_node)
    [all...]
test_cil_tree.c 43 CuAssertPtrEquals(tc, NULL, test_node->cl_head);
61 CuAssertPtrEquals(tc, NULL, test_tree->root->cl_head);
CilTest.c 103 if (current->cl_head == NULL)
104 current->cl_head = node;
118 if (current->cl_head == NULL) {
119 current->cl_head = item;
    [all...]
  /external/selinux/libsepol/cil/src/
cil_build_ast.c 409 perms = parse_current->next->next->cl_head;
466 rc = cil_fill_list(parse_current->next->cl_head, CIL_CLASSORDER, &classorder->class_list_str);
558 if (current_perm->cl_head != NULL) {
574 if (ast_node->cl_head == NULL) {
575 ast_node->cl_head = new_ast;
602 rc = __cil_verify_syntax(start_perm->cl_head, syntax, syntax_len);
699 curr = parse_current->cl_head;
706 } else if (curr->cl_head == NULL) {
884 rc = cil_gen_perm_nodes(db, parse_current->next->next->cl_head, ast_node, CIL_MAP_PERM, &map->num_perms);
984 rc = cil_gen_perm_nodes(db, parse_current->next->next->cl_head, ast_node, CIL_PERM, &common->num_perms)
    [all...]
cil_tree.h 44 struct cil_tree_node *cl_head; //Head of child_list member in struct:cil_tree_node
cil_tree.c 72 if (node->cl_head->data == CIL_KEY_SRC_INFO) {
74 *path = node->cl_head->next->next->data;
75 *is_cil = (node->cl_head->next->data == CIL_KEY_SRC_CIL);
185 if (node->cl_head != NULL) {
186 node = node->cl_head;
190 if (node->cl_head != NULL){
191 next = node->cl_head;
196 node->parent->cl_head = NULL;
211 new_node->cl_head = NULL;
283 if (node->cl_head != NULL && !(finished & CIL_TREE_SKIP_HEAD))
    [all...]
cil_parser.c 93 if (current->cl_head == NULL) {
94 current->cl_head = node;
cil_resolve_ast.c     [all...]
cil_verify.c 106 } else if ((s[i] & CIL_SYN_N_LISTS) && (c->data == NULL && c->cl_head != NULL)) {
110 } else if ((s[i] & CIL_SYN_N_STRINGS) && (c->data != NULL && c->cl_head == NULL)) {
122 if (c->data != NULL && c->cl_head == NULL) {
130 if (c->data == NULL && c->cl_head != NULL) {
138 if (c->data == NULL && c->cl_head == NULL) {
965 struct cil_tree_node *cond_block = node->cl_head;
1333 for (curr_com_perm = common_node->cl_head;
1339 for (curr_class_perm = node->cl_head;
    [all...]
android.c 808 if (ast_parent->cl_head == NULL)
809 ast_parent->cl_head = ast_node;
cil_copy_ast.c     [all...]
cil_policy.c 740 perm = node->cl_head;
765 if (node->cl_head != NULL) {
766 struct cil_tree_node *perm = node->cl_head;
    [all...]
cil_binary.c 254 struct cil_tree_node *cil_perm = node->cl_head;
343 for (curr = NODE(cil_class->common)->cl_head, i = 1; curr; curr = curr->next, i++) {
349 for (curr = NODE(cil_class)->cl_head; curr; curr = curr->next) {
    [all...]
cil.c     [all...]
cil_write_ast.c 443 if (node->cl_head == NULL) {
    [all...]

Completed in 399 milliseconds