| /external/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| assign_move.pass.cpp | 12 // 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),
66 assert(c.hash_function() == test_hash<std::hash<int> >(8));
78 test_hash<std::hash<int> >,
94 test_hash<std::hash<int> >(8),
100 test_hash<std::hash<int> >(2),
111 assert(c.hash_function() == test_hash<std::hash<int> >(8))
[all...] |
| size.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<NotConstructible> >,
37 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
49 test_hash<std::hash<NotConstructible> >,
55 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >());
|
| copy.pass.cpp | 12 // 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)
[all...] |
| /external/libcxx/test/thread/thread.threads/thread.thread.class/thread.thread.id/ |
| thread_id.pass.cpp | 13 // struct hash
28 typedef std::hash<std::thread::id> H;
|
| /external/oprofile/module/ |
| op_dcache.h | 36 uint hash=0; local
39 hash = (hash + (name[len] << 4) + (name[len] >> 4)) * 11;
41 return (hash ^ parent) % OP_HASH_MAP_NR;
|
| /external/apache-http/src/org/apache/http/auth/ |
| AuthScope.java | 290 int hash = LangUtils.HASH_SEED; local
291 hash = LangUtils.hashCode(hash, this.host);
292 hash = LangUtils.hashCode(hash, this.port);
293 hash = LangUtils.hashCode(hash, this.realm);
294 hash = LangUtils.hashCode(hash, this.scheme);
295 return hash;
[all...] |
| /external/chromium_org/net/http/ |
| des.cc | 92 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
100 reinterpret_cast<DES_cblock*>(hash), &ks, DES_ENCRYPT);
105 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
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) {
166 key, 8, NULL, src, 8, hash, 8, &data_out_moved);
173 void DESEncrypt(const uint8* key, const uint8* src, uint8* hash) {
210 CopyMemory(hash, src, 8);
214 CryptEncrypt(key, 0, FALSE, 0, hash, &hash_len, 8)
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| ext_attr.c | 32 * 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 >> (8*sizeof(hash) - VALUE_HASH_SHIFT))
[all...] |
| /external/fio/ |
| hash.h | 35 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/ |
| MapMakerInternalMapTest.java | 394 int hash = map.hash(one); local
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); local
526 int index = hash & (table.length() - 1)
598 int hash = map.hash(key); local
642 int hash = map.hash(key); local
681 int hash = map.hash(key); local
713 int hash = map.hash(key); local
748 int hash = map.hash(key); local
781 int hash = map.hash(key); local
820 int hash = map.hash(key); local
873 int hash = map.hash(key); local
1006 int hash = map.hash(key); local
1064 int hash = map.hash(key); local
1096 int hash = map.hash(key); local
1130 int hash = map.hash(key); local
1177 int hash = map.hash(key); local
1292 int hash = map.hash(key); local
1333 int hash = map.hash(key); local
1375 int hash = map.hash(key); local
1476 int hash = map.hash(key); local
1730 private final int hash; field in class:MapMakerInternalMapTest.DummyEntry
[all...] |
| /external/iproute2/tc/ |
| f_tcindex.c | 20 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/sync/glue/ |
| extension_backed_data_type_controller.cc | 23 // 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/ |
| key.cc | 81 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/ |
| id_util.cc | 39 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/ |
| assign_move.pass.cpp | 12 // 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))
[all...] |
| /external/chromium_org/third_party/freetype/src/cache/ |
| ftccache.h | 62 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/smhasher/src/ |
| Stats.h | 38 // Sort the hash list, count the total number of collisions and return
69 int PrintCollisions ( hashfunc<hashtype> hash, std::vector<keytype> & keys )
80 hashtype h = hash(&k1,sizeof(keytype),0);
140 hashtype & hash = hashes[j]; local
142 uint32_t index = window(&hash,sizeof(hash),start,width);
261 bool TestKeyList ( hashfunc<hashtype> hash, std::vector<keytype> & keys, bool testColl, bool testDist, bool drawDiagram )
277 hash(&k,sizeof(k),0,&hashes[i]);
291 // 8-bit sections of the hash value, check distribution on all of them.
295 // really model the normal usage of hash functions in hash table lookup, s
326 hashtype & hash = hashes[i]; local
371 hashtype & hash = hashes[j]; local
[all...] |
| /external/deqp/framework/delibs/depool/ |
| dePoolHashSet.h | 23 * \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:
51 * Hash<Set*>* HashSet_getHash (const HashSet* hashSet); TODO: better API
60 DE_DECLARE_POOL_HASH(TYPENAME##Hash, KEYTYPE, TYPENAME##Set*); \
63 TYPENAME##Hash* hash; \
68 DE_INLINE TYPENAME##Hash* TYPENAME##_getHash (const TYPENAME* hashSet) DE_UNUSED_FUNCTION;
[all...] |
| /external/freetype/src/cache/ |
| ftccache.h | 62 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/ |
| glxhash.c | 1 /* 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,
68 * [Larson88] Per-Ake Larson. "Dynamic Hash Tables". CACM 31(4), April
129 unsigned long hash = 0; local
145 hash = (hash << 1) + scatter[tmp & 0xff]
203 unsigned long hash = HashHash(key); local
251 unsigned long hash; local
276 unsigned long hash; local
[all...] |
| /external/mesa3d/src/glx/ |
| glxhash.c | 1 /* 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,
68 * [Larson88] Per-Ake Larson. "Dynamic Hash Tables". CACM 31(4), April
129 unsigned long hash = 0; local
145 hash = (hash << 1) + scatter[tmp & 0xff]
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/ |
| SelectorFilter.cpp | 111 static inline void collectDescendantSelectorIdentifierHashes(const CSSSelector& selector, unsigned*& hash)
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/apache-harmony/x-net/src/test/impl/java.injected/org/apache/harmony/xnet/provider/jsse/ |
| ServerKeyExchangeTest.java | 36 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_org/third_party/boringssl/src/crypto/lhash/ |
| lhash.c | 67 * average chain length exceeds this value, the hash table will be resized. */
71 _LHASH *lh_new(lhash_hash_func hash, lhash_cmp_func comp) {
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/ |
| lstring.c | 23 ** 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[tb->size - 1] == NULL)
[all...] |
