| /external/oprofile/daemon/ |
| opd_sfile.h | 35 * cg files are stored in the hash.
38 /** hash value for this sfile */
57 /** hash table link */
58 struct list_head hash; member in struct:sfile
67 /** hash table of opened cg sample files */
75 /** next in the hash slot */
76 struct list_head hash; member in struct:cg_entry
|
| /external/webkit/WebCore/page/ |
| SecurityOriginHash.h | 39 static unsigned hash(SecurityOrigin* origin) function in struct:WebCore::SecurityOriginHash
42 origin->protocol().impl() ? origin->protocol().impl()->hash() : 0,
43 origin->host().impl() ? origin->host().impl()->hash() : 0,
48 static unsigned hash(const RefPtr<SecurityOrigin>& origin) function in struct:WebCore::SecurityOriginHash
50 return hash(origin.get());
55 // FIXME: The hash function above compares three specific fields.
58 // equal without changing hash to match it.
|
| /external/dropbear/libtomcrypt/src/pk/dsa/ |
| dsa_verify_hash.c | 25 @param hash The hash that was signed
26 @param hashlen The length of the hash that was signed
32 const unsigned char *hash, unsigned long hashlen,
61 if ((err = mp_read_unsigned_bin(u1, (unsigned char *)hash, hashlen)) != CRYPT_OK) { goto error; }
88 @param hash The hash that was signed
89 @param hashlen The length of the hash that was signed
95 const unsigned char *hash, unsigned long hashlen,
114 err = dsa_verify_hash_raw(r, s, hash, hashlen, stat, key)
[all...] |
| 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/v8/src/ |
| hashmap.h | 51 // Dummy constructor. This constructor doesn't set up the hash
55 // initial_capacity is the size of the initial hash map;
63 // HashMap entries are (key, value, hash) triplets.
69 uint32_t hash; // the full hash value for key member in struct:v8::internal::HashMap::Entry
75 // corresponding key, key hash, and NULL value.
77 Entry* Lookup(void* key, uint32_t hash, bool insert);
80 void Remove(void* key, uint32_t hash);
82 // Empties the hash map (occupancy() == 0).
112 Entry* Probe(void* key, uint32_t hash);
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| dirhash.c | 2 * dirhash.c -- Calculate the hash of a directory entry
21 * Keyed 32-bit hash function using TEA in a Davis-Meyer function
118 /* The old legacy hash */
122 __u32 hash, hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9; local
132 hash = hash1 + (hash0 ^ (c * 7152373));
134 if (hash & 0x80000000) hash -= 0x7fffffff;
136 hash0 = hash;
177 * Returns the hash of a filename. If len is 0 and name is NULL, then
178 * this function can be used to test whether or not a hash version i
194 __u32 hash; local
[all...] |
| /external/dropbear/libtomcrypt/src/prngs/ |
| yarrow.c | 44 /* these are the default hash/cipher combo used */
91 prng->yarrow.hash = register_hash(&sha256_desc);
93 prng->yarrow.hash = register_hash(&sha512_desc);
95 prng->yarrow.hash = register_hash(&tiger_desc);
97 prng->yarrow.hash = register_hash(&sha1_desc);
99 prng->yarrow.hash = register_hash(&rmd320_desc);
101 prng->yarrow.hash = register_hash(&rmd256_desc);
103 prng->yarrow.hash = register_hash(&rmd160_desc);
105 prng->yarrow.hash = register_hash(&rmd128_desc);
107 prng->yarrow.hash = register_hash(&md5_desc)
[all...] |
| /external/ipsec-tools/src/racoon/ |
| isakmp_newg.c | 75 struct isakmp_pl_hash *hash = NULL;
101 if (hash) {
109 hash = (struct isakmp_pl_hash *)pa->ptr;
137 if (!hash || !sa) {
140 "no HASH, or no SA payload.\n");
145 /* validate HASH */
151 plog(LLV_DEBUG, LOCATION, NULL, "validate HASH\n");
163 plog(LLV_DEBUG, LOCATION, NULL, "hash source\n");
171 plog(LLV_DEBUG, LOCATION, NULL, "hash result\n");
174 r_hash = (char *)hash + sizeof(*hash)
[all...] |
| vendorid.c | 123 lookup_vendor_id_by_hash (const char *hash)
126 unsigned char *h = (unsigned char *)hash;
129 if (strncmp(all_vendor_ids[i].hash->v, hash,
130 all_vendor_ids[i].hash->l) == 0)
145 all_vendor_ids[i].hash = vmalloc(sizeof(vendorid_dpd_hash));
146 if (all_vendor_ids[i].hash == NULL) {
148 "unable to get memory for VID hash\n");
151 memcpy(all_vendor_ids[i].hash->v, vendorid_dpd_hash,
159 all_vendor_ids[i].hash = eay_md5_one(&vid)
[all...] |
| /external/dbus/dbus/ |
| dbus-hash.h | 2 /* dbus-hash.h Generic hash table utility (internal to D-Bus implementation)
37 /** Hash iterator object. The iterator is on the stack, but its real
60 DBUS_HASH_STRING, /**< Hash keys are strings. */
61 DBUS_HASH_TWO_STRINGS, /**< Hash key is two strings in one memory block, i.e. foo\\0bar\\0 */
62 DBUS_HASH_INT, /**< Hash keys are integers. */
63 DBUS_HASH_POINTER, /**< Hash keys are pointers. */
64 DBUS_HASH_ULONG /**< Hash keys are unsigned long. */
127 /** A preallocated hash entry */
|
| /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/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,
|
| /external/webkit/JavaScriptCore/profiler/ |
| CallIdentifier.h | 55 struct Hash {
56 static unsigned hash(const CallIdentifier& key) function in struct:JSC::CallIdentifier::Hash
59 key.m_name.rep()->hash(),
60 key.m_url.rep()->hash(),
70 unsigned hash() const { return Hash::hash(*this); } function in struct:JSC::CallIdentifier
82 template<> struct DefaultHash<JSC::CallIdentifier> { typedef JSC::CallIdentifier::Hash Hash; };
|
| /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...] |
| /build/tools/soslim/ |
| symfilter.c | 4 #include <hash.h>
58 /* Make sure that the ELF file has a hash table. We will use the hash
59 table to look up symbols quickly. If the library does not have a hash-
61 not written, as practically every shared library has a hash table.
68 filter->hash.sect = NULL;
70 FAILIF(NULL == filter->hash.sect,
71 "There is no hash table in this library.\n");
72 INFO("Hash table size 0x%lx, data size 0x%lx.\n",
73 (unsigned long)filter->hash.hdr->sh_size
[all...] |
| /dalvik/libcore/luni/src/main/java/java/util/ |
| HashMap.java | 90 * The hash table. If this hash map contains a mapping for null, it is
91 * not represented this hash table.
101 * The number of mappings in this hash map.
137 * the initial capacity of this hash map.
169 * the initial capacity of this hash map.
301 int hash = key.hashCode(); local
302 hash ^= (hash >>> 20) ^ (hash >>> 12)
330 int hash = key.hashCode(); local
393 int hash = secondaryHash(key.hashCode()); local
456 int hash = secondaryHash(key.hashCode()); local
624 int hash = secondaryHash(key.hashCode()); local
729 final int hash; field in class:HashMap.HashMapEntry
844 int hash = secondaryHash(key.hashCode()); local
872 int hash = secondaryHash(key.hashCode()); local
[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...] |
| /frameworks/base/services/java/com/android/server/am/ |
| PendingIntentRecord.java | 66 int hash = 23; local
67 hash = (ODD_PRIME_NUMBER*hash) + _f;
68 hash = (ODD_PRIME_NUMBER*hash) + _r;
70 hash = (ODD_PRIME_NUMBER*hash) + _w.hashCode();
73 hash = (ODD_PRIME_NUMBER*hash) + _a.hashCode();
76 hash = (ODD_PRIME_NUMBER*hash) + _i.filterHashCode()
[all...] |
| /external/openssl/crypto/err/ |
| err_def.c | 157 void (*cb_thread_release)(LHASH **hash);
172 static void int_thread_release(LHASH **hash);
291 LHASH *hash; local
294 hash = ERRFN(err_get)(0);
295 if (!hash)
299 p = (ERR_STRING_DATA *)lh_retrieve(hash, d);
308 LHASH *hash; local
311 hash = ERRFN(err_get)(1);
312 if (!hash)
316 p = (ERR_STRING_DATA *)lh_insert(hash, d)
325 LHASH *hash; local
385 LHASH *hash; local
403 LHASH *hash; local
421 LHASH *hash; local
[all...] |
| /external/e2fsprogs/debugfs/ |
| htree.c | 2 * htree.c --- hash tree routines
41 ext2_dirhash_t hash; local
77 &hash, 0);
80 "while calculating hash");
82 hash, dirent->rec_len, name);
110 int hash, i; local
121 hash = i ? ext2fs_le32_to_cpu(ent[i].hash) : 0;
122 fprintf(pager, "Entry #%d: Hash 0x%08x%s, block %u\n", i,
123 hash, (hash & 1) ? " (**)" : ""
277 ext2_dirhash_t hash, minor_hash; local
[all...] |
| /external/elfutils/lib/ |
| dynamicsizehash.h | 18 NAME name of the hash table structure.
19 TYPE data type of the hash table entries
53 /* Type of the dynamic hash table data structure. */
68 /* Initialize the hash table. */ \
71 /* Free resources allocated for hash table. */ \
80 /* Find entry in hash table. */ \
|
| /external/webkit/WebCore/platform/ |
| LinkHash.h | 40 static unsigned hash(LinkHash key) { return static_cast<unsigned>(key); } function in struct:WebCore::LinkHashHash
48 unsigned hash = static_cast<unsigned>(hash64); local
49 unsigned newHash = hash | (!(hash + 1) << 31);
60 // base URL, and returns the hash of the string that will be used for visited
66 // base URL, and returns the hash of the string that will be used for visited.
|
| /external/guava/src/com/google/common/collect/ |
| CustomConcurrentHashMap.java | 41 * A framework for concurrent hash map implementations. The
43 * any methods. Use {@link Builder} to create a custom concurrent hash map
51 * <p>The resulting hash table supports full concurrency of retrievals and
64 * reflecting the state of the hash table at some point at or since the
81 * public InternalEntry<K, V> newEntry(K key, int hash,
83 * return new InternalEntry<K, V>(key, hash, null, next);
87 * return new InternalEntry<K, V>(key, original.hash, original.value, next);
100 * public int getHash(InternalEntry<K, V> entry) { return entry.hash; }
107 * final int hash;
110 * InternalEntry(K key, int hash, V value, InternalEntry<K, V> next)
636 int hash(Object key) { method in class:CustomConcurrentHashMap.Impl
649 int hash = hash(key); local
657 int hash = strategy.getHash(entry); local
665 int hash = strategy.getHash(entry); local
1330 int hash = hash(key); local
1347 int hash = hash(key); local
1437 int hash = hash(key); local
1455 int hash = hash(key); local
1485 int hash = hash(key); local
1498 int hash = hash(key); local
1517 int hash = hash(key); local
1535 int hash = hash(key); local
2012 int hash = hash(key); local
2150 final int hash; field in class:CustomConcurrentHashMap.SimpleInternalEntry
[all...] |
| /dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| ServerKeyExchange.java | 50 final byte[] hash; field in class:ServerKeyExchange
59 * @param hash should be null for anonymous SignatureAlgorithm
62 byte[] hash) {
66 this.hash = hash;
73 if (hash != null) {
74 length += 2 + hash.length;
133 hash = in.read(size);
134 this.length += 2 + hash.length;
136 hash = null
[all...] |
