Lines Matching defs:node
40 int inline_list__append(struct symbol *symbol, char *srcline, struct inline_node *node)
52 list_add_tail(&ilist->list, &node->val);
54 list_add(&ilist->list, &node->val);
59 int inline_list__append_tail(struct symbol *symbol, char *srcline, struct inline_node *node)
71 list_add(&ilist->list, &node->val);
73 list_add_tail(&ilist->list, &node->val);
134 struct dso *dso, bool unwind_inlines, struct inline_node *node,
159 node, sym);
163 node, sym);
167 node, sym);
171 node, sym);
231 struct inline_node *node;
233 node = zalloc(sizeof(*node));
234 if (node == NULL) {
235 perror("not enough memory for the inline node");
239 INIT_LIST_HEAD(&node->val);
240 node->addr = addr;
243 /*unwind_inlines=*/true, node, sym);
245 return node;
271 unwind_inlines, /*node=*/NULL, sym))
318 /*node=*/NULL, /*sym=*/NULL))
361 struct srcline_node *i, *node;
364 node = zalloc(sizeof(struct srcline_node));
365 if (!node) {
366 perror("not enough memory for the srcline node");
370 node->addr = addr;
371 node->srcline = srcline;
383 rb_link_node(&node->rb_node, parent, p);
384 rb_insert_color_cached(&node->rb_node, tree, leftmost);
432 void inline_node__delete(struct inline_node *node)
436 list_for_each_entry_safe(ilist, tmp, &node->val, list) {
445 free(node);