3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#) Copyright (c) 1993 The Regents of the University of California. All rights reserved.
34 * @(#)jot.c 8.1 (Berkeley) 6/6/93
35 * $FreeBSD: src/usr.bin/jot/jot.c,v 1.13.2.3 2001/12/17 13:49:50 gallatin Exp $
36 * $DragonFly: src/usr.bin/jot/jot.c,v 1.2 2003/06/17 04:29:27 dillon Exp $
40 * jot - print sequential or random data
42 * Author: John Kunze, Office of Comp. Affairs, UCB
59 #define is_default(s) (strcmp((s), "-") == 0)
74 const char *sepstring = "\n";
77 int main __P((int, char *[]));
78 void getformat __P((void));
79 int getprec __P((char *));
80 int putdata __P((double, long));
81 static void usage __P((void));
93 unsigned int mask = 0;
97 while ((ch = getopt(argc, argv, "rb:w:cs:np:")) != -1)
112 if (strlcpy(format, optarg, sizeof(format)) >=
114 errx(1, "-%c word too long", ch);
122 errx(1, "bad precision value");
130 switch (argc) { /* examine args right to left, falling thru cases */
132 if (!is_default(argv[3])) {
133 if (!sscanf(argv[3], "%lf", &s))
134 errx(1, "bad s value: %s", argv[3]);
138 if (!is_default(argv[2])) {
139 if (!sscanf(argv[2], "%lf", &ender))
140 ender = argv[2][strlen(argv[2])-1];
143 n = getprec(argv[2]);
146 if (!is_default(argv[1])) {
147 if (!sscanf(argv[1], "%lf", &begin))
148 begin = argv[1][strlen(argv[1])-1];
151 prec = getprec(argv[1]);
152 if (n > prec) /* maximum precision */
156 if (!is_default(argv[0])) {
157 if (!sscanf(argv[0], "%ld", &reps))
158 errx(1, "bad reps value: %s", argv[0]);
165 errx(1, "too many arguments. What do you mean by %s?",
169 while (mask) /* 4 bit mask has 1's where last 4 args were given */
170 switch (mask) { /* fill in the 0's by default or computation */
206 reps = (ender - begin + s) / s;
208 errx(1, "impossible stepsize");
220 s = (randomize ? time(NULL) : STEP_DEF);
227 errx(1, "must specify begin if reps == 0");
228 begin = ender - reps * s + s;
232 s = (randomize ? -1.0 : STEP_DEF);
239 ender = begin + reps * s - s;
246 errx(1, "infinite sequences cannot be bounded");
250 s = (ender - begin) / (reps - 1);
253 case 017: /* if reps given and implied, */
254 if (!randomize && s != 0.0) {
255 long t = (ender - begin + s) / s;
257 errx(1, "impossible stepsize");
258 if (t < reps) /* take lesser */
269 *x = (ender - begin) * (ender > begin ? 1 : -1);
270 for (*i = 1; *i <= reps || infinity; (*i)++) {
271 *y = arc4random() / (double)0xffffffffU;
272 if (putdata(*y * *x + begin, reps - *i))
273 errx(1, "range error in conversion");
276 for (*i = 1, *x = begin; *i <= reps || infinity; (*i)++, *x += s)
277 if (putdata(*x, reps - *i))
278 errx(1, "range error in conversion");
291 printf("%s", format);
292 else if (longdata && nosign) {
293 if (x <= (double)ULONG_MAX && x >= (double)0)
294 printf(format, (unsigned long)x);
297 } else if (longdata) {
298 if (x <= (double)LONG_MAX && x >= (double)LONG_MIN)
299 printf(format, (long)x);
302 } else if (chardata || (intdata && !nosign)) {
303 if (x <= (double)INT_MAX && x >= (double)INT_MIN)
304 printf(format, (int)x);
307 } else if (intdata) {
308 if (x <= (double)UINT_MAX && x >= (double)0)
309 printf(format, (unsigned int)x);
316 fputs(sepstring, stdout);
324 fprintf(stderr, "%s\n%s\n",
325 "usage: jot [-cnr] [-b word] [-w word] [-s string] [-p precision]",
326 " [reps [begin [end [s]]]]");
337 for (p = str; *p; p++)
342 for (q = ++p; *p; p++)
352 int dot, hash, space, sign, numbers = 0;
355 if (boring) /* no need to bother */
357 for (p = format; *p; p++) /* look for '%' */
358 if (*p == '%' && *(p+1) != '%') /* leave %% alone */
360 sz = sizeof(format) - strlen(format) - 1;
361 if (!*p && !chardata) {
362 if (snprintf(p, sz, "%%.%df", prec) >= (int)sz)
363 errx(1, "-w word too long");
364 } else if (!*p && chardata) {
365 if (strlcpy(p, "%c", sz) >= sz)
366 errx(1, "-w word too long");
368 } else if (!*(p+1)) {
370 errx(1, "-w word too long");
371 strcat(format, "%"); /* cannot end in single '%' */
374 * Allow conversion format specifiers of the form
375 * %[#][ ][{+,-}][0-9]*[.[0-9]*]? where ? must be one of
376 * [l]{d,i,o,u,x} or {f,e,g,E,G,d,o,x,D,O,U,X,c,u}
379 dot = hash = space = sign = numbers = 0;
380 while (!isalpha(*p)) {
384 } else if ((*p == '#' && !(numbers|dot|sign|space|
386 (*p == ' ' && !(numbers|dot|space++)) ||
387 ((*p == '+' || *p == '-') && !(numbers|dot|sign++))
388 || (*p == '.' && !(dot++)))
402 case 'o': case 'u': case 'x': case 'X':
403 intdata = nosign = 1;
415 intdata = nosign = 1;
419 if (!(intdata | longdata)) {
423 case 'h': case 'n': case 'p': case 'q': case 's': case 'L':
426 case 'f': case 'e': case 'g': case 'E': case 'G':
433 errx(1, "illegal or unsupported format '%s'", p2);
437 if (*p == '%' && *(p+1) && *(p+1) != '%')
438 errx(1, "too many conversions");
439 else if (*p == '%' && *(p+1) == '%')
441 else if (*p == '%' && !*(p+1)) {