Lines Matching refs:node
51 policy_set_t node = (policy_set_t)malloc(sizeof(*node));
52 node->oid_next = *policy_set;
53 node->oid = *p_oid;
54 *policy_set = node;
55 secdebug("policy-set", "%p -> %p", node, node->oid_next);
58 void policy_set_free(policy_set_t node) {
59 while (node) {
60 policy_set_t next = node->oid_next;
61 secdebug("policy-set", "%p -> %p", node, next);
62 free(node);
63 node = next;
67 bool policy_set_contains(policy_set_t node, const oid_t *oid) {
68 for (; node; node = node->oid_next) {
69 if (oid_equal(node->oid, *oid))
78 policy_set_t node = other_set;
82 while (node) {
83 if (!policy_set_contains(*policy_set, &node->oid)) {
84 policy_set_add(policy_set, &node->oid);
92 while (node) {
93 policy_set_add(policy_set, &node->oid);
101 policy_set_t node = *pnode;
102 if (policy_set_contains(other_set, &node->oid)) {
103 pnode = &node->oid_next;
105 *pnode = node->oid_next;
106 node->oid_next = NULL;
107 policy_set_free(node);
114 policy_tree_t node = malloc(sizeof(*node));
115 node->valid_policy = *p_oid;
116 node->qualifier_set = p_q;
117 node->expected_policy_set = policy_set_create(p_oid);
118 node->children = NULL;
119 node->siblings = NULL;
120 secdebug("policy-node", "%p", node);
121 return node;
130 policy_tree_t node;
134 /* stack[stack_ix - 1] is the parent of the current node. */
135 node = stack[stack_ix];
136 policy_tree_t child = node->children;
143 /* Proccess node. */
144 match |= callback(node, ctx);
146 /* Move on to sibling of node. */
147 policy_tree_t sibling = node->siblings;
149 /* Replace current node with it's sibling. */
164 static void policy_tree_free_node(policy_tree_t node) {
165 secdebug("policy-node", "%p children: %p siblngs: %p", node,
166 node->children, node->siblings);
167 if (node->expected_policy_set) {
168 policy_set_free(node->expected_policy_set);
169 node->expected_policy_set = NULL;
171 free(node);
174 /* Prune nodes from node down. */
175 void policy_tree_prune(policy_tree_t *node) {
177 policy_tree_t *child = &(*node)->children;
180 policy_tree_t *sibling = &(*node)->siblings;
183 policy_tree_free_node(*node);
184 *node = NULL;
194 policy_tree_t *node;
195 node = stack[stack_ix];
196 policy_tree_t *child = &(*node)->children;
202 /* Childless node found, nuke it. */
205 (intptr_t)node, (intptr_t)*node, (intptr_t)(*node)->siblings,
209 policy_tree_t next = (*node)->siblings;
210 (*node)->siblings = NULL;
211 policy_tree_free_node(*node);
212 *node = next;
214 /* stack[stack_ix] (node) already points to next now. */
222 policy_tree_t *sibling = &(*node)->siblings;
224 /* Replace current node with it's sibling. */
257 secdebug("policy-node", "%p siblngs: %p", child, child->siblings);
269 void policy_tree_set_expected_policy(policy_tree_t node,
271 if (node->expected_policy_set)
272 policy_set_free(node->expected_policy_set);
273 node->expected_policy_set = p_expected;
278 static void policy_tree_dump4(policy_tree_t node, policy_tree_t parent,
280 policy_tree_t child = node->children;
281 policy_tree_t sibling = node->siblings;
285 (intptr_t)parent, (intptr_t)node, (intptr_t)prev_sibling,
288 policy_tree_dump4(child, node, NULL, depth + 1);
290 policy_tree_dump4(sibling, parent, node, depth);
294 void policy_tree_dump(policy_tree_t node) {
296 policy_tree_dump4(node, NULL, NULL, 0);