cksnprintb.c revision 1.6 1 1.6 rillig /* $NetBSD: cksnprintb.c,v 1.6 2024/03/03 13:09:22 rillig Exp $ */
2 1.1 rillig
3 1.1 rillig /*-
4 1.1 rillig * Copyright (c) 2024 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.1 rillig #if HAVE_NBTOOL_CONFIG_H
33 1.1 rillig #include "nbtool_config.h"
34 1.1 rillig #endif
35 1.1 rillig
36 1.1 rillig #include <sys/cdefs.h>
37 1.1 rillig #if defined(__RCSID)
38 1.6 rillig __RCSID("$NetBSD: cksnprintb.c,v 1.6 2024/03/03 13:09:22 rillig Exp $");
39 1.1 rillig #endif
40 1.1 rillig
41 1.1 rillig #include <stdbool.h>
42 1.1 rillig #include <string.h>
43 1.1 rillig
44 1.1 rillig #include "lint1.h"
45 1.1 rillig
46 1.3 rillig typedef struct {
47 1.3 rillig bool new_style;
48 1.3 rillig const buffer *fmt;
49 1.4 rillig const tnode_t *value;
50 1.6 rillig
51 1.6 rillig quoted_iterator it;
52 1.3 rillig uint64_t field_width;
53 1.3 rillig uint64_t covered;
54 1.4 rillig unsigned covered_start[64];
55 1.4 rillig unsigned covered_end[64];
56 1.3 rillig } checker;
57 1.3 rillig
58 1.1 rillig static bool
59 1.1 rillig match_string_literal(const tnode_t *tn, const buffer **str)
60 1.1 rillig {
61 1.1 rillig while (tn->tn_op == CVT)
62 1.1 rillig tn = tn_ck_left(tn);
63 1.1 rillig return tn->tn_op == ADDR
64 1.1 rillig && tn->tn_left->tn_op == STRING
65 1.1 rillig && (*str = tn->tn_left->tn_string, (*str)->data != NULL);
66 1.1 rillig }
67 1.1 rillig
68 1.1 rillig static bool
69 1.1 rillig match_snprintb_call(const function_call *call,
70 1.1 rillig const buffer **out_fmt, const tnode_t **out_val)
71 1.1 rillig {
72 1.1 rillig const char *func;
73 1.1 rillig const tnode_t *val;
74 1.1 rillig const buffer *str;
75 1.1 rillig
76 1.1 rillig if (call->func->tn_op == ADDR
77 1.1 rillig && call->func->tn_left->tn_op == NAME
78 1.1 rillig && (func = call->func->tn_left->tn_sym->s_name, true)
79 1.1 rillig && ((strcmp(func, "snprintb") == 0 && call->args_len == 4)
80 1.1 rillig || (strcmp(func, "snprintb_m") == 0 && call->args_len == 5))
81 1.1 rillig && match_string_literal(call->args[2], &str)
82 1.1 rillig && (val = call->args[3], true)) {
83 1.1 rillig *out_fmt = str;
84 1.1 rillig *out_val = val;
85 1.1 rillig return true;
86 1.1 rillig }
87 1.1 rillig return false;
88 1.1 rillig }
89 1.1 rillig
90 1.1 rillig static int
91 1.1 rillig len(quoted_iterator it)
92 1.1 rillig {
93 1.1 rillig return (int)(it.i - it.start);
94 1.1 rillig }
95 1.1 rillig
96 1.1 rillig static int
97 1.1 rillig range(quoted_iterator start, quoted_iterator end)
98 1.1 rillig {
99 1.1 rillig return (int)(end.i - start.start);
100 1.1 rillig }
101 1.1 rillig
102 1.1 rillig static const char *
103 1.1 rillig start(quoted_iterator it, const buffer *buf)
104 1.1 rillig {
105 1.1 rillig return buf->data + it.start;
106 1.1 rillig }
107 1.1 rillig
108 1.1 rillig static uintmax_t
109 1.1 rillig val(quoted_iterator it)
110 1.1 rillig {
111 1.1 rillig return it.value;
112 1.1 rillig }
113 1.1 rillig
114 1.1 rillig static void
115 1.1 rillig check_hex_escape(const buffer *buf, quoted_iterator it)
116 1.1 rillig {
117 1.1 rillig if (it.hex_digits > 1) {
118 1.1 rillig bool upper = false;
119 1.1 rillig bool lower = false;
120 1.1 rillig for (size_t i = it.start + 2; i < it.i; i++) {
121 1.1 rillig if (isupper((unsigned char)buf->data[i]))
122 1.1 rillig upper = true;
123 1.1 rillig if (islower((unsigned char)buf->data[i]))
124 1.1 rillig lower = true;
125 1.1 rillig }
126 1.1 rillig if (upper && lower)
127 1.1 rillig /* hex escape '%.*s' mixes uppercase and lower... */
128 1.1 rillig warning(357, len(it), start(it, buf));
129 1.1 rillig }
130 1.1 rillig if (it.hex_digits > 2)
131 1.1 rillig /* hex escape '%.*s' has more than 2 digits */
132 1.1 rillig warning(358, len(it), start(it, buf));
133 1.1 rillig }
134 1.1 rillig
135 1.3 rillig static void
136 1.3 rillig check_overlap(checker *ck, uint64_t dir_lsb, uint64_t width,
137 1.3 rillig size_t start, size_t end)
138 1.3 rillig {
139 1.4 rillig unsigned lsb = (unsigned)(ck->new_style ? dir_lsb : dir_lsb - 1);
140 1.4 rillig if (lsb >= 64 || width == 0 || width > 64)
141 1.3 rillig return;
142 1.3 rillig
143 1.3 rillig uint64_t field_mask = value_bits((unsigned)width) << lsb;
144 1.3 rillig uint64_t overlap = ck->covered & field_mask;
145 1.3 rillig if (overlap == 0)
146 1.6 rillig goto update_covered;
147 1.3 rillig
148 1.3 rillig for (unsigned i = lsb; i < 64; i++) {
149 1.3 rillig if (!(overlap & bit(i)))
150 1.3 rillig continue;
151 1.3 rillig /* '%.*s' overlaps earlier '%.*s' on bit %u */
152 1.3 rillig warning(376,
153 1.3 rillig (int)(end - start), ck->fmt->data + start,
154 1.3 rillig (int)(ck->covered_end[i] - ck->covered_start[i]),
155 1.3 rillig ck->fmt->data + ck->covered_start[i],
156 1.3 rillig ck->new_style ? i : i + 1);
157 1.3 rillig break;
158 1.3 rillig }
159 1.3 rillig
160 1.6 rillig update_covered:
161 1.3 rillig ck->covered |= field_mask;
162 1.3 rillig for (unsigned i = lsb; i < 64; i++) {
163 1.3 rillig if (field_mask & bit(i)) {
164 1.4 rillig ck->covered_start[i] = (unsigned)start;
165 1.4 rillig ck->covered_end[i] = (unsigned)end;
166 1.3 rillig }
167 1.3 rillig }
168 1.3 rillig }
169 1.3 rillig
170 1.4 rillig static void
171 1.4 rillig check_reachable(checker *ck, uint64_t dir_lsb, uint64_t width,
172 1.4 rillig size_t start, size_t end)
173 1.4 rillig {
174 1.4 rillig unsigned lsb = (unsigned)(ck->new_style ? dir_lsb : dir_lsb - 1);
175 1.4 rillig if (lsb >= 64 || width == 0 || width > 64)
176 1.4 rillig return;
177 1.4 rillig
178 1.4 rillig uint64_t field_mask = value_bits((unsigned)width) << lsb;
179 1.6 rillig if (!(possible_bits(ck->value) & field_mask))
180 1.4 rillig /* directive '%.*s' is unreachable by input value */
181 1.4 rillig warning(378, (int)(end - start), ck->fmt->data + start);
182 1.4 rillig }
183 1.4 rillig
184 1.5 rillig static void
185 1.6 rillig parse_description(checker *ck, bool *seen_null, bool *descr_empty)
186 1.5 rillig {
187 1.6 rillig quoted_iterator first = ck->it;
188 1.5 rillig (void)quoted_next(ck->fmt, &first);
189 1.5 rillig size_t descr_start = first.start, descr_end = descr_start;
190 1.5 rillig
191 1.6 rillig for (quoted_iterator peek = ck->it; quoted_next(ck->fmt, &peek);) {
192 1.6 rillig if (!ck->new_style && peek.value <= 32)
193 1.6 rillig break;
194 1.6 rillig ck->it = peek;
195 1.6 rillig if (ck->new_style && peek.value == 0) {
196 1.5 rillig *seen_null = true;
197 1.5 rillig break;
198 1.5 rillig }
199 1.5 rillig descr_end = peek.i;
200 1.5 rillig if (peek.escaped && !isprint((unsigned char)peek.value)) {
201 1.5 rillig /* non-printing character '%.*s' in description ... */
202 1.5 rillig warning(363,
203 1.6 rillig len(ck->it), start(ck->it, ck->fmt),
204 1.5 rillig (int)(descr_end - descr_start),
205 1.5 rillig ck->fmt->data + descr_start);
206 1.5 rillig }
207 1.5 rillig }
208 1.5 rillig *descr_empty = descr_start == descr_end;
209 1.5 rillig }
210 1.5 rillig
211 1.1 rillig static bool
212 1.6 rillig check_directive(checker *ck)
213 1.1 rillig {
214 1.6 rillig bool new_style = ck->new_style;
215 1.6 rillig const buffer *fmt = ck->fmt;
216 1.6 rillig quoted_iterator *it = &ck->it;
217 1.1 rillig
218 1.1 rillig if (!quoted_next(fmt, it))
219 1.1 rillig return false;
220 1.1 rillig quoted_iterator dir = *it;
221 1.1 rillig
222 1.1 rillig bool has_bit = !new_style
223 1.1 rillig || dir.value == 'b' || dir.value == 'f' || dir.value == 'F';
224 1.1 rillig if (has_bit && new_style && !quoted_next(fmt, it)) {
225 1.1 rillig /* missing bit position after '%.*s' */
226 1.4 rillig warning(364, range(dir, *it), start(dir, fmt));
227 1.1 rillig return false;
228 1.1 rillig }
229 1.1 rillig /* LINTED 86 "automatic 'bit' hides external declaration" */
230 1.1 rillig quoted_iterator bit = *it;
231 1.1 rillig
232 1.1 rillig bool has_width = new_style
233 1.1 rillig && (dir.value == 'f' || dir.value == 'F');
234 1.1 rillig if (has_width && !quoted_next(fmt, it)) {
235 1.1 rillig /* missing field width after '%.*s' */
236 1.4 rillig warning(365, range(dir, *it), start(dir, fmt));
237 1.1 rillig return false;
238 1.1 rillig }
239 1.1 rillig quoted_iterator width = *it;
240 1.1 rillig
241 1.1 rillig bool has_cmp = new_style
242 1.1 rillig && (dir.value == '=' || dir.value == ':');
243 1.1 rillig if (has_cmp && !quoted_next(fmt, it)) {
244 1.1 rillig /* missing comparison value after directive '%.*s' */
245 1.4 rillig warning(368, range(dir, *it), start(dir, fmt));
246 1.1 rillig return false;
247 1.1 rillig }
248 1.1 rillig quoted_iterator cmp = *it;
249 1.1 rillig
250 1.1 rillig bool has_default = new_style && dir.value == '*';
251 1.1 rillig
252 1.5 rillig if (dir.value == '\0') {
253 1.4 rillig quoted_iterator end = *it;
254 1.4 rillig if (!quoted_next(fmt, &end)) {
255 1.5 rillig /* redundant '\0' at the end of the format */
256 1.4 rillig warning(377);
257 1.4 rillig return false;
258 1.4 rillig }
259 1.4 rillig }
260 1.4 rillig
261 1.1 rillig if (!has_bit && !has_cmp && !has_default) {
262 1.6 rillig /* unknown directive '%.*s', must be one of 'bfF=:*' */
263 1.1 rillig warning(374, len(dir), start(dir, fmt));
264 1.1 rillig return false;
265 1.1 rillig }
266 1.6 rillig if (new_style && dir.escaped)
267 1.6 rillig /* directive '%.*s' should not be escaped */
268 1.6 rillig warning(362, len(dir), start(dir, fmt));
269 1.1 rillig
270 1.5 rillig bool needs_descr = !(new_style && dir.value == 'F');
271 1.5 rillig bool seen_null = false, descr_empty = false;
272 1.6 rillig parse_description(ck, &seen_null, &descr_empty);
273 1.1 rillig
274 1.1 rillig if (has_bit)
275 1.1 rillig check_hex_escape(fmt, bit);
276 1.1 rillig if (has_width)
277 1.1 rillig check_hex_escape(fmt, width);
278 1.1 rillig if (has_bit && bit.octal_digits == 0 && bit.hex_digits == 0) {
279 1.1 rillig /* bit position '%.*s' in '%.*s' should be escaped as ... */
280 1.1 rillig warning(369, len(bit), start(bit, fmt),
281 1.1 rillig range(dir, *it), start(dir, fmt));
282 1.1 rillig }
283 1.1 rillig if (has_width && width.octal_digits == 0 && width.hex_digits == 0) {
284 1.1 rillig /* field width '%.*s' in '%.*s' should be escaped as ... */
285 1.1 rillig warning(370, len(width), start(width, fmt),
286 1.1 rillig range(dir, *it), start(dir, fmt));
287 1.1 rillig }
288 1.1 rillig if (has_bit && (new_style ? bit.value > 63 : bit.value - 1 > 31)) {
289 1.1 rillig /* bit position '%.*s' (%ju) in '%.*s' out of range %u..%u */
290 1.1 rillig warning(371,
291 1.1 rillig len(bit), start(bit, fmt), val(bit),
292 1.1 rillig range(dir, *it), start(dir, fmt),
293 1.1 rillig new_style ? 0 : 1, new_style ? 63 : 32);
294 1.1 rillig }
295 1.6 rillig if (has_width && width.value > 64) {
296 1.6 rillig /* field width '%.*s' (%ju) in '%.*s' out of range 0..64 */
297 1.1 rillig warning(372,
298 1.1 rillig len(width), start(width, fmt), val(width),
299 1.6 rillig range(dir, *it), start(dir, fmt));
300 1.1 rillig }
301 1.1 rillig if (has_width && bit.value + width.value > 64) {
302 1.1 rillig /* bit field end %ju in '%.*s' out of range 0..64 */
303 1.1 rillig warning(373, val(bit) + val(width),
304 1.1 rillig range(dir, *it), start(dir, fmt));
305 1.1 rillig }
306 1.5 rillig if (has_cmp && ck->field_width > 0 && ck->field_width < 64
307 1.5 rillig && cmp.value & ~value_bits((unsigned)ck->field_width)) {
308 1.4 rillig /* comparison value '%.*s' (%ju) exceeds maximum field ... */
309 1.1 rillig warning(375, len(cmp), start(cmp, fmt), val(cmp),
310 1.4 rillig (uintmax_t)value_bits((unsigned)ck->field_width));
311 1.3 rillig }
312 1.3 rillig if (has_bit) {
313 1.3 rillig uint64_t w = has_width ? width.value : 1;
314 1.3 rillig check_overlap(ck, bit.value, w, dir.start, it->i);
315 1.4 rillig check_reachable(ck, bit.value, w, dir.start, it->i);
316 1.4 rillig }
317 1.6 rillig if (needs_descr && descr_empty)
318 1.1 rillig /* empty description in '%.*s' */
319 1.1 rillig warning(367, range(dir, *it), start(dir, fmt));
320 1.6 rillig if (new_style && !seen_null)
321 1.5 rillig /* missing '\0' at the end of '%.*s' */
322 1.5 rillig warning(366, range(dir, *it), start(dir, fmt));
323 1.1 rillig
324 1.1 rillig if (has_width)
325 1.3 rillig ck->field_width = width.value;
326 1.1 rillig return true;
327 1.1 rillig }
328 1.1 rillig
329 1.1 rillig void
330 1.1 rillig check_snprintb(const tnode_t *expr)
331 1.1 rillig {
332 1.1 rillig const buffer *fmt;
333 1.1 rillig const tnode_t *value;
334 1.1 rillig if (!match_snprintb_call(expr->tn_call, &fmt, &value))
335 1.1 rillig return;
336 1.1 rillig
337 1.6 rillig checker ck = {
338 1.6 rillig .fmt = fmt,
339 1.6 rillig .value = value,
340 1.6 rillig .field_width = 64,
341 1.6 rillig };
342 1.6 rillig
343 1.6 rillig if (!quoted_next(fmt, &ck.it)) {
344 1.1 rillig /* missing new-style '\177' or old-style number base */
345 1.1 rillig warning(359);
346 1.1 rillig return;
347 1.1 rillig }
348 1.6 rillig ck.new_style = ck.it.value == '\177';
349 1.6 rillig if (ck.new_style && !quoted_next(fmt, &ck.it)) {
350 1.1 rillig /* missing new-style number base after '\177' */
351 1.1 rillig warning(360);
352 1.1 rillig return;
353 1.1 rillig }
354 1.6 rillig if (ck.it.value != 8 && ck.it.value != 10 && ck.it.value != 16) {
355 1.4 rillig /* number base '%.*s' is %ju, must be 8, 10 or 16 */
356 1.6 rillig warning(361, len(ck.it), start(ck.it, fmt), val(ck.it));
357 1.1 rillig return;
358 1.1 rillig }
359 1.1 rillig
360 1.6 rillig while (check_directive(&ck))
361 1.1 rillig continue;
362 1.1 rillig }
363