Lines Matching refs:node
34 struct bpf_prog_info_node *node;
42 node = rb_entry(parent, struct bpf_prog_info_node, rb_node);
43 if (prog_id < node->info_linear->info.id) {
45 } else if (prog_id > node->info_linear->info.id) {
61 struct bpf_prog_info_node *node = NULL;
68 node = rb_entry(n, struct bpf_prog_info_node, rb_node);
69 if (prog_id < node->info_linear->info.id)
71 else if (prog_id > node->info_linear->info.id)
76 node = NULL;
80 return node;
97 struct btf_node *node;
104 node = rb_entry(parent, struct btf_node, rb_node);
105 if (btf_id < node->id) {
107 } else if (btf_id > node->id) {
133 struct btf_node *node = NULL;
139 node = rb_entry(n, struct btf_node, rb_node);
140 if (btf_id < node->id)
142 else if (btf_id > node->id)
145 return node;
162 struct bpf_prog_info_node *node;
164 node = rb_entry(next, struct bpf_prog_info_node, rb_node);
165 next = rb_next(&node->rb_node);
166 rb_erase(&node->rb_node, root);
167 zfree(&node->info_linear);
168 free(node);
177 struct btf_node *node;
179 node = rb_entry(next, struct btf_node, rb_node);
180 next = rb_next(&node->rb_node);
181 rb_erase(&node->rb_node, root);
182 free(node);
524 * it for missing cpus, which return node -1