Lines Matching refs:hash
32 * it seems that having hash randomization might be a good idea
37 * well but since the attack is based on growing a very big hash
38 * list we will use the BigKey algo as soon as the hash size grows
367 * Calculate a hash key using a good hash function that works well for
368 * larger hash table sizes.
370 * Hash function by "One-at-a-Time Hash" see
371 * http://burtleburtle.net/bob/hash/doobs.html
376 uint32_t hash;
381 hash = seed;
384 hash += data[i];
385 hash += (hash << 10);
386 hash ^= (hash >> 6);
388 hash += (hash << 3);
389 hash ^= (hash >> 11);
390 hash += (hash << 15);
392 return hash;
398 * Calculate a hash key for two strings using a good hash function
399 * that works well for larger hash table sizes.
401 * Hash function by "One-at-a-Time Hash" see
402 * http://burtleburtle.net/bob/hash/doobs.html
410 uint32_t hash;
413 hash = seed;
416 hash += prefix[i];
417 hash += (hash << 10);
418 hash ^= (hash >> 6);
420 hash += ':';
421 hash += (hash << 10);
422 hash ^= (hash >> 6);
425 hash += name[i];
426 hash += (hash << 10);
427 hash ^= (hash >> 6);
429 hash += (hash << 3);
430 hash ^= (hash >> 11);
431 hash += (hash << 15);
433 return hash;
440 * Calculate a hash key using a fast hash function that works well
441 * for low hash table fill.
472 * Calculate a hash key for two strings using a fast hash function
473 * that works well for low hash table fill.
757 * Free the hash @dict and its contents. The userdata is
1069 * Add the QName @prefix:@name to the hash @dict if not present.
1199 * Query the number of elements installed in the hash @dict.
