| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_hash_table.h | 29 * General purpose hash table.
47 * Generic purpose hash table.
53 * Create an hash table.
55 * @param hash hash function
59 util_hash_table_create(unsigned (*hash)(void *key),
|
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| hash_table.h | 26 * \brief Implementation of a generic, opaque hash table data type.
53 * Hash table constructor
55 * Creates a hash table with the specified number of buckets. The supplied
56 * \c hash and \c compare routines are used when adding elements to the table
59 * \param num_buckets Number of buckets (bins) in the hash table.
60 * \param hash Function used to compute hash value of input keys.
64 hash_func_t hash, hash_compare_func_t compare);
68 * Release all memory associated with a hash table
77 * Flush all entries from a hash tabl
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/precompiler/ |
| PrecompiledTemplateMapKey.java | 56 int hash = 17; local
58 hash = 31 * hash + templateName.hashCode();
59 hash = 31 * hash + escapeMode.hashCode();
60 return hash;
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_hash_table.h | 29 * General purpose hash table.
47 * Generic purpose hash table.
53 * Create an hash table.
55 * @param hash hash function
59 util_hash_table_create(unsigned (*hash)(void *key),
|
| /external/mesa3d/src/mesa/program/ |
| hash_table.h | 26 * \brief Implementation of a generic, opaque hash table data type.
53 * Hash table constructor
55 * Creates a hash table with the specified number of buckets. The supplied
56 * \c hash and \c compare routines are used when adding elements to the table
59 * \param num_buckets Number of buckets (bins) in the hash table.
60 * \param hash Function used to compute hash value of input keys.
64 hash_func_t hash, hash_compare_func_t compare);
68 * Release all memory associated with a hash table
77 * Flush all entries from a hash tabl
[all...] |
| /frameworks/base/core/java/android/view/ |
| DisplayAdjustments.java | 80 int hash = 17; local
81 hash = hash * 31 + mCompatInfo.hashCode();
83 hash = hash * 31 + (mActivityToken == null ? 0 : mActivityToken.hashCode());
85 return hash;
|
| /external/chromium_org/components/variations/ |
| metrics_util.h | 14 // Computes a uint32 hash of a given string based on its SHA1 hash. Suitable for
|
| /external/chromium_org/device/bluetooth/ |
| bluetooth_out_of_band_pairing_data.h | 18 // Simple Pairing Hash C.
19 uint8 hash[kBluetoothOutOfBandPairingDataSize]; member in struct:device::BluetoothOutOfBandPairingData
|
| /external/chromium_org/net/data/ssl/scripts/ |
| eku-test.cnf | 19 subjectKeyIdentifier = hash
25 subjectKeyIdentifier = hash
|
| /external/chromium_org/third_party/WebKit/ManualTests/resources/ |
| hash-ref-test.html | 3 <title>Test Case for Bug 13067: Manually adding #hash to URL reloads entire page instead of jumping to #hash location in cached page</title>
|
| /external/chromium_org/third_party/freetype/src/cache/ |
| ftccache.h | 62 FT_PtrDist hash; /* used for hashing too */ member in struct:FTC_NodeRec_
76 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
78 ( ( ( ( hash ) & ( cache )->mask ) < ( cache )->p ) \
79 ? ( ( hash ) & ( ( cache )->mask * 2 + 1 ) ) \
80 : ( ( hash ) & ( cache )->mask ) ) )
84 FT_PtrDist hash );
85 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
86 ftc_get_top_node_for_hash( ( cache ), ( hash ) )
142 /* each cache really implements a dynamic hash table to manage its nodes */
182 FT_PtrDist hash,
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/translate/ |
| translate_cache.c | 37 struct cso_hash *hash; member in struct:translate_cache
47 cache->hash = cso_hash_create();
54 struct cso_hash *hash = cache->hash; local
55 struct cso_hash_iter iter = cso_hash_first_node(hash);
68 cso_hash_delete(cache->hash);
95 cso_hash_find_data_from_template(cache->hash,
102 cso_hash_insert(cache->hash, hash_key, translate);
|
| /external/chromium_org/third_party/smhasher/src/ |
| SpeedTest.h | 5 void BulkSpeedTest ( pfHash hash, uint32_t seed );
6 void TinySpeedTest ( pfHash hash, int hashsize, int keysize, uint32_t seed, bool verbose, double & outCycles );
|
| /external/dropbear/libtomcrypt/src/mac/hmac/ |
| hmac_memory.c | 22 @param hash The index of the hash to use
31 int hmac_memory(int hash,
44 /* make sure hash descriptor is valid */
45 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
50 if (hash_descriptor[hash].hmac_block != NULL) {
51 return hash_descriptor[hash].hmac_block(key, keylen, in, inlen, out, outlen);
61 if ((err = hmac_init(hmac, hash, key, keylen)) != CRYPT_OK) {
|
| /external/dropbear/libtomcrypt/src/pk/pkcs1/ |
| pkcs_1_pss_decode.c | 22 @param msghash The hash to verify
23 @param msghashlen The length of the hash (octets)
27 @param hash_idx The index of the hash desired
37 unsigned char *DB, *mask, *salt, *hash; local
48 /* ensure hash is valid */
62 /* allocate ram for DB/mask/salt/hash of size modulus_len */
66 hash = XMALLOC(modulus_len);
67 if (DB == NULL || mask == NULL || salt == NULL || hash == NULL) {
77 if (hash != NULL) {
78 XFREE(hash);
[all...] |
| /external/freetype/src/cache/ |
| ftccache.h | 62 FT_PtrDist hash; /* used for hashing too */ member in struct:FTC_NodeRec_
76 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
78 ( ( ( ( hash ) & ( cache )->mask ) < ( cache )->p ) \
79 ? ( ( hash ) & ( ( cache )->mask * 2 + 1 ) ) \
80 : ( ( hash ) & ( cache )->mask ) ) )
84 FT_PtrDist hash );
85 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
86 ftc_get_top_node_for_hash( ( cache ), ( hash ) )
142 /* each cache really implements a dynamic hash table to manage its nodes */
182 FT_PtrDist hash,
[all...] |
| /external/libphonenumber/java/src/com/android/i18n/phonenumbers/ |
| Phonenumber.java | 227 int hash = 41; local
228 hash = (53 * hash) + getCountryCode();
229 hash = (53 * hash) + Long.valueOf(getNationalNumber()).hashCode();
230 hash = (53 * hash) + getExtension().hashCode();
231 hash = (53 * hash) + (isItalianLeadingZero() ? 1231 : 1237);
232 hash = (53 * hash) + getRawInput().hashCode()
[all...] |
| /external/mesa3d/src/gallium/auxiliary/translate/ |
| translate_cache.c | 37 struct cso_hash *hash; member in struct:translate_cache
47 cache->hash = cso_hash_create();
54 struct cso_hash *hash = cache->hash; local
55 struct cso_hash_iter iter = cso_hash_first_node(hash);
68 cso_hash_delete(cache->hash);
95 cso_hash_find_data_from_template(cache->hash,
102 cso_hash_insert(cache->hash, hash_key, translate);
|
| /packages/apps/UnifiedEmail/src/com/android/mail/bitmap/ |
| ImageAttachmentRequest.java | 48 int hash = 17; local
49 hash += 31 * hash + mLookupUri.hashCode();
50 hash += 31 * hash + mRendition;
51 hash += 31 * hash + mDestW;
52 return hash;
|
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| ft_hash.c | 12 ** This is the implementation of generic hash-tables used in SQLite.
13 ** We've modified it slightly to serve as a standalone hash table
30 /* Turn bulk memory into a hash table object by initializing the
31 ** fields of the Hash structure.
33 ** "pNew" is a pointer to the hash table that is to be initialized.
36 ** determines what kind of key the hash table will use. "copyKey" is
37 ** true if the hash table should make its own private copy of keys and
42 void HashInit(Hash *pNew, int keyClass, int copyKey){
58 /* Remove all entries from a hash table. Reclaim all memory.
59 ** Call this routine to delete a hash table or to reset a hash tabl
[all...] |
| fts1_hash.h | 12 ** This is the header file for the generic hash-table implemenation
14 ** hash table implementation for the full-text indexing module.
24 /* A complete hash table is an instance of the following structure.
39 int htsize; /* Number of buckets in the hash table */
40 struct _fts1ht { /* the hash table */
41 int count; /* Number of entries with this hash */
42 fts1HashElem *chain; /* Pointer to first entry with this hash */
46 /* Each element in the hash table is an instance of the following
59 ** There are 2 different modes of operation for a hash table:
90 ** Macros for looping over all elements of a hash table. The idiom i
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
| cso_cache.c | 51 unsigned hash = 0, i; local
58 hash ^= ikey[i];
60 return hash;
85 struct cso_hash *hash; local
86 hash = sc->hashes[type];
87 return hash;
156 struct cso_hash *hash,
161 sc->sanitize_cb(hash, type, max_size, sc->sanitize_data);
165 static INLINE void sanitize_cb(struct cso_hash *hash, enum cso_cache_type type,
170 int hash_size = cso_hash_size(hash);
190 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
200 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
242 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
266 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
[all...] |
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| cso_cache.c | 51 unsigned hash = 0, i; local
58 hash ^= ikey[i];
60 return hash;
85 struct cso_hash *hash; local
86 hash = sc->hashes[type];
87 return hash;
156 struct cso_hash *hash,
161 sc->sanitize_cb(hash, type, max_size, sc->sanitize_data);
165 static INLINE void sanitize_cb(struct cso_hash *hash, enum cso_cache_type type,
170 int hash_size = cso_hash_size(hash);
190 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
200 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
242 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
266 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
[all...] |
| /external/chromium_org/chrome/browser/spellchecker/ |
| feedback.h | 9 // |Misspelling| object is identified by a |hash| and corresponds to a document
10 // marker with the same |hash| identifier in the renderer.
37 // Returns the misspelling identified by |hash|. Returns NULL if there's no
38 // misspelling identified by |hash|. Retains the ownership of the result. The
39 // caller should not modify the hash in the returned misspelling.
40 Misspelling* GetMisspelling(uint32 hash);
61 // Returns true if there's a misspelling with |hash| identifier.
62 bool HasMisspelling(uint32 hash) const;
65 // duplicate hash, then replaces the existing misspelling with the same hash
[all...] |
| /external/chromium_org/net/quic/crypto/ |
| common_cert_set.cc | 30 // hash contains the 64-bit, FNV-1a hash of this set.
31 uint64 hash; member in struct:net::__anon9274::CertSet
77 virtual StringPiece GetCert(uint64 hash, uint32 index) const OVERRIDE {
79 if (kSets[i].hash == hash) {
99 uint64 hash; variable
100 memcpy(&hash, common_set_hashes.data() + i * sizeof(uint64),
104 if (kSets[j].hash != hash) {
[all...] |
