Coverage Report

Created: 2026-08-31 06:45

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
16.7k
FoFiBase::FoFiBase(char *fileA, int lenA, GBool freeFileDataA) {
22
16.7k
  fileData = file = (Guchar *)fileA;
23
16.7k
  len = lenA;
24
16.7k
  freeFileData = freeFileDataA;
25
16.7k
}
26
27
16.7k
FoFiBase::~FoFiBase() {
28
16.7k
  if (freeFileData) {
29
10.2k
    gfree(fileData);
30
10.2k
  }
31
16.7k
}
32
33
9.89k
char *FoFiBase::readFile(char *fileName, int *fileLen) {
34
9.89k
  FILE *f;
35
9.89k
  char *buf;
36
9.89k
  int n;
37
38
9.89k
  if (!(f = fopen(fileName, "rb"))) {
39
0
    return NULL;
40
0
  }
41
9.89k
  fseek(f, 0, SEEK_END);
42
9.89k
  n = (int)ftell(f);
43
9.89k
  if (n < 0) {
44
0
    fclose(f);
45
0
    return NULL;
46
0
  }
47
9.89k
  fseek(f, 0, SEEK_SET);
48
9.89k
  buf = (char *)gmalloc(n);
49
9.89k
  if ((int)fread(buf, 1, n, f) != n) {
50
0
    gfree(buf);
51
0
    fclose(f);
52
0
    return NULL;
53
0
  }
54
9.89k
  fclose(f);
55
9.89k
  *fileLen = n;
56
9.89k
  return buf;
57
9.89k
}
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
705M
int FoFiBase::getU8(int pos, GBool *ok) {
74
705M
  if (pos < 0 || pos >= len) {
75
568M
    *ok = gFalse;
76
568M
    return 0;
77
568M
  }
78
136M
  return file[pos];
79
705M
}
80
81
33.3k
int FoFiBase::getS16BE(int pos, GBool *ok) {
82
33.3k
  int x;
83
84
33.3k
  if (pos < 0 || pos > INT_MAX - 1 || pos+1 >= len) {
85
15
    *ok = gFalse;
86
15
    return 0;
87
15
  }
88
33.3k
  x = file[pos];
89
33.3k
  x = (x << 8) + file[pos+1];
90
33.3k
  if (x & 0x8000) {
91
10.4k
    x |= ~0xffff;
92
10.4k
  }
93
33.3k
  return x;
94
33.3k
}
95
96
11.8M
int FoFiBase::getU16BE(int pos, GBool *ok) {
97
11.8M
  int x;
98
99
11.8M
  if (pos < 0 || pos > INT_MAX - 1 || pos+1 >= len) {
100
1.68M
    *ok = gFalse;
101
1.68M
    return 0;
102
1.68M
  }
103
10.1M
  x = file[pos];
104
10.1M
  x = (x << 8) + file[pos+1];
105
10.1M
  return x;
106
11.8M
}
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
7.74M
Guint FoFiBase::getU32BE(int pos, GBool *ok) {
126
7.74M
  Guint x;
127
128
7.74M
  if (pos < 0 || pos > INT_MAX - 3 || pos+3 >= len) {
129
1.17M
    *ok = gFalse;
130
1.17M
    return 0;
131
1.17M
  }
132
6.56M
  x = file[pos];
133
6.56M
  x = (x << 8) + file[pos+1];
134
6.56M
  x = (x << 8) + file[pos+2];
135
6.56M
  x = (x << 8) + file[pos+3];
136
6.56M
  return x;
137
7.74M
}
138
139
359
Guint FoFiBase::getU32LE(int pos, GBool *ok) {
140
359
  Guint x;
141
142
359
  if (pos < 0 || pos > INT_MAX - 3 || pos+3 >= len) {
143
0
    *ok = gFalse;
144
0
    return 0;
145
0
  }
146
359
  x = file[pos+3];
147
359
  x = (x << 8) + file[pos+2];
148
359
  x = (x << 8) + file[pos+1];
149
359
  x = (x << 8) + file[pos];
150
359
  return x;
151
359
}
152
153
2.57M
Guint FoFiBase::getUVarBE(int pos, int size, GBool *ok) {
154
2.57M
  Guint x;
155
2.57M
  int i;
156
157
2.57M
  if (pos < 0 || pos > INT_MAX - size || pos + size > len) {
158
33.3k
    *ok = gFalse;
159
33.3k
    return 0;
160
33.3k
  }
161
2.54M
  x = 0;
162
11.1M
  for (i = 0; i < size; ++i) {
163
8.61M
    x = (x << 8) + file[pos + i];
164
8.61M
  }
165
2.54M
  return x;
166
2.57M
}
167
168
533k
GBool FoFiBase::checkRegion(int pos, int size) {
169
533k
  return pos >= 0 &&
170
533k
         size >= 0 &&
171
533k
         size <= INT_MAX - pos &&
172
484k
         pos + size <= len;
173
533k
}