b1a597e0c3
Prefix sets were broken beyond any repair and have to be reimplemented. They are reimplemented using a trie with bitmasks in nodes. There is also change in the interpretation of minus prefix pattern, but the old interpretation was already inconsistent with the documentation and broken. There is also some bugfixes in filter code related to set variables.
21 lines
495 B
C
21 lines
495 B
C
/*
|
|
* BIRD Library -- Generic Bit Operations
|
|
*
|
|
* (c) 1998 Martin Mares <mj@ucw.cz>
|
|
*
|
|
* Can be freely distributed and used under the terms of the GNU GPL.
|
|
*/
|
|
|
|
/*
|
|
* Bit mask operations:
|
|
*
|
|
* u32_mkmask Make bit mask consisting of <n> consecutive ones
|
|
* from the left and the rest filled with zeroes.
|
|
* E.g., u32_mkmask(5) = 0xf8000000.
|
|
* u32_masklen Inverse operation to u32_mkmask, -1 if not a bitmask.
|
|
*/
|
|
|
|
u32 u32_mkmask(unsigned n);
|
|
int u32_masklen(u32 x);
|
|
|
|
u32 u32_log2(u32 v);
|