Home | History | Annotate | Line # | Download | only in tail
read.c revision 1.3
      1 /*-
      2  * Copyright (c) 1991 The Regents of the University of California.
      3  * All rights reserved.
      4  *
      5  * This code is derived from software contributed to Berkeley by
      6  * Edward Sze-Tyan Wang.
      7  *
      8  * Redistribution and use in source and binary forms, with or without
      9  * modification, are permitted provided that the following conditions
     10  * are met:
     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.
     23  *
     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
     34  * SUCH DAMAGE.
     35  */
     36 
     37 #ifndef lint
     38 /*static char sccsid[] = "from: @(#)read.c	5.1 (Berkeley) 7/21/91";*/
     39 static char rcsid[] = "$Id: read.c,v 1.3 1994/03/28 02:22:33 cgd Exp $";
     40 #endif /* not lint */
     41 
     42 #include <sys/types.h>
     43 #include <sys/stat.h>
     44 #include <fcntl.h>
     45 #include <errno.h>
     46 #include <unistd.h>
     47 #include <stdio.h>
     48 #include <stdlib.h>
     49 #include <string.h>
     50 #include "extern.h"
     51 
     52 /*
     53  * bytes -- read bytes to an offset from the end and display.
     54  *
     55  * This is the function that reads to a byte offset from the end of the input,
     56  * storing the data in a wrap-around buffer which is then displayed.  If the
     57  * rflag is set, the data is displayed in lines in reverse order, and this
     58  * routine has the usual nastiness of trying to find the newlines.  Otherwise,
     59  * it is displayed from the character closest to the beginning of the input to
     60  * the end.
     61  */
     62 void
     63 bytes(fp, off)
     64 	register FILE *fp;
     65 	off_t off;
     66 {
     67 	register int ch, len, tlen;
     68 	register char *ep, *p, *t;
     69 	int wrap;
     70 	char *sp;
     71 
     72 	if ((sp = p = malloc(off)) == NULL)
     73 		err("%s", strerror(errno));
     74 
     75 	for (wrap = 0, ep = p + off; (ch = getc(fp)) != EOF;) {
     76 		*p = ch;
     77 		if (++p == ep) {
     78 			wrap = 1;
     79 			p = sp;
     80 		}
     81 	}
     82 	if (ferror(fp))
     83 		ierr();
     84 
     85 	if (rflag) {
     86 		for (t = p - 1, len = 0; t >= sp; --t, ++len)
     87 			if (*t == '\n' && len) {
     88 				WR(t + 1, len);
     89 				len = 0;
     90 		}
     91 		if (wrap) {
     92 			tlen = len;
     93 			for (t = ep - 1, len = 0; t >= p; --t, ++len)
     94 				if (*t == '\n') {
     95 					if (len) {
     96 						WR(t + 1, len);
     97 						len = 0;
     98 					}
     99 					if (tlen) {
    100 						WR(sp, tlen);
    101 						tlen = 0;
    102 					}
    103 				}
    104 			if (len)
    105 				WR(t + 1, len);
    106 			if (tlen)
    107 				WR(sp, tlen);
    108 		}
    109 	} else {
    110 		if (wrap && (len = ep - p))
    111 			WR(p, len);
    112 		if (len = p - sp)
    113 			WR(sp, len);
    114 	}
    115 }
    116 
    117 /*
    118  * lines -- read lines to an offset from the end and display.
    119  *
    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
    125  * the end.
    126  */
    127 void
    128 lines(fp, off)
    129 	register FILE *fp;
    130 	off_t off;
    131 {
    132 	struct {
    133 		u_int blen;
    134 		u_int len;
    135 		char *l;
    136 	} *lines;
    137 	register int ch;
    138 	register char *p;
    139 	u_int blen, cnt, recno;
    140 	int wrap;
    141 	char *sp;
    142 
    143 	if ((lines = malloc(off * sizeof(*lines))) == NULL)
    144 		err("%s", strerror(errno));
    145 
    146 	sp = NULL;
    147 	blen = cnt = recno = wrap = 0;
    148 
    149 	while ((ch = getc(fp)) != EOF) {
    150 		if (++cnt > blen) {
    151 			if ((sp = realloc(sp, blen += 1024)) == NULL)
    152 				err("%s", strerror(errno));
    153 			p = sp + cnt - 1;
    154 		}
    155 		*p++ = ch;
    156 		if (ch == '\n') {
    157 			if (lines[recno].blen < cnt) {
    158 				lines[recno].blen = cnt + 256;
    159 				if ((lines[recno].l = realloc(lines[recno].l,
    160 				    lines[recno].blen)) == NULL)
    161 					err("%s", strerror(errno));
    162 			}
    163 			bcopy(sp, lines[recno].l, lines[recno].len = cnt);
    164 			cnt = 0;
    165 			p = sp;
    166 			if (++recno == off) {
    167 				wrap = 1;
    168 				recno = 0;
    169 			}
    170 		}
    171 	}
    172 	if (ferror(fp))
    173 		ierr();
    174 	if (cnt) {
    175 		lines[recno].l = sp;
    176 		lines[recno].len = cnt;
    177 		if (++recno == off) {
    178 			wrap = 1;
    179 			recno = 0;
    180 		}
    181 	}
    182 
    183 	if (rflag) {
    184 		for (cnt = recno - 1; cnt >= 0; --cnt)
    185 			WR(lines[cnt].l, lines[cnt].len);
    186 		if (wrap)
    187 			for (cnt = off - 1; cnt >= recno; --cnt)
    188 				WR(lines[cnt].l, lines[cnt].len);
    189 	} else {
    190 		if (wrap)
    191 			for (cnt = recno; cnt < off; ++cnt)
    192 				WR(lines[cnt].l, lines[cnt].len);
    193 		for (cnt = 0; cnt < recno; ++cnt)
    194 			WR(lines[cnt].l, lines[cnt].len);
    195 	}
    196 }
    197