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