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
|
// Copyright (c) 2009-2011, Wilson W.L. Fung, Tor M. Aamodt
// The University of British Columbia
// 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. Neither the name of
// The University of British Columbia nor the names of its contributors may be
// used to endorse or promote products derived from this software without
// specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 COPYRIGHT HOLDER OR 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.
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#ifndef DELAYQUEUE_H
#define DELAYQUEUE_H
#include "../statwrapper.h"
#include "gpu-misc.h"
template <class T>
struct fifo_data {
T* m_data;
fifo_data* m_next;
};
template <class T>
class fifo_pipeline {
public:
fifo_pipeline(const char* nm, unsigned int minlen, unsigned int maxlen) {
assert(maxlen);
m_name = nm;
m_min_len = minlen;
m_max_len = maxlen;
m_length = 0;
m_n_element = 0;
m_head = NULL;
m_tail = NULL;
for (unsigned i = 0; i < m_min_len; i++) push(NULL);
}
~fifo_pipeline() {
while (m_head) {
m_tail = m_head;
m_head = m_head->m_next;
delete m_tail;
}
}
void push(T* data) {
assert(m_length < m_max_len);
if (m_head) {
if (m_tail->m_data || m_length < m_min_len) {
m_tail->m_next = new fifo_data<T>();
m_tail = m_tail->m_next;
m_length++;
m_n_element++;
}
} else {
m_head = m_tail = new fifo_data<T>();
m_length++;
m_n_element++;
}
m_tail->m_next = NULL;
m_tail->m_data = data;
}
T* pop() {
fifo_data<T>* next;
T* data;
if (m_head) {
next = m_head->m_next;
data = m_head->m_data;
if (m_head == m_tail) {
assert(next == NULL);
m_tail = NULL;
}
delete m_head;
m_head = next;
m_length--;
if (m_length == 0) {
assert(m_head == NULL);
m_tail = m_head;
}
m_n_element--;
if (m_min_len && m_length < m_min_len) {
push(NULL);
m_n_element--; // uncount NULL elements inserted to create delays
}
} else {
data = NULL;
}
return data;
}
T* top() const {
if (m_head) {
return m_head->m_data;
} else {
return NULL;
}
}
void set_min_length(unsigned int new_min_len) {
if (new_min_len == m_min_len) return;
if (new_min_len > m_min_len) {
m_min_len = new_min_len;
while (m_length < m_min_len) {
push(NULL);
m_n_element--; // uncount NULL elements inserted to create delays
}
} else {
// in this branch imply that the original min_len is larger then 0
// ie. head != 0
assert(m_head);
m_min_len = new_min_len;
while ((m_length > m_min_len) && (m_tail->m_data == 0)) {
fifo_data<T>* iter;
iter = m_head;
while (iter && (iter->m_next != m_tail)) iter = iter->m_next;
if (!iter) {
// there is only one node, and that node is empty
assert(m_head->m_data == 0);
pop();
} else {
// there are more than one node, and tail node is empty
assert(iter->m_next == m_tail);
delete m_tail;
m_tail = iter;
m_tail->m_next = 0;
m_length--;
}
}
}
}
bool full() const { return (m_max_len && m_length >= m_max_len); }
bool is_avilable_size(unsigned size) const {
return (m_max_len && m_length + size - 1 >= m_max_len);
}
bool empty() const { return m_head == NULL; }
unsigned get_n_element() const { return m_n_element; }
unsigned get_length() const { return m_length; }
unsigned get_max_len() const { return m_max_len; }
void print() const {
fifo_data<T>* ddp = m_head;
printf("%s(%d): ", m_name, m_length);
while (ddp) {
printf("%p ", ddp->m_data);
ddp = ddp->m_next;
}
printf("\n");
}
private:
const char* m_name;
unsigned int m_min_len;
unsigned int m_max_len;
unsigned int m_length;
unsigned int m_n_element;
fifo_data<T>* m_head;
fifo_data<T>* m_tail;
};
#endif
|
