[cb0f2b2] | 1 | #include <stdlib.h> |
---|
| 2 | |
---|
[2fd24c7] | 3 | #include "abac_set.h" |
---|
[3c251d0] | 4 | #include "abac_util.h" |
---|
[cb0f2b2] | 5 | |
---|
| 6 | #include "uthash.h" |
---|
| 7 | |
---|
[2fd24c7] | 8 | typedef struct _abac_set_element_t { |
---|
[fdb4f28] | 9 | char *key; |
---|
| 10 | UT_hash_handle hh; |
---|
[2fd24c7] | 11 | } abac_set_element_t; |
---|
[fdb4f28] | 12 | |
---|
[2fd24c7] | 13 | struct _abac_set_t { |
---|
| 14 | abac_set_element_t *elts; |
---|
[e2a0f26] | 15 | int size; |
---|
[fdb4f28] | 16 | }; |
---|
| 17 | |
---|
[48f3a37] | 18 | /** |
---|
| 19 | * Create a new struct. |
---|
| 20 | */ |
---|
[2fd24c7] | 21 | abac_set_t *abac_set_new(void) { |
---|
[3c251d0] | 22 | abac_set_t *ret = abac_xmalloc(sizeof(abac_set_t)); |
---|
[cb0f2b2] | 23 | ret->elts = NULL; |
---|
[e2a0f26] | 24 | ret->size = 0; |
---|
[cb0f2b2] | 25 | return ret; |
---|
| 26 | } |
---|
| 27 | |
---|
| 28 | /** |
---|
| 29 | * Add an item to the set, returns true if it doesn't exist. |
---|
| 30 | */ |
---|
[2fd24c7] | 31 | int abac_set_add(abac_set_t *set, char *value) { |
---|
| 32 | abac_set_element_t *elt; |
---|
[cb0f2b2] | 33 | |
---|
| 34 | HASH_FIND_STR(set->elts, value, elt); |
---|
| 35 | if (elt) return 0; // already exists |
---|
| 36 | |
---|
[3c251d0] | 37 | elt = abac_xmalloc(sizeof(abac_set_element_t)); |
---|
| 38 | elt->key = abac_xstrdup(value); |
---|
[cb0f2b2] | 39 | HASH_ADD_KEYPTR(hh, set->elts, elt->key, strlen(elt->key), elt); |
---|
| 40 | |
---|
[e2a0f26] | 41 | ++set->size; |
---|
| 42 | |
---|
[cb0f2b2] | 43 | return 1; |
---|
| 44 | } |
---|
[ebde9dd] | 45 | |
---|
[1fa0621] | 46 | /** |
---|
| 47 | * Does the set contain the value. |
---|
| 48 | */ |
---|
[2fd24c7] | 49 | int abac_set_contains(abac_set_t *set, char *value) { |
---|
| 50 | abac_set_element_t *elt; |
---|
[1fa0621] | 51 | |
---|
| 52 | HASH_FIND_STR(set->elts, value, elt); |
---|
| 53 | return elt != NULL; |
---|
| 54 | } |
---|
| 55 | |
---|
[ebde9dd] | 56 | /** |
---|
| 57 | * Return a list of the set's elements. |
---|
| 58 | */ |
---|
[2fd24c7] | 59 | abac_list_t *abac_set_elements(abac_set_t *set) { |
---|
| 60 | abac_set_element_t *elt; |
---|
[6d5623e] | 61 | abac_list_t *ret = abac_list_new(); |
---|
[ebde9dd] | 62 | |
---|
| 63 | for (elt = set->elts; elt != NULL; elt = elt->hh.next) { |
---|
| 64 | char *next = elt->key; |
---|
[6d5623e] | 65 | abac_list_add(ret, next); |
---|
[ebde9dd] | 66 | } |
---|
| 67 | |
---|
| 68 | return ret; |
---|
| 69 | } |
---|
| 70 | |
---|
[e2a0f26] | 71 | /** |
---|
| 72 | * Returns the number of elements in the set. |
---|
| 73 | */ |
---|
| 74 | int abac_set_size(abac_set_t *set) { |
---|
| 75 | return set->size; |
---|
| 76 | } |
---|
| 77 | |
---|
| 78 | /** |
---|
| 79 | * Takes the intersection of l and r. |
---|
| 80 | */ |
---|
| 81 | void abac_set_intersect(abac_set_t *l, abac_set_t *r) { |
---|
| 82 | abac_set_element_t *elt, *next; |
---|
| 83 | |
---|
| 84 | for (elt = l->elts; elt != NULL; elt = next) { |
---|
| 85 | next = elt->hh.next; |
---|
| 86 | |
---|
| 87 | // if the rhs doesn't contain this item, remove it |
---|
| 88 | if (!abac_set_contains(r, elt->key)) { |
---|
| 89 | HASH_DEL(l->elts, elt); |
---|
| 90 | free(elt->key); |
---|
| 91 | free(elt); |
---|
| 92 | --l->size; |
---|
| 93 | } |
---|
| 94 | } |
---|
| 95 | } |
---|
| 96 | |
---|
[ebde9dd] | 97 | /** |
---|
| 98 | * Destroy a set. |
---|
| 99 | */ |
---|
[2fd24c7] | 100 | void abac_set_free(abac_set_t *set) { |
---|
| 101 | abac_set_element_t *elt; |
---|
[ebde9dd] | 102 | |
---|
[be963dc] | 103 | while ((elt = set->elts) != NULL) { |
---|
| 104 | HASH_DEL(set->elts, elt); |
---|
[ebde9dd] | 105 | free(elt->key); |
---|
[be963dc] | 106 | free(elt); |
---|
| 107 | } |
---|
[ebde9dd] | 108 | |
---|
| 109 | free(set); |
---|
| 110 | } |
---|