Searched refs:hashes (Results 1 - 25 of 70) sorted by relevance

123

/external/chromium_org/third_party/WebKit/Source/devtools/scripts/
H A Ddevtools_file_hashes.py39 def save_hashes(hashes_file_path, hashes):
42 json.dump(hashes, hashes_file, indent=4, separators=(",", ": "))
51 hashes = json.load(hashes_file)
54 return hashes
65 hashes = load_hashes(hash_file_path)
69 if calculate_file_hash(file_path) != hashes.get(file_name, ""):
75 hashes = {}
78 hashes[file_name] = calculate_file_hash(file_path)
79 save_hashes(hash_file_path, hashes)
/external/chromium_org/third_party/smhasher/src/
H A DKeysetTest.h30 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...]
H A DStats.h42 int FindCollisions ( std::vector<hashtype> & hashes, argument
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 ) argument
119 while(double(hashes.size()) / double(1 << maxwidth) < 5.0)
138 for(size_t j = 0; j < hashes
191 TestHashList( std::vector<hashtype> & hashes, std::vector<hashtype> & collisions, bool testDist, bool drawDiagram ) argument
251 TestHashList( std::vector<hashtype> & hashes, bool , bool testDist, bool drawDiagram ) argument
265 std::vector<hashtype> hashes; local
300 TestDistributionBytepairs( std::vector<hashtype> & hashes, bool drawDiagram ) argument
354 TestDistributionFast( std::vector<hashtype> & hashes, double & dworst, double & davg ) argument
[all...]
H A DBitslice.cpp54 void Bitslice ( std::vector<hashtype> & hashes, slice_vec & slices ) argument
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);
H A DKeysetTest.cpp18 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,collision
[all...]
/external/jemalloc/test/unit/
H A Dhash.c67 VARIABLE_ARRAY(uint8_t, hashes, hashbytes * 256);
73 memset(hashes, 0, sizeof(hashes));
86 memcpy(&hashes[i*hashbytes], &out, hashbytes);
91 memcpy(&hashes[i*hashbytes], out, hashbytes);
96 memcpy(&hashes[i*hashbytes], out, hashbytes);
105 uint32_t out = hash_x86_32(hashes, hashbytes*256, 0);
110 hash_x86_128(hashes, hashbytes*256, 0, out);
115 hash_x64_128(hashes, hashbytes*256, 0, out);
/external/chromium_org/chrome/browser/extensions/activity_log/
H A Dgenerate_ad_network_hashes.py75 hashes = ['"%s"' % sha256(line.strip()).hexdigest()[:16].upper()
79 hashes.sort()
80 ad_networks = ',\n '.join(hashes)
/external/chromium_org/net/http/
H A Dhttp_security_headers.h34 // 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);
H A Dhttp_security_headers_unittest.cc135 HashValueVector hashes; local
138 // Set some fake "chain" hashes
148 &include_subdomains, &hashes));
150 &include_subdomains, &hashes));
152 &include_subdomains, &hashes));
154 &include_subdomains, &hashes));
156 &include_subdomains, &hashes));
158 &include_subdomains, &hashes));
160 &include_subdomains, &hashes));
162 &include_subdomains, &hashes));
384 HashValueVector hashes; local
554 HashValueVector hashes; local
[all...]
H A Dtransport_security_persister_unittest.cc171 net::HashValueVector hashes; local
173 EXPECT_FALSE(domain_state.CheckPublicKeyPins(hashes, &failure_log));
179 EXPECT_FALSE(domain_state.CheckPublicKeyPins(hashes, &failure_log));
181 hashes.push_back(sha1);
182 EXPECT_TRUE(domain_state.CheckPublicKeyPins(hashes, &failure_log));
184 hashes[0].data()[0] = '2';
185 EXPECT_FALSE(domain_state.CheckPublicKeyPins(hashes, &failure_log));
H A Dtransport_security_state.h90 // Optional; hashes of pinned SubjectPublicKeyInfos.
93 // Optional; hashes of static known-bad SubjectPublicKeyInfos which MUST
102 // Takes a set of SubjectPublicKeyInfo |hashes| and returns true if:
103 // 1) |bad_static_spki_hashes| does not intersect |hashes|; AND
105 // or at least one of them intersects |hashes|.
107 // |{dynamic,static}_spki_hashes| contain trustworthy public key hashes,
118 bool CheckPublicKeyPins(const HashValueVector& hashes,
166 const HashValueVector& hashes,
248 bool include_subdomains, const HashValueVector& hashes);
286 const HashValueVector& hashes,
[all...]
H A Dhttp_security_headers.cc120 HashValueVector* hashes) {
135 hashes->push_back(hash);
280 HashValueVector* hashes) {
330 for (HashValueVector::const_iterator j = hashes->begin();
331 j != hashes->end(); ++j) {
339 hashes->push_back(*i);
118 ParseAndAppendPin(const std::string& value, HashValueTag tag, HashValueVector* hashes) argument
276 ParseHPKPHeader(const std::string& value, const HashValueVector& chain_hashes, base::TimeDelta* max_age, bool* include_subdomains, HashValueVector* hashes) argument
/external/chromium_org/mojo/tools/pylib/
H A Dtransitive_hash.py52 hashes = set()
57 if current_hash in hashes:
61 hashes.add(current_hash)
63 return sha256('|'.join(sorted(hashes))).hexdigest()
/external/chromium_org/extensions/browser/
H A Dcomputed_hashes.cc81 std::vector<std::string>* hashes = &(data_[relative_path].second); local
88 hashes->push_back(std::string());
89 std::string* decoded = &hashes->back();
91 hashes->clear();
101 std::vector<std::string>* hashes) {
123 *hashes = info.second;
135 const std::vector<std::string>& hashes) {
144 for (std::vector<std::string>::const_iterator i = hashes.begin();
145 i != hashes.end();
172 std::vector<std::string>* hashes) {
99 GetHashes(const base::FilePath& relative_path, int* block_size, std::vector<std::string>* hashes) argument
133 AddHashes(const base::FilePath& relative_path, int block_size, const std::vector<std::string>& hashes) argument
170 ComputeHashesForContent(const std::string& contents, size_t block_size, std::vector<std::string>* hashes) argument
[all...]
H A Dcomputed_hashes.h21 // A pair of classes for serialization of a set of SHA256 block hashes computed
31 // The block size and hashes for |relative_path| will be copied into the
35 std::vector<std::string>* hashes);
40 // This maps a relative path to a pair of (block size, hashes)
49 // Adds hashes for |relative_path|. Should not be called more than once
53 const std::vector<std::string>& hashes);
58 // Each element of this list contains the path and block hashes for one
64 // the results into |hashes|.
67 std::vector<std::string>* hashes);
H A Dverified_contents.cc151 DictionaryValue* hashes = NULL; local
152 if (!hashes_list->GetDictionary(i, &hashes))
155 if (!hashes->GetString(kFormatKey, &format) || format != kTreeHash)
160 if (!hashes->GetInteger(kBlockSizeKey, &block_size) ||
161 !hashes->GetInteger(kHashBlockSizeKey, &hash_block_size))
171 if (!hashes->GetList(kFilesKey, &files))
/external/oprofile/daemon/
H A Dopd_cookie.c100 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]);
H A Dopd_anon.c43 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/chromium_org/third_party/boringssl/src/crypto/x509/
H A Dby_dir.c78 STACK_OF(BY_DIR_HASH) *hashes;
183 if (ent->hashes)
184 sk_BY_DIR_HASH_pop_free(ent->hashes, by_dir_hash_free);
244 ent->hashes = sk_BY_DIR_HASH_new(by_dir_hash_cmp);
246 if (!ent->dir || !ent->hashes)
334 if (type == X509_LU_CRL && ent->hashes)
338 if (sk_BY_DIR_HASH_find(ent->hashes, &idx, &htmp))
340 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
437 if (sk_BY_DIR_HASH_find(ent->hashes, &idx, &htmp))
438 hent = sk_BY_DIR_HASH_value(ent->hashes, id
[all...]
/external/openssl/crypto/x509/
H A Dby_dir.c86 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)
336 if (type == X509_LU_CRL && ent->hashes)
340 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
343 hent = sk_BY_DIR_HASH_value(ent->hashes, idx);
439 idx = sk_BY_DIR_HASH_find(ent->hashes, &htmp);
442 sk_BY_DIR_HASH_value(ent->hashes, id
[all...]
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/
H A DCMSSignedData.java65 private Map hashes; field in class:CMSSignedData
94 * @param hashes a map of precomputed digests for content indexed by name of hash.
98 Map hashes,
102 this(hashes, CMSUtils.readContentInfo(sigBlock));
165 Map hashes,
169 this.hashes = hashes;
239 if (hashes == null)
245 Object obj = hashes.keySet().iterator().next();
246 byte[] hash = (obj instanceof String) ? (byte[])hashes
97 CMSSignedData( Map hashes, byte[] sigBlock) argument
164 CMSSignedData( Map hashes, ContentInfo sigData) argument
[all...]
/external/skia/experimental/benchtools/
H A Drebase.py44 print 'Getting recent git hashes...'
45 hashes = HA_RE_COMPILED.findall(
48 return hashes
206 hashes = get_git_hashes()
207 short_hashes = [h[:7] for h in hashes]
210 hashes = hashes[:short_hashes.index(rebase_hash) + 1]
221 for h in reversed(hashes):
/external/jemalloc/src/
H A Dckh.c19 * fewest that can work, and supporting multiple hashes is an implementation
25 * #hashes | 1 | 2 | 4 | 8 |
73 size_t hashes[2], bucket, cell; local
77 ckh->hash(key, hashes);
80 bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
86 bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
129 size_t hashes[2], bucket, tbucket; local
141 * were an item for which both hashes indicated the same
158 ckh->hash(key, hashes);
159 tbucket = hashes[
196 size_t hashes[2], bucket; local
[all...]
/external/chromium_org/third_party/skia/experimental/benchtools/
H A Drebase.py41 print 'Getting recent git hashes...'
42 hashes = HA_RE_COMPILED.findall(
45 return hashes
274 hashes = get_git_hashes()
275 short_hashes = [h[:7] for h in hashes]
281 extra_hash = hashes[short_hashes.index(extra_hash)]
282 hashes = hashes[:short_hashes.index(rebase_hash) + 1]
296 for h in reversed(hashes):
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/jsdoc-validator/
H A Dbuild_jsdoc_validator_jar.py23 hashes_name = 'hashes'
64 hashes = {}
68 hashes[file_name] = hash
70 hashes[file_name] = '0'
71 hashes[src_dir] = get_src_dir_hash(src_dir)
72 return hashes
119 print 'Updating hashes...'
127 return [('<no expected hashes>', 1, 0)]
141 print '--no-rebuild: Do not rebuild jar, just update hashes'

Completed in 9047 milliseconds

123