Lines Matching defs:node
40 struct inline_node *node)
52 list_add_tail(&ilist->list, &node->val);
54 list_add(&ilist->list, &node->val);
279 struct inline_node *node,
289 return inline_list__append(inline_sym, srcline, node);
294 bool unwind_inlines, struct inline_node *node,
322 if (node && inline_list__append_dso_a2l(dso, node, sym))
332 if (node != NULL) {
333 if (inline_list__append_dso_a2l(dso, node, sym))
367 struct inline_node *node;
369 node = zalloc(sizeof(*node));
370 if (node == NULL) {
371 perror("not enough memory for the inline node");
375 INIT_LIST_HEAD(&node->val);
376 node->addr = addr;
378 addr2line(dso_name, addr, NULL, NULL, dso, true, node, sym);
379 return node;
409 struct inline_node *node __maybe_unused,
455 struct inline_node *node;
470 node = zalloc(sizeof(*node));
471 if (node == NULL) {
472 perror("not enough memory for the inline node");
476 INIT_LIST_HEAD(&node->val);
477 node->addr = addr;
495 if (inline_list__append(inline_sym, srcline, node) != 0) {
508 return node;
618 struct srcline_node *i, *node;
621 node = zalloc(sizeof(struct srcline_node));
622 if (!node) {
623 perror("not enough memory for the srcline node");
627 node->addr = addr;
628 node->srcline = srcline;
640 rb_link_node(&node->rb_node, parent, p);
641 rb_insert_color_cached(&node->rb_node, tree, leftmost);
689 void inline_node__delete(struct inline_node *node)
693 list_for_each_entry_safe(ilist, tmp, &node->val, list) {
702 free(node);