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
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/*
* Copyright (c) 2021 Cisco and/or its affiliates.
* 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.
*/
/**
* \file connection_table.c
* \brief Implementation of hICN connection table
*/
#include <hicn/util/log.h>
#include "connection.h"
#include "connection_table.h"
/* This is only used as a hint for first allocation, as the table is resizeable
*/
#define DEFAULT_CONNECTION_TABLE_SIZE 64
connection_table_t *_connection_table_create(size_t init_size,
size_t max_size) {
if (init_size == 0) init_size = DEFAULT_CONNECTION_TABLE_SIZE;
connection_table_t *table = malloc(sizeof(connection_table_t));
if (!table) return NULL;
table->max_size = max_size;
/* Initialize indices */
table->id_by_pair = kh_init_ct_pair();
table->id_by_name = kh_init_ct_name();
/*
* We start by allocating a reasonably-sized pool, as this will eventually
* be resized if needed.
*/
pool_init(table->connections, init_size, 0);
return table;
}
void connection_table_free(connection_table_t *table) {
const char *k_name;
const address_pair_t *k_pair;
unsigned v_conn_id;
connection_t *connection;
const char *name;
kh_foreach(table->id_by_name, k_name, v_conn_id, {
connection = connection_table_get_by_id(table, v_conn_id);
name = connection_get_name(connection);
INFO("Removing connection %s [%d]", name, connection->fd);
connection_finalize(connection);
});
(void)v_conn_id;
kh_foreach(table->id_by_name, k_name, v_conn_id, { free((char *)k_name); });
kh_foreach(table->id_by_pair, k_pair, v_conn_id,
{ free((address_pair_t *)k_pair); });
kh_destroy_ct_pair(table->id_by_pair);
kh_destroy_ct_name(table->id_by_name);
pool_free(table->connections);
free(table);
}
connection_t *connection_table_allocate(const connection_table_t *table,
const address_pair_t *pair,
const char *name) {
connection_t *conn = NULL;
pool_get(table->connections, conn);
if (!conn) return NULL;
off_t id = conn - table->connections;
int rc;
// Add in name hash table
khiter_t k = kh_put_ct_name(table->id_by_name, strdup(name), &rc);
assert(rc == KH_ADDED || rc == KH_RESET);
kh_value(table->id_by_name, k) = (unsigned int)id;
// Add in pair hash table
address_pair_t *pair_copy = (address_pair_t *)malloc(sizeof(address_pair_t));
memcpy(pair_copy, pair, sizeof(address_pair_t));
k = kh_put_ct_pair(table->id_by_pair, pair_copy, &rc);
assert(rc == KH_ADDED || rc == KH_RESET);
kh_value(table->id_by_pair, k) = (unsigned int)id;
assert(kh_size(table->id_by_name) == kh_size(table->id_by_pair));
return conn;
}
void connection_table_deallocate(const connection_table_t *table,
const connection_t *conn) {
const char *name = connection_get_name(conn);
const address_pair_t *pair = connection_get_pair(conn);
// Remove from name hash table
khiter_t k = kh_get_ct_name(table->id_by_name, name);
assert(k != kh_end(table->id_by_name));
free((char *)kh_key(table->id_by_name, k));
kh_del_ct_name(table->id_by_name, k);
// Remove from pair hash table
k = kh_get_ct_pair(table->id_by_pair, pair);
assert(k != kh_end(table->id_by_pair));
free((address_pair_t *)kh_key(table->id_by_pair, k));
kh_del_ct_pair(table->id_by_pair, k);
assert(kh_size(table->id_by_name) == kh_size(table->id_by_pair));
pool_put(table->connections, conn);
}
connection_t *connection_table_get_by_pair(const connection_table_t *table,
const address_pair_t *pair) {
khiter_t k = kh_get_ct_pair(table->id_by_pair, pair);
if (k == kh_end(table->id_by_pair)) return NULL;
return table->connections + kh_val(table->id_by_pair, k);
}
off_t connection_table_get_id_by_name(const connection_table_t *table,
const char *name) {
khiter_t k = kh_get_ct_name(table->id_by_name, name);
if (k == kh_end(table->id_by_name)) return CONNECTION_ID_UNDEFINED;
return kh_val(table->id_by_name, k);
}
connection_t *connection_table_get_by_name(const connection_table_t *table,
const char *name) {
unsigned conn_id = (unsigned int)connection_table_get_id_by_name(table, name);
if (!connection_id_is_valid(conn_id)) return NULL;
return connection_table_at(table, conn_id);
}
void connection_table_remove_by_id(connection_table_t *table, off_t id) {
connection_t *connection = connection_table_at(table, id);
INFO("Removing connection %d (%s)", id, connection_get_name(connection));
connection_table_deallocate(table, connection);
}
void connection_table_print_by_pair(const connection_table_t *table) {
const address_pair_t *k;
unsigned v;
char local_addr_str[NI_MAXHOST], remote_addr_str[NI_MAXHOST];
int local_port, remote_port;
connection_t *connection;
const char *name;
INFO("*** Connection table ***");
kh_foreach(table->id_by_pair, k, v, {
address_to_string(&(k->local), local_addr_str, &local_port);
address_to_string(&(k->remote), remote_addr_str, &remote_port);
connection = connection_table_get_by_id(table, v);
name = connection_get_name(connection);
INFO("(%s:%d - %s:%d)\t\t\t(%u, %s)", local_addr_str, local_port,
remote_addr_str, remote_port, v, name);
})
}
void connection_table_print_by_name(const connection_table_t *table) {
const char *k;
unsigned v;
connection_t *connection;
const char *name;
INFO("*** Connection table ***");
kh_foreach(table->id_by_name, k, v, {
connection = connection_table_get_by_id(table, v);
name = connection_get_name(connection);
INFO("(%s)\t\t\t(%u, %s)", k, v, name);
})
}
connection_t *_connection_table_get_by_id(connection_table_t *table, off_t id) {
return connection_table_get_by_id(table, id);
}
static inline u16 RAND16() { return rand() & 0xFFFF; }
int connection_table_get_random_name(const connection_table_t *table,
char *name) {
int i, n_attempts = 2 * USHRT_MAX;
for (i = 0; i < n_attempts; i++) {
int rc = snprintf(name, SYMBOLIC_NAME_LEN, "conn%u", RAND16());
if (rc >= SYMBOLIC_NAME_LEN) continue;
// Check if generated connection name is a duplicate
khiter_t k = kh_get_ct_name(table->id_by_name, name);
if (k == kh_end(table->id_by_name)) break;
}
if (i == n_attempts) {
ERROR("Unable to generate new unique connection name");
return -1;
}
return 0;
}
|
