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 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 #include <sys/types.h>
48 * bytes -- read bytes to an offset from the end and display.
50 * This is the function that reads to a byte offset from the end of the input,
51 * storing the data in a wrap-around buffer which is then displayed. If the
52 * rflag is set, the data is displayed in lines in reverse order, and this
53 * routine has the usual nastiness of trying to find the newlines. Otherwise,
54 * it is displayed from the character closest to the beginning of the input to
58 bytes(FILE *fp
, const char *fn
, off_t off
)
65 if ((sp
= p
= malloc(off
)) == NULL
)
68 for (wrap
= 0, ep
= p
+ off
; (ch
= getc(fp
)) != EOF
; ) {
82 for (t
= p
- 1, len
= 0; t
>= sp
; --t
, ++len
)
83 if (*t
== '\n' && len
) {
89 for (t
= ep
- 1, len
= 0; t
>= p
; --t
, ++len
)
106 if (wrap
&& (len
= ep
- p
))
118 * lines -- read lines to an offset from the end and display.
120 * This is the function that reads to a line offset from the end of the input,
121 * storing the data in an array of buffers which is then displayed. If the
122 * rflag is set, the data is displayed in lines in reverse order, and this
123 * routine has the usual nastiness of trying to find the newlines. Otherwise,
124 * it is displayed from the line closest to the beginning of the input to
128 lines(FILE *fp
, const char *fn
, off_t off
)
137 int blen
, cnt
, recno
, wrap
;
139 if ((llines
= malloc(off
* sizeof (*llines
))) == NULL
)
141 bzero(llines
, off
* sizeof (*llines
));
143 blen
= cnt
= recno
= wrap
= 0;
146 while ((ch
= getc(fp
)) != EOF
) {
148 if ((sp
= realloc(sp
, blen
+= 1024)) == NULL
)
154 if ((int)llines
[recno
].blen
< cnt
) {
155 llines
[recno
].blen
= cnt
+ 256;
156 if ((llines
[recno
].l
= realloc(llines
[recno
].l
,
157 llines
[recno
].blen
)) == NULL
)
160 bcopy(sp
, llines
[recno
].l
, llines
[recno
].len
= cnt
);
163 if (++recno
== off
) {
175 llines
[recno
].l
= sp
;
177 llines
[recno
].len
= cnt
;
178 if (++recno
== off
) {
185 for (cnt
= recno
- 1; cnt
>= 0; --cnt
)
186 WR(llines
[cnt
].l
, llines
[cnt
].len
);
188 for (cnt
= off
- 1; cnt
>= recno
; --cnt
)
189 WR(llines
[cnt
].l
, llines
[cnt
].len
);
192 for (cnt
= recno
; cnt
< off
; ++cnt
)
193 WR(llines
[cnt
].l
, llines
[cnt
].len
);
194 for (cnt
= 0; cnt
< recno
; ++cnt
)
195 WR(llines
[cnt
].l
, llines
[cnt
].len
);
198 for (cnt
= 0; cnt
< off
; cnt
++)