| /frameworks/base/docs/html/ |
| search.jd | 71 // save the tab index from the hash
72 tabIndex = location.hash.split("&t=")[1];
83 if (location.hash.indexOf("&t=") != -1) {
84 searchControl.execute(decodeURI(getQuery(location.hash)));
96 $(window).history(function(e, hash) {
97 var query = decodeURI(getQuery(hash));
110 tabIndex = location.hash.split("&t=")[1];
124 $.history.add('q=' + getQuery(location.hash) + '&t=' + tabIndex); // update the hash with the new tab
129 function getQuery(hash) {
[all...] |
| /sdk/emulator/qtools/ |
| hash_table.h | 81 // Professor Daniel J. Bernstein's hash function. See
86 uint32_t hash = 5381; local
90 hash = ((hash << 5) + hash) + *key;
92 return hash;
98 // Hash the key to get the table position
110 // Create a new hash entry and fill in the values
127 // Hash the key to get the table position
152 // Hash the key to get the table positio
[all...] |
| /external/dropbear/libtomcrypt/src/pk/dsa/ |
| dsa_decrypt_key.c | 36 int hash, err; local
49 /* decode to find out hash */
56 hash = find_hash_oid(hashOID, decode[0].size);
57 if (hash_is_valid(hash) != CRYPT_OK) {
61 /* we now have the hash! */
96 if ((err = hash_memory(hash, expt, x, expt, &y)) != CRYPT_OK) {
100 /* ensure the hash of the shared secret is at least as big as the encrypt itself */
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| ecc_decrypt_key.c | 41 int hash, err; local
55 /* decode to find out hash */
62 hash = find_hash_oid(hashOID, decode[0].size);
63 if (hash_is_valid(hash) != CRYPT_OK) {
67 /* we now have the hash! */
107 if ((err = hash_memory(hash, ecc_shared, x, ecc_shared, &y)) != CRYPT_OK) {
111 /* ensure the hash of the shared secret is at least as big as the encrypt itself */
|
| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| rsa_sign_hash.c | 15 RSA PKCS #1 v1.5 and v2 PSS sign hash, Tom St Denis and Andreas Lange
22 @param in The hash to sign
23 @param inlen The length of the hash to sign (octets)
29 @param hash_idx The index of the hash desired
55 /* valid prng and hash ? */
82 /* PKCS #1 v1.5 pad the hash */
96 hash OCTET STRING
|
| /external/libxml2/ |
| hash.c | 2 * hash.c: chained hash tables
25 #include <libxml/hash.h>
35 * A single entry in the hash table
49 * The entire hash table
60 * Calculate the hash key
138 * @size: the size of the hash table
168 * @size: the size of the hash table
169 * @dict: a dictionary to use for the hash
189 * @table: the hash tabl
[all...] |
| /external/ipsec-tools/src/racoon/ |
| isakmp_quick.c | 146 * HDR*, HASH(1), SA, Ni [, KE ] [, IDi2, IDr2 ]
154 vchar_t *hash = NULL;
277 /* generate HASH(1) */
278 hash = oakley_compute_hash1(iph2->ph1, iph2->msgid, body);
279 if (hash == NULL)
283 iph2->sendbuf = quick_ir1mx(iph2, body, hash);
300 if (hash != NULL)
301 vfree(hash);
308 * HDR*, HASH(2), SA, Nr [, KE ] [, IDi2, IDr2 ]
316 vchar_t *hbuf = NULL; /* for hash computing. *
153 vchar_t *hash = NULL; local
319 struct isakmp_pl_hash *hash = NULL; local
558 vchar_t *hash = NULL; local
698 struct isakmp_pl_hash *hash = NULL; local
843 struct isakmp_pl_hash *hash = NULL; local
1187 vchar_t *hash = NULL; local
1390 struct isakmp_pl_hash *hash = NULL; local
[all...] |
| /packages/apps/VoiceDialer/src/com/android/voicedialer/ |
| VoiceContact.java | 79 int hash = 0; local
80 hash = LARGE_PRIME * (hash + (int)mContactId);
81 hash = LARGE_PRIME * (hash + (int)mPrimaryId);
82 hash = LARGE_PRIME * (hash + (int)mHomeId);
83 hash = LARGE_PRIME * (hash + (int)mMobileId);
84 hash = LARGE_PRIME * (hash + (int)mWorkId)
[all...] |
| /external/icu4c/tools/genpname/ |
| preparse.pl | 76 # This hash governs how top level properties are grouped into output arrays.
156 print "Merged hash:\n";
200 # @param ref to hash with the data
260 # while printing, create a mapping hash from string table entry to index
418 # and combine them into one hash.
423 # @return hash ref, Unicode version
438 # Extract property family hash
451 # Dump out the $va hash for debugging
453 print "Property values hash:\n";
462 # Dump out the $s hash for debuggin
[all...] |
| /external/openssl/crypto/ecdsa/ |
| ecdsa.h | 116 * computes the ECDSA signature of the given hash value using
118 * \param dgst pointer to the hash value
119 * \param dgst_len length of the hash value
126 * computes ECDSA signature of a given hash value using the supplied
128 * \param dgst pointer to the hash value to sign
129 * \param dgstlen length of the hash value
141 * signature of the supplied hash value using the supplied public key.
142 * \param dgst pointer to the hash value
143 * \param dgst_len length of the hash value
192 * computes ECDSA signature of a given hash value using the supplie
[all...] |
| /external/openssl/include/openssl/ |
| ecdsa.h | 116 * computes the ECDSA signature of the given hash value using
118 * \param dgst pointer to the hash value
119 * \param dgst_len length of the hash value
126 * computes ECDSA signature of a given hash value using the supplied
128 * \param dgst pointer to the hash value to sign
129 * \param dgstlen length of the hash value
141 * signature of the supplied hash value using the supplied public key.
142 * \param dgst pointer to the hash value
143 * \param dgst_len length of the hash value
192 * computes ECDSA signature of a given hash value using the supplie
[all...] |
| /dalvik/libcore/annotation/src/main/java/java/lang/annotation/ |
| Annotation.java | 67 * The hash code for all other member values is determined by simply
81 * Returns the hash code of this annotation. The hash code is determined
86 * The hash code of an annotation is the sum of the hash codes of
90 * The hash code of an annotation member is calculated as {@code
95 * The hash code for a primitive member value is determined using
101 * The hash code for an array member value {@code v} is determined
106 * The hash code for all other member values is determined by simply
111 * @return the hash code
[all...] |
| /external/kernel-headers/original/linux/sunrpc/ |
| svcauth.h | 17 #include <linux/hash.h>
49 struct hlist_node hash; member in struct:auth_domain
132 unsigned long hash = 0; local
143 hash = hash_long(hash^l, BITS_PER_LONG);
145 return hash >> (BITS_PER_LONG - bits);
150 unsigned long hash = 0; local
162 hash = hash_long(hash^l, BITS_PER_LONG);
164 return hash >> (BITS_PER_LONG - bits)
[all...] |
| /frameworks/base/core/java/android/net/http/ |
| CertificateValidatorCache.java | 36 * hash of the certificate chain successfully used to validate the domain. If
71 * secure hash from
72 * @return The secure hash computed from server certificates
131 * @param secureHash The secure hash to check against
133 * associated with the domain and the secure hash
163 * @param secureHash The secure hash to be added to the cache
186 * The hash associated with this cache entry
207 * @param secureHash The secure hash to be associated with this cache
228 * @param secureHash The secure hash to check
229 * @return True iff the given domain and hash match those associate
[all...] |
| /frameworks/base/include/utils/ |
| ZipFileRO.h | 47 * and load a hash table with pointers to the filenames (which aren't
56 * of the string length into the hash table entry.
95 * that further by returning the Nth non-empty entry in the hash table
185 /* add a new entry to the hash table */
186 void addToHash(const char* str, int strLen, unsigned int hash);
188 /* compute string hash code */
191 /* convert a ZipEntryRO back to a hash table index */
195 * One entry in the hash table.
200 //unsigned int hash;
214 * fixed-size hash table. We probe for an empty slot
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/scene/ |
| ViewNode.java | 160 int hash = 5; local
161 hash = 67 * hash + (this.name != null ? this.name.hashCode() : 0);
162 return hash;
192 int hash = 5; local
193 hash = 61 * hash + (this.name != null ? this.name.hashCode() : 0);
194 hash = 61 * hash + (this.value != null ? this.value.hashCode() : 0);
195 return hash;
[all...] |
| /external/v8/src/ |
| hashmap.cc | 60 HashMap::Entry* HashMap::Lookup(void* key, uint32_t hash, bool insert) {
62 Entry* p = Probe(key, hash);
71 p->hash = hash;
77 p = Probe(key, hash);
88 void HashMap::Remove(void* key, uint32_t hash) {
90 Entry* p = Probe(key, hash);
129 Entry* r = map_ + (q->hash & (capacity_ - 1));
174 HashMap::Entry* HashMap::Probe(void* key, uint32_t hash) {
178 Entry* p = map_ + (hash & (capacity_ - 1))
[all...] |
| /external/openssl/crypto/lhash/ |
| lhash.c | 59 /* Code for dynamic hash table routines
126 ret->hash=((h == NULL)?(LHASH_HASH_FN_TYPE)lh_strhash:h);
181 unsigned long hash; local
189 rn=getrn(lh,data,&hash);
201 nn->hash=hash;
219 unsigned long hash; local
224 rn=getrn(lh,data,&hash);
250 unsigned long hash; local
255 rn=getrn(lh,data,&hash);
309 unsigned long hash,nni; local
407 unsigned long hash,nn; local
[all...] |
| /dalvik/libcore/math/src/test/java/org/apache/harmony/math/tests/java/math/ |
| BigIntegerHashCodeTest.java | 39 * Test hash codes for the same object
59 assertTrue("hash codes for the same object differ", code1 == code2);
63 * Test hash codes for equal objects.
79 assertTrue("hash codes for equal objects are unequal", code1 == code2);
84 * Test hash codes for unequal objects.
101 assertTrue("hash codes for unequal objects are equal", code1 != code2);
|
| /dalvik/vm/ |
| Intern.c | 69 u4 hash; local
72 hash = dvmComputeStringHash(strObj);
87 hash, strObj, hashcmpImmortalStrings, true);
92 * There's no way to get a pointer to the actual hash table entry,
96 dvmHashTableRemove(gDvm.internedStrings, hash, found);
99 hash, found, hashcmpImmortalStrings, true);
|
| /external/apache-http/src/org/apache/http/auth/ |
| NTUserPrincipal.java | 88 int hash = LangUtils.HASH_SEED; local
89 hash = LangUtils.hashCode(hash, this.username);
90 hash = LangUtils.hashCode(hash, this.domain);
91 return hash;
|
| /external/skia/src/gl/ |
| SkTextureCache.h | 71 uint32_t hash = fGenID ^ fOffset ^ fWH; local
72 fHash = hash;
73 hash ^= hash >> 16;
74 fHashIndex = hash & SkTextureCache::HashMask();
157 // returns index or <0 if not found. Does NOT update hash
|
| /external/apache-http/src/org/apache/http/conn/scheme/ |
| Scheme.java | 209 * Obtains a hash code for this scheme.
211 * @return the hash code
215 int hash = LangUtils.HASH_SEED; local
216 hash = LangUtils.hashCode(hash, this.defaultPort);
217 hash = LangUtils.hashCode(hash, this.name);
218 hash = LangUtils.hashCode(hash, this.layered);
219 hash = LangUtils.hashCode(hash, this.socketFactory)
[all...] |
| /external/dropbear/libtomcrypt/src/hashes/ |
| md2.c | 15 MD2 (RFC 1319) hash function implementation by Tom St Denis
97 Initialize the hash state
98 @param md The hash state you wish to initialize
114 Process a block of memory though the hash
115 @param md The hash state
116 @param in The data to hash
146 Terminate the hash to get the digest
147 @param md The hash state
148 @param out [out] The destination of the hash (16 bytes)
169 /* hash and update *
[all...] |
| /external/elfcopy/ |
| hash.c | 4 #include <hash.h>
33 INFO("Adding [%s] to hash at bucket [%ld] (first add)\n",
38 INFO("Collision on adding [%s] to hash at bucket [%ld]\n",
|
