/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Safe/t/ |
H A D | opcode.pl | 166 # print $on "\t", &tab(3,"OP_\U$_,"), "/* ", $i++, " */\n"; 167 print $on "\t", &tab(3,"OP_\U$_"), " = ", $i++, ",\n"; 169 print $on "\t", &tab(3,"OP_max"), "\n"; 229 # print "OP *\t", &tab(3,$_),"(pTHX_ OP* o);\n"; 235 # print "OP *\t", &tab(3, "pp_$_"), "(pTHX);\n"; 294 print "\t", &tab(3, "MEMBER_TO_FPTR(Perl_$check{$_}),"), "\t/* $_ */\n"; 396 print "\t", &tab(3, "$argsum,"), "/* $op */\n"; 491 #OP *\t", &tab(3,$_),"(OP* o);\n"; 518 sub tab { subroutine
|
/osnet-11/usr/src/lib/libast/common/hash/ |
H A D | hashlast.c | 24 /* OBSOLETE 19960229 -- use tab->root->last.{table|bucket} */ 40 hashlast(Hash_table_t* tab) argument 42 return(tab->root->last.bucket);
|
H A D | hashwalk.c | 37 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 D | hashalloc.c | 43 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 D | hashdump.c | 53 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 D | hashfree.c | 40 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 D | hashscan.c | 37 * 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 D | hashsize.c | 38 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 D | hashlook.c | 37 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...] |
/osnet-11/usr/src/lib/libast/common/string/ |
H A D | strlook.c | 31 * 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 D | strpsearch.c | 40 * 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 D | strsearch.c | 32 * 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 register char* lo = (char*)tab;
|
H A D | stropt.c | 32 * 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 D | ccmap.c | 43 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);
|
/osnet-11/usr/src/lib/libast/common/tm/ |
H A D | tmlex.c | 35 * 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...] |
/osnet-11/usr/src/lib/fm/topo/modules/common/pcibus/ |
H A D | did_hash.c | 132 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...] |
/osnet-11/usr/src/lib/libsum/common/ |
H A D | sum-crc.c | 51 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;
|
/osnet-11/usr/src/lib/libpp/common/ |
H A D | ppop.c | 66 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)))
|
/osnet-11/usr/src/grub/grub2/grub-core/fs/zfs/ |
H A D | zfsinfo.c | 42 print_state (char *nvlist, int tab) argument 47 print_tabs (tab); 79 print_vdev_info (char *nvlist, int tab) argument 87 print_tabs (tab); 98 print_tabs (tab); 101 print_state (nvlist, tab); 105 print_tabs (tab); 112 print_tabs (tab); 119 print_tabs (tab); 137 print_tabs (tab); [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/x2p/ |
H A D | walk.c | 34 static void tab ( STR *str, int lvl ); 137 tab(str,++level); 142 tab(str,level); 158 tab(str,level); 194 tab(str,level); 199 tab(str,level); 283 tab(str,++level); 288 tab(str,level); 772 tab(str,level); 776 tab(st 1557 tab(register STR *str, register int lvl) function [all...] |
/osnet-11/usr/src/lib/libsqlite/src/ |
H A D | trigger.c | 56 Table *tab; local 77 tab = sqliteSrcListLookup(pParse, pTableName); 78 if( !tab ){ 81 iDb = isTemp ? 1 : tab->iDb; 84 "database %s", db->aDb[tab->iDb].zName); 94 if( sqliteStrNICmp(tab->zName, "sqlite_", 7)==0 ){ 99 if( tab->pSelect && tr_tm != TK_INSTEAD ){ 104 if( !tab->pSelect && tr_tm == TK_INSTEAD ){ 112 const char *zDb = db->aDb[tab->iDb].zName; 114 if( tab [all...] |
/osnet-11/usr/src/lib/libnisdb/ |
H A D | db_mindex2.cc | 1202 * Read-lock the table so that 'tab' 1213 * There may be empty slots in the table 'tab' 1601 entry_object **tab; local 1606 tab = table->gettab(); 1608 if (tab == 0 || ntab <= 0) { 1625 if (tab[i] == 0) 1628 qa[i] = pseudoEntryObj2Query(tab[i], t->obj, &rv[i]);
|
/osnet-11/usr/src/common/mpi/ |
H A D | mp_gf2m.c | 68 mp_digit tab[8], top2b = a >> 30; local 73 tab[0] = 0; tab[1] = a1; tab[2] = a2; tab[3] = a1^a2; 74 tab[4] = a4; tab[5] = a1^a4; tab[6] = a2^a4; tab[7] = a1^a2^a4; 76 s = tab[ 100 mp_digit tab[16], top3b = a >> 61; local [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ |
H A D | perliol.h | 21 IV (*Pushed) (pTHX_ PerlIO *f, const char *mode, SV *arg, PerlIO_funcs *tab); 23 PerlIO *(*Open) (pTHX_ PerlIO_funcs *tab, 68 PerlIO_funcs *tab; /* Functions for this layer */ member in struct:_PerlIO 129 extern IV PerlIOBase_pushed(pTHX_ PerlIO *f, const char *mode, SV *arg, PerlIO_funcs *tab); 173 extern IV PerlIOBuf_pushed(pTHX_ PerlIO *f, const char *mode, SV *arg, PerlIO_funcs *tab);
|
/osnet-11/usr/src/lib/libast/common/misc/ |
H A D | mime.c | 726 * parse mime headers in strsearch(tab,num,siz) from s 731 mimehead(Mime_t* mp, void* tab, size_t num, size_t siz, register char* s) argument 744 if ((p = strsearch(tab, num, siz, (Strcmp_f)mimecmp, s, &e)) && *e == ':') 753 (p = strsearch(tab, num, siz, (Strcmp_f)mimecmp, pp.name.data, &e)) &&
|