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
37 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
42 static const char sccsid[] = "@(#)reverse.c 8.1 (Berkeley) 6/6/93";
45 #include <sys/param.h>
59 static void r_buf(FILE *);
60 static void r_reg(FILE *, enum STYLE, off_t, struct stat *);
63 * reverse -- display input in reverse order by line.
65 * There are six separate cases for this -- regular and non-regular
66 * files by bytes, lines or the whole file.
68 * BYTES display N bytes
69 * REG mmap the file and display the lines
70 * NOREG cyclically read characters into a wrap-around buffer
72 * LINES display N lines
73 * REG mmap the file and display the lines
74 * NOREG cyclically read lines into a wrap-around array of buffers
76 * FILE display the entire file
77 * REG mmap the file and display the lines
78 * NOREG cyclically read input into a linked list of buffers
81 reverse(fp, style, off, sbp)
87 if (style != REVERSE && off == 0)
90 if (S_ISREG(sbp->st_mode))
91 r_reg(fp, style, off, sbp);
110 * r_reg -- display a regular file in reverse order by line.
113 r_reg(fp, style, off, sbp)
120 off_t curoff, size, lineend;
123 if (!(size = sbp->st_size))
127 map.mapoff = map.maxoff = size;
131 * Last char is special, ignore whether newline or not. Note that
132 * size == 0 is dealt with above, and size == 1 sets curoff to -1.
136 while (curoff >= 0) {
137 if (curoff < map.mapoff || curoff >= map.mapoff + map.maplen) {
138 if (maparound(&map, curoff) != 0) {
143 for (i = curoff - map.mapoff; i >= 0; i--) {
144 if (style == RBYTES && --off == 0)
146 if (map.start[i] == '\n')
149 /* `i' is either the map offset of a '\n', or -1. */
150 curoff = map.mapoff + i;
154 /* Print the line and update offsets. */
155 if (mapprint(&map, curoff + 1, lineend - curoff - 1) != 0) {
159 lineend = curoff + 1;
165 if (off == 0 && style != REVERSE) {
166 /* Avoid printing anything below. */
171 if (curoff < 0 && mapprint(&map, 0, lineend) != 0) {
175 if (map.start != NULL && munmap(map.start, map.maplen))
187 * r_buf -- display a non-regular file in reverse order by line.
189 * This is the function that saves the entire input, storing the data in a
190 * doubly linked list of buffers and then displays them in reverse order.
191 * It has the usual nastiness of trying to find the newlines, as there's no
192 * guarantee that a newline occurs anywhere in the file, let alone in any
193 * particular buffer. If we run out of memory, input is discarded (and the
205 #define BSZ (128 * 1024)
206 for (mark = NULL, enomem = 0;;) {
208 * Allocate a new block and link it into place in a doubly
209 * linked list. If out of memory, toss the LRU block and
212 if (enomem || (tl = malloc(sizeof(BF))) == NULL ||
213 (tl->l = malloc(BSZ)) == NULL) {
216 tl = enomem ? tl->next : mark;
220 tl->prev = mark->prev;
221 mark->prev->next = tl;
224 mark->next = mark->prev = (mark = tl);
226 /* Fill the block with input data. */
227 for (p = tl->l, len = 0;
228 len < BSZ && (ch = getc(fp)) != EOF; ++len)
237 * If no input data for this block and we tossed some data,
253 warnx("warning: %qd bytes discarded", enomem);
258 * Step through the blocks in the reverse order read. The last char
259 * is special, ignore whether newline or not.
262 for (p = tl->l + (len = tl->len) - 1, llen = 0; len--;
271 for (tr = tl->next; tr->len; tr = tr->next) {
279 if ((tl = tl->prev) == mark)
287 while ((tl = tl->next)->len) {