Searched refs:hash (Results 101 - 125 of 1478) sorted by relevance

1234567891011>>

/macosx-10.9.5/apache-786.1/httpd/srclib/apr/tables/
H A Dapr_hash.c37 * The internal form of a hash table.
39 * The table is an array indexed by the hash of the key; collisions
40 * are resolved by hanging a linked list of hash entries off each
49 unsigned int hash; member in struct:apr_hash_entry_t
56 * Data structure for iterating through a hash table.
58 * We keep a pointer to the next hash entry here to allow the current
59 * hash entry to be freed or otherwise mangled between calls to
72 * The count of hash entries may be greater depending on the chosen
167 * Expanding a hash table
179 unsigned int i = hi->this->hash
187 hashfunc_default(const char *char_key, apr_ssize_t *klen, unsigned int hash) argument
268 unsigned int hash; local
413 unsigned int i, j, k, hash; local
[all...]
/macosx-10.9.5/OpenLDAP-491.1/OpenLDAP/servers/slapd/back-sql/rdbms_depend/timesten/
H A Dtttestdb_create.sql9 unique hash on (id) pages=100;
17 unique hash on (id) pages=100;
24 unique hash on (id) pages=100;
34 ) unique hash on (pers_id, doc_id) pages=100;
41 unique hash on (id) pages=100;
/macosx-10.9.5/JavaScriptCore-7537.78.1/profiler/
H A DCallIdentifier.h59 static unsigned hash(const CallIdentifier& key) function in struct:JSC::CallIdentifier::Hash
62 key.m_name.impl()->hash(),
63 key.m_url.impl()->hash(),
73 unsigned hash() const { return Hash::hash(*this); } function in struct:JSC::CallIdentifier
H A DProfilerOrigin.h71 unsigned hash() const;
89 inline unsigned Origin::hash() const
91 return WTF::PtrHash<Bytecodes*>::hash(m_bytecodes) + m_bytecodeIndex;
100 static unsigned hash(const Origin& key) { return key.hash(); }
/macosx-10.9.5/OpenLDAP-491.1/OpenLDAP/libraries/liblutil/
H A Dptest.c36 static char *hash[] = { variable
68 for( i= 0; hash[i]; i++ ) {
72 &passwd, &salt, hash[i] );
76 passwd = lutil_passwd_hash( &pw[j], hash[i] );
82 hash[i], pw[j].bv_val, pw[j].bv_len );
/macosx-10.9.5/SmartCardServices-55111/installPhase/scripts/
H A Dsc_auth12 # This script allows you to get the hash from a smartcard, and to create
36 $(basename $0) accept [-v] [-u user] [-d domain] -h hash # by known pubkey hash
38 $(basename $0) hash [-k keyname] # print hashes for keys on inserted card(s)
51 hash=
57 h) hash="$OPTARG";;
67 # Using "security dump-keychain", extract the public key hash for a key
81 if (matched) { hash=$2; sub("<blob>=0x", "", hash); print hash, nam
[all...]
/macosx-10.9.5/Heimdal-323.92.1/lib/ntlm/
H A Dapop.c71 uint8_t hash[CC_MD5_DIGEST_LENGTH]; local
78 CC_MD5_Final(hash, &ctx);
80 hex_encode(hash, sizeof(hash), &str);
196 uint8_t hash[CC_MD5_DIGEST_LENGTH]; local
201 CC_MD5_Final(hash, &ctx->ipad);
203 CC_MD5_Update(&ctx->opad, hash, sizeof(hash));
204 CC_MD5_Final(hash, &ctx->opad);
206 hex_encode(hash, sizeo
230 uint8_t hash[CC_MD5_DIGEST_LENGTH]; local
[all...]
/macosx-10.9.5/OpenLDAP-491.1/OpenLDAP/contrib/slapd-modules/passwd/sha2/
H A Dslapd-sha2.c38 unsigned char hash[SHA256_DIGEST_LENGTH]; local
43 SHA256_Final(hash, &ct);
47 hash,
60 unsigned char hash[SHA384_DIGEST_LENGTH]; local
65 SHA384_Final(hash, &ct);
69 hash,
81 unsigned char hash[SHA512_DIGEST_LENGTH]; local
86 SHA512_Final(hash, &ct);
90 hash,
102 struct berval *hash,
99 hash_sha256( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text ) argument
119 hash_sha384( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text ) argument
142 hash_sha512( const struct berval *scheme, const struct berval *passwd, struct berval *hash, const char **text ) argument
[all...]
/macosx-10.9.5/cxxfilt-11/cxxfilt/bfd/
H A Dhash.c0 /* hash.c -- hash table routines for BFD
33 BFD provides a simple set of hash table functions. Routines
34 are provided to initialize a hash table, to free a hash table,
35 to look up a string in a hash table and optionally create an
36 entry for it, and to traverse a hash table. There is
37 currently no routine to delete an string from a hash table.
39 The basic hash table does not permit any data to be stored
40 with a string. However, a hash tabl
422 unsigned long hash; local
738 _bfd_stringtab_add(struct bfd_strtab_hash *tab, const char *str, bfd_boolean hash, bfd_boolean copy) argument
[all...]
/macosx-10.9.5/CPANInternal-140/DBIx-Class/lib/DBIx/Class/ResultClass/
H A DHashRefInflator.pm26 to return a plain data hash-ref (or a list of such hash-refs if C<< $rs->all >> is used).
40 uses of that result source to be inflated to hash-refs - this approach is not
64 my $hash = {
65 # the main hash could be an undef if we are processing a skipped-over join
68 # the second arg is a hash of arrays for each prefetched relation
78 for (values %$hash) {
80 return $hash if @$_;
83 return $hash;
95 Inflates the result and prefetched data into a hash
[all...]
/macosx-10.9.5/CPANInternal-140/Template-Toolkit/lib/Template/
H A DVMethods.pm42 hash => \&text_hash,
68 hash => \&hash_hash,
87 hash => \&list_hash,
329 # hash virtual methods
334 my ($hash, $item) = @_;
337 $hash->{ $item };
374 my ($hash, $what) = @_;
376 return ($what eq 'keys') ? [ keys %$hash ]
377 : ($what eq 'values') ? [ values %$hash ]
378 : ($what eq 'each') ? [ %$hash ]
[all...]
/macosx-10.9.5/CPANInternal-140/Template-Toolkit-2.24/lib/Template/
H A DVMethods.pm42 hash => \&text_hash,
68 hash => \&hash_hash,
87 hash => \&list_hash,
329 # hash virtual methods
334 my ($hash, $item) = @_;
337 $hash->{ $item };
374 my ($hash, $what) = @_;
376 return ($what eq 'keys') ? [ keys %$hash ]
377 : ($what eq 'values') ? [ values %$hash ]
378 : ($what eq 'each') ? [ %$hash ]
[all...]
/macosx-10.9.5/WebCore-7537.78.1/css/
H A DSelectorFilter.cpp113 static inline void collectDescendantSelectorIdentifierHashes(const CSSSelector* selector, unsigned*& hash) argument
118 (*hash++) = selector->value().impl()->existingHash() * IdAttributeSalt;
122 (*hash++) = selector->value().impl()->existingHash() * ClassAttributeSalt;
126 (*hash++) = selector->tagQName().localName().impl()->existingHash() * TagNameSalt;
135 unsigned* hash = identifierHashes; local
146 collectDescendantSelectorIdentifierHashes(selector, hash);
156 collectDescendantSelectorIdentifierHashes(selector, hash);
159 if (hash == end)
163 *hash = 0;
/macosx-10.9.5/ksh-20/ksh/src/lib/libast/hash/
H A Dhashdump.c27 * hash table library
49 * dump hash table bucket info
67 if (!(b->hash & HASH_DELETED) && (!(tab->flags & HASH_VALUE) || b->value))
73 if (!(b->hash & HASH_DELETED) && (!(tab->flags & HASH_VALUE) || b->value))
83 if (b->hash & HASH_FLAGS)
86 if (b->hash & HASH_HIDES) sfprintf(sfstderr, "hides|");
87 if (b->hash & HASH_HIDDEN) sfprintf(sfstderr, "hidden|");
88 if (b->hash & HASH_KEEP) sfprintf(sfstderr, "keep|");
89 if (b->hash & HASH_OPAQUED) sfprintf(sfstderr, "opaque|");
130 * dump hash tabl
[all...]
/macosx-10.9.5/libarchive-29/libarchive/libarchive/
H A Darchive_write_disk_set_standard_lookup.c55 int hash; member in struct:bucket
60 static unsigned int hash(const char *);
78 * TODO: Replace these hash tables with simpler move-to-front LRU
79 * lists with a bounded size (128 items?). The hash is a bit faster,
108 h = hash(gname);
110 if (b->name != NULL && b->hash == h && strcmp(gname, b->name) == 0)
118 b->hash = h;
168 h = hash(uname);
170 if (b->name != NULL && b->hash == h && strcmp(uname, b->name) == 0)
178 b->hash
229 hash(const char *p) function
[all...]
/macosx-10.9.5/ruby-104/ruby/ext/objspace/
H A Dobjspace.c254 VALUE hash = (VALUE)arg; local
255 rb_hash_aset(hash, k, INT2FIX(0));
312 * ObjectSpace.count_objects_size([result_hash]) -> hash
320 * It returns a hash as:
327 * The contents of the returned hash is implementation defined.
339 VALUE hash; local
341 if (rb_scan_args(argc, argv, "01", &hash) == 1) {
342 if (!RB_TYPE_P(hash, T_HASH))
343 rb_raise(rb_eTypeError, "non-hash given");
352 if (hash
356 st_foreach(RHASH_TBL(hash), set_zero_i, hash); local
413 VALUE hash; local
430 st_foreach(RHASH_TBL(hash), set_zero_i, hash); local
556 VALUE hash = (VALUE)data; local
620 VALUE hash; local
631 st_foreach(RHASH_TBL(hash), set_zero_i, hash); local
[all...]
/macosx-10.9.5/smb-697.95.1/kernel/netsmb/
H A Dsmb_fid.c231 // insert our new node into the hash table
270 /* A quick little hash function
272 * See http://burtleburtle.net/bob/hash/doobs.html
277 uint32_t hash, i; local
279 for (hash = 0, i = 0; i < len; ++i)
281 hash += key[i];
282 hash += (hash << 10);
283 hash ^= (hash >>
[all...]
/macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/
H A Dpkcs12.c51 unsigned char *v, *I, hash[EVP_MAX_MD_SIZE]; local
113 EVP_DigestFinal_ex(ctx, hash, &size);
116 EVP_Digest(hash, size, hash, &size, md, NULL);
118 memcpy(outp, hash, min(outkeysize, size));
125 v[i] = hash[i % size];
/macosx-10.9.5/OpenLDAP-491.1/OpenLDAP/servers/slapd/
H A Dslappasswd.c51 " -h hash\tpassword scheme\n"
80 struct berval hash; local
188 hash = passwd;
192 lutil_passwd_hash( &passwd, scheme, &hash, &text );
193 if( hash.bv_val == NULL ) {
200 if( lutil_passwd( &hash, &passwd, NULL, &text ) ) {
207 printf( "%s%s" , hash.bv_val, newline );
/macosx-10.9.5/WebCore-7537.78.1/html/parser/
H A DHTMLIdentifier.cpp57 return table.contains(string->hash());
66 // computeHashAndMaskTop8Bits is the function StringImpl::hash() uses.
67 unsigned hash = StringHasher::computeHashAndMaskTop8Bits(characters, length); local
71 IdentifierTable::const_iterator it = table.find(hash);
74 // It's possible to have hash collisions between arbitrary strings and
127 unsigned hash = name->hash();
130 IdentifierTable::AddResult addResult = table.add(hash, entry);
134 // We expect some hash collisions, but only for identical strings.
136 // Note: If you hit this ASSERT, then we had a hash collisio
[all...]
/macosx-10.9.5/apr-30/apr/apr/tables/
H A Dapr_hash.c36 * The internal form of a hash table.
38 * The table is an array indexed by the hash of the key; collisions
39 * are resolved by hanging a linked list of hash entries off each
48 unsigned int hash; member in struct:apr_hash_entry_t
55 * Data structure for iterating through a hash table.
57 * We keep a pointer to the next hash entry here to allow the current
58 * hash entry to be freed or otherwise mangled between calls to
71 * The count of hash entries may be greater depending on the chosen
161 * Expanding a hash table
173 unsigned int i = hi->this->hash
184 unsigned int hash = 0; local
258 unsigned int hash; local
[all...]
/macosx-10.9.5/ppp-727.90.1/Helpers/pppd/
H A Dtdb.c71 #define BUCKET(hash) ((hash) % tdb->header.hash_size)
78 plus a separate data list for each hash value */
84 unsigned full_hash; /* the full 32 bit hash of the key */
181 /* the hash algorithm - turn a key into an integer
182 This is based on the hash agorithm from gdbm */
185 unsigned value; /* Used to compute the hash value. */
199 /* find the top of the hash chain for an open database */
200 static tdb_off tdb_hash_top(TDB_CONTEXT *tdb, unsigned hash) argument
203 hash
570 tdb_find(TDB_CONTEXT *tdb, TDB_DATA key, unsigned int hash, struct list_struct *rec) argument
643 unsigned hash; local
687 unsigned hash; local
724 unsigned hash; local
825 unsigned hash; local
875 unsigned hash, hbucket; local
930 unsigned hash; local
1036 unsigned hash; local
[all...]
/macosx-10.9.5/ruby-104/ruby/ext/openssl/
H A Dossl_x509name.c333 * Returns true if +name+ and +other+ refer to the same hash key.
348 * name.hash => integer
350 * The hash value returned is suitable for use as a certificate's filename in
357 unsigned long hash; local
361 hash = X509_NAME_hash(name);
363 return ULONG2NUM(hash);
371 * Returns an MD5 based hash used in OpenSSL 0.9.X.
377 unsigned long hash; local
381 hash = X509_NAME_hash_old(name);
383 return ULONG2NUM(hash);
430 VALUE utf8str, ptrstr, ia5str, hash; local
[all...]
/macosx-10.9.5/CPANInternal-140/DBIx-Class/lib/DBIx/Class/CDBICompat/
H A DConstraints.pm14 my %hash = map { $_ => 1 } @$how;
15 $class->add_constraint(list => $col => sub { exists $hash{ +shift } });
/macosx-10.9.5/CPANInternal-140/Params-Util/
H A DMakefile.PL66 my $hash = $_[1];
68 $hash->{XS} = {};
69 $hash->{C} = [];
71 return $hash;

Completed in 586 milliseconds

1234567891011>>