HomeSort by relevance Sort by last modified time
    Searched full:hash (Results 151 - 175 of 2206) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/elfutils/lib/
dynamicsizehash.c 20 NAME name of the hash table structure.
21 TYPE data type of the hash table entries
37 /* First hash function: simply take the modul but prevent zero. */
42 unsigned long int hash; local
48 /* Second hash function as suggested in [Knuth]. */
49 hash = 1 + hval % (htab->size - 2);
53 if (idx <= hash)
54 idx = htab->size + idx - hash;
56 idx -= hash;
207 /* Make the hash value nonzero. *
    [all...]
fixedsizehash.h 1 /* Fixed size hash table with internal linking.
30 TYPE data type of the hash table entries
38 INSERT_HASH if defined alternate insert function which takes a hash
128 HASHTYPE hash; local
135 /* Second hash function as suggested in [Knuth]. */
136 hash = 1 + hval % (htab->nslots - 2);
140 if (idx <= hash)
141 idx = htab->nslots + idx - hash;
143 idx -= hash;
  /external/guava/src/com/google/common/collect/
MapMaker.java 63 * The returned map is implemented as a hash table with similar performance
114 * any other kind of hash table is a relatively slow operation, so,
131 * contention. Because placement in hash tables is essentially random,
346 @Override int hash(Object o) { method
355 int hash, ReferenceEntry<K, V> next) {
357 ? new WeakEntry<K, V>(internals, key, hash)
358 : new LinkedWeakEntry<K, V>(internals, key, hash, next);
365 ? new WeakEntry<K, V>(from.internals, key, from.hash)
367 from.internals, key, from.hash, newNext);
375 @Override int hash(Object o) method
404 @Override int hash(Object o) { method
439 abstract int hash(Object o); method in class:MapMaker.Strength
895 final int hash; field in class:MapMaker.StrongEntry
954 final int hash; field in class:MapMaker.SoftEntry
1012 final int hash; field in class:MapMaker.WeakEntry
    [all...]
  /external/oprofile/libdb/
db_stat.c 22 odb_index_t hash_table_size; /**< hash table entry number */
46 /* FIXME: I'm dubious if this do right statistics for hash table
79 printf("hash table size: %d\n", stat->hash_table_size);
  /external/webkit/WebKitTools/iExploder/tools/
lasthit.rb 12 hostHash = Hash.new
26 hostHash[host] = Hash.new
29 hostHash[host][agent] = Hash.new
  /frameworks/base/core/java/android/security/
MessageDigest.java 22 * Base class for producing a message digest from different hash encryptions.
29 * @param algorithm The type of hash function to use. Valid values are
61 * @return The digest (hash sum).
  /bionic/libc/stdio/
flockfile.c 42 * we use a hash-table to map FILE* pointers to recursive mutexes
53 /* a node in the hash table */
60 /* use a static hash table. We assume that we're not going to
101 uint32_t hash = (uint32_t)(void*)f; local
104 hash = (hash >> 2) ^ (hash << 17);
105 pnode = &t->buckets[hash % FILE_LOCK_BUCKETS];
127 /* create a new node in the hash table */
  /dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/
KeyManagerImpl.java 51 private final Hashtable<String, PrivateKeyEntry> hash; field in class:KeyManagerImpl
61 this.hash = new Hashtable<String, PrivateKeyEntry>();
74 hash.put(alias, entry);
102 if (hash.containsKey(alias)) {
103 Certificate[] certs = hash.get(alias).getCertificateChain();
130 if (hash.containsKey(alias)) {
131 return hash.get(alias).getPrivateKey();
153 for (Enumeration<String> aliases = hash.keys(); aliases.hasMoreElements();) {
155 final KeyStore.PrivateKeyEntry entry = hash.get(alias);
  /dalvik/vm/hprof/
HprofString.c 43 u4 hash = 0; local
49 hash = hash * 31 + c;
52 return hash;
  /external/dropbear/libtomcrypt/src/mac/hmac/
hmac_memory_multi.c 23 @param hash The index of the hash to use
33 int hmac_memory_multi(int hash,
56 if ((err = hmac_init(hmac, hash, key, keylen)) != CRYPT_OK) {
  /external/dropbear/libtomcrypt/src/pk/pkcs1/
pkcs_1_mgf1.c 24 @param hash_idx The index of the hash desired
42 /* ensure valid hash */
47 /* get hash output size */
71 /* get hash of seed || counter */
  /external/dropbear/
random.c 43 /* The basic setup is we read some data from /dev/(u)random or prngd and hash it
44 * into hashpool. To read data, we hash together current hashpool contents,
145 /* hash in the new seed data */
155 /* hash the current random pool with some unique identifiers
182 unsigned char hash[SHA1_HASH_SIZE]; local
193 sha1_done(&hs, hash);
201 memcpy(buf, hash, copylen);
205 m_burn(hash, sizeof(hash));
  /external/icu4c/common/
locutil.h 13 #include "hash.h"
  /external/webkit/LayoutTests/http/tests/appcache/resources/
main-resource-hash-frame.html 1 <html manifest="/appcache/resources/main-resource-hash-frame.manifest#foo">
  /external/webkit/WebKitTools/Scripts/webkitpy/layout_tests/test_types/
image_diff.py 120 # If we didn't produce a hash file, this test must be text-only.
121 if test_args.hash is None:
127 test_args.hash)
150 test_args.hash, expected_hash,
155 elif test_args.hash == expected_hash:
156 # Hash matched (no diff needed, okay to return).
161 test_args.hash, expected_hash,
171 elif test_args.hash != expected_hash:
173 # the hash is wrong.
  /prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/i686-unknown-linux-gnu/lib/ldscripts/
i386linux.xr 14 *(.hash)
i386linux.xu 14 *(.hash)
  /system/wlan/ti/wilink_6_1/stad/src/Sta_Management/
siteHash.c 35 * \brief Site Hash implementation
43 /* PURPOSE: Site Hash implementation */
58 This file implements the site hash mechanism. This mechanism is used for faster access to the sites information.
60 1. hash function - which maps the 4 last bits of the BSSID to an entry in the hash table.
61 2. hash table - each entry in the table points to a linked list of site entries
64 In order to find a site in the site table, we operate the hash function on the site's BSSID.
65 We receive a hash entry. We go over the linked list pointed by this hash entry until we find the site entry.
80 - Hash tabl
    [all...]
  /dalvik/libcore/luni/src/main/java/java/util/
UUID.java 55 private transient int hash; field in class:UUID
79 // setup hash field
82 hash = msbHash ^ lsbHash;
168 byte[] hash;
171 hash = md.digest(name);
176 long msb = (hash[0] & 0xFFL) << 56;
177 msb |= (hash[1] & 0xFFL) << 48;
178 msb |= (hash[2] & 0xFFL) << 40;
179 msb |= (hash[3] & 0xFFL) << 32;
180 msb |= (hash[4] & 0xFFL) << 24
    [all...]
  /external/oprofile/daemon/
opd_sfile.c 40 /** Hash the transient parameters for lookup. */
57 /* cookie meaningless for kernel, shouldn't hash */
163 create_sfile(unsigned long hash, struct transient const * trans,
171 sf->hashval = hash;
225 unsigned long hash; local
242 /* we might need a kernel image start/end to hash on */
260 hash = sfile_hash(trans, ki);
261 list_for_each(pos, &hashes[hash]) {
262 sf = list_entry(pos, struct sfile, hash);
269 sf = create_sfile(hash, trans, ki)
303 unsigned long hash; local
    [all...]
  /external/wpa_supplicant/
crypto.h 31 * md4_vector - MD4 hash for data vector
35 * @mac: Buffer for the hash
40 * md5_vector - MD5 hash for data vector
44 * @mac: Buffer for the hash
49 * sha1_vector - SHA-1 hash for data vector
53 * @mac: Buffer for the hash
73 * sha256_vector - SHA256 hash for data vector
77 * @mac: Buffer for the hash
143 * crypto_hash_init - Initialize hash/HMAC function
144 * @alg: Hash algorith
    [all...]
  /external/wpa_supplicant_6/wpa_supplicant/src/crypto/
crypto.h 31 * md4_vector - MD4 hash for data vector
35 * @mac: Buffer for the hash
40 * md5_vector - MD5 hash for data vector
44 * @mac: Buffer for the hash
49 * sha1_vector - SHA-1 hash for data vector
53 * @mac: Buffer for the hash
74 * sha256_vector - SHA256 hash for data vector
78 * @mac: Buffer for the hash
144 * crypto_hash_init - Initialize hash/HMAC function
145 * @alg: Hash algorith
    [all...]
  /dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/crypto/
SHA1Impl.java 28 * The methods support the algorithm described in "SECURE HASH STANDARD", FIPS PUB 180-2, <BR>
38 * the "computeHash(int[])" method is invoked on the frame to compute updated hash,
41 * that were not used in computing final hash value yet. <BR>
43 * The "computeHash(..)" method generates a 160 bit hash value using
45 * current hash value stored in five words, beginning HASH_OFFSET, of the array argument.
48 * The resulting hash value replaces the previous hash value in the array;
57 * The method generates a 160 bit hash value using
59 * current hash value stored in five words, beginning OFFSET+1, of the array argument.
62 * The resulting hash value replaces the previous hash value in the array
    [all...]
  /external/srec/portable/include/
phashtable.h 30 * The default initial capacity of a hash table.
41 * Default hash function used for hashing keys. The default function assumes
54 * Abstract hash table operations. The keys of the Map are strings and values
67 * hash table is increased and each entry is put in its new linked list based
80 * key2 and non-zero otherwise. The hash function and the comparison function
82 * return 0, then the values returned by the hash function when given these
93 * Structure specified to specify initialization parameters for the hash
121 * Creates an hash table. The hash table is created with specified capacity
131 * copied internally and it must remain valid for the lifetime of the hash
    [all...]
  /frameworks/base/awt/java/awt/image/
ComponentSampleModel.java 636 * Gets a hash code of this ComponentSampleModel object.
638 * @return a hash code of this ComponentSampleModel object.
642 int hash = 0; local
645 hash = width;
646 tmp = hash >>> 24;
647 hash <<= 8;
648 hash |= tmp;
649 hash ^= height;
650 tmp = hash >>> 24;
651 hash <<= 8
    [all...]

Completed in 89 milliseconds

1 2 3 4 5 67 8 91011>>