|
Lines 2014-2020
Link Here
|
| 2014 |
The following lookup algorithms are supported: |
2014 |
The following lookup algorithms are supported: |
| 2015 |
.Bl -tag -width indent |
2015 |
.Bl -tag -width indent |
| 2016 |
.It Ar algo-desc : algo-name | "algo-name algo-data" |
2016 |
.It Ar algo-desc : algo-name | "algo-name algo-data" |
| 2017 |
.It Ar algo-name: Ar addr:radix | addr:hash | iface:arrray | number:array | flow:hash |
2017 |
.It Ar algo-name: Ar addr:radix | addr:hash | iface:array | number:array | flow:hash |
| 2018 |
.It Cm addr:radix |
2018 |
.It Cm addr:radix |
| 2019 |
Separate Radix trees for IPv4 and IPv6, the same way as the routing table (see |
2019 |
Separate Radix trees for IPv4 and IPv6, the same way as the routing table (see |
| 2020 |
.Xr route 4 ) . |
2020 |
.Xr route 4 ) . |
|
Lines 2030-2036
Link Here
|
| 2030 |
Search removes host bits (according to mask) from supplied address and checks |
2030 |
Search removes host bits (according to mask) from supplied address and checks |
| 2031 |
resulting key in appropriate hash. |
2031 |
resulting key in appropriate hash. |
| 2032 |
Mostly optimized for /64 and byte-ranged IPv6 masks. |
2032 |
Mostly optimized for /64 and byte-ranged IPv6 masks. |
| 2033 |
.It Cm iface:arrray |
2033 |
.It Cm iface:array |
| 2034 |
Array storing sorted indexes for entries which are presented in the system. |
2034 |
Array storing sorted indexes for entries which are presented in the system. |
| 2035 |
Optimized for very fast lookup. |
2035 |
Optimized for very fast lookup. |
| 2036 |
.It Cm number:array |
2036 |
.It Cm number:array |