[fc1a6b4] | 1 | |
---|
| 2 | /* abac_graph.c */ |
---|
| 3 | |
---|
[d4cbf71] | 4 | #include <assert.h> |
---|
[379a53f] | 5 | #include <stdlib.h> |
---|
[d4cbf71] | 6 | |
---|
[06293d1] | 7 | #include "abac_graph.h" |
---|
[cb0f2b2] | 8 | |
---|
[2fd24c7] | 9 | #include "abac_set.h" |
---|
[3c251d0] | 10 | #include "abac_util.h" |
---|
[d4cbf71] | 11 | |
---|
[f46412c] | 12 | #include "uthash.h" |
---|
| 13 | |
---|
| 14 | // vertex |
---|
[06293d1] | 15 | struct _abac_vertex_t { |
---|
[1743825] | 16 | abac_role_t *role; |
---|
[f46412c] | 17 | char *name; |
---|
[06ef09c] | 18 | int refcount; |
---|
[f46412c] | 19 | |
---|
[6d5623e] | 20 | abac_list_t *edges; |
---|
[d4b3b52] | 21 | abac_list_t *reverse_edges; |
---|
[f46412c] | 22 | |
---|
[0eb4a8e] | 23 | // only relevant to intersection edges |
---|
| 24 | abac_list_t *prereqs; |
---|
| 25 | |
---|
[f46412c] | 26 | UT_hash_handle hh; |
---|
| 27 | }; |
---|
| 28 | |
---|
[ae72c5d] | 29 | // edge |
---|
[06293d1] | 30 | typedef struct _abac_edge_t { |
---|
[06ef09c] | 31 | int refcount; |
---|
[06293d1] | 32 | abac_vertex_t *vertex; |
---|
[d4b3b52] | 33 | abac_vertex_t *reverse_vertex; |
---|
[401a054] | 34 | abac_credential_t *credential; |
---|
[06293d1] | 35 | } abac_edge_t; |
---|
[ae72c5d] | 36 | |
---|
[f46412c] | 37 | // derived edge |
---|
[06293d1] | 38 | typedef struct _abac_derived_key_t { |
---|
| 39 | abac_vertex_t *head; |
---|
| 40 | abac_edge_t *tail; |
---|
| 41 | } abac_derived_key_t; |
---|
[f46412c] | 42 | |
---|
[06293d1] | 43 | typedef struct _abac_derived_t { |
---|
| 44 | abac_derived_key_t key; |
---|
[f46412c] | 45 | UT_hash_handle hh; |
---|
[06293d1] | 46 | } abac_derived_t; |
---|
[f46412c] | 47 | |
---|
| 48 | // graph |
---|
[06293d1] | 49 | struct _abac_graph_t { |
---|
| 50 | abac_vertex_t *vertices; |
---|
| 51 | abac_derived_t *derived; |
---|
[f46412c] | 52 | int dirty; |
---|
| 53 | }; |
---|
[0ec9e25] | 54 | |
---|
[0eb4a8e] | 55 | // ugghhhghhhghh need this for intersections |
---|
[9a411d7] | 56 | abac_list_t *abac_role_prereqs(abac_role_t *); |
---|
[0eb4a8e] | 57 | |
---|
[f2622ee] | 58 | static abac_vertex_t *_dup_vertex(abac_vertex_t *v); |
---|
[fc1a6b4] | 59 | int abac_graph_add_credential(abac_graph_t *graph, abac_credential_t *cred); |
---|
[f2622ee] | 60 | |
---|
[0ec9e25] | 61 | /** |
---|
| 62 | * Create a new graph. |
---|
| 63 | */ |
---|
[06293d1] | 64 | abac_graph_t *abac_graph_new(void) { |
---|
[3c251d0] | 65 | abac_graph_t *graph = abac_xmalloc(sizeof(abac_graph_t)); |
---|
[82aeefa] | 66 | |
---|
| 67 | graph->vertices = NULL; |
---|
[6188f4e] | 68 | graph->derived = NULL; |
---|
[82aeefa] | 69 | graph->dirty = 0; |
---|
| 70 | |
---|
| 71 | return graph; |
---|
| 72 | } |
---|
[d4cbf71] | 73 | |
---|
[b26942d] | 74 | /** |
---|
| 75 | * Deep copy a graph. |
---|
| 76 | */ |
---|
[06293d1] | 77 | abac_graph_t *abac_graph_dup(abac_graph_t *graph) { |
---|
| 78 | abac_vertex_t *vertex; |
---|
| 79 | abac_edge_t *edge; |
---|
[b26942d] | 80 | |
---|
[06293d1] | 81 | abac_graph_t *clone = abac_graph_new(); |
---|
[b26942d] | 82 | |
---|
| 83 | // copy the vertices edge by edge |
---|
| 84 | for (vertex = graph->vertices; vertex != NULL; vertex = vertex->hh.next) |
---|
[6d5623e] | 85 | abac_list_foreach(vertex->edges, edge, |
---|
[b26942d] | 86 | // only copy non-derived edges |
---|
[401a054] | 87 | if (edge->credential != NULL) |
---|
| 88 | abac_graph_add_credential(clone, edge->credential); |
---|
[b26942d] | 89 | ); |
---|
| 90 | |
---|
| 91 | return clone; |
---|
| 92 | } |
---|
[d4cbf71] | 93 | /** |
---|
[06ef09c] | 94 | * Add a vertex to the graph. Should only be called by |
---|
[3f21704] | 95 | * abac_graph_add_credential. This returns an existing vertex |
---|
| 96 | * or a new vertex with a refcount of 1. Either way it gets and |
---|
[06ef09c] | 97 | * references the vertex. |
---|
[d4cbf71] | 98 | */ |
---|
[06293d1] | 99 | static abac_vertex_t *_get_vertex(abac_graph_t *graph, abac_role_t *role) { |
---|
| 100 | abac_vertex_t *vertex; |
---|
[c28bd8b] | 101 | char *string; |
---|
| 102 | |
---|
[cb135e1] | 103 | string =abac_role_string(role); |
---|
[82aeefa] | 104 | HASH_FIND_STR(graph->vertices, string, vertex); |
---|
[c28bd8b] | 105 | |
---|
| 106 | // add the vertex if it doesn't exist |
---|
| 107 | if (vertex == NULL) { |
---|
[3c251d0] | 108 | vertex = abac_xmalloc(sizeof(abac_vertex_t)); |
---|
[f2622ee] | 109 | vertex->refcount = 1; |
---|
[dcc1a8e] | 110 | vertex->role = abac_role_dup(role); |
---|
| 111 | vertex->name = abac_role_string(vertex->role); |
---|
[d4cbf71] | 112 | |
---|
[379a53f] | 113 | // create the list of edges |
---|
[6d5623e] | 114 | vertex->edges = abac_list_new(); |
---|
[d4b3b52] | 115 | vertex->reverse_edges = abac_list_new(); |
---|
[d4cbf71] | 116 | |
---|
[0eb4a8e] | 117 | // for intersections, always NULL on normal vertices |
---|
[9a411d7] | 118 | if (abac_role_is_intersection(role)) { |
---|
| 119 | abac_role_t *prereq; |
---|
| 120 | vertex->prereqs = abac_list_new(); |
---|
| 121 | |
---|
[3f21704] | 122 | // add each prereq to the vertex (dup'ed) |
---|
[9a411d7] | 123 | abac_list_foreach(abac_role_prereqs(role), prereq, |
---|
| 124 | abac_vertex_t *tail_vertex = _get_vertex(graph, prereq); |
---|
[4571abc] | 125 | abac_list_add(vertex->prereqs, _dup_vertex(tail_vertex)); |
---|
[9a411d7] | 126 | ); |
---|
| 127 | } |
---|
[0eb4a8e] | 128 | |
---|
[9a411d7] | 129 | // normal edges have no prereqs |
---|
| 130 | else |
---|
| 131 | vertex->prereqs = NULL; |
---|
[0eb4a8e] | 132 | |
---|
[c28bd8b] | 133 | // add it to the vertices |
---|
[82aeefa] | 134 | HASH_ADD_KEYPTR(hh, graph->vertices, vertex->name, strlen(vertex->name), vertex); |
---|
[f2622ee] | 135 | |
---|
[3f21704] | 136 | } |
---|
[d4cbf71] | 137 | |
---|
| 138 | return vertex; |
---|
| 139 | } |
---|
| 140 | |
---|
[06ef09c] | 141 | /* forward decl */ |
---|
| 142 | static void _free_edge(abac_edge_t *edge); |
---|
[fc1a6b4] | 143 | |
---|
[06ef09c] | 144 | /* |
---|
| 145 | * Reduce the vertex reference count and free it if this is the last reference |
---|
| 146 | */ |
---|
| 147 | static void _free_vertex(abac_vertex_t *vertex) { |
---|
| 148 | abac_edge_t *edge=NULL; |
---|
| 149 | abac_vertex_t *pre=NULL; |
---|
| 150 | |
---|
| 151 | --vertex->refcount; |
---|
[fc1a6b4] | 152 | |
---|
[06ef09c] | 153 | if ( vertex->refcount > 0) return; |
---|
| 154 | |
---|
| 155 | abac_role_free(vertex->role); |
---|
| 156 | |
---|
| 157 | abac_list_foreach(vertex->edges, edge, |
---|
| 158 | _free_edge(edge); |
---|
| 159 | ); |
---|
| 160 | abac_list_free(vertex->edges); |
---|
| 161 | |
---|
| 162 | abac_list_foreach(vertex->reverse_edges, edge, |
---|
| 163 | _free_edge(edge); |
---|
| 164 | ); |
---|
| 165 | abac_list_free(vertex->reverse_edges); |
---|
| 166 | |
---|
| 167 | // Free the prereqs |
---|
| 168 | if (vertex->prereqs != NULL) { |
---|
| 169 | abac_list_foreach(vertex->prereqs, pre, |
---|
| 170 | if (pre != NULL) { |
---|
| 171 | _free_vertex(pre); |
---|
| 172 | } |
---|
| 173 | ); |
---|
| 174 | abac_list_free(vertex->prereqs); |
---|
| 175 | } |
---|
| 176 | |
---|
| 177 | free(vertex); |
---|
| 178 | } |
---|
| 179 | |
---|
| 180 | /* |
---|
| 181 | * Increment vertex reference count |
---|
| 182 | */ |
---|
| 183 | static abac_vertex_t *_dup_vertex(abac_vertex_t *v) { |
---|
| 184 | v->refcount++; |
---|
| 185 | return v; |
---|
| 186 | } |
---|
| 187 | |
---|
| 188 | |
---|
| 189 | /* |
---|
| 190 | * create a new edge from the given head, tail and credential |
---|
| 191 | */ |
---|
| 192 | |
---|
| 193 | static abac_edge_t *_get_edge(abac_vertex_t *h, abac_vertex_t *t, |
---|
| 194 | abac_credential_t *c) { |
---|
| 195 | |
---|
| 196 | /* An edge does not own it's vertices. Do not delete them from an edge |
---|
| 197 | * reference. */ |
---|
| 198 | abac_edge_t *edge = abac_xmalloc(sizeof(abac_edge_t)); |
---|
| 199 | edge->refcount = 1; |
---|
| 200 | edge->vertex = t; |
---|
| 201 | edge->reverse_vertex = h; |
---|
| 202 | /* Don't dup a null credential */ |
---|
| 203 | edge->credential = (c) ? abac_credential_dup(c): NULL; |
---|
| 204 | |
---|
| 205 | return edge; |
---|
| 206 | } |
---|
| 207 | |
---|
| 208 | |
---|
| 209 | /** |
---|
| 210 | * Increment the reference count |
---|
| 211 | */ |
---|
| 212 | static abac_edge_t *_dup_edge(abac_edge_t *e) { |
---|
| 213 | e->refcount++; |
---|
| 214 | return e; |
---|
| 215 | } |
---|
| 216 | |
---|
| 217 | /** |
---|
| 218 | * Decerement the refcount and free it if this was the last reference. NB |
---|
| 219 | * edges do not own teh vertices, so they must be deleted elsewhere. |
---|
| 220 | */ |
---|
| 221 | static void _free_edge(abac_edge_t *edge) { |
---|
| 222 | assert(edge && edge->refcount > 0); |
---|
| 223 | if ( --edge->refcount > 0) return; |
---|
| 224 | if (edge->credential) abac_credential_free(edge->credential); |
---|
| 225 | free(edge); |
---|
| 226 | } |
---|
| 227 | |
---|
[d4cbf71] | 228 | /** |
---|
[401a054] | 229 | * Add a credential to the credential graph. |
---|
[d4cbf71] | 230 | */ |
---|
[401a054] | 231 | int abac_graph_add_credential(abac_graph_t *graph, abac_credential_t *cred) { |
---|
[06293d1] | 232 | abac_vertex_t *head_vertex, *tail_vertex; |
---|
[314869f] | 233 | abac_edge_t *edge; |
---|
[d4cbf71] | 234 | |
---|
[401a054] | 235 | assert(cred != NULL); |
---|
[ae72c5d] | 236 | |
---|
[401a054] | 237 | abac_role_t *head = abac_credential_head(cred); |
---|
| 238 | abac_role_t *tail = abac_credential_tail(cred); |
---|
[d4cbf71] | 239 | |
---|
[401a054] | 240 | // a valid credential must have a role for the head |
---|
[dcc1a8e] | 241 | if (!abac_role_is_role(head)) return 0; |
---|
[d4cbf71] | 242 | |
---|
[82aeefa] | 243 | head_vertex = _get_vertex(graph, head); |
---|
[9a411d7] | 244 | tail_vertex = _get_vertex(graph, tail); |
---|
[d4cbf71] | 245 | |
---|
[314869f] | 246 | // make sure we don't insert the same edge twice (ugh) |
---|
| 247 | abac_list_foreach(head_vertex->edges, edge, |
---|
[06ef09c] | 248 | if (edge->vertex == tail_vertex) { |
---|
[314869f] | 249 | return 0; |
---|
[06ef09c] | 250 | } |
---|
[314869f] | 251 | ); |
---|
| 252 | |
---|
[ae72c5d] | 253 | // create the edge and add it |
---|
[06ef09c] | 254 | edge = _get_edge(head_vertex, tail_vertex, cred); |
---|
[ae72c5d] | 255 | |
---|
[6d5623e] | 256 | abac_list_add(head_vertex->edges, edge); |
---|
[06ef09c] | 257 | abac_list_add(tail_vertex->reverse_edges, _dup_edge(edge)); |
---|
[d4cbf71] | 258 | |
---|
[82aeefa] | 259 | // must re-derive edges |
---|
| 260 | graph->dirty = 1; |
---|
| 261 | |
---|
[d4cbf71] | 262 | return 1; |
---|
| 263 | } |
---|
| 264 | |
---|
[ebde9dd] | 265 | // find the principals that have a role |
---|
[06293d1] | 266 | static abac_set_t *_find_principals(abac_graph_t *graph, abac_vertex_t *start_vertex) { |
---|
[2fd24c7] | 267 | abac_set_t *principals = abac_set_new(); |
---|
[d4cbf71] | 268 | |
---|
[06293d1] | 269 | abac_list_t *traversal = abac_graph_postorder(graph, start_vertex->role); |
---|
| 270 | abac_vertex_t *vertex; |
---|
[d4cbf71] | 271 | |
---|
[6d5623e] | 272 | abac_list_foreach(traversal, vertex, |
---|
[9a411d7] | 273 | if (abac_role_is_principal(vertex->role)) |
---|
| 274 | abac_set_add(principals, abac_role_string(vertex->role)); |
---|
[ebde9dd] | 275 | ); |
---|
[d4cbf71] | 276 | |
---|
[6d5623e] | 277 | abac_list_free(traversal); |
---|
[ebde9dd] | 278 | return principals; |
---|
| 279 | } |
---|
[d4cbf71] | 280 | |
---|
[6188f4e] | 281 | // remove any derived edges from the graph |
---|
[06293d1] | 282 | void _clear_derived(abac_graph_t *graph) { |
---|
| 283 | abac_derived_t *current; |
---|
[6188f4e] | 284 | |
---|
| 285 | while (graph->derived) { |
---|
| 286 | current = graph->derived; |
---|
| 287 | |
---|
| 288 | HASH_DEL(graph->derived, current); |
---|
| 289 | |
---|
[06293d1] | 290 | abac_vertex_t *head = current->key.head; |
---|
| 291 | abac_edge_t *tail = current->key.tail; |
---|
[401a054] | 292 | assert(tail->credential == NULL); |
---|
[6188f4e] | 293 | |
---|
| 294 | // this can fail, but we assume the data structures are consistent |
---|
[6d5623e] | 295 | abac_list_remove(head->edges, tail); |
---|
[d4b3b52] | 296 | abac_list_remove(tail->reverse_vertex->edges, tail); |
---|
[6188f4e] | 297 | |
---|
[06ef09c] | 298 | _free_edge(tail); |
---|
[fc1a6b4] | 299 | free(current); |
---|
[6188f4e] | 300 | } |
---|
| 301 | } |
---|
| 302 | |
---|
[704fde7] | 303 | // add a derived edge, returns 1 if added 0 if dup |
---|
| 304 | static int _derived_edge(abac_graph_t *graph, abac_vertex_t *head, abac_vertex_t *tail) { |
---|
| 305 | abac_edge_t *edge; |
---|
| 306 | |
---|
| 307 | // don't add duplicate edges |
---|
| 308 | abac_list_foreach(head->edges, edge, |
---|
| 309 | if (edge->vertex == tail) |
---|
| 310 | return 0; |
---|
| 311 | ); |
---|
| 312 | |
---|
| 313 | debug_printf("derived edge %s <- %s\n", head->name, tail->name); |
---|
| 314 | |
---|
[06ef09c] | 315 | edge = _get_edge(head, tail, NULL); |
---|
[e2a0f26] | 316 | abac_list_add(head->edges, edge); |
---|
[06ef09c] | 317 | abac_list_add(tail->reverse_edges, _dup_edge(edge)); |
---|
[e2a0f26] | 318 | |
---|
| 319 | // add to list of derived edges |
---|
| 320 | abac_derived_t *derived = abac_xmalloc(sizeof(abac_derived_t)); |
---|
| 321 | derived->key.head = head; |
---|
| 322 | derived->key.tail = edge; |
---|
| 323 | HASH_ADD(hh, graph->derived, key, sizeof(abac_derived_key_t), derived); |
---|
[704fde7] | 324 | |
---|
| 325 | return 1; |
---|
[e2a0f26] | 326 | } |
---|
| 327 | |
---|
| 328 | // find a vertex by name |
---|
| 329 | abac_vertex_t *_find_vertex(abac_graph_t *graph, char *name) { |
---|
| 330 | abac_vertex_t *ret = NULL; |
---|
| 331 | HASH_FIND_STR(graph->vertices, name, ret); |
---|
| 332 | return ret; |
---|
| 333 | } |
---|
| 334 | |
---|
[704fde7] | 335 | /** |
---|
| 336 | * Single iteration of deriving new edges. Returns the number of new edges |
---|
| 337 | * added. |
---|
| 338 | */ |
---|
| 339 | static int _derive_links_iter(abac_graph_t *graph) { |
---|
| 340 | int count = 0; |
---|
[06293d1] | 341 | abac_vertex_t *vertex; |
---|
[d4cbf71] | 342 | |
---|
[ebde9dd] | 343 | for (vertex = graph->vertices; vertex != NULL; vertex = vertex->hh.next) { |
---|
[0eb4a8e] | 344 | // intersection |
---|
[9a411d7] | 345 | if (abac_role_is_intersection(vertex->role)) { |
---|
[0eb4a8e] | 346 | // for each prereq edge: |
---|
| 347 | // find principals that have the edge |
---|
| 348 | // find intersection of all sets |
---|
| 349 | // for each principal B in intersection: |
---|
| 350 | // add link |
---|
[e2a0f26] | 351 | |
---|
| 352 | char *name; |
---|
| 353 | abac_vertex_t *prereq; |
---|
| 354 | abac_set_t *principals = NULL; |
---|
| 355 | |
---|
| 356 | abac_list_foreach(vertex->prereqs, prereq, |
---|
| 357 | abac_set_t *cur = _find_principals(graph, prereq); |
---|
| 358 | |
---|
| 359 | if (principals == NULL) |
---|
| 360 | principals = cur; |
---|
| 361 | else { |
---|
| 362 | abac_set_intersect(principals, cur); |
---|
| 363 | abac_set_free(cur); |
---|
| 364 | } |
---|
| 365 | |
---|
| 366 | if (abac_set_size(principals) == 0) |
---|
| 367 | goto isect_done; |
---|
| 368 | ); |
---|
| 369 | |
---|
| 370 | abac_list_t *prin_names = abac_set_elements(principals); |
---|
| 371 | abac_list_foreach(prin_names, name, |
---|
| 372 | abac_vertex_t *principal = _find_vertex(graph, name); |
---|
[704fde7] | 373 | count += _derived_edge(graph, vertex, principal); |
---|
[e2a0f26] | 374 | ); |
---|
| 375 | |
---|
| 376 | abac_list_free(prin_names); |
---|
| 377 | isect_done: |
---|
| 378 | abac_set_free(principals); |
---|
[0eb4a8e] | 379 | } |
---|
| 380 | |
---|
| 381 | // linking role |
---|
| 382 | else if (abac_role_is_linking(vertex->role)) { |
---|
| 383 | // linking roles take the form A.r1.r2 |
---|
| 384 | char *A_r1 = abac_role_linked_role(vertex->role); |
---|
| 385 | char *r2 = abac_role_role_name(vertex->role); |
---|
| 386 | |
---|
| 387 | // find the linked role in the graph |
---|
| 388 | abac_vertex_t *A_r1_vertex; |
---|
| 389 | HASH_FIND_STR(graph->vertices, A_r1, A_r1_vertex); |
---|
| 390 | if (A_r1_vertex == NULL) |
---|
| 391 | continue; |
---|
| 392 | |
---|
| 393 | // find the principals that have A.r1 |
---|
| 394 | abac_set_t *principals = _find_principals(graph, A_r1_vertex); |
---|
| 395 | char *B; |
---|
| 396 | |
---|
| 397 | abac_list_t *elts = abac_set_elements(principals); |
---|
| 398 | |
---|
| 399 | // and add a link for each B.r2 to A.r1.r2 |
---|
| 400 | abac_list_foreach(elts, B, |
---|
| 401 | int B_len = strlen(B); |
---|
| 402 | int r2_len = strlen(r2); |
---|
| 403 | |
---|
| 404 | // create the string B.r2, thx C |
---|
| 405 | char *B_r2 = malloc(B_len + r2_len + 2); |
---|
| 406 | memcpy(B_r2, B, B_len); |
---|
| 407 | B_r2[B_len] = '.'; |
---|
| 408 | memcpy(B_r2 + B_len + 1, r2, r2_len); |
---|
| 409 | B_r2[B_len + r2_len + 1] = 0; |
---|
| 410 | |
---|
| 411 | // add an edge if the principal's granted it to someone |
---|
[e2a0f26] | 412 | abac_vertex_t *B_r2_vertex = _find_vertex(graph, B_r2); |
---|
[0eb4a8e] | 413 | if (B_r2_vertex) { |
---|
| 414 | debug_printf("adding edge from %s to %s\n", B_r2, abac_role_string(vertex->role)); |
---|
[704fde7] | 415 | count += _derived_edge(graph, vertex, B_r2_vertex); |
---|
[0eb4a8e] | 416 | } |
---|
[ebde9dd] | 417 | |
---|
[dbbf777] | 418 | #ifdef DEBUG |
---|
[0eb4a8e] | 419 | debug_printf(" incoming edges for %s\n", abac_role_string(vertex->role)); |
---|
| 420 | abac_edge_t *cur; |
---|
| 421 | abac_list_foreach(vertex->edges, cur, |
---|
| 422 | debug_printf(" %s (%s)\n", abac_role_string(cur->vertex->role), cur->vertex->name); |
---|
| 423 | ); |
---|
[dbbf777] | 424 | #endif |
---|
[d4cbf71] | 425 | |
---|
[0eb4a8e] | 426 | free(B_r2); |
---|
| 427 | ); |
---|
[ebde9dd] | 428 | |
---|
[0eb4a8e] | 429 | abac_list_free(elts); |
---|
| 430 | abac_set_free(principals); |
---|
| 431 | } |
---|
[ebde9dd] | 432 | } |
---|
[6188f4e] | 433 | |
---|
[704fde7] | 434 | return count; |
---|
| 435 | } |
---|
| 436 | |
---|
| 437 | /** |
---|
| 438 | * Derive all implied edges in the graph. These can come from linking roles |
---|
| 439 | * and intersections. |
---|
| 440 | * |
---|
| 441 | * We have to do it iteratively because derived edges can imply new edges. |
---|
| 442 | */ |
---|
| 443 | void abac_graph_derive_links(abac_graph_t *graph) { |
---|
| 444 | if (!graph->dirty) |
---|
| 445 | return; |
---|
| 446 | |
---|
| 447 | // iterate as long as new links are derived |
---|
| 448 | while (_derive_links_iter(graph) > 0) |
---|
| 449 | ; |
---|
| 450 | |
---|
[6188f4e] | 451 | graph->dirty = 0; |
---|
[d4cbf71] | 452 | } |
---|
[cb0f2b2] | 453 | |
---|
[d4b3b52] | 454 | static void _reverse_order_recurse(abac_vertex_t *vertex, abac_set_t *seen, int preorder, abac_list_t *stack) { |
---|
| 455 | abac_edge_t *outgoing; |
---|
| 456 | |
---|
| 457 | // don't revisit nodes |
---|
| 458 | if (!abac_set_add(seen, abac_role_string(vertex->role))) |
---|
| 459 | return; |
---|
| 460 | |
---|
[fc1a6b4] | 461 | if (preorder) { |
---|
[d4b3b52] | 462 | abac_list_add(stack, vertex); |
---|
[fc1a6b4] | 463 | } |
---|
[d4b3b52] | 464 | |
---|
| 465 | // recurse along the incoming vertices |
---|
| 466 | abac_list_foreach(vertex->reverse_edges, outgoing, |
---|
| 467 | _reverse_order_recurse(outgoing->reverse_vertex, seen, preorder, stack); |
---|
| 468 | ); |
---|
| 469 | |
---|
[fc1a6b4] | 470 | if (!preorder) { |
---|
[d4b3b52] | 471 | abac_list_add(stack, vertex); |
---|
[fc1a6b4] | 472 | } |
---|
[d4b3b52] | 473 | } |
---|
| 474 | |
---|
| 475 | static abac_list_t *_reverse_order(abac_graph_t *graph, abac_role_t *start, int preorder) { |
---|
| 476 | debug_printf("%sorder at %s\n", preorder ? "pre" : "post", abac_role_string(start)); |
---|
| 477 | |
---|
[fc1a6b4] | 478 | |
---|
[d4b3b52] | 479 | abac_vertex_t *start_vertex = _get_vertex(graph, start); |
---|
[fc1a6b4] | 480 | |
---|
[d4b3b52] | 481 | abac_set_t *seen = abac_set_new(); |
---|
| 482 | |
---|
| 483 | // create the return list |
---|
| 484 | abac_list_t *stack = abac_list_new(); |
---|
| 485 | |
---|
| 486 | _reverse_order_recurse(start_vertex, seen, preorder, stack); |
---|
| 487 | |
---|
| 488 | abac_set_free(seen); |
---|
| 489 | |
---|
[fc1a6b4] | 490 | |
---|
[d4b3b52] | 491 | return stack; |
---|
| 492 | } |
---|
| 493 | |
---|
[06293d1] | 494 | static void _order_recurse(abac_vertex_t *vertex, abac_set_t *seen, int preorder, abac_list_t *stack) { |
---|
| 495 | abac_edge_t *incoming; |
---|
[cb0f2b2] | 496 | |
---|
| 497 | // don't revisit nodes |
---|
[9a411d7] | 498 | if (!abac_set_add(seen, abac_role_string(vertex->role))) |
---|
[cb0f2b2] | 499 | return; |
---|
| 500 | |
---|
[fc1a6b4] | 501 | if (preorder) { |
---|
[6d5623e] | 502 | abac_list_add(stack, vertex); |
---|
[fc1a6b4] | 503 | } |
---|
[cb0f2b2] | 504 | |
---|
[9536712] | 505 | // recurse along the incoming vertices |
---|
[6d5623e] | 506 | abac_list_foreach(vertex->edges, incoming, |
---|
[ae72c5d] | 507 | _order_recurse(incoming->vertex, seen, preorder, stack); |
---|
[379a53f] | 508 | ); |
---|
[cb0f2b2] | 509 | |
---|
[fc1a6b4] | 510 | if (!preorder) { |
---|
[6d5623e] | 511 | abac_list_add(stack, vertex); |
---|
[fc1a6b4] | 512 | } |
---|
[cb0f2b2] | 513 | } |
---|
| 514 | |
---|
[06293d1] | 515 | static abac_list_t *_order(abac_graph_t *graph, abac_role_t *start, int preorder) { |
---|
[dcc1a8e] | 516 | debug_printf("%sorder at %s\n", preorder ? "pre" : "post", abac_role_string(start)); |
---|
[ebde9dd] | 517 | |
---|
[06293d1] | 518 | abac_vertex_t *start_vertex = _get_vertex(graph, start); |
---|
[fc1a6b4] | 519 | |
---|
[2fd24c7] | 520 | abac_set_t *seen = abac_set_new(); |
---|
[cb0f2b2] | 521 | |
---|
[379a53f] | 522 | // create the return list |
---|
[6d5623e] | 523 | abac_list_t *stack = abac_list_new(); |
---|
[cb0f2b2] | 524 | |
---|
| 525 | _order_recurse(start_vertex, seen, preorder, stack); |
---|
| 526 | |
---|
[2fd24c7] | 527 | abac_set_free(seen); |
---|
[be963dc] | 528 | |
---|
[cb0f2b2] | 529 | return stack; |
---|
| 530 | } |
---|
| 531 | |
---|
[06293d1] | 532 | abac_list_t *abac_graph_postorder(abac_graph_t *graph, abac_role_t *start) { |
---|
[82aeefa] | 533 | return _order(graph, start, 0); |
---|
[cb0f2b2] | 534 | } |
---|
[97a5e13] | 535 | |
---|
[4e426c9] | 536 | /** |
---|
| 537 | * Postorder traverse the graph and return all the credentials within. |
---|
| 538 | */ |
---|
| 539 | abac_list_t *abac_graph_postorder_credentials(abac_graph_t *graph, char *start) { |
---|
| 540 | abac_vertex_t *vertex; |
---|
| 541 | abac_edge_t *incoming; |
---|
| 542 | |
---|
| 543 | // get the postorder of vertices |
---|
| 544 | abac_role_t *role = abac_role_from_string(start); |
---|
| 545 | abac_list_t *order = abac_graph_postorder(graph, role); |
---|
| 546 | |
---|
| 547 | // go through the list and dup all the credentials |
---|
| 548 | abac_list_t *credentials = abac_list_new(); |
---|
| 549 | abac_list_foreach(order, vertex, |
---|
| 550 | abac_list_foreach(vertex->edges, incoming, |
---|
[fc1a6b4] | 551 | if (incoming->credential != NULL) { |
---|
[4e426c9] | 552 | abac_list_add(credentials, abac_credential_dup(incoming->credential)); |
---|
[fc1a6b4] | 553 | } |
---|
[4e426c9] | 554 | ); |
---|
| 555 | ); |
---|
| 556 | |
---|
| 557 | abac_role_free(role); |
---|
| 558 | abac_list_free(order); |
---|
| 559 | |
---|
| 560 | return credentials; |
---|
| 561 | } |
---|
| 562 | |
---|
[d4b3b52] | 563 | |
---|
| 564 | abac_list_t *abac_graph_postorder_reverse(abac_graph_t *graph, abac_role_t *start) { |
---|
| 565 | return _reverse_order(graph, start, 0); |
---|
| 566 | } |
---|
| 567 | |
---|
| 568 | /** |
---|
| 569 | * Postorder traverse the graph and return all the credentials within. |
---|
| 570 | */ |
---|
| 571 | abac_list_t *abac_graph_postorder_reverse_credentials(abac_graph_t *graph, char *start) { |
---|
| 572 | abac_vertex_t *vertex; |
---|
| 573 | abac_edge_t *outgoing; |
---|
| 574 | |
---|
| 575 | // get the postorder of vertices |
---|
| 576 | abac_role_t *role = abac_role_from_string(start); |
---|
| 577 | abac_list_t *order = abac_graph_postorder_reverse(graph, role); |
---|
| 578 | |
---|
| 579 | // go through the list and dup all the credentials |
---|
| 580 | abac_list_t *credentials = abac_list_new(); |
---|
[fc1a6b4] | 581 | |
---|
[d4b3b52] | 582 | abac_list_foreach(order, vertex, |
---|
| 583 | abac_list_foreach(vertex->reverse_edges, outgoing, |
---|
[fc1a6b4] | 584 | if (outgoing->credential != NULL) { |
---|
[d4b3b52] | 585 | abac_list_add(credentials, abac_credential_dup(outgoing->credential)); |
---|
[fc1a6b4] | 586 | } |
---|
[d4b3b52] | 587 | ); |
---|
| 588 | ); |
---|
| 589 | |
---|
| 590 | abac_role_free(role); |
---|
| 591 | abac_list_free(order); |
---|
| 592 | |
---|
| 593 | return credentials; |
---|
| 594 | } |
---|
| 595 | |
---|
[401a054] | 596 | static void _query(abac_graph_t *graph, char *role_name, char *principal, abac_graph_t *return_graph) { |
---|
[06293d1] | 597 | abac_vertex_t *vertex; |
---|
| 598 | abac_edge_t *incoming; |
---|
[401a054] | 599 | abac_role_t *role = abac_role_from_string(role_name); |
---|
[dcc1a8e] | 600 | abac_role_t *prin_role = abac_role_from_string(principal); |
---|
[97a5e13] | 601 | |
---|
[675cbea] | 602 | // give up on bogus roles |
---|
| 603 | if (role == NULL || prin_role == NULL) { |
---|
[f2622ee] | 604 | abac_role_free(role); |
---|
| 605 | abac_role_free(prin_role); |
---|
[675cbea] | 606 | return; |
---|
| 607 | } |
---|
| 608 | |
---|
[2fd24c7] | 609 | abac_set_t *on_path = abac_set_new(); |
---|
[dcc1a8e] | 610 | abac_set_add(on_path, abac_role_string(prin_role)); |
---|
[97a5e13] | 611 | |
---|
[401a054] | 612 | abac_list_t *traversal = abac_graph_postorder(graph, role); |
---|
[6d5623e] | 613 | abac_list_foreach(traversal, vertex, |
---|
[1743825] | 614 | abac_role_t *role = vertex->role; |
---|
[97a5e13] | 615 | |
---|
[6d5623e] | 616 | abac_list_foreach(vertex->edges, incoming, |
---|
[1743825] | 617 | abac_role_t *incoming_role = incoming->vertex->role; |
---|
[97a5e13] | 618 | |
---|
[9a411d7] | 619 | if (!abac_set_contains(on_path, abac_role_string(incoming_role))) |
---|
[ae72c5d] | 620 | continue; |
---|
[97a5e13] | 621 | |
---|
[9a411d7] | 622 | abac_set_add(on_path, abac_role_string(role)); |
---|
[97a5e13] | 623 | |
---|
[ebe824c] | 624 | // get implying edges for intersection vertices |
---|
[9a411d7] | 625 | if (abac_role_is_intersection(role)) { |
---|
[ebe824c] | 626 | abac_vertex_t *prereq; |
---|
| 627 | abac_list_foreach(vertex->prereqs, prereq, |
---|
| 628 | _query(graph, prereq->name, principal, return_graph); |
---|
| 629 | ); |
---|
[e2a0f26] | 630 | } |
---|
[97a5e13] | 631 | |
---|
| 632 | // recursively find linked roles |
---|
[e2a0f26] | 633 | else if (abac_role_is_linking(role)) { |
---|
[401a054] | 634 | char *linked_role = abac_role_linked_role(role); |
---|
[dcc1a8e] | 635 | char *principal = abac_role_principal(incoming_role); |
---|
[97a5e13] | 636 | |
---|
[401a054] | 637 | _query(graph, linked_role, principal, return_graph); |
---|
[97a5e13] | 638 | } |
---|
[e2a0f26] | 639 | |
---|
| 640 | // add non-derived edges to the proof graph |
---|
| 641 | else |
---|
| 642 | abac_graph_add_credential(return_graph, incoming->credential); |
---|
[97a5e13] | 643 | ); |
---|
| 644 | ); |
---|
| 645 | |
---|
[6d5623e] | 646 | abac_list_free(traversal); |
---|
[2fd24c7] | 647 | abac_set_free(on_path); |
---|
[401a054] | 648 | abac_role_free(role); |
---|
[dcc1a8e] | 649 | abac_role_free(prin_role); |
---|
[97a5e13] | 650 | } |
---|
| 651 | |
---|
[401a054] | 652 | abac_graph_t *abac_graph_query(abac_graph_t *graph, char *role, char *principal) { |
---|
[06293d1] | 653 | abac_graph_derive_links(graph); |
---|
[97a5e13] | 654 | |
---|
[06293d1] | 655 | abac_graph_t *return_graph = abac_graph_new(); |
---|
[401a054] | 656 | _query(graph, role, principal, return_graph); |
---|
[06293d1] | 657 | abac_graph_derive_links(return_graph); |
---|
[97a5e13] | 658 | return return_graph; |
---|
| 659 | } |
---|
[be963dc] | 660 | |
---|
[d4b3b52] | 661 | abac_graph_t *abac_graph_principal_creds(abac_graph_t *graph, char *principal) { |
---|
| 662 | abac_graph_derive_links(graph); |
---|
| 663 | abac_graph_t *result_graph = abac_graph_new(); |
---|
[fc1a6b4] | 664 | |
---|
[d4b3b52] | 665 | abac_list_t *result = abac_graph_postorder_reverse_credentials(graph, |
---|
| 666 | principal); |
---|
[fc1a6b4] | 667 | |
---|
[d4b3b52] | 668 | abac_credential_t *cur = NULL; |
---|
[f6576c4] | 669 | int add_ret; |
---|
[d4b3b52] | 670 | abac_list_foreach(result, cur, |
---|
[f6576c4] | 671 | add_ret=abac_graph_add_credential(result_graph, cur); |
---|
| 672 | assert(add_ret != ABAC_GRAPH_CRED_INVALID); |
---|
| 673 | abac_credential_free(cur); |
---|
[d4b3b52] | 674 | ); |
---|
| 675 | abac_list_free(result); |
---|
| 676 | /* For each terminal role that the principal can reach, roll a proof into |
---|
| 677 | the result_graph. */ |
---|
[fc1a6b4] | 678 | |
---|
[d4b3b52] | 679 | abac_vertex_t *vertex = NULL; |
---|
| 680 | for (vertex = result_graph->vertices; vertex != NULL; |
---|
| 681 | vertex = vertex->hh.next) { |
---|
| 682 | if ( abac_list_size(vertex->reverse_edges) == 0) |
---|
| 683 | _query(graph, vertex->name, principal, result_graph); |
---|
| 684 | } |
---|
| 685 | abac_graph_derive_links(result_graph); |
---|
[fc1a6b4] | 686 | |
---|
[d4b3b52] | 687 | return result_graph; |
---|
| 688 | } |
---|
| 689 | |
---|
| 690 | |
---|
[902d079] | 691 | /** |
---|
[401a054] | 692 | * Get all the credentials (attribute/issuer cert pairs) from the graph. |
---|
[902d079] | 693 | */ |
---|
[401a054] | 694 | abac_list_t *abac_graph_credentials(abac_graph_t *graph) { |
---|
| 695 | abac_list_t *credentials = abac_list_new(); |
---|
[902d079] | 696 | |
---|
[06293d1] | 697 | abac_vertex_t *vertex; |
---|
[902d079] | 698 | |
---|
| 699 | for (vertex = graph->vertices; vertex != NULL; vertex = vertex->hh.next) { |
---|
[06293d1] | 700 | abac_edge_t *edge; |
---|
[6d5623e] | 701 | abac_list_foreach(vertex->edges, edge, |
---|
[401a054] | 702 | if (edge->credential != NULL) |
---|
| 703 | abac_list_add(credentials, abac_credential_dup(edge->credential)); |
---|
[902d079] | 704 | ); |
---|
| 705 | } |
---|
| 706 | |
---|
[401a054] | 707 | return credentials; |
---|
[902d079] | 708 | } |
---|
| 709 | |
---|
[06293d1] | 710 | void abac_graph_free(abac_graph_t *graph) { |
---|
| 711 | abac_vertex_t *vertex; |
---|
[be963dc] | 712 | |
---|
| 713 | // kill derived edges |
---|
| 714 | _clear_derived(graph); |
---|
| 715 | |
---|
| 716 | // delete vertices |
---|
| 717 | while ((vertex = graph->vertices) != NULL) { |
---|
| 718 | HASH_DEL(graph->vertices, vertex); |
---|
[06ef09c] | 719 | _free_vertex(vertex); |
---|
[be963dc] | 720 | } |
---|
| 721 | |
---|
| 722 | free(graph); |
---|
| 723 | } |
---|
[f46412c] | 724 | |
---|
[06293d1] | 725 | abac_role_t *abac_vertex_role(abac_vertex_t *vertex) { |
---|
[f46412c] | 726 | return vertex->role; |
---|
| 727 | } |
---|