4 #include <trust_router/tr_name.h>
5 #include <trp_internal.h>
6 #include <trp_ptable.h>
9 TRP_PEER *trp_peer_new(TALLOC_CTX *memctx)
11 TRP_PEER *peer=talloc(memctx, TRP_PEER);
16 peer->linkcost=TRP_METRIC_INFINITY;
17 peer->last_conn_attempt=(struct timespec){0,0};
22 void trp_peer_free(TRP_PEER *peer)
27 static TRP_PEER *trp_peer_tail(TRP_PEER *peer)
29 while (peer->next!=NULL) {
35 char *trp_peer_get_server(TRP_PEER *peer)
40 /* copies input; on error, peer->gssname will be null */
41 void trp_peer_set_server(TRP_PEER *peer, char *server)
43 peer->server=talloc_strdup(peer, server); /* will be null on error */
46 /* get the peer name based on the server name; caller is responsible for freeing the TR_NAME */
47 TR_NAME *trp_peer_get_gssname(TRP_PEER *peer)
49 TR_NAME *gssname=NULL;
52 if (0<asprintf(&s, "trustrouter@%s", peer->server)) {
53 if (tr_new_name(s)!=NULL) {
54 gssname=tr_new_name(s);
61 unsigned int trp_peer_get_port(TRP_PEER *peer)
66 void trp_peer_set_port(TRP_PEER *peer, unsigned int port)
71 unsigned int trp_peer_get_linkcost(TRP_PEER *peer)
74 return peer->linkcost;
79 void trp_peer_set_linkcost(TRP_PEER *peer, unsigned int linkcost)
81 if ((linkcost>TRP_METRIC_INFINITY) && (linkcost!=TRP_METRIC_INVALID)) {
82 /* This indicates a programming error, but probably means an already infinite metric
83 * was (incorrectly) incremented. Issue a warning and proceed with an infinite metric. */
84 tr_warning("trp_peer_set_linkcost: link cost > infinity encountered, setting to infinity");
85 linkcost=TRP_METRIC_INFINITY;
87 peer->linkcost=linkcost;
90 struct timespec *trp_peer_get_last_conn_attempt(TRP_PEER *peer)
92 return &(peer->last_conn_attempt);
95 void trp_peer_set_last_conn_attempt(TRP_PEER *peer, struct timespec *time)
97 peer->last_conn_attempt=*time;
100 TRP_PTABLE *trp_ptable_new(TALLOC_CTX *memctx)
102 TRP_PTABLE *ptbl=talloc(memctx, TRP_PTABLE);
109 void trp_ptable_free(TRP_PTABLE *ptbl)
114 TRP_RC trp_ptable_add(TRP_PTABLE *ptbl, TRP_PEER *newpeer)
116 if (ptbl->head==NULL) {
119 trp_peer_tail(ptbl->head)->next=newpeer;
120 talloc_steal(ptbl, newpeer);
125 /* peer pointer is invalid after successful removal. Does nothing and returns
126 * TRP_ERROR if peer is not in the list. */
127 TRP_RC trp_ptable_remove(TRP_PTABLE *ptbl, TRP_PEER *peer)
131 if (ptbl->head!=NULL) {
132 if (ptbl->head==peer) {
133 /* special case for removing head of list */
135 ptbl->head=ptbl->head->next; /* advance the head */
138 for (cur=ptbl->head->next; cur!=NULL; last=cur,cur=cur->next) {
141 last->next=cur->next;
150 TRP_PEER *trp_ptable_find(TRP_PTABLE *ptbl, TR_NAME *gssname)
152 TRP_PEER *cur=ptbl->head;
153 while ((cur!=NULL) && (0 != tr_name_cmp(trp_peer_get_gssname(cur), gssname)))
158 char *trp_peer_to_str(TALLOC_CTX *memctx, TRP_PEER *peer, const char *sep)
162 return talloc_asprintf(memctx,
164 peer->server, peer->port, sep,
168 /* this is horribly inefficient but should be ok for small peer tables */
169 char *trp_ptable_to_str(TALLOC_CTX *memctx, TRP_PTABLE *ptbl, const char *sep, const char *lineterm)
171 TALLOC_CTX *tmpctx=talloc_new(NULL);
173 char *result=talloc_strdup(tmpctx, "");
178 /* this leaves intermediate result strings in the tmpctx context, we'll free these when
180 for (peer=ptbl->head; peer!=NULL; peer=peer->next)
181 result=talloc_asprintf(tmpctx, "%s%s%s", result, lineterm, trp_peer_to_str(tmpctx, peer, sep));
183 talloc_steal(memctx, result); /* hand result over to caller */
184 talloc_free(tmpctx); /* free detritus */
188 TRP_PTABLE_ITER *trp_ptable_iter_new(TALLOC_CTX *mem_ctx)
190 TRP_PTABLE_ITER *iter=talloc(mem_ctx, TRP_PTABLE_ITER);
195 TRP_PEER *trp_ptable_iter_first(TRP_PTABLE_ITER *iter, TRP_PTABLE *ptbl)
201 TRP_PEER *trp_ptable_iter_next(TRP_PTABLE_ITER *iter)
207 void trp_ptable_iter_free(TRP_PTABLE_ITER *iter)