diff options
| author | Martin Mares <mj@ucw.cz> | 2000-06-07 13:25:53 +0000 |
|---|---|---|
| committer | Martin Mares <mj@ucw.cz> | 2000-06-07 13:25:53 +0000 |
| commit | 58f7d004fddd2cccdb019be59b6cc7a8abe50510 (patch) | |
| tree | 97d14f24e68ec6d32d114af62dab293a9abeb10c /nest/rt-fib.c | |
| parent | 38203d789a872077ec174a63a448568725e4715f (diff) | |
Fixes to the progdoc.
Diffstat (limited to 'nest/rt-fib.c')
| -rw-r--r-- | nest/rt-fib.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/nest/rt-fib.c b/nest/rt-fib.c index 28f9fc1c..34d862e2 100644 --- a/nest/rt-fib.c +++ b/nest/rt-fib.c @@ -21,7 +21,7 @@ * We use two-stage hashing where we calculate a 16-bit primary hash key independent * on hash table size and then we just divide the primary keys modulo table size * to get a real hash key used for determining the bucket containing the node. - * The lists of nodes in each buckets are sorted according to the primary hash + * The lists of nodes in each bucket are sorted according to the primary hash * key, hence if we keep the total number of buckets to be a power of two, * re-hashing of the structure keeps the relative order of the nodes. * @@ -400,7 +400,7 @@ fit_put(struct fib_iterator *i, struct fib_node *n) * @f: FIB to be checked * * This debugging function audits a FIB by checking its internal consistency. - * Use when you suspect somebody from corrupting innocent data structures. + * Use when you suspect somebody of corrupting innocent data structures. */ void fib_check(struct fib *f) |