| /dalvik/libcore/nio/src/main/java/java/nio/ |
| DoubleBuffer.java | 359 * Calculates this buffer's hash code from the remaining chars. The
360 * position, limit, capacity and mark don't affect the hash code.
362 * @return the hash code calculated from the remaining chars.
367 int hash = 0; local
371 hash = hash + ((int) l) ^ ((int) (l >> 32));
373 return hash;
|
| FloatBuffer.java | 359 * Calculates this buffer's hash code from the remaining chars. The
360 * position, limit, capacity and mark don't affect the hash code.
362 * @return the hash code calculated from the remaining floats.
367 int hash = 0; local
369 hash = hash + Float.floatToIntBits(get(myPosition++));
371 return hash;
|
| IntBuffer.java | 346 * Calculates this buffer's hash code from the remaining chars. The
347 * position, limit, capacity and mark don't affect the hash code.
349 * @return the hash code calculated from the remaining ints.
354 int hash = 0; local
356 hash = hash + get(myPosition++);
358 return hash;
|
| LongBuffer.java | 349 * Calculates this buffer's hash code from the remaining chars. The
350 * position, limit, capacity and mark don't affect the hash code.
352 * @return the hash code calculated from the remaining longs.
357 int hash = 0; local
361 hash = hash + ((int) l) ^ ((int) (l >> 32));
363 return hash;
|
| ShortBuffer.java | 348 * Calculates this buffer's hash code from the remaining chars. The
349 * position, limit, capacity and mark don't affect the hash code.
351 * @return the hash code calculated from the remaining shorts.
356 int hash = 0; local
358 hash = hash + get(myPosition++);
360 return hash;
|
| /external/elfutils/ |
| NEWS | 67 strip: fix handling of Alpha and s390x which use incorrect hash bucket sizes.
189 libelf: Handle broken hash table entry sizes.
416 Implement better hash size optimization heuristic in ld. It uses a formula
449 Create dynamic symbol table, dynamic string table, and hash table to ld.
451 Add hash table histogram support to readelf.
499 Fix some potential problems with hash value in dynamic hash implementation.
|
| /external/libxml2/ |
| entities.c | 17 #include <libxml/hash.h>
472 * Do an entity lookup in the DTD entity hash table and
496 * Do an entity lookup in the document entity hash table and
782 * create and initialize an empty entities hash table.
797 * Deallocate the memory used by an entities in the hash table.
810 * Deallocate the memory used by an entities hash table.
1002 * When using the hash table scan function, arguments need to be reversed
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| determinize.h | 265 // if the subset is not found in the subset hash. FindState takes
423 // Hash function for Subset to Fst states. Subset elements are not
424 // sorted in this implementation, so the hash must be invariant
429 size_t hash = 0; local
436 hash ^= element.state_id << lshift ^
438 element.weight.Hash();
440 return hash;
|
| /system/core/sh/ |
| exec.c | 54 * When commands are first encountered, they are entered in a hash table.
59 * would make the command name "hash" a misnomer.
90 struct tblentry *next; /* next entry in hash chain */
437 /* If name contains a slash, don't use PATH or hash table */
643 * At shell startup put special builtins into hash table.
687 * Fix command hash table when PATH changed.
806 * Locate a command in the command hash table. If "add" is nonzero,
|
| /external/ppp/pppd/ |
| chap_ms.c | 37 * The hash text (StdText) was taken from Win95 RASAPI32.DLL.
93 #include "openssl-hash.h"
519 NTPasswordHash(char *secret, int secret_len, u_char hash[MD4_SIGNATURE_SIZE])
536 MD4Final(hash, &md4Context);
547 /* Hash the Unicode version of the secret (== password). */
565 /* Hash the Unicode version of the secret (== password). */
653 /* Hash (x2) the Unicode version of the secret (== password). */
698 /* Hash (x2) the Unicode version of the secret (== password). */
812 /* Hash (x2) the Unicode version of the secret (== password). */
|
| /external/webkit/JavaScriptCore/wtf/ |
| HashTable.h | 279 static unsigned hash(const Key& key) { return HashFunctions::hash(key); } function in class:WTF::IdentityHashTranslator
387 FullLookupType makeLookupResult(ValueType* position, bool found, unsigned hash)
388 { return FullLookupType(LookupType(position, found), hash); }
483 unsigned h = HashTranslator::hash(key);
531 unsigned h = HashTranslator::hash(key);
583 unsigned h = HashTranslator::hash(key);
643 unsigned h = HashTranslator::hash(key);
[all...] |
| /cts/tools/dasm/src/java_cup/ |
| symbol_set.java | 36 /** A hash table to hold the set. Symbols are keyed using their name string.
189 /** Compute a hash code. */
196 /* hash together codes from at most first 5 elements */
|
| /dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1_MessageDigestImpl.java | 175 byte[] hash = new byte[DIGEST_LENGTH];
177 processDigest(hash, 0);
178 return hash;
|
| /dalvik/libcore/security/src/test/java/tests/security/cert/ |
| CertPathTest.java | 68 * Assertion: returns hash of the <code>Certificate</code> instance
94 * Assertion: returns hash of the <code>Certificate</code> instance
113 * Assertion: hash code of equal objects should be the same
|
| /external/bluetooth/glib/gio/inotify/ |
| inotify-path.c | 72 /* This hash holds GLists of ip_watched_dir_t *'s
168 * wd hash and path hash
|
| /external/bluetooth/glib/tests/ |
| hash-test.c | 143 * hash a string into a long int. 31 bit crc (from andrew appel).
168 - crcinit - initialize tables for hash function
185 - hash - Honeyman's nice hashing function
|
| /external/dropbear/ |
| dss.c | 188 /* hash the data */
318 /* hash the data */
326 /* hash the privkey */
|
| /external/dropbear/libtomcrypt/src/prngs/ |
| fortuna.c | 83 /* terminate this hash */
340 /* to emit the state we copy each pool, terminate it then hash it again so
352 /* now hash it */
|
| /external/guava/src/com/google/common/collect/ |
| Multimap.java | 257 * Returns the hash code for this multimap.
259 * <p>The hash code of a multimap is defined as the hash code of the map view,
|
| /external/iproute2/lib/ |
| rt_names.c | 33 rtnl_hash_initialize(char *file, struct rtnl_hash_entry **hash, int size)
65 entry->next = hash[id & (size - 1)];
66 hash[id & (size - 1)] = entry;
|
| /external/iproute2/tc/ |
| f_flow.c | 27 " [hashing mode]: hash keys KEY-LIST ... [ perturb SECS ]\n"
158 } else if (matches(*argv, "hash") == 0) {
291 fprintf(f, "hash ");
|
| /external/opencore/oscl/oscl/osclutil/src/ |
| oscl_string.h | 151 This function performs a hash operation on the string.
154 OSCL_IMPORT_REF virtual int8 hash() const;
256 OSCL_IMPORT_REF virtual int8 hash() const;
|
| /external/openssl/apps/ |
| openssl-vms.cnf | 190 subjectKeyIdentifier=hash
225 subjectKeyIdentifier=hash
292 subjectKeyIdentifier=hash
|
| openssl.cnf | 190 subjectKeyIdentifier=hash
225 subjectKeyIdentifier=hash
292 subjectKeyIdentifier=hash
|
| /external/openssl/crypto/ocsp/ |
| ocsp_vfy.c | 195 /* Lookup by key hash */
197 /* If key hash isn't SHA1 length then forget it */
200 /* Calculate hash of each key and compare */
|
