GCC Code Coverage Report
Directory: ./ Exec Total Coverage
File: usr.bin/grep/mmfile.c Lines: 30 31 96.8 %
Date: 2017-11-07 Branches: 15 18 83.3 %

Line Branch Exec Source
1
/*	$OpenBSD: mmfile.c,v 1.17 2015/02/06 23:21:59 millert Exp $	*/
2
3
/*-
4
 * Copyright (c) 1999 James Howard and Dag-Erling Coïdan Smørgrav
5
 * All rights reserved.
6
 *
7
 * Redistribution and use in source and binary forms, with or without
8
 * modification, are permitted provided that the following conditions
9
 * are met:
10
 * 1. Redistributions of source code must retain the above copyright
11
 *    notice, this list of conditions and the following disclaimer.
12
 * 2. Redistributions in binary form must reproduce the above copyright
13
 *    notice, this list of conditions and the following disclaimer in the
14
 *    documentation and/or other materials provided with the distribution.
15
 *
16
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26
 * SUCH DAMAGE.
27
 */
28
29
#include <sys/mman.h>
30
#include <sys/stat.h>
31
32
#include <err.h>
33
#include <fcntl.h>
34
#include <stdlib.h>
35
#include <unistd.h>
36
37
#include "grep.h"
38
39
#ifndef SMALL
40
41
#define MAX_MAP_LEN 1048576
42
43
mmf_t *
44
mmopen(char *fn, char *mode)
45
{
46
	mmf_t *mmf;
47
1912
	struct stat st;
48
49
956
	if (*mode != 'r')
50
		return NULL;
51
52
956
	mmf = grep_malloc(sizeof *mmf);
53
956
	if ((mmf->fd = open(fn, O_RDONLY)) == -1)
54
		goto ouch1;
55
947
	if (fstat(mmf->fd, &st) == -1)
56
		goto ouch2;
57
947
	if (st.st_size > SIZE_MAX) /* too big to mmap */
58
		goto ouch2;
59
947
	if (!S_ISREG(st.st_mode)) /* only mmap regular files */
60
		goto ouch2;
61
943
	mmf->len = (size_t)st.st_size;
62
943
	mmf->base = mmap(NULL, mmf->len, PROT_READ, MAP_PRIVATE, mmf->fd, (off_t)0);
63
943
	if (mmf->base == MAP_FAILED)
64
		goto ouch2;
65
822
	mmf->ptr = mmf->base;
66
822
	mmf->end = mmf->base + mmf->len;
67
822
	madvise(mmf->base, mmf->len, MADV_SEQUENTIAL);
68
822
	return mmf;
69
70
ouch2:
71
125
	close(mmf->fd);
72
ouch1:
73
134
	free(mmf);
74
134
	return NULL;
75
956
}
76
77
void
78
mmclose(mmf_t *mmf)
79
{
80
1644
	munmap(mmf->base, mmf->len);
81
822
	close(mmf->fd);
82
822
	free(mmf);
83
822
}
84
85
char *
86
mmfgetln(mmf_t *mmf, size_t *l)
87
{
88
	static char *p;
89
90
97582
	if (mmf->ptr >= mmf->end)
91
617
		return NULL;
92
23997142
	for (p = mmf->ptr; mmf->ptr < mmf->end; ++mmf->ptr)
93
11998551
		if (*mmf->ptr == '\n')
94
		    break;
95
96
48174
	*l = mmf->ptr - p;
97
48174
	++mmf->ptr;
98
48174
	return p;
99
48791
}
100
101
#endif