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.
38 #include <trust_router/tr_name.h>
39 #include <trp_internal.h>
41 #include <trp_ptable.h>
44 static int trp_peer_destructor(void *object)
46 TRP_PEER *peer=talloc_get_type_abort(object, TRP_PEER);
47 if (peer->label!=NULL)
48 tr_free_name(peer->label);
49 if (peer->servicename!=NULL)
50 tr_free_name(peer->servicename);
53 TRP_PEER *trp_peer_new(TALLOC_CTX *memctx)
55 TRP_PEER *peer=talloc(memctx, TRP_PEER);
60 peer->servicename=NULL;
63 peer->linkcost=TRP_LINKCOST_DEFAULT;
64 peer->last_conn_attempt=(struct timespec){0,0};
65 peer->outgoing_status=PEER_DISCONNECTED;
66 peer->incoming_status=PEER_DISCONNECTED;
67 peer->conn_status_cb=NULL;
68 peer->conn_status_cookie=NULL;
70 talloc_set_destructor((void *)peer, trp_peer_destructor);
75 void trp_peer_free(TRP_PEER *peer)
80 static TRP_PEER *trp_peer_tail(TRP_PEER *peer)
82 while (peer->next!=NULL) {
89 /* Get a name that identifies this peer for display to the user, etc.
90 * Do not modify or free the label. */
91 TR_NAME *trp_peer_get_label(TRP_PEER *peer)
95 if (peer->label==NULL) {
96 s=talloc_asprintf(NULL, "%s:%u", peer->server, peer->port);
98 peer->label=tr_new_name(s);
105 /* Get a name that identifies this peer for display to the user, etc.
106 * Makes a copy, caller is responsible for freeing. */
107 TR_NAME *trp_peer_dup_label(TRP_PEER *peer)
109 return tr_dup_name(trp_peer_get_label(peer));;
112 char *trp_peer_get_server(TRP_PEER *peer)
117 static void trp_peer_set_servicename(TRP_PEER *peer, const char *server)
120 if (peer->servicename !=NULL)
121 tr_free_name(peer->servicename);
124 name=talloc_asprintf(NULL, "trustrouter/%s", server);
127 peer->servicename=tr_new_name(name);
130 peer->servicename=NULL;
134 /* copies input; on error, peer->servicename will be null */
135 void trp_peer_set_server(TRP_PEER *peer, const char *server)
137 peer->server=talloc_strdup(peer, server); /* will be null on error */
138 trp_peer_set_servicename(peer, server);
141 void trp_peer_add_gss_name(TRP_PEER *peer, TR_NAME *gss_name)
143 if (peer->gss_names==NULL)
144 trp_peer_set_gss_names(peer, tr_gss_names_new(peer));
145 tr_gss_names_add(peer->gss_names, gss_name);
148 void trp_peer_set_gss_names(TRP_PEER *peer, TR_GSS_NAMES *gss_names)
150 if (peer->gss_names!=NULL)
151 tr_gss_names_free(peer->gss_names);
153 peer->gss_names=gss_names;
154 talloc_steal(peer, gss_names);
157 /* get the peer gss_names, caller must not free the result */
158 TR_GSS_NAMES *trp_peer_get_gss_names(TRP_PEER *peer)
160 return peer->gss_names;
163 /* get the service name (i.e., gssname we see when we connect to this peer) */
164 TR_NAME *trp_peer_get_servicename(TRP_PEER *peer)
166 return peer->servicename;
169 /* get a copy of the servicename, caller must free via tr_free_name */
170 TR_NAME *trp_peer_dup_servicename(TRP_PEER *peer)
172 return tr_dup_name(peer->servicename);
175 unsigned int trp_peer_get_port(TRP_PEER *peer)
180 void trp_peer_set_port(TRP_PEER *peer, unsigned int port)
185 unsigned int trp_peer_get_linkcost(TRP_PEER *peer)
188 return peer->linkcost;
193 void trp_peer_set_linkcost(TRP_PEER *peer, unsigned int linkcost)
195 if ((linkcost>TRP_METRIC_INFINITY) && (linkcost!=TRP_METRIC_INVALID)) {
196 /* This indicates a programming error, but probably means an already infinite metric
197 * was (incorrectly) incremented. Issue a warning and proceed with an infinite metric. */
198 tr_warning("trp_peer_set_linkcost: link cost > infinity encountered, setting to infinity");
199 linkcost=TRP_METRIC_INFINITY;
201 peer->linkcost=linkcost;
204 void trp_peer_set_conn_status_cb(TRP_PEER *peer, void (*cb)(TRP_PEER *, void *), void *cookie)
206 peer->conn_status_cb=cb;
207 peer->conn_status_cookie=cookie;
211 * Set the filter associated with this peer. Any existing filter will be freed. Takes responsibility for
212 * freeing the new filter.
214 * @param peer Peer to modify
215 * @param filt New filter to attach to the peer
217 void trp_peer_set_filter(TRP_PEER *peer, TR_FILTER *filt)
219 if (peer->filter!=NULL)
220 tr_filter_free(peer->filter);
223 talloc_steal(peer, filt);
226 TR_FILTER *trp_peer_get_filter(TRP_PEER *peer)
231 struct timespec *trp_peer_get_last_conn_attempt(TRP_PEER *peer)
233 return &(peer->last_conn_attempt);
236 void trp_peer_set_last_conn_attempt(TRP_PEER *peer, struct timespec *time)
238 peer->last_conn_attempt=*time;
241 TRP_PTABLE *trp_ptable_new(TALLOC_CTX *memctx)
243 TRP_PTABLE *ptbl=talloc(memctx, TRP_PTABLE);
250 void trp_peer_set_outgoing_status(TRP_PEER *peer, TRP_PEER_CONN_STATUS status)
252 TR_NAME *peer_label=trp_peer_get_label(peer);
253 int was_connected=trp_peer_is_connected(peer);
254 peer->outgoing_status=status;
255 tr_debug("trp_peer_set_outgoing_status: %s: status=%d peer connected was %d now %d.",
256 peer_label->buf, status, was_connected, trp_peer_is_connected(peer));
257 if ((trp_peer_is_connected(peer) != was_connected) && (peer->conn_status_cb!=NULL))
258 peer->conn_status_cb(peer, peer->conn_status_cookie);
261 TRP_PEER_CONN_STATUS trp_peer_get_outgoing_status(TRP_PEER *peer)
263 return peer->outgoing_status;
266 void trp_peer_set_incoming_status(TRP_PEER *peer, TRP_PEER_CONN_STATUS status)
268 TR_NAME *peer_label=trp_peer_get_label(peer);
269 int was_connected=trp_peer_is_connected(peer);
270 peer->incoming_status=status;
271 tr_debug("trp_peer_set_incoming_status: %s: status=%d peer connected was %d now %d.",
272 peer_label->buf, status, was_connected, trp_peer_is_connected(peer));
273 if ((trp_peer_is_connected(peer) != was_connected) && (peer->conn_status_cb!=NULL))
274 peer->conn_status_cb(peer, peer->conn_status_cookie);
277 TRP_PEER_CONN_STATUS trp_peer_get_incoming_status(TRP_PEER *peer)
279 return peer->incoming_status;
282 int trp_peer_is_connected(TRP_PEER *peer)
284 return (peer->outgoing_status==PEER_CONNECTED) && (peer->incoming_status==PEER_CONNECTED);
287 void trp_ptable_free(TRP_PTABLE *ptbl)
292 TRP_RC trp_ptable_add(TRP_PTABLE *ptbl, TRP_PEER *newpeer)
294 if (ptbl->head==NULL)
297 trp_peer_tail(ptbl->head)->next=newpeer;
299 talloc_steal(ptbl, newpeer);
303 /* peer pointer is invalid after successful removal. Does nothing and returns
304 * TRP_ERROR if peer is not in the list. */
305 TRP_RC trp_ptable_remove(TRP_PTABLE *ptbl, TRP_PEER *peer)
309 if (ptbl->head!=NULL) {
310 if (ptbl->head==peer) {
311 /* special case for removing head of list */
313 ptbl->head=ptbl->head->next; /* advance the head */
316 for (cur=ptbl->head->next; cur!=NULL; last=cur,cur=cur->next) {
319 last->next=cur->next;
328 TRP_PEER *trp_ptable_find_gss_name(TRP_PTABLE *ptbl, TR_NAME *gssname)
330 TRP_PEER *cur=ptbl->head;
331 while ((cur!=NULL) && (!tr_gss_names_matches(trp_peer_get_gss_names(cur), gssname)))
336 TRP_PEER *trp_ptable_find_servicename(TRP_PTABLE *ptbl, TR_NAME *servicename)
338 TRP_PEER *cur=ptbl->head;
339 while ((cur!=NULL) && (0 != tr_name_cmp(trp_peer_get_servicename(cur), servicename)))
344 char *trp_peer_to_str(TALLOC_CTX *memctx, TRP_PEER *peer, const char *sep)
348 return talloc_asprintf(memctx,
350 peer->server, peer->port, sep,
354 /* this is horribly inefficient but should be ok for small peer tables */
355 char *trp_ptable_to_str(TALLOC_CTX *memctx, TRP_PTABLE *ptbl, const char *sep, const char *lineterm)
357 TALLOC_CTX *tmpctx=talloc_new(NULL);
359 char *result=talloc_strdup(tmpctx, "");
364 /* this leaves intermediate result strings in the tmpctx context, we'll free these when
366 for (peer=ptbl->head; peer!=NULL; peer=peer->next)
367 result=talloc_asprintf(tmpctx, "%s%s%s", result, lineterm, trp_peer_to_str(tmpctx, peer, sep));
369 talloc_steal(memctx, result); /* hand result over to caller */
370 talloc_free(tmpctx); /* free detritus */
374 TRP_PTABLE_ITER *trp_ptable_iter_new(TALLOC_CTX *mem_ctx)
376 TRP_PTABLE_ITER *iter=talloc(mem_ctx, TRP_PTABLE_ITER);
381 TRP_PEER *trp_ptable_iter_first(TRP_PTABLE_ITER *iter, TRP_PTABLE *ptbl)
390 TRP_PEER *trp_ptable_iter_next(TRP_PTABLE_ITER *iter)
397 void trp_ptable_iter_free(TRP_PTABLE_ITER *iter)