HomeSort by relevance Sort by last modified time
    Searched defs:hashword (Results 1 - 3 of 3) sorted by null

  /external/chromium_org/third_party/re2/util/
hash.cc 2 // Also threw away all but hashword and hashword2.
10 hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final()
30 4-byte integers to hash, use hashword(). If you have a byte array (like
143 The function hashword() is identical to hashlittle() on little-endian
146 bytes. hashlittle() is more complicated than hashword() only because
150 uint32 hashword( function in namespace:re2
188 hashword2() -- same as hashword(), but take two seeds and return two
191 (*pc) will be the same as the return value from hashword().
  /external/regex-re2/util/
hash.cc 2 // Also threw away all but hashword and hashword2.
10 hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final()
30 4-byte integers to hash, use hashword(). If you have a byte array (like
143 The function hashword() is identical to hashlittle() on little-endian
146 bytes. hashlittle() is more complicated than hashword() only because
150 uint32 hashword( function in namespace:re2
188 hashword2() -- same as hashword(), but take two seeds and return two
191 (*pc) will be the same as the return value from hashword().
  /system/extras/ksmutils/
lookup3.c 6 hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final()
26 4-byte integers to hash, use hashword(). If you have a byte array (like
167 The function hashword() is identical to hashlittle() on little-endian
170 bytes. hashlittle() is more complicated than hashword() only because
174 uint32_t hashword( function
212 hashword2() -- same as hashword(), but take two seeds and return two
215 (*pc) will be the same as the return value from hashword().
641 * This is the same as hashword() on big-endian machines. It is different
879 hashword((const uint32_t *)q, (sizeof(q)-1)/4, 13),
880 hashword((const uint32_t *)q, (sizeof(q)-5)/4, 13)
    [all...]

Completed in 57 milliseconds