Lines Matching defs:i
57 #define NHASH(i) ((i>>6)^i)&0177
63 int i, j;
68 if ((i = cbits(ii = getach())) == '+')
70 else if (i == '-')
76 if ((i = getsn()) == 0)
78 if ((i & 0177) == '.')
79 switch (i >> BYTE) {
81 i = pts;
84 i = lss;
87 i = font;
90 i = pl;
93 i = findt1();
96 i = po;
99 i = ll;
101 case 'i':
102 i = in;
105 i = frame->nargs;
108 i = ascii;
111 i = numtab[CD].val;
114 i = lastl;
117 i = ralss;
120 i = dip->hnl;
124 i = dip->dnl;
126 i = numtab[NL].val;
129 i = fi;
132 i = ad + 2 * admod;
135 i = widthp;
138 i = nel;
141 i = un;
144 i = dotT;
147 i = VERT;
150 i = HOR;
153 i = ne;
156 i = print;
159 i = ls;
162 i = NN - regcnt;
165 i = dip->curd;
166 *pbp++ = (i >> BYTE) & BYTEMASK;
167 *pbp++ = i & BYTEMASK;
170 i = bdtab[font];
181 if ((j = findr(i)) == -1)
182 i = 0;
184 i = numtab[j].val = (numtab[j].val+numtab[j].inc*f);
188 setn1(i, nform, (tchar) 0);
197 wrc(i)
198 tchar i;
202 *numbufp++ = i;
208 /* insert into input number i, in format form, with size-font bits bits */
210 setn1(i, form, bits)
211 int i;
219 fnumb(i, wrc);
231 int i;
233 for (i=0; i<128; i++)
234 nhash[i] = 0;
240 i = NHASH(p->r);
241 p->link = nhash[i];
242 nhash[i] = p;
272 findr(i)
273 int i;
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 */
301 int i;
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;
331 case 'i':
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)
366 if (nform == '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;
432 i = 0;
446 i = ckph();
449 acc += i;
452 i = ckph();
455 acc -= i;
458 i = ckph();
461 acc *= i;
464 i = ckph();
467 if (i == 0) {
472 acc /= i;
475 i = ckph();
478 acc %= i;
481 i = ckph();
484 if ((acc > 0) && (i > 0))
490 i = ckph();
493 if ((acc > 0) || (i > 0))
501 i = ckph();
506 if (i == acc)
517 i = ckph();
522 if (acc > (i - k))
533 i = ckph();
538 if (acc < (i + k))
555 tchar i;
560 if (cbits(i = getch()) == '(')
563 j = atoi1(i);
572 int i, j, digits;
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;
642 case 'i': /*Inches*/
644 i = 1;
649 i = 127;
653 i = 6;
658 i = dfactd;
663 acc = (acc * j) / i;
689 int i, j;
693 while (!skip() && (i = getrq()) ) {
694 j = usedr(i);
710 int i, j;
714 if ((i = findr(getrq())) == -1)
717 j = inumb(&numtab[i].val);
720 numtab[i].val = j;
725 numtab[i].inc = j;
734 int i, k;
738 if (skip() || !(i = getrq()) || skip())
749 numtab[findr(i)].fmt = k & BYTEMASK;
757 int i, j;
759 i = usedr(getsn());
760 if (i == -1)
762 if (numtab[i].fmt > 20) /* it was probably a, A, i or I */
763 *pbp++ = numtab[i].fmt;
765 for (j = (numtab[i].fmt ? numtab[i].fmt : 1); j; j--)
773 vnumb(i)
774 int *i;
779 return(inumb(i));
784 hnumb(i)
785 int *i;
789 return(inumb(i));
797 int i, j, f;
809 i = atoi();
811 i = *n + f * i;
812 i = quant(i, res);
816 i = 0;
817 return(i);
825 int i, neg;
832 /* better as i = ((n + (m/2))/m)*m */
833 i = n / m;
834 if ((n - m * i) > (m / 2))
835 i += 1;
836 i *= m;
838 i = -i;
839 return(i);