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
|
using System;
namespace Org.BouncyCastle.Crypto.Tls
{
/// <remarks>
/// A queue for bytes.
/// <p>
/// This file could be more optimized.
/// </p>
/// </remarks>
public class ByteQueue
{
/// <returns>The smallest number which can be written as 2^x which is bigger than i.</returns>
public static int NextTwoPow(
int i)
{
/*
* This code is based of a lot of code I found on the Internet
* which mostly referenced a book called "Hacking delight".
*
*/
i |= (i >> 1);
i |= (i >> 2);
i |= (i >> 4);
i |= (i >> 8);
i |= (i >> 16);
return i + 1;
}
/**
* The initial size for our buffer.
*/
private const int InitBufSize = 1024;
/**
* The buffer where we store our data.
*/
private byte[] databuf = new byte[ByteQueue.InitBufSize];
/**
* How many bytes at the beginning of the buffer are skipped.
*/
private int skipped = 0;
/**
* How many bytes in the buffer are valid data.
*/
private int available = 0;
/// <summary>Read data from the buffer.</summary>
/// <param name="buf">The buffer where the read data will be copied to.</param>
/// <param name="offset">How many bytes to skip at the beginning of buf.</param>
/// <param name="len">How many bytes to read at all.</param>
/// <param name="skip">How many bytes from our data to skip.</param>
public void Read(
byte[] buf,
int offset,
int len,
int skip)
{
if ((available - skip) < len)
{
throw new TlsException("Not enough data to read");
}
if ((buf.Length - offset) < len)
{
throw new TlsException("Buffer size of " + buf.Length + " is too small for a read of " + len + " bytes");
}
Array.Copy(databuf, skipped + skip, buf, offset, len);
}
/// <summary>Add some data to our buffer.</summary>
/// <param name="data">A byte-array to read data from.</param>
/// <param name="offset">How many bytes to skip at the beginning of the array.</param>
/// <param name="len">How many bytes to read from the array.</param>
public void AddData(
byte[] data,
int offset,
int len)
{
if ((skipped + available + len) > databuf.Length)
{
byte[] tmp = new byte[ByteQueue.NextTwoPow(data.Length)];
Array.Copy(databuf, skipped, tmp, 0, available);
skipped = 0;
databuf = tmp;
}
Array.Copy(data, offset, databuf, skipped + available, len);
available += len;
}
/// <summary>Remove some bytes from our data from the beginning.</summary>
/// <param name="i">How many bytes to remove.</param>
public void RemoveData(
int i)
{
if (i > available)
{
throw new TlsException("Cannot remove " + i + " bytes, only got " + available);
}
/*
* Skip the data.
*/
available -= i;
skipped += i;
/*
* If more than half of our data is skipped, we will move the data
* in the buffer.
*/
if (skipped > (databuf.Length / 2))
{
Array.Copy(databuf, skipped, databuf, 0, available);
skipped = 0;
}
}
/// <summary>The number of bytes which are available in this buffer.</summary>
public int Available
{
get { return available; }
}
}
}
|
