NBUCKETS
if (amt == 0 || bucket >= NBUCKETS)
static union overhead *nextf[NBUCKETS];
for (hsh = priv->hash, i = 0; i < NBUCKETS; hsh++, i++) {
if (used <= (NBUCKETS*2) && !INACTIVE(fle))
(used > (NBUCKETS*2)))) || AGED(fle)) {
for (hsh = priv->hash6, i = 0; i < NBUCKETS; hsh++, i++) {
if (used <= (NBUCKETS*2) && !INACTIVE(fle6))
(used > (NBUCKETS*2)))) || AGED(fle6)) {
priv->hash = malloc(NBUCKETS * sizeof(struct flow_hash_entry),
for (i = 0, hsh = priv->hash; i < NBUCKETS; i++, hsh++) {
priv->hash6 = malloc(NBUCKETS * sizeof(struct flow_hash_entry),
for (i = 0, hsh = priv->hash6; i < NBUCKETS; i++, hsh++) {
for (hsh = priv->hash, i = 0; i < NBUCKETS; hsh++, i++)
for (hsh = priv->hash6, i = 0; i < NBUCKETS; hsh++, i++)
for (i = 0, hsh = priv->hash; i < NBUCKETS; i++, hsh++)
for (i = 0, hsh = priv->hash6; i < NBUCKETS; i++, hsh++)
(NBUCKETS - 1))
(NBUCKETS - 1))
if (i > NBUCKETS-1)
for (; i < NBUCKETS; hsh++, i++) {
if (argc > 2) NBUCKETS = strtoul(argv[2],0,0);
foo = malloc(sizeof(*foo) * NBUCKETS);
memset(foo, 0, sizeof(*foo) * NBUCKETS);
for (j = 0; j < 40960/i && j < NBUCKETS; j++) {
for (j = 0; j < 40960/i && j < NBUCKETS; j++) {
j = random() % NBUCKETS;
for (j = 0; j < NBUCKETS; j++) {
sbrk(0), NOPS, NBUCKETS, NSIZE);
u_long NBUCKETS = 2000;
} *bucket[NBUCKETS];
i = hashval % NBUCKETS;
i += NBUCKETS;