Searched refs:hash (Results 201 - 225 of 1823) sorted by relevance

1234567891011>>

/external/chromium_org/net/http/
H A Ddes.cc92 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) { argument
100 reinterpret_cast<DES_cblock*>(hash), &ks, DES_ENCRYPT);
105 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) { argument
139 rv = PK11_CipherOp(ctxt, hash, reinterpret_cast<int*>(&n), 8,
145 rv = PK11_DigestFinal(ctxt, hash+8, &n, 0);
162 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) { argument
166 key, 8, NULL, src, 8, hash, 8, &data_out_moved);
173 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) { argument
210 CopyMemory(hash, src, 8);
214 CryptEncrypt(key, 0, FALSE, 0, hash,
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Dext_attr.c32 * Compute the hash of an extended attribute.
36 __u32 hash = 0; local
41 hash = (hash << NAME_HASH_SHIFT) ^
42 (hash >> (8*sizeof(hash) - NAME_HASH_SHIFT)) ^
46 /* The hash needs to be calculated on the data in little-endian. */
51 hash = (hash << VALUE_HASH_SHIFT) ^
52 (hash >> (
[all...]
/external/fio/
H A Dhash.h35 unsigned long hash = val; local
39 unsigned long n = hash;
41 hash -= n;
43 hash -= n;
45 hash += n;
47 hash -= n;
49 hash += n;
51 hash += n;
54 hash *= GOLDEN_RATIO_PRIME;
57 return hash;
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DMapMakerInternalMapTest.java394 int hash = map.hash(one);
395 ReferenceEntry<Object, Object> entry = segment.getEntry(one, hash);
441 int hashOne = map.hash(keyOne);
454 int hashTwo = map.hash(keyTwo);
473 int hashOne = map.hash(keyOne);
479 int hashTwo = map.hash(keyTwo);
523 int hash = map.hash(key);
526 int index = hash
1206 assertNotificationEnqueued( MapMakerInternalMap<K, V> map, K key, V value, int hash) argument
1720 createDummyEntry( K key, int hash, V value, ReferenceEntry<K, V> next) argument
1730 private final int hash; field in class:MapMakerInternalMapTest.DummyEntry
1733 DummyEntry(K key, int hash, ReferenceEntry<K, V> next) argument
1739 create(K key, int hash, ReferenceEntry<K, V> next) argument
[all...]
/external/iproute2/tc/
H A Df_tcindex.c20 fprintf(stderr," Usage: ... tcindex [ hash SIZE ] [ mask MASK ]"
45 if (!strcmp(*argv,"hash")) {
46 int hash; local
49 hash = strtoul(*argv,&end,0);
50 if (*end || !hash || hash > 0x10000) {
54 addattr_l(n,4096,TCA_TCINDEX_HASH,&hash,sizeof(hash));
133 __u16 hash; local
135 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash))
[all...]
/external/chromium_org/chrome/browser/resources/options/
H A Dwebsite_settings.js89 * resource auditing for the location's hash.
92 var hash = this.hash;
93 if (hash)
94 hash = hash.slice(1);
96 hash = 'geolocation';
97 this.updatePage_(hash);
262 WebsiteSettingsManager.showWebsiteSettings = function(hash) {
263 PageManager.showPageByName('websiteSettings', true, {hash
[all...]
/external/chromium_org/chrome/browser/spellchecker/
H A Dfeedback_sender.h8 // Assigns uint32 hash identifiers to spelling suggestions from spelling service
51 // sender.SelectedSuggestion(hash, suggestion_index);
63 // misspelling identified by |hash|.
64 void SelectedSuggestion(uint32 hash, int suggestion_index);
66 // Records that user added the misspelling identified by |hash| to the
68 void AddedToDictionary(uint32 hash);
70 // Records that user right-clicked on the misspelling identified by |hash|,
72 void IgnoredSuggestions(uint32 hash);
75 // misspelling identified by |hash| to string |correction|, which is not in
77 void ManuallyCorrected(uint32 hash, cons
[all...]
/external/chromium_org/chrome/browser/sync/glue/
H A Dextension_backed_data_type_controller.cc23 // Helper method to generate a hash from an extension id.
25 std::string hash = base::SHA1HashString(extension_id); local
26 hash = base::HexEncode(hash.c_str(), hash.length());
27 return hash;
93 // TODO(synced notifications): rather than rely on a hash of the extension
/external/chromium_org/chromeos/login/auth/
H A Dkey.cc81 char hash[crypto::kSHA256Length]; local
82 crypto::SHA256HashString(salt + secret_, &hash, sizeof(hash));
84 // Keep only the first half of the hash for 'weak' hashing so that the
88 reinterpret_cast<const void*>(hash), sizeof(hash) / 2));
/external/chromium_org/components/crx_file/
H A Did_util.cc39 uint8 hash[kIdSize]; local
40 crypto::SHA256HashString(input, hash, sizeof(hash));
42 base::StringToLowerASCII(base::HexEncode(hash, sizeof(hash)));
/external/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/
H A Dassign_move.pass.cpp12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
33 test_hash<std::hash<int> >,
49 test_hash<std::hash<int> >(8),
55 test_hash<std::hash<int> >(2),
74 assert(c.hash_function() == test_hash<std::hash<int> >(8));
86 test_hash<std::hash<int> >,
102 test_hash<std::hash<int> >(8),
108 test_hash<std::hash<int> >(2),
119 assert(c.hash_function() == test_hash<std::hash<int> >(8));
131 test_hash<std::hash<in
[all...]
/external/chromium_org/third_party/freetype/src/cache/
H A Dftccache.h62 FT_PtrDist hash; /* used for hashing too */ member in struct:FTC_NodeRec_
76 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
78 ( ( ( ( hash ) & ( cache )->mask ) < ( cache )->p ) \
79 ? ( ( hash ) & ( ( cache )->mask * 2 + 1 ) ) \
80 : ( ( hash ) & ( cache )->mask ) ) )
84 FT_PtrDist hash );
85 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
86 ftc_get_top_node_for_hash( ( cache ), ( hash ) )
142 /* each cache really implements a dynamic hash table to manage its nodes */
182 FT_PtrDist hash,
[all...]
/external/deqp/framework/delibs/depool/
H A DdePoolHashSet.h23 * \brief Memory pool hash-set class.
37 * \brief Declare a template pool hash-set (hash of sets) class interface.
38 * \param TYPENAME Type name of the declared hash-set.
44 * The functions for operating the hash are:
63 TYPENAME##Hash* hash; \
79 if ((hashSet->hash = TYPENAME##Hash_create(pool)) == DE_NULL) \
86 return TYPENAME##Hash_getNumElements(hashSet->hash); \
91 return hashSet->hash; \
96 TYPENAME##Set** setPtr = TYPENAME##Hash_find(hashSet->hash, ke
[all...]
/external/freetype/src/cache/
H A Dftccache.h62 FT_PtrDist hash; /* used for hashing too */ member in struct:FTC_NodeRec_
76 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
78 ( ( ( ( hash ) & ( cache )->mask ) < ( cache )->p ) \
79 ? ( ( hash ) & ( ( cache )->mask * 2 + 1 ) ) \
80 : ( ( hash ) & ( cache )->mask ) ) )
84 FT_PtrDist hash );
85 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
86 ftc_get_top_node_for_hash( ( cache ), ( hash ) )
142 /* each cache really implements a dynamic hash table to manage its nodes */
182 FT_PtrDist hash,
[all...]
/external/chromium_org/third_party/mesa/src/src/glx/
H A Dglxhash.c1 /* glxhash.c -- Small hash table support for integer -> integer mapping
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
42 * 2) The hash computation uses a table of random integers [Hanson97,
50 * dynamic hash tables was postponed until the need arises. A common (and
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
129 unsigned long hash = 0; local
145 hash = (hash << 1) + scatter[tmp & 0xff];
149 hash
203 unsigned long hash = HashHash(key); local
251 unsigned long hash; local
276 unsigned long hash; local
[all...]
/external/mesa3d/src/glx/
H A Dglxhash.c1 /* glxhash.c -- Small hash table support for integer -> integer mapping
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
42 * 2) The hash computation uses a table of random integers [Hanson97,
50 * dynamic hash tables was postponed until the need arises. A common (and
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
129 unsigned long hash = 0; local
145 hash = (hash << 1) + scatter[tmp & 0xff];
149 hash
203 unsigned long hash = HashHash(key); local
251 unsigned long hash; local
276 unsigned long hash; local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/css/
H A DSelectorFilter.cpp111 static inline void collectDescendantSelectorIdentifierHashes(const CSSSelector& selector, unsigned*& hash) argument
116 (*hash++) = selector.value().impl()->existingHash() * IdAttributeSalt;
120 (*hash++) = selector.value().impl()->existingHash() * ClassAttributeSalt;
124 (*hash++) = selector.tagQName().localName().impl()->existingHash() * TagNameSalt;
133 unsigned* hash = identifierHashes; local
145 collectDescendantSelectorIdentifierHashes(*current, hash);
162 collectDescendantSelectorIdentifierHashes(*current, hash);
165 if (hash == end)
170 *hash = 0;
/external/libcxx/test/containers/unord/unord.set/unord.set.cnstr/
H A Dcopy.pass.cpp12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<int> >,
47 test_hash<std::hash<int> >(8),
58 assert(c.hash_function() == test_hash<std::hash<int> >(8));
70 test_hash<std::hash<int> >,
86 test_hash<std::hash<int> >(8),
97 assert(c.hash_function() == test_hash<std::hash<int> >(8));
110 test_hash<std::hash<int> >,
126 test_hash<std::hash<int> >(8),
137 assert(c.hash_function() == test_hash<std::hash<in
[all...]
/external/apache-harmony/x-net/src/test/impl/java.injected/org/apache/harmony/xnet/provider/jsse/
H A DServerKeyExchangeTest.java36 byte[] hash = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5,
39 null, hash);
43 assertTrue("incorrect ServerKeyExchange", Arrays.equals(message.hash,
44 hash));
60 assertTrue("incorrect message decoding", Arrays.equals(message.hash,
61 message_2.hash));
90 byte[] hash = new byte[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5,
93 hash);
97 assertTrue("incorrect ServerKeyExchange", Arrays.equals(message.hash,
98 hash));
[all...]
/external/chromium-trace/trace-viewer/src/tracing/
H A Dcolor_scheme.js92 * @param {string} name The string to hash.
95 var hash = 0;
97 hash = (hash + 37 * hash + 11 * name.charCodeAt(i)) % 0xFFFFFFFF;
98 return hash;
135 // Previously computed string color IDs. They are based on a stable hash, so
146 var hash = getStringHash(string);
147 stringColorIdCache[string] = hash % numRegularColorIds;
/external/chromium_org/third_party/boringssl/src/crypto/lhash/
H A Dlhash.c67 * average chain length exceeds this value, the hash table will be resized. */
71 _LHASH *lh_new(lhash_hash_func hash, lhash_cmp_func comp) { argument
92 ret->hash = hash;
93 if (ret->hash == NULL) {
94 ret->hash = (lhash_hash_func) lh_strhash;
127 * is not NULL, then it also puts the hash value of |data| in |*out_hash|. */
130 const uint32_t hash = lh->hash(data); local
134 *out_hash = hash;
224 uint32_t hash; local
[all...]
/external/chromium_org/third_party/skia/third_party/lua/src/
H A Dlstring.c23 ** compute its hash
70 luaM_reallocvector(L, tb->hash, tb->size, newsize, GCObject *);
71 for (i = tb->size; i < newsize; i++) tb->hash[i] = NULL;
75 GCObject *p = tb->hash[i];
76 tb->hash[i] = NULL;
79 unsigned int h = lmod(gco2ts(p)->hash, newsize); /* new position */
80 gch(p)->next = tb->hash[h]; /* chain it */
81 tb->hash[h] = p;
88 lua_assert(tb->hash[newsize] == NULL && tb->hash[t
[all...]
/external/chromium_org/third_party/smhasher/src/
H A DKeysetTest.cpp10 // This should hopefully be a thorough and uambiguous test of whether a hash
13 bool VerificationTest ( pfHash hash, const int hashbits, uint32_t expected, bool verbose ) argument
32 hash(key,i,256-i,&hashes[i*hashbytes]);
35 // Then hash the result array
37 hash(hashes,hashbytes*256,0,final);
39 // The first four bytes of that hash, interpreted as a little-endian integer, is our
65 // A hash function should not be reading outside the bounds of the key.
68 // result in a different hash.
72 // The memory alignment of the key should not affect the hash result.
74 bool SanityTest ( pfHash hash, cons argument
162 AppendedZeroesTest( pfHash hash, const int hashbits ) argument
276 const hashtype & hash = (*it).first; local
[all...]
/external/ipsec-tools/src/racoon/
H A Dvendorid.c132 lookup_vendor_id_by_hash (const char *hash) argument
135 unsigned char *h = (unsigned char *)hash;
138 if (strncmp(all_vendor_ids[i].hash->v, hash,
139 all_vendor_ids[i].hash->l) == 0)
154 all_vendor_ids[i].hash = vmalloc(sizeof(vendorid_dpd_hash));
155 if (all_vendor_ids[i].hash == NULL) {
157 "unable to get memory for VID hash\n");
160 memcpy(all_vendor_ids[i].hash->v, vendorid_dpd_hash,
168 all_vendor_ids[i].hash
[all...]
/external/apache-http/src/org/apache/http/auth/
H A DNTCredentials.java154 int hash = LangUtils.HASH_SEED;
155 hash = LangUtils.hashCode(hash, this.principal);
156 hash = LangUtils.hashCode(hash, this.workstation);
157 return hash;

Completed in 630 milliseconds

1234567891011>>