Searched refs:hash (Results 276 - 300 of 1232) sorted by relevance

<<11121314151617181920>>

/macosx-10.10.1/zsh-61/zsh/Src/Modules/
H A Ddb_gdbm.c90 tied_param->u.hash->tmpdata = (void *)dbf;
108 dbf = (GDBM_FILE)(pm->u.hash->tmpdata);
110 /* free(pm->u.hash->tmpdata); */
127 dbf = (GDBM_FILE)(pm->u.hash->tmpdata);
150 dbf = (GDBM_FILE)(pm->u.hash->tmpdata);
164 dbf = (GDBM_FILE)(pm->u.hash->tmpdata);
183 pm->u.hash = ht;
/macosx-10.10.1/OpenLDAP-499.27/OpenLDAP/servers/slapd/
H A Dpasswd.c54 struct berval id = {0, NULL}, hash, *rsp = NULL; local
320 slap_passwd_hash_type( &qpw->rs_new, &hash, hashes[i], &rs->sr_text );
321 if ( hash.bv_len == 0 ) {
323 rs->sr_text = "password hash failed";
327 ml->sml_values[i] = hash;
702 char *hash,
708 assert( hash != NULL );
710 lutil_passwd_hash( cred , hash, new, text );
718 char *hash = NULL; local
720 hash
699 slap_passwd_hash_type( struct berval * cred, struct berval * new, char *hash, const char **text ) argument
[all...]
/macosx-10.10.1/xnu-2782.1.97/libkern/c++/
H A DOSSymbol.cpp86 unsigned int hash = 0; local
91 if (!*s) break; len++; hash ^= *s++;
92 if (!*s) break; len++; hash ^= *s++ << 8;
93 if (!*s) break; len++; hash ^= *s++ << 16;
94 if (!*s) break; len++; hash ^= *s++ << 24;
97 *hashP = hash;
269 unsigned int j, inLen, hash; local
272 hashSymbol(cString, &hash, &inLen); inLen++;
273 thisBucket = &buckets[hash % nBuckets];
302 unsigned int j, inLen, hash; local
361 unsigned int j, inLen, hash; local
[all...]
/macosx-10.10.1/apr-32/apr-util/apr-util/dbm/sdbm/
H A Dsdbm.c247 register long hash; local
264 if ((status = getpage(db, (hash = exhash(key)))) == APR_SUCCESS) {
280 if ((status = makroom(db, hash, need)) != APR_SUCCESS)
302 static apr_status_t makroom(apr_sdbm_t *db, long hash, int need) argument
319 newp = (hash & db->hmask) | (db->hmask + 1);
329 if (hash & (db->hmask + 1)) {
356 + ((hash & (db->hmask + 1)) ? 2 : 1);
444 static apr_status_t getpage(apr_sdbm_t *db, long hash) argument
454 dbit = 2 * dbit + ((hash & (1 << hbit++)) ? 2 : 1);
461 pagb = hash
[all...]
/macosx-10.10.1/xnu-2782.1.97/bsd/netinet/
H A Dtcp_lro.c128 tcp_lro_matching_tuple(struct ip* ip_hdr, struct tcphdr *tcp_hdr, int *hash, argument
136 *hash = LRO_HASH(ip_hdr->ip_src.s_addr, ip_hdr->ip_dst.s_addr,
139 *flow_id = lro_flow_map[*hash];
204 int hash, u_int32_t timestamp, int payload_len)
210 flow->lr_hash_map = hash;
215 lro_flow_map[hash] = flow_id;
343 int drop_hdrlen, int hash, struct tcpopt *topt,
356 if (lro_flow_map[hash] != TCP_LRO_FLOW_UNINIT) {
360 candidate_flow = lro_flow_map[hash];
396 tcp_lro_init_flow(candidate_flow, ip_hdr, tcp_hdr, hash,
203 tcp_lro_init_flow(int flow_id, struct ip* ip_hdr, struct tcphdr *tcp_hdr, int hash, u_int32_t timestamp, int payload_len) argument
341 tcp_lro_insert_flow(struct mbuf *lro_mb, struct ip *ip_hdr, struct tcphdr *tcp_hdr, int payload_len, int drop_hdrlen, int hash, struct tcpopt *topt, u_int32_t *tsval, u_int32_t *tsecr) argument
408 int hash; local
769 int hash; local
824 int hash, flow_id; local
854 int hash, flow_id; local
[all...]
/macosx-10.10.1/bind9-45.101/bind9/lib/dns/
H A Dcompress.c139 unsigned int labels, hash, n; local
156 hash = dns_name_hash(&tname, ISC_FALSE) %
158 for (node = cctx->table[hash]; node != NULL; node = node->next)
203 unsigned int hash; local
224 hash = dns_name_hash(&tname, ISC_FALSE) %
243 node->next = cctx->table[hash];
244 cctx->table[hash] = node;
/macosx-10.10.1/libmalloc-53.1.1/src/
H A Dstack_logging.c74 unsigned hash = base + (((*uniquedParent) << 4) ^ (thisPC >> 2)) % (base - 1); // modulo odd number for hashing local
77 unsigned *head = table + hash*2;
83 *uniquedParent = hash;
88 *uniquedParent = hash;
91 hash++;
92 if (hash == base*2) hash = base;
/macosx-10.10.1/xnu-2782.1.97/bsd/dev/dtrace/
H A Dfbt.c81 fbt_probe_t *fbt = parg, *next, *hash, *last; local
90 hash = fbt_probetab[ndx];
92 while (hash != fbt) {
93 ASSERT(hash != NULL);
94 last = hash;
95 hash = hash->fbtp_hashnext;
/macosx-10.10.1/xnu-2782.1.97/libkern/kxld/
H A Dkxld_dict.c79 kxld_dict_init(KXLDDict * dict, kxld_dict_hash hash, kxld_dict_cmp cmp, argument
87 check(hash);
103 dict->hash = hash;
121 dict->hash = NULL;
186 * its hash value and its actual bucket may have been deleted since it was
197 base = idx = dict->hash(dict, key);
265 * Increases the hash table's capacity by 2N+1. Uses dictionary API. Not
320 base = idx = dict->hash(dict, key);
406 * This is Daniel Bernstein's hash algorith
[all...]
/macosx-10.10.1/emacs-93/emacs/lib-src/
H A Debrowse.c413 /* The size of the hash tables for classes.and members. Should be
418 /* The hash table for class symbols. */
464 /* Keywords are lookup up in a hash table of their own. */
720 static, or per-instance member etc. HASH is a hash code for the
725 find_member (cls, name, var, sc, hash)
729 unsigned hash;
761 if (p->list == list && p->param_hash == hash && streq (name, p->name))
771 a hash code for the parameter list of the member, if it's a
779 add_member_decl (cls, name, regexp, pos, hash, var, sc, vis, flags)
784 unsigned hash;
1739 unsigned hash; local
2512 unsigned hash = 0; local
2652 unsigned hash = 0; local
3296 unsigned hash = 0; local
[all...]
/macosx-10.10.1/Security-57031.1.35/Security/include/security_cryptkit/
H A DfeePublicKey.c26 * ECDSA now uses SHA-1 hash. Imcompatible with old ECDSA signatures.
477 feeHash hash; local
488 hash = feeHashAlloc();
494 feeHashFree(hash);
499 * Get Pm to salt hash object
502 feeHashAddData(hash, Pm, PmLen);
505 * Now hash the data proper, then sign the hash
507 feeHashAddData(hash, data, dataLen);
509 feeHashDigest(hash),
531 feeHash hash; local
815 feeHash *hash = NULL; // a malloc'd array local
[all...]
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_cryptkit/lib/
H A DfeePublicKey.c26 * ECDSA now uses SHA-1 hash. Imcompatible with old ECDSA signatures.
477 feeHash hash; local
488 hash = feeHashAlloc();
494 feeHashFree(hash);
499 * Get Pm to salt hash object
502 feeHashAddData(hash, Pm, PmLen);
505 * Now hash the data proper, then sign the hash
507 feeHashAddData(hash, data, dataLen);
509 feeHashDigest(hash),
531 feeHash hash; local
815 feeHash *hash = NULL; // a malloc'd array local
[all...]
/macosx-10.10.1/syslog-267/aslcommon/
H A Dasl_memory.c175 mem_string_new(const char *str, uint32_t len, uint32_t hash) argument
186 out->hash = hash;
194 * Find the first hash greater than or equal to a given hash in the string cache.
195 * Return s->string_count if hash is greater that or equal to last hash in the string cache.
202 asl_memory_string_cache_search_hash(asl_memory_t *s, uint32_t hash) argument
211 if (hash < ms->hash) retur
263 uint32_t i, where, hash, len; local
[all...]
/macosx-10.10.1/ncurses-44/ncurses/ncurses/tty/
H A Dhashmap.c49 sped up by hashing. If a line hash is unique in both screens, those
53 We don't worry about false pairs produced by hash collisions, on the
115 hash(NCURSES_CH_T * text) function
292 /* re-hash only changed lines */
295 newhash[i] = hash(NEWTEXT(i));
298 /* re-hash all */
306 newhash[i] = hash(NEWTEXT(i));
307 oldhash[i] = hash(OLDTEXT(i));
313 if (newhash[i] != hash(NEWTEXT(i)))
315 if (oldhash[i] != hash(OLDTEX
[all...]
/macosx-10.10.1/cxxfilt-11/cxxfilt/bfd/
H A Dmerge.c33 /* An entry in the section merge hash table. */
52 /* Next entity in the hash table. */
56 /* The section merge hash table. */
79 /* A hash table used to hold section content. */
91 /* A hash table used to hold section content. */
130 /* Look up an entry in a section merge hash table. */
137 register unsigned long hash; local
143 hash = 0;
152 hash += c + (c << 17);
153 hash
[all...]
H A Delf32-m68hc1x.c60 /* Create a 68HC11/68HC12 ELF linker hash table. */
81 /* Init the stub hash table too. */
101 /* Free the derived linker hash table. */
104 m68hc11_elf_bfd_link_hash_table_free (struct bfd_link_hash_table *hash) argument
107 = (struct m68hc11_elf_link_hash_table *) hash;
111 _bfd_generic_link_hash_table_free (hash);
114 /* Assorted hash table functions. */
116 /* Initialize an entry in the stub hash table. */
149 /* Add a new stub entry to the stub hash. Not all fields of the new
158 /* Enter this entry into the linker stub hash tabl
428 struct elf_link_hash_entry *hash; local
[all...]
/macosx-10.10.1/ruby-106/ruby/
H A Dst.c1 /* This is a public domain general purpose hash table package written by Peter Moore @ UCB. */
21 st_index_t hash; member in struct:st_table_entry
29 st_index_t hash; member in struct:st_packed_entry
87 #define do_hash(key,table) (st_index_t)(*(table)->type->hash)((key))
116 #define PHASH(table, i) PACKED_ENT((table), (i)).hash
353 ((ptr) != 0 && ((ptr)->hash != (hash_val) || !EQUAL((table), (key), (ptr)->key)))
475 entry->hash = hash_val;
528 st_index_t hash = packed_bins[i].hash; local
529 entry = new_entry(&tmp_table, key, val, hash,
918 st_index_t hash; local
1008 st_data_t key, val, hash; local
[all...]
/macosx-10.10.1/BerkeleyDB-21/db/java/src/com/sleepycat/db/
H A DDatabaseEntry.java680 * Returns a hash code based on the data value.
683 int hash = 0;
686 hash += data[offset + i];
689 return hash;
/macosx-10.10.1/CPANInternal-159.1/File-ExtAttr-1.09/lib/File/ExtAttr/
H A DTie.pm27 through a tied hash. Creating a new key creates a new extended attribute
41 given here will be passed to all operations on the tied hash.
42 Only the C<namespace> flag makes sense. The hash will be tied
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/
H A Dhmac.c152 void *hash, unsigned int *hash_len)
159 HMAC_Final(&ctx, hash, hash_len);
161 return hash;
149 HMAC(const EVP_MD *md, const void *key, size_t key_size, const void *data, size_t data_size, void *hash, unsigned int *hash_len) argument
/macosx-10.10.1/JavaScriptCore-7600.1.17/bytecode/
H A DCodeOrigin.cpp100 result += WTF::PtrHash<JSCell*>::hash(codeOrigin.inlineCallFrame->executable.get());
149 CodeBlockHash InlineCallFrame::hash() const function in class:JSC::InlineCallFrame
152 specializationKind())->hash();
H A DDFGExitProfile.h100 unsigned hash() const function in class:JSC::DFG::FrequentExitSite
128 static unsigned hash(const FrequentExitSite& key) { return key.hash(); } function in struct:JSC::DFG::FrequentExitSiteHash
/macosx-10.10.1/OpenSSH-189/osslshim/ossl/
H A Dossl-hmac.c177 void *hash, unsigned int *hash_len)
184 HMAC_Final(&ctx, hash, hash_len);
186 return (hash);
174 HMAC(const EVP_MD *md, const void *key, size_t key_size, const void *data, size_t data_size, void *hash, unsigned int *hash_len) argument
/macosx-10.10.1/Security-57031.1.35/Security/include/security_codesigning/
H A Dcodedirectory.h36 // signature blobs; ad-hoc signatures simply record the SHA-1 hash of the
69 // Special hash slot values. In a CodeDirectory, these show up at negative slot
83 // These values are potentially present in the CodeDirectory hash array
100 // These values are NOT used in the CodeDirectory hash array. They are used as
115 // Special hash slot attributes.
131 // At the heart of a CodeDirectory lies a packed array of hash digests.
156 // to the Builder to place the new data (right) before the hash array. Remember to check
172 Endian<uint32_t> hashOffset; // offset of hash slot element at index zero
174 Endian<uint32_t> nSpecialSlots; // number of special hash slots
175 Endian<uint32_t> nCodeSlots; // number of ordinary (code) hash slot
[all...]
H A Dcsgeneric.cpp88 // Identify a guest by returning its StaticCode and running CodeDirectory hash.
121 HashDataOut hash; local
125 CALL(host, identifyGuest, guest, path, hash, &hashLength, &attr, &attrLength);
127 cdhash = makeCFData(hash, hashLength);

Completed in 379 milliseconds

<<11121314151617181920>>