prim.c revision 1.3 1 1.3 perry /* $NetBSD: prim.c,v 1.3 1998/01/09 08:03:35 perry Exp $ */
2 1.3 perry
3 1.1 cjs /*
4 1.1 cjs * Copyright (c) 1988 Mark Nudleman
5 1.1 cjs * Copyright (c) 1988, 1993
6 1.1 cjs * The Regents of the University of California. All rights reserved.
7 1.1 cjs *
8 1.1 cjs * Redistribution and use in source and binary forms, with or without
9 1.1 cjs * modification, are permitted provided that the following conditions
10 1.1 cjs * are met:
11 1.1 cjs * 1. Redistributions of source code must retain the above copyright
12 1.1 cjs * notice, this list of conditions and the following disclaimer.
13 1.1 cjs * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cjs * notice, this list of conditions and the following disclaimer in the
15 1.1 cjs * documentation and/or other materials provided with the distribution.
16 1.1 cjs * 3. All advertising materials mentioning features or use of this software
17 1.1 cjs * must display the following acknowledgement:
18 1.1 cjs * This product includes software developed by the University of
19 1.1 cjs * California, Berkeley and its contributors.
20 1.1 cjs * 4. Neither the name of the University nor the names of its contributors
21 1.1 cjs * may be used to endorse or promote products derived from this software
22 1.1 cjs * without specific prior written permission.
23 1.1 cjs *
24 1.1 cjs * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cjs * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cjs * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cjs * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cjs * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cjs * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cjs * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cjs * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cjs * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cjs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cjs * SUCH DAMAGE.
35 1.1 cjs */
36 1.1 cjs
37 1.1 cjs #ifndef lint
38 1.1 cjs static char sccsid[] = "@(#)prim.c 8.1 (Berkeley) 6/6/93";
39 1.1 cjs #endif /* not lint */
40 1.1 cjs
41 1.1 cjs /*
42 1.1 cjs * Primitives for displaying the file on the screen.
43 1.1 cjs */
44 1.1 cjs
45 1.1 cjs #include <sys/types.h>
46 1.1 cjs #include <stdio.h>
47 1.1 cjs #include <ctype.h>
48 1.1 cjs #include <less.h>
49 1.1 cjs
50 1.1 cjs int back_scroll = -1;
51 1.1 cjs int hit_eof; /* keeps track of how many times we hit end of file */
52 1.1 cjs int screen_trashed;
53 1.1 cjs
54 1.1 cjs static int squished;
55 1.1 cjs
56 1.1 cjs extern int sigs;
57 1.1 cjs extern int top_scroll;
58 1.1 cjs extern int sc_width, sc_height;
59 1.1 cjs extern int caseless;
60 1.1 cjs extern int linenums;
61 1.1 cjs extern char *line;
62 1.1 cjs extern int retain_below;
63 1.1 cjs
64 1.1 cjs off_t position(), forw_line(), back_line(), forw_raw_line(), back_raw_line();
65 1.1 cjs off_t ch_length(), ch_tell();
66 1.1 cjs
67 1.2 cjs static match(char *, char *);
68 1.2 cjs
69 1.1 cjs /*
70 1.1 cjs * Check to see if the end of file is currently "displayed".
71 1.1 cjs */
72 1.1 cjs eof_check()
73 1.1 cjs {
74 1.1 cjs off_t pos;
75 1.1 cjs
76 1.1 cjs if (sigs)
77 1.1 cjs return;
78 1.1 cjs /*
79 1.1 cjs * If the bottom line is empty, we are at EOF.
80 1.1 cjs * If the bottom line ends at the file length,
81 1.1 cjs * we must be just at EOF.
82 1.1 cjs */
83 1.1 cjs pos = position(BOTTOM_PLUS_ONE);
84 1.1 cjs if (pos == NULL_POSITION || pos == ch_length())
85 1.1 cjs hit_eof++;
86 1.1 cjs }
87 1.1 cjs
88 1.1 cjs /*
89 1.1 cjs * If the screen is "squished", repaint it.
90 1.1 cjs * "Squished" means the first displayed line is not at the top
91 1.1 cjs * of the screen; this can happen when we display a short file
92 1.1 cjs * for the first time.
93 1.1 cjs */
94 1.1 cjs squish_check()
95 1.1 cjs {
96 1.1 cjs if (squished) {
97 1.1 cjs squished = 0;
98 1.1 cjs repaint();
99 1.1 cjs }
100 1.1 cjs }
101 1.1 cjs
102 1.1 cjs /*
103 1.1 cjs * Display n lines, scrolling forward, starting at position pos in the
104 1.1 cjs * input file. "only_last" means display only the last screenful if
105 1.1 cjs * n > screen size.
106 1.1 cjs */
107 1.1 cjs forw(n, pos, only_last)
108 1.1 cjs register int n;
109 1.1 cjs off_t pos;
110 1.1 cjs int only_last;
111 1.1 cjs {
112 1.1 cjs extern int short_file;
113 1.1 cjs static int first_time = 1;
114 1.1 cjs int eof = 0, do_repaint;
115 1.1 cjs
116 1.1 cjs squish_check();
117 1.1 cjs
118 1.1 cjs /*
119 1.1 cjs * do_repaint tells us not to display anything till the end,
120 1.1 cjs * then just repaint the entire screen.
121 1.1 cjs */
122 1.1 cjs do_repaint = (only_last && n > sc_height-1);
123 1.1 cjs
124 1.1 cjs if (!do_repaint) {
125 1.1 cjs if (top_scroll && n >= sc_height - 1) {
126 1.1 cjs /*
127 1.1 cjs * Start a new screen.
128 1.1 cjs * {{ This is not really desirable if we happen
129 1.1 cjs * to hit eof in the middle of this screen,
130 1.1 cjs * but we don't yet know if that will happen. }}
131 1.1 cjs */
132 1.1 cjs clear();
133 1.1 cjs home();
134 1.1 cjs } else {
135 1.1 cjs lower_left();
136 1.1 cjs clear_eol();
137 1.1 cjs }
138 1.1 cjs
139 1.1 cjs /*
140 1.1 cjs * This is not contiguous with what is currently displayed.
141 1.1 cjs * Clear the screen image (position table) and start a new
142 1.1 cjs * screen.
143 1.1 cjs */
144 1.1 cjs if (pos != position(BOTTOM_PLUS_ONE)) {
145 1.1 cjs pos_clear();
146 1.1 cjs add_forw_pos(pos);
147 1.1 cjs if (top_scroll) {
148 1.1 cjs clear();
149 1.1 cjs home();
150 1.1 cjs } else if (!first_time)
151 1.1 cjs putstr("...skipping...\n");
152 1.1 cjs }
153 1.1 cjs }
154 1.1 cjs
155 1.1 cjs for (short_file = 0; --n >= 0;) {
156 1.1 cjs /*
157 1.1 cjs * Read the next line of input.
158 1.1 cjs */
159 1.1 cjs pos = forw_line(pos);
160 1.1 cjs if (pos == NULL_POSITION) {
161 1.1 cjs /*
162 1.1 cjs * end of file; copy the table if the file was
163 1.1 cjs * too small for an entire screen.
164 1.1 cjs */
165 1.1 cjs eof = 1;
166 1.1 cjs if (position(TOP) == NULL_POSITION) {
167 1.1 cjs copytable();
168 1.1 cjs if (!position(TOP))
169 1.1 cjs short_file = 1;
170 1.1 cjs }
171 1.1 cjs break;
172 1.1 cjs }
173 1.1 cjs /*
174 1.1 cjs * Add the position of the next line to the position table.
175 1.1 cjs * Display the current line on the screen.
176 1.1 cjs */
177 1.1 cjs add_forw_pos(pos);
178 1.1 cjs if (do_repaint)
179 1.1 cjs continue;
180 1.1 cjs /*
181 1.1 cjs * If this is the first screen displayed and we hit an early
182 1.1 cjs * EOF (i.e. before the requested number of lines), we
183 1.1 cjs * "squish" the display down at the bottom of the screen.
184 1.1 cjs */
185 1.2 cjs if (first_time && line == NULL && !top_scroll) {
186 1.1 cjs squished = 1;
187 1.1 cjs continue;
188 1.1 cjs }
189 1.1 cjs put_line();
190 1.1 cjs }
191 1.1 cjs
192 1.1 cjs if (eof && !sigs)
193 1.1 cjs hit_eof++;
194 1.1 cjs else
195 1.1 cjs eof_check();
196 1.1 cjs if (do_repaint)
197 1.1 cjs repaint();
198 1.1 cjs first_time = 0;
199 1.1 cjs (void) currline(BOTTOM);
200 1.1 cjs }
201 1.1 cjs
202 1.1 cjs /*
203 1.1 cjs * Display n lines, scrolling backward.
204 1.1 cjs */
205 1.1 cjs back(n, pos, only_last)
206 1.1 cjs register int n;
207 1.1 cjs off_t pos;
208 1.1 cjs int only_last;
209 1.1 cjs {
210 1.1 cjs int do_repaint;
211 1.1 cjs
212 1.1 cjs squish_check();
213 1.1 cjs do_repaint = (n > get_back_scroll() || (only_last && n > sc_height-1));
214 1.1 cjs hit_eof = 0;
215 1.1 cjs while (--n >= 0)
216 1.1 cjs {
217 1.1 cjs /*
218 1.1 cjs * Get the previous line of input.
219 1.1 cjs */
220 1.1 cjs pos = back_line(pos);
221 1.1 cjs if (pos == NULL_POSITION)
222 1.1 cjs break;
223 1.1 cjs /*
224 1.1 cjs * Add the position of the previous line to the position table.
225 1.1 cjs * Display the line on the screen.
226 1.1 cjs */
227 1.1 cjs add_back_pos(pos);
228 1.1 cjs if (!do_repaint)
229 1.1 cjs {
230 1.1 cjs if (retain_below)
231 1.1 cjs {
232 1.1 cjs lower_left();
233 1.1 cjs clear_eol();
234 1.1 cjs }
235 1.1 cjs home();
236 1.1 cjs add_line();
237 1.1 cjs put_line();
238 1.1 cjs }
239 1.1 cjs }
240 1.1 cjs
241 1.1 cjs eof_check();
242 1.1 cjs if (do_repaint)
243 1.1 cjs repaint();
244 1.1 cjs (void) currline(BOTTOM);
245 1.1 cjs }
246 1.1 cjs
247 1.1 cjs /*
248 1.1 cjs * Display n more lines, forward.
249 1.1 cjs * Start just after the line currently displayed at the bottom of the screen.
250 1.1 cjs */
251 1.1 cjs forward(n, only_last)
252 1.1 cjs int n;
253 1.1 cjs int only_last;
254 1.1 cjs {
255 1.1 cjs off_t pos;
256 1.1 cjs
257 1.1 cjs if (hit_eof) {
258 1.1 cjs /*
259 1.1 cjs * If we're trying to go forward from end-of-file,
260 1.1 cjs * go on to the next file.
261 1.1 cjs */
262 1.1 cjs next_file(1);
263 1.1 cjs return;
264 1.1 cjs }
265 1.1 cjs
266 1.1 cjs pos = position(BOTTOM_PLUS_ONE);
267 1.1 cjs if (pos == NULL_POSITION)
268 1.1 cjs {
269 1.1 cjs hit_eof++;
270 1.1 cjs return;
271 1.1 cjs }
272 1.1 cjs forw(n, pos, only_last);
273 1.1 cjs }
274 1.1 cjs
275 1.1 cjs /*
276 1.1 cjs * Display n more lines, backward.
277 1.1 cjs * Start just before the line currently displayed at the top of the screen.
278 1.1 cjs */
279 1.1 cjs backward(n, only_last)
280 1.1 cjs int n;
281 1.1 cjs int only_last;
282 1.1 cjs {
283 1.1 cjs off_t pos;
284 1.1 cjs
285 1.1 cjs pos = position(TOP);
286 1.1 cjs /*
287 1.1 cjs * This will almost never happen, because the top line is almost
288 1.1 cjs * never empty.
289 1.1 cjs */
290 1.1 cjs if (pos == NULL_POSITION)
291 1.1 cjs return;
292 1.1 cjs back(n, pos, only_last);
293 1.1 cjs }
294 1.1 cjs
295 1.1 cjs /*
296 1.1 cjs * Repaint the screen, starting from a specified position.
297 1.1 cjs */
298 1.1 cjs prepaint(pos)
299 1.1 cjs off_t pos;
300 1.1 cjs {
301 1.1 cjs hit_eof = 0;
302 1.1 cjs forw(sc_height-1, pos, 0);
303 1.1 cjs screen_trashed = 0;
304 1.1 cjs }
305 1.1 cjs
306 1.1 cjs /*
307 1.1 cjs * Repaint the screen.
308 1.1 cjs */
309 1.1 cjs repaint()
310 1.1 cjs {
311 1.1 cjs /*
312 1.1 cjs * Start at the line currently at the top of the screen
313 1.1 cjs * and redisplay the screen.
314 1.1 cjs */
315 1.1 cjs prepaint(position(TOP));
316 1.1 cjs }
317 1.1 cjs
318 1.1 cjs /*
319 1.1 cjs * Jump to the end of the file.
320 1.1 cjs * It is more convenient to paint the screen backward,
321 1.1 cjs * from the end of the file toward the beginning.
322 1.1 cjs */
323 1.1 cjs jump_forw()
324 1.1 cjs {
325 1.1 cjs off_t pos;
326 1.1 cjs
327 1.1 cjs if (ch_end_seek())
328 1.1 cjs {
329 1.1 cjs error("Cannot seek to end of file");
330 1.1 cjs return;
331 1.1 cjs }
332 1.1 cjs lastmark();
333 1.1 cjs pos = ch_tell();
334 1.1 cjs clear();
335 1.1 cjs pos_clear();
336 1.1 cjs add_back_pos(pos);
337 1.1 cjs back(sc_height - 1, pos, 0);
338 1.1 cjs }
339 1.1 cjs
340 1.1 cjs /*
341 1.1 cjs * Jump to line n in the file.
342 1.1 cjs */
343 1.1 cjs jump_back(n)
344 1.1 cjs register int n;
345 1.1 cjs {
346 1.1 cjs register int c, nlines;
347 1.1 cjs
348 1.1 cjs /*
349 1.1 cjs * This is done the slow way, by starting at the beginning
350 1.1 cjs * of the file and counting newlines.
351 1.1 cjs *
352 1.1 cjs * {{ Now that we have line numbering (in linenum.c),
353 1.1 cjs * we could improve on this by starting at the
354 1.1 cjs * nearest known line rather than at the beginning. }}
355 1.1 cjs */
356 1.1 cjs if (ch_seek((off_t)0)) {
357 1.1 cjs /*
358 1.1 cjs * Probably a pipe with beginning of file no longer buffered.
359 1.1 cjs * If he wants to go to line 1, we do the best we can,
360 1.1 cjs * by going to the first line which is still buffered.
361 1.1 cjs */
362 1.1 cjs if (n <= 1 && ch_beg_seek() == 0)
363 1.1 cjs jump_loc(ch_tell());
364 1.1 cjs error("Cannot get to beginning of file");
365 1.1 cjs return;
366 1.1 cjs }
367 1.1 cjs
368 1.1 cjs /*
369 1.1 cjs * Start counting lines.
370 1.1 cjs */
371 1.1 cjs for (nlines = 1; nlines < n; nlines++)
372 1.1 cjs while ((c = ch_forw_get()) != '\n')
373 1.1 cjs if (c == EOI) {
374 1.1 cjs char message[40];
375 1.1 cjs (void)sprintf(message, "File has only %d lines",
376 1.1 cjs nlines - 1);
377 1.1 cjs error(message);
378 1.1 cjs return;
379 1.1 cjs }
380 1.1 cjs jump_loc(ch_tell());
381 1.1 cjs }
382 1.1 cjs
383 1.1 cjs /*
384 1.1 cjs * Jump to a specified percentage into the file.
385 1.1 cjs * This is a poor compensation for not being able to
386 1.1 cjs * quickly jump to a specific line number.
387 1.1 cjs */
388 1.1 cjs jump_percent(percent)
389 1.1 cjs int percent;
390 1.1 cjs {
391 1.1 cjs off_t pos, len, ch_length();
392 1.1 cjs register int c;
393 1.1 cjs
394 1.1 cjs /*
395 1.1 cjs * Determine the position in the file
396 1.1 cjs * (the specified percentage of the file's length).
397 1.1 cjs */
398 1.1 cjs if ((len = ch_length()) == NULL_POSITION)
399 1.1 cjs {
400 1.1 cjs error("Don't know length of file");
401 1.1 cjs return;
402 1.1 cjs }
403 1.1 cjs pos = (percent * len) / 100;
404 1.1 cjs
405 1.1 cjs /*
406 1.1 cjs * Back up to the beginning of the line.
407 1.1 cjs */
408 1.1 cjs if (ch_seek(pos) == 0)
409 1.1 cjs {
410 1.1 cjs while ((c = ch_back_get()) != '\n' && c != EOI)
411 1.1 cjs ;
412 1.1 cjs if (c == '\n')
413 1.1 cjs (void) ch_forw_get();
414 1.1 cjs pos = ch_tell();
415 1.1 cjs }
416 1.1 cjs jump_loc(pos);
417 1.1 cjs }
418 1.1 cjs
419 1.1 cjs /*
420 1.1 cjs * Jump to a specified position in the file.
421 1.1 cjs */
422 1.1 cjs jump_loc(pos)
423 1.1 cjs off_t pos;
424 1.1 cjs {
425 1.1 cjs register int nline;
426 1.1 cjs off_t tpos;
427 1.1 cjs
428 1.1 cjs if ((nline = onscreen(pos)) >= 0) {
429 1.1 cjs /*
430 1.1 cjs * The line is currently displayed.
431 1.1 cjs * Just scroll there.
432 1.1 cjs */
433 1.1 cjs forw(nline, position(BOTTOM_PLUS_ONE), 0);
434 1.1 cjs return;
435 1.1 cjs }
436 1.1 cjs
437 1.1 cjs /*
438 1.1 cjs * Line is not on screen.
439 1.1 cjs * Seek to the desired location.
440 1.1 cjs */
441 1.1 cjs if (ch_seek(pos)) {
442 1.1 cjs error("Cannot seek to that position");
443 1.1 cjs return;
444 1.1 cjs }
445 1.1 cjs
446 1.1 cjs /*
447 1.1 cjs * See if the desired line is BEFORE the currently displayed screen.
448 1.1 cjs * If so, then move forward far enough so the line we're on will be
449 1.1 cjs * at the bottom of the screen, in order to be able to call back()
450 1.1 cjs * to make the screen scroll backwards & put the line at the top of
451 1.1 cjs * the screen.
452 1.1 cjs * {{ This seems inefficient, but it's not so bad,
453 1.1 cjs * since we can never move forward more than a
454 1.1 cjs * screenful before we stop to redraw the screen. }}
455 1.1 cjs */
456 1.1 cjs tpos = position(TOP);
457 1.1 cjs if (tpos != NULL_POSITION && pos < tpos) {
458 1.1 cjs off_t npos = pos;
459 1.1 cjs /*
460 1.1 cjs * Note that we can't forw_line() past tpos here,
461 1.1 cjs * so there should be no EOI at this stage.
462 1.1 cjs */
463 1.1 cjs for (nline = 0; npos < tpos && nline < sc_height - 1; nline++)
464 1.1 cjs npos = forw_line(npos);
465 1.1 cjs
466 1.1 cjs if (npos < tpos) {
467 1.1 cjs /*
468 1.1 cjs * More than a screenful back.
469 1.1 cjs */
470 1.1 cjs lastmark();
471 1.1 cjs clear();
472 1.1 cjs pos_clear();
473 1.1 cjs add_back_pos(npos);
474 1.1 cjs }
475 1.1 cjs
476 1.1 cjs /*
477 1.1 cjs * Note that back() will repaint() if nline > back_scroll.
478 1.1 cjs */
479 1.1 cjs back(nline, npos, 0);
480 1.1 cjs return;
481 1.1 cjs }
482 1.1 cjs /*
483 1.1 cjs * Remember where we were; clear and paint the screen.
484 1.1 cjs */
485 1.1 cjs lastmark();
486 1.1 cjs prepaint(pos);
487 1.1 cjs }
488 1.1 cjs
489 1.1 cjs /*
490 1.1 cjs * The table of marks.
491 1.1 cjs * A mark is simply a position in the file.
492 1.1 cjs */
493 1.1 cjs #define NMARKS (27) /* 26 for a-z plus one for quote */
494 1.1 cjs #define LASTMARK (NMARKS-1) /* For quote */
495 1.1 cjs static off_t marks[NMARKS];
496 1.1 cjs
497 1.1 cjs /*
498 1.1 cjs * Initialize the mark table to show no marks are set.
499 1.1 cjs */
500 1.1 cjs init_mark()
501 1.1 cjs {
502 1.1 cjs int i;
503 1.1 cjs
504 1.1 cjs for (i = 0; i < NMARKS; i++)
505 1.1 cjs marks[i] = NULL_POSITION;
506 1.1 cjs }
507 1.1 cjs
508 1.1 cjs /*
509 1.1 cjs * See if a mark letter is valid (between a and z).
510 1.1 cjs */
511 1.1 cjs static int
512 1.1 cjs badmark(c)
513 1.1 cjs int c;
514 1.1 cjs {
515 1.1 cjs if (c < 'a' || c > 'z')
516 1.1 cjs {
517 1.1 cjs error("Choose a letter between 'a' and 'z'");
518 1.1 cjs return (1);
519 1.1 cjs }
520 1.1 cjs return (0);
521 1.1 cjs }
522 1.1 cjs
523 1.1 cjs /*
524 1.1 cjs * Set a mark.
525 1.1 cjs */
526 1.1 cjs setmark(c)
527 1.1 cjs int c;
528 1.1 cjs {
529 1.1 cjs if (badmark(c))
530 1.1 cjs return;
531 1.1 cjs marks[c-'a'] = position(TOP);
532 1.1 cjs }
533 1.1 cjs
534 1.1 cjs lastmark()
535 1.1 cjs {
536 1.1 cjs marks[LASTMARK] = position(TOP);
537 1.1 cjs }
538 1.1 cjs
539 1.1 cjs /*
540 1.1 cjs * Go to a previously set mark.
541 1.1 cjs */
542 1.1 cjs gomark(c)
543 1.1 cjs int c;
544 1.1 cjs {
545 1.1 cjs off_t pos;
546 1.1 cjs
547 1.1 cjs if (c == '\'') {
548 1.1 cjs pos = marks[LASTMARK];
549 1.1 cjs if (pos == NULL_POSITION)
550 1.1 cjs pos = 0;
551 1.1 cjs }
552 1.1 cjs else {
553 1.1 cjs if (badmark(c))
554 1.1 cjs return;
555 1.1 cjs pos = marks[c-'a'];
556 1.1 cjs if (pos == NULL_POSITION) {
557 1.1 cjs error("mark not set");
558 1.1 cjs return;
559 1.1 cjs }
560 1.1 cjs }
561 1.1 cjs jump_loc(pos);
562 1.1 cjs }
563 1.1 cjs
564 1.1 cjs /*
565 1.1 cjs * Get the backwards scroll limit.
566 1.1 cjs * Must call this function instead of just using the value of
567 1.1 cjs * back_scroll, because the default case depends on sc_height and
568 1.1 cjs * top_scroll, as well as back_scroll.
569 1.1 cjs */
570 1.1 cjs get_back_scroll()
571 1.1 cjs {
572 1.1 cjs if (back_scroll >= 0)
573 1.1 cjs return (back_scroll);
574 1.1 cjs if (top_scroll)
575 1.1 cjs return (sc_height - 2);
576 1.1 cjs return (sc_height - 1);
577 1.1 cjs }
578 1.1 cjs
579 1.1 cjs /*
580 1.1 cjs * Search for the n-th occurence of a specified pattern,
581 1.1 cjs * either forward or backward.
582 1.1 cjs */
583 1.1 cjs search(search_forward, pattern, n, wantmatch)
584 1.1 cjs register int search_forward;
585 1.1 cjs register char *pattern;
586 1.1 cjs register int n;
587 1.1 cjs int wantmatch;
588 1.1 cjs {
589 1.1 cjs off_t pos, linepos;
590 1.1 cjs register char *p;
591 1.1 cjs register char *q;
592 1.1 cjs int linenum;
593 1.1 cjs int linematch;
594 1.1 cjs #ifdef RECOMP
595 1.1 cjs char *re_comp();
596 1.1 cjs char *errmsg;
597 1.1 cjs #else
598 1.1 cjs #ifdef REGCMP
599 1.1 cjs char *regcmp();
600 1.1 cjs static char *cpattern = NULL;
601 1.1 cjs #else
602 1.1 cjs static char lpbuf[100];
603 1.1 cjs static char *last_pattern = NULL;
604 1.1 cjs char *strcpy();
605 1.1 cjs #endif
606 1.1 cjs #endif
607 1.1 cjs
608 1.1 cjs /*
609 1.1 cjs * For a caseless search, convert any uppercase in the pattern to
610 1.1 cjs * lowercase.
611 1.1 cjs */
612 1.1 cjs if (caseless && pattern != NULL)
613 1.1 cjs for (p = pattern; *p; p++)
614 1.1 cjs if (isupper(*p))
615 1.1 cjs *p = tolower(*p);
616 1.1 cjs #ifdef RECOMP
617 1.1 cjs
618 1.1 cjs /*
619 1.1 cjs * (re_comp handles a null pattern internally,
620 1.1 cjs * so there is no need to check for a null pattern here.)
621 1.1 cjs */
622 1.1 cjs if ((errmsg = re_comp(pattern)) != NULL)
623 1.1 cjs {
624 1.1 cjs error(errmsg);
625 1.1 cjs return(0);
626 1.1 cjs }
627 1.1 cjs #else
628 1.1 cjs #ifdef REGCMP
629 1.1 cjs if (pattern == NULL || *pattern == '\0')
630 1.1 cjs {
631 1.1 cjs /*
632 1.1 cjs * A null pattern means use the previous pattern.
633 1.1 cjs * The compiled previous pattern is in cpattern, so just use it.
634 1.1 cjs */
635 1.1 cjs if (cpattern == NULL)
636 1.1 cjs {
637 1.1 cjs error("No previous regular expression");
638 1.1 cjs return(0);
639 1.1 cjs }
640 1.1 cjs } else
641 1.1 cjs {
642 1.1 cjs /*
643 1.1 cjs * Otherwise compile the given pattern.
644 1.1 cjs */
645 1.1 cjs char *s;
646 1.1 cjs if ((s = regcmp(pattern, 0)) == NULL)
647 1.1 cjs {
648 1.1 cjs error("Invalid pattern");
649 1.1 cjs return(0);
650 1.1 cjs }
651 1.1 cjs if (cpattern != NULL)
652 1.1 cjs free(cpattern);
653 1.1 cjs cpattern = s;
654 1.1 cjs }
655 1.1 cjs #else
656 1.1 cjs if (pattern == NULL || *pattern == '\0')
657 1.1 cjs {
658 1.1 cjs /*
659 1.1 cjs * Null pattern means use the previous pattern.
660 1.1 cjs */
661 1.1 cjs if (last_pattern == NULL)
662 1.1 cjs {
663 1.1 cjs error("No previous regular expression");
664 1.1 cjs return(0);
665 1.1 cjs }
666 1.1 cjs pattern = last_pattern;
667 1.1 cjs } else
668 1.1 cjs {
669 1.1 cjs (void)strcpy(lpbuf, pattern);
670 1.1 cjs last_pattern = lpbuf;
671 1.1 cjs }
672 1.1 cjs #endif
673 1.1 cjs #endif
674 1.1 cjs
675 1.1 cjs /*
676 1.1 cjs * Figure out where to start the search.
677 1.1 cjs */
678 1.1 cjs
679 1.1 cjs if (position(TOP) == NULL_POSITION) {
680 1.1 cjs /*
681 1.1 cjs * Nothing is currently displayed. Start at the beginning
682 1.1 cjs * of the file. (This case is mainly for searches from the
683 1.1 cjs * command line.
684 1.1 cjs */
685 1.1 cjs pos = (off_t)0;
686 1.1 cjs } else if (!search_forward) {
687 1.1 cjs /*
688 1.1 cjs * Backward search: start just before the top line
689 1.1 cjs * displayed on the screen.
690 1.1 cjs */
691 1.1 cjs pos = position(TOP);
692 1.1 cjs } else {
693 1.1 cjs /*
694 1.1 cjs * Start at the second screen line displayed on the screen.
695 1.1 cjs */
696 1.1 cjs pos = position(TOP_PLUS_ONE);
697 1.1 cjs }
698 1.1 cjs
699 1.1 cjs if (pos == NULL_POSITION)
700 1.1 cjs {
701 1.1 cjs /*
702 1.1 cjs * Can't find anyplace to start searching from.
703 1.1 cjs */
704 1.1 cjs error("Nothing to search");
705 1.1 cjs return(0);
706 1.1 cjs }
707 1.1 cjs
708 1.1 cjs linenum = find_linenum(pos);
709 1.1 cjs for (;;)
710 1.1 cjs {
711 1.1 cjs /*
712 1.1 cjs * Get lines until we find a matching one or
713 1.1 cjs * until we hit end-of-file (or beginning-of-file
714 1.1 cjs * if we're going backwards).
715 1.1 cjs */
716 1.1 cjs if (sigs)
717 1.1 cjs /*
718 1.1 cjs * A signal aborts the search.
719 1.1 cjs */
720 1.1 cjs return(0);
721 1.1 cjs
722 1.1 cjs if (search_forward)
723 1.1 cjs {
724 1.1 cjs /*
725 1.1 cjs * Read the next line, and save the
726 1.1 cjs * starting position of that line in linepos.
727 1.1 cjs */
728 1.1 cjs linepos = pos;
729 1.1 cjs pos = forw_raw_line(pos);
730 1.1 cjs if (linenum != 0)
731 1.1 cjs linenum++;
732 1.1 cjs } else
733 1.1 cjs {
734 1.1 cjs /*
735 1.1 cjs * Read the previous line and save the
736 1.1 cjs * starting position of that line in linepos.
737 1.1 cjs */
738 1.1 cjs pos = back_raw_line(pos);
739 1.1 cjs linepos = pos;
740 1.1 cjs if (linenum != 0)
741 1.1 cjs linenum--;
742 1.1 cjs }
743 1.1 cjs
744 1.1 cjs if (pos == NULL_POSITION)
745 1.1 cjs {
746 1.1 cjs /*
747 1.1 cjs * We hit EOF/BOF without a match.
748 1.1 cjs */
749 1.1 cjs error("Pattern not found");
750 1.1 cjs return(0);
751 1.1 cjs }
752 1.1 cjs
753 1.1 cjs /*
754 1.1 cjs * If we're using line numbers, we might as well
755 1.1 cjs * remember the information we have now (the position
756 1.1 cjs * and line number of the current line).
757 1.1 cjs */
758 1.1 cjs if (linenums)
759 1.1 cjs add_lnum(linenum, pos);
760 1.1 cjs
761 1.1 cjs /*
762 1.1 cjs * If this is a caseless search, convert uppercase in the
763 1.1 cjs * input line to lowercase.
764 1.1 cjs */
765 1.1 cjs if (caseless)
766 1.1 cjs for (p = q = line; *p; p++, q++)
767 1.1 cjs *q = isupper(*p) ? tolower(*p) : *p;
768 1.1 cjs
769 1.1 cjs /*
770 1.1 cjs * Remove any backspaces along with the preceeding char.
771 1.1 cjs * This allows us to match text which is underlined or
772 1.1 cjs * overstruck.
773 1.1 cjs */
774 1.1 cjs for (p = q = line; *p; p++, q++)
775 1.1 cjs if (q > line && *p == '\b')
776 1.1 cjs /* Delete BS and preceeding char. */
777 1.1 cjs q -= 2;
778 1.1 cjs else
779 1.1 cjs /* Otherwise, just copy. */
780 1.1 cjs *q = *p;
781 1.1 cjs
782 1.1 cjs /*
783 1.1 cjs * Test the next line to see if we have a match.
784 1.1 cjs * This is done in a variety of ways, depending
785 1.1 cjs * on what pattern matching functions are available.
786 1.1 cjs */
787 1.1 cjs #ifdef REGCMP
788 1.1 cjs linematch = (regex(cpattern, line) != NULL);
789 1.1 cjs #else
790 1.1 cjs #ifdef RECOMP
791 1.1 cjs linematch = (re_exec(line) == 1);
792 1.1 cjs #else
793 1.1 cjs linematch = match(pattern, line);
794 1.1 cjs #endif
795 1.1 cjs #endif
796 1.1 cjs /*
797 1.1 cjs * We are successful if wantmatch and linematch are
798 1.1 cjs * both true (want a match and got it),
799 1.1 cjs * or both false (want a non-match and got it).
800 1.1 cjs */
801 1.1 cjs if (((wantmatch && linematch) || (!wantmatch && !linematch)) &&
802 1.1 cjs --n <= 0)
803 1.1 cjs /*
804 1.1 cjs * Found the line.
805 1.1 cjs */
806 1.1 cjs break;
807 1.1 cjs }
808 1.1 cjs jump_loc(linepos);
809 1.1 cjs return(1);
810 1.1 cjs }
811 1.1 cjs
812 1.1 cjs #if !defined(REGCMP) && !defined(RECOMP)
813 1.1 cjs /*
814 1.1 cjs * We have neither regcmp() nor re_comp().
815 1.1 cjs * We use this function to do simple pattern matching.
816 1.1 cjs * It supports no metacharacters like *, etc.
817 1.1 cjs */
818 1.1 cjs static
819 1.1 cjs match(pattern, buf)
820 1.1 cjs char *pattern, *buf;
821 1.1 cjs {
822 1.1 cjs register char *pp, *lp;
823 1.1 cjs
824 1.1 cjs for ( ; *buf != '\0'; buf++)
825 1.1 cjs {
826 1.1 cjs for (pp = pattern, lp = buf; *pp == *lp; pp++, lp++)
827 1.1 cjs if (*pp == '\0' || *lp == '\0')
828 1.1 cjs break;
829 1.1 cjs if (*pp == '\0')
830 1.1 cjs return (1);
831 1.1 cjs }
832 1.1 cjs return (0);
833 1.1 cjs }
834 1.1 cjs #endif
835