snprintb.c revision 1.35 1 1.35 rillig /* $NetBSD: snprintb.c,v 1.35 2024/02/17 10:23:30 rillig Exp $ */
2 1.1 christos
3 1.1 christos /*-
4 1.1 christos * Copyright (c) 2002 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.1 christos /*
30 1.1 christos * snprintb: print an interpreted bitmask to a buffer
31 1.1 christos *
32 1.2 christos * => returns the length of the buffer that would be required to print the
33 1.2 christos * string minus the terminating NUL.
34 1.1 christos */
35 1.2 christos #ifndef _STANDALONE
36 1.2 christos # ifndef _KERNEL
37 1.1 christos
38 1.2 christos # if HAVE_NBTOOL_CONFIG_H
39 1.2 christos # include "nbtool_config.h"
40 1.2 christos # endif
41 1.2 christos
42 1.2 christos # include <sys/cdefs.h>
43 1.2 christos # if defined(LIBC_SCCS) && !defined(lint)
44 1.35 rillig __RCSID("$NetBSD: snprintb.c,v 1.35 2024/02/17 10:23:30 rillig Exp $");
45 1.2 christos # endif
46 1.2 christos
47 1.2 christos # include <sys/types.h>
48 1.13 agc # include <inttypes.h>
49 1.2 christos # include <stdio.h>
50 1.2 christos # include <util.h>
51 1.2 christos # include <errno.h>
52 1.9 apb # else /* ! _KERNEL */
53 1.2 christos # include <sys/cdefs.h>
54 1.35 rillig __KERNEL_RCSID(0, "$NetBSD: snprintb.c,v 1.35 2024/02/17 10:23:30 rillig Exp $");
55 1.3 pooka # include <sys/param.h>
56 1.2 christos # include <sys/inttypes.h>
57 1.2 christos # include <sys/systm.h>
58 1.2 christos # include <lib/libkern/libkern.h>
59 1.9 apb # endif /* ! _KERNEL */
60 1.1 christos
61 1.9 apb # ifndef HAVE_SNPRINTB_M
62 1.35 rillig typedef struct {
63 1.35 rillig char *const buf;
64 1.35 rillig size_t const bufsize;
65 1.35 rillig const char *bitfmt;
66 1.35 rillig uint64_t const val;
67 1.35 rillig size_t const line_max;
68 1.35 rillig
69 1.35 rillig const char *const num_fmt;
70 1.35 rillig unsigned const val_len;
71 1.35 rillig unsigned total_len;
72 1.35 rillig unsigned line_len;
73 1.35 rillig
74 1.35 rillig const char *cur_bitfmt;
75 1.35 rillig int restart;
76 1.35 rillig
77 1.35 rillig const char *sep_bitfmt;
78 1.35 rillig unsigned sep_line_len;
79 1.35 rillig char sep;
80 1.35 rillig } state;
81 1.35 rillig
82 1.35 rillig static void
83 1.35 rillig store(state *s, char c)
84 1.35 rillig {
85 1.35 rillig if (s->total_len < s->bufsize)
86 1.35 rillig s->buf[s->total_len] = c;
87 1.35 rillig s->total_len++;
88 1.35 rillig s->line_len++;
89 1.35 rillig }
90 1.35 rillig
91 1.35 rillig static void
92 1.35 rillig backup(state *s)
93 1.35 rillig {
94 1.35 rillig if (s->sep_line_len > 0) {
95 1.35 rillig s->total_len -= s->line_len - s->sep_line_len;
96 1.35 rillig s->sep_line_len = 0;
97 1.35 rillig s->restart = 1;
98 1.35 rillig s->bitfmt = s->sep_bitfmt;
99 1.35 rillig }
100 1.35 rillig store(s, '>');
101 1.35 rillig store(s, '\0');
102 1.35 rillig if (s->total_len < s->bufsize)
103 1.35 rillig snprintf(s->buf + s->total_len, s->bufsize - s->total_len,
104 1.35 rillig s->num_fmt, (uintmax_t)s->val);
105 1.35 rillig s->total_len += s->val_len;
106 1.35 rillig s->line_len = s->val_len;
107 1.35 rillig }
108 1.35 rillig
109 1.35 rillig static void
110 1.35 rillig put_sep(state *s)
111 1.35 rillig {
112 1.35 rillig if (s->line_max > 0 && s->line_len >= s->line_max) {
113 1.35 rillig backup(s);
114 1.35 rillig store(s, '<');
115 1.35 rillig } else {
116 1.35 rillig if (s->line_max > 0 && s->sep != '<') {
117 1.35 rillig s->sep_line_len = s->line_len;
118 1.35 rillig s->sep_bitfmt = s->cur_bitfmt;
119 1.35 rillig }
120 1.35 rillig store(s, s->sep);
121 1.35 rillig s->restart = 0;
122 1.35 rillig }
123 1.35 rillig }
124 1.35 rillig
125 1.35 rillig static void
126 1.35 rillig put_chr(state *s, char c)
127 1.35 rillig {
128 1.35 rillig if (s->line_max > 0 && s->line_len >= s->line_max - 1) {
129 1.35 rillig backup(s);
130 1.35 rillig if (s->restart == 0)
131 1.35 rillig store(s, c);
132 1.35 rillig else
133 1.35 rillig s->sep = '<';
134 1.35 rillig } else {
135 1.35 rillig store(s, c);
136 1.35 rillig s->restart = 0;
137 1.35 rillig }
138 1.35 rillig }
139 1.35 rillig
140 1.35 rillig static void
141 1.35 rillig put_bitfmt(state *s)
142 1.35 rillig {
143 1.35 rillig while (*s->bitfmt++ != 0) {
144 1.35 rillig put_chr(s, s->bitfmt[-1]);
145 1.35 rillig if (s->restart)
146 1.35 rillig break;
147 1.35 rillig }
148 1.35 rillig }
149 1.35 rillig
150 1.35 rillig static int
151 1.35 rillig put_num(state *s, const char *fmt, uintmax_t v)
152 1.35 rillig {
153 1.35 rillig char *bp = s->total_len < s->bufsize ? s->buf + s->total_len : NULL;
154 1.35 rillig size_t n = s->total_len < s->bufsize ? s->bufsize - s->total_len : 0;
155 1.35 rillig int fmt_len = snprintf(bp, n, fmt, v);
156 1.35 rillig if (fmt_len >= 0) {
157 1.35 rillig s->total_len += fmt_len;
158 1.35 rillig s->line_len += fmt_len;
159 1.35 rillig }
160 1.35 rillig return fmt_len;
161 1.35 rillig }
162 1.35 rillig
163 1.35 rillig static void
164 1.35 rillig old_style(state *s)
165 1.35 rillig {
166 1.35 rillig for (uint8_t bit; (bit = *s->bitfmt) != 0;) {
167 1.35 rillig s->cur_bitfmt = s->bitfmt++;
168 1.35 rillig if (s->val & (1U << (bit - 1))) {
169 1.35 rillig put_sep(s);
170 1.35 rillig if (s->restart)
171 1.35 rillig continue;
172 1.35 rillig s->sep = ',';
173 1.35 rillig for (; *s->bitfmt > ' '; ++s->bitfmt) {
174 1.35 rillig put_chr(s, *s->bitfmt);
175 1.35 rillig if (s->restart)
176 1.35 rillig break;
177 1.35 rillig }
178 1.35 rillig } else
179 1.35 rillig for (; *s->bitfmt > ' '; ++s->bitfmt)
180 1.35 rillig continue;
181 1.35 rillig }
182 1.35 rillig }
183 1.35 rillig
184 1.35 rillig static int
185 1.35 rillig new_style(state *s)
186 1.35 rillig {
187 1.35 rillig uint64_t field = s->val;
188 1.35 rillig int matched = 1;
189 1.35 rillig while (*s->bitfmt != '\0') {
190 1.35 rillig uint8_t kind = *s->bitfmt++;
191 1.35 rillig uint8_t bit = *s->bitfmt++;
192 1.35 rillig switch (kind) {
193 1.35 rillig case 'b':
194 1.35 rillig if (((s->val >> bit) & 1) == 0)
195 1.35 rillig goto skip;
196 1.35 rillig s->cur_bitfmt = s->bitfmt - 2;
197 1.35 rillig put_sep(s);
198 1.35 rillig if (s->restart)
199 1.35 rillig break;
200 1.35 rillig put_bitfmt(s);
201 1.35 rillig if (s->restart == 0)
202 1.35 rillig s->sep = ',';
203 1.35 rillig break;
204 1.35 rillig case 'f':
205 1.35 rillig case 'F':
206 1.35 rillig matched = 0;
207 1.35 rillig s->cur_bitfmt = s->bitfmt - 2;
208 1.35 rillig uint8_t field_width = *s->bitfmt++;
209 1.35 rillig field = (s->val >> bit) &
210 1.35 rillig (((uint64_t)1 << field_width) - 1);
211 1.35 rillig put_sep(s);
212 1.35 rillig if (s->restart == 0)
213 1.35 rillig s->sep = ',';
214 1.35 rillig if (kind == 'F')
215 1.35 rillig goto skip;
216 1.35 rillig if (s->restart == 0)
217 1.35 rillig put_bitfmt(s);
218 1.35 rillig if (s->restart == 0)
219 1.35 rillig put_chr(s, '=');
220 1.35 rillig if (s->restart == 0) {
221 1.35 rillig if (put_num(s, s->num_fmt, field) < 0)
222 1.35 rillig return -1;
223 1.35 rillig if (s->line_max > 0
224 1.35 rillig && s->line_len > s->line_max)
225 1.35 rillig put_chr(s, '#');
226 1.35 rillig }
227 1.35 rillig break;
228 1.35 rillig case '=':
229 1.35 rillig case ':':
230 1.35 rillig /* Here "bit" is actually a value instead. */
231 1.35 rillig if (field != bit)
232 1.35 rillig goto skip;
233 1.35 rillig matched = 1;
234 1.35 rillig if (kind == '=')
235 1.35 rillig put_chr(s, '=');
236 1.35 rillig put_bitfmt(s);
237 1.35 rillig break;
238 1.35 rillig case '*':
239 1.35 rillig s->bitfmt--;
240 1.35 rillig if (!matched) {
241 1.35 rillig matched = 1;
242 1.35 rillig if (put_num(s, s->bitfmt, field) < 0)
243 1.35 rillig return -1;
244 1.35 rillig }
245 1.35 rillig /*FALLTHROUGH*/
246 1.35 rillig default:
247 1.35 rillig skip:
248 1.35 rillig while (*s->bitfmt++ != '\0')
249 1.35 rillig continue;
250 1.35 rillig break;
251 1.35 rillig }
252 1.35 rillig }
253 1.35 rillig return 0;
254 1.35 rillig }
255 1.35 rillig
256 1.1 christos int
257 1.24 rillig snprintb_m(char *buf, size_t bufsize, const char *bitfmt, uint64_t val,
258 1.27 rillig size_t line_max)
259 1.1 christos {
260 1.1 christos #ifdef _KERNEL
261 1.1 christos /*
262 1.1 christos * For safety; no other *s*printf() do this, but in the kernel
263 1.1 christos * we don't usually check the return value
264 1.1 christos */
265 1.24 rillig (void)memset(buf, 0, bufsize);
266 1.1 christos #endif /* _KERNEL */
267 1.1 christos
268 1.35 rillig
269 1.35 rillig int old = *bitfmt != '\177';
270 1.35 rillig if (!old)
271 1.28 rillig bitfmt++;
272 1.35 rillig
273 1.35 rillig const char *num_fmt;
274 1.28 rillig switch (*bitfmt++) {
275 1.1 christos case 8:
276 1.27 rillig num_fmt = "%#jo";
277 1.1 christos break;
278 1.1 christos case 10:
279 1.27 rillig num_fmt = "%ju";
280 1.1 christos break;
281 1.1 christos case 16:
282 1.27 rillig num_fmt = "%#jx";
283 1.1 christos break;
284 1.1 christos default:
285 1.1 christos goto internal;
286 1.1 christos }
287 1.1 christos
288 1.33 rillig int val_len = snprintf(buf, bufsize, num_fmt, (uintmax_t)val);
289 1.32 rillig if (val_len < 0)
290 1.1 christos goto internal;
291 1.1 christos
292 1.35 rillig state s = {
293 1.35 rillig .buf = buf,
294 1.35 rillig .bufsize = bufsize,
295 1.35 rillig .bitfmt = bitfmt,
296 1.35 rillig .val = val,
297 1.35 rillig .line_max = line_max,
298 1.35 rillig
299 1.35 rillig .num_fmt = num_fmt,
300 1.35 rillig .val_len = val_len,
301 1.35 rillig .total_len = val_len,
302 1.35 rillig .line_len = val_len,
303 1.35 rillig
304 1.35 rillig .sep = '<',
305 1.35 rillig };
306 1.35 rillig
307 1.35 rillig if (old)
308 1.35 rillig old_style(&s);
309 1.35 rillig else if (new_style(&s) < 0)
310 1.35 rillig goto internal;
311 1.5 pgoyette
312 1.35 rillig if (s.sep != '<')
313 1.35 rillig store(&s, '>');
314 1.35 rillig if (s.line_max > 0) {
315 1.35 rillig store(&s, '\0');
316 1.35 rillig if (s.bufsize >= 2 && s.total_len > s.bufsize - 2)
317 1.35 rillig s.buf[s.bufsize - 2] = '\0';
318 1.1 christos }
319 1.35 rillig store(&s, '\0');
320 1.35 rillig if (s.bufsize >= 1 && s.total_len > s.bufsize - 1)
321 1.35 rillig s.buf[s.bufsize - 1] = '\0';
322 1.35 rillig return (int)(s.total_len - 1);
323 1.1 christos internal:
324 1.1 christos #ifndef _KERNEL
325 1.1 christos errno = EINVAL;
326 1.1 christos #endif
327 1.1 christos return -1;
328 1.1 christos }
329 1.5 pgoyette
330 1.5 pgoyette int
331 1.24 rillig snprintb(char *buf, size_t bufsize, const char *bitfmt, uint64_t val)
332 1.5 pgoyette {
333 1.24 rillig return snprintb_m(buf, bufsize, bitfmt, val, 0);
334 1.5 pgoyette }
335 1.9 apb # endif /* ! HAVE_SNPRINTB_M */
336 1.9 apb #endif /* ! _STANDALONE */
337