snprintb.c revision 1.47 1 1.47 rillig /* $NetBSD: snprintb.c,v 1.47 2024/04/07 12:05:23 rillig Exp $ */
2 1.1 christos
3 1.1 christos /*-
4 1.41 rillig * Copyright (c) 2002, 2024 The NetBSD Foundation, Inc.
5 1.1 christos * All rights reserved.
6 1.1 christos *
7 1.1 christos * Redistribution and use in source and binary forms, with or without
8 1.1 christos * modification, are permitted provided that the following conditions
9 1.1 christos * are met:
10 1.1 christos * 1. Redistributions of source code must retain the above copyright
11 1.1 christos * notice, this list of conditions and the following disclaimer.
12 1.1 christos * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 christos * notice, this list of conditions and the following disclaimer in the
14 1.1 christos * documentation and/or other materials provided with the distribution.
15 1.1 christos *
16 1.1 christos * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
17 1.1 christos * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
18 1.1 christos * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
19 1.1 christos * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
20 1.1 christos * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 1.1 christos * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 1.1 christos * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 1.1 christos * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 1.1 christos * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 1.1 christos * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 1.1 christos * POSSIBILITY OF SUCH DAMAGE.
27 1.1 christos */
28 1.1 christos
29 1.2 christos #ifndef _STANDALONE
30 1.2 christos # ifndef _KERNEL
31 1.1 christos
32 1.2 christos # if HAVE_NBTOOL_CONFIG_H
33 1.2 christos # include "nbtool_config.h"
34 1.2 christos # endif
35 1.2 christos
36 1.2 christos # include <sys/cdefs.h>
37 1.41 rillig # if defined(LIBC_SCCS)
38 1.47 rillig __RCSID("$NetBSD: snprintb.c,v 1.47 2024/04/07 12:05:23 rillig Exp $");
39 1.2 christos # endif
40 1.2 christos
41 1.2 christos # include <sys/types.h>
42 1.13 agc # include <inttypes.h>
43 1.2 christos # include <stdio.h>
44 1.43 rillig # include <string.h>
45 1.2 christos # include <util.h>
46 1.2 christos # include <errno.h>
47 1.9 apb # else /* ! _KERNEL */
48 1.2 christos # include <sys/cdefs.h>
49 1.47 rillig __KERNEL_RCSID(0, "$NetBSD: snprintb.c,v 1.47 2024/04/07 12:05:23 rillig Exp $");
50 1.3 pooka # include <sys/param.h>
51 1.2 christos # include <sys/inttypes.h>
52 1.2 christos # include <sys/systm.h>
53 1.2 christos # include <lib/libkern/libkern.h>
54 1.9 apb # endif /* ! _KERNEL */
55 1.1 christos
56 1.9 apb # ifndef HAVE_SNPRINTB_M
57 1.35 rillig typedef struct {
58 1.35 rillig char *const buf;
59 1.35 rillig size_t const bufsize;
60 1.35 rillig const char *bitfmt;
61 1.35 rillig uint64_t const val;
62 1.35 rillig size_t const line_max;
63 1.35 rillig
64 1.43 rillig char num_fmt[5];
65 1.41 rillig size_t total_len;
66 1.41 rillig size_t line_pos;
67 1.41 rillig size_t comma_pos;
68 1.41 rillig int in_angle_brackets;
69 1.35 rillig } state;
70 1.35 rillig
71 1.35 rillig static void
72 1.35 rillig store(state *s, char c)
73 1.35 rillig {
74 1.35 rillig if (s->total_len < s->bufsize)
75 1.35 rillig s->buf[s->total_len] = c;
76 1.35 rillig s->total_len++;
77 1.35 rillig }
78 1.35 rillig
79 1.37 rillig static int
80 1.37 rillig store_num(state *s, const char *fmt, uintmax_t num)
81 1.35 rillig {
82 1.37 rillig int num_len = s->total_len < s->bufsize
83 1.37 rillig ? snprintf(s->buf + s->total_len, s->bufsize - s->total_len,
84 1.37 rillig fmt, num)
85 1.37 rillig : snprintf(NULL, 0, fmt, num);
86 1.37 rillig if (num_len > 0)
87 1.37 rillig s->total_len += num_len;
88 1.37 rillig return num_len;
89 1.35 rillig }
90 1.35 rillig
91 1.35 rillig static void
92 1.41 rillig store_eol(state *s)
93 1.35 rillig {
94 1.37 rillig if (s->total_len - s->line_pos > s->line_max) {
95 1.41 rillig s->total_len = s->line_pos + s->line_max - 1;
96 1.37 rillig store(s, '#');
97 1.35 rillig }
98 1.37 rillig store(s, '\0');
99 1.37 rillig s->line_pos = s->total_len;
100 1.37 rillig s->comma_pos = 0;
101 1.41 rillig s->in_angle_brackets = 0;
102 1.35 rillig }
103 1.35 rillig
104 1.35 rillig static void
105 1.41 rillig store_delimiter(state *s)
106 1.35 rillig {
107 1.41 rillig if (s->in_angle_brackets) {
108 1.37 rillig s->comma_pos = s->total_len;
109 1.37 rillig store(s, ',');
110 1.35 rillig } else {
111 1.37 rillig store(s, '<');
112 1.41 rillig s->in_angle_brackets = 1;
113 1.35 rillig }
114 1.35 rillig }
115 1.35 rillig
116 1.35 rillig static void
117 1.41 rillig maybe_wrap_line(state *s, const char *bitfmt)
118 1.35 rillig {
119 1.37 rillig if (s->line_max > 0
120 1.37 rillig && s->comma_pos > 0
121 1.37 rillig && s->total_len - s->line_pos >= s->line_max) {
122 1.37 rillig s->total_len = s->comma_pos;
123 1.37 rillig store(s, '>');
124 1.41 rillig store_eol(s);
125 1.37 rillig store_num(s, s->num_fmt, s->val);
126 1.37 rillig s->bitfmt = bitfmt;
127 1.35 rillig }
128 1.35 rillig }
129 1.35 rillig
130 1.35 rillig static int
131 1.35 rillig old_style(state *s)
132 1.35 rillig {
133 1.37 rillig while (*s->bitfmt != '\0') {
134 1.37 rillig const char *cur_bitfmt = s->bitfmt;
135 1.37 rillig uint8_t bit = *s->bitfmt;
136 1.37 rillig if (bit > ' ')
137 1.37 rillig return -1;
138 1.35 rillig if (s->val & (1U << (bit - 1))) {
139 1.41 rillig store_delimiter(s);
140 1.40 rillig while ((uint8_t)*++s->bitfmt > ' ')
141 1.37 rillig store(s, *s->bitfmt);
142 1.41 rillig maybe_wrap_line(s, cur_bitfmt);
143 1.35 rillig } else
144 1.40 rillig while ((uint8_t)*++s->bitfmt > ' ')
145 1.35 rillig continue;
146 1.35 rillig }
147 1.37 rillig return 0;
148 1.35 rillig }
149 1.35 rillig
150 1.35 rillig static int
151 1.35 rillig new_style(state *s)
152 1.35 rillig {
153 1.47 rillig uint8_t field_kind = 0; // 0 or 'f' or 'F'
154 1.47 rillig uint64_t field = 0; // valid if field_kind != '\0'
155 1.35 rillig int matched = 1;
156 1.37 rillig const char *prev_bitfmt = s->bitfmt;
157 1.35 rillig while (*s->bitfmt != '\0') {
158 1.37 rillig const char *cur_bitfmt = s->bitfmt;
159 1.38 rillig uint8_t kind = cur_bitfmt[0];
160 1.35 rillig switch (kind) {
161 1.35 rillig case 'b':
162 1.47 rillig field_kind = 0;
163 1.37 rillig prev_bitfmt = cur_bitfmt;
164 1.38 rillig uint8_t b_bit = cur_bitfmt[1];
165 1.38 rillig if (b_bit >= 64)
166 1.38 rillig return -1;
167 1.46 rillig if (cur_bitfmt[2] == '\0')
168 1.46 rillig return -1;
169 1.38 rillig s->bitfmt += 2;
170 1.38 rillig if (((s->val >> b_bit) & 1) == 0)
171 1.37 rillig goto skip_description;
172 1.41 rillig store_delimiter(s);
173 1.37 rillig while (*s->bitfmt++ != '\0')
174 1.37 rillig store(s, s->bitfmt[-1]);
175 1.41 rillig maybe_wrap_line(s, cur_bitfmt);
176 1.35 rillig break;
177 1.35 rillig case 'f':
178 1.35 rillig case 'F':
179 1.47 rillig field_kind = kind;
180 1.37 rillig prev_bitfmt = cur_bitfmt;
181 1.35 rillig matched = 0;
182 1.38 rillig uint8_t f_lsb = cur_bitfmt[1];
183 1.38 rillig if (f_lsb >= 64)
184 1.38 rillig return -1;
185 1.38 rillig uint8_t f_width = cur_bitfmt[2];
186 1.38 rillig if (f_width > 64)
187 1.38 rillig return -1;
188 1.46 rillig if (kind == 'f' && cur_bitfmt[3] == '\0')
189 1.46 rillig return -1;
190 1.38 rillig field = s->val >> f_lsb;
191 1.38 rillig if (f_width < 64)
192 1.38 rillig field &= ((uint64_t) 1 << f_width) - 1;
193 1.38 rillig s->bitfmt += 3;
194 1.41 rillig store_delimiter(s);
195 1.35 rillig if (kind == 'F')
196 1.37 rillig goto skip_description;
197 1.37 rillig while (*s->bitfmt++ != '\0')
198 1.37 rillig store(s, s->bitfmt[-1]);
199 1.37 rillig store(s, '=');
200 1.37 rillig store_num(s, s->num_fmt, field);
201 1.41 rillig maybe_wrap_line(s, cur_bitfmt);
202 1.35 rillig break;
203 1.35 rillig case '=':
204 1.35 rillig case ':':
205 1.38 rillig s->bitfmt += 2;
206 1.47 rillig if (kind == '=' && field_kind != 'f')
207 1.47 rillig return -1;
208 1.47 rillig if (kind == ':' && field_kind != 'F')
209 1.47 rillig return -1;
210 1.38 rillig uint8_t cmp = cur_bitfmt[1];
211 1.46 rillig if (cur_bitfmt[2] == '\0')
212 1.46 rillig return -1;
213 1.38 rillig if (field != cmp)
214 1.37 rillig goto skip_description;
215 1.35 rillig matched = 1;
216 1.35 rillig if (kind == '=')
217 1.37 rillig store(s, '=');
218 1.37 rillig while (*s->bitfmt++ != '\0')
219 1.37 rillig store(s, s->bitfmt[-1]);
220 1.41 rillig maybe_wrap_line(s, prev_bitfmt);
221 1.35 rillig break;
222 1.35 rillig case '*':
223 1.47 rillig if (field_kind == 0)
224 1.47 rillig return -1;
225 1.46 rillig if (cur_bitfmt[1] == '\0')
226 1.46 rillig return -1;
227 1.38 rillig s->bitfmt++;
228 1.37 rillig if (matched)
229 1.37 rillig goto skip_description;
230 1.37 rillig matched = 1;
231 1.37 rillig if (store_num(s, s->bitfmt, field) < 0)
232 1.37 rillig return -1;
233 1.41 rillig maybe_wrap_line(s, prev_bitfmt);
234 1.39 rillig goto skip_description;
235 1.35 rillig default:
236 1.42 rillig return -1;
237 1.37 rillig skip_description:
238 1.35 rillig while (*s->bitfmt++ != '\0')
239 1.35 rillig continue;
240 1.35 rillig break;
241 1.35 rillig }
242 1.35 rillig }
243 1.35 rillig return 0;
244 1.35 rillig }
245 1.35 rillig
246 1.39 rillig static void
247 1.39 rillig finish_buffer(state *s)
248 1.39 rillig {
249 1.39 rillig if (s->line_max > 0) {
250 1.41 rillig store_eol(s);
251 1.44 rillig store(s, '\0');
252 1.44 rillig if (s->bufsize >= 3 && s->total_len > s->bufsize)
253 1.44 rillig s->buf[s->bufsize - 3] = '#';
254 1.44 rillig if (s->bufsize >= 2 && s->total_len > s->bufsize)
255 1.39 rillig s->buf[s->bufsize - 2] = '\0';
256 1.44 rillig if (s->bufsize >= 1 && s->total_len > s->bufsize)
257 1.44 rillig s->buf[s->bufsize - 1] = '\0';
258 1.44 rillig } else {
259 1.44 rillig store(s, '\0');
260 1.44 rillig if (s->bufsize >= 2 && s->total_len > s->bufsize)
261 1.44 rillig s->buf[s->bufsize - 2] = '#';
262 1.44 rillig if (s->bufsize >= 1 && s->total_len > s->bufsize)
263 1.44 rillig s->buf[s->bufsize - 1] = '\0';
264 1.39 rillig }
265 1.39 rillig }
266 1.39 rillig
267 1.1 christos int
268 1.24 rillig snprintb_m(char *buf, size_t bufsize, const char *bitfmt, uint64_t val,
269 1.27 rillig size_t line_max)
270 1.1 christos {
271 1.35 rillig int old = *bitfmt != '\177';
272 1.35 rillig if (!old)
273 1.28 rillig bitfmt++;
274 1.35 rillig
275 1.43 rillig state s = {
276 1.43 rillig .buf = buf,
277 1.43 rillig .bufsize = bufsize,
278 1.43 rillig .bitfmt = bitfmt,
279 1.43 rillig .val = val,
280 1.43 rillig .line_max = line_max,
281 1.43 rillig };
282 1.43 rillig int had_error = 0;
283 1.43 rillig
284 1.43 rillig switch (*s.bitfmt++) {
285 1.1 christos case 8:
286 1.43 rillig memcpy(s.num_fmt, "%#jo", 4);
287 1.1 christos break;
288 1.1 christos case 10:
289 1.43 rillig memcpy(s.num_fmt, "%ju", 4);
290 1.1 christos break;
291 1.1 christos case 16:
292 1.43 rillig memcpy(s.num_fmt, "%#jx", 4);
293 1.1 christos break;
294 1.1 christos default:
295 1.43 rillig goto had_error;
296 1.1 christos }
297 1.1 christos
298 1.43 rillig store_num(&s, s.num_fmt, val);
299 1.5 pgoyette
300 1.43 rillig if ((old ? old_style(&s) : new_style(&s)) < 0) {
301 1.43 rillig had_error:
302 1.1 christos #ifndef _KERNEL
303 1.43 rillig errno = EINVAL;
304 1.1 christos #endif
305 1.43 rillig had_error = 1;
306 1.43 rillig store(&s, '#');
307 1.43 rillig } else if (s.in_angle_brackets)
308 1.43 rillig store(&s, '>');
309 1.39 rillig finish_buffer(&s);
310 1.43 rillig return had_error ? -1 : (int)(s.total_len - 1);
311 1.1 christos }
312 1.5 pgoyette
313 1.5 pgoyette int
314 1.24 rillig snprintb(char *buf, size_t bufsize, const char *bitfmt, uint64_t val)
315 1.5 pgoyette {
316 1.24 rillig return snprintb_m(buf, bufsize, bitfmt, val, 0);
317 1.5 pgoyette }
318 1.9 apb # endif /* ! HAVE_SNPRINTB_M */
319 1.9 apb #endif /* ! _STANDALONE */
320