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
|
/*
* Copyright (c) 2008 Nicira Networks.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <config.h>
#include "port-array.h"
#include <stdlib.h>
static struct port_array_l2 l2_sentinel;
static struct port_array_l3 l3_sentinel;
static bool inited;
/* Initializes 'pa' as an empty port_array. */
void
port_array_init(struct port_array *pa)
{
size_t i;
if (!inited) {
inited = true;
for (i = 0; i < PORT_ARRAY_L2_SIZE; i++) {
l2_sentinel.l2[i] = &l3_sentinel;
}
}
for (i = 0; i < PORT_ARRAY_L1_SIZE; i++) {
pa->l1[i] = &l2_sentinel;
}
}
/* Frees all the memory allocated for 'pa'. It is the client's responsibility
* to free memory that 'pa' elements point to. */
void
port_array_destroy(struct port_array *pa)
{
unsigned int l1_idx;
for (l1_idx = 0; l1_idx < PORT_ARRAY_L1_SIZE; l1_idx++) {
struct port_array_l2 *l2 = pa->l1[l1_idx];
if (l2 != &l2_sentinel) {
unsigned int l2_idx;
for (l2_idx = 0; l2_idx < PORT_ARRAY_L2_SIZE; l2_idx++) {
struct port_array_l3 *l3 = l2->l2[l2_idx];
if (l3 != &l3_sentinel) {
free(l3);
}
}
free(l2);
}
}
}
/* Clears all elements of 'pa' to null pointers. */
void
port_array_clear(struct port_array *pa)
{
port_array_destroy(pa);
port_array_init(pa);
}
/* Sets 'pa' element numbered 'idx' to 'p'. */
void
port_array_set(struct port_array *pa, uint16_t idx, void *p)
{
struct port_array_l2 **l2p, *l2;
struct port_array_l3 **l3p, *l3;
/* Traverse level 1. */
l2p = &pa->l1[PORT_ARRAY_L1(idx)];
if (*l2p == &l2_sentinel) {
*l2p = xmemdup(&l2_sentinel, sizeof l2_sentinel);
}
l2 = *l2p;
/* Traverse level 2. */
l3p = &l2->l2[PORT_ARRAY_L2(idx)];
if (*l3p == &l3_sentinel) {
*l3p = xmemdup(&l3_sentinel, sizeof l3_sentinel);
}
l3 = *l3p;
/* Set level 3. */
l3->l3[PORT_ARRAY_L3(idx)] = p;
}
static void *
next(const struct port_array *pa, unsigned int *idxp)
{
unsigned int idx = *idxp;
/* Using shift-right directly here, instead of PORT_ARRAY_L1(idx), ensures
* that with an initially too-big value of '*idxp' we will skip the outer
* loop and return NULL. */
unsigned int l1_idx = idx >> PORT_ARRAY_L1_SHIFT;
unsigned int l2_idx = PORT_ARRAY_L2(idx);
unsigned int l3_idx = PORT_ARRAY_L3(idx);
while (l1_idx < PORT_ARRAY_L1_SIZE) {
struct port_array_l2 *l2 = pa->l1[l1_idx];
if (l2 != &l2_sentinel) {
while (l2_idx < PORT_ARRAY_L2_SIZE) {
struct port_array_l3 *l3 = l2->l2[l2_idx];
if (l3 != &l3_sentinel) {
while (l3_idx < PORT_ARRAY_L3_SIZE) {
void *p = l3->l3[l3_idx];
if (p) {
*idxp = ((l1_idx << PORT_ARRAY_L1_SHIFT)
| (l2_idx << PORT_ARRAY_L2_SHIFT)
| (l3_idx << PORT_ARRAY_L3_SHIFT));
return p;
}
l3_idx++;
}
}
l2_idx++;
l3_idx = 0;
}
}
l1_idx++;
l2_idx = 0;
l3_idx = 0;
}
*idxp = PORT_ARRAY_SIZE;
return NULL;
}
/* Returns the value of the lowest-numbered non-empty element of 'pa', and sets
* '*idxp' to that element's index. If 'pa' is entirely empty, returns a null
* pointer and sets '*idxp' to 65536. */
void *
port_array_first(const struct port_array *pa, unsigned int *idxp)
{
*idxp = 0;
return next(pa, idxp);
}
/* Returns the value of the lowest-numbered non-empty element of 'pa' greater
* than the initial value of '*idxp', and sets '*idxp' to that element's index.
* If 'pa' contains no non-empty elements with indexes greater than the initial
* value of '*idxp', returns a null pointer and sets '*idxp' to 65536. */
void *
port_array_next(const struct port_array *pa, unsigned int *idxp)
{
++*idxp;
return next(pa, idxp);
}
/* Returns the number of non-null elements of 'pa'. */
unsigned int
port_array_count(const struct port_array *pa)
{
unsigned int l1_idx, l2_idx, l3_idx;
unsigned int count;
count = 0;
for (l1_idx = 0; l1_idx < PORT_ARRAY_L1_SIZE; l1_idx++) {
struct port_array_l2 *l2 = pa->l1[l1_idx];
if (l2 != &l2_sentinel) {
for (l2_idx = 0; l2_idx < PORT_ARRAY_L2_SIZE; l2_idx++) {
struct port_array_l3 *l3 = l2->l2[l2_idx];
if (l3 != &l3_sentinel) {
for (l3_idx = 0; l3_idx < PORT_ARRAY_L3_SIZE; l3_idx++) {
if (l3->l3[l3_idx]) {
count++;
}
}
}
}
}
}
return count;
}
|
