3 #include <trust_router/tr_name.h>
4 #include <trp_internal.h>
5 #include <trp_ptable.h>
8 TRP_PEER *trp_peer_new(TALLOC_CTX *memctx)
10 TRP_PEER *peer=talloc(memctx, TRP_PEER);
14 peer->linkcost=TRP_METRIC_INFINITY;
20 void trp_peer_free(TRP_PEER *peer)
25 static TRP_PEER *trp_peer_tail(TRP_PEER *peer)
27 while (peer->next!=NULL) {
33 char *trp_peer_get_server(TRP_PEER *peer)
38 /* copies input; on error, peer->gssname will be null */
39 void trp_peer_set_server(TRP_PEER *peer, char *server)
41 peer->server=talloc_strdup(peer, server); /* will be null on error */
44 /* get the peer name based on the server name; caller is responsible for freeing the TR_NAME */
45 TR_NAME *trp_peer_get_gssname(TRP_PEER *peer)
47 TR_NAME *gssname=NULL;
50 if (0<asprintf(&s, "trustrouter@%s", peer->server)) {
51 if (tr_new_name(s)!=NULL) {
52 gssname=tr_new_name(s);
59 unsigned int trp_peer_get_port(TRP_PEER *peer)
64 void trp_peer_set_port(TRP_PEER *peer, unsigned int port)
69 unsigned int trp_peer_get_linkcost(TRP_PEER *peer)
71 return peer->linkcost;
74 void trp_peer_set_linkcost(TRP_PEER *peer, unsigned int linkcost)
76 if ((linkcost>TRP_METRIC_INFINITY) && (linkcost!=TRP_METRIC_INVALID)) {
77 /* This indicates a programming error, but probably means an already infinite metric
78 * was (incorrectly) incremented. Issue a warning and proceed with an infinite metric. */
79 tr_warning("trp_peer_set_linkcost: link cost > infinity encountered, setting to infinity");
80 linkcost=TRP_METRIC_INFINITY;
82 peer->linkcost=linkcost;
85 TRP_PTABLE *trp_ptable_new(TALLOC_CTX *memctx)
87 TRP_PTABLE *ptbl=talloc(memctx, TRP_PTABLE);
94 void trp_ptable_free(TRP_PTABLE *ptbl)
99 TRP_RC trp_ptable_add(TRP_PTABLE *ptbl, TRP_PEER *newpeer)
101 if (ptbl->head==NULL) {
104 trp_peer_tail(ptbl->head)->next=newpeer;
105 talloc_steal(ptbl, newpeer);
110 /* peer pointer is invalid after successful removal. Does nothing and returns
111 * TRP_ERROR if peer is not in the list. */
112 TRP_RC trp_ptable_remove(TRP_PTABLE *ptbl, TRP_PEER *peer)
116 if (ptbl->head!=NULL) {
117 if (ptbl->head==peer) {
118 /* special case for removing head of list */
120 ptbl->head=ptbl->head->next; /* advance the head */
123 for (cur=ptbl->head->next; cur!=NULL; last=cur,cur=cur->next) {
126 last->next=cur->next;
135 TRP_PEER *trp_ptable_find(TRP_PTABLE *ptbl, TR_NAME *gssname)
137 TRP_PEER *cur=ptbl->head;
138 while ((cur!=NULL) && (0 != tr_name_cmp(trp_peer_get_gssname(cur), gssname)))
143 char *trp_peer_to_str(TALLOC_CTX *memctx, TRP_PEER *peer, const char *sep)
147 return talloc_asprintf(memctx,
149 peer->server, peer->port, sep,
153 /* this is horribly inefficient but should be ok for small peer tables */
154 char *trp_ptable_to_str(TALLOC_CTX *memctx, TRP_PTABLE *ptbl, const char *sep, const char *lineterm)
156 TALLOC_CTX *tmpctx=talloc_new(NULL);
158 char *result=talloc_strdup(tmpctx, "");
163 /* this leaves intermediate result strings in the tmpctx context, we'll free these when
165 for (peer=ptbl->head; peer!=NULL; peer=peer->next)
166 result=talloc_asprintf(tmpctx, "%s%s%s", result, lineterm, trp_peer_to_str(tmpctx, peer, sep));
168 talloc_steal(memctx, result); /* hand result over to caller */
169 talloc_free(tmpctx); /* free detritus */
173 TRP_PTABLE_ITER *trp_ptable_iter_new(TALLOC_CTX *mem_ctx)
175 TRP_PTABLE_ITER *iter=talloc(mem_ctx, TRP_PTABLE_ITER);
180 TRP_PEER *trp_ptable_iter_first(TRP_PTABLE_ITER *iter, TRP_PTABLE *ptbl)
186 TRP_PEER *trp_ptable_iter_next(TRP_PTABLE_ITER *iter)
188 if ((*iter)->next!=NULL)
193 void trp_ptable_iter_free(TRP_PTABLE_ITER *iter)