Revision ae80a2de nest/rt-table.c
| nest/rt-table.c | ||
|---|---|---|
| 182 | 182 |
} |
| 183 | 183 |
|
| 184 | 184 |
static inline void |
| 185 |
rte_trace_in(unsigned int flag, struct proto *p, rte *e, char *msg)
|
|
| 185 |
rte_trace_in(uint flag, struct proto *p, rte *e, char *msg) |
|
| 186 | 186 |
{
|
| 187 | 187 |
if (p->debug & flag) |
| 188 | 188 |
rte_trace(p, e, '>', msg); |
| 189 | 189 |
} |
| 190 | 190 |
|
| 191 | 191 |
static inline void |
| 192 |
rte_trace_out(unsigned int flag, struct proto *p, rte *e, char *msg)
|
|
| 192 |
rte_trace_out(uint flag, struct proto *p, rte *e, char *msg) |
|
| 193 | 193 |
{
|
| 194 | 194 |
if (p->debug & flag) |
| 195 | 195 |
rte_trace(p, e, '<', msg); |
| ... | ... | |
| 1880 | 1880 |
static inline void |
| 1881 | 1881 |
hc_insert(struct hostcache *hc, struct hostentry *he) |
| 1882 | 1882 |
{
|
| 1883 |
unsigned int k = he->hash_key >> hc->hash_shift;
|
|
| 1883 |
uint k = he->hash_key >> hc->hash_shift; |
|
| 1884 | 1884 |
he->next = hc->hash_table[k]; |
| 1885 | 1885 |
hc->hash_table[k] = he; |
| 1886 | 1886 |
} |
| ... | ... | |
| 1889 | 1889 |
hc_remove(struct hostcache *hc, struct hostentry *he) |
| 1890 | 1890 |
{
|
| 1891 | 1891 |
struct hostentry **hep; |
| 1892 |
unsigned int k = he->hash_key >> hc->hash_shift;
|
|
| 1892 |
uint k = he->hash_key >> hc->hash_shift; |
|
| 1893 | 1893 |
|
| 1894 | 1894 |
for (hep = &hc->hash_table[k]; *hep != he; hep = &(*hep)->next); |
| 1895 | 1895 |
*hep = he->next; |
| ... | ... | |
| 2154 | 2154 |
if (!tab->hostcache) |
| 2155 | 2155 |
rt_init_hostcache(tab); |
| 2156 | 2156 |
|
| 2157 |
unsigned int k = hc_hash(a, dep);
|
|
| 2157 |
uint k = hc_hash(a, dep); |
|
| 2158 | 2158 |
struct hostcache *hc = tab->hostcache; |
| 2159 | 2159 |
for (he = hc->hash_table[k >> hc->hash_shift]; he != NULL; he = he->next) |
| 2160 | 2160 |
if (ipa_equal(he->addr, a) && (he->tab == dep)) |
Also available in: Unified diff