Lines Matching refs:Ncols
132 static int Ncols = 0;
452 Ncols *= 10;
453 Ncols += c - '0';
543 if (Ncols == 0)
544 Ncols = 1;
546 if (mflg && (Ncols > 1)) {
552 if (Ncols == 1 && fold)
564 Ncols = eargc;
566 switch (Ncols) {
568 Ncols = 1;
581 if ((Fcol = (foldinf *) malloc(sizeof (foldinf) * Ncols)) == NULL) {
585 for (i = 0; i < Ncols; i++)
589 Linew = Ncols != 1 && Sepc == 0 ? LINEW : 512;
602 Linew -= (Multi == 'm') ? numw : numw * Ncols;
605 if ((Colw = (Linew - Ncols + 1)/Ncols) < 1)
608 if (Ncols != 1 && Multi == 0) {
616 Colpts = (COLP) getspace((UNS) ((Ncols + 1) *
714 if ((C == WEOF) || (++colno == Ncols) ||
770 if (++colno == Ncols)
818 for (i = 0; i < Ncols; i++)
821 if (alleof || ++colno == Ncols)
823 } else if (C == EOF || ++colno == Ncols)
836 for (i = 0; i < Ncols; i++) {
881 if (p == &Colpts[Ncols])
902 for (*s = WEOF; p <= &Colpts[Ncols]; ++p)
951 for (i = 0; i < Ncols; i++)
966 p->c_lno = Colpts[Ncols-1].c_lno;
967 p->c_skip = Colpts[Ncols].c_skip;
972 for (*(d+num) = WEOF; (++p) <= &Colpts[Ncols]; ) {
981 } while (++colno < Ncols);
997 c = bline % Ncols;
998 l = (bline + Ncols - 1)/Ncols;
1008 } while (colno < Ncols - 1);
1011 l = (lines + Ncols - 1)/Ncols;
1014 c = Ncols;
1016 c = lines % Ncols;
1023 } while (colno < Ncols);
1040 width = (Ncols == 1) ? Linew : Colw;
1151 if (Ncols == 1)
1171 if (fold && Ncols == 1)
1177 if ((!fold && Ncols < 2) || (Lcolpos < width) ||
1257 if ((!fold && Ncols < 2) || (Lcolpos <= width) ||