1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
|
/* lset modifiers, for libreswan
*
* Copyright (C) 2017-2019 Andrew Cagney <cagney@gnu.org>
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version. See <https://www.gnu.org/licenses/gpl2.txt>.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* for more details.
*
*/
#include <stdio.h>
#include <stdarg.h>
#include "constants.h"
#include "lmod.h"
#include "lswlog.h"
#include "lswalloc.h"
const lmod_t empty_lmod = {
LEMPTY,
LEMPTY,
};
bool lmod_empty(lmod_t mod)
{
return mod.set == LEMPTY && mod.clr == LEMPTY;
}
void lmod_merge(lmod_t *lhs, lmod_t rhs)
{
lhs->set = (lhs->set & ~rhs.clr) | rhs.set;
lhs->clr = (lhs->clr & ~rhs.set) | rhs.clr;
}
lset_t lmod(lset_t set, lmod_t mod)
{
return (set & ~mod.clr ) | mod.set;
}
lmod_t lmod_set(lmod_t mod, lset_t set)
{
mod.set |= set;
mod.clr &= ~set;
return mod;
}
lmod_t lmod_clr(lmod_t mod, lset_t clr)
{
mod.clr |= clr;
mod.set &= ~clr;
return mod;
}
bool lmod_is_set(lmod_t mod, lset_t set)
{
return LIN(set, mod.set);
}
bool lmod_is_clr(lmod_t mod, lset_t clr)
{
return LIN(clr, mod.clr);
}
bool lmod_arg(lmod_t *mod, const struct lmod_info *info,
const char *args, bool enable)
{
bool ok = true;
shunk_t cursor = shunk1(args);
while (true) {
shunk_t elem = shunk_token(&cursor, NULL/*delim*/, "+, \t");
if (elem.ptr == NULL) {
break;
}
if (elem.len == 0) {
/* ignore empty */
continue;
}
if (enable && hunk_streq(elem, "none")) {
/* excludes --no-... none */
mod->clr = info->mask;
mod->set = LEMPTY;
} else {
/* non-empty */
shunk_t arg = elem;
/* excludes --no-... no-... */
bool no = enable ? hunk_streat(&arg, "no-") : true;
lset_t bits = LEMPTY;
/* try aliases first */
if (info->aliases != NULL) {
for (struct lmod_alias *c = info->aliases;
c->name != NULL; c++) {
if (hunk_streq(arg, c->name)) {
bits = c->bits;
break;
}
}
}
/* try bit mask second */
if (bits == LEMPTY) {
int ix = enum_match(info->names, arg);
if (ix >= 0) {
bits = LELEM(ix);
}
}
/* some sort of success */
if (bits == LEMPTY) {
ok = false;
break;
}
/* update masks */
if (no) {
mod->clr |= bits;
mod->set &= ~bits;
} else {
mod->set |= bits;
mod->clr &= ~bits;
}
}
}
return ok;
}
size_t jam_lmod(struct jambuf *buf, enum_names *names, lmod_t mod)
{
size_t s = 0;
static const char separator[] = "+";
s += jam_lset_short(buf, names, separator, mod.set);
if (mod.clr != LEMPTY) {
s += jam(buf, " - ");
s += jam_lset_short(buf, names, separator, mod.clr);
}
return s;
}
const char *str_lmod(const struct enum_names *sd, lmod_t val, lmod_buf *out)
{
struct jambuf buf = ARRAY_AS_JAMBUF(out->buf);
jam_lmod(&buf, sd, val);
return out->buf;
}
|
