HomeSort by: relevance | last modified time | path
    Searched refs:tcol (Results 1 - 8 of 8) sorted by relevancy

  /src/usr.bin/sort/
init.c 86 * clist (list of columns which correspond to one or more icol or tcol)
115 if (field->tcol.num && field->tcol.num != field->icol.num) {
117 if (field->tcol.num <= clist[i].num)
119 if (field->tcol.num != clist[i].num) {
121 clist[i].num = field->tcol.num;
135 fldtab[0].tcol.p = clist + ncols - 1;
140 if (!fldtab->tcol.num)
142 for (i = 0; fldtab->tcol.num != clist[i].num; i++)
144 fldtab->tcol.p = clist + i
    [all...]
fields.c 178 struct column icol, tcol; local
182 tcol = cur_fld->tcol;
191 if (!tcol.num)
194 if (tcol.indent) {
195 end = tcol.p->start;
198 end += tcol.indent;
201 end = tcol.p->end;
sort.h 87 #define BT 0x40 /* ignore blanks in tcol */
152 struct column tcol; member in struct:field
  /src/games/rogue/
room.c 447 monster->tcol = rooms[rr].doors[k].oth_col;
449 (monster->tcol == col)) {
464 monster->tcol = j;
476 monster->tcol = rooms[rn].doors[k].oth_col;
490 monster->tcol = col;
monster.c 368 (monster->tcol == monster->col)) {
372 col = monster->tcol;
444 monster->tcol = get_rand(0, (DCOLS - 1));
585 monster->tcol = col;
743 monster->tcol = rooms[rn].doors[d].door_col;
rogue.h 235 short trow, tcol; /* target row, col */ member in struct:obj
  /src/sys/dev/raidframe/
rf_map.c 600 RF_RowCol_t tcol, pcol, *diskids, i; local
632 &tcol, &diskOffset, 0);
633 RF_ASSERT(tcol == diskids[i]);
653 RF_RowCol_t tcol, i; local
670 &tcol, &diskOffset, 0);
671 if (RF_DEAD_DISK(raidPtr->Disks[tcol].status))
  /src/bin/ksh/
vi.c 1787 int tcur, tcol; local
1792 holdcol1 = holdcol2 = tcol = 0;
1794 if (tcol - holdcol2 > winwidth / 2) {
1798 holdcol2 = tcol;
1800 tcol = newcol((unsigned char) es->cbuf[tcur++], tcol);
1802 while (tcol - holdcol1 > winwidth / 2)

Completed in 45 milliseconds