xref: /freebsd/usr.bin/tail/misc.c (revision eda14cbc264d6969b02f2b1994cef11148e914f1)
1 /*-
2  * SPDX-License-Identifier: BSD-3-Clause
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. Neither the name of the University nor the names of its contributors
19  *    may be used to endorse or promote products derived from this software
20  *    without specific prior written permission.
21  *
22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32  * SUCH DAMAGE.
33  */
34 
35 #include <sys/cdefs.h>
36 
37 __FBSDID("$FreeBSD$");
38 
39 #ifndef lint
40 static const char sccsid[] = "@(#)misc.c	8.1 (Berkeley) 6/6/93";
41 #endif
42 
43 #include <sys/types.h>
44 #include <sys/stat.h>
45 #include <sys/mman.h>
46 
47 #include <err.h>
48 #include <errno.h>
49 #include <stdio.h>
50 #include <stdlib.h>
51 #include <string.h>
52 #include <unistd.h>
53 
54 #include <libcasper.h>
55 #include <casper/cap_fileargs.h>
56 
57 #include "extern.h"
58 
59 void
60 ierr(const char *fname)
61 {
62 	warn("%s", fname);
63 	rval = 1;
64 }
65 
66 void
67 oerr(void)
68 {
69 	err(1, "stdout");
70 }
71 
72 /*
73  * Print `len' bytes from the file associated with `mip', starting at
74  * absolute file offset `startoff'. May move map window.
75  */
76 int
77 mapprint(struct mapinfo *mip, off_t startoff, off_t len)
78 {
79 	int n;
80 
81 	while (len > 0) {
82 		if (startoff < mip->mapoff || startoff >= mip->mapoff +
83 		    (off_t)mip->maplen) {
84 			if (maparound(mip, startoff) != 0)
85 				return (1);
86 		}
87 		n = (mip->mapoff + mip->maplen) - startoff;
88 		if (n > len)
89 			n = len;
90 		WR(mip->start + (startoff - mip->mapoff), n);
91 		startoff += n;
92 		len -= n;
93 	}
94 	return (0);
95 }
96 
97 /*
98  * Move the map window so that it contains the byte at absolute file
99  * offset `offset'. The start of the map window will be TAILMAPLEN
100  * aligned.
101  */
102 int
103 maparound(struct mapinfo *mip, off_t offset)
104 {
105 
106 	if (mip->start != NULL && munmap(mip->start, mip->maplen) != 0)
107 		return (1);
108 
109 	mip->mapoff = offset & ~((off_t)TAILMAPLEN - 1);
110 	mip->maplen = TAILMAPLEN;
111 	if ((off_t)mip->maplen > mip->maxoff - mip->mapoff)
112 		mip->maplen = mip->maxoff - mip->mapoff;
113 	if (mip->maplen <= 0)
114 		abort();
115 	if ((mip->start = mmap(NULL, mip->maplen, PROT_READ, MAP_SHARED,
116 	     mip->fd, mip->mapoff)) == MAP_FAILED)
117 		return (1);
118 
119 	return (0);
120 }
121 
122 /*
123  * Print the file name without stdio buffering.
124  */
125 void
126 printfn(const char *fn, int print_nl)
127 {
128 
129 	if (print_nl)
130 		WR("\n", 1);
131 	WR("==> ", 4);
132 	WR(fn, strlen(fn));
133 	WR(" <==\n", 5);
134 }
135