Home
last modified time | relevance | path

Searched refs:paircnt (Results 1 – 9 of 9) sorted by relevance

/original-bsd/usr.bin/pascal/libpc/
H A DCTTOT.c54 CTTOT(result, lwrbnd, uprbnd, paircnt, singcnt, data) in CTTOT() argument
59 long paircnt; /* number of pairs to construct */
63 return CTTOTA(result, lwrbnd, uprbnd, paircnt, singcnt, &data);
67 CTTOTA(result, lwrbnd, uprbnd, paircnt, singcnt, dataptr) in CTTOTA() argument
72 long paircnt; /* number of pairs to construct */
93 for (cnt = 0; cnt < paircnt; cnt++) {
H A DINCT.c15 INCT(element, paircnt, singcnt, data) in INCT() argument
18 long paircnt; /* number of pairs to check */
25 for (cnt = 0; cnt < paircnt; cnt++) {
/original-bsd/usr.bin/pascal/src/
H A Dcset.c65 csetp -> paircnt = 0;
249 csetp -> paircnt++;
441 putleaf( PCC_ICON , (int) csetp -> paircnt , 0 , PCCT_INT , (char *) 0 );
469 (void) put(2 , O_CON24 , (int)csetp -> paircnt );
H A D0.h521 long paircnt; member
H A Drval.c371 (int)(4 + csetd.singcnt + 2 * csetd.paircnt));
994 (int)(3 + csetd.singcnt + 2*csetd.paircnt));
/original-bsd/old/awk/
H A Dparse.c139 x = node3(paircnt++, a, b, c);
H A Dawk.def124 extern int pairstack[], paircnt;
H A Drun.c31 int pairstack[PA2NUM], paircnt; variable
/original-bsd/contrib/awk.research/
H A Drun.c63 int paircnt; /* number of them in use */ variable