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
|
/*
Copyright (c) 2001 Lapo Luchini.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. 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.
3. The names of the authors may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED 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 AUTHORS
OR ANY CONTRIBUTORS TO THIS SOFTWARE 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.
*/
/*
* This program is based on zlib-1.1.3, so all credit should go authors
* Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
* and contributors of zlib.
*/
/* This file is a port of jzlib v1.0.7, com.jcraft.jzlib.ZInputStream.java
*/
using System;
using System.Diagnostics;
using System.IO;
namespace Org.BouncyCastle.Utilities.Zlib
{
public class ZInputStream
: Stream
{
private const int BufferSize = 512;
protected ZStream z = new ZStream();
protected int flushLevel = JZlib.Z_NO_FLUSH;
// TODO Allow custom buf
protected byte[] buf = new byte[BufferSize];
protected byte[] buf1 = new byte[1];
protected bool compress;
protected Stream input;
protected bool closed;
private bool nomoreinput = false;
public ZInputStream(Stream input)
: this(input, false)
{
}
public ZInputStream(Stream input, bool nowrap)
{
Debug.Assert(input.CanRead);
this.input = input;
this.z.inflateInit(nowrap);
this.compress = false;
this.z.next_in = buf;
this.z.next_in_index = 0;
this.z.avail_in = 0;
}
public ZInputStream(Stream input, int level)
{
Debug.Assert(input.CanRead);
this.input = input;
this.z.deflateInit(level);
this.compress = true;
this.z.next_in = buf;
this.z.next_in_index = 0;
this.z.avail_in = 0;
}
/*public int available() throws IOException {
return inf.finished() ? 0 : 1;
}*/
public sealed override bool CanRead { get { return !closed; } }
public sealed override bool CanSeek { get { return false; } }
public sealed override bool CanWrite { get { return false; } }
protected override void Dispose(bool disposing)
{
if (disposing)
{
if (!closed)
{
closed = true;
input.Dispose();
}
}
}
public sealed override void Flush() {}
public virtual int FlushMode
{
get { return flushLevel; }
set { this.flushLevel = value; }
}
public sealed override long Length { get { throw new NotSupportedException(); } }
public sealed override long Position
{
get { throw new NotSupportedException(); }
set { throw new NotSupportedException(); }
}
public override int Read(byte[] b, int off, int len)
{
if (len==0)
return 0;
z.next_out = b;
z.next_out_index = off;
z.avail_out = len;
int err;
do
{
if (z.avail_in == 0 && !nomoreinput)
{
// if buffer is empty and more input is available, refill it
z.next_in_index = 0;
z.avail_in = input.Read(buf, 0, buf.Length); //(bufsize<z.avail_out ? bufsize : z.avail_out));
if (z.avail_in <= 0)
{
z.avail_in = 0;
nomoreinput = true;
}
}
err = compress
? z.deflate(flushLevel)
: z.inflate(flushLevel);
if (nomoreinput && err == JZlib.Z_BUF_ERROR)
return 0;
if (err != JZlib.Z_OK && err != JZlib.Z_STREAM_END)
// TODO
// throw new ZStreamException((compress ? "de" : "in") + "flating: " + z.msg);
throw new IOException((compress ? "de" : "in") + "flating: " + z.msg);
if ((nomoreinput || err == JZlib.Z_STREAM_END) && z.avail_out == len)
return 0;
}
while(z.avail_out == len && err == JZlib.Z_OK);
//Console.Error.WriteLine("("+(len-z.avail_out)+")");
return len - z.avail_out;
}
public override int ReadByte()
{
if (Read(buf1, 0, 1) <= 0)
return -1;
return buf1[0];
}
// public long skip(long n) throws IOException {
// int len=512;
// if(n<len)
// len=(int)n;
// byte[] tmp=new byte[len];
// return((long)read(tmp));
// }
public sealed override long Seek(long offset, SeekOrigin origin) { throw new NotSupportedException(); }
public sealed override void SetLength(long value) { throw new NotSupportedException(); }
public virtual long TotalIn
{
get { return z.total_in; }
}
public virtual long TotalOut
{
get { return z.total_out; }
}
public sealed override void Write(byte[] buffer, int offset, int count) { throw new NotSupportedException(); }
}
}
|
