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
|
/**************************************************************************/
/* */
/* Copyright (c) 2001, 2011 NoMachine (http://www.nomachine.com) */
/* Copyright (c) 2008-2017 Oleksandr Shneyder <o.shneyder@phoca-gmbh.de> */
/* Copyright (c) 2014-2022 Ulrich Sibiller <uli42@gmx.de> */
/* Copyright (c) 2014-2019 Mihai Moldovan <ionic@ionic.de> */
/* Copyright (c) 2011-2022 Mike Gabriel <mike.gabriel@das-netzwerkteam.de>*/
/* Copyright (c) 2015-2016 Qindel Group (http://www.qindel.com) */
/* */
/* NXCOMP, NX protocol compression and NX extensions to this software */
/* are copyright of the aforementioned persons and companies. */
/* */
/* Redistribution and use of the present software is allowed according */
/* to terms specified in the file LICENSE.nxcomp which comes in the */
/* source distribution. */
/* */
/* All rights reserved. */
/* */
/* NOTE: This software has received contributions from various other */
/* contributors, only the core maintainers and supporters are listed as */
/* copyright holders. Please contact us, if you feel you should be listed */
/* as copyright holder, as well. */
/* */
/**************************************************************************/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "SequenceQueue.h"
static const unsigned int INITIAL_SIZE_ = 16;
static const unsigned int GROWTH_INCREMENT = 16;
SequenceQueue::SequenceQueue()
: queue_(new RequestSequence[INITIAL_SIZE_]), size_(INITIAL_SIZE_),
length_(0), start_(0), end_(0)
{
}
SequenceQueue::~SequenceQueue()
{
delete [] queue_;
}
void SequenceQueue::push(unsigned short int sequence, unsigned char opcode,
unsigned int data1, unsigned int data2,
unsigned int data3)
{
if (length_ == 0)
{
start_ = end_ = 0;
queue_[0].opcode = opcode;
queue_[0].sequence = sequence;
queue_[0].data1 = data1;
queue_[0].data2 = data2;
queue_[0].data3 = data3;
length_ = 1;
return;
}
if (length_ == size_)
{
size_ += GROWTH_INCREMENT;
RequestSequence *newQueue = new RequestSequence[size_];
for (int i = start_; (unsigned int) i < length_; i++)
{
newQueue[i - start_] = queue_[i];
}
for (int i1 = 0; (unsigned int) i1 < start_; i1++)
{
newQueue[i1 + length_ - start_] = queue_[i1];
}
delete [] queue_;
queue_ = newQueue;
start_ = 0;
end_ = length_ - 1;
}
end_++;
if (end_ == size_)
{
end_ = 0;
}
queue_[end_].opcode = opcode;
queue_[end_].sequence = sequence;
queue_[end_].data1 = data1;
queue_[end_].data2 = data2;
queue_[end_].data3 = data3;
length_++;
}
int SequenceQueue::peek(unsigned short int &sequence,
unsigned char &opcode)
{
if (length_ == 0)
{
return 0;
}
else
{
opcode = queue_[start_].opcode;
sequence = queue_[start_].sequence;
return 1;
}
}
int SequenceQueue::peek(unsigned short int &sequence, unsigned char &opcode,
unsigned int &data1, unsigned int &data2,
unsigned int &data3)
{
if (length_ == 0)
{
return 0;
}
else
{
opcode = queue_[start_].opcode;
sequence = queue_[start_].sequence;
data1 = queue_[start_].data1;
data2 = queue_[start_].data2;
data3 = queue_[start_].data3;
return 1;
}
}
int SequenceQueue::pop(unsigned short int &sequence, unsigned char &opcode,
unsigned int &data1, unsigned int &data2,
unsigned int &data3)
{
if (length_ == 0)
{
return 0;
}
else
{
opcode = queue_[start_].opcode;
sequence = queue_[start_].sequence;
data1 = queue_[start_].data1;
data2 = queue_[start_].data2;
data3 = queue_[start_].data3;
start_++;
if (start_ == size_)
{
start_ = 0;
}
length_--;
return 1;
}
}
|
