read.c revision 1.5
1 /* $NetBSD: read.c,v 1.5 1997/10/19 23:45:09 lukem Exp $ */ 2 3 /*- 4 * Copyright (c) 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Edward Sze-Tyan Wang. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 */ 38 39 #include <sys/cdefs.h> 40 #ifndef lint 41 #if 0 42 static char sccsid[] = "@(#)read.c 8.1 (Berkeley) 6/6/93"; 43 #endif 44 __RCSID("$NetBSD: read.c,v 1.5 1997/10/19 23:45:09 lukem Exp $"); 45 #endif /* not lint */ 46 47 #include <sys/types.h> 48 #include <sys/stat.h> 49 #include <fcntl.h> 50 #include <errno.h> 51 #include <unistd.h> 52 #include <stdio.h> 53 #include <stdlib.h> 54 #include <string.h> 55 #include "extern.h" 56 57 /* 58 * bytes -- read bytes to an offset from the end and display. 59 * 60 * This is the function that reads to a byte offset from the end of the input, 61 * storing the data in a wrap-around buffer which is then displayed. If the 62 * rflag is set, the data is displayed in lines in reverse order, and this 63 * routine has the usual nastiness of trying to find the newlines. Otherwise, 64 * it is displayed from the character closest to the beginning of the input to 65 * the end. 66 */ 67 void 68 bytes(fp, off) 69 FILE *fp; 70 off_t off; 71 { 72 int ch, len, tlen; 73 char *ep, *p, *t; 74 int wrap; 75 char *sp; 76 77 if ((sp = p = malloc(off)) == NULL) 78 err(1, "%s", strerror(errno)); 79 80 for (wrap = 0, ep = p + off; (ch = getc(fp)) != EOF;) { 81 *p = ch; 82 if (++p == ep) { 83 wrap = 1; 84 p = sp; 85 } 86 } 87 if (ferror(fp)) { 88 ierr(); 89 return; 90 } 91 92 if (rflag) { 93 for (t = p - 1, len = 0; t >= sp; --t, ++len) 94 if (*t == '\n' && len) { 95 WR(t + 1, len); 96 len = 0; 97 } 98 if (wrap) { 99 tlen = len; 100 for (t = ep - 1, len = 0; t >= p; --t, ++len) 101 if (*t == '\n') { 102 if (len) { 103 WR(t + 1, len); 104 len = 0; 105 } 106 if (tlen) { 107 WR(sp, tlen); 108 tlen = 0; 109 } 110 } 111 if (len) 112 WR(t + 1, len); 113 if (tlen) 114 WR(sp, tlen); 115 } 116 } else { 117 if (wrap && (len = ep - p)) 118 WR(p, len); 119 if ((len = p - sp) == 0) 120 WR(sp, len); 121 } 122 } 123 124 /* 125 * lines -- read lines to an offset from the end and display. 126 * 127 * This is the function that reads to a line offset from the end of the input, 128 * storing the data in an array of buffers which is then displayed. If the 129 * rflag is set, the data is displayed in lines in reverse order, and this 130 * routine has the usual nastiness of trying to find the newlines. Otherwise, 131 * it is displayed from the line closest to the beginning of the input to 132 * the end. 133 */ 134 void 135 lines(fp, off) 136 FILE *fp; 137 off_t off; 138 { 139 struct { 140 u_int blen; 141 u_int len; 142 char *l; 143 } *lines; 144 int ch; 145 char *p; 146 int blen, cnt, recno, wrap; 147 char *sp; 148 149 p = NULL; 150 if ((lines = malloc(off * sizeof(*lines))) == NULL) 151 err(1, "%s", strerror(errno)); 152 153 sp = NULL; 154 blen = cnt = recno = wrap = 0; 155 156 while ((ch = getc(fp)) != EOF) { 157 if (++cnt > blen) { 158 if ((sp = realloc(sp, blen += 1024)) == NULL) 159 err(1, "%s", strerror(errno)); 160 p = sp + cnt - 1; 161 } 162 *p++ = ch; 163 if (ch == '\n') { 164 if (lines[recno].blen < cnt) { 165 lines[recno].blen = cnt + 256; 166 if ((lines[recno].l = realloc(lines[recno].l, 167 lines[recno].blen)) == NULL) 168 err(1, "%s", strerror(errno)); 169 } 170 memmove(lines[recno].l, sp, lines[recno].len = cnt); 171 cnt = 0; 172 p = sp; 173 if (++recno == off) { 174 wrap = 1; 175 recno = 0; 176 } 177 } 178 } 179 if (ferror(fp)) { 180 ierr(); 181 return; 182 } 183 if (cnt) { 184 lines[recno].l = sp; 185 lines[recno].len = cnt; 186 if (++recno == off) { 187 wrap = 1; 188 recno = 0; 189 } 190 } 191 192 if (rflag) { 193 for (cnt = recno - 1; cnt >= 0; --cnt) 194 WR(lines[cnt].l, lines[cnt].len); 195 if (wrap) 196 for (cnt = off - 1; cnt >= recno; --cnt) 197 WR(lines[cnt].l, lines[cnt].len); 198 } else { 199 if (wrap) 200 for (cnt = recno; cnt < off; ++cnt) 201 WR(lines[cnt].l, lines[cnt].len); 202 for (cnt = 0; cnt < recno; ++cnt) 203 WR(lines[cnt].l, lines[cnt].len); 204 } 205 } 206
Indexes created Tue Sep 23 14:10:03 GMT 2025