openbox lab initialized
This commit is contained in:
150
openflow/usr/include/quagga/linklist.h
Normal file
150
openflow/usr/include/quagga/linklist.h
Normal file
@@ -0,0 +1,150 @@
|
||||
/* Generic linked list
|
||||
* Copyright (C) 1997, 2000 Kunihiro Ishiguro
|
||||
*
|
||||
* This file is part of GNU Zebra.
|
||||
*
|
||||
* GNU Zebra is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License as published by the
|
||||
* Free Software Foundation; either version 2, or (at your option) any
|
||||
* later version.
|
||||
*
|
||||
* GNU Zebra is distributed in the hope that it will be useful, but
|
||||
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
* General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with GNU Zebra; see the file COPYING. If not, write to the Free
|
||||
* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
||||
* 02111-1307, USA.
|
||||
*/
|
||||
|
||||
#ifndef _ZEBRA_LINKLIST_H
|
||||
#define _ZEBRA_LINKLIST_H
|
||||
|
||||
/* listnodes must always contain data to be valid. Adding an empty node
|
||||
* to a list is invalid
|
||||
*/
|
||||
struct listnode
|
||||
{
|
||||
struct listnode *next;
|
||||
struct listnode *prev;
|
||||
|
||||
/* private member, use getdata() to retrieve, do not access directly */
|
||||
void *data;
|
||||
};
|
||||
|
||||
struct list
|
||||
{
|
||||
struct listnode *head;
|
||||
struct listnode *tail;
|
||||
|
||||
/* invariant: count is the number of listnodes in the list */
|
||||
unsigned int count;
|
||||
|
||||
/*
|
||||
* Returns -1 if val1 < val2, 0 if equal?, 1 if val1 > val2.
|
||||
* Used as definition of sorted for listnode_add_sort
|
||||
*/
|
||||
int (*cmp) (void *val1, void *val2);
|
||||
|
||||
/* callback to free user-owned data when listnode is deleted. supplying
|
||||
* this callback is very much encouraged!
|
||||
*/
|
||||
void (*del) (void *val);
|
||||
};
|
||||
|
||||
#define listnextnode(X) ((X) ? ((X)->next) : NULL)
|
||||
#define listhead(X) ((X) ? ((X)->head) : NULL)
|
||||
#define listtail(X) ((X) ? ((X)->tail) : NULL)
|
||||
#define listcount(X) ((X)->count)
|
||||
#define list_isempty(X) ((X)->head == NULL && (X)->tail == NULL)
|
||||
#define listgetdata(X) (assert((X)->data != NULL), (X)->data)
|
||||
|
||||
/* Prototypes. */
|
||||
extern struct list *list_new(void); /* encouraged: set list.del callback on new lists */
|
||||
extern void list_free (struct list *);
|
||||
|
||||
extern void listnode_add (struct list *, void *);
|
||||
extern void listnode_add_sort (struct list *, void *);
|
||||
extern void listnode_add_after (struct list *, struct listnode *, void *);
|
||||
extern void listnode_move_to_tail (struct list *, struct listnode *);
|
||||
extern void listnode_delete (struct list *, void *);
|
||||
extern struct listnode *listnode_lookup (struct list *, void *);
|
||||
extern void *listnode_head (struct list *);
|
||||
|
||||
extern void list_delete (struct list *);
|
||||
extern void list_delete_all_node (struct list *);
|
||||
|
||||
/* For ospfd and ospf6d. */
|
||||
extern void list_delete_node (struct list *, struct listnode *);
|
||||
|
||||
/* For ospf_spf.c */
|
||||
extern void list_add_node_prev (struct list *, struct listnode *, void *);
|
||||
extern void list_add_node_next (struct list *, struct listnode *, void *);
|
||||
extern void list_add_list (struct list *, struct list *);
|
||||
|
||||
/* List iteration macro.
|
||||
* Usage: for (ALL_LIST_ELEMENTS (...) { ... }
|
||||
* It is safe to delete the listnode using this macro.
|
||||
*/
|
||||
#define ALL_LIST_ELEMENTS(list,node,nextnode,data) \
|
||||
(node) = listhead(list), ((data) = NULL); \
|
||||
(node) != NULL && \
|
||||
((data) = listgetdata(node),(nextnode) = node->next, 1); \
|
||||
(node) = (nextnode), ((data) = NULL)
|
||||
|
||||
/* read-only list iteration macro.
|
||||
* Usage: as per ALL_LIST_ELEMENTS, but not safe to delete the listnode Only
|
||||
* use this macro when it is *immediately obvious* the listnode is not
|
||||
* deleted in the body of the loop. Does not have forward-reference overhead
|
||||
* of previous macro.
|
||||
*/
|
||||
#define ALL_LIST_ELEMENTS_RO(list,node,data) \
|
||||
(node) = listhead(list), ((data) = NULL);\
|
||||
(node) != NULL && ((data) = listgetdata(node), 1); \
|
||||
(node) = listnextnode(node), ((data) = NULL)
|
||||
|
||||
/* these *do not* cleanup list nodes and referenced data, as the functions
|
||||
* do - these macros simply {de,at}tach a listnode from/to a list.
|
||||
*/
|
||||
|
||||
/* List node attach macro. */
|
||||
#define LISTNODE_ATTACH(L,N) \
|
||||
do { \
|
||||
(N)->prev = (L)->tail; \
|
||||
(N)->next = NULL; \
|
||||
if ((L)->head == NULL) \
|
||||
(L)->head = (N); \
|
||||
else \
|
||||
(L)->tail->next = (N); \
|
||||
(L)->tail = (N); \
|
||||
(L)->count++; \
|
||||
} while (0)
|
||||
|
||||
/* List node detach macro. */
|
||||
#define LISTNODE_DETACH(L,N) \
|
||||
do { \
|
||||
if ((N)->prev) \
|
||||
(N)->prev->next = (N)->next; \
|
||||
else \
|
||||
(L)->head = (N)->next; \
|
||||
if ((N)->next) \
|
||||
(N)->next->prev = (N)->prev; \
|
||||
else \
|
||||
(L)->tail = (N)->prev; \
|
||||
(L)->count--; \
|
||||
} while (0)
|
||||
|
||||
/* Deprecated: 20050406 */
|
||||
#if !defined(QUAGGA_NO_DEPRECATED_INTERFACES)
|
||||
#warning "Using deprecated libzebra interfaces"
|
||||
#define LISTNODE_ADD(L,N) LISTNODE_ATTACH(L,N)
|
||||
#define LISTNODE_DELETE(L,N) LISTNODE_DETACH(L,N)
|
||||
#define nextnode(X) ((X) = (X)->next)
|
||||
#define getdata(X) listgetdata(X)
|
||||
#define LIST_LOOP(L,V,N) \
|
||||
for (ALL_LIST_ELEMENTS_RO (L,N,V))
|
||||
#endif /* QUAGGA_NO_DEPRECATED_INTERFACES */
|
||||
|
||||
#endif /* _ZEBRA_LINKLIST_H */
|
||||
Reference in New Issue
Block a user