/system/extras/ksmutils/ |
lookup3.c | 6 hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final() 11 You probably want to use hashlittle(). hashlittle() and hashbig() 12 hash byte arrays. hashlittle() is is faster than hashbig() on 15 hashlittle() except it returns two 32-bit hashes for the price of one. 27 a character string), use hashlittle(). If you have several byte arrays, or 28 a mix of things, see the comments above hashlittle(). 167 The function hashword() is identical to hashlittle() on little-endian 170 bytes. hashlittle() is more complicated than hashword() only because 171 hashlittle() has to dance around fitting the key bytes into registers 283 uint32_t hashlittle( const void *key, size_t length, uint32_t initval) function [all...] |
/external/regex-re2/util/ |
hash.cc | 10 hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final() 15 You probably want to use hashlittle(). hashlittle() and hashbig() 16 hash byte arrays. hashlittle() is is faster than hashbig() on 19 hashlittle() except it returns two 32-bit hashes for the price of one. 31 a character string), use hashlittle(). If you have several byte arrays, or 32 a mix of things, see the comments above hashlittle(). 143 The function hashword() is identical to hashlittle() on little-endian 146 bytes. hashlittle() is more complicated than hashword() only because 147 hashlittle() has to dance around fitting the key bytes into registers [all...] |
/external/libnl/lib/ |
hash.c | 11 hash_word(), hashlittle(), hashlittle2(), hashbig(), mix(), and final() 16 You probably want to use hashlittle(). hashlittle() and hashbig() 17 hash byte arrays. hashlittle() is is faster than hashbig() on 20 hashlittle() except it returns two 32-bit hashes for the price of one. 32 a character string), use hashlittle(). If you have several byte arrays, or 33 a mix of things, see the comments above hashlittle(). 149 hashlittle() -- hash a variable-length key into a 32-bit value 165 for (i=0, h=0; i<n; ++i) h = hashlittle( k[i], len[i], h); 175 static uint32_t hashlittle( const void *key, size_t length, uint32_t *val2 function [all...] |
/hardware/qcom/msm8998/json-c/ |
linkhash.c | 48 * hashlittle from lookup3.c, by Bob Jenkins, May 2006, Public Domain. 59 hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final() 64 You probably want to use hashlittle(). hashlittle() and hashbig() 65 hash byte arrays. hashlittle() is is faster than hashbig() on 68 hashlittle() except it returns two 32-bit hashes for the price of one. 80 a character string), use hashlittle(). If you have several byte arrays, or 81 a mix of things, see the comments above hashlittle(). 207 hashlittle() -- hash a variable-length key into a 32-bit value 222 for (i=0, h=0; i<n; ++i) h = hashlittle( k[i], len[i], h) 232 static uint32_t hashlittle( const void *key, size_t length, uint32_t initval) function [all...] |
/external/blktrace/ |
jhash.h | 15 * hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final()
|
/external/lisa/tools/armeabi/ |
rt-app | |