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