/external/chromium_org/third_party/WebKit/Source/devtools/scripts/ |
devtools_file_hashes.py | 39 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/ |
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/jemalloc/test/unit/ |
hash.c | 67 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/ |
generate_ad_network_hashes.py | 75 hashes = ['"%s"' % sha256(line.strip()).hexdigest()[:16].upper() 78 # Hashes should be sorted in C++ so we can do a binary search over them. 79 hashes.sort() 80 ad_networks = ',\n '.join(hashes)
|
/external/chromium_org/net/http/ |
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);
|
http_security_headers_unittest.cc | 135 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...] |
transport_security_persister_unittest.cc | 171 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));
|
http_security_headers.cc | 120 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);
|
/external/chromium_org/extensions/browser/ |
computed_hashes.cc | 62 std::vector<std::string>* hashes = &(data_[relative_path].second); local 69 hashes->push_back(std::string()); 70 std::string* decoded = &hashes->back(); 72 hashes->clear(); 82 std::vector<std::string>* hashes) { 88 *hashes = info.second; 99 const std::vector<std::string>& hashes) { 107 for (std::vector<std::string>::const_iterator i = hashes.begin(); 108 i != hashes.end();
|
computed_hashes.h | 20 // A pair of classes for serialization of a set of SHA256 block hashes computed 30 // The block size and hashes for |relative_path| will be copied into the 34 std::vector<std::string>* hashes); 39 // This maps a relative path to a pair of (block size, hashes) 48 // Adds hashes for |relative_path|. Should not be called more than once 52 const std::vector<std::string>& hashes);
|
verified_contents.cc | 150 DictionaryValue* hashes = NULL; local 151 if (!hashes_list->GetDictionary(i, &hashes)) 154 if (!hashes->GetString(kFormatKey, &format) || format != kTreeHash) 159 if (!hashes->GetInteger(kBlockSizeKey, &block_size) || 160 !hashes->GetInteger(kHashBlockSizeKey, &hash_block_size)) 170 if (!hashes->GetList(kFilesKey, &files))
|
/external/chromium_org/mojo/tools/pylib/ |
transitive_hash.py | 52 hashes = set() 57 if current_hash in hashes: 61 hashes.add(current_hash) 63 return sha256('|'.join(sorted(hashes))).hexdigest()
|
/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/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) 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, idx) [all...] |
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/ |
CMSSignedData.java | 65 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.get(info.getDigestAlgorithm().getAlgorithm().getId()) : (byte[])hashes.get(info.getDigestAlgorithm (…) [all...] |
/external/chromium_org/third_party/skia/experimental/benchtools/ |
rebase.py | 44 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/skia/experimental/benchtools/ |
rebase.py | 44 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/ |
ckh.c | 19 * 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[1] & ((ZU(1) << ckh->lg_curbuckets) - 1) 196 size_t hashes[2], bucket; local [all...] |
/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])
|