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
|
/* Copyright 2009-2016
* Kaz Kylheku <kaz@kylheku.com>
* Vancouver, Canada
* All rights reserved.
*
* Redistribution of this software in source and binary forms, with or without
* modification, is permitted provided that the following two conditions are met.
*
* Use of this software in any manner constitutes agreement with the disclaimer
* which follows the two conditions.
*
* 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 ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DAMAGES, HOWEVER CAUSED,
* AND UNDER ANY THEORY OF LIABILITY, 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 "config.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(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_fill(struct args *args, cnum minfill, cnum maxfill)
{
args_normalize(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 *to->arg * to->fill);
return to;
}
struct args *args_copy_zap(struct args *to, struct args *from)
{
args_copy(to, from);
memset(from->arg, 0, sizeof *to->arg * to->fill);
return to;
}
struct args *args_cat_zap(struct args *to, struct args *from)
{
to->list = from->list;
memcpy(to->arg + to->fill, from->arg, sizeof *from->arg * from->fill);
to->fill += from->fill;
memset(from->arg, 0, sizeof *to->arg * to->fill);
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;
}
|
