/original-bsd/usr.bin/pascal/pdx/sym/ |
H A D | printdecl.c | 91 t = s->chain; 94 for (t = t->chain; t != NIL; t = t->chain) { 147 tmp = t->chain; 150 tmp = tmp->chain; 163 printtype(t->chain, t->chain); 170 printtype(t->chain, t->chain); 200 t = t->type->chain; 203 t = t->chain; 206 t = t->chain; 230 if (s->chain != NIL) { [all …]
|
H A D | print.c | 97 for (param = f->chain; param != NIL; param = param->chain) { 98 if (param == f->chain) { 102 if (param->chain != NIL) {
|
H A D | printval.c | 120 c = t->chain; 122 c = c->chain; 147 if ((t = s->chain) == NIL) { 169 if (s->chain != NIL) { 170 printfield(s->chain);
|
H A D | tree.c | 334 t = t->chain; 335 for (; p != NIL && t != NIL; p = p->right, t = t->chain) { 374 t = t->chain; 389 t = t->chain; 410 for (s = r->nodetype->chain; s != NIL; s = s->chain) { 477 s->chain = alloc(1, SYM); 478 t = s->chain; 494 dispose(s->chain);
|
/original-bsd/usr.bin/struct/struct/ |
H A D | 1.hash.c | 17 int *value, *chain; variable 101 chain = challoc(sizeof(*chain) * maxhash); in hash_init() 107 chain[i] = 0; in hash_init() 128 chfree(chain,sizeof(*chain) * maxhash); in hash_free() 129 chain = 0; in hash_free() 160 *ptr = chain[index]; 166 if (chain[index] == 0) 169 *ptr = chain[index]; 170 chain[index] = ptr; 217 temp = &chain[index]; [all …]
|
/original-bsd/usr.bin/pascal/src/ |
H A D | fhdr.c | 211 cp->chain = p; 247 cp->chain = dp; 306 p -> ptr[ NL_FCHAIN ] = p -> chain; 307 p -> chain = NIL; 451 chainp->chain = dp; 463 w = lwidth(p->chain); 474 p = p->chain; 480 chainp = chainp->chain; 486 chainp = chainp->chain; 491 chainp = chainp->chain; [all …]
|
H A D | stab.c | 527 TypeDesc chain; member 544 td = td->chain; 576 td->chain = typetable[i]; 618 for (p = t->chain; p != NIL; p = p->chain) { 639 if (t->chain != NIL) { 640 genrecfield(t->chain, 1); 649 if (t->chain != NULL) { 650 genrecfield(t->chain, n + 1); 718 e = t->chain; 725 e = e->chain; [all …]
|
H A D | call.c | 210 for (p1 = plist(p); p1 != NLNIL; p1 = p1->chain) { 233 if (p2 == NLNIL || p2->chain == NLNIL || p2->chain->class != CRANGE) { 259 conf_err: if (p1->chain->type->class == CRANGE) { 265 p1 = p1->chain->chain->chain; 282 if (p1->chain->type->class == CRANGE) { 287 p1 = p1->chain; 288 q = q->chain; 325 p1 = p1->chain->chain; 571 f_chain = f_chain->chain, a_chain = a_chain->chain) { 647 return p->chain;
|
H A D | rec.c | 236 fp->chain = P0->chain; 237 P0->chain = fp; 284 av->chain = p->ptr[NL_VARNT]; 301 for (vt = p->ptr[NL_VARNT]; vt != NIL; vt = vt->chain) 322 for (p = p->chain; p != NIL; p = p->chain) 406 varntnlp = varntnlp -> chain ) { 422 varntnlp = varntnlp -> chain ) {
|
H A D | fdec.c | 123 for (q = fp->chain; q != NIL; q = q->chain) { 184 if (((struct udinfo *) (p->chain))->ud_next == NIL) in segend() 192 pnums((struct udinfo *) (p->chain)); in segend() 205 ((p->chain->extra_flags & NEXTERN) == 0)) in segend()
|
H A D | yyid.c | 110 if (p->chain != NIL && ((struct udinfo *) p->chain)->ud_line == line) 114 udp->ud_next = (struct udinfo *) p->chain; 115 p->chain = (struct nl *) udp;
|
/original-bsd/old/dbx/ |
H A D | keywords.c | 70 struct Keyword *chain; member 124 nextk = k->chain; in keywords_free() 145 k->chain = hashtab[h]; 163 k = k->chain; 185 k = k->chain; 190 hashtab[h] = k->chain; 192 prevk->chain = k->chain; 241 k = k->chain; 338 for (k = hashtab[i]; k != nil; k = k->chain) { 474 for (k = hashtab[i]; k != nil; k = k->chain) { in print_vars()
|
H A D | c.c | 286 i = t->chain; 290 i = i->chain; 313 for (i = t->chain; i != nil; i = i->chain) { 378 i = t->chain; 382 i = i->chain; 416 for (t = s->chain; t != nil; t = t->chain) { 425 for (t = s->chain; t != nil; t = t->chain) { 574 f = s->chain; 583 f = f->chain; 647 t = t->chain; [all …]
|
H A D | pascal.c | 325 tmp = t->chain; 329 tmp = tmp->chain; 346 printtype(t->chain, t->chain, n); 415 for (f = t->chain; f != nil; f = f->chain) { 468 t = e->chain; 471 t = t->chain; 474 t = t->chain; 492 for (t = s->chain; t != nil; t = t->chain) { 696 e = t->chain; 714 e = e->chain; [all …]
|
H A D | modula-2.c | 333 tmp = t->chain; 378 printtype(t->chain, t->chain, n); 439 for (f = t->chain; f != nil; f = f->chain) { 492 t = e->chain; 495 t = t->chain; 498 t = t->chain; 516 for (t = s->chain; t != nil; t = t->chain) { 872 e = t->chain; 890 e = e->chain; 989 t = t->chain; [all …]
|
H A D | printsym.c | 157 param = f->chain; 172 param = param->chain; 181 if (f->chain != nil) { 413 printf("\nchain\t0x%x", s->chain); 414 if (s->chain != nil and s->chain->name != nil) { 415 printf(" (%s)", symname(s->chain)); 545 if (s->chain == nil) { 550 f = s->chain; 554 f = f->chain; 718 e = t->chain; [all …]
|
H A D | names.c | 33 Name chain; member 101 n = n->chain; 129 n->chain = *np;
|
H A D | fortran.c | 106 sc = st->chain; 133 assert( (r = st->chain)->class == RANGE); 234 for (t = s->chain; t != nil; t = t->chain) { 236 if (t->chain != nil) { 241 if (s->chain != nil) { 243 for (t = s->chain; t != nil; t = t->chain) { 479 assert(as->chain->class == RANGE); 518 r = t->chain; 569 sc = st->chain;
|
/original-bsd/lib/libc/db/btree/ |
H A D | updutils.c | 84 pgno_t chain; local 90 (char *) &chain, 91 sizeof(chain)); 92 if (_bt_getbig(t, chain, &tmp, &itmp)
|
/original-bsd/sys/tahoe/stand/ |
H A D | hd.c | 87 mcb.chain[0].wcount = (long)(sizeof(struct status) / sizeof(long)); 88 mcb.chain[0].memadr = (long)&status; 109 mcb.chain[0].wcount = (long)(DEV_BSIZE / sizeof(long)); 110 mcb.chain[0].memadr = (long)dlbuf; 153 mcb.chain[0].wcount = io->i_cc / sizeof(long); 154 mcb.chain[0].memadr = (u_long)io->i_ma; 213 mcb.chain[0].wcount = (long)(sizeof(geometry_sector) / sizeof(long)); 214 mcb.chain[0].memadr = (long)&geometry;
|
/original-bsd/usr.bin/pascal/pc3/ |
H A D | pc3.h | 61 struct symboltableinfo *chain; member 84 struct stringtableinfo *chain; member
|
H A D | pc3.c | 542 for ( tablep = &symboltable ; /*return*/ ; tablep = tablep -> chain ) { 550 ; tablep->chain != NIL 551 ; tablep = tablep->chain ) { 554 tablep->chain = ( struct symboltableinfo * ) 556 if ( tablep->chain == NIL ) { 559 tablep = tablep->chain; 676 ; tablep->chain != NIL 677 ; tablep = tablep->chain ) { 680 tablep->chain = ( struct stringtableinfo * ) 682 if ( tablep->chain == NIL ) { [all …]
|
/original-bsd/old/make/ |
H A D | misc.c | 290 struct chain *appendq(head, tail) in appendq() 291 struct chain *head; in appendq() 294 register struct chain *p, *q; 296 p = ALLOC(chain); 315 struct chain *p; in mkqlist()
|
/original-bsd/usr.bin/pascal/pdx/object/ |
H A D | readsym.c | 79 chkpatch(&s->chain); 111 t->chain = (SYM *) o->chno; 178 for (s = f->chain; s != NIL; s = s->chain) {
|
/original-bsd/games/adventure/ |
H A D | subr.c | 542 if (obj==chain) in tropen() 545 if (prop[chain]!=0) spk=34; in tropen() 546 if (loc!=plac[chain]) spk=173; in tropen() 548 prop[chain]=2; in tropen() 549 if (toting(chain)) drop(chain,loc); in tropen() 550 fixed[chain]= -1; in tropen() 555 if (prop[chain]==0) spk=37; in tropen() 557 prop[chain]=0; in tropen() 558 fixed[chain]=0; in tropen() 764 prop[chain]=0; in closing() [all …]
|