* Copyright (c) 1991 The Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
static char sccsid
[] = "@(#)reverse.c 5.3 (Berkeley) 2/12/92";
static void r_buf
__P((FILE *));
static void r_reg
__P((FILE *, enum STYLE
, long, struct stat
*));
* reverse -- display input in reverse order by line.
* There are six separate cases for this -- regular and non-regular
* files by bytes, lines or the whole file.
* REG mmap the file and display the lines
* NOREG cyclically read characters into a wrap-around buffer
* REG mmap the file and display the lines
* NOREG cyclically read lines into a wrap-around array of buffers
* FILE display the entire file
* REG mmap the file and display the lines
* NOREG cyclically read input into a linked list of buffers
reverse(fp
, style
, off
, sbp
)
if (style
!= REVERSE
&& off
== 0)
if (S_ISREG(sbp
->st_mode
))
r_reg(fp
, style
, off
, sbp
);
* r_reg -- display a regular file in reverse order by line.
r_reg(fp
, style
, off
, sbp
)
register enum STYLE style
;
if (!(size
= sbp
->st_size
))
mmap(NULL
, size
, PROT_READ
, MAP_FILE
, fd
, (off_t
)0)) == (caddr_t
)-1)
err("%s", strerror(errno
));
if (style
== RBYTES
&& off
< size
)
/* Last char is special, ignore whether newline or not. */
for (llen
= 1; --size
; ++llen
)
if (style
== RLINES
&& !--off
) {
* r_buf -- display a non-regular file in reverse order by line.
* This is the function that saves the entire input, storing the data in a
* doubly linked list of buffers and then displays them in reverse order.
* It has the usual nastiness of trying to find the newlines, as there's no
* guarantee that a newline occurs anywhere in the file, let alone in any
* particular buffer. If we run out of memory, input is discarded (and the
register BF
*mark
, *tl
, *tr
;
register int ch
, len
, llen
;
for (mark
= NULL
, enomem
= 0;;) {
* Allocate a new block and link it into place in a doubly
* linked list. If out of memory, toss the LRU block and
if (enomem
|| (tl
= malloc(sizeof(BF
))) == NULL
||
(tl
->l
= malloc(BSZ
)) == NULL
) {
err("%s", strerror(errno
));
tl
= enomem
? tl
->next
: mark
;
mark
->next
= mark
->prev
= (mark
= tl
);
/* Fill the block with input data. */
len
< BSZ
&& (ch
= getc(fp
)) != EOF
; ++len
)
* If no input data for this block and we tossed some data,
"tail: warning: %ld bytes discarded\n", enomem
);
* Step through the blocks in the reverse order read. The last char
* is special, ignore whether newline or not.
for (p
= tl
->l
+ (len
= tl
->len
) - 1, llen
= 0; len
--;
for (tr
= tl
->next
; tr
->len
; tr
= tr
->next
) {
if ((tl
= tl
->prev
) == mark
)
while ((tl
= tl
->next
)->len
) {