/external/dbus/dbus/ |
dbus-hash.h | 2 /* dbus-hash.h Generic hash table utility (internal to D-Bus implementation) 46 /** Hash iterator object. The iterator is on the stack, but its real 69 DBUS_HASH_STRING, /**< Hash keys are strings. */ 70 DBUS_HASH_TWO_STRINGS, /**< Hash key is two strings in one memory block, i.e. foo\\0bar\\0 */ 71 DBUS_HASH_INT, /**< Hash keys are integers. */ 72 DBUS_HASH_POINTER, /**< Hash keys are pointers. */ 73 DBUS_HASH_UINTPTR /**< Hash keys are integer capable to hold a pointer. */ 136 /** 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) {
|
sha224.c | 36 Initialize the hash state 37 @param md The hash state you wish to initialize 58 Terminate the hash to get the digest 59 @param md The hash state 60 @param out [out] The destination of the hash (28 bytes) 80 Self-test the hash 90 unsigned char hash[28]; 114 if (XMEMCMP(tmp, tests[i].hash, 28) != 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,
|
/external/webkit/Source/JavaScriptCore/profiler/ |
CallIdentifier.h | 58 struct Hash { 59 static unsigned hash(const CallIdentifier& key) function in struct:JSC::CallIdentifier::Hash 62 key.m_name.impl()->hash(), 63 key.m_url.impl()->hash(), 73 unsigned hash() const { return Hash::hash(*this); } function in struct:JSC::CallIdentifier 85 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...] |
/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/ipsec-tools/src/racoon/ |
vendorid.c | 133 lookup_vendor_id_by_hash (const char *hash) 136 unsigned char *h = (unsigned char *)hash; 139 if (strncmp(all_vendor_ids[i].hash->v, hash, 140 all_vendor_ids[i].hash->l) == 0) 155 all_vendor_ids[i].hash = vmalloc(sizeof(vendorid_dpd_hash)); 156 if (all_vendor_ids[i].hash == NULL) { 158 "unable to get memory for VID hash\n"); 161 memcpy(all_vendor_ids[i].hash->v, vendorid_dpd_hash, 169 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...] |
/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. 298 int hash = key.hashCode(); local 299 hash ^= (hash >>> 20) ^ (hash >>> 12) 327 int hash = key.hashCode(); local 390 int hash = secondaryHash(key.hashCode()); local 453 int hash = secondaryHash(key.hashCode()); local 621 int hash = secondaryHash(key.hashCode()); local 726 final int hash; field in class:HashMap.HashMapEntry 841 int hash = secondaryHash(key.hashCode()); local 869 int hash = secondaryHash(key.hashCode()); local [all...] |
/external/apache-harmony/math/src/test/java/org/apache/harmony/tests/java/math/ |
BigIntegerHashCodeTest.java | 33 * Test hash codes for the same object 47 assertTrue("hash codes for the same object differ", code1 == code2); 51 * Test hash codes for equal objects. 61 assertTrue("hash codes for equal objects are unequal", code1 == code2); 66 * Test hash codes for unequal objects. 77 assertTrue("hash codes for unequal objects are equal", code1 != code2);
|
/external/chromium/chrome/common/extensions/docs/js/ |
sample_search.js | 28 window.location.hash = searchinput.value; 80 if (window.location.hash.length > 1) { 81 var hash = window.location.hash.substring(1); 82 var elem = document.getElementById(hash); 86 setFilter(hash);
|
/external/e2fsprogs/debugfs/ |
htree.c | 2 * htree.c --- hash tree routines 43 ext2_dirhash_t hash, minor_hash; local 90 &hash, &minor_hash); 93 "while calculating hash"); 95 hash, minor_hash, rec_len, name); 123 int hash, i; local 134 hash = i ? ext2fs_le32_to_cpu(ent[i].hash) : 0; 135 fprintf(pager, "Entry #%d: Hash 0x%08x%s, block %u\n", i, 136 hash, (hash & 1) ? " (**)" : "" 297 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/Source/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.
|
/libcore/luni/src/main/java/libcore/icu/ |
CollationKeyICU.java | 25 * Cached hash value. 85 * Creates a hash code for this CollationKey. 86 * Compute the hash by iterating sparsely over about 32 (up to 63) bytes 88 * hash value by a prime number and add the new byte in, like a linear 91 * @return hash value of collation key. Hash value is never 0.
|
/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...] |
/external/mesa3d/src/glsl/glcpp/ |
glcpp-lex.l | 66 HASH ^{HSPACE}*#{HSPACE}* 94 {HASH}version { 102 {HASH}(extension|pragma)[^\n]+ { 109 {HASH}line{HSPACE}+{DIGITS}{HSPACE}+{DIGITS}{HSPACE}*$ { 125 {HASH}line{HSPACE}+{DIGITS}{HSPACE}*$ { 140 {HASH}ifdef/.*\n { 146 {HASH}ifndef/.*\n { 152 {HASH}if/[^_a-zA-Z0-9].*\n { 158 {HASH}elif/.*\n { 164 {HASH}else/.*\n [all...] |
/external/libxml2/include/libxml/ |
hash.h | 2 * Summary: Chained hash tables 3 * Description: This module implements the hash table support used in 19 * The hash table. 64 * @payload: the data in the hash 67 * Callback to free data from a hash. 72 * @payload: the data in the hash 75 * Callback to copy data from a hash. 82 * @payload: the data in the hash 86 * Callback when scanning data in a hash with the simple scanner. 91 * @payload: the data in the hash [all...] |
/libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
ServerKeyExchange.java | 48 final byte[] hash; field in class:ServerKeyExchange 57 * @param hash should be null for anonymous SignatureAlgorithm 60 byte[] hash) { 64 this.hash = hash; 71 if (hash != null) { 72 length += 2 + hash.length; 131 hash = in.read(size); 132 this.length += 2 + hash.length; 134 hash = null [all...] |
/external/chromium/sdch/open-vcdiff/src/ |
rolling_hash.h | 29 // Definitions common to all hash window sizes. 65 // Here's the heart of the hash algorithm. Start with a partial_hash value of 67 // hashed. The result will be the hash value for the entire data window. The 68 // Hash() function, below, does exactly this, albeit with some refinements. 74 // Use this function to start computing a new hash value based on the first 108 // instance of this type to use UpdateHash(), but Hash() does not depend on 117 // Compute a hash of the window "ptr[0, window_size - 1]". 118 static uint32_t Hash(const char* ptr) { 126 // Update a hash by removing the oldest byte and adding a new byte. 128 // UpdateHash takes the hash value of buffer[0] ... buffer[window_size -1 [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
ConcurrentHashMap.java | 20 * A hash table supporting full concurrency of retrievals and 38 * Enumerations return elements reflecting the state of the hash table 48 * in hash tables is essentially random, the actual concurrency will 57 * hash table is a relatively slow operation, so, when possible, it is 79 * each of which itself is a concurrently readable hash table. 128 * key's hash code are used to choose the segment. 138 * The segments, each of which is a specialized hash table 149 * Applies a supplemental hash function to a given hashCode, which 150 * defends against poor quality hash functions. This is critical 151 * because ConcurrentHashMap uses power-of-two length hash tables 155 private static int hash(int h) { method in class:ConcurrentHashMap 191 final int hash; field in class:ConcurrentHashMap.HashEntry 767 int hash = hash(key.hashCode()); local 781 int hash = hash(key.hashCode()); local 881 int hash = hash(key.hashCode()); local 895 int hash = hash(key.hashCode()); local 921 int hash = hash(key.hashCode()); local 931 int hash = hash(key.hashCode()); local 945 int hash = hash(key.hashCode()); local 959 int hash = hash(key.hashCode()); local [all...] |
/external/chromium/base/ |
hash_tables.h | 14 // NOTE: It is an explicit non-goal of this class to provide a generic hash 15 // function for pointers. If you want to hash a pointers to a particular class, 64 // The GNU C++ library provides identity hash functions for many integral types, 65 // but not for |long long|. This hash function will truncate if |size_t| is 71 struct hash<integral_type> { \ 83 // Implement string hash functions so that strings of various flavors can 84 // be used as keys in STL maps and sets. The hash algorithm comes from the 91 struct hash<string_type> { \
|