2 * Copyright (c) 2016, JANET(UK)
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of JANET(UK) nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
24 * COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
25 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
26 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
27 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
29 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
30 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
31 * OF THE POSSIBILITY OF SUCH DAMAGE.
40 #include <trp_internal.h>
41 #include <trp_ptable.h>
44 /* Can't do the updates test because trps_select_updates_for_peer() is now static */
45 #define VERIFY_UPDATES 0
51 unsigned int linkcost;
54 static struct peer_entry peer_data[]={
55 {"peer0", "trustrouter@peer0", 10000, 0x0001},
56 {"peer1", "trustrouter@peer1", 15000, 0x0002},
57 {"peer2", "trustrouter@peer2", 20000, 0x0004},
58 {"peer3", "trustrouter@peer3", 25000, 0x0008},
59 {"peer4", "trustrouter@peer4", 30000, 0x0010}
61 static size_t n_peers=sizeof(peer_data)/sizeof(peer_data[0]);
63 static void populate_ptable(TRPS_INSTANCE *trps)
68 for (i=0; i<n_peers; i++) {
69 new_peer=trp_peer_new(NULL);
70 assert(new_peer!=NULL);
71 trp_peer_set_server(new_peer, peer_data[i].server);
72 assert(trp_peer_get_server(new_peer)!=NULL);
73 trp_peer_add_gss_name(new_peer, tr_new_name(peer_data[i].gss_name));
74 assert(trp_peer_get_gss_names(new_peer)!=NULL);
75 trp_peer_set_port(new_peer, peer_data[i].port);
76 trp_peer_set_linkcost(new_peer, peer_data[i].linkcost);
77 assert(trps_add_peer(trps, new_peer)==TRP_SUCCESS);
81 static struct peer_entry *find_peer_entry(char *server)
84 for (i=0; i<n_peers; i++) {
85 if (0==strcmp(server, peer_data[i].server)) {
92 static void verify_ptable(TRPS_INSTANCE *trps)
94 struct peer_entry *peer_entry=NULL;
99 peer=trps->ptable->head;
101 peer_entry=find_peer_entry(trp_peer_get_server(peer));
102 assert(peer_entry!=NULL);
103 assert(!strcmp(trp_peer_get_server(peer), peer_entry->server));
104 assert(trp_peer_get_port(peer)==peer_entry->port);
105 assert(trp_peer_get_linkcost(peer)==peer_entry->linkcost);
106 assert(0<asprintf(&s, "trustrouter@%s", peer_entry->server));
107 gssname=tr_new_name(s);
109 assert(gssname!=NULL);
110 assert(tr_gss_names_matches(trp_peer_get_gss_names(peer), gssname));
111 tr_free_name(gssname);
124 unsigned int interval;
125 int verified; /* for testing */
127 static struct route_data route_table[]={
128 {"apc0", "realm0", "", 0, "tr.r0.apc0", "", 1, 60, 0},
129 {"apc0", "realm1", "", 0, "tr.r1.apc0", "", 1, 60, 0},
130 {"apc0", "realm0", "trustrouter@peer0", 1, "tr.r0.apc0", "trustrouter@peer0", 0, 60, 0},
131 {"apc0", "realm1", "trustrouter@peer0", 0, "tr.r1.apc0", "trustrouter@peer0", 0, 60, 0},
132 {"apc0", "realm2", "trustrouter@peer0", 0, "tr.r2.apc0", "trustrouter@peer0", 1, 60, 0},
133 {"apc0", "realm3", "trustrouter@peer0", 1, "tr.r3.apc0", "trustrouter@peer0", 0, 60, 0},
134 {"apc0", "realm4", "trustrouter@peer0", 2, "tr.r4.apc0", "trustrouter@peer0", 0, 60, 0},
135 {"apc0", "realm0", "trustrouter@peer1", 0, "tr.r0.apc0", "trustrouter@peer1", 0, 60, 0},
136 {"apc0", "realm1", "trustrouter@peer1", 1, "tr.r1.apc0", "trustrouter@peer1", 0, 60, 0},
137 {"apc0", "realm2", "trustrouter@peer1", 1, "tr.r2.apc0", "trustrouter@peer1", 0, 60, 0},
138 {"apc0", "realm3", "trustrouter@peer1", 0, "tr.r3.apc0", "trustrouter@peer1", 1, 60, 0},
139 {"apc0", "realm4", "trustrouter@peer1", 2, "tr.r4.apc0", "trustrouter@peer1", 0, 60, 0},
140 {"apc0", "realm0", "trustrouter@peer2", 0, "tr.r0.apc0", "trustrouter@peer2", 0, 60, 0},
141 {"apc0", "realm1", "trustrouter@peer2", 2, "tr.r1.apc0", "trustrouter@peer2", 0, 60, 0},
142 {"apc0", "realm2", "trustrouter@peer2", 2, "tr.r2.apc0", "trustrouter@peer2", 0, 60, 0},
143 {"apc0", "realm3", "trustrouter@peer2", 1, "tr.r3.apc0", "trustrouter@peer2", 0, 60, 0},
144 {"apc0", "realm4", "trustrouter@peer2", 0, "tr.r4.apc0", "trustrouter@peer2", 1, 60, 0},
146 static size_t n_routes=sizeof(route_table)/sizeof(route_table[0]);
149 /* These are the correct updates to select from the above route table for each peer.
150 * The rule is: send selected route unless it is through that peer, otherwise send
151 * the best (lowest metric) alternative route.
153 * In a few cases there are multiple valid options (when a two non-selected routes
154 * exist). If these tests are failing, it may be that the trps code is selecting another
155 * valid option, so check that. Probably ought to tweak metrics to avoid that ambiguity. */
156 static struct route_data update_table[][10]={
158 {"apc0", "realm0", "", 0, "tr.r0.apc0", "", 1, 60, 0},
159 {"apc0", "realm1", "", 0, "tr.r1.apc0", "", 1, 60, 0},
160 {"apc0", "realm2", "trustrouter@peer1", 1, "tr.r2.apc0", "trustrouter@peer1", 0, 60, 0},
161 {"apc0", "realm3", "trustrouter@peer1", 0, "tr.r3.apc0", "trustrouter@peer1", 1, 60, 0},
162 {"apc0", "realm4", "trustrouter@peer2", 0, "tr.r4.apc0", "trustrouter@peer2", 1, 60, 0},
166 {"apc0", "realm0", "", 0, "tr.r0.apc0", "", 1, 60, 0},
167 {"apc0", "realm1", "", 0, "tr.r1.apc0", "", 1, 60, 0},
168 {"apc0", "realm2", "trustrouter@peer0", 0, "tr.r2.apc0", "trustrouter@peer0", 1, 60, 0},
169 {"apc0", "realm3", "trustrouter@peer2", 1, "tr.r3.apc0", "trustrouter@peer2", 0, 60, 0},
170 {"apc0", "realm4", "trustrouter@peer2", 0, "tr.r4.apc0", "trustrouter@peer2", 1, 60, 0},
174 {"apc0", "realm0", "", 0, "tr.r0.apc0", "", 1, 60, 0},
175 {"apc0", "realm1", "", 0, "tr.r1.apc0", "", 1, 60, 0},
176 {"apc0", "realm2", "trustrouter@peer0", 0, "tr.r2.apc0", "trustrouter@peer0", 1, 60, 0},
177 {"apc0", "realm3", "trustrouter@peer1", 0, "tr.r3.apc0", "trustrouter@peer1", 1, 60, 0},
178 {"apc0", "realm4", "trustrouter@peer1", 2, "tr.r4.apc0", "trustrouter@peer1", 0, 60, 0},
182 {"apc0", "realm0", "", 0, "tr.r0.apc0", "", 1, 60, 0},
183 {"apc0", "realm1", "", 0, "tr.r1.apc0", "", 1, 60, 0},
184 {"apc0", "realm2", "trustrouter@peer0", 0, "tr.r2.apc0", "trustrouter@peer0", 1, 60, 0},
185 {"apc0", "realm3", "trustrouter@peer1", 0, "tr.r3.apc0", "trustrouter@peer1", 1, 60, 0},
186 {"apc0", "realm4", "trustrouter@peer2", 0, "tr.r4.apc0", "trustrouter@peer2", 1, 60, 0},
190 {"apc0", "realm0", "", 0, "tr.r0.apc0", "", 1, 60, 0},
191 {"apc0", "realm1", "", 0, "tr.r1.apc0", "", 1, 60, 0},
192 {"apc0", "realm2", "trustrouter@peer0", 0, "tr.r2.apc0", "trustrouter@peer0", 1, 60, 0},
193 {"apc0", "realm3", "trustrouter@peer1", 0, "tr.r3.apc0", "trustrouter@peer1", 1, 60, 0},
194 {"apc0", "realm4", "trustrouter@peer2", 0, "tr.r4.apc0", "trustrouter@peer2", 1, 60, 0},
198 #endif /* VERIFY_UPDATES */
200 static void populate_rtable(TRPS_INSTANCE *trps)
205 for (i=0; i<n_routes; i++) {
206 new=trp_route_new(NULL);
208 trp_route_set_comm(new, tr_new_name(route_table[i].apc));
209 trp_route_set_realm(new, tr_new_name(route_table[i].realm));
210 trp_route_set_peer(new, tr_new_name(route_table[i].peer));
211 trp_route_set_metric(new, route_table[i].metric);
212 trp_route_set_trust_router(new, tr_new_name(route_table[i].trust_router));
213 trp_route_set_next_hop(new, tr_new_name(route_table[i].next_hop));
214 trp_route_set_selected(new, route_table[i].selected);
215 trp_route_set_interval(new, route_table[i].interval);
216 /* do not set expiry */
217 trp_rtable_add(trps->rtable, new);
223 static void verify_update(TRP_ROUTE **updates, size_t n_updates, struct route_data *expected)
228 for(jj=0; jj<n_updates; jj++) {
230 for (ii=0; expected[ii].apc!=NULL; ii++) {
231 if ((0==strcmp(expected[ii].apc, updates[jj]->comm->buf))
232 &&(0==strcmp(expected[ii].realm, updates[jj]->realm->buf))
233 &&(0==strcmp(expected[ii].peer, updates[jj]->peer->buf))
234 &&(expected[ii].metric==updates[jj]->metric)
235 &&(0==strcmp(expected[ii].trust_router, updates[jj]->trust_router->buf))
236 &&(0==strcmp(expected[ii].next_hop, updates[jj]->next_hop->buf))
237 &&(expected[ii].selected==updates[jj]->selected)
238 &&(expected[ii].interval==updates[jj]->interval)) {
239 assert(expected[ii].verified==0); /* should only encounter each entry once */
240 expected[ii].verified=1;
246 printf("missing:\n%s\n", trp_route_to_str(NULL,updates[jj], " | "));
250 for(ii=0; expected[ii].apc!=NULL; ii++)
251 assert(expected[ii].verified==1);
254 static void verify_update_selection(TRPS_INSTANCE *trps)
257 TRP_ROUTE **updates=NULL;
259 TR_NAME *gssname=NULL;
262 for (ii=0; ii<n_peers; ii++) {
263 assert(0<asprintf(&s, "trustrouter@%s", peer_data[ii].server));
264 assert(NULL!=(gssname=tr_new_name(s)));
267 updates=trps_select_updates_for_peer(NULL, trps, gssname, &n_updates);
268 tr_free_name(gssname);
269 verify_update(updates, n_updates, update_table[ii]);
270 talloc_free(updates);
273 #endif /* VERIFY_UPDATES */
277 TALLOC_CTX *main_ctx=talloc_new(NULL);
281 trps=trps_new(main_ctx);
283 printf("\nPopulating peer table...\n");
284 populate_ptable(trps);
286 printf("\nVerifying peer table...\n");
289 printf("\nPopulating route table...\n");
290 populate_rtable(trps);
291 s=trp_rtable_to_str(main_ctx, trps->rtable, " | ", NULL);
292 printf("Route Table:\n%s---\n", s);
295 printf("\nVerifying route update selection...\n");
296 verify_update_selection(trps);
297 #endif /* VERIFY_UPDATES */
299 printf("\nDone\n\n");
300 talloc_report_full(main_ctx, stderr);
301 talloc_free(main_ctx);
302 talloc_report_full(NULL, stderr);