Lines Matching refs:hash
67 #include <sys/hash.h>
174 uint32_t hash;
314 "enable packet hash generation");
341 * Create the key that will be used to create a hash index
342 * into our hash table. Our key consists of:
362 * If the list is not empty i.e. the hash index has
367 * Loop through the hash nodes in the list.
368 * There should normally only be 1 hash node in the list,
369 * except if there have been collisions at the hash index
376 * hash node we are currently processing.
378 * hash node that stores the counter for the flow
388 /* If this flow hash hasn't been seen before or we have a collision. */
390 /* Create a new hash node to store the flow's counter. */
395 /* Initialise our new hash node list entry. */
451 pkt_node->hash,
510 pkt_node->hash,
633 uint32_t hash;
635 hash = 0;
650 hash = hash32_buf(m->m_data + offset,
651 m->m_len - offset, hash);
657 return (hash);
922 * hashing as the receiver will calc a different hash
972 * hash over all bytes is really inefficient. Would be nice to
973 * find a way to create the hash and checksum in the same pass
976 pn->hash = hash_pkt(*m, ip_hl);
1324 * Iterate over the flow hash, printing a summary of each
1326 * The hash consists of an array of LISTs (man 3 queue).
1488 /* Initialise our flow counter hash table. */