BadVPN – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /** |
2 | * @file logical.c |
||
3 | * @author Ambroz Bizjak <ambrop7@gmail.com> |
||
4 | * |
||
5 | * @section LICENSE |
||
6 | * |
||
7 | * Redistribution and use in source and binary forms, with or without |
||
8 | * modification, are permitted provided that the following conditions are met: |
||
9 | * 1. Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * 2. Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * 3. Neither the name of the author nor the |
||
15 | * names of its contributors may be used to endorse or promote products |
||
16 | * derived from this software without specific prior written permission. |
||
17 | * |
||
18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
||
19 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
||
20 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
||
21 | * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY |
||
22 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
||
23 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
||
24 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
||
25 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
||
27 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
28 | * |
||
29 | * @section DESCRIPTION |
||
30 | * |
||
31 | * Module for logical operators. |
||
32 | * |
||
33 | * Synopsis: not(string val) |
||
34 | * Variables: |
||
35 | * string (empty) - "true" if val does not equal "true", "false" otherwise |
||
36 | * |
||
37 | * Synopsis: or([string val1, ...]) |
||
38 | * Variables: |
||
39 | * string (empty) - "true" if at least one of the values equals "true", "false" otherwise |
||
40 | * |
||
41 | * Synopsis: and([string val1, ...]) |
||
42 | * Variables: |
||
43 | * string (empty) - "true" if all of the values equal "true", "false" otherwise |
||
44 | */ |
||
45 | |||
46 | #include <stdlib.h> |
||
47 | #include <string.h> |
||
48 | |||
49 | #include <ncd/module_common.h> |
||
50 | |||
51 | #include <generated/blog_channel_ncd_logical.h> |
||
52 | |||
53 | struct instance { |
||
54 | NCDModuleInst *i; |
||
55 | int value; |
||
56 | }; |
||
57 | |||
58 | static void func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params, int is_not, int is_or) |
||
59 | { |
||
60 | struct instance *o = vo; |
||
61 | o->i = i; |
||
62 | |||
63 | // compute value from arguments |
||
64 | if (is_not) { |
||
65 | NCDValRef arg; |
||
66 | if (!NCDVal_ListRead(params->args, 1, &arg)) { |
||
67 | ModuleLog(o->i, BLOG_ERROR, "wrong arity"); |
||
68 | goto fail0; |
||
69 | } |
||
70 | int arg_val; |
||
71 | if (!ncd_read_boolean(arg, &arg_val)) { |
||
72 | ModuleLog(o->i, BLOG_ERROR, "bad argument"); |
||
73 | goto fail0; |
||
74 | } |
||
75 | |||
76 | o->value = !arg_val; |
||
77 | } else { |
||
78 | o->value = (is_or ? 0 : 1); |
||
79 | |||
80 | size_t count = NCDVal_ListCount(params->args); |
||
81 | |||
82 | for (size_t j = 0; j < count; j++) { |
||
83 | NCDValRef arg = NCDVal_ListGet(params->args, j); |
||
84 | |||
85 | int this_value; |
||
86 | if (!ncd_read_boolean(arg, &this_value)) { |
||
87 | ModuleLog(o->i, BLOG_ERROR, "bad argument"); |
||
88 | goto fail0; |
||
89 | } |
||
90 | |||
91 | if (is_or) { |
||
92 | o->value = o->value || this_value; |
||
93 | } else { |
||
94 | o->value = o->value && this_value; |
||
95 | } |
||
96 | } |
||
97 | } |
||
98 | |||
99 | // signal up |
||
100 | NCDModuleInst_Backend_Up(o->i); |
||
101 | return; |
||
102 | |||
103 | fail0: |
||
104 | NCDModuleInst_Backend_DeadError(i); |
||
105 | } |
||
106 | |||
107 | static void func_new_not (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params) |
||
108 | { |
||
109 | func_new(vo, i, params, 1, 0); |
||
110 | } |
||
111 | |||
112 | static void func_new_or (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params) |
||
113 | { |
||
114 | func_new(vo, i, params, 0, 1); |
||
115 | } |
||
116 | |||
117 | static void func_new_and (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params) |
||
118 | { |
||
119 | func_new(vo, i, params, 0, 0); |
||
120 | } |
||
121 | |||
122 | static int func_getvar2 (void *vo, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out) |
||
123 | { |
||
124 | struct instance *o = vo; |
||
125 | |||
126 | if (name == NCD_STRING_EMPTY) { |
||
127 | *out = ncd_make_boolean(mem, o->value); |
||
128 | return 1; |
||
129 | } |
||
130 | |||
131 | return 0; |
||
132 | } |
||
133 | |||
134 | static struct NCDModule modules[] = { |
||
135 | { |
||
136 | .type = "not", |
||
137 | .func_new2 = func_new_not, |
||
138 | .func_getvar2 = func_getvar2, |
||
139 | .alloc_size = sizeof(struct instance) |
||
140 | }, { |
||
141 | .type = "or", |
||
142 | .func_new2 = func_new_or, |
||
143 | .func_getvar2 = func_getvar2, |
||
144 | .alloc_size = sizeof(struct instance) |
||
145 | }, { |
||
146 | .type = "and", |
||
147 | .func_new2 = func_new_and, |
||
148 | .func_getvar2 = func_getvar2, |
||
149 | .alloc_size = sizeof(struct instance) |
||
150 | }, { |
||
151 | .type = NULL |
||
152 | } |
||
153 | }; |
||
154 | |||
155 | const struct NCDModuleGroup ncdmodule_logical = { |
||
156 | .modules = modules |
||
157 | }; |