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.4 2018/02/21 21:26:00 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
buffer_init(struct buffer * b,int fd,const void * data,size_t len)40 buffer_init(struct buffer *b, int fd, const void *data, size_t len)
41 {
42 b->fd = fd;
43 if (b->fd == -1 || fstat(b->fd, &b->st) == -1)
44 memset(&b->st, 0, sizeof(b->st));
45 b->fbuf = data;
46 b->flen = len;
47 b->eoff = 0;
48 b->ebuf = NULL;
49 b->elen = 0;
50 }
51
52 void
buffer_fini(struct buffer * b)53 buffer_fini(struct buffer *b)
54 {
55 free(b->ebuf);
56 }
57
58 int
buffer_fill(const struct buffer * bb)59 buffer_fill(const struct buffer *bb)
60 {
61 struct buffer *b = CCAST(struct buffer *, bb);
62
63 if (b->elen != 0)
64 return b->elen == (size_t)~0 ? -1 : 0;
65
66 if (!S_ISREG(b->st.st_mode))
67 goto out;
68
69 b->elen = (size_t)b->st.st_size < b->flen ?
70 (size_t)b->st.st_size : b->flen;
71 if ((b->ebuf = malloc(b->elen)) == NULL)
72 goto out;
73
74 b->eoff = b->st.st_size - b->elen;
75 if (pread(b->fd, b->ebuf, b->elen, b->eoff) == -1) {
76 free(b->ebuf);
77 goto out;
78 }
79
80 return 0;
81 out:
82 b->elen = (size_t)~0;
83 return -1;
84 }
85