Lines Matching defs:node
29 struct bpf_prog_info_node *node;
37 node = rb_entry(parent, struct bpf_prog_info_node, rb_node);
38 if (prog_id < node->info_linear->info.id) {
40 } else if (prog_id > node->info_linear->info.id) {
56 struct bpf_prog_info_node *node = NULL;
63 node = rb_entry(n, struct bpf_prog_info_node, rb_node);
64 if (prog_id < node->info_linear->info.id)
66 else if (prog_id > node->info_linear->info.id)
71 node = NULL;
75 return node;
92 struct btf_node *node;
99 node = rb_entry(parent, struct btf_node, rb_node);
100 if (btf_id < node->id) {
102 } else if (btf_id > node->id) {
128 struct btf_node *node = NULL;
134 node = rb_entry(n, struct btf_node, rb_node);
135 if (btf_id < node->id)
137 else if (btf_id > node->id)
140 return node;
157 struct bpf_prog_info_node *node;
159 node = rb_entry(next, struct bpf_prog_info_node, rb_node);
160 next = rb_next(&node->rb_node);
161 rb_erase(&node->rb_node, root);
162 free(node->info_linear);
163 free(node);
172 struct btf_node *node;
174 node = rb_entry(next, struct btf_node, rb_node);
175 next = rb_next(&node->rb_node);
176 rb_erase(&node->rb_node, root);
177 free(node);
399 * it for missing cpus, which return node -1