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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/* Copyright 2009-2018
* Kaz Kylheku <kaz@kylheku.com>
* Vancouver, Canada
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stddef.h>
#include <signal.h>
#include <string.h>
#include <stdarg.h>
#include "config.h"
#include ALLOCA_H
#include "lib.h"
#include "signal.h"
#include "unwind.h"
#include "gc.h"
#include "args.h"
val args_cons_list(struct args *args);
val args_add_checked(val name, struct args *args, val arg)
{
if (args->fill >= args->argc)
uw_throwf(assert_s, lit("~a: argument list size exceeded"), name, nao);
return args_add(args, arg);
}
void args_normalize_exact(struct args *args, cnum fill)
{
bug_unless (fill <= args->argc);
while (args->fill > fill)
args->list = cons(z(args->arg[--args->fill]), args->list);
while (args->fill < fill && args->list)
args_add(args, pop(&args->list));
}
void args_normalize_least(struct args *args, cnum minfill)
{
bug_unless (args->fill <= args->argc);
while (args->fill < minfill && args->list)
args_add(args, pop(&args->list));
}
void args_normalize_fill(struct args *args, cnum minfill, cnum maxfill)
{
args_normalize_least(args, maxfill);
if (args->fill >= minfill)
while (args->fill < maxfill)
args_add(args, colon_k);
}
val args_get_checked(val name, struct args *args, cnum *arg_index)
{
if (*arg_index >= args->fill && !args->list)
uw_throwf(assert_s, lit("~a: insufficient arguments"), name, nao);
return args_get(args, arg_index);
}
struct args *args_copy(struct args *to, struct args *from)
{
to->fill = from->fill;
to->list = from->list;
memcpy(to->arg, from->arg, sizeof *from->arg * from->fill);
return to;
}
struct args *args_copy_zap(struct args *to, struct args *from)
{
args_copy(to, from);
memset(from->arg, 0, sizeof *from->arg * from->fill);
return to;
}
struct args *args_cat_zap(struct args *to, struct args *from)
{
size_t size = sizeof *from->arg * from->fill;
to->list = from->list;
memcpy(to->arg + to->fill, from->arg, size);
to->fill += from->fill;
memset(from->arg, 0, size);
return to;
}
struct args *args_cat_zap_from(struct args *to, struct args *from, cnum index)
{
size_t size = sizeof *from->arg * (from->fill - index);
to->list = from->list;
memcpy(to->arg + to->fill, from->arg + index, size);
to->fill += from->fill - index;
memset(from->arg + index, 0, size);
return to;
}
struct args *args_copy_reverse(struct args *to, struct args *from, cnum nargs)
{
cnum i, index = 0;
for (i = nargs - 1; i >= 0; i--)
to->arg[i] = args_get(from, &index);
to->fill = nargs;
return to;
}
val args_copy_to_list(struct args *args)
{
list_collect_decl (out, ptail);
cnum i;
for (i = 0; i < args->fill; i++)
ptail = list_collect(ptail, args->arg[i]);
list_collect_nconc(ptail, args->list);
return out;
}
void args_for_each(struct args *args,
int (*fn)(val arg, int ix, mem_t *ctx),
mem_t *ctx)
{
int i;
val iter;
for (i = 0; i < args->fill; i++)
if (fn(args->arg[i], i, ctx))
args->arg[i] = nil;
for (iter = args->list; iter; iter = cdr(iter), i++)
if (fn(car(iter), i, ctx))
rplaca(iter, nil);
}
struct args_bool_ctx {
struct args_bool_key *akv;
int n;
val *next_arg_store;
};
static int args_key_check_store(val arg, int ix, mem_t *ctx)
{
struct args_bool_ctx *acx = coerce(struct args_bool_ctx *, ctx);
int i, n = acx->n;
if (acx->next_arg_store != 0) {
*acx->next_arg_store = arg;
acx->next_arg_store = 0;
return 0;
}
for (i = 0; i < n; i++) {
struct args_bool_key *akl = &acx->akv[i];
if (akl->key == arg) {
if (akl->arg_p)
acx->next_arg_store = akl->store;
else
*akl->store = t;
break;
}
}
return 0;
}
void args_keys_extract(struct args *args, struct args_bool_key *akv, int n)
{
if (n > 0) {
struct args_bool_ctx acx;
acx.akv = akv;
acx.n = n;
acx.next_arg_store = 0;
args_for_each(args, args_key_check_store, coerce(mem_t *, &acx));
}
}
|
