Searched defs:tab (Results 1 - 25 of 67) sorted by relevance

123

/illumos-gate/usr/src/lib/libast/common/hash/
H A Dhashlast.c24 /* OBSOLETE 19960229 -- use tab->root->last.{table|bucket} */
40 hashlast(Hash_table_t* tab) argument
42 return(tab->root->last.bucket);
H A Dhashwalk.c37 hashwalk(Hash_table_t* tab, int flags, register int (*walker)(const char*, char*, void*), void* handle) argument
43 if (!(pos = hashscan(tab, flags)))
47 if ((v = (*walker)(hashname(b), (tab->flags & HASH_VALUE) ? b->value : (char*)b, handle)) < 0)
H A Dhashalloc.c43 register Hash_table_t* tab; local
65 if (!(tab = (Hash_table_t*)(*region)(handle, NiL, sizeof(Hash_table_t), 0)))
67 memset(tab, 0, sizeof(Hash_table_t));
69 else if (!(tab = newof(0, Hash_table_t, 1, 0)))
71 tab->bucketsize = (sizeof(Hash_header_t) + sizeof(char*) - 1) / sizeof(char*);
74 tab->flags = ref->flags & ~HASH_RESET;
75 tab->root = ref->root;
82 if (!(tab->root = (Hash_root_t*)(*region)(handle, NiL, sizeof(Hash_root_t), 0)))
84 memset(tab->root, 0, sizeof(Hash_root_t));
86 else if (!(tab
[all...]
H A Dhashdump.c53 dumpbucket(register Hash_table_t* tab, int flags) argument
62 sx = tab->table + tab->size;
63 for (sp = tab->table; sp < sx; sp++)
67 if (!(b->hash & HASH_DELETED) && (!(tab->flags & HASH_VALUE) || b->value))
71 sfprintf(sfstderr, "%5d %2d :", sp - tab->table, n);
73 if (!(b->hash & HASH_DELETED) && (!(tab->flags & HASH_VALUE) || b->value))
75 if (n = tab->root->namesize)
91 if (tab->flags & HASH_VALUE) sfprintf(sfstderr, "=0x%08lx", (long)b->value);
104 dumptable(register Hash_table_t* tab, registe argument
136 register Hash_table_t* tab; local
164 hashdump(register Hash_table_t* tab, int flags) argument
[all...]
H A Dhashfree.c40 hashfree(register Hash_table_t* tab) argument
53 if (!tab) return(0);
54 if (tab->table)
58 if (tab->root->local->free)
60 if (tab->root->flags & HASH_BUCKET) freebucket = tab->root->local->free;
61 else freevalue = tab->root->local->free;
63 if (region = tab->root->local->region)
64 handle = tab->root->local->handle;
65 sx = &tab
[all...]
H A Dhashscan.c37 * pos = hashscan(tab, flags);
47 hashscan(register Hash_table_t* tab, register int flags) argument
54 pos->tab = tab->root->last.table = tab;
56 pos->slot = tab->table - 1;
57 pos->limit = tab->table + tab->size;
58 if (tab->scope && !(flags & HASH_NOSCOPE))
65 if (tab
[all...]
H A Dhashsize.c38 hashsize(register Hash_table_t* tab, int size) argument
49 if (size > 0 && size != tab->size && !(size & (size - 1)))
51 if (region = tab->root->local->region)
53 handle = tab->root->local->handle;
57 if (!new_s) tab->flags |= HASH_FIXED;
60 old_sx = (old_s = tab->table) + tab->size;
61 tab->size = size;
70 HASHMOD(tab, index);
75 if ((tab
[all...]
H A Dhashlook.c37 hashlook(register Hash_table_t* tab, const char* name, long flags, const char* value) argument
62 HASHMOD(tab, n);
63 for (b = tab->table[n]; b; b = b->next)
70 if (!(tab = tab->scope) || (flags & HASH_NOSCOPE))
75 tab->root->accesses++;
76 top = tab;
77 last = &tab->root->last;
80 last->table = tab;
89 else if (tab
[all...]
/illumos-gate/usr/src/lib/libast/common/string/
H A Dstrlook.c31 * return pointer to name in tab with element size siz
34 * the last name in tab must be 0
40 strlook(const void* tab, size_t siz, register const char* name) argument
42 register char* t = (char*)tab;
H A Dstrpsearch.c40 * name in the CC_ASCII sorted tab of num elements of
53 strpsearch(const void* tab, size_t num, size_t siz, const char* name, char** next) argument
55 register char* lo = (char*)tab;
H A Dstrsearch.c32 * name in the (*comparf*)() sorted tab of num elements of
40 strsearch(const void* tab, size_t num, size_t siz, Strcmp_f comparf, const char* name, void* context) argument
42 char* lo = (char *)tab;
H A Dstropt.c32 * parse option expression in s using options in tab with element size siz
33 * first element in tab must be a char*
43 * p matching tab entry, or name if no table
49 * names in s may be shorter than tab names
50 * longer names must have a prefix that matches a tab name
56 stropt(const char* as, const void* tab, int siz, int(*f)(void*, const void*, int, const char*), void* a) argument
89 if (tab)
91 for (p = (char**)tab; t = *p; p = (char**)((char*)p + siz))
H A Dccmap.c43 static const unsigned char tab[] = variable
609 #define MAPS (sizeof(tab)/MAP)
637 return (unsigned char*)tab;
658 return (unsigned char*)tab + MAP * (2 * (o - 1));
660 return (unsigned char*)tab + MAP * (2 * (i - 1) + 1);
668 a = (unsigned char*)tab + MAP * (2 * (o - 1));
669 z = (unsigned char*)tab + MAP * (2 * (i - 1) + 1);
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/nwamcfg/
H A DMakefile30 OBJS= nwamcfg.o nwamcfg_lex.o nwamcfg_grammar.tab.o
38 CLEANFILES += nwamcfg_lex.c nwamcfg_grammar.tab.c nwamcfg_grammar.tab.h
59 nwamcfg_lex.c: nwamcfg_lex.l nwamcfg_grammar.tab.h nwamcfg.h
62 nwamcfg_grammar.tab.h + nwamcfg_grammar.tab.c: nwamcfg_grammar.y nwamcfg.h
65 nwamcfg_lex.o nwamcfg_grammar.tab.o := CCVERBOSE =
/illumos-gate/usr/src/lib/libast/common/tm/
H A Dtmlex.c35 * return the tab table index that matches s ignoring case and .'s
38 * ntab and nsuf are the number of elements in tab and suf,
48 tmlex(register const char* s, char** e, char** tab, int ntab, char** suf, int nsuf) argument
54 for (p = tab, n = ntab; n-- && (x = *p); p++)
56 return p - tab;
57 if (tm_info.format != tm_data.format && tab >= tm_info.format && tab < tm_info.format + TM_NFORM)
59 tab = tm_data.format + (tab - tm_info.format);
60 if (suf && tab >
[all...]
/illumos-gate/usr/src/cmd/zonecfg/
H A DMakefile29 OBJS= zonecfg.o zonecfg_lex.o zonecfg_grammar.tab.o
44 CLEANFILES += zonecfg_lex.c zonecfg_grammar.tab.c zonecfg_grammar.tab.h
68 zonecfg_lex.c: zonecfg_lex.l zonecfg_grammar.tab.h zonecfg.h
71 zonecfg_grammar.tab.h zonecfg_grammar.tab.c: zonecfg_grammar.y zonecfg.h
74 zonecfg_lex.o zonecfg_grammar.tab.o := CCVERBOSE =
/illumos-gate/usr/src/cmd/sh/
H A Dmac.h49 #define tab() prc(TAB) macro
/illumos-gate/usr/src/lib/fm/topo/modules/common/pcibus/
H A Ddid_hash.c132 did_hash_t *tab = (did_hash_t *)topo_mod_getspecific(mp); local
134 int idx = did_dnhash(key) % tab->dph_hashlen;
136 tab->dph_nelems++;
138 topo_mod_dprintf(tab->dph_mod, "Insert [key=%p] into %p, bucket %d\n",
139 key, (void *)tab, idx);
140 if (tab->dph_hash[idx] == NULL) {
141 tab->dph_hash[idx] = new;
142 topo_mod_dprintf(tab->dph_mod, "first entry.\n");
147 for (assertchk = tab->dph_hash[idx];
151 new->dp_next = tab
160 did_hash_t *tab = (did_hash_t *)topo_mod_getspecific(mp); local
[all...]
/illumos-gate/usr/src/cmd/look/
H A Dlook.c24 int tab; variable
51 tab = argv[1][1];
52 if(tab)
78 if (tab != 0) {
79 if ((ptr = strchr(wstring, tab)) != NULL) {
/illumos-gate/usr/src/lib/libsum/common/
H A Dsum-crc.c51 const Crcnum_t *tab; /* use |const| to give the compiler a hint that the data won't change */ member in struct:Crc_s
57 #define CRC(p,s,c) (s = (s >> 8) ^ (p)->tab[(s ^ (c)) & 0xff])
58 #define CRCROTATE(p,s,c) (s = (s << 8) ^ (p)->tab[((s >> 24) ^ (c)) & 0xff])
143 sum->tab=posix_cksum_tab;
204 sum->tab=sum->tabdata;
/illumos-gate/usr/src/cmd/bnu/
H A Duucheck.c64 struct tab struct
68 } tab[] = variable in typeref:struct:tab
106 struct tab *tabptr;
139 for (tabptr = tab; tabptr->name != NULL; tabptr++) {
/illumos-gate/usr/src/cmd/mandoc/
H A Dterm_ascii.c292 static const char *tab[] = { local
359 if ((size_t)uc < sizeof(tab)/sizeof(tab[0]))
360 return tab[uc];
/illumos-gate/usr/src/lib/libpp/common/
H A Dppop.c66 inithash(register Hash_table_t* tab, register struct ppkeyword* key) argument
74 hashput(tab, s, key->value);
1499 Hash_table_t* tab; local
1502 tab = pp.symtab;
1503 pp.symtab = hashalloc(NiL, HASH_set, tab ? HASH_ALLOCATE : 0, HASH_compare, trunccomp, HASH_hash, trunchash, HASH_name, "truncate", 0);
1504 if (tab && (pos = hashscan(tab, 0)))
/illumos-gate/usr/src/common/util/
H A Dsscanf.c538 set_ccl(char *tab, const uchar_t *fmt) argument
550 /* XXX: Will not work if sizeof(tab*) > sizeof(char) */
552 tab[n] = v; /* memset(tab, v, 256) */
566 tab[c] = v; /* take character c */
601 tab[++c] = v;
/illumos-gate/usr/src/cmd/oawk/
H A Dtran.c136 setsymtab(wchar_t *n, wchar_t *s, awkfloat f, unsigned t, CELL **tab) argument
143 if (n != NULL && (p = lookup(n, tab, 0)) != NULL) {
157 p->nextval = tab[h];
158 tab[h] = p;
178 lookup(wchar_t *s, CELL **tab, int flag) argument
179 /* look for s in tab, flag must match */
184 for (p = tab[hash(s)]; p != NULL; p = p->nextval)

Completed in 57 milliseconds

123