list.h File Reference

This graph shows which files directly or indirectly include this file:

Data Structures
struct	nl_list_head

Macros
#define	nl_container_of(ptr, type, member)
#define	nl_list_entry(ptr, type, member)   nl_container_of(ptr, type, member)
#define	nl_list_at_tail(pos, head, member)   ((pos)->member.next == (head))
#define	nl_list_at_head(pos, head, member)   ((pos)->member.prev == (head))
#define	NL_LIST_HEAD(name)   struct nl_list_head name = { &(name), &(name) }
#define	nl_list_first_entry(head, type, member)   nl_list_entry((head)->next, type, member)
#define	nl_list_for_each_entry(pos, head, member)
#define	nl_list_for_each_entry_safe(pos, n, head, member)
#define	nl_list_prepare_entry(pos, head, member)   ((pos) ? : nl_list_entry(head, typeof(*pos), member))
#define	nl_list_for_each_entry_continue(pos, head, member)
#define	nl_init_list_head(head)   do { (head)->next = (head); (head)->prev = (head); } while (0)

Macro Definition Documentation

#define nl_container_of	(		ptr,
			type,
			member
	)

Value:

({          \
        const typeof( ((type *)0)->member ) *__mptr = (ptr);    \
        (type *)( (char *)__mptr - ((size_t) &((type *)0)->member));})

#define nl_init_list_head

(

head

)

do { (head)->next = (head); (head)->prev = (head); } while (0)

Referenced by nl_cache_alloc(), nl_object_alloc(), and rtnl_route_nh_alloc().

#define nl_list_at_head	(		pos,
			head,
			member
	)		((pos)->member.prev == (head))

Referenced by nl_cache_get_prev().

#define nl_list_at_tail	(		pos,
			head,
			member
	)		((pos)->member.next == (head))

Referenced by nl_cache_get_next().

#define nl_list_entry	(		ptr,
			type,
			member
	)		nl_container_of(ptr, type, member)

Referenced by nl_cache_get_first(), nl_cache_get_last(), nl_cache_get_next(), and nl_cache_get_prev().

#define nl_list_first_entry	(		head,
			type,
			member
	)		nl_list_entry((head)->next, type, member)

Referenced by rtnl_route_parse().

#define nl_list_for_each_entry	(		pos,
			head,
			member
	)

Value:

for (pos = nl_list_entry((head)->next, typeof(*pos), member);   \
         &(pos)->member != (head);  \
         (pos) = nl_list_entry((pos)->member.next, typeof(*(pos)), member))

Referenced by __nft_expr_lookup_ops(), genl_ctrl_search(), genl_ctrl_search_by_name(), genl_mngt_resolve(), genl_op2name(), lookup_cls_mod(), nfnl_nft_rule_foreach_expr(), nft_expr_register(), nl_cache_dump_filter(), nl_cache_mark_all(), nl_cache_nitems_filter(), nl_cache_search(), nl_cache_subset(), rtnl_class_get(), rtnl_ematch_lookup_ops(), rtnl_ematch_lookup_ops_name(), rtnl_ematch_unregister(), rtnl_link_get(), rtnl_link_get_by_name(), rtnl_neigh_get(), rtnl_neightbl_get(), rtnl_qdisc_get(), rtnl_qdisc_get_by_parent(), rtnl_route_build_msg(), rtnl_route_foreach_nexthop(), rtnl_route_guess_scope(), and rtnl_route_nexthop_n().

#define nl_list_for_each_entry_continue	(		pos,
			head,
			member
	)

Value:

for (pos = nl_list_entry(pos->member.next, typeof(*pos), member);   \
         &(pos)->member != (head);  \
	     pos = nl_list_entry(pos->member.next, typeof(*pos), member))

#define nl_list_for_each_entry_safe	(		pos,
			n,
			head,
			member
	)

Value:

for (pos = nl_list_entry((head)->next, typeof(*pos), member),   \
        n = nl_list_entry(pos->member.next, typeof(*pos), member);  \
         &(pos)->member != (head);                  \
	     pos = n, n = nl_list_entry(n->member.next, typeof(*n), member))

Referenced by nl_cache_clear(), nl_cache_foreach_filter(), and nl_cache_resync().

#define NL_LIST_HEAD

(

name

)

struct nl_list_head name = { &(name), &(name) }

#define nl_list_prepare_entry	(		pos,
			head,
			member
	)		((pos) ? : nl_list_entry(head, typeof(*pos), member))