Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:hashlittle (Results 1 - 4 of 4) sorted by null

/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/chromium_org/third_party/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/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/blktrace/
jhash.h	15 * hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final()

Completed in 289 milliseconds