1 /* 2 * Author: Joshua Brindle <jbrindle (at) tresys.com> 3 * Chad Sellers <csellers (at) tresys.com> 4 * Chris PeBenito <cpebenito (at) tresys.com> 5 * 6 * Copyright (C) 2006 Tresys Technology, LLC 7 * 8 * This library is free software; you can redistribute it and/or 9 * modify it under the terms of the GNU Lesser General Public 10 * License as published by the Free Software Foundation; either 11 * version 2.1 of the License, or (at your option) any later version. 12 * 13 * This library is distributed in the hope that it will be useful, 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 16 * Lesser General Public License for more details. 17 * 18 * You should have received a copy of the GNU Lesser General Public 19 * License along with this library; if not, write to the Free Software 20 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 21 */ 22 23 /* This has tests that are common between test suites*/ 24 25 #include <sepol/policydb/avrule_block.h> 26 27 #include <CUnit/Basic.h> 28 29 void test_sym_presence(policydb_t * p, const char *id, int sym_type, unsigned int scope_type, unsigned int *decls, unsigned int len) 30 { 31 scope_datum_t *scope; 32 int found; 33 unsigned int i, j; 34 /* make sure it is in global symtab */ 35 if (!hashtab_search(p->symtab[sym_type].table, id)) { 36 fprintf(stderr, "symbol %s not found in table %d\n", id, sym_type); 37 CU_FAIL_FATAL(); 38 } 39 /* make sure its scope is correct */ 40 scope = hashtab_search(p->scope[sym_type].table, id); 41 CU_ASSERT_FATAL(scope != NULL); 42 CU_ASSERT(scope->scope == scope_type); 43 CU_ASSERT(scope->decl_ids_len == len); 44 if (scope->decl_ids_len != len) 45 fprintf(stderr, "sym %s has %d decls, %d expected\n", id, scope->decl_ids_len, len); 46 for (i = 0; i < len; i++) { 47 found = 0; 48 for (j = 0; j < len; j++) { 49 if (decls[i] == scope->decl_ids[j]) 50 found++; 51 } 52 CU_ASSERT(found == 1); 53 } 54 55 } 56 57 static int common_test_index(hashtab_key_t key, hashtab_datum_t datum, void *data) 58 { 59 common_datum_t *d = (common_datum_t *) datum; 60 policydb_t *p = (policydb_t *) data; 61 62 CU_ASSERT(p->sym_val_to_name[SYM_COMMONS][d->s.value - 1] == (char *)key); 63 return 0; 64 } 65 66 static int class_test_index(hashtab_key_t key, hashtab_datum_t datum, void *data) 67 { 68 class_datum_t *d = (class_datum_t *) datum; 69 policydb_t *p = (policydb_t *) data; 70 71 CU_ASSERT(p->sym_val_to_name[SYM_CLASSES][d->s.value - 1] == (char *)key); 72 CU_ASSERT(p->class_val_to_struct[d->s.value - 1] == d); 73 return 0; 74 } 75 76 static int role_test_index(hashtab_key_t key, hashtab_datum_t datum, void *data) 77 { 78 role_datum_t *d = (role_datum_t *) datum; 79 policydb_t *p = (policydb_t *) data; 80 81 CU_ASSERT(p->sym_val_to_name[SYM_ROLES][d->s.value - 1] == (char *)key); 82 CU_ASSERT(p->role_val_to_struct[d->s.value - 1] == d); 83 return 0; 84 } 85 86 static int type_test_index(hashtab_key_t key, hashtab_datum_t datum, void *data) 87 { 88 type_datum_t *d = (type_datum_t *) datum; 89 policydb_t *p = (policydb_t *) data; 90 91 if (!d->primary) 92 return 0; 93 94 CU_ASSERT(p->sym_val_to_name[SYM_TYPES][d->s.value - 1] == (char *)key); 95 CU_ASSERT(p->type_val_to_struct[d->s.value - 1] == d); 96 97 return 0; 98 } 99 100 static int user_test_index(hashtab_key_t key, hashtab_datum_t datum, void *data) 101 { 102 user_datum_t *d = (user_datum_t *) datum; 103 policydb_t *p = (policydb_t *) data; 104 105 CU_ASSERT(p->sym_val_to_name[SYM_USERS][d->s.value - 1] == (char *)key); 106 CU_ASSERT(p->user_val_to_struct[d->s.value - 1] == d); 107 return 0; 108 } 109 110 static int cond_test_index(hashtab_key_t key, hashtab_datum_t datum, void *data) 111 { 112 cond_bool_datum_t *d = (cond_bool_datum_t *) datum; 113 policydb_t *p = (policydb_t *) data; 114 115 CU_ASSERT(p->sym_val_to_name[SYM_BOOLS][d->s.value - 1] == (char *)key); 116 CU_ASSERT(p->bool_val_to_struct[d->s.value - 1] == d); 117 return 0; 118 } 119 120 static int level_test_index(hashtab_key_t key, hashtab_datum_t datum, void *data) 121 { 122 level_datum_t *d = (level_datum_t *) datum; 123 policydb_t *p = (policydb_t *) data; 124 125 CU_ASSERT(p->sym_val_to_name[SYM_LEVELS][d->level->sens - 1] == (char *)key); 126 return 0; 127 } 128 129 static int cat_test_index(hashtab_key_t key, hashtab_datum_t datum, void *data) 130 { 131 cat_datum_t *d = (cat_datum_t *) datum; 132 policydb_t *p = (policydb_t *) data; 133 134 CU_ASSERT(p->sym_val_to_name[SYM_CATS][d->s.value - 1] == (char *)key); 135 return 0; 136 } 137 138 static int (*test_index_f[SYM_NUM]) (hashtab_key_t key, hashtab_datum_t datum, void *p) = { 139 common_test_index, class_test_index, role_test_index, type_test_index, user_test_index, cond_test_index, level_test_index, cat_test_index,}; 140 141 void test_policydb_indexes(policydb_t * p) 142 { 143 int i; 144 145 for (i = 0; i < SYM_NUM; i++) { 146 hashtab_map(p->symtab[i].table, test_index_f[i], p); 147 } 148 } 149 150 void test_alias_datum(policydb_t * p, const char *id, const char *primary_id, char mode, unsigned int flavor) 151 { 152 type_datum_t *type, *primary; 153 unsigned int my_primary, my_flavor, my_value; 154 155 type = hashtab_search(p->p_types.table, id); 156 primary = hashtab_search(p->p_types.table, primary_id); 157 158 CU_ASSERT_PTR_NOT_NULL(type); 159 CU_ASSERT_PTR_NOT_NULL(primary); 160 161 if (type && primary) { 162 if (mode) { 163 my_flavor = type->flavor; 164 } else { 165 my_flavor = flavor; 166 } 167 168 if (my_flavor == TYPE_TYPE) { 169 my_primary = 0; 170 my_value = primary->s.value; 171 } else { 172 CU_ASSERT(my_flavor == TYPE_ALIAS); 173 my_primary = primary->s.value; 174 CU_ASSERT_NOT_EQUAL(type->s.value, primary->s.value); 175 my_value = type->s.value; 176 } 177 178 CU_ASSERT(type->primary == my_primary); 179 CU_ASSERT(type->flavor == my_flavor); 180 CU_ASSERT(type->s.value == my_value); 181 } 182 } 183 184 role_datum_t *test_role_type_set(policydb_t * p, const char *id, avrule_decl_t * decl, const char **types, unsigned int len, unsigned int flags) 185 { 186 ebitmap_node_t *tnode; 187 unsigned int i, j, new, found = 0; 188 role_datum_t *role; 189 190 if (decl) 191 role = hashtab_search(decl->p_roles.table, id); 192 else 193 role = hashtab_search(p->p_roles.table, id); 194 195 if (!role) 196 printf("role %s can't be found! \n", id); 197 198 CU_ASSERT_FATAL(role != NULL); 199 200 ebitmap_for_each_bit(&role->types.types, tnode, i) { 201 if (ebitmap_node_get_bit(tnode, i)) { 202 new = 0; 203 for (j = 0; j < len; j++) { 204 if (strcmp(p->sym_val_to_name[SYM_TYPES][i], types[j]) == 0) { 205 found++; 206 new = 1; 207 } 208 } 209 if (new == 0) { 210 printf("\nRole %s had type %s not in types array\n", id, p->sym_val_to_name[SYM_TYPES][i]); 211 } 212 CU_ASSERT(new == 1); 213 } 214 } 215 CU_ASSERT(found == len); 216 if (found != len) 217 printf("\nrole %s has %d types, %d expected\n", p->sym_val_to_name[SYM_ROLES][role->s.value - 1], found, len); 218 /* roles should never have anything in the negset */ 219 CU_ASSERT(role->types.negset.highbit == 0); 220 CU_ASSERT(role->types.flags == flags); 221 222 return role; 223 } 224 225 void test_attr_types(policydb_t * p, const char *id, avrule_decl_t * decl, const char **types, int len) 226 { 227 ebitmap_node_t *tnode; 228 int j, new, found = 0; 229 unsigned int i; 230 type_datum_t *attr; 231 232 if (decl) 233 attr = hashtab_search(decl->p_types.table, id); 234 else 235 attr = hashtab_search(p->p_types.table, id); 236 237 if (attr == NULL) 238 printf("could not find attr %s in decl %d\n", id, decl->decl_id); 239 CU_ASSERT_FATAL(attr != NULL); 240 CU_ASSERT(attr->flavor == TYPE_ATTRIB); 241 CU_ASSERT(attr->primary == 1); 242 243 ebitmap_for_each_bit(&attr->types, tnode, i) { 244 if (ebitmap_node_get_bit(tnode, i)) { 245 new = 0; 246 for (j = 0; j < len; j++) { 247 if (strcmp(p->sym_val_to_name[SYM_TYPES][i], types[j]) == 0) { 248 found++; 249 new = 1; 250 } 251 } 252 if (new == 0) { 253 printf("\nattr %s had type %s not in types array\n", id, p->sym_val_to_name[SYM_TYPES][i]); 254 } 255 CU_ASSERT(new == 1); 256 } 257 } 258 CU_ASSERT(found == len); 259 if (found != len) 260 printf("\nattr %s has %d types, %d expected\n", id, found, len); 261 } 262
