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