Coverage Report

Created: 2026-02-14 06:28

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/file/src/buffer.c
Line
Count
Source
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.14 2025/05/28 19:22:22 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
27.5M
{
43
27.5M
  b->fd = fd;
44
27.5M
  if (st)
45
1.81k
    memcpy(&b->st, st, sizeof(b->st));
46
27.5M
  else if (b->fd == -1 || fstat(b->fd, &b->st) == -1)
47
27.5M
    memset(&b->st, 0, sizeof(b->st));
48
27.5M
  b->fbuf = data;
49
27.5M
  b->flen = len;
50
27.5M
  b->eoff = 0;
51
27.5M
  b->ebuf = NULL;
52
27.5M
  b->elen = 0;
53
27.5M
}
54
55
void
56
buffer_fini(struct buffer *b)
57
12.1k
{
58
12.1k
  free(b->ebuf);
59
12.1k
  b->ebuf = NULL;
60
12.1k
  b->elen = 0;
61
12.1k
}
62
63
int
64
buffer_fill(const struct buffer *bb)
65
73.2k
{
66
73.2k
  struct buffer *b = CCAST(struct buffer *, bb);
67
68
73.2k
  if (b->elen != 0)
69
0
    return b->elen == FILE_BADSIZE ? -1 : 0;
70
71
  // Nothing to refill, everything is in memory
72
73.2k
  if (b->fd == -1)
73
73.2k
    return 0;
74
75
0
  if (!S_ISREG(b->st.st_mode))
76
0
    goto out;
77
78
0
  b->elen = CAST(size_t, b->st.st_size) < b->flen ?
79
0
      CAST(size_t, b->st.st_size) : b->flen;
80
0
  if (b->elen == 0) {
81
0
    free(b->ebuf);
82
0
    b->ebuf = NULL;
83
0
    return 0;
84
0
  }
85
0
  if ((b->ebuf = malloc(b->elen)) == NULL)
86
0
    goto out;
87
88
0
  b->eoff = b->st.st_size - b->elen;
89
0
  if (pread(b->fd, b->ebuf, b->elen, b->eoff) == -1) {
90
0
    free(b->ebuf);
91
0
    b->ebuf = NULL;
92
0
    goto out;
93
0
  }
94
95
0
  return 0;
96
0
out:
97
0
  b->elen = FILE_BADSIZE;
98
0
  return -1;
99
0
}