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