8f6d079f97
can get missing entries!). Instead, as a temporary solution, we switch to a simple linear scan of the hash tables for the longest-prefix-match (lpm.c lpm.h) algorithm. In fact, with few unique prefixes in the set, on modern hardware this simple algorithm is pretty fast anyway!
47 lines
1.8 KiB
C
47 lines
1.8 KiB
C
/*-
|
|
* Copyright (c) 2016 Mindaugas Rasiukevicius <rmind at noxt eu>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef _LPM_H_
|
|
#define _LPM_H_
|
|
|
|
__BEGIN_DECLS
|
|
|
|
typedef struct lpm lpm_t;
|
|
typedef void (*lpm_dtor_t)(void *, const void *, size_t, void *);
|
|
|
|
lpm_t * lpm_create(void);
|
|
void lpm_destroy(lpm_t *);
|
|
void lpm_clear(lpm_t *, lpm_dtor_t, void *);
|
|
|
|
int lpm_insert(lpm_t *, const void *, size_t, unsigned, void *);
|
|
int lpm_remove(lpm_t *, const void *, size_t, unsigned);
|
|
void * lpm_lookup(lpm_t *, const void *, size_t);
|
|
int lpm_strtobin(const char *, void *, size_t *, unsigned *);
|
|
|
|
__END_DECLS
|
|
|
|
#endif
|