blob: a1b832e125df60294cf8850441f96e5d3a8a34d9 (
plain)
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
|
/*
* Ouroboros - Copyright (C) 2016 - 2018
*
* Reordering queue
*
* Dimitri Staessens <dimitri.staessens@ugent.be>
* Sander Vrijders <sander.vrijders@ugent.be>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* version 2.1 as published by the Free Software Foundation.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., http://www.fsf.org/about/contact/.
*/
#include "rq.h"
#include <assert.h>
struct pdu {
uint64_t seqno;
size_t idx;
};
struct rq {
struct pdu * items;
int n_items;
int size;
};
struct rq * rq_create(int size)
{
struct rq * rq;
rq = malloc(sizeof(*rq));
if (rq == NULL)
return NULL;
rq->items = malloc(sizeof(struct pdu) * (size + 1));
if (rq->items == NULL) {
free(rq);
return NULL;
}
rq->size = size;
rq->n_items = 0;
return rq;
}
void rq_destroy(struct rq * rq)
{
assert(rq);
free(rq->items);
free(rq);
}
int rq_push(struct rq * rq,
uint64_t seqno,
size_t idx)
{
int i;
int j;
assert(rq);
/* Queue is full. */
if (rq->n_items == rq->size)
return -1;
i = ++rq->n_items;
j = i >> 1;
while (i > 1 && rq->items[j].seqno > seqno) {
rq->items[i] = rq->items[j];
i = j;
j >>= 1;
}
rq->items[i].seqno = seqno;
rq->items[i].idx = idx;
return 0;
}
uint64_t rq_peek(struct rq * rq)
{
assert(rq);
return rq->items[1].seqno;
}
bool rq_is_empty(struct rq * rq)
{
assert(rq);
return (rq->n_items == 0);
}
size_t rq_pop(struct rq * rq)
{
size_t idx;
int i;
int j;
int k;
assert(rq);
idx = rq->items[1].idx;
rq->items[1] = rq->items[rq->n_items];
rq->n_items--;
i = 1;
while (true) {
k = i;
j = i << 1;
if (j <= rq->n_items && rq->items[j].seqno < rq->items[k].seqno)
k = j;
if (j + 1 <= rq->n_items &&
rq->items[j + 1].seqno < rq->items[k].seqno)
k = j + 1;
if (k == i)
break;
rq->items[i] = rq->items[k];
i = k;
}
rq->items[i] = rq->items[rq->n_items + 1];
return idx;
}
bool rq_has(struct rq * rq,
uint64_t seqno)
{
int i;
assert(rq);
for (i = 1; i <= rq->n_items; i++)
if (rq->items[i].seqno == seqno)
return true;
return false;
}
|
