Searched refs:hash (Results 176 - 200 of 1478) sorted by relevance

1234567891011>>

/macosx-10.9.5/CPANInternal-140/Template-Toolkit/lib/Template/Plugin/
H A DHTML.pm30 my $hash = ref $args[-1] eq 'HASH' ? pop @args : { };
32 _SORTED => $hash->{ sorted } || 0,
46 my ($self, $hash) = @_;
47 return '' unless ref $hash eq 'HASH';
49 my @keys = keys %$hash;
53 "$_=\"" . $self->escape( $hash->{ $_ } ) . '"';
106 =head2 attributes(hash)
108 Returns the elements of the hash array passed by reference correctly
115 provided as an optional hash array reference as the second argument or
130 rather than whatever order the hash happene
[all...]
/macosx-10.9.5/CPANInternal-140/Template-Toolkit-2.24/lib/Template/Plugin/
H A DHTML.pm30 my $hash = ref $args[-1] eq 'HASH' ? pop @args : { };
32 _SORTED => $hash->{ sorted } || 0,
46 my ($self, $hash) = @_;
47 return '' unless ref $hash eq 'HASH';
49 my @keys = keys %$hash;
53 "$_=\"" . $self->escape( $hash->{ $_ } ) . '"';
106 =head2 attributes(hash)
108 Returns the elements of the hash array passed by reference correctly
115 provided as an optional hash array reference as the second argument or
130 rather than whatever order the hash happene
[all...]
/macosx-10.9.5/ntp-88/ntpd/
H A Dntp_monitor.c26 * 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.9.5/postfix-252/postfix/src/util/
H A Dhtable.c5 /* 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 */
310 /* htable_walk - iterate over hash table */
382 HTABLE *hash; local
[all...]
/macosx-10.9.5/Security-55471.14.18/sec/Security/
H A DSecOTRPublicIdentity.c57 requestor->hash[0], requestor->hash[1],
58 requestor->hash[2], requestor->hash[3],
59 requestor->hash[4], requestor->hash[5],
60 requestor->hash[6], requestor->hash[7]);
94 CCDigest(kCCDigestSHA1, CFDataGetBytePtr(stream), (CC_LONG)CFDataGetLength(stream), pubID->hash);
339 void SecOTRPICopyHash(SecOTRPublicIdentityRef publicID, uint8_t hash[kMPIDHashSiz argument
349 SecOTRPICompareHash(SecOTRPublicIdentityRef publicID, const uint8_t hash[kMPIDHashSize]) argument
[all...]
H A DSecOTRIdentityPriv.h53 uint8_t hash[kMPIDHashSize]; member in struct:_SecOTRPublicIdentity
73 bool SecOTRFIComparePublicHash(SecOTRFullIdentityRef fullID, const uint8_t hash[kMPIDHashSize]);
86 void SecOTRPICopyHash(SecOTRPublicIdentityRef publicID, uint8_t hash[kMPIDHashSize]);
89 bool SecOTRPICompareHash(SecOTRPublicIdentityRef publicID, const uint8_t hash[kMPIDHashSize]);
/macosx-10.9.5/libxml2-26/libxml2/
H A Ddict.c32 * 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.9.5/objc4-551.1/runtime/
H A Dmaptable.mm55 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.9.5/pyobjc-42/pyobjc/pyobjc-core/libxml2-src/
H A Ddict.c272 * 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.9.5/CPANInternal-140/Params-Validate/
H A DMakefile.PL90 my $hash = $_[1];
94 @{ $hash }{ 'XS', 'C' } = ( {}, [] );
97 $hash;
/macosx-10.9.5/vim-53/src/proto/
H A Dundo.pro9 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.9.5/OpenLDAP-491.1/OpenLDAP/libraries/liblutil/
H A Dpasswd.c147 /* 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.9.5/BerkeleyDB-21/db/test/scr024/src/com/sleepycat/collections/test/
H A DTestSR15721.java92 int hash = currentTxn.hashCode();
97 assertTrue(hash == hash2);
119 assertTrue(hash == hash2);
/macosx-10.9.5/Security-55471.14.18/include/security_codesigning/
H A Drequirement.cpp115 // 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.9.5/Security-55471.14.18/libsecurity_codesigning/lib/
H A Drequirement.cpp115 // 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.9.5/libarchive-29/libarchive/libarchive/
H A Darchive_entry_link_resolver.c47 * 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.9.5/BerkeleyDB-21/db/mod_db4/
H A Dmm_hash.h21 unsigned int hash; member in struct:_MM_Bucket
/macosx-10.9.5/CPANInternal-140/Log-Log4perl-1.40/lib/Log/Log4perl/
H A DUtil.pm12 my( $hash, $required, $optional ) = @_;
15 my %hash_copy = %$hash;
19 if( !exists $hash->{ $p } or
20 !defined $hash->{ $p } ) {
/macosx-10.9.5/CPANInternal-140/YAML-Syck/
H A Dsyck_st.h1 /* This is a public domain general purpose hash table package written by Peter Moore @ UCB. */
13 int (*hash)(); member in struct:st_hash_type
/macosx-10.9.5/Heimdal-323.92.1/lib/gssapi/mech/
H A Dgss_cb.c141 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.9.5/JavaScriptCore-7537.78.1/dfg/
H A DDFGMinifiedID.h63 unsigned hash() const { return WTF::IntHash<uintptr_t>::hash(m_id); } function in class:JSC::DFG::MinifiedID
87 static unsigned hash(const MinifiedID& key) { return key.hash(); } function in struct:JSC::DFG::MinifiedIDHash
/macosx-10.9.5/JavaScriptCore-7537.78.1/profiler/
H A DProfilerBytecodes.h46 CodeBlockHash hash() const { return m_hash; } function in class:JSC::Profiler::Bytecodes
/macosx-10.9.5/WebCore-7537.78.1/dom/
H A DNamedFlowCollection.cpp121 static unsigned hash(WebKitNamedFlow* key) { return DefaultHash<String>::Hash::hash(key->name()); } function in struct:WebCore::NamedFlowCollection::NamedFlowHashFunctions
128 static unsigned hash(const String& key) { return DefaultHash<String>::Hash::hash(key); } function in struct:WebCore::NamedFlowCollection::NamedFlowHashTranslator
/macosx-10.9.5/WebCore-7537.78.1/platform/graphics/qt/
H A DImageQt.cpp70 WebGraphicHash* hash = _graphics(); local
72 if (hash->isEmpty()) {
78 hash->insert("missingImage", QPixmap(QLatin1String(":webkit/resources/missingImage.png")));
80 hash->insert("nullPlugin", QPixmap(QLatin1String(":webkit/resources/nullPlugin.png")));
82 hash->insert("urlIcon", QPixmap(QLatin1String(":webkit/resources/urlIcon.png")));
84 hash->insert("textAreaResizeCorner", QPixmap(QLatin1String(":webkit/resources/textAreaResizeCorner.png")));
86 hash->insert("deleteButton", QPixmap(QLatin1String(":webkit/resources/deleteButton.png")));
88 hash->insert("inputSpeech", QPixmap(QLatin1String(":webkit/resources/inputSpeech.png")));
91 return hash;
/macosx-10.9.5/WebKit2-7537.78.2/Platform/CoreIPC/
H A DStringReference.cpp59 unsigned StringReference::Hash::hash(const StringReference& a) function in class:CoreIPC::StringReference::Hash

Completed in 383 milliseconds

1234567891011>>