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;
169 struct token_perm_node *target_node = NULL;
171 find_node_by_token(*root_node, node->perm_data.token, &target_node, &parent_node);
172 if (target_node != NULL) {
173 target_node->perm_data = node->perm_data;
197 struct token_perm_node *target_node = NULL;
199 find_node_by_token(*root_node, token, &target_node, &parent_node);
200 if (target_node == NULL) {
213 if (target_node->right != NULL) {
214 *new_node_addr = target_node->right;
215 add_node_to_left_tree_tail(target_node->right, target_node->left);
217 *new_node_addr = target_node->left;
220 return target_node;
256 struct token_perm_node *target_node = remove_node_by_token(&g_token_perm_root, token);
257 if (target_node != NULL)
258 kmem_cache_free(g_cache, target_node);
279 struct token_perm_node *target_node = NULL;
282 find_node_by_token(g_token_perm_root, set_perm_data.token, &target_node, &parent_node);
283 if (target_node == NULL) {
290 target_node->perm_data.perm[idx] |= (uint32_t)0x01 << bit_idx;
292 target_node->perm_data.perm[idx] &= ~((uint32_t)0x01 << bit_idx);
310 struct token_perm_node *target_node = NULL;
313 find_node_by_token(g_token_perm_root, get_perm_data.token, &target_node, &parent_node);
314 if (target_node == NULL) {
320 int ret = (target_node->perm_data.perm[idx] & ((uint32_t)0x01 << bit_idx)) >> bit_idx;