Searched refs:ncol (Results 1 - 25 of 35) sorted by relevance

12

/illumos-gate/usr/src/cmd/vi/misc/
H A Dfold.c95 int ncol; local
99 ncol = 0;
102 ncol = (col + 8) &~ 7;
105 ncol = col ? col - 1 : 0;
108 ncol = 0;
111 ncol = col + 1;
113 if (ncol > fold)
/illumos-gate/usr/src/cmd/eqn/
H A Dmatrix.c37 int nrow, ncol, i, j, k, hb, b, val[100]; local
42 ncol = 0;
44 ncol++;
50 for (i = 0; i < ncol; i++) {
57 for (i = 0; i < ncol; i++) {
64 for (i = 0; i < ncol; i++) {
75 yyval, nrow, ncol, eht[yyval], ebase[yyval]);
77 for (i = 0; i < ncol; i++) {
78 printf("\\*(%d%s", val[i], i == ncol-1 ? "" : space);
/illumos-gate/usr/src/cmd/fold/
H A Dfold.c66 static int ncol = 0; variable
209 ncol = 0;
213 ncol = col + chr_width(c);
215 ncol = (col + 8) &~ 7;
219 ncol = col + chr_width(c);
221 ncol = col ? col - 1 : 0;
225 ncol = col + chr_width(c);
227 ncol = 0;
232 ncol = col + chr_width(c);
234 ncol
[all...]
/illumos-gate/usr/src/cmd/tbl/
H A Dtt.c41 return(c<ncol && ctype(i,c)=='s');
50 if (c < ncol && ctype(i,c)== 's')
61 for(k=1; c<ncol && ctype(i,c)=='s'; k++)
82 for(one=c=0; c<ncol; c++)
H A Dti.c25 if (c>=ncol || c == 0)
33 if (c>=ncol)
53 if (c==ncol)
H A Dt4.c42 nclin=ncol=0;
47 for(i=0; i<ncol; i++)
71 ncol = max(ncol, icol);
72 if (lefline[nclin][ncol]>0) {ncol++; rightl++;};
78 if (ncol==0 || nclin==0)
86 for(icol=0; icol<ncol; icol++)
88 sep[icol] = icol+1<ncol ? 3 : 1;
90 oncol = ncol;
[all...]
H A Dt5.c63 table[nlin] = (struct colstr *) alocv((ncol+2)*sizeof(table[0][0]));
72 for (icol = 0; icol <ncol; icol++)
104 while (++icol <ncol+2)
124 for (c=0; c<ncol;c++)
140 for(icol=1; icol<ncol; icol++)
155 for(jcol=0; jcol<ncol; jcol++)
H A Dt6.c33 for(icol=0; icol <ncol; icol++)
140 for(icol=0; icol<ncol; icol++)
146 for(icol=0; icol<ncol; icol++)
161 for(tsep=icol=0; icol<ncol; icol++)
166 for(icol=0; icol<ncol; icol++)
173 tsep -= sep[ncol-1];
181 for(icol=0; icol<ncol; icol++)
195 fprintf(tabout, ".nr %d (\\n(%d+\\n(%d)/2\n",ncol+CRIGHT-1, ncol+CLEFT-1, ncol
[all...]
H A Dtu.c32 for(cr=c; cr < ncol && (ctype(i,cr)=='s'||type==thish(i,cr)); cr++);
34 for(cr=c+1; cr<ncol && ctype(i,cr)=='s'; cr++);
45 while (cr<ncol)
50 for(cr=cl; cr<ncol; cr++)
53 if (cl<ncol)
54 drawline(i,cl,(cr<ncol?cr-1:cr),lintype,1,0);
75 nodata = cr-cl>=ncol || noheight || allh(i);
138 if (cr+1>=ncol)
162 for(c=0; c<ncol; c++)
H A Dt9.c59 for (icol = 0; icol <ncol; icol++)
80 while (++icol <ncol)
H A Dt0.c55 int nlin, ncol; variable
H A Dt7.c53 for(c=0; c<ncol; c++)
137 drawline(nlin,0,ncol, dboxflg ? '=' : '-',1,0);
142 for(c=0; c<ncol; c++)
157 drawvert (0, nlin-1, ncol, dboxflg? 2 : 1);
H A Dt8.c48 for(c=0; c<ncol; c++)
82 for(c=0; c<ncol; c++)
96 for(c=0; c<ncol; c++)
122 for(c=0; c<ncol; c++)
130 if (rightl && c+1==ncol) continue;
232 exvspen = (c+1 < ncol) && vspen(table[ip][c+1].col) &&
247 if (vct > 7 && c < ncol)
259 for(c=0; c<ncol; c++)
289 for(c=0; c<ncol; c++)
334 for(c=dv=0; c<ncol;
[all...]
H A Dt..c32 extern int nlin, ncol, iline, nclin, nslin;
H A Dtc.c33 for(icol=0; icol<ncol; icol++)
H A Dtb.c25 for(c=0; c<ncol; c++)
H A Dtg.c54 fprintf(tabout, ".ll \\n(%du*%du/%du\n",SL,ctspan(ilin,icol),ncol+1);
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dmvcur.c285 column(struct Sequence *outseq, int ocol, int ncol) argument
292 if (ncol == ocol)
297 add_op(best, __MOVE_COLUMN, ncol, 0);
300 if (ncol < ocol) {
302 dist = ocol - ncol;
305 dist = ncol - ocol;
311 if (ncol < ocol || !relative) {
315 simp_col(try, 0, ncol);
321 simp_col(try, ocol, ncol);
/illumos-gate/usr/src/lib/libcmd/common/
H A Dcut.c258 register int ncol = 0; local
277 if (!(ncol = skip = *(lp = cut->list)))
278 ncol = *++lp;
285 register int w = len < ncol ? len : ncol;
311 ncol = !w && ncol >= len;
319 while (w > 0 && ncol > 0)
321 ncol--;
329 ncol
[all...]
/illumos-gate/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dmvcur.c285 column(outseq, ocol, ncol)
287 int ocol, ncol;
294 if (ncol == ocol)
299 add_op(best, __MOVE_COLUMN, ncol, 0);
302 if (ncol < ocol){
304 dist = ocol - ncol;
307 dist = ncol - ocol;
313 if (ncol < ocol || !relative) {
317 simp_col(try, 0, ncol);
323 simp_col(try, ocol, ncol);
[all...]
/illumos-gate/usr/src/cmd/ldap/ns_ldap/
H A Dldapaddrbac.c68 int ncol, /* number of columns in the database */
89 if ((ecol = (entry_col *)malloc(ncol * sizeof (entry_col) +
92 (void) memset((char *)ecol, 0, ncol * sizeof (ecol));
95 buf = (char (*)[sizeof (*buf)]) (ecol + ncol);
99 for (i = 0; i < ncol; i++, buf = NULL) {
66 genent_attr( char *line, int ncol, entry_col **ecolret) argument
/illumos-gate/usr/src/lib/libtecla/common/
H A Dcplmatch.c143 int ncol; /* The number of columns needed */ member in struct:__anon4068
1047 fmt->nline = fmt->ncol = 0;
1068 fmt->ncol = fmt->term_width / (fmt->column_width + CPL_COL_SEP);
1075 if(fmt->ncol < 1)
1076 fmt->ncol = 1;
1080 fmt->nline = (result->nmatch + fmt->ncol - 1) / fmt->ncol;
1119 * Print the matches in 'ncol' columns, sorted in line order within each
1122 for(col=0; col < fmt->ncol; col++) {
1149 if(col+1 < fmt->ncol) {
[all...]
H A Dexpand.c138 int ncol; /* The number of columns needed */ member in struct:__anon4070
1323 fmt->nline = fmt->ncol = 0;
1343 fmt->ncol = fmt->term_width / (fmt->column_width + EF_COL_SEP);
1350 if(fmt->ncol < 1)
1351 fmt->ncol = 1;
1355 fmt->nline = (result->nfile + fmt->ncol - 1) / fmt->ncol;
1394 * Print the matches in 'ncol' columns, sorted in line order within each
1397 for(col=0; col < fmt->ncol; col++) {
1418 if(col+1 < fmt->ncol) {
[all...]
/illumos-gate/usr/src/lib/smbsrv/libsmb/common/
H A Dsmb_lgrp.c888 int ncol; local
900 rc = sqlite_step(iter->sgi_vm, &ncol, &values, NULL);
911 if (ncol != SMB_LGRP_GTBL_NCOL) {
916 for (i = 0; i < ncol; i++) {
1319 int nrow, ncol; local
1367 rc = sqlite_get_table(db, sql, &result, &nrow, &ncol, &errmsg);
1382 if (nrow != 1 || ncol != SMB_LGRP_GTBL_NCOL) {
1403 int nrow, ncol; local
1411 rc = sqlite_get_table(db, sql, &result, &nrow, &ncol, &errmsg);
1437 int nrow, ncol; local
1622 int nrow, ncol; local
1718 int nrow, ncol; local
1838 int nrow, ncol; local
1904 int nrow, ncol; local
[all...]
/illumos-gate/usr/src/lib/lvm/libmeta/common/
H A Dmeta_raid.c96 uint_t ncol; local
126 ncol = mr->un_totalcolumncnt;
127 assert(ncol >= MD_RAID_MIN);
128 raidp->cols.cols_len = ncol;
149 assert(raidp->orig_ncol <= ncol);
157 for (col = 0; (col < ncol); ++col) {
788 uint_t ncol = raidp->cols.cols_len; local
1004 if (col < ncol) {
1011 column_size * (ncol - orig_ncol),
1012 meta_number_to_string(column_size * (ncol
1929 uint_t ncol; local
2148 uint_t ncol = raidp->cols.cols_len; local
2422 uint_t ncol, col; local
[all...]

Completed in 214 milliseconds

12