HomeSort by: relevance | last modified time | path
    Searched refs:hashp (Results 1 - 25 of 137) sorted by relevancy

1 2 3 4 5 6

  /src/lib/libc/db/hash/
hash.c 101 HTAB *hashp; local
112 if (!(hashp = calloc(1, sizeof(HTAB))))
114 hashp->fp = -1;
119 * field in the hashp structure needs to be accurate so that
122 hashp->flags = flags;
132 if ((hashp->fp = __dbopen(file, flags, mode, &statbuf)) == -1)
137 if (!(hashp = init_hash(hashp, file, info)))
142 hashp->hash = info->hash;
144 hashp->hash = __default_hash
249 HTAB *hashp; local
264 HTAB *hashp; local
450 HTAB *hashp; local
524 HTAB *hashp; local
537 HTAB *hashp; local
556 HTAB *hashp; local
727 HTAB *hashp; local
    [all...]
hash_buf.c 88 #define MRU hashp->bufhead.next
89 #define LRU hashp->bufhead.prev
91 #define MRU_INSERT(B) BUF_INSERT((B), &hashp->bufhead)
105 HTAB *hashp,
126 segment_ndx = addr & (hashp->SGSIZE - 1);
129 segp = hashp->dir[addr >> hashp->SSHIFT];
133 is_disk = is_disk_mask || !hashp->new_file;
137 bp = newbuf(hashp, addr, prev_bp);
139 __get_page(hashp, bp->page, addr, !prev_bp, is_disk, 0)
    [all...]
hash_page.c 87 _DIAGASSERT((size_t)HASH_BSIZE(hashp) >= temp); \
88 ((uint16_t *)(void *)(P))[1] = (uint16_t)(HASH_BSIZE(hashp) - temp); \
89 ((uint16_t *)(void *)(P))[2] = HASH_BSIZE(hashp); \
134 __delpair(HTAB *hashp, BUFHEAD *bufp, int ndx)
145 return (__big_delete(hashp, bufp));
149 newoff = HASH_BSIZE(hashp);
176 hashp->NKEYS--;
187 __split_page(HTAB *hashp, uint32_t obucket, uint32_t nbucket)
198 copyto = HASH_BSIZE(hashp);
199 off = HASH_BSIZE(hashp);
    [all...]
hash_bigkey.c 86 __big_insert(HTAB *hashp, BUFHEAD *bufp, const DBT *key, const DBT *val)
125 bufp = __add_ovflpage(hashp, bufp);
192 bufp = __add_ovflpage(hashp, bufp);
219 __big_delete(HTAB *hashp, BUFHEAD *bufp)
245 rbufp = __get_buf(hashp, (uint32_t)pageno, rbufp, 0);
247 __free_ovflpage(hashp, last_bfp);
277 temp = HASH_BSIZE(hashp) - PAGE_META(n);
280 OFFSET(bp) = HASH_BSIZE(hashp);
284 __free_ovflpage(hashp, rbufp);
286 __free_ovflpage(hashp, last_bfp)
    [all...]
hash.h 179 (B) + hashp->HDRPAGES + \
180 ((B) ? hashp->SPARES[__log2((uint32_t)((B)+1))-1] : 0)
  /src/external/gpl3/binutils/dist/bfd/
hash.c 553 struct bfd_hash_entry *hashp; local
559 for (hashp = table->table[_index];
560 hashp != NULL;
561 hashp = hashp->next)
563 if (hashp->hash == hash
564 && strcmp (hashp->string, string) == 0)
565 return hashp;
608 struct bfd_hash_entry *hashp; local
611 hashp = (*table->newfunc) (NULL, table, string)
    [all...]
merge.c 239 struct sec_merge_hash_entry *hashp; local
241 hashp = (struct sec_merge_hash_entry *)
243 if (hashp == NULL)
246 memcpy (hashp->str, string, len);
247 hashp->len = len;
248 hashp->alignment = 0;
249 hashp->u.suffix = NULL;
250 hashp->next = NULL;
270 table->values[_index] = hashp;
272 return hashp;
398 struct sec_merge_hash_entry *hashp; local
    [all...]
linker.c 1403 struct bfd_link_hash_entry **hashp);
1420 HASHP, if not NULL, is a place to store the created hash table
1421 entry; if *HASHP is not NULL, the caller has already looked up
1422 the hash table entry, and stored it in *HASHP. */
1434 struct bfd_link_hash_entry **hashp)
1482 if (hashp != NULL && *hashp != NULL)
1483 h = *hashp;
1492 if (hashp != NULL)
1493 *hashp = NULL
    [all...]
  /src/external/gpl3/binutils.old/dist/bfd/
hash.c 553 struct bfd_hash_entry *hashp; local
559 for (hashp = table->table[_index];
560 hashp != NULL;
561 hashp = hashp->next)
563 if (hashp->hash == hash
564 && strcmp (hashp->string, string) == 0)
565 return hashp;
608 struct bfd_hash_entry *hashp; local
611 hashp = (*table->newfunc) (NULL, table, string)
    [all...]
merge.c 241 struct sec_merge_hash_entry *hashp; local
243 hashp = (struct sec_merge_hash_entry *)
245 if (hashp == NULL)
248 memcpy (hashp->str, string, len);
249 hashp->len = len;
250 hashp->alignment = 0;
251 hashp->u.suffix = NULL;
252 hashp->next = NULL;
272 table->values[_index] = hashp;
274 return hashp;
400 struct sec_merge_hash_entry *hashp; local
    [all...]
linker.c 1401 struct bfd_link_hash_entry **hashp);
1418 HASHP, if not NULL, is a place to store the created hash table
1419 entry; if *HASHP is not NULL, the caller has already looked up
1420 the hash table entry, and stored it in *HASHP. */
1432 struct bfd_link_hash_entry **hashp)
1480 if (hashp != NULL && *hashp != NULL)
1481 h = *hashp;
1490 if (hashp != NULL)
1491 *hashp = NULL
    [all...]
  /src/external/gpl3/gdb.old/dist/bfd/
hash.c 553 struct bfd_hash_entry *hashp; local
559 for (hashp = table->table[_index];
560 hashp != NULL;
561 hashp = hashp->next)
563 if (hashp->hash == hash
564 && strcmp (hashp->string, string) == 0)
565 return hashp;
608 struct bfd_hash_entry *hashp; local
611 hashp = (*table->newfunc) (NULL, table, string)
    [all...]
merge.c 241 struct sec_merge_hash_entry *hashp; local
243 hashp = (struct sec_merge_hash_entry *)
245 if (hashp == NULL)
248 memcpy (hashp->str, string, len);
249 hashp->len = len;
250 hashp->alignment = 0;
251 hashp->u.suffix = NULL;
252 hashp->next = NULL;
272 table->values[_index] = hashp;
274 return hashp;
400 struct sec_merge_hash_entry *hashp; local
    [all...]
linker.c 1384 HASHP, if not NULL, is a place to store the created hash table
1385 entry; if *HASHP is not NULL, the caller has already looked up
1386 the hash table entry, and stored it in *HASHP. */
1398 struct bfd_link_hash_entry **hashp)
1446 if (hashp != NULL && *hashp != NULL)
1447 h = *hashp;
1456 if (hashp != NULL)
1457 *hashp = NULL;
1471 if (hashp != NULL
    [all...]
libcoff.h 1006 value, string, cp, coll, hashp)\
1008 (info, abfd, name, flags, section, value, string, cp, coll, hashp))
  /src/external/gpl3/gdb/dist/bfd/
hash.c 553 struct bfd_hash_entry *hashp; local
559 for (hashp = table->table[_index];
560 hashp != NULL;
561 hashp = hashp->next)
563 if (hashp->hash == hash
564 && strcmp (hashp->string, string) == 0)
565 return hashp;
608 struct bfd_hash_entry *hashp; local
611 hashp = (*table->newfunc) (NULL, table, string)
    [all...]
merge.c 241 struct sec_merge_hash_entry *hashp; local
243 hashp = (struct sec_merge_hash_entry *)
245 if (hashp == NULL)
248 memcpy (hashp->str, string, len);
249 hashp->len = len;
250 hashp->alignment = 0;
251 hashp->u.suffix = NULL;
252 hashp->next = NULL;
272 table->values[_index] = hashp;
274 return hashp;
400 struct sec_merge_hash_entry *hashp; local
    [all...]
linker.c 1401 struct bfd_link_hash_entry **hashp);
1418 HASHP, if not NULL, is a place to store the created hash table
1419 entry; if *HASHP is not NULL, the caller has already looked up
1420 the hash table entry, and stored it in *HASHP. */
1432 struct bfd_link_hash_entry **hashp)
1480 if (hashp != NULL && *hashp != NULL)
1481 h = *hashp;
1490 if (hashp != NULL)
1491 *hashp = NULL
    [all...]
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
dsl_bookmark.c 38 char *hashp; local
42 hashp = strchr(fullname, '#');
43 if (hashp == NULL)
46 *shortnamep = hashp + 1;
49 (void) strlcpy(buf, fullname, hashp - fullname + 1);
zfs_ioctl.c 1080 char *hashp = strchr(name, '#'); local
1082 if (hashp == NULL) {
1086 *hashp = '\0';
1089 *hashp = '#';
1106 char *hashp = strchr(name, '#'); local
1109 if (hashp == NULL) {
1114 *hashp = '\0';
1117 *hashp = '#';
  /src/external/gpl2/xcvs/dist/src/
hash.c 30 hashp (const char *key) function
285 hashval = hashp (p->key);
357 head = list->hasharray[hashp (key)];
386 head = list->hasharray[hashp (key)];
  /src/sys/fs/nfs/server/
nfs_nfsdserv.c 504 u_long *hashp; local
523 nfsvno_setpathbuf(&named, &bufp, &hashp);
524 error = nfsrv_parsename(nd, bufp, hashp, &named.ni_pathlen);
990 u_long *hashp; local
1000 nfsvno_setpathbuf(&named, &bufp, &hashp);
1001 error = nfsrv_parsename(nd, bufp, hashp, &named.ni_pathlen);
1160 u_long *hashp, cnflags; local
1211 nfsvno_setpathbuf(&named, &bufp, &hashp);
1212 error = nfsrv_parsename(nd, bufp, hashp, &named.ni_pathlen);
1373 u_long *hashp; local
1459 u_long *hashp; local
1629 u_long *hashp; local
1730 u_long *hashp; local
1851 u_long *hashp; local
2594 u_long *hashp; local
3352 u_long *hashp; local
    [all...]
nfs_nfsdsubs.c 1836 nfsrv_parsename(struct nfsrv_descript *nd, char *bufp, u_long *hashp,
1847 if (hashp != NULL)
1848 *hashp = 0;
2029 if (hashp != NULL)
2030 *hashp = hash;
  /src/sys/kern/
vfs_vnode.c 1411 struct hashhead *hashp; local
1416 hashp = &vcache_hashtab[hash & vcache_hashmask];
1417 SLIST_FOREACH(vip, hashp, vi_hash) {
  /src/external/gpl3/gcc/dist/gcc/
function.cc 5725 /* Add a list of INSNS to the hash HASHP, possibly allocating HASHP
5729 record_insns (rtx_insn *insns, rtx end, hash_table<insn_cache_hasher> **hashp)
5732 hash_table<insn_cache_hasher> *hash = *hashp;
5735 *hashp = hash = hash_table<insn_cache_hasher>::create_ggc (17);

Completed in 113 milliseconds

1 2 3 4 5 6