| /frameworks/base/awt/java/awt/image/ |
| ColorModel.java | 774 int hash = 0; local
778 hash ^= 1;
779 hash <<= 8;
782 hash ^= 1;
783 hash <<= 8;
786 tmp = hash >>> 24;
787 hash ^= numColorComponents;
788 hash <<= 8;
789 hash |= tmp;
791 tmp = hash >>> 24
[all...] |
| /external/apache-http/src/org/apache/http/auth/ |
| AuthScope.java | 285 int hash = LangUtils.HASH_SEED; local
286 hash = LangUtils.hashCode(hash, this.host);
287 hash = LangUtils.hashCode(hash, this.port);
288 hash = LangUtils.hashCode(hash, this.realm);
289 hash = LangUtils.hashCode(hash, this.scheme);
290 return hash;
[all...] |
| /external/opencore/protocols/http_parcom/src/ |
| string_keyvalue_store.h | 179 // The major feature for this class is hash-table based key search. To handle hash table conllision, linear search
180 // table is used. Basically a whole hash table is divided into two parts, the first part is for real hash table,
260 // To handle hash table collisions, the hash table is divided into two parts, one part is for first hit elements, and
263 // possibilities go high, hash function should be updated to keep this collision possibility low) Another reason is, don't
270 // linear seach in linear search area of hash table for the given key
287 // field key@value tables (field key table is a hash table per se)
303 // relatively big hash table, saving the table indices will save lots of search operations
[all...] |
| /dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1PRNG_SecureRandomImpl.java | 73 // value of 16 defined in the "SECURE HASH STANDARD", FIPS PUB 180-2
79 // HASHCOPY_OFFSET - offset for copy of current hash in "copies" array
81 // as the extra frame follows the current hash frame,
82 // EXTRAFRAME_OFFSET is equal to length of current hash frame
111 // - 0-79 - words for computing hash
114 // - 82-86 - 5 words, current seed hash
121 // - 0-4 - 5 words, copy of current seed hash
133 // variable required according to "SECURE HASH STANDARD"
139 // The "seed" array is used to compute both "current seed hash" and "next bytes".
141 // As the "SHA1" algorithm computes a hash of entire seed by splitting it int
[all...] |
| /dalvik/vm/ |
| UtfString.c | 111 * Compute a hash code on a UTF-8 string, for use with internal hash tables.
115 * I'm initializing the hash code to 1 so they *don't* match up.)
118 * the hash with the result. That way, if something encoded the same
119 * character in two different ways, the hash value would be the same. For
124 u4 hash = 1; local
127 hash = hash * 31 + *utf8Str++;
129 return hash;
232 u4 hash = 0 local
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/src/eap_common/ |
| ikev2_common.c | 62 size_t data_len, u8 *hash)
71 os_memcpy(hash, tmphash, 12);
77 os_memcpy(hash, tmphash, 12);
102 u8 *hash)
106 hmac_sha1_vector(key, key_len, num_elem, addr, len, hash);
109 hmac_md5_vector(key, key_len, num_elem, addr, len, hash);
123 u8 hash[IKEV2_MAX_HASH_LEN]; local
136 addr[0] = hash;
150 &len[1], hash);
153 hash);
445 u8 *sign_data, *pos, *buf, hash[IKEV2_MAX_HASH_LEN]; local
503 u8 hash[IKEV2_MAX_HASH_LEN], *decrypted; local
[all...] |
| /frameworks/base/core/java/com/android/internal/widget/ |
| LockPatternUtils.java | 170 // Compare the hash from the file with the entered pattern's hash
195 // Compare the hash from the file with the entered password's hash
298 // Compute the hash
299 final byte[] hash = LockPatternUtils.patternToHash(pattern);
301 // Write the hash to file
307 raf.write(hash, 0, hash.length);
364 // Compute the hash
[all...] |
| /dalvik/libcore/luni-kernel/src/main/java/org/apache/harmony/lang/annotation/ |
| AnnotationMember.java | 251 * Computes hash code of this element. The formula is as follows:
255 * @return the hash code
260 int hash = name.hashCode() * 127; local
264 return hash ^ Arrays.hashCode((int[])value);
266 return hash ^ Arrays.hashCode((byte[])value);
268 return hash ^ Arrays.hashCode((short[])value);
270 return hash ^ Arrays.hashCode((long[])value);
272 return hash ^ Arrays.hashCode((char[])value);
274 return hash ^ Arrays.hashCode((boolean[])value);
276 return hash ^ Arrays.hashCode((float[])value)
[all...] |
| /external/dropbear/libtomcrypt/src/hashes/ |
| md4.c | 170 Initialize the hash state
171 @param md The hash state you wish to initialize
187 Process a block of memory though the hash
188 @param md The hash state
189 @param in The data to hash
196 Terminate the hash to get the digest
197 @param md The hash state
198 @param out [out] The destination of the hash (16 bytes)
250 Self-test the hash
|
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 27 // TODO: optimize key comparisons using key.hash == entry.key.hash condition
48 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
86 // index into the corresponding hash bucket:
110 // index into the corresponding hash bucket:
129 // index into the corresponding hash bucket:
174 // index into the corresponding hash bucket:
217 // index into the corresponding hash bucket:
303 // index into the corresponding new hash bucket:
|
| /external/libxml2/include/libxml/ |
| xpath.h | 28 #include <libxml/hash.h>
279 * Following the switch to hash tables, this need to be trimmed up at
290 int nb_variables_unused; /* unused (hash table) */
291 int max_variables_unused; /* unused (hash table) */
292 xmlHashTablePtr varHash; /* Hash table of defined variables */
298 int nb_funcs_unused; /* unused (hash table) */
299 int max_funcs_unused; /* unused (hash table) */
300 xmlHashTablePtr funcHash; /* Hash table of defined funcs */
321 xmlHashTablePtr nsHash; /* The namespaces hash table */
|
| /dalvik/libcore/security/src/main/java/java/security/ |
| MessageDigestSpi.java | 27 * digest is a secure one way hash function for a stream of bytes. It acts like
94 * Computes and returns the final hash value for this
98 * @return the computed one way hash value.
104 * Computes and stores the final hash value for this
146 * is ready to compute a one way hash value.
|
| /dalvik/libcore/security/src/main/java/org/apache/harmony/security/ |
| UnresolvedPrincipal.java | 124 * Returns the hash code value for this object.
127 int hash = 0; local
129 hash ^= name.hashCode();
132 hash ^= klass.hashCode();
134 return hash;
|
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMStringPool.java | 47 * maintaining a simple hash chain within this class.</p>
68 * @param chainSize The size of the hash chain vector
128 m_hashChain.addElement(NULL); // Initialize to no-following-same-hash
129 if(hashlast==NULL) // First for this hash
131 else // Link from previous with same hash
|
| /dalvik/libdex/ |
| ZipArchive.h | 33 * One entry in the hash table.
38 //unsigned int hash;
46 * and load a hash table with pointers to the filenames (which aren't
55 * of the string length into the hash table entry.
69 * fixed-size hash table. We probe on collisions.
|
| /dalvik/vm/hprof/ |
| HprofStack.c | 88 u4 hash = 0; local
93 hash = hash * 31 + cp[i];
96 return hash;
123 * Create the hash table on first contact. We can't do this in
|
| /development/tools/findunused/ |
| find_unused_resources.rb | 89 @@globalJavaIdUses = Hash.new
106 javaIdUses = Hash.new
107 layouts = Hash.new
108 strings = Hash.new
109 xmlIdUses = Hash.new
|
| /external/bison/src/ |
| uniqstr.c | 26 #include <hash.h>
32 | A uniqstr hash table. |
35 /* Initial capacity of uniqstr hash table. */
50 /* First insertion in the hash. */
94 | A uniqstr hash table. |
|
| /external/blktrace/ |
| jhash.h | 4 /* jhash.h: Jenkins hash support.
8 * http://burtleburtle.net/bob/hash/
14 * These are functions for producing 32-bit hashes for hash table lookup.
16 * are externally useful functions. Routines to test the hash are included
22 * I've modified Bob's hash to be useful in the Linux kernel, and
|
| /external/bluetooth/glib/gio/ |
| gemblem.c | 260 guint hash; local
262 hash = g_icon_hash (g_emblem_get_icon (emblem));
263 hash ^= emblem->origin;
265 return hash;
356 iface->hash = g_emblem_hash;
|
| /external/guava/src/com/google/common/collect/ |
| RegularImmutableSortedSet.java | 201 // not caching hash code since it could change if the elements are mutable
202 // in a way that modifies their hash codes
203 int hash = 0; local
205 hash += elements[i].hashCode();
207 return hash;
|
| /external/icu4c/i18n/unicode/ |
| currpinf.h | 202 * delete hash table
204 * @param hTable hash table to be deleted
210 * initialize hash table
213 * @return hash table initialized
220 * copy hash table
|
| /external/iproute2/ |
| README.iproute2+tc | 88 # Create hash table of 256 slots with ID 1:
91 # Add to 6th slot of hash table rule to select tcp/telnet to 193.233.7.75
100 # Add to 1th slot of hash table rule to select icmp to 193.233.7.75
109 # Lookup hash table, if it is not fragmented frame
110 # Use protocol as hash key
|
| /frameworks/base/media/libdrm/mobile2/include/util/crypto/ |
| DrmCrypto.h | 64 // Sha1 crypto for hash
69 * compute hash using Sha1
72 * \param outHash the hash of inData
80 * get the length of SHA1 hash
83 * the length of SHA1 hash
|
| /external/ipsec-tools/src/racoon/ |
| isakmp_inf.c | 136 vchar_t *hash, *payload;
184 "message has no hash payload.\n");
229 /* compute HASH */
230 hash = oakley_compute_hash1(iph1, isakmp->msgid, payload);
231 if (hash == NULL) {
233 "cannot compute hash\n");
239 if (ntohs(gen->len) - sizeof(struct isakmp_gen) != hash->l) {
241 "ignore information due to hash length mismatch\n");
243 vfree(hash);
248 if (memcmp(p, hash->v, hash->l) != 0)
135 vchar_t *hash, *payload; local
892 vchar_t *hash = NULL; local
[all...] |
