1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
|
// KDat - a tar-based DAT archiver
// Copyright (C) 1998-2000 Sean Vyain, svyain@mail.tds.net
// Copyright (C) 2001-2002 Lawrence Widman, kdat@cardiothink.com
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
#include <assert.h>
#include <values.h>
#include "File.h"
File::File( File* parent, int size, int mtime, int startRecord, int endRecord, const TQString & name )
: _stubbed( FALSE ),
_name( name ),
_parent( parent )
{
assert( endRecord >= startRecord );
_union._data._size = size;
_union._data._mtime = mtime;
_union._data._startRecord = startRecord;
_union._data._endRecord = endRecord;
}
File::File( File* parent, FILE* fptr, int offset )
: _stubbed( TRUE ),
_parent( parent )
{
_union._stub._fptr = fptr;
_union._stub._offset = offset;
}
File::~File()
{
while ( _children.first() ) {
delete _children.first();
_children.removeFirst();
}
}
void File::read( int version )
{
if ( !_stubbed ) {
return;
}
_stubbed = FALSE;
FILE* fptr = _union._stub._fptr;
fseek( fptr, _union._stub._offset, SEEK_SET );
// File name (4 bytes + n chars).
int ival;
fread( &ival, sizeof( ival ), 1, fptr );
char * buf = new char[ival+1];
buf[ival] = '\0';
fread( buf, sizeof( char ), ival, fptr );
_name = buf;
delete [] buf;
// File size (4 bytes).
fread( &ival, sizeof( ival ), 1, fptr );
_union._data._size = ival;
// File modification time (4 bytes).
fread( &ival, sizeof( ival ), 1, fptr );
_union._data._mtime = ival;
// Start record number.
fread( &ival, sizeof( ival ), 1, fptr );
_union._data._startRecord = ival;
// End record number.
fread( &ival, sizeof( ival ), 1, fptr );
_union._data._endRecord = ival;
//%%% This is a kludge to cope with some screwed up tape indexes.
//%%% Hopefully the file with the zero end record is *always* at
//%%% the end of the archive.
if ( ( _union._data._endRecord <= 0 ) && ( _union._data._startRecord != _union._data._endRecord ) ) {
_union._data._endRecord = MAXINT;
}
if ( version > 3 ) {
fread( &ival, sizeof( ival ), 1, fptr );
int rc = ival;
int start = 0;
int end = 0;
for ( int ii = 0; ii < rc; ii++ ) {
fread( &ival, sizeof( ival ), 1, fptr );
start = ival;
fread( &ival, sizeof( ival ), 1, fptr );
end = ival;
_ranges.addRange( start, end );
}
}
//===== Read files =====
fread( &ival, sizeof( ival ), 1, fptr );
for ( int count = ival; count > 0; count-- ) {
fread( &ival, sizeof( ival ), 1, fptr );
addChild( new File( this, fptr, ival ) );
}
}
void File::readAll( int version )
{
read( version );
TQPtrListIterator<File> i( getChildren() );
for ( ; i.current(); ++i ) {
i.current()->readAll( version );
}
}
void File::write( FILE* fptr )
{
int zero = 0;
// File name (4 bytes + n chars).
int ival = getName().length();
fwrite( &ival, sizeof( ival ), 1, fptr );
fwrite( getName().ascii(), sizeof( char ), ival, fptr );
// File size (4 bytes).
ival = getSize();
fwrite( &ival, sizeof( ival ), 1, fptr );
// File modification time (4 bytes).
ival = getMTime();
fwrite( &ival, sizeof( ival ), 1, fptr );
// Start record number.
ival = getStartRecord();
fwrite( &ival, sizeof( ival ), 1, fptr );
// End record number.
ival = getEndRecord();
fwrite( &ival, sizeof( ival ), 1, fptr );
// Child range list.
ival = _ranges.getRanges().count();
fwrite( &ival, sizeof( ival ), 1, fptr );
TQPtrListIterator<Range> it( _ranges.getRanges() );
for ( ; it.current(); ++it ) {
ival = it.current()->getStart();
fwrite( &ival, sizeof( ival ), 1, fptr );
ival = it.current()->getEnd();
fwrite( &ival, sizeof( ival ), 1, fptr );
}
// Number of immediate children (4 bytes).
ival = getChildren().count();
fwrite( &ival, sizeof( ival ), 1, fptr );
// Fill in file offsets later...
int fileTable = ftell( fptr );
for ( ; ival > 0; ival-- ) {
fwrite( &zero, sizeof( zero ), 1, fptr );
}
//===== Write files =====
ival = _children.count();
fwrite( &ival, sizeof( ival ), 1, fptr );
TQPtrListIterator<File> i( _children );
int count = 0;
for ( ; i.current(); ++i, count++ ) {
// Fill in the file offset.
int here = ftell( fptr );
fseek( fptr, fileTable + 4*count, SEEK_SET );
fwrite( &here, sizeof( here ), 1, fptr );
fseek( fptr, here, SEEK_SET );
i.current()->write( fptr );
}
}
bool File::isDirectory()
{
read();
return _name[ _name.length() - 1 ] == '/';
}
int File::getSize()
{
read();
return _union._data._size;
}
int File::getMTime()
{
read();
return _union._data._mtime;
}
int File::getStartRecord()
{
read();
return _union._data._startRecord;
}
int File::getEndRecord()
{
read();
return _union._data._endRecord;
}
TQString File::getName()
{
read();
return _name;
}
TQString File::getFullPathName()
{
TQString tmp = _name.copy();
for ( File* parent = getParent(); parent; parent = parent->getParent() ) {
tmp.prepend( parent->getName() );
}
return tmp;
}
File* File::getParent()
{
return _parent;
}
const TQPtrList<File>& File::getChildren()
{
read();
return _children;
}
const TQPtrList<Range>& File::getRanges()
{
read();
return _ranges.getRanges();
}
void File::addChild( File* file )
{
read();
_children.append( file );
}
void File::calcRanges()
{
assert( !_stubbed );
_ranges.clear();
_ranges.addRange( getStartRecord(), getEndRecord() );
TQPtrListIterator<File> it( getChildren() );
for ( ; it.current(); ++it ) {
it.current()->calcRanges();
TQPtrListIterator<Range> it2( it.current()->getRanges() );
for ( ; it2.current(); ++it2 ) {
_ranges.addRange( it2.current()->getStart(), it2.current()->getEnd() );
}
}
}
|