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>
39 #include <tr_config.h>
43 static int tr_rp_client_destructor(void *obj)
45 TR_RP_CLIENT *client=talloc_get_type_abort(obj, TR_RP_CLIENT);
48 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++) {
49 if (client->gss_names[ii]!=NULL)
50 tr_free_name(client->gss_names[ii]);
55 TR_RP_CLIENT *tr_rp_client_new(TALLOC_CTX *mem_ctx)
57 TR_RP_CLIENT *client=talloc(mem_ctx, TR_RP_CLIENT);
62 client->comm_next=NULL;
63 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++)
64 client->gss_names[ii]=NULL;
66 talloc_set_destructor((void *)client, tr_rp_client_destructor);
71 void tr_rp_client_free(TR_RP_CLIENT *client)
76 static TR_RP_CLIENT *tr_rp_client_tail(TR_RP_CLIENT *client)
83 TR_RP_CLIENT *tr_rp_client_add(TR_RP_CLIENT *clients, TR_RP_CLIENT *new)
88 tr_rp_client_tail(clients)->next=new;
90 talloc_steal(clients, new); /* put it in the right context */
98 int tr_rp_client_add_gss_name(TR_RP_CLIENT *rp_client, TR_NAME *gss_name)
101 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++) {
102 if (NULL==rp_client->gss_names[ii]) {
103 rp_client->gss_names[ii]=gss_name;
104 return 0; /* success */
107 return -1; /* error */
110 int tr_rp_client_set_filter(TR_RP_CLIENT *client, TR_FILTER *filt)
112 if (client->filter!=NULL)
113 tr_filter_free(client->filter);
115 talloc_steal(client, filt);
116 return 0; /* success */
119 TR_RP_CLIENT *tr_rp_client_lookup(TR_RP_CLIENT *rp_clients, TR_NAME *gss_name)
121 TR_RP_CLIENT *rp = NULL;
124 if ((!rp_clients) || (!gss_name)) {
125 tr_debug("tr_rp_client_lookup: Bad parameters.");
129 for (rp = rp_clients; NULL != rp; rp = rp->next) {
130 for (i = 0; ((i < TR_MAX_GSS_NAMES) && (NULL != (rp->gss_names[i]))); i++) {
131 if (!tr_name_cmp(gss_name, rp->gss_names[i])) {
139 /* talloc note: lists of idp realms should be assembled using
140 * tr_idp_realm_add(). This will put all of the elements in the
141 * list, other than the head, as children of the head context.
142 * The head can then be placed in whatever context is desired. */
144 static TR_RP_REALM *tr_rp_realm_tail(TR_RP_REALM *realm)
151 /* for correct behavior, call like: rp_realms=tr_rp_realm_add(rp_realms, new_realm); */
152 TR_RP_REALM *tr_rp_realm_add(TR_RP_REALM *head, TR_RP_REALM *new)
157 tr_rp_realm_tail(head)->next=new;
159 talloc_steal(head, new); /* put it in the right context */