1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
|
/*
* $XFree86: xc/programs/xterm/tabs.c,v 3.10 2002/03/26 01:46:40 dickey Exp $
*/
/* $Xorg: tabs.c,v 1.3 2000/08/17 19:55:09 cpqbld Exp $ */
/*
* Copyright 2000,2002 by Thomas E. Dickey
*
* All Rights Reserved
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE ABOVE LISTED COPYRIGHT HOLDER(S) BE LIABLE FOR ANY
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* Except as contained in this notice, the name(s) of the above copyright
* holders shall not be used in advertising or otherwise to promote the
* sale, use or other dealings in this Software without prior written
* authorization.
*
* Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts.
*
* All Rights Reserved
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted,
* provided that the above copyright notice appear in all copies and that
* both that copyright notice and this permission notice appear in
* supporting documentation, and that the name of Digital Equipment
* Corporation not be used in advertising or publicity pertaining to
* distribution of the software without specific, written prior permission.
*
*
* DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
* DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
* ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
* WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
* SOFTWARE.
*/
/* tabs.c */
#include <xterm.h>
#include <data.h>
/*
* This file presumes 32bits/word. This is somewhat of a crock, and should
* be fixed sometime.
*/
#define TAB_INDEX(n) ((n) >> 5)
#define TAB_MASK(n) (1 << ((n) & (TAB_BITS_WIDTH-1)))
#define SET_TAB(tabs,n) tabs[TAB_INDEX(n)] |= TAB_MASK(n)
#define CLR_TAB(tabs,n) tabs[TAB_INDEX(n)] &= ~TAB_MASK(n)
#define TST_TAB(tabs,n) tabs[TAB_INDEX(n)] & TAB_MASK(n)
/*
* places tabstops at only every 8 columns
*/
void
TabReset(Tabs tabs)
{
register int i;
for (i = 0; i < TAB_ARRAY_SIZE; ++i)
tabs[i] = 0;
for (i = 0; i < MAX_TABS; i += 8)
TabSet(tabs, i);
}
/*
* places a tabstop at col
*/
void
TabSet(Tabs tabs, int col)
{
SET_TAB(tabs, col);
}
/*
* clears a tabstop at col
*/
void
TabClear(Tabs tabs, int col)
{
CLR_TAB(tabs, col);
}
/*
* returns the column of the next tabstop
* (or MAX_TABS - 1 if there are no more).
* A tabstop at col is ignored.
*/
int
TabNext(Tabs tabs, int col)
{
register TScreen *screen = &term->screen;
if (screen->curses && screen->do_wrap && (term->flags & WRAPAROUND)) {
xtermIndex(screen, 1);
col = screen->cur_col = screen->do_wrap = 0;
}
for (++col; col < MAX_TABS; ++col)
if (TST_TAB(tabs, col))
return (col);
return (MAX_TABS - 1);
}
/*
* returns the column of the previous tabstop
* (or 0 if there are no more).
* A tabstop at col is ignored.
*/
int
TabPrev(Tabs tabs, int col)
{
for (--col; col >= 0; --col)
if (TST_TAB(tabs, col))
return (col);
return (0);
}
/*
* Tab to the next stop, returning true if the cursor moved
*/
Boolean
TabToNextStop(void)
{
register TScreen *screen = &term->screen;
int saved_column = screen->cur_col;
screen->cur_col = TabNext(term->tabs, screen->cur_col);
if (screen->cur_col > CurMaxCol(screen, screen->cur_row))
screen->cur_col = CurMaxCol(screen, screen->cur_row);
return (screen->cur_col > saved_column);
}
/*
* Tab to the previous stop, returning true if the cursor moved
*/
Boolean
TabToPrevStop(void)
{
register TScreen *screen = &term->screen;
int saved_column = screen->cur_col;
screen->cur_col = TabPrev(term->tabs, screen->cur_col);
return (screen->cur_col < saved_column);
}
/*
* clears all tabs
*/
void
TabZonk(Tabs tabs)
{
register int i;
for (i = 0; i < TAB_ARRAY_SIZE; ++i)
tabs[i] = 0;
}
|
