4 /* Must be powers of 2 */
5 #define MAX_HASH_ENTRIES 128
6 #define SEQ_BUCKET_SIZE 262144
8 * The max seq range that can be stored is
9 * 64 x 262144 or 16Meg. We have one extra slot
10 * for fall-over but must keep it so we never have
11 * wrap in hashing over valid other entries.
13 #define MAX_ALLOWED_SEQ_RANGE (SEQ_BUCKET_SIZE * (MAX_HASH_ENTRIES-1))
16 struct rack_head ht[MAX_HASH_ENTRIES];
23 tqhash_min(struct tailq_hash *hs);
26 tqhash_max(struct tailq_hash *hs);
29 tqhash_empty(struct tailq_hash *hs);
32 tqhash_find(struct tailq_hash *hs, uint32_t seq);
35 tqhash_next(struct tailq_hash *hs, struct rack_sendmap *rsm);
38 tqhash_prev(struct tailq_hash *hs, struct rack_sendmap *rsm);
40 #define REMOVE_TYPE_CUMACK 1 /* Cumack moved */
41 #define REMOVE_TYPE_MERGE 2 /* Merging two blocks */
42 #define REMOVE_TYPE_FINI 3 /* The connection is over */
45 tqhash_remove(struct tailq_hash *hs, struct rack_sendmap *rsm, int type);
48 tqhash_insert(struct tailq_hash *hs, struct rack_sendmap *rsm);
51 tqhash_init(struct tailq_hash *hs);
54 tqhash_trim(struct tailq_hash *hs, uint32_t th_ack);
57 #define TQHASH_FOREACH(var, head) \
58 for ((var) = tqhash_min((head)); \
60 (var) = tqhash_next((head), (var)))
62 #define TQHASH_FOREACH_FROM(var, head, fvar) \
63 for ((var) = ((fvar) ? (fvar) : tqhash_min((head))); \
65 (var) = tqhash_next((head), (var)))
67 #define TQHASH_FOREACH_REVERSE_FROM(var, head) \
68 for ((var) = ((var) ? (var) : tqhash_max((head))); \
70 (var) = tqhash_prev((head), (var)))