Lines Matching defs:ncols
70 int nlines, int ncols, int begy, int begx)
86 if (ncols == 0) {
87 ncols = columns;
89 ncols -= begx;
99 parent->_maxx < (begx-parent->_begx) + ncols)
109 if (ncols == 0)
110 ncols = parent->_maxx - (begx - parent->_begx);
121 if (columns < begx + ncols) {
146 w->_base = (cchar_t *) malloc((size_t) (nlines * ncols) *
154 w->_line[y] = &w->_line[y-1][ncols];
155 for (x = 0; x < ncols; ++x) {
179 w->_maxx = (short) ncols;
208 } else if (begx + ncols == columns) {
267 int nlines, int ncols, int begy, int begx)
278 w = __m_newwin(parent, nlines, ncols, begy, begx);
284 newwin(int nlines, int ncols, int begy, int begx)
288 w = __m_newwin(NULL, nlines, ncols, begy, begx);
294 subwin(WINDOW *parent, int nlines, int ncols, int begy, int begx)
301 w = __m_newwin(parent, nlines, ncols, begy, begx);