Lines Matching defs:length

25 then use c as the hash value.  If you have a variable length array of
165 -- that the length be the number of uint32_t's in the key
169 except that the length has to be measured in uint32_ts rather than in
176 size_t length, /* the length of the key, in uint32_ts */
182 a = b = c = 0xdeadbeef + (((uint32_t)length)<<2) + initval;
185 while (length > 3)
191 length -= 3;
196 switch(length) /* all the case statements fall through */
220 size_t length, /* the length of the key, in uint32_ts */
227 a = b = c = 0xdeadbeef + ((uint32_t)(length<<2)) + *pc;
231 while (length > 3)
237 length -= 3;
242 switch(length) /* all the case statements fall through */
258 hashlittle() -- hash a variable-length key into a 32-bit value
259 k : the key (the unaligned variable-length array of bytes)
260 length : the length of the key, counting by bytes
283 uint32_t hashlittle( const void *key, size_t length, uint32_t initval)
289 a = b = c = 0xdeadbeef + ((uint32_t)length) + initval;
297 while (length > 12)
303 length -= 12;
319 switch(length)
333 case 0 : return c; /* zero length strings require no mixing */
339 switch(length)
363 while (length > 12)
369 length -= 12;
375 switch(length)
402 case 0 : return c; /* zero length requires no mixing */
409 while (length > 12)
424 length -= 12;
429 switch(length) /* all the case statements fall through */
465 size_t length, /* length of the key */
473 a = b = c = 0xdeadbeef + ((uint32_t)length) + *pc;
482 while (length > 12)
488 length -= 12;
504 switch(length)
518 case 0 : *pc=c; *pb=b; return; /* zero length strings require no mixing */
524 switch(length)
538 case 0 : *pc=c; *pb=b; return; /* zero length strings require no mixing */
548 while (length > 12)
554 length -= 12;
560 switch(length)
587 case 0 : *pc=c; *pb=b; return; /* zero length strings require no mixing */
594 while (length > 12)
609 length -= 12;
614 switch(length) /* all the case statements fall through */
629 case 0 : *pc=c; *pb=b; return; /* zero length strings require no mixing */
645 uint32_t hashbig( const void *key, size_t length, uint32_t initval)
651 a = b = c = 0xdeadbeef + ((uint32_t)length) + initval;
659 while (length > 12)
665 length -= 12;
681 switch(length)
695 case 0 : return c; /* zero length strings require no mixing */
701 switch(length) /* all the case statements fall through */
724 while (length > 12)
739 length -= 12;
744 switch(length) /* all the case statements fall through */