Lines Matching defs:length
30 then use c as the hash value. If you have a variable length array of
169 -- that the length be the number of uint32_t's in the key
173 except that the length has to be measured in uint32_ts rather than in
180 size_t length, /* the length of the key, in uint32_ts */
186 a = b = c = 0xdeadbeef + (((uint32_t)length)<<2) + initval;
189 while (length > 3)
195 length -= 3;
200 switch(length) /* all the case statements fall through */
224 size_t length, /* the length of the key, in uint32_ts */
231 a = b = c = 0xdeadbeef + ((uint32_t)(length<<2)) + *pc;
235 while (length > 3)
241 length -= 3;
246 switch(length) /* all the case statements fall through */
262 hashlittle() -- hash a variable-length key into a 32-bit value
263 k : the key (the unaligned variable-length array of bytes)
264 length : the length of the key, counting by bytes
287 uint32_t jenkins_hashlittle( const void *key, size_t length, uint32_t initval)
293 a = b = c = 0xdeadbeef + ((uint32_t)length) + initval;
300 while (length > 12)
306 length -= 12;
322 switch(length)
336 case 0 : return c; /* zero length strings require no mixing */
343 switch(length)
368 while (length > 12)
374 length -= 12;
380 switch(length)
407 case 0 : return c; /* zero length requires no mixing */
414 while (length > 12)
429 length -= 12;
434 switch(length) /* all the case statements fall through */
470 size_t length, /* length of the key */
478 a = b = c = 0xdeadbeef + ((uint32_t)length) + *pc;
486 while (length > 12)
492 length -= 12;
508 switch(length)
522 case 0 : *pc=c; *pb=b; return; /* zero length strings require no mixing */
529 switch(length)
543 case 0 : *pc=c; *pb=b; return; /* zero length strings require no mixing */
554 while (length > 12)
560 length -= 12;
566 switch(length)
593 case 0 : *pc=c; *pb=b; return; /* zero length strings require no mixing */
600 while (length > 12)
615 length -= 12;
620 switch(length) /* all the case statements fall through */
635 case 0 : *pc=c; *pb=b; return; /* zero length strings require no mixing */
651 uint32_t jenkins_hashbig( const void *key, size_t length, uint32_t initval)
657 a = b = c = 0xdeadbeef + ((uint32_t)length) + initval;
664 while (length > 12)
670 length -= 12;
686 switch(length)
700 case 0 : return c; /* zero length strings require no mixing */
707 switch(length) /* all the case statements fall through */
731 while (length > 12)
746 length -= 12;
751 switch(length) /* all the case statements fall through */