4 #include <trust_router/tr_name.h>
5 #include <trp_internal.h>
7 #include <trp_ptable.h>
10 static int trp_peer_destructor(void *object)
12 TRP_PEER *peer=talloc_get_type_abort(object, TRP_PEER);
13 if (peer->servicename!=NULL)
14 tr_free_name(peer->servicename);
17 TRP_PEER *trp_peer_new(TALLOC_CTX *memctx)
19 TRP_PEER *peer=talloc(memctx, TRP_PEER);
23 peer->servicename=NULL;
26 peer->linkcost=TRP_LINKCOST_DEFAULT;
27 peer->last_conn_attempt=(struct timespec){0,0};
28 peer->outgoing_status=PEER_DISCONNECTED;
29 peer->incoming_status=PEER_DISCONNECTED;
30 peer->conn_status_cb=NULL;
31 peer->conn_status_cookie=NULL;
32 talloc_set_destructor((void *)peer, trp_peer_destructor);
37 void trp_peer_free(TRP_PEER *peer)
42 static TRP_PEER *trp_peer_tail(TRP_PEER *peer)
44 while (peer->next!=NULL) {
51 /* Get a name that identifies this peer for display to the user, etc.
52 * Do not modify or free the label. */
53 TR_NAME *trp_peer_get_label(TRP_PEER *peer)
55 TR_GSS_NAMES_ITER *iter=tr_gss_names_iter_new(NULL);
58 /* for now, use the first gss name */
60 name=tr_gss_names_iter_first(iter, peer->gss_names);
66 /* Get a name that identifies this peer for display to the user, etc.
67 * Makes a copy, caller is responsible for freeing. */
68 TR_NAME *trp_peer_dup_label(TRP_PEER *peer)
70 return tr_dup_name(trp_peer_get_label(peer));;
73 char *trp_peer_get_server(TRP_PEER *peer)
78 static void trp_peer_set_servicename(TRP_PEER *peer, const char *server)
81 if (peer->servicename !=NULL)
82 tr_free_name(peer->servicename);
85 name=talloc_asprintf(NULL, "trustrouter/%s", server);
88 peer->servicename=tr_new_name(name);
91 peer->servicename=NULL;
95 /* copies input; on error, peer->servicename will be null */
96 void trp_peer_set_server(TRP_PEER *peer, const char *server)
98 peer->server=talloc_strdup(peer, server); /* will be null on error */
99 trp_peer_set_servicename(peer, server);
102 void trp_peer_add_gss_name(TRP_PEER *peer, TR_NAME *gss_name)
104 if (peer->gss_names==NULL)
105 trp_peer_set_gss_names(peer, tr_gss_names_new(peer));
106 tr_gss_names_add(peer->gss_names, gss_name);
109 void trp_peer_set_gss_names(TRP_PEER *peer, TR_GSS_NAMES *gss_names)
111 if (peer->gss_names!=NULL)
112 talloc_free(peer->gss_names);
114 peer->gss_names=gss_names;
115 talloc_steal(peer, gss_names);
118 /* get the peer gss_names, caller must not free the result */
119 TR_GSS_NAMES *trp_peer_get_gss_names(TRP_PEER *peer)
121 return peer->gss_names;
124 /* get the service name (i.e., gssname we see when we connect to this peer) */
125 TR_NAME *trp_peer_get_servicename(TRP_PEER *peer)
127 return peer->servicename;
130 /* get a copy of the servicename, caller must free via tr_free_name */
131 TR_NAME *trp_peer_dup_servicename(TRP_PEER *peer)
133 return tr_dup_name(peer->servicename);
136 unsigned int trp_peer_get_port(TRP_PEER *peer)
141 void trp_peer_set_port(TRP_PEER *peer, unsigned int port)
146 unsigned int trp_peer_get_linkcost(TRP_PEER *peer)
149 return peer->linkcost;
154 void trp_peer_set_linkcost(TRP_PEER *peer, unsigned int linkcost)
156 if ((linkcost>TRP_METRIC_INFINITY) && (linkcost!=TRP_METRIC_INVALID)) {
157 /* This indicates a programming error, but probably means an already infinite metric
158 * was (incorrectly) incremented. Issue a warning and proceed with an infinite metric. */
159 tr_warning("trp_peer_set_linkcost: link cost > infinity encountered, setting to infinity");
160 linkcost=TRP_METRIC_INFINITY;
162 peer->linkcost=linkcost;
165 void trp_peer_set_conn_status_cb(TRP_PEER *peer, void (*cb)(TRP_PEER *, void *), void *cookie)
167 peer->conn_status_cb=cb;
168 peer->conn_status_cookie=cookie;
171 struct timespec *trp_peer_get_last_conn_attempt(TRP_PEER *peer)
173 return &(peer->last_conn_attempt);
176 void trp_peer_set_last_conn_attempt(TRP_PEER *peer, struct timespec *time)
178 peer->last_conn_attempt=*time;
181 TRP_PTABLE *trp_ptable_new(TALLOC_CTX *memctx)
183 TRP_PTABLE *ptbl=talloc(memctx, TRP_PTABLE);
190 void trp_peer_set_outgoing_status(TRP_PEER *peer, TRP_PEER_CONN_STATUS status)
192 TR_NAME *peer_label=trp_peer_get_label(peer);
193 int was_connected=trp_peer_is_connected(peer);
194 peer->outgoing_status=status;
195 tr_debug("trp_peer_set_outgoing_status: %s: status=%d peer connected was %d now %d.",
196 peer_label->buf, status, was_connected, trp_peer_is_connected(peer));
197 if ((trp_peer_is_connected(peer) != was_connected) && (peer->conn_status_cb!=NULL))
198 peer->conn_status_cb(peer, peer->conn_status_cookie);
201 TRP_PEER_CONN_STATUS trp_peer_get_outgoing_status(TRP_PEER *peer)
203 return peer->outgoing_status;
206 void trp_peer_set_incoming_status(TRP_PEER *peer, TRP_PEER_CONN_STATUS status)
208 TR_NAME *peer_label=trp_peer_get_label(peer);
209 int was_connected=trp_peer_is_connected(peer);
210 peer->incoming_status=status;
211 tr_debug("trp_peer_set_incoming_status: %s: status=%d peer connected was %d now %d.",
212 peer_label->buf, status, was_connected, trp_peer_is_connected(peer));
213 if ((trp_peer_is_connected(peer) != was_connected) && (peer->conn_status_cb!=NULL))
214 peer->conn_status_cb(peer, peer->conn_status_cookie);
217 TRP_PEER_CONN_STATUS trp_peer_get_incoming_status(TRP_PEER *peer)
219 return peer->incoming_status;
222 int trp_peer_is_connected(TRP_PEER *peer)
224 return (peer->outgoing_status==PEER_CONNECTED) && (peer->incoming_status==PEER_CONNECTED);
227 void trp_ptable_free(TRP_PTABLE *ptbl)
232 TRP_RC trp_ptable_add(TRP_PTABLE *ptbl, TRP_PEER *newpeer)
234 if (ptbl->head==NULL)
237 trp_peer_tail(ptbl->head)->next=newpeer;
239 talloc_steal(ptbl, newpeer);
243 /* peer pointer is invalid after successful removal. Does nothing and returns
244 * TRP_ERROR if peer is not in the list. */
245 TRP_RC trp_ptable_remove(TRP_PTABLE *ptbl, TRP_PEER *peer)
249 if (ptbl->head!=NULL) {
250 if (ptbl->head==peer) {
251 /* special case for removing head of list */
253 ptbl->head=ptbl->head->next; /* advance the head */
256 for (cur=ptbl->head->next; cur!=NULL; last=cur,cur=cur->next) {
259 last->next=cur->next;
268 TRP_PEER *trp_ptable_find_gss_name(TRP_PTABLE *ptbl, TR_NAME *gssname)
270 TRP_PEER *cur=ptbl->head;
271 while ((cur!=NULL) && (!tr_gss_names_matches(trp_peer_get_gss_names(cur), gssname)))
276 TRP_PEER *trp_ptable_find_servicename(TRP_PTABLE *ptbl, TR_NAME *servicename)
278 TRP_PEER *cur=ptbl->head;
279 while ((cur!=NULL) && (0 != tr_name_cmp(trp_peer_get_servicename(cur), servicename)))
284 char *trp_peer_to_str(TALLOC_CTX *memctx, TRP_PEER *peer, const char *sep)
288 return talloc_asprintf(memctx,
290 peer->server, peer->port, sep,
294 /* this is horribly inefficient but should be ok for small peer tables */
295 char *trp_ptable_to_str(TALLOC_CTX *memctx, TRP_PTABLE *ptbl, const char *sep, const char *lineterm)
297 TALLOC_CTX *tmpctx=talloc_new(NULL);
299 char *result=talloc_strdup(tmpctx, "");
304 /* this leaves intermediate result strings in the tmpctx context, we'll free these when
306 for (peer=ptbl->head; peer!=NULL; peer=peer->next)
307 result=talloc_asprintf(tmpctx, "%s%s%s", result, lineterm, trp_peer_to_str(tmpctx, peer, sep));
309 talloc_steal(memctx, result); /* hand result over to caller */
310 talloc_free(tmpctx); /* free detritus */
314 TRP_PTABLE_ITER *trp_ptable_iter_new(TALLOC_CTX *mem_ctx)
316 TRP_PTABLE_ITER *iter=talloc(mem_ctx, TRP_PTABLE_ITER);
321 TRP_PEER *trp_ptable_iter_first(TRP_PTABLE_ITER *iter, TRP_PTABLE *ptbl)
330 TRP_PEER *trp_ptable_iter_next(TRP_PTABLE_ITER *iter)
337 void trp_ptable_iter_free(TRP_PTABLE_ITER *iter)