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 <tr_name_internal.h>
39 #include <tr_gss_names.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_filters(TR_RP_CLIENT *client, TR_FILTER_SET *filts)
101 if (client->filters!=NULL)
102 tr_filter_set_free(client->filters);
103 client->filters=filts;
104 talloc_steal(client, filts);
105 return 0; /* success */
108 TR_RP_CLIENT_ITER *tr_rp_client_iter_new(TALLOC_CTX *memctx)
110 return talloc(memctx, TR_RP_CLIENT_ITER);
113 void tr_rp_client_iter_free(TR_RP_CLIENT_ITER *iter)
118 TR_RP_CLIENT *tr_rp_client_iter_first(TR_RP_CLIENT_ITER *iter, TR_RP_CLIENT *rp_clients)
121 tr_err("tr_rp_client_iter_first: Iterator is null, failing.");
128 TR_RP_CLIENT *tr_rp_client_iter_next(TR_RP_CLIENT_ITER *iter)
136 * Find a client associated with a GSS name. It's possible there are other clients that match as well.
138 * @param rp_clients List of RP clients to search
139 * @param gss_name GSS name to search for
140 * @return Borrowed reference to an RP client linked to the GSS name
142 TR_RP_CLIENT *tr_rp_client_lookup(TR_RP_CLIENT *rp_clients, TR_NAME *gss_name)
144 TR_RP_CLIENT_ITER *iter=tr_rp_client_iter_new(NULL);
145 TR_RP_CLIENT *client=NULL;
148 tr_err("tr_rp_client_lookup: Unable to allocate iterator");
151 for (client=tr_rp_client_iter_first(iter, rp_clients); client != NULL; client=tr_rp_client_iter_next(iter)) {
152 if (tr_gss_names_matches(client->gss_names, gss_name))
155 tr_rp_client_iter_free(iter);
159 TR_RP_REALM *tr_rp_realm_lookup(TR_RP_REALM *rp_realms, TR_NAME *rp_name)
161 TR_RP_REALM *rp = NULL;
164 tr_debug("tr_rp_realm_lookup: Bad parameters.");
168 for (rp=rp_realms; NULL!=rp; rp=rp->next) {
169 if (0==tr_name_cmp(tr_rp_realm_get_id(rp), rp_name))
175 static int tr_rp_realm_destructor(void *obj)
177 TR_RP_REALM *rp=talloc_get_type_abort(obj, TR_RP_REALM);
178 if (rp->realm_id!=NULL)
179 tr_free_name(rp->realm_id);
183 TR_RP_REALM *tr_rp_realm_new(TALLOC_CTX *mem_ctx)
185 TR_RP_REALM *rp=talloc(mem_ctx, TR_RP_REALM);
190 talloc_set_destructor((void *)rp, tr_rp_realm_destructor);
195 void tr_rp_realm_free(TR_RP_REALM *rp)
200 /* talloc note: lists of idp realms should be assembled using
201 * tr_idp_realm_add(). This will put all of the elements in the
202 * list, other than the head, as children of the head context.
203 * The head can then be placed in whatever context is desired. */
205 static TR_RP_REALM *tr_rp_realm_tail(TR_RP_REALM *realm)
210 while (realm->next!=NULL)
215 /* for correct behavior, call like: rp_realms=tr_rp_realm_add_func(rp_realms, new_realm);
216 * or better yet, use the macro */
217 TR_RP_REALM *tr_rp_realm_add_func(TR_RP_REALM *head, TR_RP_REALM *new)
222 tr_rp_realm_tail(head)->next=new;
224 talloc_steal(head, new); /* put it in the right context */
232 TR_RP_REALM *tr_rp_realm_remove_func(TR_RP_REALM *head, TR_RP_REALM *remove)
234 TALLOC_CTX *list_ctx=talloc_parent(head);
235 TR_RP_REALM *this=NULL;
241 /* if we're removing the head, put the next element (if present) into the context
242 * the list head was in. */
245 talloc_steal(list_ctx, head);
246 /* now put all the other elements in the context of the list head */
247 for (this=head->next; this!=NULL; this=this->next)
248 talloc_steal(head, this);
251 /* not removing the head; no need to play with contexts */
252 for (this=head; this->next!=NULL; this=this->next) {
253 if (this->next==remove) {
254 this->next=remove->next;
262 void tr_rp_realm_incref(TR_RP_REALM *realm)
267 void tr_rp_realm_decref(TR_RP_REALM *realm)
269 if (realm->refcount>0)
273 /* remove any with zero refcount
275 TR_RP_REALM *tr_rp_realm_sweep_func(TR_RP_REALM *head)
277 TR_RP_REALM *rp=NULL;
278 TR_RP_REALM *old_next=NULL;
283 while ((head!=NULL) && (head->refcount==0)) {
284 rp=head; /* keep a pointer so we can remove it */
285 tr_rp_realm_remove(head, rp); /* use this to get talloc contexts right */
286 tr_rp_realm_free(rp);
292 /* will not remove the head here, that has already been done */
293 for (rp=head; (rp!=NULL) && (rp->next!=NULL); rp=rp->next) {
294 if (rp->next->refcount==0) {
296 tr_rp_realm_remove(head, rp->next); /* changes rp->next, may make it null */
297 tr_rp_realm_free(old_next);
304 TR_NAME *tr_rp_realm_get_id(TR_RP_REALM *rp)
312 TR_NAME *tr_rp_realm_dup_id(TR_RP_REALM *rp)
317 return tr_dup_name(tr_rp_realm_get_id(rp));
320 void tr_rp_realm_set_id(TR_RP_REALM *rp, TR_NAME *id)
322 if (rp->realm_id!=NULL)
323 tr_free_name(rp->realm_id);
327 char *tr_rp_realm_to_str(TALLOC_CTX *mem_ctx, TR_RP_REALM *rp)
329 return talloc_asprintf(mem_ctx,
330 "RP realm: \"%.*s\"\n",
331 rp->realm_id->len, rp->realm_id->buf);