Lines Matching refs:i
57 #define NHASH(i) ((i>>6)^i)&0177 argument
63 int i, j; in setn() local
68 if ((i = cbits(ii = getach())) == '+') in setn()
70 else if (i == '-') in setn()
76 if ((i = getsn()) == 0) in setn()
78 if ((i & 0177) == '.') in setn()
79 switch (i >> BYTE) { in setn()
81 i = pts; in setn()
84 i = lss; in setn()
87 i = font; in setn()
90 i = pl; in setn()
93 i = findt1(); in setn()
96 i = po; in setn()
99 i = ll; in setn()
102 i = in; in setn()
105 i = frame->nargs; in setn()
108 i = ascii; in setn()
111 i = numtab[CD].val; in setn()
114 i = lastl; in setn()
117 i = ralss; in setn()
120 i = dip->hnl; in setn()
124 i = dip->dnl; in setn()
126 i = numtab[NL].val; in setn()
129 i = fi; in setn()
132 i = ad + 2 * admod; in setn()
135 i = widthp; in setn()
138 i = nel; in setn()
141 i = un; in setn()
144 i = dotT; in setn()
147 i = VERT; in setn()
150 i = HOR; in setn()
153 i = ne; in setn()
156 i = print; in setn()
159 i = ls; in setn()
162 i = NN - regcnt; in setn()
165 i = dip->curd; in setn()
166 *pbp++ = (i >> BYTE) & BYTEMASK; in setn()
167 *pbp++ = i & BYTEMASK; in setn()
170 i = bdtab[font]; in setn()
181 if ((j = findr(i)) == -1) in setn()
182 i = 0; in setn()
184 i = numtab[j].val = (numtab[j].val+numtab[j].inc*f); in setn()
188 setn1(i, nform, (tchar) 0); in setn()
197 wrc(i) in wrc() argument
198 tchar i; in wrc()
202 *numbufp++ = i;
210 setn1(i, form, bits) in setn1() argument
211 int i; in setn1()
219 fnumb(i, wrc);
231 int i; in nrehash() local
233 for (i=0; i<128; i++) in nrehash()
234 nhash[i] = 0; in nrehash()
240 i = NHASH(p->r); in nrehash()
241 p->link = nhash[i]; in nrehash()
242 nhash[i] = p; in nrehash()
272 findr(i) in findr() argument
273 int i; in findr()
276 int h = NHASH(i);
278 if (i == 0)
281 if (i == p->r)
285 p->r = i;
300 usedr(i) /* returns -1 if nr i has never been used */ in usedr() argument
301 int i; in usedr()
305 if (i == 0)
307 for (p = nhash[NHASH(i)]; p; p = p->link)
308 if (i == p->r)
315 fnumb(i, f)
316 int i, (*f)();
321 if (i < 0) {
323 i = -i;
329 return decml(i, f) + j;
333 return roman(i, f) + j;
337 return abc(i, f) + j;
346 decml(i, f)
347 int i, (*f)();
353 if ((j = i / 10) || (nform > 0))
355 return(k + (*f)((i % 10 + '0') | nrbits));
360 roman(i, f)
361 int i, (*f)();
364 if (!i)
367 return(roman0(i, f, "ixcmz", "vldw"));
369 return(roman0(i, f, "IXCMZ", "VLDW"));
374 roman0(i, f, onesp, fivesp)
375 int i, (*f)();
381 if (!i)
383 k = roman0(i / 10, f, onesp + 1, fivesp + 1);
384 q = (i = i % 10) / 5;
385 rem = i % 5;
389 i = *(onesp + 1);
391 i = *fivesp;
392 return(k += (*f)(i | nrbits));
403 abc(i, f)
404 int i, (*f)();
406 if (!i)
409 return(abc0(i - 1, f));
414 abc0(i, f)
415 int i, (*f)();
420 if (j = i / 26)
422 return(k + (*f)((i % 26 + nform) | nrbits));
429 long i, acc; in atoi0() local
432 i = 0; in atoi0()
446 i = ckph(); in atoi0()
449 acc += i; in atoi0()
452 i = ckph(); in atoi0()
455 acc -= i; in atoi0()
458 i = ckph(); in atoi0()
461 acc *= i; in atoi0()
464 i = ckph(); in atoi0()
467 if (i == 0) { in atoi0()
472 acc /= i; in atoi0()
475 i = ckph(); in atoi0()
478 acc %= i; in atoi0()
481 i = ckph(); in atoi0()
484 if ((acc > 0) && (i > 0)) in atoi0()
490 i = ckph(); in atoi0()
493 if ((acc > 0) || (i > 0)) in atoi0()
501 i = ckph(); in atoi0()
506 if (i == acc) in atoi0()
517 i = ckph(); in atoi0()
522 if (acc > (i - k)) in atoi0()
533 i = ckph(); in atoi0()
538 if (acc < (i + k)) in atoi0()
555 tchar i; in ckph() local
560 if (cbits(i = getch()) == '(') in ckph()
563 j = atoi1(i); in ckph()
572 int i, j, digits; local
579 i = cbits(ii);
580 switch (i) {
599 while (i >= '0' && i <= '9') {
602 acc = 10 * acc + i - '0';
604 i = cbits(ii);
606 if (i == '.') {
610 i = cbits(ii);
617 switch (i) {
619 i = j = 1; /* should this be related to HOR?? */
623 i = 1;
627 i = 1;
632 i = 2;
635 i = 1; /*Same as Ems in NROFF*/
640 i = 72;
644 i = 1;
649 i = 127;
653 i = 6;
658 i = dfactd;
663 acc = (acc * j) / i;
689 int i, j; in caserr() local
693 while (!skip() && (i = getrq()) ) { in caserr()
694 j = usedr(i); in caserr()
710 int i, j; in casenr() local
714 if ((i = findr(getrq())) == -1) in casenr()
717 j = inumb(&numtab[i].val); in casenr()
720 numtab[i].val = j; in casenr()
725 numtab[i].inc = j; in casenr()
734 int i, k; in caseaf() local
738 if (skip() || !(i = getrq()) || skip()) in caseaf()
749 numtab[findr(i)].fmt = k & BYTEMASK; in caseaf()
757 int i, j; in setaf() local
759 i = usedr(getsn()); in setaf()
760 if (i == -1) in setaf()
762 if (numtab[i].fmt > 20) /* it was probably a, A, i or I */ in setaf()
763 *pbp++ = numtab[i].fmt; in setaf()
765 for (j = (numtab[i].fmt ? numtab[i].fmt : 1); j; j--) in setaf()
773 vnumb(i) in vnumb() argument
774 int *i; in vnumb()
779 return(inumb(i));
784 hnumb(i) in hnumb() argument
785 int *i; in hnumb()
789 return(inumb(i));
797 int i, j, f; local
809 i = atoi();
811 i = *n + f * i;
812 i = quant(i, res);
816 i = 0;
817 return(i);
825 int i, neg; local
833 i = n / m;
834 if ((n - m * i) > (m / 2))
835 i += 1;
836 i *= m;
838 i = -i;
839 return(i);