ckgetopt.c revision 1.22 1 1.22 rillig /* $NetBSD: ckgetopt.c,v 1.22 2024/02/03 19:25:16 rillig Exp $ */
2 1.1 rillig
3 1.1 rillig /*-
4 1.1 rillig * Copyright (c) 2021 The NetBSD Foundation, Inc.
5 1.1 rillig * All rights reserved.
6 1.1 rillig *
7 1.1 rillig * This code is derived from software contributed to The NetBSD Foundation
8 1.1 rillig * by Roland Illig <rillig (at) NetBSD.org>.
9 1.1 rillig *
10 1.1 rillig * Redistribution and use in source and binary forms, with or without
11 1.1 rillig * modification, are permitted provided that the following conditions
12 1.1 rillig * are met:
13 1.1 rillig * 1. Redistributions of source code must retain the above copyright
14 1.1 rillig * notice, this list of conditions and the following disclaimer.
15 1.1 rillig * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 rillig * notice, this list of conditions and the following disclaimer in the
17 1.1 rillig * documentation and/or other materials provided with the distribution.
18 1.1 rillig *
19 1.1 rillig * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 rillig * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 rillig * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 rillig * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 rillig * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 rillig * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 rillig * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 rillig * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 rillig * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 rillig * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 rillig * POSSIBILITY OF SUCH DAMAGE.
30 1.1 rillig */
31 1.1 rillig
32 1.2 rillig #if HAVE_NBTOOL_CONFIG_H
33 1.2 rillig #include "nbtool_config.h"
34 1.2 rillig #endif
35 1.2 rillig
36 1.1 rillig #include <sys/cdefs.h>
37 1.16 rillig #if defined(__RCSID)
38 1.22 rillig __RCSID("$NetBSD: ckgetopt.c,v 1.22 2024/02/03 19:25:16 rillig Exp $");
39 1.1 rillig #endif
40 1.1 rillig
41 1.1 rillig #include <stdbool.h>
42 1.1 rillig #include <stdlib.h>
43 1.1 rillig #include <string.h>
44 1.1 rillig
45 1.1 rillig #include "lint1.h"
46 1.1 rillig
47 1.1 rillig /*
48 1.1 rillig * In a typical while loop for parsing getopt options, ensure that each
49 1.1 rillig * option from the options string is handled, and that each handled option
50 1.1 rillig * is listed in the options string.
51 1.1 rillig */
52 1.1 rillig
53 1.7 rillig static struct {
54 1.17 rillig /*-
55 1.4 rillig * 0 means outside a while loop with a getopt call.
56 1.4 rillig * 1 means directly inside a while loop with a getopt call.
57 1.4 rillig * > 1 means in a nested while loop; this is used for finishing the
58 1.4 rillig * check at the correct point.
59 1.4 rillig */
60 1.4 rillig int while_level;
61 1.4 rillig
62 1.4 rillig /*
63 1.4 rillig * The options string from the getopt call. Whenever an option is
64 1.17 rillig * handled by a case label, it is set to ' '. In the end, only ' ' and
65 1.17 rillig * ':' should remain.
66 1.4 rillig */
67 1.1 rillig pos_t options_pos;
68 1.1 rillig char *options;
69 1.4 rillig
70 1.4 rillig /*
71 1.4 rillig * The nesting level of switch statements, is only modified if
72 1.4 rillig * while_level > 0. Only the case labels at switch_level == 1 are
73 1.4 rillig * relevant, all nested case labels are ignored.
74 1.4 rillig */
75 1.1 rillig int switch_level;
76 1.1 rillig } ck;
77 1.1 rillig
78 1.18 rillig /* Return whether tn has the form '(c = getopt(argc, argv, "str")) != -1'. */
79 1.1 rillig static bool
80 1.10 rillig is_getopt_condition(const tnode_t *tn, char **out_options)
81 1.1 rillig {
82 1.13 rillig const tnode_t *call, *last_arg;
83 1.20 rillig const buffer *str;
84 1.13 rillig
85 1.18 rillig if (tn != NULL
86 1.18 rillig && tn->tn_op == NE
87 1.18 rillig && tn->tn_left->tn_op == ASSIGN
88 1.18 rillig && tn->tn_right->tn_op == CON
89 1.18 rillig && tn->tn_right->tn_u._tn_val.v_tspec == INT
90 1.18 rillig && tn->tn_right->tn_u._tn_val.u.integer == -1
91 1.18 rillig
92 1.18 rillig && (call = tn->tn_left->tn_right)->tn_op == CALL
93 1.18 rillig && call->tn_left->tn_op == ADDR
94 1.18 rillig && call->tn_left->tn_left->tn_op == NAME
95 1.18 rillig && strcmp(call->tn_left->tn_left->tn_sym->s_name, "getopt") == 0
96 1.18 rillig
97 1.18 rillig && call->tn_right->tn_op == PUSH
98 1.18 rillig
99 1.18 rillig && (last_arg = call->tn_right->tn_left)->tn_op == CVT
100 1.18 rillig && last_arg->tn_left->tn_op == ADDR
101 1.18 rillig && last_arg->tn_left->tn_left->tn_op == STRING
102 1.20 rillig && (str = last_arg->tn_left->tn_left->tn_string)->data != NULL) {
103 1.22 rillig buffer buf;
104 1.22 rillig buf_init(&buf);
105 1.22 rillig quoted_iterator it = { .start = 0 };
106 1.22 rillig while (quoted_next(str, &it))
107 1.22 rillig buf_add_char(&buf, (char)it.value);
108 1.22 rillig *out_options = buf.data;
109 1.18 rillig return true;
110 1.18 rillig }
111 1.18 rillig return false;
112 1.1 rillig }
113 1.1 rillig
114 1.1 rillig static void
115 1.1 rillig check_unlisted_option(char opt)
116 1.1 rillig {
117 1.12 rillig if (opt == ':' && ck.options[0] != ':')
118 1.12 rillig goto warn;
119 1.12 rillig
120 1.21 rillig char *optptr = strchr(ck.options, opt);
121 1.1 rillig if (optptr != NULL)
122 1.5 rillig *optptr = ' ';
123 1.21 rillig else if (opt != '?')
124 1.12 rillig warn:
125 1.1 rillig /* option '%c' should be listed in the options string */
126 1.1 rillig warning(339, opt);
127 1.1 rillig }
128 1.1 rillig
129 1.1 rillig static void
130 1.1 rillig check_unhandled_option(void)
131 1.1 rillig {
132 1.21 rillig for (const char *opt = ck.options; *opt != '\0'; opt++) {
133 1.1 rillig if (*opt == ' ' || *opt == ':')
134 1.1 rillig continue;
135 1.1 rillig
136 1.1 rillig /* option '%c' should be handled in the switch */
137 1.9 rillig warning_at(338, &ck.options_pos, *opt);
138 1.1 rillig }
139 1.1 rillig }
140 1.1 rillig
141 1.1 rillig
142 1.1 rillig void
143 1.1 rillig check_getopt_begin_while(const tnode_t *tn)
144 1.1 rillig {
145 1.4 rillig if (ck.while_level == 0) {
146 1.10 rillig if (!is_getopt_condition(tn, &ck.options))
147 1.4 rillig return;
148 1.1 rillig ck.options_pos = curr_pos;
149 1.1 rillig }
150 1.1 rillig ck.while_level++;
151 1.1 rillig }
152 1.1 rillig
153 1.1 rillig void
154 1.1 rillig check_getopt_begin_switch(void)
155 1.1 rillig {
156 1.1 rillig if (ck.while_level > 0)
157 1.1 rillig ck.switch_level++;
158 1.1 rillig }
159 1.1 rillig
160 1.1 rillig void
161 1.1 rillig check_getopt_case_label(int64_t value)
162 1.1 rillig {
163 1.1 rillig if (ck.switch_level == 1 && value == (char)value)
164 1.1 rillig check_unlisted_option((char)value);
165 1.1 rillig }
166 1.1 rillig
167 1.1 rillig void
168 1.1 rillig check_getopt_end_switch(void)
169 1.1 rillig {
170 1.1 rillig if (ck.switch_level == 0)
171 1.1 rillig return;
172 1.1 rillig
173 1.1 rillig ck.switch_level--;
174 1.1 rillig if (ck.switch_level == 0)
175 1.1 rillig check_unhandled_option();
176 1.1 rillig }
177 1.1 rillig
178 1.1 rillig void
179 1.1 rillig check_getopt_end_while(void)
180 1.1 rillig {
181 1.1 rillig if (ck.while_level == 0)
182 1.1 rillig return;
183 1.1 rillig
184 1.1 rillig ck.while_level--;
185 1.1 rillig if (ck.while_level != 0)
186 1.1 rillig return;
187 1.1 rillig
188 1.1 rillig free(ck.options);
189 1.1 rillig ck.options = NULL;
190 1.1 rillig }
191