/macosx-10.10/Security-57031.1.35/Security/include/security_cdsa_utilities/ |
H A D | osxverifier.cpp | 64 secdebug("codesign", " hash generated"); 69 // Create a Verifier from hash, path, and requirement. 72 OSXVerifier::OSXVerifier(const SHA1::Byte *hash, const std::string &path) argument 75 secdebug("codesign", "building verifier from hash %p and path=%s", hash, path.c_str()); 76 if (hash) 77 memcpy(mLegacyHash, hash, sizeof(mLegacyHash)); 127 secdebug("codesign", "calculating legacy hash for %s", code->canonicalPath().c_str()); 131 SHA1 hash; local 132 hash(buffe [all...] |
/macosx-10.10/Security-57031.1.35/Security/libsecurity_cdsa_utilities/lib/ |
H A D | osxverifier.cpp | 64 secdebug("codesign", " hash generated"); 69 // Create a Verifier from hash, path, and requirement. 72 OSXVerifier::OSXVerifier(const SHA1::Byte *hash, const std::string &path) argument 75 secdebug("codesign", "building verifier from hash %p and path=%s", hash, path.c_str()); 76 if (hash) 77 memcpy(mLegacyHash, hash, sizeof(mLegacyHash)); 127 secdebug("codesign", "calculating legacy hash for %s", code->canonicalPath().c_str()); 131 SHA1 hash; local 132 hash(buffe [all...] |
/macosx-10.10/file_cmds-242/du/ |
H A D | du.c | 386 int hash; local 390 /* If necessary, initialize the hash table. */ 400 /* If the hash table is getting too full, enlarge it. */ 428 hash = (le->dev ^ le->ino) % new_size; 430 if (new_buckets[hash] != NULL) 431 new_buckets[hash]->previous = 433 le->next = new_buckets[hash]; 435 new_buckets[hash] = le; 444 /* Try to locate this entry in the hash table. */ 445 hash 519 int hash; local [all...] |
/macosx-10.10/xnu-2782.1.97/osfmk/kern/ |
H A D | wait_queue.h | 272 /* The Jenkins "one at a time" hash. 278 uint32_t hash = 0; local 282 hash += key[i]; 283 hash += (hash << 10); 284 hash ^= (hash >> 6); 287 hash += (hash << 3); 288 hash [all...] |
/macosx-10.10/ntp-92/ntpd/ |
H A D | ntp_monitor.c | 26 * Each entry is doubly linked into two lists, a hash table and a most- 28 * the hash table. If found, the statistics are updated and the entry 30 * allocated, initialized and linked into both the hash table and at the 36 * tail for the MRU list, unlinking from the hash table, and 62 * Pointers to the hash table, the MRU list and the count table. Memory 63 * for the hash and count tables is only allocated if monitoring is 216 register u_int hash; local 226 hash = MON_HASH(&addr); 228 md = mon_hash[hash]; 346 * Drop him into front of the hash tabl 391 register u_int hash; local [all...] |
/macosx-10.10/CPANInternal-159.1/Template-Toolkit-2.25/lib/Template/Plugin/ |
H A D | HTML.pm | 30 my $hash = ref $args[-1] eq 'HASH' ? pop @args : { }; 32 _SORTED => $hash->{ sorted } || 0, 33 attributes => $hash->{ attributes } || $hash->{ attrs } || { }, 56 my ($self, $hash) = @_; 57 $hash ||= $self->{ attributes }; 58 return '' unless ref $hash eq 'HASH'; 60 my @keys = keys %$hash; 64 "$_=\"" . $self->escape( $hash->{ $_ } ) . '"'; 160 =head2 attributes(hash) [all...] |
/macosx-10.10/postfix-255/postfix/src/util/ |
H A D | htable.c | 5 /* hash table manager 54 /* This module maintains one or more hash tables. Each table entry 80 /* htable_free() destroys a hash table, including contents. If the free_fn 99 /* A callback function should not modify the hash table that is 129 /* htable_hash - hash a string */ 161 /* htable_size - allocate and initialize hash table */ 177 /* htable_create - create initial hash table */ 285 /* htable_free - destroy hash table */ 313 /* htable_walk - iterate over hash table */ 384 HTABLE *hash; local [all...] |
/macosx-10.10/Security-57031.1.35/Security/sec/Security/ |
H A D | SecOTRPublicIdentity.c | 72 requestor->hash[0], requestor->hash[1], 73 requestor->hash[2], requestor->hash[3], 74 requestor->hash[4], requestor->hash[5], 75 requestor->hash[6], requestor->hash[7]); 109 CCDigest(kCCDigestSHA1, CFDataGetBytePtr(stream), (CC_LONG)CFDataGetLength(stream), pubID->hash); 355 void SecOTRPICopyHash(SecOTRPublicIdentityRef publicID, uint8_t hash[kMPIDHashSiz argument 365 SecOTRPICompareHash(SecOTRPublicIdentityRef publicID, const uint8_t hash[kMPIDHashSize]) argument [all...] |
/macosx-10.10/objc4-646/runtime/ |
H A D | maptable.mm | 55 static INLINE unsigned xorHash(unsigned hash) { 56 unsigned xored = (hash & 0xffff) ^ (hash >> 16); 57 return ((xored * 65521) + hash); 61 unsigned hash = (table->prototype->hash)(table, key); 62 return hash & table->nbBucketsMinusOne; 90 return (proto1->hash == proto2->hash) && (proto1->isEqual == proto2->isEqual) && (proto1->free == proto2->free) && (proto1->style == proto2->style); 96 return NXPtrHash(info, (void*)proto->hash) [all...] |
/macosx-10.10/libxml2-26/libxml2/ |
H A D | dict.c | 32 * it seems that having hash randomization might be a good idea 37 * well but since the attack is based on growing a very big hash 38 * list we will use the BigKey algo as soon as the hash size grows 367 * Calculate a hash key using a good hash function that works well for 368 * larger hash table sizes. 371 * http://burtleburtle.net/bob/hash/doobs.html 376 uint32_t hash; local 381 hash = seed; 384 hash 410 uint32_t hash; local [all...] |
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-core/libxml2-src/ |
H A D | dict.c | 272 * Calculate a hash key using a good hash function that works well for 273 * larger hash table sizes. 276 * http://burtleburtle.net/bob/hash/doobs.html 281 uint32_t hash; local 286 hash = 0; 289 hash += data[i]; 290 hash += (hash << 10); 291 hash 315 uint32_t hash; local [all...] |
/macosx-10.10/WebKit2-7600.1.25/Shared/Cocoa/ |
H A D | WKObject.mm | 68 - (NSUInteger)hash 72 return _target ? [_target hash] : [super hash];
|
/macosx-10.10/vim-55/src/proto/ |
H A D | undo.pro | 9 void u_compute_hash __ARGS((char_u *hash)); 11 void u_write_undo __ARGS((char_u *name, int forceit, buf_T *buf, char_u *hash)); 12 void u_read_undo __ARGS((char_u *name, char_u *hash, char_u *orig_name));
|
/macosx-10.10/OpenLDAP-499.27/OpenLDAP/libraries/liblutil/ |
H A D | passwd.c | 147 /* password hash routines */ 188 LUTIL_PASSWD_HASH_FUNC *hash ) 199 ptr->s.hash_fn = hash; 379 struct berval *hash, 384 hash->bv_val = NULL; 385 hash->bv_len = 0; 393 if( text ) *text = "scheme provided no hash function"; 399 return (sc->hash_fn)( &sc->name, passwd, hash, text ); 429 const struct berval *hash, 439 string.bv_len = hash 376 lutil_passwd_hash( const struct berval * passwd, const char * method, struct berval *hash, const char **text ) argument 427 lutil_passwd_string64( const struct berval *sc, const struct berval *hash, struct berval *b64, const struct berval *salt ) argument 1026 hash_ssha1( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text ) argument 1057 hash_sha1( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text ) argument 1078 hash_smd5( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text ) argument 1109 hash_md5( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text ) argument 1133 hash_lanman( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text ) argument 1184 hash_crypt( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text ) argument 1253 hash_clear( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text ) argument [all...] |
/macosx-10.10/BerkeleyDB-21/db/test/scr024/src/com/sleepycat/collections/test/ |
H A D | TestSR15721.java | 92 int hash = currentTxn.hashCode(); 97 assertTrue(hash == hash2); 119 assertTrue(hash == hash2);
|
/macosx-10.10/Security-57031.1.35/Security/include/security_codesigning/ |
H A D | requirement.cpp | 115 // Produce the hash of a fake Apple root (only if compiled for internal testing) 132 SHA1 hash; local 133 hash(buffer, size); 134 hash.finish(testHash);
|
/macosx-10.10/Security-57031.1.35/Security/libsecurity_codesigning/lib/ |
H A D | requirement.cpp | 115 // Produce the hash of a fake Apple root (only if compiled for internal testing) 132 SHA1 hash; local 133 hash(buffer, size); 134 hash.finish(testHash);
|
/macosx-10.10/WTF-7600.1.24/wtf/text/ |
H A D | CString.h | 82 WTF_EXPORT_PRIVATE unsigned hash() const; 97 static unsigned hash(const CString& string) { return string.hash(); } function in struct:WTF::CStringHash
|
/macosx-10.10/apache-793/httpd/server/ |
H A D | util_md5.c | 56 unsigned char hash[APR_MD5_DIGESTSIZE]; local 60 * Take the MD5 hash of the string argument. 68 apr_md5_final(hash, &my_md5); 70 ap_bin2hex(hash, APR_MD5_DIGESTSIZE, result);
|
/macosx-10.10/libarchive-30/libarchive/libarchive/ |
H A D | archive_entry_link_resolver.c | 47 * This is mostly a pretty straightforward hash table implementation. 74 int hash; member in struct:links_entry 252 int hash, bucket; local 270 hash = (int)(dev ^ ino); 273 bucket = hash % res->number_buckets; 275 if (le->hash == hash 287 /* Remove it from this hash bucket. */ 324 /* Remove it from this hash bucket. */ 342 int hash, bucke local [all...] |
/macosx-10.10/BerkeleyDB-21/db/mod_db4/ |
H A D | mm_hash.h | 21 unsigned int hash; member in struct:_MM_Bucket
|
/macosx-10.10/CPANInternal-159.1/Log-Log4perl-1.40/lib/Log/Log4perl/ |
H A D | Util.pm | 12 my( $hash, $required, $optional ) = @_; 15 my %hash_copy = %$hash; 19 if( !exists $hash->{ $p } or 20 !defined $hash->{ $p } ) {
|
/macosx-10.10/Heimdal-398.1.2/lib/gssapi/mech/ |
H A D | gss_cb.c | 141 uint8_t hash[16]; local 146 major_status = gss_mg_gen_cb(minor_status, b, hash, buffer); 150 if(ct_memcmp(hash, p, sizeof(hash)) != 0) {
|
/macosx-10.10/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGMinifiedID.h | 61 unsigned hash() const { return WTF::IntHash<uintptr_t>::hash(m_id); } function in class:JSC::DFG::MinifiedID 86 static unsigned hash(const MinifiedID& key) { return key.hash(); } function in struct:JSC::DFG::MinifiedIDHash
|
/macosx-10.10/JavaScriptCore-7600.1.17/jit/ |
H A D | RegisterSet.h | 109 unsigned hash() const { return m_vector.hash(); } function in class:JSC::RegisterSet 126 static unsigned hash(const RegisterSet& set) { return set.hash(); } function in struct:JSC::RegisterSetHash
|