| /external/doclava/res/assets/templates/assets/ |
| jquery-history.js | 15 return msie.getDoc().location.hash;
17 setHash: function(hash) {
21 d.location.hash = hash;
26 var hash = msie.iframe ? msie.getHash() : location.hash;
27 if (hash != currentHash) {
28 currentHash = hash;
30 location.hash = currentHash;
39 add: function(hash) {
[all...] |
| /external/chromium/android/ext/ |
| fake_hash.h | 11 template <class _Key> struct hash { }; struct in namespace:__gnu_cxx
15 struct hash<_type> { \
17 return std::hash<_type>(val); \
|
| /libcore/luni/src/main/files/ |
| README.cacerts | 1 The filenames in the cacerts directory are in the format of <hash>.<n>
2 where "hash" is the subject hash produced by:
|
| /system/core/include/utils/ |
| JenkinsHash.h | 17 /* Implementation of Jenkins one-at-a-time hash function. These choices are
29 /* The Jenkins hash of a sequence of 32 bit words A, B, C is:
32 inline uint32_t JenkinsHashMix(uint32_t hash, uint32_t data) {
33 hash += data;
34 hash += (hash << 10);
35 hash ^= (hash >> 6);
36 return hash;
39 hash_t JenkinsHashWhiten(uint32_t hash);
[all...] |
| /external/chromium_org/chrome/common/ |
| spellcheck_marker.h | 23 SpellCheckMarker() : hash(-1), offset(-1) {}
25 SpellCheckMarker(uint32 hash, size_t offset) : hash(hash), offset(offset) {}
27 uint32 hash; member in class:SpellCheckMarker
|
| /external/wpa_supplicant_8/src/eap_common/ |
| eap_psk_common.c | 37 u8 hash[aes_block_size]; local
41 if (aes_128_encrypt_block(kdk, rand_p, hash))
44 hash[aes_block_size - 1] ^= counter;
45 if (aes_128_encrypt_block(kdk, hash, tek))
47 hash[aes_block_size - 1] ^= counter;
51 hash[aes_block_size - 1] ^= counter;
52 if (aes_128_encrypt_block(kdk, hash, &msk[i * aes_block_size]))
54 hash[aes_block_size - 1] ^= counter;
59 hash[aes_block_size - 1] ^= counter;
60 if (aes_128_encrypt_block(kdk, hash,
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| HashCodes.java | 15 package com.google.common.hash;
29 static HashCode fromInt(int hash) {
30 return new IntHashCode(hash);
34 final int hash; field in class:HashCodes.IntHashCode
36 IntHashCode(int hash) {
37 this.hash = hash;
46 (byte) hash,
47 (byte) (hash >> 8),
48 (byte) (hash >> 16)
70 final long hash; field in class:HashCodes.LongHashCode
[all...] |
| /external/dropbear/libtomcrypt/src/hashes/helper/ |
| hash_memory.c | 15 Hash memory helper, Tom St Denis
19 Hash a block of memory and store the digest.
20 @param hash The index of the hash you wish to use
21 @param in The data you wish to hash
22 @param inlen The length of the data to hash (octets)
27 int hash_memory(int hash, const unsigned char *in, unsigned long inlen, unsigned char *out, unsigned long *outlen)
36 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
40 if (*outlen < hash_descriptor[hash].hashsize) {
41 *outlen = hash_descriptor[hash].hashsize
[all...] |
| hash_filehandle.c | 15 Hash open files, Tom St Denis
19 Hash data from an open file handle.
20 @param hash The index of the hash you want to use
21 @param in The FILE* handle of the file you want to hash
26 int hash_filehandle(int hash, FILE *in, unsigned char *out, unsigned long *outlen)
40 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
44 if (*outlen < hash_descriptor[hash].hashsize) {
45 *outlen = hash_descriptor[hash].hashsize;
48 if ((err = hash_descriptor[hash].init(&md)) != CRYPT_OK)
[all...] |
| hash_memory_multi.c | 15 Hash (multiple buffers) memory helper, Tom St Denis
19 Hash multiple (non-adjacent) blocks of memory at once.
20 @param hash The index of the hash you wish to use
23 @param in The data you wish to hash
24 @param inlen The length of the data to hash (octets)
25 @param ... tuples of (data,len) pairs to hash, terminated with a (NULL,x) (x=don't care)
28 int hash_memory_multi(int hash, unsigned char *out, unsigned long *outlen,
41 if ((err = hash_is_valid(hash)) != CRYPT_OK) {
45 if (*outlen < hash_descriptor[hash].hashsize)
[all...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| hash.h | 12 ** This is the header file for the generic hash-table implemenation
19 typedef struct Hash Hash;
22 /* A complete hash table is an instance of the following structure.
30 ** All elements of the hash table are on a single doubly-linked list.
31 ** Hash.first points to the head of this list.
33 ** There are Hash.htsize buckets. Each bucket points to a spot in
37 ** Hash.htsize and Hash.ht may be zero. In that case lookup is done
39 ** Hash.ht table is never allocated because if there are few element
[all...] |
| /cts/tests/assets/webkit/ |
| test_anchor.html | 7 document.title = self.document.location.hash.substring(1);
|
| /external/chromium_org/tools/valgrind/gtest_exclude/ |
| media_unittests.gtest-tsan_win32.txt | 1 # Win TSan disturbs ffmpeg's output, causing hash comparison assertion to fail.
|
| /external/oprofile/daemon/liblegacy/ |
| opd_mapping.c | 27 /* hash map device mmap */
48 perror("oprofiled: couldn't mmap hash map");
96 * get_from_pool - retrieve string from hash map pool
106 * opg_get_hash_name - find a mapping name from a hash
107 * @param hash hash value for this name
109 static char const * opd_get_hash_name(int hash)
113 int orighash = hash;
115 if (hash_name[hash])
116 return hash_name[hash];
143 int hash; local
[all...] |
| /external/chromium_org/crypto/third_party/nss/ |
| rsawrapr.c | 26 const SECHashObject *hash; local
30 hash = HASH_GetHashObject(hashAlg);
31 if (hash == NULL)
34 hashContext = (*hash->create)();
35 rounds = (maskLen + hash->length - 1) / hash->length;
44 (*hash->begin)(hashContext);
45 (*hash->update)(hashContext, mgfSeed, mgfSeedLen);
46 (*hash->update)(hashContext, C, sizeof C);
48 tempHash = mask + counter * hash->length
78 const SECHashObject *hash; local
[all...] |
| /external/dropbear/libtomcrypt/src/mac/hmac/ |
| hmac_done.c | 20 #define HMAC_BLOCKSIZE hash_descriptor[hash].blocksize
33 int hash, err; local
38 /* test hash */
39 hash = hmac->hash;
40 if((err = hash_is_valid(hash)) != CRYPT_OK) {
44 /* get the hash message digest size */
45 hashsize = hash_descriptor[hash].hashsize;
60 /* Get the hash of the first HMAC vector plus the data */
61 if ((err = hash_descriptor[hash].done(&hmac->md, isha)) != CRYPT_OK)
[all...] |
| /external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/dh/ |
| DhGroupExchange.java | 95 HashForSSH2Types hash = new HashForSSH2Types("SHA1"); local
97 hash.updateByteString(clientversion);
98 hash.updateByteString(serverversion);
99 hash.updateByteString(clientKexPayload);
100 hash.updateByteString(serverKexPayload);
101 hash.updateByteString(hostKey);
103 hash.updateUINT32(para.getMin_group_len());
104 hash.updateUINT32(para.getPref_group_len());
106 hash.updateUINT32(para.getMax_group_len());
107 hash.updateBigInt(p)
[all...] |
| /external/smack/src/org/jivesoftware/smackx/entitycaps/packet/ |
| CapsExtension.java | 25 private String node, ver, hash; field in class:CapsExtension
30 public CapsExtension(String node, String version, String hash) {
33 this.hash = hash;
61 return hash;
64 public void setHash(String hash) {
65 this.hash = hash;
70 * hash='sha-1'
77 "hash=\"" + hash + "\" "
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| uhash.c | 19 /* This hashtable is implemented as a double hash. All elements are
21 * resolution (no linked list, etc.). When there is a hash collision
23 * using a secondary hash. The secondary hash is an increment
24 * computed as a hash function (a different one) of the primary
25 * hashcode. This increment is added to the initial hash value to
26 * obtain further slots assigned to the same hash code. For this to
119 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \
120 if (hash->keyDeleter != NULL && keypointer != NULL) { \
121 (*hash->keyDeleter)(keypointer);
[all...] |
| /external/chromium_org/content/public/android/java/src/org/chromium/content/browser/input/ |
| DateTimeSuggestion.java | 53 int hash = 31; local
54 hash = 37 * hash + (int) mValue;
55 hash = 37 * hash + mLocalizedValue.hashCode();
56 hash = 37 * hash + mLabel.hashCode();
57 return hash;
|
| /external/dropbear/libtomcrypt/src/misc/crypt/ |
| crypt_register_hash.c | 15 Register a HASH, Tom St Denis
19 Register a hash with the descriptor table
20 @param hash The hash you wish to register
23 int register_hash(const struct ltc_hash_descriptor *hash)
27 LTC_ARGCHK(hash != NULL);
32 if (XMEMCMP(&hash_descriptor[x], hash, sizeof(struct ltc_hash_descriptor)) == 0) {
41 XMEMCPY(&hash_descriptor[x], hash, sizeof(struct ltc_hash_descriptor));
|
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| 2008-09-07-CGUpdate.ll | 3 define internal fastcc i32 @hash(i32* %ts, i32 %mod) nounwind {
10 %0 = call fastcc i32 @hash( i32* %ts, i32 0 ) nounwind ; <i32> [#uses=0]
|
| /external/icu4c/common/ |
| uhash.c | 20 /* This hashtable is implemented as a double hash. All elements are
22 * resolution (no linked list, etc.). When there is a hash collision
24 * using a secondary hash. The secondary hash is an increment
25 * computed as a hash function (a different one) of the primary
26 * hashcode. This increment is added to the initial hash value to
27 * obtain further slots assigned to the same hash code. For this to
120 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \
121 if (hash->keyDeleter != NULL && keypointer != NULL) { \
122 (*hash->keyDeleter)(keypointer);
[all...] |
| /frameworks/base/sax/java/android/sax/ |
| Children.java | 31 int hash = uri.hashCode() * 31 + localName.hashCode(); local
32 int index = hash & 15;
37 current = new Child(parent, uri, localName, parent.depth + 1, hash);
44 if (current.hash == hash
56 current = new Child(parent, uri, localName, parent.depth + 1, hash);
66 int hash = uri.hashCode() * 31 + localName.hashCode(); local
67 int index = hash & 15;
74 if (current.hash == hash
88 final int hash; field in class:Children.Child
[all...] |
| /external/chromium_org/components/policy/core/common/cloud/ |
| cloud_external_data_manager.cc | 16 const std::string& hash)
18 hash(hash) {
23 return url != other.url || hash != other.hash;
|
