FM / netlink

/usr/include/libnl3/netlink

Name	Size	Mode	Actions
cli/	-	0755	rm
fib_lookup/	-	0755	rm
genl/	-	0755	rm
idiag/	-	0755	rm
netfilter/	-	0755	rm
route/	-	0755	rm
xfrm/	-	0755	rm
addr.h	2280	0644	edit dl rm
attr.h	9739	0644	edit dl rm
cache-api.h	532	0644	edit dl rm
cache.h	6223	0644	edit dl rm
data.h	1048	0644	edit dl rm
errno.h	1465	0644	edit dl rm
handlers.h	3714	0644	edit dl rm
hash.h	1980	0644	edit dl rm
hashtable.h	1352	0644	edit dl rm
list.h	2534	0644	edit dl rm
msg.h	4477	0644	edit dl rm
netlink-compat.h	1032	0644	edit dl rm
netlink-kernel.h	5355	0644	edit dl rm
netlink.h	3175	0644	edit dl rm
object-api.h	479	0644	edit dl rm
object.h	2563	0644	edit dl rm
socket.h	2647	0644	edit dl rm
types.h	2192	0644	edit dl rm
utils.h	11709	0644	edit dl rm
version.h	942	0644	edit dl rm

Edit: /usr/include/libnl3/netlink/list.h (2534B)

/*
 * netlink/list.h	Netlink List Utilities
 *
 *	This library is free software; you can redistribute it and/or
 *	modify it under the terms of the GNU Lesser General Public
 *	License as published by the Free Software Foundation version 2.1
 *	of the License.
 *
 * Copyright (c) 2003-2006 Thomas Graf <tgraf@suug.ch>
 */

#ifndef NETLINK_LIST_H_
#define NETLINK_LIST_H_

#include <stddef.h>

struct nl_list_head
{
	struct nl_list_head *	next;
	struct nl_list_head *	prev;
};

static inline void NL_INIT_LIST_HEAD(struct nl_list_head *list)
{
	list->next = list;
	list->prev = list;
}

static inline void __nl_list_add(struct nl_list_head *obj,
				 struct nl_list_head *prev,
				 struct nl_list_head *next)
{
	prev->next = obj;
	obj->prev = prev;
	next->prev = obj;
	obj->next = next;
}

static inline void nl_list_add_tail(struct nl_list_head *obj,
				    struct nl_list_head *head)
{
	__nl_list_add(obj, head->prev, head);
}

static inline void nl_list_add_head(struct nl_list_head *obj,
				    struct nl_list_head *head)
{
	__nl_list_add(obj, head, head->next);
}

static inline void nl_list_del(struct nl_list_head *obj)
{
	obj->next->prev = obj->prev;
	obj->prev->next = obj->next;
}

static inline int nl_list_empty(struct nl_list_head *head)
{
	return head->next == head;
}

#define nl_container_of(ptr, type, member) ({			\
        const __typeof__( ((type *)0)->member ) *__mptr = (ptr);\
        (type *)( (char *)__mptr - (offsetof(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)				\
	for (pos = nl_list_entry((head)->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)			\
	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))

#define nl_init_list_head(head) \
	do { (head)->next = (head); (head)->prev = (head); } while (0)

#endif

cmd: