Lines Matching refs:hash
33 * Conceptually, a multi-stage filter comprises k independent hash functions
34 * and k counter arrays. Packets are indexed into k counter arrays by k hash
39 * due to hash collision with other small flows; however, with high
77 * - T is a fixed-size hash-table with 1024 entries. Hash collision is
83 * Hence, instead of having four hash functions, we chop the 32-bit
84 * skb-hash into three 10-bit chunks, and the remaining 10-bit chunk is
114 u32 hash_id; /* hash of flow-id (e.g. TCP 5-tuple) */
116 struct list_head flowchain; /* chaining under hash collision */
129 siphash_key_t perturbation; /* hash perturbation */
180 static struct hh_flow_state *seek_list(const u32 hash,
202 } else if (flow->hash_id == hash) {
250 u32 tmp_hash, hash;
267 hash = skb_get_hash_perturb(skb, &q->perturbation);
270 flow_pos = hash & HHF_BIT_MASK;
271 flow = seek_list(hash, &q->hh_flows[flow_pos], q);
278 tmp_hash = hash;
310 flow->hash_id = hash;