position.c revision 1.4 1 1.4 agc /* $NetBSD: position.c,v 1.4 2003/08/07 09:28:01 agc Exp $ */
2 1.2 perry
3 1.1 cjs /*
4 1.1 cjs * Copyright (c) 1988, 1993
5 1.1 cjs * The Regents of the University of California. All rights reserved.
6 1.1 cjs *
7 1.1 cjs * Redistribution and use in source and binary forms, with or without
8 1.1 cjs * modification, are permitted provided that the following conditions
9 1.1 cjs * are met:
10 1.1 cjs * 1. Redistributions of source code must retain the above copyright
11 1.1 cjs * notice, this list of conditions and the following disclaimer.
12 1.1 cjs * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cjs * notice, this list of conditions and the following disclaimer in the
14 1.1 cjs * documentation and/or other materials provided with the distribution.
15 1.4 agc * 3. Neither the name of the University nor the names of its contributors
16 1.4 agc * may be used to endorse or promote products derived from this software
17 1.4 agc * without specific prior written permission.
18 1.4 agc *
19 1.4 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.4 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.4 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.4 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.4 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.4 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.4 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.4 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.4 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.4 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.4 agc * SUCH DAMAGE.
30 1.4 agc */
31 1.4 agc
32 1.4 agc /*
33 1.4 agc * Copyright (c) 1988 Mark Nudleman
34 1.4 agc *
35 1.4 agc * Redistribution and use in source and binary forms, with or without
36 1.4 agc * modification, are permitted provided that the following conditions
37 1.4 agc * are met:
38 1.4 agc * 1. Redistributions of source code must retain the above copyright
39 1.4 agc * notice, this list of conditions and the following disclaimer.
40 1.4 agc * 2. Redistributions in binary form must reproduce the above copyright
41 1.4 agc * notice, this list of conditions and the following disclaimer in the
42 1.4 agc * documentation and/or other materials provided with the distribution.
43 1.1 cjs * 3. All advertising materials mentioning features or use of this software
44 1.1 cjs * must display the following acknowledgement:
45 1.1 cjs * This product includes software developed by the University of
46 1.1 cjs * California, Berkeley and its contributors.
47 1.1 cjs * 4. Neither the name of the University nor the names of its contributors
48 1.1 cjs * may be used to endorse or promote products derived from this software
49 1.1 cjs * without specific prior written permission.
50 1.1 cjs *
51 1.1 cjs * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
52 1.1 cjs * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
53 1.1 cjs * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
54 1.1 cjs * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
55 1.1 cjs * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
56 1.1 cjs * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
57 1.1 cjs * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
58 1.1 cjs * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
59 1.1 cjs * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
60 1.1 cjs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61 1.1 cjs * SUCH DAMAGE.
62 1.1 cjs */
63 1.1 cjs
64 1.3 christos #include <sys/cdefs.h>
65 1.1 cjs #ifndef lint
66 1.3 christos #if 0
67 1.1 cjs static char sccsid[] = "@(#)position.c 8.1 (Berkeley) 6/6/93";
68 1.3 christos #else
69 1.4 agc __RCSID("$NetBSD: position.c,v 1.4 2003/08/07 09:28:01 agc Exp $");
70 1.3 christos #endif
71 1.1 cjs #endif /* not lint */
72 1.1 cjs
73 1.1 cjs /*
74 1.1 cjs * Routines dealing with the "position" table.
75 1.1 cjs * This is a table which tells the position (in the input file) of the
76 1.1 cjs * first char on each currently displayed line.
77 1.1 cjs *
78 1.1 cjs * {{ The position table is scrolled by moving all the entries.
79 1.1 cjs * Would be better to have a circular table
80 1.1 cjs * and just change a couple of pointers. }}
81 1.1 cjs */
82 1.1 cjs
83 1.1 cjs #include <sys/types.h>
84 1.3 christos #include <stdlib.h>
85 1.3 christos
86 1.3 christos #include "less.h"
87 1.3 christos #include "extern.h"
88 1.1 cjs
89 1.1 cjs static off_t *table; /* The position table */
90 1.1 cjs static int tablesize;
91 1.1 cjs
92 1.1 cjs /*
93 1.1 cjs * Return the starting file position of a line displayed on the screen.
94 1.1 cjs * The line may be specified as a line number relative to the top
95 1.1 cjs * of the screen, but is usually one of these special cases:
96 1.1 cjs * the top (first) line on the screen
97 1.1 cjs * the second line on the screen
98 1.1 cjs * the bottom line on the screen
99 1.1 cjs * the line after the bottom line on the screen
100 1.1 cjs */
101 1.1 cjs off_t
102 1.1 cjs position(where)
103 1.1 cjs int where;
104 1.1 cjs {
105 1.1 cjs switch (where)
106 1.1 cjs {
107 1.1 cjs case BOTTOM:
108 1.1 cjs where = sc_height - 2;
109 1.1 cjs break;
110 1.1 cjs case BOTTOM_PLUS_ONE:
111 1.1 cjs where = sc_height - 1;
112 1.1 cjs break;
113 1.1 cjs case MIDDLE:
114 1.1 cjs where = sc_height / 2;
115 1.1 cjs }
116 1.1 cjs return (table[where]);
117 1.1 cjs }
118 1.1 cjs
119 1.1 cjs /*
120 1.1 cjs * Add a new file position to the bottom of the position table.
121 1.1 cjs */
122 1.3 christos void
123 1.1 cjs add_forw_pos(pos)
124 1.1 cjs off_t pos;
125 1.1 cjs {
126 1.3 christos int i;
127 1.1 cjs
128 1.1 cjs /*
129 1.1 cjs * Scroll the position table up.
130 1.1 cjs */
131 1.1 cjs for (i = 1; i < sc_height; i++)
132 1.1 cjs table[i-1] = table[i];
133 1.1 cjs table[sc_height - 1] = pos;
134 1.1 cjs }
135 1.1 cjs
136 1.1 cjs /*
137 1.1 cjs * Add a new file position to the top of the position table.
138 1.1 cjs */
139 1.3 christos void
140 1.1 cjs add_back_pos(pos)
141 1.1 cjs off_t pos;
142 1.1 cjs {
143 1.3 christos int i;
144 1.1 cjs
145 1.1 cjs /*
146 1.1 cjs * Scroll the position table down.
147 1.1 cjs */
148 1.1 cjs for (i = sc_height - 1; i > 0; i--)
149 1.1 cjs table[i] = table[i-1];
150 1.1 cjs table[0] = pos;
151 1.1 cjs }
152 1.1 cjs
153 1.3 christos void
154 1.1 cjs copytable()
155 1.1 cjs {
156 1.3 christos int a, b;
157 1.1 cjs
158 1.1 cjs for (a = 0; a < sc_height && table[a] == NULL_POSITION; a++);
159 1.1 cjs for (b = 0; a < sc_height; a++, b++) {
160 1.1 cjs table[b] = table[a];
161 1.1 cjs table[a] = NULL_POSITION;
162 1.1 cjs }
163 1.1 cjs }
164 1.1 cjs
165 1.1 cjs /*
166 1.1 cjs * Initialize the position table, done whenever we clear the screen.
167 1.1 cjs */
168 1.3 christos void
169 1.1 cjs pos_clear()
170 1.1 cjs {
171 1.3 christos int i;
172 1.1 cjs
173 1.1 cjs if (table == 0) {
174 1.1 cjs tablesize = sc_height > 25 ? sc_height : 25;
175 1.1 cjs table = (off_t *)malloc(tablesize * sizeof *table);
176 1.1 cjs } else if (sc_height >= tablesize) {
177 1.1 cjs tablesize = sc_height;
178 1.1 cjs table = (off_t *)realloc(table, tablesize * sizeof *table);
179 1.1 cjs }
180 1.1 cjs
181 1.1 cjs for (i = 0; i < sc_height; i++)
182 1.1 cjs table[i] = NULL_POSITION;
183 1.1 cjs }
184 1.1 cjs
185 1.1 cjs /*
186 1.1 cjs * See if the byte at a specified position is currently on the screen.
187 1.1 cjs * Check the position table to see if the position falls within its range.
188 1.1 cjs * Return the position table entry if found, -1 if not.
189 1.1 cjs */
190 1.3 christos int
191 1.1 cjs onscreen(pos)
192 1.1 cjs off_t pos;
193 1.1 cjs {
194 1.3 christos int i;
195 1.1 cjs
196 1.1 cjs if (pos < table[0])
197 1.1 cjs return (-1);
198 1.1 cjs for (i = 1; i < sc_height; i++)
199 1.1 cjs if (pos < table[i])
200 1.1 cjs return (i-1);
201 1.1 cjs return (-1);
202 1.1 cjs }
203