Lines Matching refs:Ncols

130 static	int	Ncols = 0;  variable
450 Ncols *= 10; in findopt()
451 Ncols += c - '0'; in findopt()
541 if (Ncols == 0) in findopt()
542 Ncols = 1; in findopt()
544 if (mflg && (Ncols > 1)) { in findopt()
550 if (Ncols == 1 && fold) in findopt()
562 Ncols = eargc; in findopt()
564 switch (Ncols) { in findopt()
566 Ncols = 1; in findopt()
579 if ((Fcol = (foldinf *) malloc(sizeof (foldinf) * Ncols)) == NULL) { in findopt()
583 for (i = 0; i < Ncols; i++) in findopt()
587 Linew = Ncols != 1 && Sepc == 0 ? LINEW : 512; in findopt()
600 Linew -= (Multi == 'm') ? numw : numw * Ncols; in findopt()
603 if ((Colw = (Linew - Ncols + 1)/Ncols) < 1) in findopt()
606 if (Ncols != 1 && Multi == 0) { in findopt()
614 Colpts = (COLP) getspace((UNS) ((Ncols + 1) * in findopt()
712 if ((C == WEOF) || (++colno == Ncols) || in putpage()
768 if (++colno == Ncols) in foldpage()
816 for (i = 0; i < Ncols; i++) in foldpage()
819 if (alleof || ++colno == Ncols) in foldpage()
821 } else if (C == EOF || ++colno == Ncols) in foldpage()
834 for (i = 0; i < Ncols; i++) { in foldpage()
879 if (p == &Colpts[Ncols]) in nexbuf()
900 for (*s = WEOF; p <= &Colpts[Ncols]; ++p) in nexbuf()
949 for (i = 0; i < Ncols; i++) in foldbuf()
964 p->c_lno = Colpts[Ncols-1].c_lno; in foldbuf()
965 p->c_skip = Colpts[Ncols].c_skip; in foldbuf()
970 for (*(d+num) = WEOF; (++p) <= &Colpts[Ncols]; ) { in foldbuf()
979 } while (++colno < Ncols); in foldbuf()
995 c = bline % Ncols; in balance()
996 l = (bline + Ncols - 1)/Ncols; in balance()
1006 } while (colno < Ncols - 1); in balance()
1009 l = (lines + Ncols - 1)/Ncols; in balance()
1012 c = Ncols; in balance()
1014 c = lines % Ncols; in balance()
1021 } while (colno < Ncols); in balance()
1038 width = (Ncols == 1) ? Linew : Colw; in readbuf()
1150 if (Ncols == 1) in get()
1170 if (fold && Ncols == 1) in put()
1176 if ((!fold && Ncols < 2) || (Lcolpos < width) || in put()
1256 if ((!fold && Ncols < 2) || (Lcolpos <= width) || in put()