-
Notifications
You must be signed in to change notification settings - Fork 59
/
Writer.hx
124 lines (114 loc) · 3.9 KB
/
Writer.hx
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
/*
* format - Haxe File Formats
*
* Copyright (c) 2008, The Haxe Project Contributors
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE HAXE PROJECT CONTRIBUTORS "AS IS" AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE HAXE PROJECT CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
* DAMAGE.
*/
package format.tar;
import format.tar.Data;
class Writer {
var o : haxe.io.Output;
var files : List<{name:String}>;
public function new(o:haxe.io.Output) {
this.o = o;
files = new List();
}
function sumStr(s:String) {
var sum = 0;
for (i in 0...s.length)
sum += s.charCodeAt(i);
return sum;
}
function createStrNum(num:Int, ?len:Int=7, ?fill:String='0') {
var str = "";
var s = Std.string(dec2oct(num));
for (i in 0...len-s.length)
str += fill;
str += s;
return str;
}
function writeTarDate(date:Date) {
var t = date.getTime()/1000;
var a = Math.floor(t/0x8000); // Avoiding overflow
var b = Math.floor(t - a*1.0*0x8000);
return createStrNum(a, 6) + "" + createStrNum(b, 5);
}
public function writeEntryHeader(f:Entry) {
var mode = createStrNum(f.fmod & 0x1FF);
var uid = createStrNum(f.uid);
var gid = createStrNum(f.gid);
var size = createStrNum(f.fileSize, 11);
var date = writeTarDate(f.fileTime);
var chsum = 879; // sum of 8 spaces + "ustar "
chsum += sumStr(f.fileName);
chsum += sumStr(mode);
chsum += sumStr(uid);
chsum += sumStr(gid);
chsum += sumStr(size);
chsum += sumStr(date);
chsum += sumStr(f.uname);
chsum += sumStr(f.gname);
chsum += sumStr('0');
o.writeString(f.fileName);
for(i in 0...100-f.fileName.length) o.writeByte(0);
o.writeString(mode); o.writeByte(0);
o.writeString(uid); o.writeByte(0);
o.writeString(gid); o.writeByte(0);
o.writeString(size); o.writeByte(0);
o.writeString(date); o.writeByte(0);
o.writeString(createStrNum(chsum, 6)); o.writeByte(0);
o.writeString(" 0");
for(i in 0...100) o.writeByte(0);
o.writeString("ustar "); o.writeByte(0);
o.writeString(f.uname);
for(i in 0...32-f.uname.length) o.writeByte(0);
o.writeString(f.gname);
for(i in 0...32-f.gname.length) o.writeByte(0);
for(i in 0...8+8+155+12) o.writeByte(0);
}
public function writeEntryData(e:Entry, buf:haxe.io.Bytes, data:haxe.io.Input) {
format.tools.IO.copy(data, o, buf, e.fileSize);
}
public function write(files:Data) {
for (f in files) {
writeEntryHeader(f);
if (f.data != null) {
o.writeFullBytes(f.data, 0, f.data.length);
if (f.data.length > 0)
for (i in 0...512-f.data.length%512)
o.writeByte(0);
}
}
for (i in 0...2*512)
o.writeByte(0);
}
function dec2oct( d:Int ) {
var x = 0, i = 1;
while( d != 0 ) {
x = x + i*(d & 7);
d = d >> 3;
i = i*10;
}
return x;
}
}