Lines Matching refs:target_node
144 struct token_perm_node **target_node, struct token_perm_node **parent_node)
146 *target_node = NULL;
151 *target_node = current_node;
165 struct token_perm_node *target_node = NULL;
167 find_node_by_token(root_node, node->perm_data.token, &target_node, &parent_node);
168 if (target_node != NULL) {
169 target_node->perm_data = node->perm_data;
189 struct token_perm_node *target_node = NULL;
191 find_node_by_token(root_node, token, &target_node, &parent_node);
192 if (target_node == NULL) {
205 if (target_node->right != NULL) {
206 *new_node_addr = target_node->right;
207 add_node_to_left_tree_tail(target_node->right, target_node->left);
209 *new_node_addr = target_node->left;
212 return target_node;
248 struct token_perm_node *target_node = remove_node_by_token(g_token_perm_root, token);
251 if (target_node != NULL)
252 kmem_cache_free(g_cache, target_node);
272 struct token_perm_node *target_node = NULL;
275 find_node_by_token(g_token_perm_root, set_perm_data.token, &target_node, &parent_node);
276 if (target_node == NULL) {
283 target_node->perm_data.perm[idx] |= (uint32_t)0x01 << bit_idx;
285 target_node->perm_data.perm[idx] &= ~((uint32_t)0x01 << bit_idx);
303 struct token_perm_node *target_node = NULL;
306 find_node_by_token(g_token_perm_root, get_perm_data.token, &target_node, &parent_node);
308 if (target_node == NULL)
312 return (target_node->perm_data.perm[idx] & ((uint32_t)0x01 << bit_idx)) >> bit_idx;