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