/original-bsd/local/ditroff/ditroff.okeeffe/troff/ |
H A D | n5.c | 294 mlist[k] = j; in casewh() 297 for (k = 0; k < NTRAP; k++) in casewh() 305 mlist[k] = j; in casewh() 306 nlist[k] = i; in casewh() 319 for (k = 0; k < NTRAP; k++) in casech() 328 nlist[k] = i; in casech() 335 register k; local 337 for (k = 0; k < NTRAP; k++) 338 if ((nlist[k] == i) && (mlist[k] != 0)) 340 return(k); [all …]
|
H A D | n1.c | 396 register int k; in getch() local 413 k = cbits(i); in getch() 414 if (k != ESC) { in getch() 423 return(k); in getch() 444 if (k == fc || k == tabch || k == ldrch) { in getch() 460 switch (k) { in getch() 541 switch (k) { in getch() 627 int delim, k; in setxon() local 635 if (k == ' ') in setxon() 876 for (k = 0; k < (NS - 1); k++) { in getname() [all …]
|
/original-bsd/local/ditroff/ditroff.van/ |
H A D | n5.c | 294 mlist[k] = j; in casewh() 297 for (k = 0; k < NTRAP; k++) in casewh() 305 mlist[k] = j; in casewh() 306 nlist[k] = i; in casewh() 319 for (k = 0; k < NTRAP; k++) in casech() 328 nlist[k] = i; in casech() 335 register k; local 337 for (k = 0; k < NTRAP; k++) 338 if ((nlist[k] == i) && (mlist[k] != 0)) 340 return(k); [all …]
|
H A D | n1.c | 396 register int k; in getch() local 413 k = cbits(i); in getch() 414 if (k != ESC) { in getch() 423 return(k); in getch() 444 if (k == fc || k == tabch || k == ldrch) { in getch() 460 switch (k) { in getch() 541 switch (k) { in getch() 627 int delim, k; in setxon() local 635 if (k == ' ') in setxon() 876 for (k = 0; k < (NS - 1); k++) { in getname() [all …]
|
/original-bsd/local/ditroff/ditroff.okeeffe/ |
H A D | n5.c | 294 mlist[k] = j; in casewh() 297 for (k = 0; k < NTRAP; k++) in casewh() 305 mlist[k] = j; in casewh() 306 nlist[k] = i; in casewh() 319 for (k = 0; k < NTRAP; k++) in casech() 328 nlist[k] = i; in casech() 335 register k; local 337 for (k = 0; k < NTRAP; k++) 338 if ((nlist[k] == i) && (mlist[k] != 0)) 340 return(k); [all …]
|
/original-bsd/games/cribbage/ |
H A D | support.c | 219 register int i, j, k; local 237 for (k = 0; k < FULLHAND; k++) 238 h[k] = chand[k]; 241 for (k = 0; k < nc; k++) { 243 scorehand(h, d[k], CINHAND, TRUE, FALSE); 245 sums[ns] += adjust(cb, d[k]); 247 sums[ns] -= adjust(cb, d[k]); 256 for (k = 0; k < FULLHAND; k++) 257 h[k] = chand[k];
|
/original-bsd/usr.bin/pascal/pdx/mappings/ |
H A D | functab.c | 59 register int i, j, k; local 72 k = (i + j) / 2; 73 a = codeloc(functab[k]); 75 return functab[k]; 77 i = k+1; 79 j = k-1;
|
/original-bsd/games/adventure/ |
H A D | main.c | 50 k=null; 87 k=1; 181 l19999: k=43; 202 k=i%1000; 229 l4000: verb=k; 300 k=vocab(wd1,3); 312 k=2; 316 pspeak(eggs,k); 436 k=null; 526 obj=k; [all …]
|
/original-bsd/usr.bin/yacc/ |
H A D | verbose.c | 156 register int k; local 163 k = statep->nitems; 165 for (i = 0; i < k; i++) 192 register int i, j, k, nnulls; local 214 for (k = nnulls - 1; k > j; --k) 215 null_rules[k] = null_rules[k-1]; 288 register int k, anyreds; local 309 k = p->number - 2; 325 register int i, k; local 335 k = to_state[i]; [all …]
|
/original-bsd/lib/libm/common_source/ |
H A D | exp.c | 95 int k; variable 105 k=invln2*x+copysign(0.5,x); /* k=NINT(x/ln2) */ 109 hi=x-k*ln2hi; 110 x=hi-(lo=k*ln2lo); 115 return scalb(1.0+(hi-(lo-(x*c)/(2.0-c))),k); 140 int k; local 150 k = z + copysign(.5, x); 154 hi=(x-k*ln2hi); /* Exact. */ 155 x= hi - (lo = k*ln2lo-c); 161 return scalb(1.+(hi-(lo - c)), k);
|
H A D | log1p.c | 94 int k; variable 105 k=logb(one+x); z=scalb(x,-k); t=scalb(one,-k); 107 { k += 1 ; z *= half; t *= half; } 113 c += (k*ln2lo-c*x); 117 return(k*ln2hi+x);
|
/original-bsd/old/sdb/ |
H A D | old.c | 22 register int k, nb; variable 41 if ((k=tell(brs->fd)) >= BSIZE + brs->nr) { 46 k = k - brs->nr; 47 if (k < 0) k = 0; 48 brs->nl = read(brs->fd, brs->b, k);
|
/original-bsd/old/roff/common_source/ |
H A D | n5.c | 303 for(k=0; k<NTRAP; k++)if(mlist[k] == 0)break; in casewh() 308 mlist[k] = j; in casewh() 317 else for(k=0; k<NTRAP; k++)if(mlist[k] == j)break; in casech() 327 register k; local 329 for(k=0; k<NTRAP; k++) 330 if((nlistx[k] == i) && (mlist[k] != 0))break; 331 return(k); 549 int cnt, k; local 571 k = !cnt; 586 k = 0; [all …]
|
/original-bsd/lib/libcurses/ |
H A D | cr_put.c | 210 k = outline - destline; 211 if (k < 0) 212 k = -k; 213 j += k; 228 k = (LINES - 1) - destline; 229 if (i + k + 2 < j && (k <= 0 || UP)) { 246 j *= (k = strlen(BT)); 247 if ((k += (destcol&7)) > 4) 250 j += k; 305 k = strlen(BT); [all …]
|
/original-bsd/old/tbl/ |
H A D | tc.c | 14 int had[128], ilin,icol, k; in choochar() local 25 k = ctype(ilin, icol); in choochar() 26 if (k==0 || k == '-' || k == '=') in choochar()
|
/original-bsd/old/libm/libm/ |
H A D | exp.c | 91 int k,finite(); local 101 k=invln2*x+copysign(0.5,x); /* k=NINT(x/ln2) */ 104 hi=x-k*ln2hi; 105 z=hi-(lo=k*ln2lo); 110 return (scalb(z+1.0,k));
|
/original-bsd/contrib/dungeon/ |
H A D | lex.c | 17 int cp, i, k, prsptr; local 57 k = *op + (cp/3) - 1; 61 outbuf[k] += j * 1560; 63 outbuf[k] += j * 39; 65 outbuf[k] += j;
|
/original-bsd/local/ditroff/ditroff.okeeffe/tbl/ |
H A D | delimfields.c | 24 int had[128], ilin, icol, k; in choochar() local 36 k = ctype(ilin, icol); in choochar() 37 if(k == 0 || k == '-' || k == '=') in choochar()
|
/original-bsd/sys/vax/stand/ |
H A D | kdb.c | 125 register struct kdb *k = &kdb; local 129 k->kdb_cmd.mscp_opcode = op; 130 k->kdb_rsp.mscp_msglen = MSCP_MSGLEN; 131 k->kdb_cmd.mscp_msglen = MSCP_MSGLEN; 132 k->kdb_ca.ca_rspdsc[0] |= MSCP_OWN | MSCP_INT; 133 k->kdb_ca.ca_cmddsc[0] |= MSCP_OWN | MSCP_INT; 138 mp = &k->kdb_rsp; 140 if (k->kdb_ca.ca_cmdint) 141 k->kdb_ca.ca_cmdint = 0; 142 if (k->kdb_ca.ca_rspint == 0) [all …]
|
/original-bsd/local/ditroff/ditroff.okeeffe/eqn/ |
H A D | matrix.c | 36 int nrow, ncol, i, j, k, val[100]; local 50 for (k=1; k <= nrow; k++) { 52 j = oct + k + 2; 58 dprintf(".\trow %d: b=%g, hb=%g\n", k, b, hb); 59 j = oct + k + 2;
|
/original-bsd/old/eqn/common_source/ |
H A D | matrix.c | 28 int nrow, ncol, i, j, k, hb, b, val[100]; local 38 for( k=1; k<=nrow; k++ ) { 40 j = p1 + k; 46 if(dbg)printf(".\trow %d: b=%d, hb=%d\n", k, b, hb); 47 j = p1 + k;
|
/original-bsd/usr.bin/f77/libF77/test/ |
H A D | fpetst.f | 26 k = inmax() + 10 27 write (*,*) 'k=', k, 'flag=', flag 31 k = i / j 32 write (*,*) 'k=', k, 'flag=', flag
|
/original-bsd/usr.bin/pascal/pxref/ |
H A D | pxref.p | 51 k, k1: integer; 75 i, j, k: integer; 80 k := (i + j) div 2; 82 i := k + 1; 84 j := k - 1 86 nokey := key[k] <> x 216 k:=0; 219 k:=k+1; 221 inputfile[k]:=inp^; 239 k := 0; [all …]
|
/original-bsd/lib/libc/stdlib/ |
H A D | heapsort.c | 85 #define SELECT(par_i, child_i, nmemb, par, child, size, k, count, tmp1, tmp2) { \ argument 100 if (child_i == 1 || compar(k, par) < 0) { \ 101 COPY(child, k, count, size, tmp1, tmp2); \ 123 char *base, *k, *p, *t; local 133 if ((k = malloc(size)) == NULL) 151 COPY(k, base + nmemb * size, cnt, size, tmp1, tmp2); 154 SELECT(i, j, nmemb, t, p, size, k, cnt, tmp1, tmp2); 156 free(k);
|
/original-bsd/old/refer/inv/ |
H A D | inv5.c | 20 long k, lp; local 46 while ( (k= getl(fb) ) != -1) 47 fprintf(ft, "%04d %06ld\n",i,k); 51 while ( (k= getw(fb) ) != -1) 52 fprintf(ft, "%04d %06ld\n",i,k);
|