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 <trust_router/tr_name.h>
41 static int tr_apc_destructor(void *obj)
43 TR_APC *apc=talloc_get_type_abort(obj, TR_APC);
45 tr_free_name(apc->id);
49 TR_APC *tr_apc_new(TALLOC_CTX *mem_ctx)
51 TR_APC *apc=talloc(mem_ctx, TR_APC);
55 talloc_set_destructor((void *)apc, tr_apc_destructor);
60 void tr_apc_free(TR_APC *apc)
65 static TR_APC *tr_apc_tail(TR_APC *apc)
70 while (apc->next!=NULL)
75 /* do not call this directly, use the tr_apc_add() macro */
76 TR_APC *tr_apc_add_func(TR_APC *head, TR_APC *new)
81 tr_apc_tail(head)->next=new;
83 talloc_steal(head, new);
90 /* does not copy next pointer */
91 TR_APC *tr_apc_dup_one(TALLOC_CTX *mem_ctx, TR_APC *apc)
93 TR_APC *new=tr_apc_new(mem_ctx);
95 tr_apc_set_id(new, tr_apc_dup_id(apc));
99 /* copies next pointer */
100 TR_APC *tr_apc_dup(TALLOC_CTX *mem_ctx, TR_APC *apc)
102 TALLOC_CTX *tmp_ctx=talloc_new(NULL);
104 TR_APC *new=tr_apc_dup(tmp_ctx, apc);
109 for (cur=new,apc=apc->next; apc!=NULL; cur=cur->next,apc=apc->next) {
110 cur->next=tr_apc_dup_one(new, apc);
111 if (cur->next==NULL) {
117 talloc_steal(mem_ctx, new);
120 talloc_free(tmp_ctx);
124 void tr_apc_set_id(TR_APC *apc, TR_NAME *id)
127 tr_free_name(apc->id);
131 TR_NAME *tr_apc_get_id(TR_APC *apc)
136 TR_NAME *tr_apc_dup_id(TR_APC *apc)
138 return tr_dup_name(apc->id);
142 char *tr_apc_to_str(TALLOC_CTX *mem_ctx, TR_APC *apc)
144 return talloc_strndup(mem_ctx, apc->id->buf, apc->id->len);
147 TR_APC_ITER *tr_apc_iter_new(TALLOC_CTX *mem_ctx)
149 return talloc(mem_ctx, TR_APC_ITER);
152 TR_APC *tr_apc_iter_first(TR_APC_ITER *iter, TR_APC *apc)
158 TR_APC *tr_apc_iter_next(TR_APC_ITER *iter)
160 (*iter)=(*iter)->next;
164 void tr_apc_iter_free(TR_APC_ITER *iter)
169 /* 1 on match, 0 on no match, -1 on error */
170 int tr_apc_in_common(TR_APC *one, TR_APC *two)
172 TALLOC_CTX *tmp_ctx=talloc_new(NULL);
173 TR_APC_ITER *i_one=tr_apc_iter_new(tmp_ctx);
174 TR_APC_ITER *i_two=tr_apc_iter_new(tmp_ctx);
175 TR_APC *cur_one=NULL;
176 TR_APC *cur_two=NULL;
178 if ((i_one==NULL) || (i_two==NULL)) {
179 tr_err("tr_apc_in_common: unable to allocate iterators.");
180 talloc_free(tmp_ctx);
183 for (cur_one=tr_apc_iter_first(i_one, one); cur_one!=NULL; cur_one=tr_apc_iter_next(i_one)) {
184 for (cur_two=tr_apc_iter_first(i_two, two); cur_two!=NULL; cur_two=tr_apc_iter_next(i_two)) {
185 if (cur_one==cur_two)