Searched defs:hash (Results 1 - 11 of 11) sorted by relevance

/hardware/invensense/60xx/mlsdk/mlutils/
H A Dchecksum.c3 /** bernstein hash, from public domain source */
7 uint32_t hash = 5381; local
12 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
15 return hash;
/hardware/samsung_slsi/exynos5/mobicore/daemon/Common/
H A DNetlinkConnection.h78 * Retreive connection based on a unique hash.
79 * Search the peer connections hashmap for a hash and return
82 * @param hash The hash to search
86 uint64_t hash
95 * @param hash The hash to use
99 uint64_t hash,
107 * If the hash is invalid nothing happens.
109 * @param hash Th
122 uint64_t hash; /**< Unique connection ID, see hashConnection */ member in class:NetlinkConnection
[all...]
/hardware/samsung_slsi/exynos5/mobicore/daemon/Daemon/Server/
H A DNetlinkServer.cpp129 uint64_t hash = hashConnection(pid, seq); local
133 NetlinkConnection *connection = findConnection(hash);
139 insertConnection(hash, connection);
153 removeConnection(hash);
158 // so we must remove all connections associated with this hash
197 uint64_t hash
200 connectionMap_t::iterator i = peerConnections.find(hash);
211 uint64_t hash,
215 peerConnections[hash] = connection;
221 uint64_t hash
210 insertConnection( uint64_t hash, NetlinkConnection *connection ) argument
[all...]
/hardware/intel/common/libwsbm/src/
H A Dwsbm_driver.h104 uint32_t hash; member in struct:_ValidateNode
H A Dwsbm_manager.c148 uint32_t hash, uint64_t flags, uint64_t mask)
171 hashHead = list->hashTable + hash;
180 uint32_t hash, i; local
182 for (hash = 0, i = 0; i < len; ++i) {
183 hash += *key++;
184 hash += (hash << 10);
185 hash ^= (hash >> 6);
188 hash
147 validateListAddNode(struct _ValidateList *list, void *item, uint32_t hash, uint64_t flags, uint64_t mask) argument
1063 uint32_t hash; local
[all...]
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/
H A Dwebmenc.c292 void write_webm_file_footer(struct EbmlGlobal *glob, int hash) { argument
328 Ebml_SerializeUnsigned32(glob, TrackUID, glob->debug ? 0xDEADBEEF : hash);
H A Dvpxenc.c127 /* Murmur hash derived from public domain reference implementation at
622 uint32_t hash; member in struct:stream_state
1179 write_webm_file_footer(&stream->ebml, stream->hash);
1337 /* Update the hash */
1339 stream->hash = murmur(pkt->data.frame.buf,
1341 stream->hash);
/hardware/intel/img/libdrm/libdrm/
H A Dxf86drmHash.c1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
40 * 2) The hash computation uses a table of random integers [Hanson97,
48 * dynamic hash tables was postponed until the need arises. A common (and
49 * naive) approach to dynamic hash table implementation simply creates a
50 * new hash table when necessary, rehashes all the data into the new table,
131 unsigned long hash = 0; local
146 hash = (hash << 1) + scatter[tmp & 0xff];
150 hash
200 unsigned long hash = HashHash(key); local
242 unsigned long hash; local
263 unsigned long hash; local
[all...]
/hardware/invensense/60xx/libsensors_iio/software/core/mllite/
H A Dml_math_func.c541 /** bernstein hash, derived from public domain source */
544 uint32_t hash = 5381; local
549 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
552 return hash;
/hardware/invensense/6515/libsensors_iio/software/core/mllite/
H A Dml_math_func.c541 /** bernstein hash, derived from public domain source */
544 uint32_t hash = 5381; local
549 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
552 return hash;
/hardware/invensense/65xx/libsensors_iio/software/core/mllite/
H A Dml_math_func.c541 /** bernstein hash, derived from public domain source */
544 uint32_t hash = 5381; local
549 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
552 return hash;

Completed in 298 milliseconds