Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Copyright (c) Christos Zoulas 2017. |
3 | | * All Rights Reserved. |
4 | | * |
5 | | * Redistribution and use in source and binary forms, with or without |
6 | | * modification, are permitted provided that the following conditions |
7 | | * are met: |
8 | | * 1. Redistributions of source code must retain the above copyright |
9 | | * notice immediately at the beginning of the file, without modification, |
10 | | * this list of conditions, and the following disclaimer. |
11 | | * 2. Redistributions in binary form must reproduce the above copyright |
12 | | * notice, this list of conditions and the following disclaimer in the |
13 | | * documentation and/or other materials provided with the distribution. |
14 | | * |
15 | | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
16 | | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
17 | | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
18 | | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR |
19 | | * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
20 | | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
21 | | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
22 | | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
23 | | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
24 | | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
25 | | * SUCH DAMAGE. |
26 | | */ |
27 | | #include "file.h" |
28 | | |
29 | | #ifndef lint |
30 | | FILE_RCSID("@(#)$File: buffer.c,v 1.13 2023/07/02 12:48:39 christos Exp $") |
31 | | #endif /* lint */ |
32 | | |
33 | | #include "magic.h" |
34 | | #include <unistd.h> |
35 | | #include <string.h> |
36 | | #include <stdlib.h> |
37 | | #include <sys/stat.h> |
38 | | |
39 | | void |
40 | | buffer_init(struct buffer *b, int fd, const struct stat *st, const void *data, |
41 | | size_t len) |
42 | 74.7M | { |
43 | 74.7M | b->fd = fd; |
44 | 74.7M | if (st) |
45 | 10.3k | memcpy(&b->st, st, sizeof(b->st)); |
46 | 74.6M | else if (b->fd == -1 || fstat(b->fd, &b->st) == -1) |
47 | 74.6M | memset(&b->st, 0, sizeof(b->st)); |
48 | 74.7M | b->fbuf = data; |
49 | 74.7M | b->flen = len; |
50 | 74.7M | b->eoff = 0; |
51 | 74.7M | b->ebuf = NULL; |
52 | 74.7M | b->elen = 0; |
53 | 74.7M | } |
54 | | |
55 | | void |
56 | | buffer_fini(struct buffer *b) |
57 | 25.7k | { |
58 | 25.7k | free(b->ebuf); |
59 | 25.7k | b->ebuf = NULL; |
60 | 25.7k | b->elen = 0; |
61 | 25.7k | } |
62 | | |
63 | | int |
64 | | buffer_fill(const struct buffer *bb) |
65 | 187k | { |
66 | 187k | struct buffer *b = CCAST(struct buffer *, bb); |
67 | | |
68 | 187k | if (b->elen != 0) |
69 | 163k | return b->elen == FILE_BADSIZE ? -1 : 0; |
70 | | |
71 | 24.7k | if (!S_ISREG(b->st.st_mode)) |
72 | 1.73k | goto out; |
73 | | |
74 | 23.0k | b->elen = CAST(size_t, b->st.st_size) < b->flen ? |
75 | 23.0k | CAST(size_t, b->st.st_size) : b->flen; |
76 | 23.0k | if (b->elen == 0) { |
77 | 1.72k | free(b->ebuf); |
78 | 1.72k | b->ebuf = NULL; |
79 | 1.72k | return 0; |
80 | 1.72k | } |
81 | 21.3k | if ((b->ebuf = malloc(b->elen)) == NULL) |
82 | 0 | goto out; |
83 | | |
84 | 21.3k | b->eoff = b->st.st_size - b->elen; |
85 | 21.3k | if (pread(b->fd, b->ebuf, b->elen, b->eoff) == -1) { |
86 | 0 | free(b->ebuf); |
87 | 0 | b->ebuf = NULL; |
88 | 0 | goto out; |
89 | 0 | } |
90 | | |
91 | 21.3k | return 0; |
92 | 1.73k | out: |
93 | 1.73k | b->elen = FILE_BADSIZE; |
94 | 1.73k | return -1; |
95 | 21.3k | } |