| /original-bsd/local/ditroff/ditroff.okeeffe/ |
| 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/tbl/ |
| H A D | checkuse.c | 15 register int i, c, k; in checkuse() local
22 k = ctype(i, c); in checkuse()
23 if(k == '-' || k == '=') in checkuse()
25 if((k == 'n' || k == 'a')){ in checkuse()
|
| H A D | getstop.c | 15 register int i, c, k; in getstop() local
23 k = left(i, c, &junk); in getstop()
24 if(k >= 0 && linestop[k] == 0) in getstop()
25 linestop[k] = ++stopp; in getstop()
|
| H A D | maktab.c | 23 int icol, ilin, tsep, k, ik, vforml, il, text; in maktab() local
140 if(k = lspan(ilin, icol)){ in maktab()
141 s = table[ilin][icol - k].col; in maktab()
145 wide(table[ilin][icol - k].col, in maktab()
146 FN(ilin, icol - k), SZ(ilin, icol - k)); in maktab()
147 for(ik = k; ik >= 0; ik--){ in maktab()
154 TMP, TMP, TMP, k); in maktab()
157 for(ik = 1; ik <= k; ik++){ in maktab()
158 if(doubled[icol - k + ik]){ in maktab()
160 reg(icol - k + ik,CMID), in maktab()
[all …]
|
| /original-bsd/old/tbl/ |
| H A D | tb.c | 13 int i,c, k; in checkuse() local
20 k = ctype(i,c); in checkuse()
21 if (k== '-' || k == '=') continue; in checkuse()
22 if ((k=='n'||k=='a')) in checkuse()
|
| /original-bsd/old/refer/hunt/ |
| H A D | hunt2.c | 26 long k; local
138 k = getl(fb);
140 k = getw(fb);
141 if (k== -1) break;
143 fprintf(stderr,"next term finds %ld\n",k);
151 while (j<nf && (iflong?prevdrop.b[j]:prevdrop.a[j])<k)
181 if (j<nf && (iflong? prevdrop.b[j]: prevdrop.a[j]) == k)
184 umaster.b[g]=k;
186 umaster.a[g]=k;
199 umaster.b[g]=k;
[all …]
|
| /original-bsd/old/lex/ |
| H A D | parser.y | 20 int j,k; variable
160 for(k = 2; k<=$2;k++)
164 for(k=2;k<=i;k++)
177 for(k=2;k<=$2;k++)
190 for(k=2;k<$2;k++)
205 $$ = mn2(DIV,k,i);
220 int n, j, k, x; variable
608 k = c;
609 if(j > k) {
611 j = k;
[all …]
|
| H A D | sub1.c | 106 register int k; local
107 for(k=0; s[k]; k++)
108 if (s[k]== a)
109 return(k);
200 register int c, k; local
214 while ((k = *(*ss+1)) >= '0' && k <= '7')
216 c = c*8 + k - '0';
246 k = 0;
254 else k = 1;
264 for(k=1;k<NCH;k++){
[all …]
|
| /original-bsd/old/yacc/ |
| H A D | y3.c | 13 int i, k, c; in output() local
46 TLOOP(k){ in output()
47 if( BIT(u->ws.lset,k) ){ in output()
48 if( temp1[k] == 0 ) temp1[k] = c; in output()
49 else if( temp1[k]<0 ){ /* reduce/reduce conflict */ in output()
53 i, -temp1[k], lastred, symnam(k) ); in output()
54 if( -temp1[k] > lastred ) temp1[k] = -lastred; in output()
58 precftn( lastred, k, i ); in output()
126 int i, j, k, best, count, cbest, times; in go2out() local
147 for( k=j; k<=nstate; ++k ) if( tystate[k]==cbest ) ++count; in go2out()
|
| H A D | y1.c | 321 for(k=p2-1;k>p1;k--) { /* make k the biggest */ in state()
322 for(l=k-1;l>=p1;--l)if( l->pitem > k->pitem ){ in state()
325 s = k->pitem; in state()
328 ss = k->look; in state()
329 k->look = l->look; in state()
341 k=p1; in state()
344 ++k; in state()
351 for( l=q1,k=p1; l<q2; ++l,++k ){ in state()
532 int c, ch, work, k; in closure() local
547 SETLOOP(k) cwp->ws.lset[k] = p->look->lset[k]; in closure()
[all …]
|
| /original-bsd/games/backgammon/backgammon/ |
| H A D | extra.c | 187 register int i, j, k; local
200 for (k = 1; k < 7 && k < j; k++)
201 if (j-k < 7)
202 odds (k,j-k,1);
|
| /original-bsd/usr.sbin/mtree/ |
| H A D | misc.c | 48 KEY *k, tmp; local
52 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY),
54 if (k == NULL)
58 *needvaluep = k->flags & NEEDVALUE ? 1 : 0;
59 return (k->val);
|
| /original-bsd/games/snake/snake/ |
| H A D | snake.c | 76 int ch, i, j, k; local
155 int j, k; in mainloop() local
274 for(k=1;k<=repeat;k++){ in mainloop()
281 if((fast)||(k == 1)) in mainloop()
293 if((fast)||(k == 1)) in mainloop()
335 if(k < repeat) in mainloop()
702 int j,k; variable
708 for(k=0;k<j;k++){
712 for(k=0;k<j;k++){
717 for(k=0;k<j;k++){
[all …]
|
| /original-bsd/old/refer/NOTUSED/whatabout/ |
| H A D | what1.c | 91 int eval, k, pid; in wrdoc() local
104 k=af-files; in wrdoc()
105 _assert (k<NFEED); in wrdoc()
106 sprintf(rb[k]=rbp, "rf%d.%d",pid, k); in wrdoc()
107 rf = fopen(rb[k], "w"); in wrdoc()
133 unlink(rb[k]); in wrdoc()
134 rb[k][0]=0; in wrdoc()
|
| /original-bsd/sys/kern/ |
| H A D | vfs_init.c | 80 int i, j, k; in vfs_opv_init() local
151 for (k = 0; k<vfs_opv_numops; k++) in vfs_opv_init()
152 if (opv_desc_vector[k] == NULL) in vfs_opv_init()
153 opv_desc_vector[k] = in vfs_opv_init()
|
| /original-bsd/lib/libm/common/ |
| H A D | tan.c | 18 int k; local
25 k = 1;
29 k = 0;
40 if (k == 0)
|
| /original-bsd/usr.bin/yacc/ |
| H A D | lr0.c | 338 int i, j, k, n; in show_cores() local
341 k = 0; in show_cores()
344 if (k) printf("\n"); in show_cores()
394 int i, j, k; in show_shifts() local
396 k = 0; in show_shifts()
399 if (k) printf("\n"); in show_shifts()
501 k = 0; in set_derives()
509 rules[k] = i; in set_derives()
510 k++; in set_derives()
513 rules[k] = -1; in set_derives()
[all …]
|
| /original-bsd/games/larn/ |
| H A D | create.c | 75 makemaze(k) in makemaze() argument
76 int k; in makemaze()
80 if (k > 1 && (rnd(17)<=4 || k==MAXLEVEL-1 || k==MAXLEVEL+MAXVLEVEL-1))
86 if (k==0) return; eat(1,1);
90 if (k != MAXLEVEL-1)
96 if (k < MAXLEVEL)
104 z = makemonst(k);
113 if (k>1) treasureroom(k);
164 cannedlevel(k) in cannedlevel() argument
165 int k; in cannedlevel()
[all …]
|
| /original-bsd/old/libm/libm/ |
| H A D | pow.c | 164 long k=0; local
194 k=y;
195 if((double)k==y) { /* if y is an integer */
196 k = m-k*n;
199 k =m;
205 s=(double)sx*sy-k*ln2hi; /* (sy+ty)*(sx+tx)-kln2 */
206 z=(tx*ty-k*ln2lo);
|
| /original-bsd/usr.bin/systat/ |
| H A D | pigs.c | 65 register int i, j, y, k; in showpigs() local
89 for (k = 0; i > 0 && pt[k].pt_pctcpu > 0.01; i--, y++, k++) { in showpigs()
90 if (pt[k].pt_kp == NULL) { in showpigs()
95 ep = &pt[k].pt_kp->kp_eproc; in showpigs()
97 pname = pt[k].pt_kp->kp_proc.p_comm; in showpigs()
105 for (j = pt[k].pt_pctcpu*factor + 0.5; j > 0; j--) in showpigs()
|
| /original-bsd/lib/libc/db/test/ |
| H A D | run.test | 62 echo k$i
65 echo k$i
101 echo k$i
104 echo k$i
137 echo k$i
140 echo k$i
156 echo k$i
159 echo k$i
537 echo k$i
540 echo k$i
[all …]
|
| /original-bsd/usr.bin/diff/diffh/ |
| H A D | diffh.c | 135 register k,m; in easysynch() local
141 for(k=C-1;k<j;k++) { in easysynch()
144 getl(1,n1+k-m))!=0) in easysynch()
146 return(output(i-C,k-C)); in easysynch()
152 for(k=C-1;k<=i;k++) { in easysynch()
154 if(cmp(getl(0,n0+k-m), in easysynch()
157 return(output(k-C,j-C)); in easysynch()
|
| /original-bsd/usr.bin/f77/pass1.tahoe/ |
| H A D | tahoe.c | 121 prlabel(fp, k) in prlabel() argument
123 int k;
222 pralign(k) in pralign() argument
223 int k; in pralign()
227 if (k > 4)
251 preven(k) in preven() argument
252 int k; in preven()
256 if(k > 4)
682 k = leng;
733 k -= 8;
[all …]
|
| /original-bsd/usr.bin/f77/pass1.vax/ |
| H A D | vax.c | 115 prlabel(fp, k) in prlabel() argument
117 int k;
227 pralign(k) in pralign() argument
228 int k; in pralign()
232 if(k > 4)
267 preven(k) in preven() argument
268 int k; in preven()
272 if(k > 4)
698 k = leng;
719 i = k;
[all …]
|
| /original-bsd/games/sail/ |
| H A D | dr_3.c | 18 register int k, l; /* r8, r7 */ in moveall() local
69 for (k = 0; stillmoving(k); k++) { in moveall()
76 if (!sp->file->movebuf[k]) in moveall()
77 sp->file->movebuf[k+1] = '\0'; in moveall()
79 step(sp->file->movebuf[k], sp, &moved[n]); in moveall()
114 sp->file->movebuf[k + 1] = 0; in moveall()
115 sq->file->movebuf[k + 1] = 0; in moveall()
152 stillmoving(k) in stillmoving() argument
153 register int k; in stillmoving()
158 if (sp->file->movebuf[k])
|