perf/util/annotate.c

1470 	list_add_tail(&al->node, head);
1476 	list_for_each_entry_continue(pos, head, node)
1613 			list_for_each_entry_from(queue, &notes->src->source, node) {
1776 		dl = list_entry(list->prev, struct disasm_line, al.node);
1788 		list_del_init(&dl->al.node);
1992 		struct btf_node *node;
1994 		node = perf_env__find_btf(dso->bpf_prog.env,
1996 		if (node)
1997 			btf = btf__new((__u8 *)(node->data),
1998 				       node->data_size);
2389 	list_for_each_entry(al, &notes->src->source, node) {
2549 	struct rb_node *node;
2551 	node = rb_first(src_root);
2552 	while (node) {
2555 		al = rb_entry(node, struct annotation_line, rb_node);
2556 		next = rb_next(node);
2557 		rb_erase(node, src_root);
2560 		node = next;
2567 	struct rb_node *node;
2577 	node = rb_first(root);
2578 	while (node) {
2584 		al = rb_entry(node, struct annotation_line, rb_node);
2598 		node = rb_next(node);
2625 	list_for_each_entry_reverse(line, lines, node) {
2686 	list_for_each_entry(pos, &notes->src->source, node) {
2720 				queue = list_entry(queue->node.next, typeof(*queue), node);
2787 	list_for_each_entry(al, &notes->src->source, node) {
2860 	list_for_each_entry_safe(al, n, &as->source, node) {
2861 		list_del_init(&al->node);
2888 	list_for_each_entry(pos, head, al.node)
2944 	list_for_each_entry(al, &src->source, node) {
2980         list_for_each_entry(al, &notes->src->source, node) {
3034 	list_for_each_entry(al, &notes->src->source, node) {
3712 	list_for_each_entry_safe(dl, tmp_dl, &notes->src->source, al.node) {
3714 			list_del(&dl->al.node);
3727 	list_for_each_entry(dl, &notes->src->source, al.node) {
3794 	if (&dl->al.node == notes->src->source.prev)
3797 		next = list_next_entry(dl, al.node);
3932 		prev_dl = list_prev_entry(dl, al.node);