1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49
|
/*
* netsniff-ng - the packet sniffing beast
* Copyright 2011 Daniel Borkmann, rewritten
* Copyright 1991-2007 Kawahara Lab., Kyoto University
* Copyright 2000-2005 Shikano Lab., Nara Institute of Science and Technology
* Copyright 2005-2007 Julius project team, Nagoya Institute of Technology
* All rights reserved
* Subject to the GPL, version 2.
*/
#ifndef PATRICIA_H
#define PATRICIA_H
#include <netinet/in.h>
#include "built_in.h"
struct patricia_node {
void *key;
size_t klen;
struct sockaddr_storage *addr;
size_t alen;
union {
int data;
int thres_bit;
} value;
struct patricia_node *l, *r;
} __cacheline_aligned;
extern int ptree_search_data_nearest(void *str, size_t sstr,
struct sockaddr_storage *addr, size_t *alen,
struct patricia_node *root);
extern int ptree_search_data_exact(void *str, size_t sstr,
struct sockaddr_storage *addr, size_t *alen,
struct patricia_node *root);
extern int ptree_add_entry(void *str, size_t sstr, int data,
struct sockaddr_storage *addr, size_t alen,
struct patricia_node **root);
extern void ptree_del_entry(void *str, size_t sstr,
struct patricia_node **root);
extern void ptree_get_key(int data, struct patricia_node *node,
struct patricia_node **wanted);
extern void ptree_get_key_addr(struct sockaddr_storage *addr, size_t alen,
struct patricia_node *node,
struct patricia_node **wanted);
extern void ptree_display(struct patricia_node *node, int level);
extern void ptree_free(struct patricia_node *root);
#endif /* PATRICIA_H */
|