1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329
|
/* vi: set sw=4 ts=4: */
/*
* Mini tail implementation for busybox
*
* Copyright (C) 2001 by Matt Kraai <kraai@alumni.carnegiemellon.edu>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
/* BB_AUDIT SUSv3 compliant (need fancy for -c) */
/* BB_AUDIT GNU compatible -c, -q, and -v options in 'fancy' configuration. */
/* http://www.opengroup.org/onlinepubs/007904975/utilities/tail.html */
/* Mar 16, 2003 Manuel Novoa III (mjn3@codepoet.org)
*
* Pretty much rewritten to fix numerous bugs and reduce realloc() calls.
* Bugs fixed (although I may have forgotten one or two... it was pretty bad)
* 1) mixing printf/write without fflush()ing stdout
* 2) no check that any open files are present
* 3) optstring had -q taking an arg
* 4) no error checking on write in some cases, and a warning even then
* 5) q and s interaction bug
* 6) no check for lseek error
* 7) lseek attempted when count==0 even if arg was +0 (from top)
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <unistd.h>
#include <fcntl.h>
#include <sys/stat.h>
#include "busybox.h"
static const struct suffix_mult tail_suffixes[] = {
{ "b", 512 },
{ "k", 1024 },
{ "m", 1048576 },
{ NULL, 0 }
};
static int status
#if EXIT_SUCCESS != 0
= EXIT_SUCCESS /* If it is 0 (paranoid check), let bss initialize it. */
#endif
;
static void tail_xprint_header(const char *fmt, const char *filename)
{
/* If we get an output error, there is really no sense in continuing. */
if (dprintf(STDOUT_FILENO, fmt, filename) < 0) {
bb_perror_nomsg_and_die();
}
}
/* len should probably be size_t */
static void tail_xbb_full_write(const char *buf, size_t len)
{
/* If we get a write error, there is really no sense in continuing. */
if (bb_full_write(STDOUT_FILENO, buf, len) < 0) {
bb_perror_nomsg_and_die();
}
}
static ssize_t tail_read(int fd, char *buf, size_t count)
{
ssize_t r;
if ((r = safe_read(fd, buf, count)) < 0) {
bb_perror_msg("read");
status = EXIT_FAILURE;
}
return r;
}
static const char tail_opts[] =
"fn:c:"
#ifdef CONFIG_FEATURE_FANCY_TAIL
"qs:v"
#endif
;
static const char header_fmt[] = "\n==> %s <==\n";
int tail_main(int argc, char **argv)
{
long count = 10;
unsigned int sleep_period = 1;
int from_top = 0;
int follow = 0;
int header_threshhold = 1;
int count_bytes = 0;
char *tailbuf;
size_t tailbufsize;
int taillen = 0;
int newline = 0;
int *fds, nfiles, nread, nwrite, seen, i, opt;
char *s, *buf;
const char *fmt;
/* Allow legacy syntax of an initial numeric option without -n. */
if (argc >=2 && ((argv[1][0] == '+') || ((argv[1][0] == '-')
/* && (isdigit)(argv[1][1]) */
&& (((unsigned int)(argv[1][1] - '0')) <= 9))))
{
optind = 2;
optarg = argv[1];
goto GET_COUNT;
}
while ((opt = getopt(argc, argv, tail_opts)) > 0) {
switch (opt) {
case 'f':
follow = 1;
break;
case 'c':
count_bytes = 1;
/* FALLS THROUGH */
case 'n':
GET_COUNT:
count = bb_xgetlarg10_sfx(optarg, tail_suffixes);
/* Note: Leading whitespace is an error trapped above. */
if (*optarg == '+') {
from_top = 1;
} else {
from_top = 0;
}
if (count < 0) {
count = -count;
}
break;
#ifdef CONFIG_FEATURE_FANCY_TAIL
case 'q':
header_threshhold = INT_MAX;
break;
case 's':
sleep_period =bb_xgetularg10_bnd(optarg, 0, UINT_MAX);
break;
case 'v':
header_threshhold = 0;
break;
#endif
default:
bb_show_usage();
}
}
/* open all the files */
fds = (int *)xmalloc(sizeof(int) * (argc - optind + 1));
argv += optind;
nfiles = i = 0;
if ((argc -= optind) == 0) {
struct stat statbuf;
if (!fstat(STDIN_FILENO, &statbuf) && S_ISFIFO(statbuf.st_mode)) {
follow = 0;
}
/* --argv; */
*argv = (char *) bb_msg_standard_input;
goto DO_STDIN;
}
do {
if ((argv[i][0] == '-') && !argv[i][1]) {
DO_STDIN:
fds[nfiles] = STDIN_FILENO;
} else if ((fds[nfiles] = open(argv[i], O_RDONLY)) < 0) {
bb_perror_msg("%s", argv[i]);
status = EXIT_FAILURE;
continue;
}
argv[nfiles] = argv[i];
++nfiles;
} while (++i < argc);
if (!nfiles) {
bb_error_msg_and_die("no files");
}
tailbufsize = BUFSIZ;
/* tail the files */
if (from_top < count_bytes) { /* Each is 0 or 1, so true iff 0 < 1. */
/* Hence, !from_top && count_bytes */
if (tailbufsize < count) {
tailbufsize = count + BUFSIZ;
}
}
buf = tailbuf = xmalloc(tailbufsize);
fmt = header_fmt + 1; /* Skip header leading newline on first output. */
i = 0;
do {
/* Be careful. It would be possible to optimize the count-bytes
* case if the file is seekable. If you do though, remember that
* starting file position may not be the beginning of the file.
* Beware of backing up too far. See example in wc.c.
*/
if ((!(count|from_top)) && (lseek(fds[i], 0, SEEK_END) >= 0)) {
continue;
}
if (nfiles > header_threshhold) {
tail_xprint_header(fmt, argv[i]);
fmt = header_fmt;
}
buf = tailbuf;
taillen = 0;
seen = 1;
while ((nread = tail_read(fds[i], buf, tailbufsize-taillen)) > 0) {
if (from_top) {
nwrite = nread;
if (seen < count) {
if (count_bytes) {
nwrite -= (count - seen);
seen = count;
} else {
s = buf;
do {
--nwrite;
if ((*s++ == '\n') && (++seen == count)) {
break;
}
} while (nwrite);
}
}
tail_xbb_full_write(buf + nread - nwrite, nwrite);
} else if (count) {
if (count_bytes) {
taillen += nread;
if (taillen > count) {
memmove(tailbuf, tailbuf + taillen - count, count);
taillen = count;
}
} else {
int k = nread;
int nbuf = 0;
while (k) {
--k;
if (buf[k] == '\n') {
++nbuf;
}
}
if (newline + nbuf < count) {
newline += nbuf;
taillen += nread;
} else {
int extra = 0;
if (buf[nread-1] != '\n') {
extra = 1;
}
k = newline + nbuf + extra - count;
s = tailbuf;
while (k) {
if (*s == '\n') {
--k;
}
++s;
}
taillen += nread - (s - tailbuf);
memmove(tailbuf, s, taillen);
newline = count - extra;
}
if (tailbufsize < taillen + BUFSIZ) {
tailbufsize = taillen + BUFSIZ;
tailbuf = xrealloc(tailbuf, tailbufsize);
}
}
buf = tailbuf + taillen;
}
}
if (!from_top) {
tail_xbb_full_write(tailbuf, taillen);
}
taillen = 0;
} while (++i < nfiles);
buf = xrealloc(tailbuf, BUFSIZ);
fmt = NULL;
while (follow) {
sleep(sleep_period);
i = 0;
do {
if (nfiles > header_threshhold) {
fmt = header_fmt;
}
while ((nread = tail_read(fds[i], buf, sizeof(buf))) > 0) {
if (fmt) {
tail_xprint_header(fmt, argv[i]);
fmt = NULL;
}
tail_xbb_full_write(buf, nread);
}
} while (++i < nfiles);
}
return status;
}
|