2 * Copyright (c) 2016, 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.
37 #include <tr_gss_names.h>
40 static int tr_gss_names_destructor(void *obj)
42 TR_GSS_NAMES *gss_names=talloc_get_type_abort(obj, TR_GSS_NAMES);
45 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++) {
46 if (gss_names->names[ii]!=NULL)
47 tr_free_name(gss_names->names[ii]);
51 TR_GSS_NAMES *tr_gss_names_new(TALLOC_CTX *mem_ctx)
53 TR_GSS_NAMES *gn=talloc(mem_ctx, TR_GSS_NAMES);
57 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++)
59 talloc_set_destructor((void *)gn, tr_gss_names_destructor);
64 void tr_gss_names_free(TR_GSS_NAMES *gn)
69 /* returns 0 on success */
70 int tr_gss_names_add(TR_GSS_NAMES *gn, TR_NAME *new)
74 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++) {
75 if (gn->names[ii]==NULL)
78 if (ii!=TR_MAX_GSS_NAMES) {
86 * Create a duplicate GSS names struct
92 TR_GSS_NAMES *tr_gss_names_dup(TALLOC_CTX *mem_ctx, TR_GSS_NAMES *orig)
94 TALLOC_CTX *tmp_ctx = talloc_new(NULL);
95 TR_GSS_NAMES *new = tr_gss_names_new(tmp_ctx);
96 TR_GSS_NAMES_ITER *iter = tr_gss_names_iter_new(tmp_ctx);
99 if ( !orig || !new || !iter ) {
100 talloc_free(tmp_ctx);
103 this = tr_gss_names_iter_first(iter, orig);
105 if (tr_gss_names_add(new, tr_dup_name(this)) != 0) {
106 talloc_free(tmp_ctx);
109 this = tr_gss_names_iter_next(iter);
112 talloc_steal(mem_ctx, new);
115 int tr_gss_names_matches(TR_GSS_NAMES *gn, TR_NAME *name)
122 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++) {
123 if ((gn->names[ii]!=NULL) &&
124 (0==tr_name_cmp(gn->names[ii], name)))
131 TR_GSS_NAMES_ITER *tr_gss_names_iter_new(TALLOC_CTX *mem_ctx)
133 TR_GSS_NAMES_ITER *iter=talloc(mem_ctx, TR_GSS_NAMES_ITER);
141 TR_NAME *tr_gss_names_iter_first(TR_GSS_NAMES_ITER *iter, TR_GSS_NAMES *gn)
145 return tr_gss_names_iter_next(iter);
148 TR_NAME *tr_gss_names_iter_next(TR_GSS_NAMES_ITER *iter)
151 (iter->ii < TR_MAX_GSS_NAMES) && (iter->gn->names[iter->ii]==NULL);
154 if (iter->ii<TR_MAX_GSS_NAMES)
155 return iter->gn->names[iter->ii];
160 void tr_gss_names_iter_free(TR_GSS_NAMES_ITER *iter)
165 json_t *tr_gss_names_to_json_array(TR_GSS_NAMES *gss_names)
167 TR_GSS_NAMES_ITER *iter = tr_gss_names_iter_new(NULL);
168 json_t *jarray = json_array();
169 TR_NAME *name = tr_gss_names_iter_first(iter, gss_names);
171 json_array_append_new(jarray, tr_name_to_json_string(name));
172 name = tr_gss_names_iter_next(iter);
174 tr_gss_names_iter_free(iter);