| /external/chromium_org/third_party/smhasher/src/ |
| KeysetTest.h | 30 pfHash hash, std::vector<hashtype> & hashes )
42 hashes.push_back(h);
47 CombinationKeygenRecurse(key,len+1,maxlen,blocks,blockcount,hash,hashes);
59 std::vector<hashtype> hashes; local
63 CombinationKeygenRecurse<hashtype>(key,0,maxlen,blocks,blockcount,hash,hashes);
67 printf("%d keys\n",(int)hashes.size());
73 result &= TestHashList<hashtype>(hashes,testColl,testDist,drawDiagram);
85 void PermutationKeygenRecurse ( pfHash hash, uint32_t * blocks, int blockcount, int k, std::vector<hashtype> & hashes )
93 hashes.push_back(h);
102 PermutationKeygenRecurse(hash,blocks,blockcount,k+1,hashes);
115 std::vector<hashtype> hashes; local
171 std::vector<hashtype> hashes; local
208 std::vector<hashtype> hashes; local
256 std::vector<hashtype> hashes; local
301 std::vector<hashtype> hashes; local
343 std::vector<hashtype> hashes; local
388 std::vector<hashtype> hashes; local
421 std::vector<hashtype> hashes; local
[all...] |
| Stats.h | 42 int FindCollisions ( std::vector<hashtype> & hashes,
48 std::sort(hashes.begin(),hashes.end());
50 for(size_t i = 1; i < hashes.size(); i++)
52 if(hashes[i] == hashes[i-1])
58 collisions.insert(hashes[i]);
106 double TestDistribution ( std::vector<hashtype> & hashes, bool drawDiagram )
119 while(double(hashes.size()) / double(1 << maxwidth) < 5.0)
138 for(size_t j = 0; j < hashes.size(); j++
265 std::vector<hashtype> hashes; local
[all...] |
| Bitslice.cpp | 54 void Bitslice ( std::vector<hashtype> & hashes, slice_vec & slices )
58 const int slicelen = ((int)hashes.size() + 31) / 32;
72 for(int i = 0; i < (int)hashes.size(); i++)
74 int b = getbit(hashes[i],j);
|
| KeysetTest.cpp | 18 uint8_t * hashes = new uint8_t[hashbytes * 256]; local
22 memset(hashes,0,hashbytes*256);
32 hash(key,i,256-i,&hashes[i*hashbytes]);
37 hash(hashes,hashbytes*256,0,final);
45 delete [] hashes;
303 std::vector<uint128_t> hashes; local
305 HashCallback<uint128_t> c(hash,hashes);
309 printf("%d hashes\n",(int)hashes.size());
315 FindCollisions(hashes,collisions,1000)
[all...] |
| /external/chromium_org/net/http/ |
| http_security_headers_unittest.cc | 127 HashValueVector hashes; local
130 // Set some fake "chain" hashes
140 &include_subdomains, &hashes));
142 &include_subdomains, &hashes));
144 &include_subdomains, &hashes));
146 &include_subdomains, &hashes));
148 &include_subdomains, &hashes));
150 &include_subdomains, &hashes));
152 &include_subdomains, &hashes));
154 &include_subdomains, &hashes));
333 HashValueVector hashes; local
[all...] |
| http_security_headers.h | 34 // true and populates the |*max_age|, |*include_subdomains|, and |*hashes|
45 // For this function to return true, the key hashes specified by the HPKP
55 HashValueVector* hashes);
|
| transport_security_state.cc | 47 std::string HashesToBase64String(const HashValueVector& hashes) {
49 for (size_t i = 0; i != hashes.size(); ++i) {
52 str += hashes[i].ToString();
530 // PublicKeyPins contains a number of SubjectPublicKeyInfo hashes for a site.
680 const HashValueVector& hashes) {
695 domain_state.dynamic_spki_hashes = hashes;
846 const HashValueVector& hashes) const {
847 // Validate that hashes is not empty. By the time this code is called (in
849 // And, hashes *can* be empty in some test scenarios.
850 if (hashes.empty())
[all...] |
| transport_security_state.h | 64 // Takes a set of SubjectPublicKeyInfo |hashes| and returns true if:
65 // 1) |bad_static_spki_hashes| does not intersect |hashes|; AND
67 // or at least one of them intersects |hashes|.
69 // |{dynamic,static}_spki_hashes| contain trustworthy public key hashes,
80 bool CheckPublicKeyPins(const HashValueVector& hashes) const;
115 // Optional; hashes of static pinned SubjectPublicKeyInfos. Unless both
125 // Optional; hashes of dynamically pinned SubjectPublicKeyInfos.
131 // Optional; hashes of static known-bad SubjectPublicKeyInfos which
231 bool include_subdomains, const HashValueVector& hashes);
|
| /external/oprofile/daemon/ |
| opd_cookie.c | 100 static struct list_head hashes[HASH_SIZE]; variable in typeref:struct:list_head
142 list_for_each(pos, &hashes[hash]) {
150 list_add(&entry->list, &hashes[hash]);
165 list_for_each(pos, &hashes[hash]) {
172 list_add(&entry->list, &hashes[hash]);
190 list_for_each(pos, &hashes[hash]) {
208 list_init(&hashes[i]);
|
| opd_anon.c | 43 static struct list_head hashes[HASH_SIZE]; variable in typeref:struct:list_head
88 list_for_each_safe(pos, pos2, &hashes[hash]) {
118 list_add_tail(&m->list, &hashes[hash]);
190 list_for_each(pos, &hashes[hash]) {
211 list_add(&entry->list, &hashes[hash]);
225 list_init(&hashes[i]);
|
| /external/dropbear/libtomcrypt/ |
| Android.mk | 25 src/hashes/chc/chc.c src/hashes/helper/hash_file.c src/hashes/helper/hash_filehandle.c \
26 src/hashes/helper/hash_memory.c src/hashes/helper/hash_memory_multi.c src/hashes/md2.c src/hashes/md4.c \
27 src/hashes/md5.c src/hashes/rmd128.c src/hashes/rmd160.c src/hashes/rmd256.c src/hashes/rmd320.c
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/x509/ |
| by_dir.c | 86 STACK_OF(BY_DIR_HASH) *hashes;
191 if (ent->hashes)
192 sk_BY_DIR_HASH_pop_free(ent->hashes, by_dir_hash_free);
252 ent->hashes = sk_BY_DIR_HASH_new(by_dir_hash_cmp);
254 if (!ent->dir || !ent->hashes)
344 if (type == X509_LU_CRL && ent->hashes)
348 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
351 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
447 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
450 sk_BY_DIR_HASH_value(ent->hashes, idx)
[all...] |
| /external/openssl/crypto/x509/ |
| by_dir.c | 86 STACK_OF(BY_DIR_HASH) *hashes;
191 if (ent->hashes)
192 sk_BY_DIR_HASH_pop_free(ent->hashes, by_dir_hash_free);
252 ent->hashes = sk_BY_DIR_HASH_new(by_dir_hash_cmp);
254 if (!ent->dir || !ent->hashes)
338 if (type == X509_LU_CRL && ent->hashes)
342 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
345 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
441 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
444 sk_BY_DIR_HASH_value(ent->hashes, idx)
[all...] |
| /external/chromium_org/chrome/browser/net/ |
| transport_security_persister_unittest.cc | 181 net::HashValueVector hashes; local
182 EXPECT_FALSE(domain_state.CheckPublicKeyPins(hashes));
188 EXPECT_FALSE(domain_state.CheckPublicKeyPins(hashes));
190 hashes.push_back(sha1);
191 EXPECT_TRUE(domain_state.CheckPublicKeyPins(hashes));
193 hashes[0].data()[0] = '2';
194 EXPECT_FALSE(domain_state.CheckPublicKeyPins(hashes));
|
| /libcore/luni/src/main/java/org/apache/harmony/security/provider/cert/ |
| Cache.java | 101 // in the particular array. I.e. for index N hash contained in hashes[N]
106 private final long[] hashes; field in class:Cache
113 // This is an ordered array of the hash codes from 'hashes' array (described
115 // the hash in the 'hashes' array. I.e. hash code ABCD00 with index 10 in
116 // the hashes array will be represented in this array as ABCD0A (10==0x0A)
135 hashes = new long[cache_size];
258 long idx_hash = (hashes[index] | (index+1));
262 // (hashes[index])
308 hashes[index] = hash;
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_cmd_line.py | 96 hashes = []
100 hashes.append(data)
101 self.assertNotEqual(hashes[0], hashes[1])
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_cmd_line.py | 96 hashes = []
100 hashes.append(data)
101 self.assertNotEqual(hashes[0], hashes[1])
|
| /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/ |
| CMSSignedData.java | 77 private Map hashes; field in class:CMSSignedData
106 * @param hashes a map of precomputed digests for content indexed by name of hash.
110 Map hashes,
114 this(hashes, CMSUtils.readContentInfo(sigBlock));
177 Map hashes,
181 this.hashes = hashes;
251 if (hashes == null)
257 Object obj = hashes.keySet().iterator().next();
258 byte[] hash = (obj instanceof String) ? (byte[])hashes.get(info.getDigestAlgorithm().getAlgorithm().getId()) : (byte[])hashes.get(info.getDigestAlgorithm (…)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
| cso_cache.c | 40 struct cso_hash *hashes[CSO_CACHE_MAX]; member in struct:cso_cache
86 hash = sc->hashes[type];
255 sc->hashes[i] = cso_hash_create();
295 cso_hash_delete(sc->hashes[i]);
307 sanitize_hash(sc, sc->hashes[i], i, sc->max_size);
|
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| cso_cache.c | 40 struct cso_hash *hashes[CSO_CACHE_MAX]; member in struct:cso_cache
86 hash = sc->hashes[type];
255 sc->hashes[i] = cso_hash_create();
295 cso_hash_delete(sc->hashes[i]);
307 sanitize_hash(sc, sc->hashes[i], i, sc->max_size);
|
| /external/chromium_org/net/cert/ |
| cert_verify_proc_openssl.cc | 131 HashValueVector* hashes) {
148 hashes->push_back(sha1);
152 hashes->push_back(sha256);
|
| /external/chromium_org/google_apis/cup/ |
| client_update_protocol.cc | 69 const std::vector<uint8>& hashes) {
71 DCHECK(!hashes.empty());
78 if (!hmac.Sign(ByteVectorToSP(hashes), &result[0], result.size()))
85 const std::vector<uint8>& hashes,
88 DCHECK(!hashes.empty());
95 return hmac.Verify(ByteVectorToSP(hashes), ByteVectorToSP(server_proof));
|
| /external/chromium_org/chrome/renderer/safe_browsing/ |
| scorer.cc | 70 scorer->page_terms_.insert(model.hashes(model.page_term(i)));
112 model_.hashes(rule.feature(i)));
|
| /external/chromium/net/base/ |
| transport_security_state.h | 54 // IsChainOfPublicKeysPermitted takes a set of public key hashes and
57 // 2) |hashes| and |public_key_hashes| are not disjoint.
59 const std::vector<SHA1Fingerprint>& hashes);
|
| /external/chromium_org/chrome/browser/chromeos/policy/ |
| auto_enrollment_client.h | 104 // Returns true if |serial_number_hash_| is contained in |hashes|.
106 const google::protobuf::RepeatedPtrField<std::string>& hashes);
|
