Coverage Report

Created: 2026-07-16 06:50

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/xpdf-4.06/fofi/FoFiBase.cc
Line
Count
Source
1
//========================================================================
2
//
3
// FoFiBase.cc
4
//
5
// Copyright 1999-2003 Glyph & Cog, LLC
6
//
7
//========================================================================
8
9
#include <aconf.h>
10
11
#include <stdio.h>
12
#include <limits.h>
13
#include "gmem.h"
14
#include "gmempp.h"
15
#include "FoFiBase.h"
16
17
//------------------------------------------------------------------------
18
// FoFiBase
19
//------------------------------------------------------------------------
20
21
18.7k
FoFiBase::FoFiBase(char *fileA, int lenA, GBool freeFileDataA) {
22
18.7k
  fileData = file = (Guchar *)fileA;
23
18.7k
  len = lenA;
24
18.7k
  freeFileData = freeFileDataA;
25
18.7k
}
26
27
18.7k
FoFiBase::~FoFiBase() {
28
18.7k
  if (freeFileData) {
29
12.8k
    gfree(fileData);
30
12.8k
  }
31
18.7k
}
32
33
9.65k
char *FoFiBase::readFile(char *fileName, int *fileLen) {
34
9.65k
  FILE *f;
35
9.65k
  char *buf;
36
9.65k
  int n;
37
38
9.65k
  if (!(f = fopen(fileName, "rb"))) {
39
0
    return NULL;
40
0
  }
41
9.65k
  fseek(f, 0, SEEK_END);
42
9.65k
  n = (int)ftell(f);
43
9.65k
  if (n < 0) {
44
0
    fclose(f);
45
0
    return NULL;
46
0
  }
47
9.65k
  fseek(f, 0, SEEK_SET);
48
9.65k
  buf = (char *)gmalloc(n);
49
9.65k
  if ((int)fread(buf, 1, n, f) != n) {
50
0
    gfree(buf);
51
0
    fclose(f);
52
0
    return NULL;
53
0
  }
54
9.65k
  fclose(f);
55
9.65k
  *fileLen = n;
56
9.65k
  return buf;
57
9.65k
}
58
59
0
int FoFiBase::getS8(int pos, GBool *ok) {
60
0
  int x;
61
62
0
  if (pos < 0 || pos >= len) {
63
0
    *ok = gFalse;
64
0
    return 0;
65
0
  }
66
0
  x = file[pos];
67
0
  if (x & 0x80) {
68
0
    x |= ~0xff;
69
0
  }
70
0
  return x;
71
0
}
72
73
585M
int FoFiBase::getU8(int pos, GBool *ok) {
74
585M
  if (pos < 0 || pos >= len) {
75
409M
    *ok = gFalse;
76
409M
    return 0;
77
409M
  }
78
176M
  return file[pos];
79
585M
}
80
81
31.3k
int FoFiBase::getS16BE(int pos, GBool *ok) {
82
31.3k
  int x;
83
84
31.3k
  if (pos < 0 || pos > INT_MAX - 1 || pos+1 >= len) {
85
15
    *ok = gFalse;
86
15
    return 0;
87
15
  }
88
31.3k
  x = file[pos];
89
31.3k
  x = (x << 8) + file[pos+1];
90
31.3k
  if (x & 0x8000) {
91
9.92k
    x |= ~0xffff;
92
9.92k
  }
93
31.3k
  return x;
94
31.3k
}
95
96
11.1M
int FoFiBase::getU16BE(int pos, GBool *ok) {
97
11.1M
  int x;
98
99
11.1M
  if (pos < 0 || pos > INT_MAX - 1 || pos+1 >= len) {
100
1.05M
    *ok = gFalse;
101
1.05M
    return 0;
102
1.05M
  }
103
10.1M
  x = file[pos];
104
10.1M
  x = (x << 8) + file[pos+1];
105
10.1M
  return x;
106
11.1M
}
107
108
0
int FoFiBase::getS32BE(int pos, GBool *ok) {
109
0
  int x;
110
111
0
  if (pos < 0 || pos > INT_MAX - 3 || pos+3 >= len) {
112
0
    *ok = gFalse;
113
0
    return 0;
114
0
  }
115
0
  x = file[pos];
116
0
  x = (x << 8) + file[pos+1];
117
0
  x = (x << 8) + file[pos+2];
118
0
  x = (x << 8) + file[pos+3];
119
0
  if (x & 0x80000000) {
120
0
    x |= ~0xffffffff;
121
0
  }
122
0
  return x;
123
0
}
124
125
6.97M
Guint FoFiBase::getU32BE(int pos, GBool *ok) {
126
6.97M
  Guint x;
127
128
6.97M
  if (pos < 0 || pos > INT_MAX - 3 || pos+3 >= len) {
129
772k
    *ok = gFalse;
130
772k
    return 0;
131
772k
  }
132
6.20M
  x = file[pos];
133
6.20M
  x = (x << 8) + file[pos+1];
134
6.20M
  x = (x << 8) + file[pos+2];
135
6.20M
  x = (x << 8) + file[pos+3];
136
6.20M
  return x;
137
6.97M
}
138
139
3.18k
Guint FoFiBase::getU32LE(int pos, GBool *ok) {
140
3.18k
  Guint x;
141
142
3.18k
  if (pos < 0 || pos > INT_MAX - 3 || pos+3 >= len) {
143
0
    *ok = gFalse;
144
0
    return 0;
145
0
  }
146
3.18k
  x = file[pos+3];
147
3.18k
  x = (x << 8) + file[pos+2];
148
3.18k
  x = (x << 8) + file[pos+1];
149
3.18k
  x = (x << 8) + file[pos];
150
3.18k
  return x;
151
3.18k
}
152
153
1.95M
Guint FoFiBase::getUVarBE(int pos, int size, GBool *ok) {
154
1.95M
  Guint x;
155
1.95M
  int i;
156
157
1.95M
  if (pos < 0 || pos > INT_MAX - size || pos + size > len) {
158
9.75k
    *ok = gFalse;
159
9.75k
    return 0;
160
9.75k
  }
161
1.94M
  x = 0;
162
8.61M
  for (i = 0; i < size; ++i) {
163
6.67M
    x = (x << 8) + file[pos + i];
164
6.67M
  }
165
1.94M
  return x;
166
1.95M
}
167
168
590k
GBool FoFiBase::checkRegion(int pos, int size) {
169
590k
  return pos >= 0 &&
170
590k
         size >= 0 &&
171
590k
         size <= INT_MAX - pos &&
172
539k
         pos + size <= len;
173
590k
}