hammer2 - Config notifications, cleanup HAMMER2 VFS API
[dragonfly.git] / sbin / hammer2 / msg_lnk.c
CommitLineData
8c280d5d
MD
1/*
2 * Copyright (c) 2012 The DragonFly Project. All rights reserved.
3 *
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@dragonflybsd.org>
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
16 * distribution.
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 */
34/*
35 * LNK_SPAN PROTOCOL SUPPORT FUNCTIONS
36 *
37 * This code supports the LNK_SPAN protocol. Essentially all PFS's
38 * clients and services rendezvous with the userland hammer2 service and
39 * open LNK_SPAN transactions using a message header linkid of 0,
40 * registering any PFS's they have connectivity to with us.
41 *
42 * --
43 *
44 * Each registration maintains its own open LNK_SPAN message transaction.
45 * The SPANs are collected, aggregated, and retransmitted over available
46 * connections through the maintainance of additional LNK_SPAN message
47 * transactions on each link.
48 *
49 * The msgid for each active LNK_SPAN transaction we receive allows us to
50 * send a message to the target PFS (which might be one of many belonging
51 * to the same cluster), by specifying that msgid as the linkid in any
52 * message we send to the target PFS.
53 *
54 * Similarly the msgid we allocate for any LNK_SPAN transaction we transmit
55 * (and remember we will maintain multiple open LNK_SPAN transactions on
56 * each connection representing the topology span, so every node sees every
57 * other node as a separate open transaction). So, similarly the msgid for
58 * these active transactions which we initiated can be used by the other
59 * end to route messages through us to another node, ultimately winding up
60 * at the identified hammer2 PFS. We have to adjust the spanid in the message
61 * header at each hop to be representative of the outgoing LNK_SPAN we
62 * are forwarding the message through.
63 *
64 * --
65 *
66 * If we were to retransmit every LNK_SPAN transaction we receive it would
67 * create a huge mess, so we have to aggregate all received LNK_SPAN
68 * transactions, sort them by the fsid (the cluster) and sub-sort them by
69 * the pfs_fsid (individual nodes in the cluster), and only retransmit
7dc0f844 70 * (create outgoing transactions) for a subset of the nearest distance-hops
8c280d5d
MD
71 * for each individual node.
72 *
73 * The higher level protocols can then issue transactions to the nodes making
74 * up a cluster to perform all actions required.
75 *
76 * --
77 *
78 * Since this is a large topology and a spanning tree protocol, links can
79 * go up and down all the time. Any time a link goes down its transaction
80 * is closed. The transaction has to be closed on both ends before we can
81 * delete (and potentially reuse) the related spanid. The LNK_SPAN being
82 * closed may have been propagated out to other connections and those related
83 * LNK_SPANs are also closed. Ultimately all routes via the lost LNK_SPAN
84 * go away, ultimately reaching all sources and all targets.
85 *
86 * Any messages in-transit using a route that goes away will be thrown away.
87 * Open transactions are only tracked at the two end-points. When a link
88 * failure propagates to an end-point the related open transactions lose
89 * their spanid and are automatically aborted.
90 *
91 * It is important to note that internal route nodes cannot just associate
92 * a lost LNK_SPAN transaction with another route to the same destination.
93 * Message transactions MUST be serialized and MUST be ordered. All messages
94 * for a transaction must run over the same route. So if the route used by
95 * an active transaction is lost, the related messages will be fully aborted
96 * and the higher protocol levels will retry as appropriate.
97 *
29ead430
MD
98 * FULLY ABORTING A ROUTED MESSAGE is handled via link-failure propagation
99 * back to the originator. Only the originator keeps tracks of a message.
100 * Routers just pass it through. If a route is lost during transit the
101 * message is simply thrown away.
102 *
8c280d5d
MD
103 * It is also important to note that several paths to the same PFS can be
104 * propagated along the same link, which allows concurrency and even
105 * redundancy over several network interfaces or via different routes through
106 * the topology. Any given transaction will use only a single route but busy
107 * servers will often have hundreds of transactions active simultaniously,
108 * so having multiple active paths through the network topology for A<->B
109 * will improve performance.
110 *
111 * --
112 *
113 * Most protocols consolidate operations rather than simply relaying them.
114 * This is particularly true of LEAF protocols (such as strict HAMMER2
115 * clients), of which there can be millions connecting into the cluster at
116 * various points. The SPAN protocol is not used for these LEAF elements.
117 *
118 * Instead the primary service they connect to implements a proxy for the
119 * client protocols so the core topology only has to propagate a couple of
120 * LNK_SPANs and not millions. LNK_SPANs are meant to be used only for
121 * core master nodes and satellite slaves and cache nodes.
122 */
123
124#include "hammer2.h"
125
126/*
cf715800
MD
127 * Maximum spanning tree distance. This has the practical effect of
128 * stopping tail-chasing closed loops when a feeder span is lost.
129 */
130#define HAMMER2_SPAN_MAXDIST 16
131
132/*
8c280d5d
MD
133 * RED-BLACK TREE DEFINITIONS
134 *
7dc0f844 135 * We need to track:
8c280d5d
MD
136 *
137 * (1) shared fsid's (a cluster).
138 * (2) unique fsid's (a node in a cluster) <--- LNK_SPAN transactions.
139 *
140 * We need to aggegate all active LNK_SPANs, aggregate, and create our own
141 * outgoing LNK_SPAN transactions on each of our connections representing
142 * the aggregated state.
143 *
144 * h2span_connect - list of iocom connections who wish to receive SPAN
145 * propagation from other connections. Might contain
146 * a filter string. Only iocom's with an open
147 * LNK_CONN transactions are applicable for SPAN
148 * propagation.
149 *
150 * h2span_relay - List of links relayed (via SPAN). Essentially
151 * each relay structure represents a LNK_SPAN
152 * transaction that we initiated, verses h2span_link
153 * which is a LNK_SPAN transaction that we received.
154 *
155 * --
156 *
157 * h2span_cluster - Organizes the shared fsid's. One structure for
158 * each cluster.
159 *
160 * h2span_node - Organizes the nodes in a cluster. One structure
161 * for each unique {cluster,node}, aka {fsid, pfs_fsid}.
162 *
163 * h2span_link - Organizes all incoming and outgoing LNK_SPAN message
164 * transactions related to a node.
165 *
166 * One h2span_link structure for each incoming LNK_SPAN
167 * transaction. Links selected for propagation back
168 * out are also where the outgoing LNK_SPAN messages
169 * are indexed into (so we can propagate changes).
170 *
171 * The h2span_link's use a red-black tree to sort the
7dc0f844 172 * distance hop metric for the incoming LNK_SPAN. We
8c280d5d
MD
173 * then select the top N for outgoing. When the
174 * topology changes the top N may also change and cause
175 * new outgoing LNK_SPAN transactions to be opened
176 * and less desireable ones to be closed, causing
177 * transactional aborts within the message flow in
178 * the process.
179 *
180 * Also note - All outgoing LNK_SPAN message transactions are also
181 * entered into a red-black tree for use by the routing
182 * function. This is handled by msg.c in the state
183 * code, not here.
184 */
185
186struct h2span_link;
187struct h2span_relay;
1a34728c 188TAILQ_HEAD(h2span_media_queue, h2span_media);
8c280d5d
MD
189TAILQ_HEAD(h2span_connect_queue, h2span_connect);
190TAILQ_HEAD(h2span_relay_queue, h2span_relay);
191
192RB_HEAD(h2span_cluster_tree, h2span_cluster);
193RB_HEAD(h2span_node_tree, h2span_node);
194RB_HEAD(h2span_link_tree, h2span_link);
195RB_HEAD(h2span_relay_tree, h2span_relay);
196
197/*
1a34728c
MD
198 * This represents a media
199 */
200struct h2span_media {
201 TAILQ_ENTRY(h2span_media) entry;
202 uuid_t mediaid;
203 int refs;
204 struct h2span_media_config {
205 hammer2_copy_data_t copy_run;
206 hammer2_copy_data_t copy_pend;
207 pthread_t thread;
208 pthread_cond_t cond;
209 int ctl;
210 int fd;
211 hammer2_iocom_t iocom;
212 pthread_t iocom_thread;
213 enum { H2MC_STOPPED, H2MC_CONNECT, H2MC_RUNNING } state;
214 } config[HAMMER2_COPYID_COUNT];
215};
216
217typedef struct h2span_media_config h2span_media_config_t;
218
219#define H2CONFCTL_STOP 0x00000001
220#define H2CONFCTL_UPDATE 0x00000002
221
222/*
8c280d5d 223 * Received LNK_CONN transaction enables SPAN protocol over connection.
1a34728c
MD
224 * (may contain filter). Typically one for each mount and several may
225 * share the same media.
8c280d5d
MD
226 */
227struct h2span_connect {
228 TAILQ_ENTRY(h2span_connect) entry;
229 struct h2span_relay_tree tree;
1a34728c 230 struct h2span_media *media;
8c280d5d
MD
231 hammer2_state_t *state;
232};
233
234/*
235 * All received LNK_SPANs are organized by cluster (pfs_clid),
236 * node (pfs_fsid), and link (received LNK_SPAN transaction).
237 */
238struct h2span_cluster {
239 RB_ENTRY(h2span_cluster) rbnode;
240 struct h2span_node_tree tree;
241 uuid_t pfs_clid; /* shared fsid */
90e8cd1d 242 int refs; /* prevents destruction */
8c280d5d
MD
243};
244
7dc0f844 245struct h2span_node {
8c280d5d
MD
246 RB_ENTRY(h2span_node) rbnode;
247 struct h2span_link_tree tree;
248 struct h2span_cluster *cls;
249 uuid_t pfs_fsid; /* unique fsid */
81666e1b 250 char label[64];
8c280d5d
MD
251};
252
253struct h2span_link {
254 RB_ENTRY(h2span_link) rbnode;
255 hammer2_state_t *state; /* state<->link */
256 struct h2span_node *node; /* related node */
7dc0f844 257 int32_t dist;
8c280d5d 258 struct h2span_relay_queue relayq; /* relay out */
90e8cd1d 259 struct hammer2_router *router; /* route out this link */
8c280d5d
MD
260};
261
262/*
263 * Any LNK_SPAN transactions we receive which are relayed out other
264 * connections utilize this structure to track the LNK_SPAN transaction
265 * we initiate on the other connections, if selected for relay.
266 *
267 * In many respects this is the core of the protocol... actually figuring
268 * out what LNK_SPANs to relay. The spanid used for relaying is the
269 * address of the 'state' structure, which is why h2span_relay has to
270 * be entered into a RB-TREE based at h2span_connect (so we can look
271 * up the spanid to validate it).
90e8cd1d
MD
272 *
273 * NOTE: Messages can be received via the LNK_SPAN transaction the
274 * relay maintains, and can be replied via relay->router, but
275 * messages are NOT initiated via a relay. Messages are initiated
276 * via incoming links (h2span_link's).
277 *
278 * relay->link represents the link being relayed, NOT the LNK_SPAN
279 * transaction the relay is holding open.
8c280d5d
MD
280 */
281struct h2span_relay {
282 RB_ENTRY(h2span_relay) rbnode; /* from h2span_connect */
283 TAILQ_ENTRY(h2span_relay) entry; /* from link */
284 struct h2span_connect *conn;
285 hammer2_state_t *state; /* transmitted LNK_SPAN */
90e8cd1d
MD
286 struct h2span_link *link; /* LNK_SPAN being relayed */
287 struct hammer2_router *router;/* route out this relay */
8c280d5d
MD
288};
289
290
1a34728c 291typedef struct h2span_media h2span_media_t;
8c280d5d
MD
292typedef struct h2span_connect h2span_connect_t;
293typedef struct h2span_cluster h2span_cluster_t;
294typedef struct h2span_node h2span_node_t;
295typedef struct h2span_link h2span_link_t;
296typedef struct h2span_relay h2span_relay_t;
297
298static
299int
300h2span_cluster_cmp(h2span_cluster_t *cls1, h2span_cluster_t *cls2)
301{
302 return(uuid_compare(&cls1->pfs_clid, &cls2->pfs_clid, NULL));
303}
304
305static
306int
307h2span_node_cmp(h2span_node_t *node1, h2span_node_t *node2)
308{
309 return(uuid_compare(&node1->pfs_fsid, &node2->pfs_fsid, NULL));
310}
311
cf715800 312/*
10c86c4e
MD
313 * Sort/subsort must match h2span_relay_cmp() under any given node
314 * to make the aggregation algorithm easier, so the best links are
315 * in the same sorted order as the best relays.
316 *
317 * NOTE: We cannot use link*->state->msgid because this msgid is created
318 * by each remote host and thus might wind up being the same.
cf715800 319 */
8c280d5d
MD
320static
321int
322h2span_link_cmp(h2span_link_t *link1, h2span_link_t *link2)
323{
7dc0f844 324 if (link1->dist < link2->dist)
8c280d5d 325 return(-1);
7dc0f844 326 if (link1->dist > link2->dist)
8c280d5d 327 return(1);
10c86c4e
MD
328#if 1
329 if ((uintptr_t)link1->state < (uintptr_t)link2->state)
330 return(-1);
331 if ((uintptr_t)link1->state > (uintptr_t)link2->state)
332 return(1);
333#else
29ead430 334 if (link1->state->msgid < link2->state->msgid)
8c280d5d 335 return(-1);
29ead430 336 if (link1->state->msgid > link2->state->msgid)
8c280d5d 337 return(1);
10c86c4e 338#endif
8c280d5d
MD
339 return(0);
340}
341
7dc0f844
MD
342/*
343 * Relay entries are sorted by node, subsorted by distance and link
344 * address (so we can match up the conn->tree relay topology with
345 * a node's link topology).
346 */
8c280d5d
MD
347static
348int
349h2span_relay_cmp(h2span_relay_t *relay1, h2span_relay_t *relay2)
350{
29ead430
MD
351 h2span_link_t *link1 = relay1->link;
352 h2span_link_t *link2 = relay2->link;
353
354 if ((intptr_t)link1->node < (intptr_t)link2->node)
7dc0f844 355 return(-1);
29ead430 356 if ((intptr_t)link1->node > (intptr_t)link2->node)
7dc0f844 357 return(1);
29ead430 358 if (link1->dist < link2->dist)
8c280d5d 359 return(-1);
29ead430 360 if (link1->dist > link2->dist)
7dc0f844 361 return(1);
10c86c4e
MD
362#if 1
363 if ((uintptr_t)link1->state < (uintptr_t)link2->state)
364 return(-1);
365 if ((uintptr_t)link1->state > (uintptr_t)link2->state)
366 return(1);
367#else
29ead430 368 if (link1->state->msgid < link2->state->msgid)
7dc0f844 369 return(-1);
29ead430 370 if (link1->state->msgid > link2->state->msgid)
8c280d5d 371 return(1);
10c86c4e 372#endif
8c280d5d
MD
373 return(0);
374}
375
376RB_PROTOTYPE_STATIC(h2span_cluster_tree, h2span_cluster,
377 rbnode, h2span_cluster_cmp);
378RB_PROTOTYPE_STATIC(h2span_node_tree, h2span_node,
379 rbnode, h2span_node_cmp);
380RB_PROTOTYPE_STATIC(h2span_link_tree, h2span_link,
381 rbnode, h2span_link_cmp);
382RB_PROTOTYPE_STATIC(h2span_relay_tree, h2span_relay,
383 rbnode, h2span_relay_cmp);
384
385RB_GENERATE_STATIC(h2span_cluster_tree, h2span_cluster,
386 rbnode, h2span_cluster_cmp);
387RB_GENERATE_STATIC(h2span_node_tree, h2span_node,
388 rbnode, h2span_node_cmp);
389RB_GENERATE_STATIC(h2span_link_tree, h2span_link,
390 rbnode, h2span_link_cmp);
391RB_GENERATE_STATIC(h2span_relay_tree, h2span_relay,
392 rbnode, h2span_relay_cmp);
393
394/*
1a34728c 395 * Global mutex protects cluster_tree lookups, connq, mediaq.
8c280d5d
MD
396 */
397static pthread_mutex_t cluster_mtx;
398static struct h2span_cluster_tree cluster_tree = RB_INITIALIZER(cluster_tree);
399static struct h2span_connect_queue connq = TAILQ_HEAD_INITIALIZER(connq);
1a34728c 400static struct h2span_media_queue mediaq = TAILQ_HEAD_INITIALIZER(mediaq);
8c280d5d 401
29ead430
MD
402static void hammer2_lnk_span(hammer2_msg_t *msg);
403static void hammer2_lnk_conn(hammer2_msg_t *msg);
404static void hammer2_lnk_relay(hammer2_msg_t *msg);
02454b3e 405static void hammer2_relay_scan(h2span_connect_t *conn, h2span_node_t *node);
7dc0f844 406static void hammer2_relay_delete(h2span_relay_t *relay);
8c280d5d 407
1a34728c
MD
408static void *hammer2_volconf_thread(void *info);
409static void hammer2_volconf_stop(h2span_media_config_t *conf);
410static void hammer2_volconf_start(h2span_media_config_t *conf,
411 const char *hostname);
412
29ead430
MD
413void
414hammer2_msg_lnk_signal(hammer2_router_t *router __unused)
415{
416 pthread_mutex_lock(&cluster_mtx);
417 hammer2_relay_scan(NULL, NULL);
418 pthread_mutex_unlock(&cluster_mtx);
419}
420
8c280d5d
MD
421/*
422 * Receive a HAMMER2_MSG_PROTO_LNK message. This only called for
423 * one-way and opening-transactions since state->func will be assigned
424 * in all other cases.
425 */
426void
29ead430 427hammer2_msg_lnk(hammer2_msg_t *msg)
8c280d5d
MD
428{
429 switch(msg->any.head.cmd & HAMMER2_MSGF_BASECMDMASK) {
430 case HAMMER2_LNK_CONN:
29ead430 431 hammer2_lnk_conn(msg);
8c280d5d
MD
432 break;
433 case HAMMER2_LNK_SPAN:
29ead430 434 hammer2_lnk_span(msg);
8c280d5d
MD
435 break;
436 default:
437 fprintf(stderr,
438 "MSG_PROTO_LNK: Unknown msg %08x\n", msg->any.head.cmd);
29ead430 439 hammer2_msg_reply(msg, HAMMER2_MSG_ERR_NOSUPP);
8c280d5d
MD
440 /* state invalid after reply */
441 break;
442 }
443}
444
445void
29ead430 446hammer2_lnk_conn(hammer2_msg_t *msg)
8c280d5d 447{
29ead430 448 hammer2_state_t *state = msg->state;
1a34728c
MD
449 h2span_media_t *media;
450 h2span_media_config_t *conf;
8c280d5d
MD
451 h2span_connect_t *conn;
452 h2span_relay_t *relay;
453 char *alloc = NULL;
1a34728c 454 int i;
8c280d5d
MD
455
456 pthread_mutex_lock(&cluster_mtx);
457
1a34728c
MD
458 switch(msg->any.head.cmd & HAMMER2_MSGF_TRANSMASK) {
459 case HAMMER2_LNK_CONN | HAMMER2_MSGF_CREATE:
460 case HAMMER2_LNK_CONN | HAMMER2_MSGF_CREATE | HAMMER2_MSGF_DELETE:
461 /*
462 * On transaction start we allocate a new h2span_connect and
463 * acknowledge the request, leaving the transaction open.
464 * We then relay priority-selected SPANs.
465 */
81666e1b
MD
466 fprintf(stderr, "LNK_CONN(%08x): %s/%s\n",
467 (uint32_t)msg->any.head.msgid,
8c280d5d
MD
468 hammer2_uuid_to_str(&msg->any.lnk_conn.pfs_clid,
469 &alloc),
470 msg->any.lnk_conn.label);
471 free(alloc);
472
473 conn = hammer2_alloc(sizeof(*conn));
474
475 RB_INIT(&conn->tree);
476 conn->state = state;
1a34728c 477 state->func = hammer2_lnk_conn;
8c280d5d
MD
478 state->any.conn = conn;
479 TAILQ_INSERT_TAIL(&connq, conn, entry);
480
02454b3e 481 /*
1a34728c 482 * Set up media
02454b3e 483 */
1a34728c
MD
484 TAILQ_FOREACH(media, &mediaq, entry) {
485 if (uuid_compare(&msg->any.lnk_conn.mediaid,
486 &media->mediaid, NULL) == 0) {
487 break;
488 }
489 }
490 if (media == NULL) {
491 media = hammer2_alloc(sizeof(*media));
492 media->mediaid = msg->any.lnk_conn.mediaid;
493 TAILQ_INSERT_TAIL(&mediaq, media, entry);
494 }
495 conn->media = media;
496 ++media->refs;
8c280d5d 497
1a34728c
MD
498 if ((msg->any.head.cmd & HAMMER2_MSGF_DELETE) == 0) {
499 hammer2_msg_result(msg, 0);
500 hammer2_router_signal(msg->router);
501 break;
502 }
503 /* FALL THROUGH */
504 case HAMMER2_LNK_CONN | HAMMER2_MSGF_DELETE:
505 case HAMMER2_LNK_ERROR | HAMMER2_MSGF_DELETE:
506deleteconn:
507 /*
508 * On transaction terminate we clean out our h2span_connect
509 * and acknowledge the request, closing the transaction.
510 */
8c280d5d
MD
511 fprintf(stderr, "LNK_CONN: Terminated\n");
512 conn = state->any.conn;
513 assert(conn);
7dc0f844
MD
514
515 /*
1a34728c
MD
516 * Clean out the media structure. If refs drops to zero we
517 * also clean out the media config threads. These threads
518 * maintain span connections to other hammer2 service daemons.
519 */
520 media = conn->media;
521 if (--media->refs == 0) {
522 fprintf(stderr, "Shutting down media spans\n");
523 for (i = 0; i < HAMMER2_COPYID_COUNT; ++i) {
524 conf = &media->config[i];
525
526 if (conf->thread == NULL)
527 continue;
528 conf->ctl = H2CONFCTL_STOP;
529 pthread_cond_signal(&conf->cond);
530 }
531 for (i = 0; i < HAMMER2_COPYID_COUNT; ++i) {
532 conf = &media->config[i];
533
534 if (conf->thread == NULL)
535 continue;
536 pthread_mutex_unlock(&cluster_mtx);
537 pthread_join(conf->thread, NULL);
538 pthread_mutex_lock(&cluster_mtx);
539 conf->thread = NULL;
540 pthread_cond_destroy(&conf->cond);
541 }
542 fprintf(stderr, "Media shutdown complete\n");
543 TAILQ_REMOVE(&mediaq, media, entry);
544 hammer2_free(media);
545 }
546
547 /*
7dc0f844
MD
548 * Clean out all relays. This requires terminating each
549 * relay transaction.
550 */
8c280d5d 551 while ((relay = RB_ROOT(&conn->tree)) != NULL) {
7dc0f844 552 hammer2_relay_delete(relay);
8c280d5d
MD
553 }
554
555 /*
556 * Clean out conn
557 */
1a34728c 558 conn->media = NULL;
8c280d5d
MD
559 conn->state = NULL;
560 msg->state->any.conn = NULL;
561 TAILQ_REMOVE(&connq, conn, entry);
562 hammer2_free(conn);
563
29ead430 564 hammer2_msg_reply(msg, 0);
8c280d5d 565 /* state invalid after reply */
1a34728c
MD
566 break;
567 case HAMMER2_LNK_VOLCONF:
568 /*
569 * One-way volume-configuration message is transmitted
570 * over the open LNK_CONN transaction.
571 */
572 fprintf(stderr, "RECEIVED VOLCONF\n");
573 if (msg->any.lnk_volconf.index < 0 ||
574 msg->any.lnk_volconf.index >= HAMMER2_COPYID_COUNT) {
575 fprintf(stderr, "VOLCONF: ILLEGAL INDEX %d\n",
576 msg->any.lnk_volconf.index);
577 break;
578 }
579 if (msg->any.lnk_volconf.copy.path[sizeof(msg->any.lnk_volconf.copy.path) - 1] != 0 ||
580 msg->any.lnk_volconf.copy.path[0] == 0) {
581 fprintf(stderr, "VOLCONF: ILLEGAL PATH %d\n",
582 msg->any.lnk_volconf.index);
583 break;
584 }
585 conn = msg->state->any.conn;
586 if (conn == NULL) {
587 fprintf(stderr, "VOLCONF: LNK_CONN is missing\n");
588 break;
589 }
590 conf = &conn->media->config[msg->any.lnk_volconf.index];
591 conf->copy_pend = msg->any.lnk_volconf.copy;
592 conf->ctl |= H2CONFCTL_UPDATE;
593 if (conf->thread == NULL) {
594 fprintf(stderr, "VOLCONF THREAD STARTED\n");
595 pthread_cond_init(&conf->cond, NULL);
596 pthread_create(&conf->thread, NULL,
597 hammer2_volconf_thread, (void *)conf);
598 }
599 pthread_cond_signal(&conf->cond);
600 break;
601 default:
602 /*
603 * Failsafe
604 */
605 if (msg->any.head.cmd & HAMMER2_MSGF_DELETE)
606 goto deleteconn;
607 hammer2_msg_reply(msg, HAMMER2_MSG_ERR_NOSUPP);
608 break;
8c280d5d
MD
609 }
610 pthread_mutex_unlock(&cluster_mtx);
611}
612
613void
29ead430 614hammer2_lnk_span(hammer2_msg_t *msg)
8c280d5d 615{
29ead430 616 hammer2_state_t *state = msg->state;
8c280d5d
MD
617 h2span_cluster_t dummy_cls;
618 h2span_node_t dummy_node;
619 h2span_cluster_t *cls;
620 h2span_node_t *node;
621 h2span_link_t *slink;
622 h2span_relay_t *relay;
623 char *alloc = NULL;
624
29ead430
MD
625 assert((msg->any.head.cmd & HAMMER2_MSGF_REPLY) == 0);
626
8c280d5d
MD
627 pthread_mutex_lock(&cluster_mtx);
628
629 /*
630 * On transaction start we initialize the tracking infrastructure
631 */
632 if (msg->any.head.cmd & HAMMER2_MSGF_CREATE) {
29ead430 633 assert(state->func == NULL);
8c280d5d
MD
634 state->func = hammer2_lnk_span;
635
81666e1b
MD
636 msg->any.lnk_span.label[sizeof(msg->any.lnk_span.label)-1] = 0;
637
8c280d5d
MD
638 /*
639 * Find the cluster
640 */
641 dummy_cls.pfs_clid = msg->any.lnk_span.pfs_clid;
642 cls = RB_FIND(h2span_cluster_tree, &cluster_tree, &dummy_cls);
643 if (cls == NULL) {
644 cls = hammer2_alloc(sizeof(*cls));
645 cls->pfs_clid = msg->any.lnk_span.pfs_clid;
646 RB_INIT(&cls->tree);
647 RB_INSERT(h2span_cluster_tree, &cluster_tree, cls);
648 }
649
650 /*
651 * Find the node
652 */
653 dummy_node.pfs_fsid = msg->any.lnk_span.pfs_fsid;
654 node = RB_FIND(h2span_node_tree, &cls->tree, &dummy_node);
655 if (node == NULL) {
656 node = hammer2_alloc(sizeof(*node));
657 node->pfs_fsid = msg->any.lnk_span.pfs_fsid;
658 node->cls = cls;
659 RB_INIT(&node->tree);
660 RB_INSERT(h2span_node_tree, &cls->tree, node);
81666e1b
MD
661 snprintf(node->label, sizeof(node->label),
662 "%s", msg->any.lnk_span.label);
8c280d5d
MD
663 }
664
665 /*
666 * Create the link
667 */
668 assert(state->any.link == NULL);
669 slink = hammer2_alloc(sizeof(*slink));
7dc0f844 670 TAILQ_INIT(&slink->relayq);
8c280d5d 671 slink->node = node;
7dc0f844 672 slink->dist = msg->any.lnk_span.dist;
8c280d5d
MD
673 slink->state = state;
674 state->any.link = slink;
29ead430
MD
675
676 /*
677 * Embedded router structure in link for message forwarding.
90e8cd1d
MD
678 *
679 * The spanning id for the router is the message id of
680 * the SPAN link it is embedded in, allowing messages to
681 * be routed via &slink->router.
29ead430 682 */
90e8cd1d
MD
683 slink->router = hammer2_router_alloc();
684 slink->router->iocom = state->iocom;
685 slink->router->link = slink;
10c86c4e 686 slink->router->target = state->msgid;
90e8cd1d 687 hammer2_router_connect(slink->router);
29ead430 688
8c280d5d
MD
689 RB_INSERT(h2span_link_tree, &node->tree, slink);
690
29ead430
MD
691 fprintf(stderr, "LNK_SPAN(thr %p): %p %s/%s dist=%d\n",
692 msg->router->iocom,
693 slink,
694 hammer2_uuid_to_str(&msg->any.lnk_span.pfs_clid,
695 &alloc),
696 msg->any.lnk_span.label,
697 msg->any.lnk_span.dist);
698 free(alloc);
29ead430 699#if 0
02454b3e 700 hammer2_relay_scan(NULL, node);
29ead430
MD
701#endif
702 hammer2_router_signal(msg->router);
8c280d5d
MD
703 }
704
705 /*
706 * On transaction terminate we remove the tracking infrastructure.
707 */
708 if (msg->any.head.cmd & HAMMER2_MSGF_DELETE) {
709 slink = state->any.link;
710 assert(slink != NULL);
711 node = slink->node;
712 cls = node->cls;
713
29ead430
MD
714 fprintf(stderr, "LNK_DELE(thr %p): %p %s/%s dist=%d\n",
715 msg->router->iocom,
716 slink,
717 hammer2_uuid_to_str(&cls->pfs_clid, &alloc),
718 state->msg->any.lnk_span.label,
719 state->msg->any.lnk_span.dist);
720 free(alloc);
721
8c280d5d 722 /*
90e8cd1d
MD
723 * Remove the router from consideration
724 */
725 hammer2_router_disconnect(&slink->router);
726
727 /*
7dc0f844
MD
728 * Clean out all relays. This requires terminating each
729 * relay transaction.
8c280d5d
MD
730 */
731 while ((relay = TAILQ_FIRST(&slink->relayq)) != NULL) {
7dc0f844 732 hammer2_relay_delete(relay);
8c280d5d
MD
733 }
734
735 /*
736 * Clean out the topology
737 */
738 RB_REMOVE(h2span_link_tree, &node->tree, slink);
739 if (RB_EMPTY(&node->tree)) {
740 RB_REMOVE(h2span_node_tree, &cls->tree, node);
90e8cd1d 741 if (RB_EMPTY(&cls->tree) && cls->refs == 0) {
8c280d5d
MD
742 RB_REMOVE(h2span_cluster_tree,
743 &cluster_tree, cls);
744 hammer2_free(cls);
745 }
746 node->cls = NULL;
747 hammer2_free(node);
7dc0f844 748 node = NULL;
8c280d5d
MD
749 }
750 state->any.link = NULL;
751 slink->state = NULL;
752 slink->node = NULL;
753 hammer2_free(slink);
7dc0f844
MD
754
755 /*
756 * We have to terminate the transaction
757 */
758 hammer2_state_reply(state, 0);
759 /* state invalid after reply */
760
761 /*
762 * If the node still exists issue any required updates. If
763 * it doesn't then all related relays have already been
764 * removed and there's nothing left to do.
765 */
29ead430 766#if 0
7dc0f844 767 if (node)
02454b3e 768 hammer2_relay_scan(NULL, node);
29ead430
MD
769#endif
770 if (node)
771 hammer2_router_signal(msg->router);
8c280d5d
MD
772 }
773
774 pthread_mutex_unlock(&cluster_mtx);
775}
776
777/*
7dc0f844
MD
778 * Messages received on relay SPANs. These are open transactions so it is
779 * in fact possible for the other end to close the transaction.
780 *
781 * XXX MPRACE on state structure
782 */
783static void
29ead430 784hammer2_lnk_relay(hammer2_msg_t *msg)
7dc0f844 785{
29ead430 786 hammer2_state_t *state = msg->state;
7dc0f844
MD
787 h2span_relay_t *relay;
788
29ead430
MD
789 assert(msg->any.head.cmd & HAMMER2_MSGF_REPLY);
790
7dc0f844
MD
791 if (msg->any.head.cmd & HAMMER2_MSGF_DELETE) {
792 pthread_mutex_lock(&cluster_mtx);
793 if ((relay = state->any.relay) != NULL) {
794 hammer2_relay_delete(relay);
795 } else {
796 hammer2_state_reply(state, 0);
797 }
798 pthread_mutex_unlock(&cluster_mtx);
799 }
800}
801
802/*
803 * Update relay transactions for SPANs.
804 *
805 * Called with cluster_mtx held.
806 */
02454b3e
MD
807static void hammer2_relay_scan_specific(h2span_node_t *node,
808 h2span_connect_t *conn);
7dc0f844
MD
809
810static void
02454b3e 811hammer2_relay_scan(h2span_connect_t *conn, h2span_node_t *node)
7dc0f844
MD
812{
813 h2span_cluster_t *cls;
7dc0f844
MD
814
815 if (node) {
816 /*
817 * Iterate specific node
818 */
819 TAILQ_FOREACH(conn, &connq, entry)
02454b3e 820 hammer2_relay_scan_specific(node, conn);
7dc0f844
MD
821 } else {
822 /*
02454b3e 823 * Full iteration.
7dc0f844 824 *
02454b3e
MD
825 * Iterate cluster ids, nodes, and either a specific connection
826 * or all connections.
7dc0f844 827 */
7dc0f844
MD
828 RB_FOREACH(cls, h2span_cluster_tree, &cluster_tree) {
829 /*
830 * Iterate node ids
831 */
832 RB_FOREACH(node, h2span_node_tree, &cls->tree) {
833 /*
834 * Synchronize the node's link (received SPANs)
835 * with each connection's relays.
836 */
02454b3e
MD
837 if (conn) {
838 hammer2_relay_scan_specific(node, conn);
839 } else {
840 TAILQ_FOREACH(conn, &connq, entry) {
841 hammer2_relay_scan_specific(node,
842 conn);
843 }
844 assert(conn == NULL);
845 }
7dc0f844
MD
846 }
847 }
848 }
849}
850
851/*
852 * Update the relay'd SPANs for this (node, conn).
853 *
854 * Iterate links and adjust relays to match. We only propagate the top link
855 * for now (XXX we want to propagate the top two).
856 *
857 * The hammer2_relay_scan_cmp() function locates the first relay element
858 * for any given node. The relay elements will be sub-sorted by dist.
8c280d5d 859 */
7dc0f844
MD
860struct relay_scan_info {
861 h2span_node_t *node;
862 h2span_relay_t *relay;
863};
864
865static int
866hammer2_relay_scan_cmp(h2span_relay_t *relay, void *arg)
867{
868 struct relay_scan_info *info = arg;
869
870 if ((intptr_t)relay->link->node < (intptr_t)info->node)
871 return(-1);
872 if ((intptr_t)relay->link->node > (intptr_t)info->node)
873 return(1);
874 return(0);
875}
876
877static int
878hammer2_relay_scan_callback(h2span_relay_t *relay, void *arg)
879{
880 struct relay_scan_info *info = arg;
881
882 info->relay = relay;
883 return(-1);
884}
885
8c280d5d 886static void
02454b3e 887hammer2_relay_scan_specific(h2span_node_t *node, h2span_connect_t *conn)
8c280d5d 888{
7dc0f844
MD
889 struct relay_scan_info info;
890 h2span_relay_t *relay;
891 h2span_relay_t *next_relay;
892 h2span_link_t *slink;
893 int count = 2;
894
895 info.node = node;
896 info.relay = NULL;
897
898 /*
29ead430
MD
899 * Locate the first related relay for the node on this connection.
900 * relay will be NULL if there were none.
7dc0f844
MD
901 */
902 RB_SCAN(h2span_relay_tree, &conn->tree,
903 hammer2_relay_scan_cmp, hammer2_relay_scan_callback, &info);
904 relay = info.relay;
cf715800
MD
905 info.relay = NULL;
906 if (relay)
907 assert(relay->link->node == node);
7dc0f844 908
81666e1b
MD
909 if (DebugOpt > 8)
910 fprintf(stderr, "relay scan for connection %p\n", conn);
7dc0f844
MD
911
912 /*
913 * Iterate the node's links (received SPANs) in distance order,
914 * lowest (best) dist first.
915 */
29ead430 916 /* fprintf(stderr, "LOOP\n"); */
7dc0f844
MD
917 RB_FOREACH(slink, h2span_link_tree, &node->tree) {
918 /*
29ead430
MD
919 fprintf(stderr, "SLINK %p RELAY %p(%p)\n",
920 slink, relay, relay ? relay->link : NULL);
921 */
922 /*
cf715800 923 * PROPAGATE THE BEST LINKS OVER THE SPECIFIED CONNECTION.
7dc0f844 924 *
cf715800
MD
925 * Track relays while iterating the best links and construct
926 * missing relays when necessary.
7dc0f844
MD
927 *
928 * (If some prior better link was removed it would have also
929 * removed the relay, so the relay can only match exactly or
29ead430 930 * be worse).
7dc0f844 931 */
cf715800
MD
932 if (relay && relay->link == slink) {
933 /*
29ead430
MD
934 * Match, relay already in-place, get the next
935 * relay to match against the next slink.
cf715800
MD
936 */
937 relay = RB_NEXT(h2span_relay_tree, &conn->tree, relay);
938 if (--count == 0)
939 break;
940 } else if (slink->dist > HAMMER2_SPAN_MAXDIST) {
941 /*
942 * No match but span distance is too great,
943 * do not relay. This prevents endless closed
944 * loops with ever-incrementing distances when
945 * the seed span is lost in the graph.
29ead430
MD
946 *
947 * All later spans will also be too far away so
948 * we can break out of the loop.
cf715800 949 */
29ead430 950 break;
c1963fb2
MD
951 } else if (slink->state->iocom == conn->state->iocom) {
952 /*
953 * No match but we would transmit a LNK_SPAN
954 * out the same connection it came in on, which
955 * can be trivially optimized out.
956 */
957 break;
cf715800
MD
958 } else {
959 /*
960 * No match, distance is ok, construct a new relay.
29ead430 961 * (slink is better than relay).
cf715800 962 */
7dc0f844
MD
963 hammer2_msg_t *msg;
964
965 assert(relay == NULL ||
29ead430
MD
966 relay->link->node != slink->node ||
967 relay->link->dist >= slink->dist);
7dc0f844
MD
968 relay = hammer2_alloc(sizeof(*relay));
969 relay->conn = conn;
970 relay->link = slink;
971
90e8cd1d 972 msg = hammer2_msg_alloc(conn->state->iocom->router, 0,
29ead430
MD
973 HAMMER2_LNK_SPAN |
974 HAMMER2_MSGF_CREATE,
975 hammer2_lnk_relay, relay);
976 relay->state = msg->state;
90e8cd1d
MD
977 relay->router = hammer2_router_alloc();
978 relay->router->iocom = relay->state->iocom;
979 relay->router->relay = relay;
10c86c4e 980 relay->router->target = relay->state->msgid;
90e8cd1d 981
29ead430
MD
982 msg->any.lnk_span = slink->state->msg->any.lnk_span;
983 msg->any.lnk_span.dist = slink->dist + 1;
984
90e8cd1d
MD
985 hammer2_router_connect(relay->router);
986
cf715800
MD
987 RB_INSERT(h2span_relay_tree, &conn->tree, relay);
988 TAILQ_INSERT_TAIL(&slink->relayq, relay, entry);
989
29ead430 990 hammer2_msg_write(msg);
7dc0f844 991
81666e1b 992 fprintf(stderr,
29ead430 993 "RELAY SPAN %p RELAY %p ON CLS=%p NODE=%p DIST=%d "
cf715800 994 "FD %d state %p\n",
29ead430
MD
995 slink,
996 relay,
cf715800 997 node->cls, node, slink->dist,
7dc0f844
MD
998 conn->state->iocom->sock_fd, relay->state);
999
cf715800
MD
1000 /*
1001 * Match (created new relay), get the next relay to
1002 * match against the next slink.
1003 */
1004 relay = RB_NEXT(h2span_relay_tree, &conn->tree, relay);
1005 if (--count == 0)
1006 break;
7dc0f844
MD
1007 }
1008 }
1009
1010 /*
1011 * Any remaining relay's belonging to this connection which match
1012 * the node are in excess of the current aggregate spanning state
1013 * and should be removed.
1014 */
1015 while (relay && relay->link->node == node) {
1016 next_relay = RB_NEXT(h2span_relay_tree, &conn->tree, relay);
1017 hammer2_relay_delete(relay);
1018 relay = next_relay;
1019 }
1020}
1021
1022static
1023void
1024hammer2_relay_delete(h2span_relay_t *relay)
1025{
81666e1b 1026 fprintf(stderr,
29ead430
MD
1027 "RELAY DELETE %p RELAY %p ON CLS=%p NODE=%p DIST=%d FD %d STATE %p\n",
1028 relay->link,
1029 relay,
7dc0f844 1030 relay->link->node->cls, relay->link->node,
cf715800 1031 relay->link->dist,
7dc0f844 1032 relay->conn->state->iocom->sock_fd, relay->state);
7dc0f844 1033
90e8cd1d
MD
1034 hammer2_router_disconnect(&relay->router);
1035
7dc0f844
MD
1036 RB_REMOVE(h2span_relay_tree, &relay->conn->tree, relay);
1037 TAILQ_REMOVE(&relay->link->relayq, relay, entry);
1038
1039 if (relay->state) {
1040 relay->state->any.relay = NULL;
1041 hammer2_state_reply(relay->state, 0);
1042 /* state invalid after reply */
1043 relay->state = NULL;
1044 }
1045 relay->conn = NULL;
1046 relay->link = NULL;
1047 hammer2_free(relay);
8c280d5d 1048}
81666e1b 1049
1a34728c
MD
1050static void *
1051hammer2_volconf_thread(void *info)
1052{
1053 h2span_media_config_t *conf = info;
1054
1055 pthread_mutex_lock(&cluster_mtx);
1056 while ((conf->ctl & H2CONFCTL_STOP) == 0) {
1057 if (conf->ctl & H2CONFCTL_UPDATE) {
1058 fprintf(stderr, "VOLCONF UPDATE\n");
1059 conf->ctl &= ~H2CONFCTL_UPDATE;
1060 if (bcmp(&conf->copy_run, &conf->copy_pend,
1061 sizeof(conf->copy_run)) == 0) {
1062 fprintf(stderr, "VOLCONF: no changes\n");
1063 continue;
1064 }
1065 /*
1066 * XXX TODO - auto reconnect on lookup failure or
1067 * connect failure or stream failure.
1068 */
1069
1070 pthread_mutex_unlock(&cluster_mtx);
1071 hammer2_volconf_stop(conf);
1072 conf->copy_run = conf->copy_pend;
1073 if (conf->copy_run.copyid != 0 &&
1074 strncmp(conf->copy_run.path, "span:", 5) == 0) {
1075 hammer2_volconf_start(conf,
1076 conf->copy_run.path + 5);
1077 }
1078 pthread_mutex_lock(&cluster_mtx);
1079 fprintf(stderr, "VOLCONF UPDATE DONE state %d\n", conf->state);
1080 }
1081 if (conf->state == H2MC_CONNECT) {
1082 hammer2_volconf_start(conf, conf->copy_run.path + 5);
1083 pthread_mutex_unlock(&cluster_mtx);
1084 sleep(5);
1085 pthread_mutex_lock(&cluster_mtx);
1086 } else {
1087 pthread_cond_wait(&conf->cond, &cluster_mtx);
1088 }
1089 }
1090 pthread_mutex_unlock(&cluster_mtx);
1091 hammer2_volconf_stop(conf);
1092 return(NULL);
1093}
1094
1095static
1096void
1097hammer2_volconf_stop(h2span_media_config_t *conf)
1098{
1099 switch(conf->state) {
1100 case H2MC_STOPPED:
1101 break;
1102 case H2MC_CONNECT:
1103 conf->state = H2MC_STOPPED;
1104 break;
1105 case H2MC_RUNNING:
1106 shutdown(conf->fd, SHUT_WR);
1107 pthread_join(conf->iocom_thread, NULL);
1108 conf->iocom_thread = NULL;
1109 break;
1110 }
1111}
1112
1113static
1114void
1115hammer2_volconf_start(h2span_media_config_t *conf, const char *hostname)
1116{
1117 switch(conf->state) {
1118 case H2MC_STOPPED:
1119 case H2MC_CONNECT:
1120 conf->fd = hammer2_connect(hostname);
1121 if (conf->fd < 0) {
1122 fprintf(stderr, "Unable to connect to %s\n", hostname);
1123 conf->state = H2MC_CONNECT;
1124 } else {
1125 pthread_create(&conf->iocom_thread, NULL,
1126 master_service,
1127 (void *)(intptr_t)conf->fd);
1128 conf->state = H2MC_RUNNING;
1129 }
1130 break;
1131 case H2MC_RUNNING:
1132 break;
1133 }
1134}
1135
29ead430 1136/************************************************************************
90e8cd1d 1137 * ROUTER AND MESSAGING HANDLES *
29ead430
MD
1138 ************************************************************************
1139 *
90e8cd1d
MD
1140 * Basically the idea here is to provide a stable data structure which
1141 * can be localized to the caller for higher level protocols to work with.
1142 * Depends on the context, these hammer2_handle's can be pooled by use-case
1143 * and remain persistent through a client (or mount point's) life.
1144 */
1145
1146#if 0
1147/*
1148 * Obtain a stable handle on a cluster given its uuid. This ties directly
1149 * into the global cluster topology, creating the structure if necessary
1150 * (even if the uuid does not exist or does not exist yet), and preventing
1151 * the structure from getting ripped out from under us while we hold a
1152 * pointer to it.
1153 */
1154h2span_cluster_t *
1155hammer2_cluster_get(uuid_t *pfs_clid)
1156{
1157 h2span_cluster_t dummy_cls;
1158 h2span_cluster_t *cls;
1159
1160 dummy_cls.pfs_clid = *pfs_clid;
1161 pthread_mutex_lock(&cluster_mtx);
1162 cls = RB_FIND(h2span_cluster_tree, &cluster_tree, &dummy_cls);
1163 if (cls)
1164 ++cls->refs;
1165 pthread_mutex_unlock(&cluster_mtx);
1166 return (cls);
1167}
1168
1169void
1170hammer2_cluster_put(h2span_cluster_t *cls)
1171{
1172 pthread_mutex_lock(&cluster_mtx);
1173 assert(cls->refs > 0);
1174 --cls->refs;
1175 if (RB_EMPTY(&cls->tree) && cls->refs == 0) {
1176 RB_REMOVE(h2span_cluster_tree,
1177 &cluster_tree, cls);
1178 hammer2_free(cls);
1179 }
1180 pthread_mutex_unlock(&cluster_mtx);
1181}
1182
1183/*
1184 * Obtain a stable handle to a specific cluster node given its uuid.
1185 * This handle does NOT lock in the route to the node and is typically
1186 * used as part of the hammer2_handle_*() API to obtain a set of
1187 * stable nodes.
29ead430 1188 */
90e8cd1d
MD
1189h2span_node_t *
1190hammer2_node_get(h2span_cluster_t *cls, uuid_t *pfs_fsid)
1191{
1192}
1193
1194#endif
29ead430
MD
1195
1196#if 0
1197/*
1198 * Acquire a persistent router structure given the cluster and node ids.
1199 * Messages can be transacted via this structure while held. If the route
1200 * is lost messages will return failure.
1201 */
1202hammer2_router_t *
1203hammer2_router_get(uuid_t *pfs_clid, uuid_t *pfs_fsid)
1204{
1205}
1206
1207/*
1208 * Release previously acquired router.
1209 */
1210void
1211hammer2_router_put(hammer2_router_t *router)
1212{
1213}
1214#endif
1215
90e8cd1d
MD
1216/************************************************************************
1217 * DEBUGGER *
1218 ************************************************************************/
81666e1b
MD
1219/*
1220 * Dumps the spanning tree
1221 */
1222void
29ead430 1223shell_tree(hammer2_router_t *router, char *cmdbuf __unused)
81666e1b
MD
1224{
1225 h2span_cluster_t *cls;
1226 h2span_node_t *node;
1227 h2span_link_t *slink;
1228 char *uustr = NULL;
1229
1230 pthread_mutex_lock(&cluster_mtx);
1231 RB_FOREACH(cls, h2span_cluster_tree, &cluster_tree) {
29ead430 1232 router_printf(router, "Cluster %s\n",
81666e1b
MD
1233 hammer2_uuid_to_str(&cls->pfs_clid, &uustr));
1234 RB_FOREACH(node, h2span_node_tree, &cls->tree) {
29ead430 1235 router_printf(router, " Node %s (%s)\n",
81666e1b
MD
1236 hammer2_uuid_to_str(&node->pfs_fsid, &uustr),
1237 node->label);
1238 RB_FOREACH(slink, h2span_link_tree, &node->tree) {
29ead430 1239 router_printf(router, "\tLink dist=%d via %d\n",
81666e1b
MD
1240 slink->dist,
1241 slink->state->iocom->sock_fd);
1242 }
1243 }
1244 }
1245 pthread_mutex_unlock(&cluster_mtx);
1246 if (uustr)
1247 free(uustr);
1248#if 0
1249 TAILQ_FOREACH(conn, &connq, entry) {
1250 }
1251#endif
1252}