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

  /src/usr.bin/expand/
expand.c 55 size_t tabstops[100]; variable
110 } while (((column - 1) % tabstops[0])
111 != (tabstops[0] - 1));
115 if (tabstops[n] > column)
122 while (column < tabstops[n]) {
162 if (nstops > 0 && (size_t)i <= tabstops[nstops-1])
164 if (nstops == sizeof(tabstops) / sizeof(tabstops[0]) - 1)
165 errx(EXIT_FAILURE, "Too many tabstops");
166 tabstops[nstops++] = i
    [all...]
expand.c 55 size_t tabstops[100]; variable
110 } while (((column - 1) % tabstops[0])
111 != (tabstops[0] - 1));
115 if (tabstops[n] > column)
122 while (column < tabstops[n]) {
162 if (nstops > 0 && (size_t)i <= tabstops[nstops-1])
164 if (nstops == sizeof(tabstops) / sizeof(tabstops[0]) - 1)
165 errx(EXIT_FAILURE, "Too many tabstops");
166 tabstops[nstops++] = i
    [all...]
  /src/usr.bin/unexpand/
unexpand.c 62 static size_t *tabstops; variable
102 tabstops = erealloc(tabstops, maxstops);
104 if (nstops && tabstops[nstops - 1] >= (size_t)i)
108 tab, tabstops[nstops - 1]);
109 tabstops[nstops++] = i;
135 const size_t dstop = (nstops == 0) ? DSTOP : tabstops[0];
140 limit = nstops <= 1 ? UINT_MAX : tabstops[nstops - 1] - 1;
151 for (n = 0; n < nstops && tabstops[n] <= dcol; n++)
153 if (n < nstops - 1 && tabstops[n] - 1 < limit)
    [all...]
unexpand.c 62 static size_t *tabstops; variable
102 tabstops = erealloc(tabstops, maxstops);
104 if (nstops && tabstops[nstops - 1] >= (size_t)i)
108 tab, tabstops[nstops - 1]);
109 tabstops[nstops++] = i;
135 const size_t dstop = (nstops == 0) ? DSTOP : tabstops[0];
140 limit = nstops <= 1 ? UINT_MAX : tabstops[nstops - 1] - 1;
151 for (n = 0; n < nstops && tabstops[n] <= dcol; n++)
153 if (n < nstops - 1 && tabstops[n] - 1 < limit)
    [all...]
  /src/external/bsd/less/dist/
optfunc.c 68 extern int tabstops[];
683 /* Start at 1 because tabstops[0] is always zero. */
695 if (!v && n > tabstops[i-1])
696 tabstops[i++] = n;
705 tabdefault = tabstops[ntabstops-1] - tabstops[ntabstops-2];
731 sprintf(msg+strlen(msg), "%d", tabstops[i]);
optfunc.c 68 extern int tabstops[];
683 /* Start at 1 because tabstops[0] is always zero. */
695 if (!v && n > tabstops[i-1])
696 tabstops[i++] = n;
705 tabdefault = tabstops[ntabstops-1] - tabstops[ntabstops-2];
731 sprintf(msg+strlen(msg), "%d", tabstops[i]);
line.c 62 public int tabstops[TABSTOP_MAX] = { 0 }; /* Custom tabstops */ variable
63 public int ntabstops = 1; /* Number of tabstops */
64 public int tabdefault = 8; /* Default repeated tabstops */
839 if (ntabstops < 2 || to_tab >= tabstops[ntabstops-1])
841 ((to_tab - tabstops[ntabstops-1]) % tabdefault);
846 if (to_tab >= tabstops[i])
848 to_tab = tabstops[i+1] - to_tab;
line.c 62 public int tabstops[TABSTOP_MAX] = { 0 }; /* Custom tabstops */ variable
63 public int ntabstops = 1; /* Number of tabstops */
64 public int tabdefault = 8; /* Default repeated tabstops */
839 if (ntabstops < 2 || to_tab >= tabstops[ntabstops-1])
841 ((to_tab - tabstops[ntabstops-1]) % tabdefault);
846 if (to_tab >= tabstops[i])
848 to_tab = tabstops[i+1] - to_tab;

Completed in 137 milliseconds