2 * Copyright (c) 2012, 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>
40 #include <tr_config.h>
44 static int tr_rp_client_destructor(void *obj)
49 TR_RP_CLIENT *tr_rp_client_new(TALLOC_CTX *mem_ctx)
51 TR_RP_CLIENT *client=talloc(mem_ctx, TR_RP_CLIENT);
55 client->comm_next=NULL;
56 client->gss_names=NULL;
58 talloc_set_destructor((void *)client, tr_rp_client_destructor);
63 void tr_rp_client_free(TR_RP_CLIENT *client)
68 static TR_RP_CLIENT *tr_rp_client_tail(TR_RP_CLIENT *client)
73 while (client->next!=NULL)
78 /* do not call directly, use the tr_rp_client_add() macro */
79 TR_RP_CLIENT *tr_rp_client_add_func(TR_RP_CLIENT *clients, TR_RP_CLIENT *new)
84 tr_rp_client_tail(clients)->next=new;
86 talloc_steal(clients, new); /* put it in the right context */
94 int tr_rp_client_add_gss_name(TR_RP_CLIENT *rp_client, TR_NAME *gss_name)
96 return tr_gss_names_add(rp_client->gss_names, gss_name);
99 int tr_rp_client_set_filter(TR_RP_CLIENT *client, TR_FILTER *filt)
101 if (client->filter!=NULL)
102 tr_filter_free(client->filter);
104 talloc_steal(client, filt);
105 return 0; /* success */
108 TR_RP_CLIENT *tr_rp_client_lookup(TR_RP_CLIENT *rp_clients, TR_NAME *gss_name)
110 TR_RP_CLIENT *rp = NULL;
112 if ((!rp_clients) || (!gss_name)) {
113 tr_debug("tr_rp_client_lookup: Bad parameters.");
117 for (rp = rp_clients; NULL != rp; rp = rp->next) {
118 if (tr_gss_names_matches(rp->gss_names, gss_name))
124 TR_RP_REALM *tr_rp_realm_lookup(TR_RP_REALM *rp_realms, TR_NAME *rp_name)
126 TR_RP_REALM *rp = NULL;
129 tr_debug("tr_rp_realm_lookup: Bad parameters.");
133 for (rp=rp_realms; NULL!=rp; rp=rp->next) {
134 if (0==tr_name_cmp(tr_rp_realm_get_id(rp), rp_name))
140 static int tr_rp_realm_destructor(void *obj)
142 TR_RP_REALM *rp=talloc_get_type_abort(obj, TR_RP_REALM);
143 if (rp->realm_id!=NULL)
144 tr_free_name(rp->realm_id);
148 TR_RP_REALM *tr_rp_realm_new(TALLOC_CTX *mem_ctx)
150 TR_RP_REALM *rp=talloc(mem_ctx, TR_RP_REALM);
155 talloc_set_destructor((void *)rp, tr_rp_realm_destructor);
160 void tr_rp_realm_free(TR_RP_REALM *rp)
165 /* talloc note: lists of idp realms should be assembled using
166 * tr_idp_realm_add(). This will put all of the elements in the
167 * list, other than the head, as children of the head context.
168 * The head can then be placed in whatever context is desired. */
170 static TR_RP_REALM *tr_rp_realm_tail(TR_RP_REALM *realm)
175 while (realm->next!=NULL)
180 /* for correct behavior, call like: rp_realms=tr_rp_realm_add_func(rp_realms, new_realm);
181 * or better yet, use the macro */
182 TR_RP_REALM *tr_rp_realm_add_func(TR_RP_REALM *head, TR_RP_REALM *new)
187 tr_rp_realm_tail(head)->next=new;
189 talloc_steal(head, new); /* put it in the right context */
197 TR_RP_REALM *tr_rp_realm_remove_func(TR_RP_REALM *head, TR_RP_REALM *remove)
199 TALLOC_CTX *list_ctx=talloc_parent(head);
200 TR_RP_REALM *this=NULL;
206 /* if we're removing the head, put the next element (if present) into the context
207 * the list head was in. */
210 talloc_steal(list_ctx, head);
211 /* now put all the other elements in the context of the list head */
212 for (this=head->next; this!=NULL; this=this->next)
213 talloc_steal(head, this);
216 /* not removing the head; no need to play with contexts */
217 for (this=head; this->next!=NULL; this=this->next) {
218 if (this->next==remove) {
219 this->next=remove->next;
227 void tr_rp_realm_incref(TR_RP_REALM *realm)
232 void tr_rp_realm_decref(TR_RP_REALM *realm)
234 if (realm->refcount>0)
238 /* remove any with zero refcount
240 TR_RP_REALM *tr_rp_realm_sweep_func(TR_RP_REALM *head)
242 TR_RP_REALM *rp=NULL;
243 TR_RP_REALM *old_next=NULL;
248 while ((head!=NULL) && (head->refcount==0)) {
249 rp=head; /* keep a pointer so we can remove it */
250 tr_rp_realm_remove(head, rp); /* use this to get talloc contexts right */
251 tr_rp_realm_free(rp);
257 /* will not remove the head here, that has already been done */
258 for (rp=head; rp->next!=NULL; rp=rp->next) {
259 if (rp->next->refcount==0) {
261 tr_rp_realm_remove(head, rp->next); /* changes rp->next */
262 tr_rp_realm_free(old_next);
269 TR_NAME *tr_rp_realm_get_id(TR_RP_REALM *rp)
277 TR_NAME *tr_rp_realm_dup_id(TR_RP_REALM *rp)
282 return tr_dup_name(tr_rp_realm_get_id(rp));
285 void tr_rp_realm_set_id(TR_RP_REALM *rp, TR_NAME *id)
287 if (rp->realm_id!=NULL)
288 tr_free_name(rp->realm_id);
292 char *tr_rp_realm_to_str(TALLOC_CTX *mem_ctx, TR_RP_REALM *rp)
294 return talloc_asprintf(mem_ctx,
295 "RP realm: \"%.*s\"\n",
296 rp->realm_id->len, rp->realm_id->buf);