mirror of
https://git.proxmox.com/git/mirror_frr
synced 2025-11-04 10:07:04 +00:00
2bc1fe6dca
The skiplist code has a very "colorful" history. Use the SPDX "LicenseRef" syntax/notation to track it. Signed-off-by: David Lamparter <equinox@opensourcerouting.org>
121 lines
3.1 KiB
C
121 lines
3.1 KiB
C
// SPDX-License-Identifier: LicenseRef-Skiplist-BSD-0-Clause
|
|
/*
|
|
* Copyright 1990 William Pugh
|
|
*
|
|
* Permission to include in quagga provide on March 31, 2016
|
|
*/
|
|
|
|
/*
|
|
* Skip List implementation based on code from William Pugh.
|
|
* ftp://ftp.cs.umd.edu/pub/skipLists/
|
|
*/
|
|
|
|
/* skiplist.h */
|
|
|
|
|
|
#ifndef _ZEBRA_SKIPLIST_H
|
|
#define _ZEBRA_SKIPLIST_H
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
#define SKIPLIST_0TIMER_DEBUG 1
|
|
|
|
/*
|
|
* skiplistnodes must always contain data to be valid. Adding an
|
|
* empty node to a list is invalid
|
|
*/
|
|
struct skiplistnode {
|
|
void *key;
|
|
void *value;
|
|
#if SKIPLIST_0TIMER_DEBUG
|
|
int flags;
|
|
#define SKIPLIST_NODE_FLAG_INSERTED 0x00000001
|
|
#endif
|
|
|
|
struct skiplistnode *forward[1]; /* variable sized */
|
|
};
|
|
|
|
struct skiplist {
|
|
int flags;
|
|
|
|
#define SKIPLIST_FLAG_ALLOW_DUPLICATES 0x00000001
|
|
|
|
int level; /* max lvl (1 + current # of levels in list) */
|
|
unsigned int count;
|
|
struct skiplistnode *header;
|
|
int *level_stats;
|
|
struct skiplistnode
|
|
*last; /* last real list item (NULL if empty list) */
|
|
|
|
/*
|
|
* Returns -1 if val1 < val2, 0 if equal?, 1 if val1 > val2.
|
|
* Used as definition of sorted for listnode_add_sort
|
|
*/
|
|
int (*cmp)(const void *val1, const void *val2);
|
|
|
|
/* callback to free user-owned data when listnode is deleted. supplying
|
|
* this callback is very much encouraged!
|
|
*/
|
|
void (*del)(void *val);
|
|
};
|
|
|
|
|
|
/* Prototypes. */
|
|
extern struct skiplist *
|
|
skiplist_new(/* encouraged: set list.del callback on new lists */
|
|
int flags,
|
|
int (*cmp)(const void *key1,
|
|
const void *key2), /* NULL => default cmp */
|
|
void (*del)(void *val)); /* NULL => no auto val free */
|
|
|
|
extern void skiplist_free(struct skiplist *);
|
|
|
|
extern int skiplist_insert(register struct skiplist *l, register void *key,
|
|
register void *value);
|
|
|
|
extern int skiplist_delete(register struct skiplist *l, register void *key,
|
|
register void *value);
|
|
|
|
extern int skiplist_search(register struct skiplist *l, register void *key,
|
|
void **valuePointer);
|
|
|
|
extern int skiplist_first_value(register struct skiplist *l, /* in */
|
|
register const void *key, /* in */
|
|
void **valuePointer, /* in/out */
|
|
void **cursor); /* out */
|
|
|
|
extern int skiplist_next_value(register struct skiplist *l, /* in */
|
|
register const void *key, /* in */
|
|
void **valuePointer, /* in/out */
|
|
void **cursor); /* in/out */
|
|
|
|
extern int skiplist_first(register struct skiplist *l, void **keyPointer,
|
|
void **valuePointer);
|
|
|
|
extern int skiplist_last(register struct skiplist *l, void **keyPointer,
|
|
void **valuePointer);
|
|
|
|
extern int skiplist_delete_first(register struct skiplist *l);
|
|
|
|
extern int skiplist_next(register struct skiplist *l, /* in */
|
|
void **keyPointer, /* out */
|
|
void **valuePointer, /* out */
|
|
void **cursor); /* in/out */
|
|
|
|
extern int skiplist_empty(register struct skiplist *l); /* in */
|
|
|
|
extern unsigned int skiplist_count(register struct skiplist *l); /* in */
|
|
|
|
struct vty;
|
|
extern void skiplist_debug(struct vty *vty, struct skiplist *l);
|
|
|
|
extern void skiplist_test(struct vty *vty);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif /* _ZEBRA_SKIPLIST_H */
|