Home
last modified time | relevance | path

Searched refs:k (Results 176 – 200 of 572) sorted by relevance

12345678910>>...23

/original-bsd/old/roff/common_source/
H A Dn1.c500 register int i, j, k; in getch() local
518 if(k == FLSS){ in getch()
525 if(k == RPT){ in getch()
534 if((k == fc) || (k == tabch) || (k == ldrch)){ in getch()
537 if(k == 010){ in getch()
556 switch(k){ in getch()
633 switch(k){ in getch()
688 i = sethl(k); in getch()
886 for(k=0; k < (NS-1); k++){ in getname()
889 nextf[k] = j; in getname()
[all …]
H A Dn3.c227 k = j>>BYTE; in copyb()
237 if(!k){ in copyb()
614 register *k; in casedi() local
717 register i, k; in casepm() local
730 k = 1; in casepm()
733 kk += k; in casepm()
738 kvt(k,p); in casepm()
747 char *kvt(k,p) in kvt() argument
748 int k; in kvt()
751 if(k>=100)*p++ = k/100 + '0';
[all …]
H A Dn2.c121 register i, j, *k; local
166 for(k=chtab; *++k != j; k++)
167 if(*k == 0)return;
170 oput(*--k & BMASK);
171 oput(*k >> BYTE);
/original-bsd/usr.bin/sort/
H A Dsort.c406 int k, l; in merge() local
431 k = i; in merge()
433 ibuf[k-1] = ibuf[k]; in merge()
605 int k; local
612 for(k = nfields>0; k<=nfields; k++) {
616 if(k) {
776 field(s,k) in field() argument
789 p->bflg[k]++;
828 p->m[k] = 0;
859 char **k; local
[all …]
/original-bsd/local/ditroff/ditroff.okeeffe/tbl/
H A Dvertlines.c163 int k; in midbar() local
165 k = midbcol(i, c); in midbar()
166 if(k == 0 && c > 0) in midbar()
167 k = midbcol(i, c - 1); in midbar()
168 return(k); in midbar()
/original-bsd/old/refer/inv/
H A Dinv6.c24 int k; local
38 sscanf(line, "%d %ld", &k, &point);
39 if (hash < k)
45 while (hash<k)
/original-bsd/bin/csh/
H A Dmisc.c288 register int k = dup(i); local
290 if (k < 0)
292 if (j == -1 && k > 2)
293 return (k);
294 if (k != j) {
295 j = renum(k, j);
296 (void) close(k);
299 return (k);
/original-bsd/local/ditroff/ditroff.old.okeeffe/driver/
H A Dx2ch.c172 register int k; local
177 for (k = 0; k < FH.bmHeight; k++) {
179 if (bitset(lineptr[k], bitmapindex[j]+l)) {
180 if (l == 0 && k == FH.baseline)
185 if (l == 0 && k == FH.baseline)
H A Dvsort.c142 register int k; local
147 k = 0;
151 k = 10 * k - ((*op++ = c) - '0');
155 k = 10 * k + (*op++ = c) - '0';
159 return (k);
171 k = 0;
175 k = 10 * k - (c - '0');
179 k = 10 * k + c - '0';
183 return (k);
808 k = ++i;
[all …]
/original-bsd/old/libm/libm/IEEE/
H A Datan2.c139 int finite(), k,m;
171 if((m=(k=logb(y))-logb(x)) > 60) t=big+big;
173 else { t = y/x ; y = scalb(y,-k); x=scalb(x,-k); }
180 k = 4 * (t+0.0625);
181 switch (k) {
/original-bsd/old/dbx/tests/cc/
H A Dm1.c16 int k; local
18 k = j;
/original-bsd/old/tbl/
H A Dtv.c122 int k; in midbar() local
123 k = midbcol(i,c); in midbar()
124 if (k==0 && c>0) in midbar()
125 k = midbcol(i, c-1); in midbar()
126 return(k); in midbar()
/original-bsd/sys/tahoe/vba/
H A Dvxc.c167 register k ; local
181 if( (k=resp[1]) & V_UNBSY ) {
182 k &= VCMDLEN-1;
183 cmd = cp->v_curcmd[k];
184 cp->v_curcmd[k] = (caddr_t)0;
186 k = *((short *)&resp[4]); /* cmd operation code */
187 if((k & 0xFF00) == LIDENT) { /* want hiport number */
188 for(k=0; k<VRESPLEN; k++)
189 cmd[k] = resp[k+4];
/original-bsd/usr.bin/struct/struct/
H A D1.fort.c15 act(k,c,bufptr) in act() argument
16 int k,bufptr; in act()
21 switch(k)
240 struct lablist *j,*k; in freelabs() local
244 k = j->nxtlab; in freelabs()
246 j = k; in freelabs()
/original-bsd/old/refer/hunt/
H A Dhunt7.c30 int len, k, nofil; local
42 k = sscanf(p, "%ld,%ld", &lp, &llen);
44 fprintf(stderr, "p %s k %d lp %ld llen %ld\n",p,k,lp,llen);
46 if (k<2)
/original-bsd/local/ditroff/ditroff.okeeffe/psfig/patches/
H A Dditroff.frag4 register short j, k, w;
11 k = cbits(i);
22 if (k == XON) {
/original-bsd/usr.bin/pascal/pdx/test/
H A Dparall.p246 y := abs(a[k,k]);
247 j := k;
248 k1 := k + 1;
257 y := a[k,i];
261 y := b[k];
262 b[k] := b[j];
264 z := a[k,k];
268 a[i,k] := y;
290 i,j,k: integer;
299 for k := 1 to N do m[i,j] := m[i,j] - b[i,k] * jac[k,j];
[all …]
/original-bsd/local/ditroff/ditroff.old.okeeffe/gremlin.aed/gprint/
H A Dhgraph.c346 int i, j, k, extent, nx, ny; local
387 for (k=cy; k<=ny; ++k)
389 point(j, k);
390 point(j, 2*y-k);
391 point(2*x-j, k);
392 point(2*x-j, 2*y-k);
586 int numpoints, i, j, k, lx, ly, nx, ny; local
624 for (k=0; k<=PointsPerInterval; ++k)
652 int i,j,k; local
664 for(k=7; k>=0; --k)
[all …]
/original-bsd/sys/net/
H A Dbpf.h198 long k; member
204 #define BPF_STMT(code, k) { (u_short)(code), 0, 0, k } argument
205 #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k } argument
/original-bsd/usr.sbin/ac/
H A Dac.c247 register j, k; in among() local
254 for (k=0; k<NMAX; k++) { in among()
255 if (*p == ubuf[i].uname[k]) { in among()
256 if (*p++ == '\0' || k == NMAX-1) in among()
/original-bsd/usr.bin/f77/tests/tests/
H A Dfm025.f266 do 6592 k = 1, 2
267 iadn32( i, j, k ) = i + j + k
321 do 6612 k = 1, 2
322 6612 iadn31(i,j,k) = - iadn32 ( i, j, k )
347 do 6622 k = 1, 2
350 ladn31( i, j, k ) = .false.
/original-bsd/local/ditroff/ditroff.old.okeeffe/grn/
H A Dmain.c193 register int k; local
235 for (k=0; k<gfil; k++) {
236 if (file[k] != NULL) {
237 if ((fp = fopen(file[k], "r")) == NULL) {
238 error("can't open %s", file[k]);
334 char *k; local
337 if ((k = fgets(inputline, MAXINLINE, fp)) == NULL)
338 return k;
/original-bsd/games/rogue/
H A Droom.c385 short i, j, k, rn; local
405 for (k = 0; k < 4; k++) {
406 if (rooms[rr].doors[k].oth_room == rn) {
407 monster->trow = rooms[rr].doors[k].oth_row;
408 monster->tcol = rooms[rr].doors[k].oth_col;
432 for (k = 0; k < 4; k++) {
433 if (rooms[rn].doors[k].oth_room == i) {
434 monster->trow = rooms[rn].doors[k].oth_row;
435 monster->tcol = rooms[rn].doors[k].oth_col;
/original-bsd/sys/sparc/fpu/
H A Dfpu_explode.c161 fpu_xtof(fp, i, j, k, l) in fpu_xtof() argument
163 register u_int i, j, k, l;
175 f1 = (j << EXT_SHIFT) | (k >> (32 - EXT_SHIFT));
176 f2 = (k << EXT_SHIFT) | (l >> (32 - EXT_SHIFT));
178 frac |= j | k | l;
/original-bsd/usr.bin/xsend/xsend/
H A Dxsend.c106 { int i, j, k, n; in mkcd() local
112 for(k=j, n=0; k>0 && n<7; n++, k>>=1) in mkcd()
113 if(k&01) madd(cd[i][j], a[7*i+n], cd[i][j]); in mkcd()

12345678910>>...23