Lines Matching refs:i

55 #define	NHASH(i)	((i>>6)^i)&0177  argument
61 int i, j; in setn() local
66 if ((i = cbits(ii = getach())) == '+') in setn()
68 else if (i == '-') in setn()
74 if ((i = getsn()) == 0) in setn()
76 if ((i & 0177) == '.') in setn()
77 switch (i >> BYTE) { in setn()
79 i = pts; in setn()
82 i = lss; in setn()
85 i = font; in setn()
88 i = pl; in setn()
91 i = findt1(); in setn()
94 i = po; in setn()
97 i = ll; in setn()
100 i = in; in setn()
103 i = frame->nargs; in setn()
106 i = ascii; in setn()
109 i = numtab[CD].val; in setn()
112 i = lastl; in setn()
115 i = ralss; in setn()
118 i = dip->hnl; in setn()
122 i = dip->dnl; in setn()
124 i = numtab[NL].val; in setn()
127 i = fi; in setn()
130 i = ad + 2 * admod; in setn()
133 i = widthp; in setn()
136 i = nel; in setn()
139 i = un; in setn()
142 i = dotT; in setn()
145 i = VERT; in setn()
148 i = HOR; in setn()
151 i = ne; in setn()
154 i = print; in setn()
157 i = ls; in setn()
160 i = NN - regcnt; in setn()
163 i = dip->curd; in setn()
164 *pbp++ = (i >> BYTE) & BYTEMASK; in setn()
165 *pbp++ = i & BYTEMASK; in setn()
168 i = bdtab[font]; in setn()
179 if ((j = findr(i)) == -1) in setn()
180 i = 0; in setn()
182 i = numtab[j].val = (numtab[j].val+numtab[j].inc*f); in setn()
186 setn1(i, nform, (tchar) 0); in setn()
195 wrc(i) in wrc() argument
196 tchar i; in wrc()
200 *numbufp++ = i;
208 setn1(int i, int form, tchar bits) in setn1() argument
215 fnumb(i, wrc); in setn1()
227 int i; in nrehash() local
229 for (i=0; i<128; i++) in nrehash()
230 nhash[i] = 0; in nrehash()
236 i = NHASH(p->r); in nrehash()
237 p->link = nhash[i]; in nrehash()
238 nhash[i] = p; in nrehash()
268 findr(i) in findr() argument
269 int i; in findr()
272 int h = NHASH(i);
274 if (i == 0)
277 if (i == p->r)
281 p->r = i;
296 usedr(i) /* returns -1 if nr i has never been used */ in usedr() argument
297 int i; in usedr()
301 if (i == 0)
303 for (p = nhash[NHASH(i)]; p; p = p->link)
304 if (i == p->r)
311 fnumb(i, f)
312 int i, (*f)();
317 if (i < 0) {
319 i = -i;
325 return decml(i, f) + j;
329 return roman(i, f) + j;
333 return abc(i, f) + j;
342 decml(i, f)
343 int i, (*f)();
349 if ((j = i / 10) || (nform > 0))
351 return(k + (*f)((i % 10 + '0') | nrbits));
356 roman(i, f)
357 int i, (*f)();
360 if (!i)
363 return(roman0(i, f, "ixcmz", "vldw"));
365 return(roman0(i, f, "IXCMZ", "VLDW"));
370 roman0(i, f, onesp, fivesp)
371 int i, (*f)();
377 if (!i)
379 k = roman0(i / 10, f, onesp + 1, fivesp + 1);
380 q = (i = i % 10) / 5;
381 rem = i % 5;
385 i = *(onesp + 1);
387 i = *fivesp;
388 return(k += (*f)(i | nrbits));
399 abc(i, f)
400 int i, (*f)();
402 if (!i)
405 return(abc0(i - 1, f));
410 abc0(i, f)
411 int i, (*f)();
416 if (j = i / 26)
418 return(k + (*f)((i % 26 + nform) | nrbits));
425 long i, acc; in atoi0() local
428 i = 0; in atoi0()
442 i = ckph(); in atoi0()
445 acc += i; in atoi0()
448 i = ckph(); in atoi0()
451 acc -= i; in atoi0()
454 i = ckph(); in atoi0()
457 acc *= i; in atoi0()
460 i = ckph(); in atoi0()
463 if (i == 0) { in atoi0()
468 acc /= i; in atoi0()
471 i = ckph(); in atoi0()
474 acc %= i; in atoi0()
477 i = ckph(); in atoi0()
480 if ((acc > 0) && (i > 0)) in atoi0()
486 i = ckph(); in atoi0()
489 if ((acc > 0) || (i > 0)) in atoi0()
497 i = ckph(); in atoi0()
502 if (i == acc) in atoi0()
513 i = ckph(); in atoi0()
518 if (acc > (i - k)) in atoi0()
529 i = ckph(); in atoi0()
534 if (acc < (i + k)) in atoi0()
551 tchar i; in ckph() local
556 if (cbits(i = getch()) == '(') in ckph()
559 j = atoi1(i); in ckph()
568 int i, j, digits; local
575 i = cbits(ii);
576 switch (i) {
595 while (i >= '0' && i <= '9') {
598 acc = 10 * acc + i - '0';
600 i = cbits(ii);
602 if (i == '.') {
606 i = cbits(ii);
613 switch (i) {
615 i = j = 1; /* should this be related to HOR?? */
619 i = 1;
623 i = 1;
628 i = 2;
631 i = 1; /*Same as Ems in NROFF*/
636 i = 72;
640 i = 1;
645 i = 127;
649 i = 6;
654 i = dfactd;
659 acc = (acc * j) / i;
685 int i, j; in caserr() local
689 while (!skip() && (i = getrq()) ) { in caserr()
690 j = usedr(i); in caserr()
706 int i, j; in casenr() local
710 if ((i = findr(getrq())) == -1) in casenr()
713 j = inumb(&numtab[i].val); in casenr()
716 numtab[i].val = j; in casenr()
721 numtab[i].inc = j; in casenr()
730 int i, k; in caseaf() local
734 if (skip() || !(i = getrq()) || skip()) in caseaf()
745 numtab[findr(i)].fmt = k & BYTEMASK; in caseaf()
753 int i, j; in setaf() local
755 i = usedr(getsn()); in setaf()
756 if (i == -1) in setaf()
758 if (numtab[i].fmt > 20) /* it was probably a, A, i or I */ in setaf()
759 *pbp++ = numtab[i].fmt; in setaf()
761 for (j = (numtab[i].fmt ? numtab[i].fmt : 1); j; j--) in setaf()
769 vnumb(i) in vnumb() argument
770 int *i; in vnumb()
775 return(inumb(i));
780 hnumb(i) in hnumb() argument
781 int *i; in hnumb()
785 return(inumb(i));
793 int i, j, f; local
805 i = atoi();
807 i = *n + f * i;
808 i = quant(i, res);
812 i = 0;
813 return(i);
821 int i, neg; local
829 i = n / m;
830 if ((n - m * i) > (m / 2))
831 i += 1;
832 i *= m;
834 i = -i;
835 return(i);