forward.c revision 209e49b2ff611e7d61ff58e13756ae67f51be550
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * Copyright (c) 1991, 1993
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * The Regents of the University of California. All rights reserved.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * This code is derived from software contributed to Berkeley by
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * Edward Sze-Tyan Wang.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * Redistribution and use in source and binary forms, with or without
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * modification, are permitted provided that the following conditions
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * 1. Redistributions of source code must retain the above copyright
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * notice, this list of conditions and the following disclaimer.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * 2. Redistributions in binary form must reproduce the above copyright
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * notice, this list of conditions and the following disclaimer in the
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * documentation and/or other materials provided with the distribution.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * 4. Neither the name of the University nor the names of its contributors
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * may be used to endorse or promote products derived from this software
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * without specific prior written permission.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * SUCH DAMAGE.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * Solaris porting notes: the original FreeBSD version made use of the
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * BSD kqueue event notification framework; this
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * was changed to use the Solaris event completion
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * framework: port_create(), port_associate(),
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * and port_get().
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Lovestatic void rlines(FILE *, const char *fn, off_t, struct stat *);
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love/* defines for inner loop actions */
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * forward -- display the file, from an offset, forward.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * There are eight separate cases for this -- regular and non-regular
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * files, by bytes or lines and from the beginning or end of the file.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * FBYTES byte offset from the beginning of the file
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * NOREG read, counting bytes
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * FLINES line offset from the beginning of the file
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * REG read, counting lines
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * NOREG read, counting lines
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * RBYTES byte offset from the end of the file
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * NOREG cyclically read characters into a wrap-around buffer
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * REG mmap the file and step back until reach the correct offset.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * NOREG cyclically read lines into a wrap-around array of buffers
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Loveforward(FILE *fp, const char *fn, enum STYLE style, off_t off, struct stat *sbp)
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love } else while (off--)
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love } else if (off == 0) {
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love else if (off == 0) {
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * rlines -- display the last offset lines of the file.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Loverlines(FILE *fp, const char *fn, off_t off, struct stat *sbp)
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * Last char is special, ignore whether newline or not. Note that
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * size == 0 is dealt with above, and size == 1 sets curoff to -1.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love while (curoff >= 0) {
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love if (curoff < map.mapoff && maparound(&map, curoff) != 0) {
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love /* `i' is either the map offset of a '\n', or -1. */
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love if (mapprint(&map, curoff, size - curoff) != 0) {
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love /* Set the file pointer to reflect the length displayed. */
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love if (map.start != NULL && munmap(map.start, map.maplen)) {
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love for (i = 0, file = files; i < no_files; i++, file++) {
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love /* For -f or -F will both use Solaris port interface */
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love if (fflag && (fileno(file->fp) != STDIN_FILENO)) {
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * follow -- display the file, from an offset, forward.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Lovefollow(file_info_t *files, enum STYLE style, off_t off)
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love /* Position each of the files */
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love for (i = 0, file = files; i < no_files; i++, file++) {
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love sizeof (struct stat));
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love for (i = 0, file = files; i < no_files; i++, file++)
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * In the -F case we set a timeout to ensure that
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love * we re-stat the file at least once every second.
209e49b2ff611e7d61ff58e13756ae67f51be550Chris Love if (n == 0) {