GCC Code Coverage Report
Directory: ./ Exec Total Coverage
File: usr.bin/dc/inout.c Lines: 183 188 97.3 %
Date: 2017-11-13 Branches: 85 102 83.3 %

Line Branch Exec Source
1
/*	$OpenBSD: inout.c,v 1.20 2017/02/26 11:29:55 otto Exp $	*/
2
3
/*
4
 * Copyright (c) 2003, Otto Moerbeek <otto@drijf.net>
5
 *
6
 * Permission to use, copy, modify, and distribute this software for any
7
 * purpose with or without fee is hereby granted, provided that the above
8
 * copyright notice and this permission notice appear in all copies.
9
 *
10
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
11
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
12
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
13
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
14
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
16
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17
 */
18
19
#include <ctype.h>
20
#include <err.h>
21
#include <string.h>
22
23
#include "extern.h"
24
25
#define MAX_CHARS_PER_LINE 68
26
27
static int	lastchar;
28
static int	charcount;
29
30
static int	src_getcharstream(struct source *);
31
static void	src_ungetcharstream(struct source *);
32
static char	*src_getlinestream(struct source *);
33
static void	src_freestream(struct source *);
34
static int	src_getcharstring(struct source *);
35
static void	src_ungetcharstring(struct source *);
36
static char	*src_getlinestring(struct source *);
37
static void	src_freestring(struct source *);
38
static void	flushwrap(FILE *);
39
static void	putcharwrap(FILE *, int);
40
static void	printwrap(FILE *, const char *);
41
static char	*get_digit(u_long, int, u_int);
42
43
static struct vtable stream_vtable = {
44
	src_getcharstream,
45
	src_ungetcharstream,
46
	src_getlinestream,
47
	src_freestream
48
};
49
50
static struct vtable string_vtable = {
51
	src_getcharstring,
52
	src_ungetcharstring,
53
	src_getlinestring,
54
	src_freestring
55
};
56
57
void
58
src_setstream(struct source *src, FILE *stream)
59
{
60
270
	src->u.stream = stream;
61
135
	src->vtable = &stream_vtable;
62
135
}
63
64
void
65
src_setstring(struct source *src, char *p)
66
{
67
52230
	src->u.string.buf = (u_char *)p;
68
26115
	src->u.string.pos = 0;
69
26115
	src->vtable = &string_vtable;
70
26115
}
71
72
static int
73
src_getcharstream(struct source *src)
74
{
75

1639025
	return src->lastchar = getc(src->u.stream);
76
}
77
78
static void
79
src_ungetcharstream(struct source *src)
80
{
81
93040
	(void)ungetc(src->lastchar, src->u.stream);
82
46520
}
83
84
/* ARGSUSED */
85
static void
86
src_freestream(struct source *src)
87
{
88
}
89
90
static char *
91
src_getlinestream(struct source *src)
92
{
93
410
	char buf[BUFSIZ];
94
95
205
	if (fgets(buf, BUFSIZ, src->u.stream) == NULL)
96
		return bstrdup("");
97
205
	return bstrdup(buf);
98
205
}
99
100
static int
101
src_getcharstring(struct source *src)
102
{
103
2042200
	src->lastchar = src->u.string.buf[src->u.string.pos];
104
1021100
	if (src->lastchar == '\0')
105
36510
		return EOF;
106
	else {
107
984590
		src->u.string.pos++;
108
984590
		return src->lastchar;
109
	}
110
1021100
}
111
112
static void
113
src_ungetcharstring(struct source *src)
114
{
115
374470
	if (src->u.string.pos > 0) {
116
187235
		if (src->lastchar != '\0')
117
171730
			--src->u.string.pos;
118
	}
119
187235
}
120
121
static char *
122
src_getlinestring(struct source *src)
123
{
124
12940
	char buf[BUFSIZ];
125
	int ch, i;
126
127
	i = 0;
128
124840
	while (i < BUFSIZ-1) {
129
62420
		ch = src_getcharstring(src);
130
62420
		if (ch == EOF)
131
			break;
132
62420
		buf[i++] = ch;
133
62420
		if (ch == '\n')
134
			break;
135
	}
136
6470
	buf[i] = '\0';
137
12940
	return bstrdup(buf);
138
6470
}
139
140
static void
141
src_freestring(struct source *src)
142
{
143
52230
	free(src->u.string.buf);
144
26115
}
145
146
static void
147
flushwrap(FILE *f)
148
{
149
51020
	if (lastchar != -1)
150
51020
		(void)putc(lastchar, f);
151
25510
}
152
153
static void
154
putcharwrap(FILE *f, int ch)
155
{
156
329950
	if (charcount >= MAX_CHARS_PER_LINE) {
157
1055
		charcount = 0;
158
1055
		(void)fputs("\\\n", f);
159
1055
	}
160
164975
	if (lastchar != -1) {
161
139465
		charcount++;
162
278930
		(void)putc(lastchar, f);
163
	}
164
164975
	lastchar = ch;
165
164975
}
166
167
static void
168
printwrap(FILE *f, const char *p)
169
{
170
285180
	char	buf[12];
171
142590
	char	*q = buf;
172
173
142590
	(void)strlcpy(buf, p, sizeof(buf));
174
584640
	while (*q)
175
149730
		putcharwrap(f, *q++);
176
142590
}
177
178
struct number *
179
readnumber(struct source *src, u_int base)
180
{
181
	struct number	*n;
182
	int		ch;
183
	bool		sign = false;
184
	bool		dot = false;
185
	BN_ULONG	v;
186
	u_int		i;
187
188
193980
	n = new_number();
189
96990
	bn_check(BN_set_word(n->number, 0));
190
191
646140
	while ((ch = (*src->vtable->readchar)(src)) != EOF) {
192
193
328270
		if ('0' <= ch && ch <= '9')
194
220740
			v = ch - '0';
195
107530
		else if ('A' <= ch && ch <= 'F')
196
110
			v = ch - 'A' + 10;
197
107420
		else if (ch == '_') {
198
			sign = true;
199
175
			continue;
200
107245
		} else if (ch == '.') {
201
10285
			if (dot)
202
				break;
203
			dot = true;
204
10285
			continue;
205
		} else {
206
96960
			(*src->vtable->unreadchar)(src);
207
96960
			break;
208
		}
209
220850
		if (dot)
210
21080
			n->scale++;
211
212
220850
		bn_check(BN_mul_word(n->number, base));
213
214
#if 0
215
		/* work around a bug in BN_add_word: 0 += 0 is buggy.... */
216
		if (v > 0)
217
#endif
218
220850
			bn_check(BN_add_word(n->number, v));
219
	}
220
96990
	if (base != 10) {
221
370
		scale_number(n->number, n->scale);
222
1270
		for (i = 0; i < n->scale; i++)
223
265
			(void)BN_div_word(n->number, base);
224
	}
225
96990
	if (sign)
226
175
		negate(n);
227
96990
	return n;
228
}
229
230
char *
231
read_string(struct source *src)
232
{
233
	int count, i, sz, new_sz, ch;
234
	char *p;
235
	bool escape;
236
237
	escape = false;
238
	count = 1;
239
	i = 0;
240
	sz = 15;
241
6540
	p = bmalloc(sz + 1);
242
243
76180
	while ((ch = (*src->vtable->readchar)(src)) != EOF) {
244
38090
		if (!escape) {
245
38085
			if (ch == '[')
246
430
				count++;
247
37655
			else if (ch == ']')
248
3700
				count--;
249
38085
			if (count == 0)
250
				break;
251
		}
252

34825
		if (ch == '\\' && !escape)
253
5
			escape = true;
254
		else {
255
			escape = false;
256
34815
			if (i == sz) {
257
785
				new_sz = sz * 2;
258
785
				p = breallocarray(p, 1, new_sz + 1);
259
				sz = new_sz;
260
785
			}
261
34815
			p[i++] = ch;
262
		}
263
	}
264
3270
	p[i] = '\0';
265
3270
	return p;
266
}
267
268
static char *
269
get_digit(u_long num, int digits, u_int base)
270
{
271
285180
	char *p;
272
273
142590
	if (base <= 16) {
274
138460
		p = bmalloc(2);
275
138460
		p[0] = num >= 10 ? num + 'A' - 10 : num + '0';
276
138460
		p[1] = '\0';
277
138460
	} else {
278
4130
		if (asprintf(&p, "%0*lu", digits, num) == -1)
279
			err(1, NULL);
280
	}
281
285180
	return p;
282
142590
}
283
284
void
285
printnumber(FILE *f, const struct number *b, u_int base)
286
{
287
	struct number	*int_part, *fract_part;
288
	int		digits;
289
51020
	char		buf[11];
290
	size_t		sz;
291
	int		i;
292
25510
	struct stack	stack;
293
	char		*p;
294
295
25510
	charcount = 0;
296
25510
	lastchar = -1;
297
25510
	if (BN_is_zero(b->number))
298
160
		putcharwrap(f, '0');
299
300
25510
	int_part = new_number();
301
25510
	fract_part = new_number();
302
25510
	fract_part->scale = b->scale;
303
304
25510
	if (base <= 16)
305
24830
		digits = 1;
306
	else {
307
680
		digits = snprintf(buf, sizeof(buf), "%u", base-1);
308
	}
309
25510
	split_number(b, int_part->number, fract_part->number);
310
311
	i = 0;
312
25510
	stack_init(&stack);
313
287180
	while (!BN_is_zero(int_part->number)) {
314
118080
		BN_ULONG rem = BN_div_word(int_part->number, base);
315
118080
		stack_pushstring(&stack, get_digit(rem, digits, base));
316
118080
		i++;
317
	}
318
25510
	sz = i;
319
25510
	if (BN_is_negative(b->number))
320
525
		putcharwrap(f, '-');
321
287180
	for (i = 0; i < sz; i++) {
322
118080
		p = stack_popstring(&stack);
323
118080
		if (base > 16)
324
3940
			putcharwrap(f, ' ');
325
118080
		printwrap(f, p);
326
118080
		free(p);
327
	}
328
25510
	stack_clear(&stack);
329
25510
	if (b->scale > 0) {
330
		struct number	*num_base;
331
10590
		BIGNUM		mult, stop;
332
333
10590
		putcharwrap(f, '.');
334
10590
		num_base = new_number();
335
10590
		bn_check(BN_set_word(num_base->number, base));
336
10590
		BN_init(&mult);
337
10590
		bn_check(BN_one(&mult));
338
10590
		BN_init(&stop);
339
10590
		bn_check(BN_one(&stop));
340
10590
		scale_number(&stop, b->scale);
341
342
		i = 0;
343
70200
		while (BN_cmp(&mult, &stop) < 0) {
344
			u_long	rem;
345
346
24510
			if (i && base > 16)
347
30
				putcharwrap(f, ' ');
348
			i = 1;
349
350
24510
			bmul_number(fract_part, fract_part, num_base,
351
24510
			    bmachine_scale());
352
24510
			split_number(fract_part, int_part->number, NULL);
353
24510
			rem = BN_get_word(int_part->number);
354
24510
			p = get_digit(rem, digits, base);
355
24510
			int_part->scale = 0;
356
24510
			normalize(int_part, fract_part->scale);
357
49020
			bn_check(BN_sub(fract_part->number, fract_part->number,
358
24510
			    int_part->number));
359
24510
			printwrap(f, p);
360
24510
			free(p);
361
24510
			bn_check(BN_mul_word(&mult, base));
362
		}
363
10590
		free_number(num_base);
364
10590
		BN_free(&mult);
365
10590
		BN_free(&stop);
366
10590
	}
367
25510
	flushwrap(f);
368
25510
	free_number(int_part);
369
25510
	free_number(fract_part);
370
25510
}
371
372
void
373
print_value(FILE *f, const struct value *value, const char *prefix, u_int base)
374
{
375
78930
	(void)fputs(prefix, f);
376

52620
	switch (value->type) {
377
	case BCODE_NONE:
378
		if (value->array != NULL)
379
			(void)fputs("<array>", f);
380
		break;
381
	case BCODE_NUMBER:
382
25510
		printnumber(f, value->u.num, base);
383
25510
		break;
384
	case BCODE_STRING:
385
800
		(void)fputs(value->u.string, f);
386
800
		break;
387
	}
388
26310
}
389
390
void
391
print_ascii(FILE *f, const struct number *n)
392
{
393
	BIGNUM *v;
394
	int numbits, i, ch;
395
396
19750
	v = BN_dup(n->number);
397
9875
	bn_checkp(v);
398
399
9875
	if (BN_is_negative(v))
400
		BN_set_negative(v, 0);
401
402
9875
	numbits = BN_num_bytes(v) * 8;
403
39490
	while (numbits > 0) {
404
		ch = 0;
405
177660
		for (i = 0; i < 8; i++)
406
78960
			ch |= BN_is_bit_set(v, numbits-i-1) << (7 - i);
407
19740
		(void)putc(ch, f);
408
9870
		numbits -= 8;
409
	}
410
9875
	BN_free(v);
411
9875
}