stbl
static void stbl(void);
stbl();
static const scn_tbl_t stbl[] = {
tbl = &stbl[0];
for (ndx = 1, bkt = 0; bkt < stbl->t_size; bkt++) {
for (ent = stbl->t_entry[bkt]; ent; ent = ent->e_next) {
for (bkt = 0; bkt < stbl->t_size; bkt++) {
for (ent = stbl->t_entry[bkt]; ent; ent = ent->e_next) {
for (bkt = 0; bkt < stbl->t_size; bkt++) {
for (ent = stbl->t_entry[bkt]; ent; ent = ent->e_next) {
Hash_tbl *stbl = crle->c_strtbl;
Hash_tbl *stbl = crle->c_strtbl;
if ((ent = get_hash(stbl, (Addr)ndir, 0,
if ((ent = get_hash(stbl, (Addr)odir, 0,
Hash_tbl *stbl = crle->c_strtbl;
if ((rent = get_hash(stbl, (Addr)npath, 0,
if ((ent = get_hash(stbl, (Addr)nfile, ndent->e_id,
if ((rent = get_hash(stbl, (Addr)opath, 0,
if ((ent = get_hash(stbl, (Addr)ofile, odent->e_id,
Hash_tbl *stbl = crle->c_strtbl;
if ((ent = get_hash(stbl, (Addr)name, 0, HASH_FND_ENT)) != NULL) {
hentry_t *stbl = my_malloc(elem * sizeof (hentry_t), NULL);
stbl[i].prev = tmp->prev;
stbl[i].next = tmp->next;
stbl[i].lib = tmp->lib;
stbl[i].key = tmp->key;
stbl[i].count = tmp->count;
qsort((void *)stbl, elem, sizeof (hentry_t),
(void) printf("%-20s %-40s %ld\n", stbl[i].lib,
stbl[i].key, stbl[i].count);
free(stbl);
s8 *stbl;
return (ldtentry_t *)&dtroot->slot[(int)dtroot->header.stbl[jfs.sindex++]];
stbl = (s8 *)&de[(int)dtpage->header.stblindex];
return &de[(int)stbl[jfs.sindex++]];
xd = &((idtentry_t *)dtr->slot)[(int)dtr->header.stbl[0]].xd;
s8 stbl[8]; /* 8: sorted entry index table */
struct stbl *stbl;
stbl = (struct stbl *)map->udm_spaddr[0];
te = (struct stbl_entry *)&stbl->stbl_entry;
entry_count = SWAP_16(stbl->stbl_len);
struct stbl *stbl;
stbl = (struct stbl *)bp->b_un.b_addr;
if (strncmp(stbl->stbl_si.reg_id, UDF_SPAR_TBL, 23) != 0) {
te = (struct stbl_entry *)&stbl->stbl_entry;
tbl_len = SWAP_16(stbl->stbl_len);
printf("%x %x\n", tbl_len, SWAP_32(stbl->stbl_seqno));