snprintb.c revision 1.41 1 1.41 rillig /* $NetBSD: snprintb.c,v 1.41 2024/02/24 12:44:11 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.41 rillig __RCSID("$NetBSD: snprintb.c,v 1.41 2024/02/24 12:44:11 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.2 christos # include <util.h>
45 1.2 christos # include <errno.h>
46 1.9 apb # else /* ! _KERNEL */
47 1.2 christos # include <sys/cdefs.h>
48 1.41 rillig __KERNEL_RCSID(0, "$NetBSD: snprintb.c,v 1.41 2024/02/24 12:44:11 rillig Exp $");
49 1.3 pooka # include <sys/param.h>
50 1.2 christos # include <sys/inttypes.h>
51 1.2 christos # include <sys/systm.h>
52 1.2 christos # include <lib/libkern/libkern.h>
53 1.9 apb # endif /* ! _KERNEL */
54 1.1 christos
55 1.9 apb # ifndef HAVE_SNPRINTB_M
56 1.35 rillig typedef struct {
57 1.35 rillig char *const buf;
58 1.35 rillig size_t const bufsize;
59 1.35 rillig const char *bitfmt;
60 1.35 rillig uint64_t const val;
61 1.35 rillig size_t const line_max;
62 1.35 rillig
63 1.35 rillig const char *const num_fmt;
64 1.41 rillig size_t total_len;
65 1.41 rillig size_t line_pos;
66 1.41 rillig size_t comma_pos;
67 1.41 rillig int in_angle_brackets;
68 1.35 rillig } state;
69 1.35 rillig
70 1.35 rillig static void
71 1.35 rillig store(state *s, char c)
72 1.35 rillig {
73 1.35 rillig if (s->total_len < s->bufsize)
74 1.35 rillig s->buf[s->total_len] = c;
75 1.35 rillig s->total_len++;
76 1.35 rillig }
77 1.35 rillig
78 1.37 rillig static int
79 1.37 rillig store_num(state *s, const char *fmt, uintmax_t num)
80 1.35 rillig {
81 1.37 rillig int num_len = s->total_len < s->bufsize
82 1.37 rillig ? snprintf(s->buf + s->total_len, s->bufsize - s->total_len,
83 1.37 rillig fmt, num)
84 1.37 rillig : snprintf(NULL, 0, fmt, num);
85 1.37 rillig if (num_len > 0)
86 1.37 rillig s->total_len += num_len;
87 1.37 rillig return num_len;
88 1.35 rillig }
89 1.35 rillig
90 1.35 rillig static void
91 1.41 rillig store_eol(state *s)
92 1.35 rillig {
93 1.37 rillig if (s->total_len - s->line_pos > s->line_max) {
94 1.41 rillig s->total_len = s->line_pos + s->line_max - 1;
95 1.37 rillig store(s, '#');
96 1.35 rillig }
97 1.37 rillig store(s, '\0');
98 1.37 rillig s->line_pos = s->total_len;
99 1.37 rillig s->comma_pos = 0;
100 1.41 rillig s->in_angle_brackets = 0;
101 1.35 rillig }
102 1.35 rillig
103 1.35 rillig static void
104 1.41 rillig store_delimiter(state *s)
105 1.35 rillig {
106 1.41 rillig if (s->in_angle_brackets) {
107 1.37 rillig s->comma_pos = s->total_len;
108 1.37 rillig store(s, ',');
109 1.35 rillig } else {
110 1.37 rillig store(s, '<');
111 1.41 rillig s->in_angle_brackets = 1;
112 1.35 rillig }
113 1.35 rillig }
114 1.35 rillig
115 1.35 rillig static void
116 1.41 rillig maybe_wrap_line(state *s, const char *bitfmt)
117 1.35 rillig {
118 1.37 rillig if (s->line_max > 0
119 1.37 rillig && s->comma_pos > 0
120 1.37 rillig && s->total_len - s->line_pos >= s->line_max) {
121 1.37 rillig s->total_len = s->comma_pos;
122 1.37 rillig store(s, '>');
123 1.41 rillig store_eol(s);
124 1.37 rillig store_num(s, s->num_fmt, s->val);
125 1.37 rillig s->bitfmt = bitfmt;
126 1.35 rillig }
127 1.35 rillig }
128 1.35 rillig
129 1.35 rillig static int
130 1.35 rillig old_style(state *s)
131 1.35 rillig {
132 1.37 rillig while (*s->bitfmt != '\0') {
133 1.37 rillig const char *cur_bitfmt = s->bitfmt;
134 1.37 rillig uint8_t bit = *s->bitfmt;
135 1.37 rillig if (bit > ' ')
136 1.37 rillig return -1;
137 1.35 rillig if (s->val & (1U << (bit - 1))) {
138 1.41 rillig store_delimiter(s);
139 1.40 rillig while ((uint8_t)*++s->bitfmt > ' ')
140 1.37 rillig store(s, *s->bitfmt);
141 1.41 rillig maybe_wrap_line(s, cur_bitfmt);
142 1.35 rillig } else
143 1.40 rillig while ((uint8_t)*++s->bitfmt > ' ')
144 1.35 rillig continue;
145 1.35 rillig }
146 1.37 rillig return 0;
147 1.35 rillig }
148 1.35 rillig
149 1.35 rillig static int
150 1.35 rillig new_style(state *s)
151 1.35 rillig {
152 1.35 rillig uint64_t field = s->val;
153 1.35 rillig int matched = 1;
154 1.37 rillig const char *prev_bitfmt = s->bitfmt;
155 1.35 rillig while (*s->bitfmt != '\0') {
156 1.37 rillig const char *cur_bitfmt = s->bitfmt;
157 1.38 rillig uint8_t kind = cur_bitfmt[0];
158 1.35 rillig switch (kind) {
159 1.35 rillig case 'b':
160 1.37 rillig prev_bitfmt = cur_bitfmt;
161 1.38 rillig uint8_t b_bit = cur_bitfmt[1];
162 1.38 rillig if (b_bit >= 64)
163 1.38 rillig return -1;
164 1.38 rillig s->bitfmt += 2;
165 1.38 rillig if (((s->val >> b_bit) & 1) == 0)
166 1.37 rillig goto skip_description;
167 1.41 rillig store_delimiter(s);
168 1.37 rillig while (*s->bitfmt++ != '\0')
169 1.37 rillig store(s, s->bitfmt[-1]);
170 1.41 rillig maybe_wrap_line(s, cur_bitfmt);
171 1.35 rillig break;
172 1.35 rillig case 'f':
173 1.35 rillig case 'F':
174 1.37 rillig prev_bitfmt = cur_bitfmt;
175 1.35 rillig matched = 0;
176 1.38 rillig uint8_t f_lsb = cur_bitfmt[1];
177 1.38 rillig if (f_lsb >= 64)
178 1.38 rillig return -1;
179 1.38 rillig uint8_t f_width = cur_bitfmt[2];
180 1.38 rillig if (f_width > 64)
181 1.38 rillig return -1;
182 1.38 rillig field = s->val >> f_lsb;
183 1.38 rillig if (f_width < 64)
184 1.38 rillig field &= ((uint64_t) 1 << f_width) - 1;
185 1.38 rillig s->bitfmt += 3;
186 1.41 rillig store_delimiter(s);
187 1.35 rillig if (kind == 'F')
188 1.37 rillig goto skip_description;
189 1.37 rillig while (*s->bitfmt++ != '\0')
190 1.37 rillig store(s, s->bitfmt[-1]);
191 1.37 rillig store(s, '=');
192 1.37 rillig store_num(s, s->num_fmt, field);
193 1.41 rillig maybe_wrap_line(s, cur_bitfmt);
194 1.35 rillig break;
195 1.35 rillig case '=':
196 1.35 rillig case ':':
197 1.38 rillig s->bitfmt += 2;
198 1.38 rillig uint8_t cmp = cur_bitfmt[1];
199 1.38 rillig if (field != cmp)
200 1.37 rillig goto skip_description;
201 1.35 rillig matched = 1;
202 1.35 rillig if (kind == '=')
203 1.37 rillig store(s, '=');
204 1.37 rillig while (*s->bitfmt++ != '\0')
205 1.37 rillig store(s, s->bitfmt[-1]);
206 1.41 rillig maybe_wrap_line(s, prev_bitfmt);
207 1.35 rillig break;
208 1.35 rillig case '*':
209 1.38 rillig s->bitfmt++;
210 1.37 rillig if (matched)
211 1.37 rillig goto skip_description;
212 1.37 rillig matched = 1;
213 1.37 rillig if (store_num(s, s->bitfmt, field) < 0)
214 1.37 rillig return -1;
215 1.41 rillig maybe_wrap_line(s, prev_bitfmt);
216 1.39 rillig goto skip_description;
217 1.35 rillig default:
218 1.38 rillig s->bitfmt += 2;
219 1.37 rillig skip_description:
220 1.35 rillig while (*s->bitfmt++ != '\0')
221 1.35 rillig continue;
222 1.35 rillig break;
223 1.35 rillig }
224 1.35 rillig }
225 1.35 rillig return 0;
226 1.35 rillig }
227 1.35 rillig
228 1.39 rillig static void
229 1.39 rillig finish_buffer(state *s)
230 1.39 rillig {
231 1.39 rillig if (s->line_max > 0) {
232 1.41 rillig store_eol(s);
233 1.39 rillig if (s->bufsize >= 2 && s->total_len > s->bufsize - 2)
234 1.39 rillig s->buf[s->bufsize - 2] = '\0';
235 1.39 rillig }
236 1.39 rillig store(s, '\0');
237 1.39 rillig if (s->bufsize >= 1 && s->total_len > s->bufsize - 1)
238 1.39 rillig s->buf[s->bufsize - 1] = '\0';
239 1.39 rillig }
240 1.39 rillig
241 1.1 christos int
242 1.24 rillig snprintb_m(char *buf, size_t bufsize, const char *bitfmt, uint64_t val,
243 1.27 rillig size_t line_max)
244 1.1 christos {
245 1.1 christos #ifdef _KERNEL
246 1.1 christos /*
247 1.1 christos * For safety; no other *s*printf() do this, but in the kernel
248 1.41 rillig * we don't usually check the return value.
249 1.1 christos */
250 1.39 rillig if (bufsize > 0)
251 1.39 rillig (void)memset(buf, 0, bufsize);
252 1.1 christos #endif /* _KERNEL */
253 1.1 christos
254 1.35 rillig int old = *bitfmt != '\177';
255 1.35 rillig if (!old)
256 1.28 rillig bitfmt++;
257 1.35 rillig
258 1.35 rillig const char *num_fmt;
259 1.28 rillig switch (*bitfmt++) {
260 1.1 christos case 8:
261 1.27 rillig num_fmt = "%#jo";
262 1.1 christos break;
263 1.1 christos case 10:
264 1.27 rillig num_fmt = "%ju";
265 1.1 christos break;
266 1.1 christos case 16:
267 1.27 rillig num_fmt = "%#jx";
268 1.1 christos break;
269 1.1 christos default:
270 1.39 rillig num_fmt = NULL;
271 1.1 christos }
272 1.1 christos
273 1.35 rillig state s = {
274 1.35 rillig .buf = buf,
275 1.35 rillig .bufsize = bufsize,
276 1.35 rillig .bitfmt = bitfmt,
277 1.35 rillig .val = val,
278 1.35 rillig .line_max = line_max,
279 1.35 rillig .num_fmt = num_fmt,
280 1.35 rillig };
281 1.39 rillig if (num_fmt == NULL)
282 1.39 rillig goto internal;
283 1.39 rillig
284 1.39 rillig store_num(&s, num_fmt, val);
285 1.35 rillig
286 1.37 rillig if ((old ? old_style(&s) : new_style(&s)) < 0)
287 1.35 rillig goto internal;
288 1.5 pgoyette
289 1.41 rillig if (s.in_angle_brackets)
290 1.35 rillig store(&s, '>');
291 1.39 rillig finish_buffer(&s);
292 1.35 rillig return (int)(s.total_len - 1);
293 1.1 christos internal:
294 1.1 christos #ifndef _KERNEL
295 1.1 christos errno = EINVAL;
296 1.1 christos #endif
297 1.39 rillig store(&s, '#');
298 1.39 rillig finish_buffer(&s);
299 1.1 christos return -1;
300 1.1 christos }
301 1.5 pgoyette
302 1.5 pgoyette int
303 1.24 rillig snprintb(char *buf, size_t bufsize, const char *bitfmt, uint64_t val)
304 1.5 pgoyette {
305 1.24 rillig return snprintb_m(buf, bufsize, bitfmt, val, 0);
306 1.5 pgoyette }
307 1.9 apb # endif /* ! HAVE_SNPRINTB_M */
308 1.9 apb #endif /* ! _STANDALONE */
309