2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Edward Sze-Tyan Wang.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 static char sccsid[] = "@(#)reverse.c 8.1 (Berkeley) 6/6/93";
43 #include <sys/cdefs.h>
44 __FBSDID("$FreeBSD$");
46 #include <sys/param.h>
60 static void r_buf(FILE *);
61 static void r_reg(FILE *, enum STYLE, off_t, struct stat *);
64 * reverse -- display input in reverse order by line.
66 * There are six separate cases for this -- regular and non-regular
67 * files by bytes, lines or the whole file.
69 * BYTES display N bytes
70 * REG mmap the file and display the lines
71 * NOREG cyclically read characters into a wrap-around buffer
73 * LINES display N lines
74 * REG mmap the file and display the lines
75 * NOREG cyclically read lines into a wrap-around array of buffers
77 * FILE display the entire file
78 * REG mmap the file and display the lines
79 * NOREG cyclically read input into a linked list of buffers
82 reverse(fp, style, off, sbp)
88 if (style != REVERSE && off == 0)
91 if (S_ISREG(sbp->st_mode))
92 r_reg(fp, style, off, sbp);
112 * r_reg -- display a regular file in reverse order by line.
115 r_reg(fp, style, off, sbp)
122 off_t curoff, size, lineend;
125 if (!(size = sbp->st_size))
129 map.mapoff = map.maxoff = size;
133 * Last char is special, ignore whether newline or not. Note that
134 * size == 0 is dealt with above, and size == 1 sets curoff to -1.
138 while (curoff >= 0) {
139 if (curoff < map.mapoff || curoff >= map.mapoff + map.maplen) {
140 if (maparound(&map, curoff) != 0) {
145 for (i = curoff - map.mapoff; i >= 0; i--) {
146 if (style == RBYTES && --off == 0)
148 if (map.start[i] == '\n')
151 /* `i' is either the map offset of a '\n', or -1. */
152 curoff = map.mapoff + i;
156 /* Print the line and update offsets. */
157 if (mapprint(&map, curoff + 1, lineend - curoff - 1) != 0) {
161 lineend = curoff + 1;
167 if (off == 0 && style != REVERSE) {
168 /* Avoid printing anything below. */
173 if (curoff < 0 && mapprint(&map, 0, lineend) != 0) {
177 if (map.start != NULL && munmap(map.start, map.maplen))
189 * r_buf -- display a non-regular file in reverse order by line.
191 * This is the function that saves the entire input, storing the data in a
192 * doubly linked list of buffers and then displays them in reverse order.
193 * It has the usual nastiness of trying to find the newlines, as there's no
194 * guarantee that a newline occurs anywhere in the file, let alone in any
195 * particular buffer. If we run out of memory, input is discarded (and the
207 #define BSZ (128 * 1024)
208 for (mark = NULL, enomem = 0;;) {
210 * Allocate a new block and link it into place in a doubly
211 * linked list. If out of memory, toss the LRU block and
214 if (enomem || (tl = malloc(sizeof(BF))) == NULL ||
215 (tl->l = malloc(BSZ)) == NULL) {
218 tl = enomem ? tl->next : mark;
222 tl->prev = mark->prev;
223 mark->prev->next = tl;
227 mark->next = mark->prev = mark;
230 /* Fill the block with input data. */
231 for (p = tl->l, len = 0;
232 len < BSZ && (ch = getc(fp)) != EOF; ++len)
241 * If no input data for this block and we tossed some data,
257 warnx("warning: %qd bytes discarded", enomem);
262 * Step through the blocks in the reverse order read. The last char
263 * is special, ignore whether newline or not.
266 for (p = tl->l + (len = tl->len) - 1, llen = 0; len--;
275 for (tr = tl->next; tr->len; tr = tr->next) {
283 if ((tl = tl->prev) == mark)
291 while ((tl = tl->next)->len) {