1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
|
/* $OpenBSD: jot.c,v 1.49 2019/06/27 18:03:36 deraadt Exp $ */
/* $NetBSD: jot.c,v 1.3 1994/12/02 20:29:43 pk Exp $ */
/*-
* Copyright (c) 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*
* jot - print sequential or random data
*
* Author: John Kunze, Office of Comp. Affairs, UCB
*/
#include <ctype.h>
#include <err.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#define REPS 1
#define BEGIN 2
#define ENDER 4
#define STEP 8
#define is_default(s) (strcmp((s), "-") == 0)
static long reps = 100;
static double begin = 1;
static double ender = 100;
static double step = 1;
static char *format = "";
static char *sepstring = "\n";
static int prec = -1;
static bool boring;
static bool chardata;
static bool finalnl = true;
static bool infinity;
static bool intdata;
static bool longdata;
static bool nosign;
static bool randomize;
static void getformat(void);
static int getprec(char *);
static int putdata(double, bool);
static void __dead usage(void);
int
main(int argc, char *argv[])
{
double x;
double y;
long i;
unsigned int mask = 0;
int n = 0;
int ch;
const char *errstr;
if (pledge("stdio", NULL) == -1)
err(1, "pledge");
while ((ch = getopt(argc, argv, "b:cnp:rs:w:")) != -1) {
switch (ch) {
case 'b':
boring = true;
format = optarg;
break;
case 'c':
chardata = true;
break;
case 'n':
finalnl = false;
break;
case 'p':
prec = strtonum(optarg, 0, INT_MAX, &errstr);
if (errstr != NULL)
errx(1, "bad precision value, %s: %s", errstr,
optarg);
break;
case 'r':
randomize = true;
break;
case 's':
sepstring = optarg;
break;
case 'w':
format = optarg;
break;
default:
usage();
}
}
argc -= optind;
argv += optind;
switch (argc) { /* examine args right to left, falling thru cases */
case 4:
if (!is_default(argv[3])) {
if (!sscanf(argv[3], "%lf", &step))
errx(1, "Bad s value: %s", argv[3]);
mask |= STEP;
if (randomize)
warnx("random seeding not supported");
}
case 3:
if (!is_default(argv[2])) {
if (!sscanf(argv[2], "%lf", &ender))
ender = argv[2][strlen(argv[2])-1];
mask |= ENDER;
if (prec == -1)
n = getprec(argv[2]);
}
case 2:
if (!is_default(argv[1])) {
if (!sscanf(argv[1], "%lf", &begin))
begin = argv[1][strlen(argv[1])-1];
mask |= BEGIN;
if (prec == -1)
prec = getprec(argv[1]);
if (n > prec) /* maximum precision */
prec = n;
}
case 1:
if (!is_default(argv[0])) {
reps = strtonum(argv[0], 0, LONG_MAX, &errstr);
if (errstr != NULL)
errx(1, "Bad reps value, %s: %s", errstr,
argv[0]);
mask |= REPS;
if (reps == 0)
infinity = true;
if (prec == -1)
prec = 0;
}
case 0:
break;
default:
errx(1, "Too many arguments. What do you mean by %s?",
argv[4]);
}
if (!boring)
getformat();
if (!randomize) {
/*
* Consolidate the values of reps, begin, ender, step:
* The formula ender - begin == (reps - 1) * step shows that any
* three determine the fourth (unless reps == 1 or step == 0).
* The manual states the following rules:
* 1. If four are specified, compare the given and the computed
* value of reps and take the smaller of the two.
* 2. If steps was omitted, it takes the default, unless both
* begin and ender were specified.
* 3. Assign defaults to omitted values for reps, begin, ender,
* from left to right.
*/
switch (mask) { /* Four cases involve both begin and ender. */
case REPS | BEGIN | ENDER | STEP:
if (infinity)
errx(1,
"Can't specify end of infinite sequence");
if (step != 0.0) {
long t = (ender - begin + step) / step;
if (t <= 0)
errx(1, "Impossible stepsize");
if (t < reps)
reps = t;
}
break;
case REPS | BEGIN | ENDER:
if (infinity)
errx(1,
"Can't specify end of infinite sequence");
if (reps == 1)
step = 0.0;
else
step = (ender - begin) / (reps - 1);
break;
case BEGIN | ENDER:
step = ender > begin ? 1 : -1; /* FreeBSD's behavior. */
/* FALLTHROUGH */
case BEGIN | ENDER | STEP:
if (step == 0.0) {
reps = 0;
infinity = true;
break;
}
reps = (ender - begin + step) / step;
if (reps <= 0)
errx(1, "Impossible stepsize");
break;
case ENDER: /* Four cases involve only ender. */
case ENDER | STEP:
case REPS | ENDER:
case REPS | ENDER | STEP:
if (infinity)
errx(1,
"Must specify start of infinite sequence");
begin = ender - reps * step + step;
break;
default:
/*
* The remaining eight cases omit ender. We don't need
* to compute anything because only reps, begin, step
* are used for producing output below. Rules 2. and 3.
* together imply that ender will be set last.
*/
break;
}
for (i = 1, x = begin; i <= reps || infinity; i++, x += step)
if (putdata(x, reps == i && !infinity))
errx(1, "range error in conversion: %f", x);
} else { /* Random output: use defaults for omitted values. */
bool use_unif;
uint32_t pow10 = 1;
uint32_t uintx = 0; /* Initialized to make gcc happy. */
if (prec > 9) /* pow(10, prec) > UINT32_MAX */
errx(1, "requested precision too large");
if (ender < begin) {
x = begin;
begin = ender;
ender = x;
}
x = ender - begin;
if (prec == 0 && (fmod(ender, 1) != 0 || fmod(begin, 1) != 0))
use_unif = 0;
else {
while (prec-- > 0)
pow10 *= 10;
/*
* If pow10 * (ender - begin) is an integer, use
* arc4random_uniform().
*/
use_unif = fmod(pow10 * (ender - begin), 1) == 0;
if (use_unif) {
uintx = pow10 * (ender - begin);
if (uintx >= UINT32_MAX)
errx(1, "requested range too large");
uintx++;
}
}
for (i = 1; i <= reps || infinity; i++) {
double v;
if (use_unif) {
y = arc4random_uniform(uintx) / (double)pow10;
v = y + begin;
} else {
y = arc4random() / ((double)0xffffffff + 1);
v = y * x + begin;
}
if (putdata(v, reps == i && !infinity))
errx(1, "range error in conversion: %f", v);
}
}
if (finalnl)
putchar('\n');
return 0;
}
static int
putdata(double x, bool last)
{
if (boring)
printf("%s", format);
else if (longdata && nosign) {
if (x <= (double)ULONG_MAX && x >= 0.0)
printf(format, (unsigned long)x);
else
return 1;
} else if (longdata) {
if (x <= (double)LONG_MAX && x >= (double)LONG_MIN)
printf(format, (long)x);
else
return 1;
} else if (chardata || (intdata && !nosign)) {
if (x <= (double)INT_MAX && x >= (double)INT_MIN)
printf(format, (int)x);
else
return 1;
} else if (intdata) {
if (x <= (double)UINT_MAX && x >= 0.0)
printf(format, (unsigned int)x);
else
return 1;
} else
printf(format, x);
if (!last)
fputs(sepstring, stdout);
return 0;
}
static void __dead
usage(void)
{
(void)fprintf(stderr, "usage: jot [-cnr] [-b word] [-p precision] "
"[-s string] [-w word]\n"
" [reps [begin [end [s]]]]\n");
exit(1);
}
static int
getprec(char *s)
{
if ((s = strchr(s, '.')) == NULL)
return 0;
return strspn(s + 1, "0123456789");
}
static void
getformat(void)
{
char *p;
p = format;
while ((p = strchr(p, '%')) != NULL && p[1] == '%')
p += 2;
if (p == NULL && !chardata) {
if (asprintf(&format, "%s%%.%df", format, prec) == -1)
err(1, NULL);
} else if (p == NULL && chardata) {
if (asprintf(&format, "%s%%c", format) == -1)
err(1, NULL);
} else if (p[1] == '\0') {
/* cannot end in single '%' */
if (asprintf(&format, "%s%%", format) == -1)
err(1, NULL);
} else {
/*
* Allow conversion format specifiers of the form
* %[#][ ][{+,-}][0-9]*[.[0-9]*]? where ? must be one of
* [l]{d,i,o,u,x} or {f,e,g,F,E,G,d,o,x,D,O,U,X,c,u}
*/
char *fmt;
int dot, hash, space, sign, numbers;
fmt = p++;
dot = hash = space = sign = numbers = 0;
while (!isalpha((unsigned char)*p)) {
if (isdigit((unsigned char)*p)) {
numbers++;
p++;
} else if ((*p == '#' && !(numbers|dot|sign|space|
hash++)) ||
(*p == ' ' && !(numbers|dot|space++)) ||
((*p == '+' || *p == '-') && !(numbers|dot|sign++))
|| (*p == '.' && !(dot++)))
p++;
else
goto fmt_broken;
}
if (*p == 'l') {
longdata = true;
if (*++p == 'l') {
p++;
goto fmt_broken;
}
}
switch (*p) {
case 'd':
case 'i':
intdata = true;
break;
case 'o':
case 'u':
case 'x':
case 'X':
intdata = nosign = true;
break;
case 'D':
if (longdata)
goto fmt_broken;
longdata = intdata = true; /* same as %ld */
break;
case 'O':
case 'U':
if (longdata)
goto fmt_broken;
longdata = intdata = nosign = true; /* same as %l[ou] */
break;
case 'c':
if (longdata)
goto fmt_broken;
chardata = true;
break;
case 'e':
case 'E':
case 'f':
case 'F':
case 'g':
case 'G':
if (longdata)
goto fmt_broken;
/* No cast needed for printing in putdata() */
break;
default:
fmt_broken:
errx(1, "illegal or unsupported format '%.*s'",
(int)(p + 1 - fmt), fmt);
}
while ((p = strchr(p, '%')) != NULL && p[1] == '%')
p += 2;
if (p != NULL) {
if (p[1] != '\0')
errx(1, "too many conversions");
/* cannot end in single '%' */
if (asprintf(&format, "%s%%", format) == -1)
err(1, NULL);
}
}
}
|