| /external/freetype/src/cache/ |
| ftccache.c | 87 /* get a top bucket for specified hash from cache,
88 * body for FTC_NODE__TOP_FOR_HASH( cache, hash )
92 FT_PtrDist hash )
98 idx = (FT_UInt)( hash & cache->mask );
100 idx = (FT_UInt)( hash & ( 2 * cache->mask + 1 ) );
109 * buckets array appropriately, we simply degrade the hash table's
153 if ( node->hash & ( mask + 1 ) )
215 /* otherwise, the hash table is balanced */
222 /* remove a node from its cache's hash table */
227 FTC_Node *pnode = FTC_NODE__TOP_FOR_HASH( cache, node0->hash );
[all...] |
| /external/valgrind/main/callgrind/ |
| context.c | 113 new_idx = (UInt) (curr->hash % new_size);
130 CLG_DEBUG(0, "Resize Context Hash: %d => %d (entries %d, conflicts %d/%d)\n",
142 UWord hash = 0; local
145 hash = (hash<<7) + (hash>>25) + (UWord)(*fn);
150 return hash;
154 static Bool is_cxt(UWord hash, fn_node** fn, Context* cxt)
159 if (hash != cxt->hash) return False
179 UWord hash; local
239 UWord hash; local
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| HashMap.java | 87 * The hash table. If this hash map contains a mapping for null, it is
88 * not represented this hash table.
98 * The number of mappings in this hash map.
134 * the initial capacity of this hash map.
166 * the initial capacity of this hash map.
302 int hash = key.hashCode(); local
303 hash ^= (hash >>> 20) ^ (hash >>> 12)
332 int hash = key.hashCode(); local
350 int hash = key.hashCode(); local
404 int hash = secondaryHash(key); local
467 int hash = secondaryHash(key); local
635 int hash = secondaryHash(key); local
740 final int hash; field in class:HashMap.HashMapEntry
855 int hash = secondaryHash(key); local
883 int hash = secondaryHash(key); local
[all...] |
| /external/chromium_org/content/browser/download/ |
| base_file_unittest.cc | 95 std::string hash; local
97 hash.assign(reinterpret_cast<const char*>(sha256_hash_),
99 return hash;
214 // Hash calculator.
258 // Write data to the file and detach it, and calculate its sha256 hash.
260 // Calculate the final hash.
272 std::string hash; local
273 base_file_->GetHash(&hash);
276 EXPECT_EQ(expected_hash_hex, base::HexEncode(hash.data(), hash.size()))
315 std::string hash; local
337 std::string hash; local
353 std::string hash; local
413 std::string hash; local
515 std::string hash; local
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| fts1_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
42 /* Turn bulk memory into a hash table object by initializing the
43 ** fields of the Hash structure.
45 ** "pNew" is a pointer to the hash table that is to be initialized.
48 ** determines what kind of key the hash table will use. "copyKey" is
49 ** true if the hash table should make its own private copy of keys and
65 /* Remove all entries from a hash table. Reclaim all memory.
66 ** Call this routine to delete a hash table or to reset a hash tabl
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts2/ |
| fts2_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
49 /* Turn bulk memory into a hash table object by initializing the
50 ** fields of the Hash structure.
52 ** "pNew" is a pointer to the hash table that is to be initialized.
55 ** determines what kind of key the hash table will use. "copyKey" is
56 ** true if the hash table should make its own private copy of keys and
70 /* Remove all entries from a hash table. Reclaim all memory.
71 ** Call this routine to delete a hash table or to reset a hash tabl
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts3/ |
| fts3_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
49 /* Turn bulk memory into a hash table object by initializing the
50 ** fields of the Hash structure.
52 ** "pNew" is a pointer to the hash table that is to be initialized.
55 ** determines what kind of key the hash table will use. "copyKey" is
56 ** true if the hash table should make its own private copy of keys and
70 /* Remove all entries from a hash table. Reclaim all memory.
71 ** Call this routine to delete a hash table or to reset a hash tabl
[all...] |
| /external/chromium_org/third_party/smhasher/src/ |
| KeysetTest.cpp | 10 // This should hopefully be a thorough and uambiguous test of whether a hash
13 bool VerificationTest ( pfHash hash, const int hashbits, uint32_t expected, bool verbose )
25 // Hash keys of the form {0}, {0,1}, {0,1,2}... up to N=255,using 256-N as
32 hash(key,i,256-i,&hashes[i*hashbytes]);
35 // Then hash the result array
37 hash(hashes,hashbytes*256,0,final);
39 // The first four bytes of that hash, interpreted as a little-endian integer, is our
65 // A hash function should not be reading outside the bounds of the key.
68 // result in a different hash.
72 // The memory alignment of the key should not affect the hash result
276 const hashtype & hash = (*it).first; local
[all...] |
| /external/dropbear/libtomcrypt/src/hashes/sha2/ |
| sha384.c | 13 SHA384 hash included in sha512.c, Tom St Denis
35 Initialize the hash state
36 @param md The hash state you wish to initialize
57 Terminate the hash to get the digest
58 @param md The hash state
59 @param out [out] The destination of the hash (48 bytes)
82 Self-test the hash
92 unsigned char hash[48];
120 if (XMEMCMP(tmp, tests[i].hash, 48) != 0) {
|
| /external/dropbear/libtomcrypt/src/pk/dsa/ |
| dsa_encrypt_key.c | 28 @param hash The index of the hash you want to use
34 prng_state *prng, int wprng, int hash,
47 /* check that wprng/cipher/hash are not invalid */
52 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
56 if (inlen > hash_descriptor[hash].hashsize) {
102 if ((err = hash_memory(hash, expt, x, skey, &y)) != CRYPT_OK) {
112 LTC_ASN1_OBJECT_IDENTIFIER, hash_descriptor[hash].OIDlen, hash_descriptor[hash].OID,
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| ecc_encrypt_key.c | 34 @param hash The index of the hash you want to use
40 prng_state *prng, int wprng, int hash,
53 /* check that wprng/cipher/hash are not invalid */
58 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
62 if (inlen > hash_descriptor[hash].hashsize) {
102 if ((err = hash_memory(hash, ecc_shared, x, skey, &y)) != CRYPT_OK) {
112 LTC_ASN1_OBJECT_IDENTIFIER, hash_descriptor[hash].OIDlen, hash_descriptor[hash].OID,
|
| /system/core/include/cutils/ |
| hashmap.h | 18 * Hash map.
31 /** A hash map. */
35 * Creates a new hash map. Returns NULL if memory allocation fails.
38 * @param hash function which hashes keys
42 int (*hash)(void* key), bool (*equals)(void* keyA, void* keyB));
45 * Frees the hash map. Does not free the keys or values themselves.
51 * implementing hash functions.
109 * Locks the hash map so only the current thread can access it.
114 * Unlocks the hash map so other threads can access it.
|
| /bootable/recovery/minzip/ |
| Hash.h | 4 * General purpose hash table, used for finding classes, methods, etc.
18 /* compute the hash of an item with a specific type */
22 * Compare a hash entry with a "loose" item after their hash values match.
40 * One entry in the hash table. "data" values are expected to be (or have
57 * Expandable hash table.
88 * Clear out a hash table, freeing the contents of any used entries.
93 * Free a hash table.
98 * Get #of entries in hash table.
105 * Get total size of hash table (for memory usage calculations)
[all...] |
| /external/apache-harmony/x-net/src/test/impl/java.injected/org/apache/harmony/xnet/provider/jsse/ |
| ServerKeyExchangeTest.java | 37 byte[] hash = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5,
40 null, hash);
44 assertTrue("incorrect ServerKeyExchange", Arrays.equals(message.hash,
45 hash));
61 assertTrue("incorrect message decoding", Arrays.equals(message.hash,
62 message_2.hash));
91 byte[] hash = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5,
94 hash);
98 assertTrue("incorrect ServerKeyExchange", Arrays.equals(message.hash,
99 hash));
[all...] |
| /external/chromium_org/chrome/common/metrics/ |
| metrics_log_base.cc | 37 // Converts the 8-byte prefix of an MD5 hash into a uint64 value.
38 inline uint64 HashToUInt64(const std::string& hash) {
40 DCHECK_GE(hash.size(), sizeof(value));
41 memcpy(&value, hash.data(), sizeof(value));
73 uma_proto_.set_client_id(Hash(client_id));
85 uint64 MetricsLogBase::Hash(const std::string& value) {
86 // Create an MD5 hash of the given |value|, represented as a byte buffer
96 uint64 hash = HashToUInt64(hash_str); local
100 // that happens, all we get to see (server side) is a hash of the histogram
104 DVLOG(1) << "Metrics: Hash numeric [" << value << "]=[" << hash << "]" local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| assign_copy.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
32 test_hash<std::hash<int> >,
48 test_hash<std::hash<int> >(8),
54 test_hash<std::hash<int> >(2),
73 assert(c.hash_function() == test_hash<std::hash<int> >(8));
85 test_hash<std::hash<int> >,
101 test_hash<std::hash<int> >(8),
107 test_hash<std::hash<int> >(2),
126 assert(c.hash_function() == test_hash<std::hash<int> >(8))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| assign_copy.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
32 test_hash<std::hash<int> >,
48 test_hash<std::hash<int> >(8),
54 test_hash<std::hash<int> >(2),
65 assert(c.hash_function() == test_hash<std::hash<int> >(8));
77 test_hash<std::hash<int> >,
93 test_hash<std::hash<int> >(8),
99 test_hash<std::hash<int> >(2),
110 assert(c.hash_function() == test_hash<std::hash<int> >(8))
[all...] |
| assign_move.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
49 test_hash<std::hash<int> >(8),
55 test_hash<std::hash<int> >(2),
66 assert(c.hash_function() == test_hash<std::hash<int> >(8));
78 test_hash<std::hash<int> >,
94 test_hash<std::hash<int> >(8),
100 test_hash<std::hash<int> >(2),
111 assert(c.hash_function() == test_hash<std::hash<int> >(8))
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| hashlib.py | 7 __doc__ = """hashlib module - A common interface to many hash functions.
9 new(name, string='') - returns a new hash object implementing the
10 given hash function; initializing the hash
21 NOTE: If you want the adler32 or crc32 hash functions they are available in
24 Choose your hash function wisely. Some have known collision weaknesses.
27 Hash objects have these methods:
28 - update(arg): Update the hash object with the string arg. Repeated calls
36 - copy(): Return a copy (clone) of the hash object. This can be used to
89 pass # no extension module, this hash is unsupported
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| hashlib.py | 7 __doc__ = """hashlib module - A common interface to many hash functions.
9 new(name, string='') - returns a new hash object implementing the
10 given hash function; initializing the hash
21 NOTE: If you want the adler32 or crc32 hash functions they are available in
24 Choose your hash function wisely. Some have known collision weaknesses.
27 Hash objects have these methods:
28 - update(arg): Update the hash object with the string arg. Repeated calls
36 - copy(): Return a copy (clone) of the hash object. This can be used to
89 pass # no extension module, this hash is unsupported
[all...] |
| /external/chromium_org/chrome/browser/spellchecker/ |
| feedback_unittest.cc | 19 // Hash identifier for a misspelling.
31 void AddMisspelling(int renderer_process_id, uint32 hash) {
33 misspelling.hash = hash;
46 EXPECT_EQ(kMisspellingHash, result->hash);
91 EXPECT_EQ(kMisspellingHash, renderer_with_misspellings[0].hash);
166 EXPECT_NE(result[0].hash, result[1].hash);
167 EXPECT_TRUE(result[0].hash == kMisspellingHash ||
168 result[0].hash == kMisspellingHash + 1)
192 uint32 hash = kMisspellingHash; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| StringHasher.h | 30 // http://www.azillionmonkeys.com/qed/hash.html
34 // NOTE: The hash computation here must stay in sync with the create_hash_table script in
37 // Golden ratio. Arbitrary start value to avoid mapping all zeros to a hash value of zero.
164 // Reserving space from the high bits for flags preserves most of the hash's
165 // value, since hash lookup typically masks out the high bits anyway.
168 // This avoids ever returning a hash code of 0, since that is used to
169 // signal "hash not computed yet". Setting the high bit maintains
170 // reasonable fidelity to a hash code of 0 because it is likely to yield
171 // exactly 0 when hash lookup masks out the high bits.
178 unsigned hash() cons function in class:WTF::StringHasher
[all...] |
| /external/ipsec-tools/src/racoon/ |
| vendorid.c | 132 lookup_vendor_id_by_hash (const char *hash)
135 unsigned char *h = (unsigned char *)hash;
138 if (strncmp(all_vendor_ids[i].hash->v, hash,
139 all_vendor_ids[i].hash->l) == 0)
154 all_vendor_ids[i].hash = vmalloc(sizeof(vendorid_dpd_hash));
155 if (all_vendor_ids[i].hash == NULL) {
157 "unable to get memory for VID hash\n");
160 memcpy(all_vendor_ids[i].hash->v, vendorid_dpd_hash,
168 all_vendor_ids[i].hash = eay_md5_one(&vid)
[all...] |
| /external/oprofile/libdb/ |
| odb.h | 4 * of in-memory, through mmaped file, growable hash table, that stores
29 /** store the hash mask, hash table size are always power of two */
32 /* there is (bucket factor * nr node) entry in hash table, this can seem
33 * excessive but hash coding eip don't give a good distributions and our
36 * re-enable zeroing hash table if BUCKET_FACTOR > 2 (roughly exact, you
41 /** a db hash node */
50 * the hash table (when growing we avoid to copy node array)
65 * odb_open(&hash, filename, ODB_RW, sizeof(header));
72 * the hash table: array of odb_index_t indexing the node array
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| hash.c | 2 * \file hash.c
3 * Generic hash table.
6 * buffer objects, etc. The hash functions are thread-safe.
41 #include "hash.h"
50 * An entry in the hash table.
60 * The hash table data structure.
73 * Create a new hash table.
75 * \return pointer to a new, empty hash table.
91 * Delete a hash table.
92 * Frees each entry on the hash table and then the hash table structure itself
[all...] |
