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>
39 static int tr_gss_names_destructor(void *obj)
41 TR_GSS_NAMES *gss_names=talloc_get_type_abort(obj, TR_GSS_NAMES);
44 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++) {
45 if (gss_names->names[ii]!=NULL)
46 tr_free_name(gss_names->names[ii]);
50 TR_GSS_NAMES *tr_gss_names_new(TALLOC_CTX *mem_ctx)
52 TR_GSS_NAMES *gn=talloc(mem_ctx, TR_GSS_NAMES);
56 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++)
58 talloc_set_destructor((void *)gn, tr_gss_names_destructor);
63 void tr_gss_names_free(TR_GSS_NAMES *gn)
68 /* returns 0 on success */
69 int tr_gss_names_add(TR_GSS_NAMES *gn, TR_NAME *new)
73 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++) {
74 if (gn->names[ii]==NULL)
77 if (ii!=TR_MAX_GSS_NAMES) {
84 int tr_gss_names_matches(TR_GSS_NAMES *gn, TR_NAME *name)
91 for (ii=0; ii<TR_MAX_GSS_NAMES; ii++) {
92 if ((gn->names[ii]!=NULL) &&
93 (0==tr_name_cmp(gn->names[ii], name)))
100 TR_GSS_NAMES_ITER *tr_gss_names_iter_new(TALLOC_CTX *mem_ctx)
102 TR_GSS_NAMES_ITER *iter=talloc(mem_ctx, TR_GSS_NAMES_ITER);
110 TR_NAME *tr_gss_names_iter_first(TR_GSS_NAMES_ITER *iter, TR_GSS_NAMES *gn)
114 return tr_gss_names_iter_next(iter);
117 TR_NAME *tr_gss_names_iter_next(TR_GSS_NAMES_ITER *iter)
120 (iter->ii < TR_MAX_GSS_NAMES) && (iter->gn->names[iter->ii]==NULL);
123 if (iter->ii<TR_MAX_GSS_NAMES)
124 return iter->gn->names[iter->ii];
129 void tr_gss_names_iter_free(TR_GSS_NAMES_ITER *iter)