Lines Matching defs:node
1257 list_add_tail(&al->node, head);
1263 list_for_each_entry_continue(pos, head, node)
1401 list_for_each_entry_from(queue, ¬es->src->source, node) {
1563 dl = list_entry(list->prev, struct disasm_line, al.node);
1575 list_del_init(&dl->al.node);
1762 struct btf_node *node;
1764 node = perf_env__find_btf(dso->bpf_prog.env,
1766 if (node)
1767 btf = btf__new((__u8 *)(node->data),
1768 node->data_size);
2143 list_for_each_entry(al, ¬es->src->source, node) {
2287 struct rb_node *node;
2289 node = rb_first(src_root);
2290 while (node) {
2293 al = rb_entry(node, struct annotation_line, rb_node);
2294 next = rb_next(node);
2295 rb_erase(node, src_root);
2298 node = next;
2305 struct rb_node *node;
2315 node = rb_first(root);
2316 while (node) {
2322 al = rb_entry(node, struct annotation_line, rb_node);
2336 node = rb_next(node);
2358 list_for_each_entry_reverse(line, lines, node) {
2419 list_for_each_entry(pos, ¬es->src->source, node) {
2453 queue = list_entry(queue->node.next, typeof(*queue), node);
2521 list_for_each_entry(al, ¬es->src->source, node) {
2589 list_for_each_entry_safe(al, n, &as->source, node) {
2590 list_del_init(&al->node);
2617 list_for_each_entry(pos, head, al.node)
2672 list_for_each_entry(al, ¬es->src->source, node) {
2708 list_for_each_entry(al, ¬es->src->source, node) {
2749 list_for_each_entry(al, ¬es->src->source, node) {