2 * Copyright (c) 2012, 2013, 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_filter.h>
41 int tr_filter_process_rp_permitted (TR_NAME *rp_realm, TR_FILTER *rpp_filter, TR_CONSTRAINT_SET *in_constraints, TR_CONSTRAINT_SET **out_constraints, int *out_action)
45 *out_action = TR_FILTER_ACTION_REJECT;
46 *out_constraints = NULL;
48 /* If this isn't a valid rp_permitted filter, return no match. */
50 (TR_FILTER_TYPE_RP_PERMITTED != rpp_filter->type)) {
51 return TR_FILTER_NO_MATCH;
54 /* Check if there is a match for this filter. */
55 for (i = 0; i < TR_MAX_FILTER_LINES; i++) {
56 for (j = 0; j < TR_MAX_FILTER_SPECS; j++) {
58 if ((rpp_filter->lines[i]) &&
59 (rpp_filter->lines[i]->specs[j]) &&
60 (tr_prefix_wildcard_match(rp_realm->buf, rpp_filter->lines[i]->specs[j]->match->buf))) {
61 *out_action = rpp_filter->lines[i]->action;
62 *out_constraints = in_constraints;
63 if (rpp_filter->lines[i]->realm_cons)
64 tr_constraint_add_to_set(out_constraints,
65 rpp_filter->lines[i]->realm_cons);
66 if (rpp_filter->lines[i]->domain_cons)
67 tr_constraint_add_to_set(out_constraints,
68 rpp_filter->lines[i]->domain_cons);
70 return TR_FILTER_MATCH;
74 /* If there is no match, indicate that. */
75 return TR_FILTER_NO_MATCH;
78 void tr_filter_free (TR_FILTER *filt) {
84 for (i = 0; i < TR_MAX_FILTER_LINES; i++) {
86 for (j = 0; j < TR_MAX_FILTER_SPECS; j++) {
87 if (filt->lines[i]->specs[j])
88 free(filt->lines[i]->specs[j]);
90 if (filt->lines[i]->realm_cons)
91 free(filt->lines[i]->realm_cons);
92 if (filt->lines[i]->domain_cons)
93 free(filt->lines[i]->domain_cons);