Annotation of src/usr.bin/jot/jot.c, Revision 1.5
1.5 ! deraadt 1: /* $OpenBSD: jot.c,v 1.4 1999/12/04 21:28:34 deraadt Exp $ */
1.1 deraadt 2: /* $NetBSD: jot.c,v 1.3 1994/12/02 20:29:43 pk Exp $ */
3:
4: /*-
5: * Copyright (c) 1993
6: * The Regents of the University of California. All rights reserved.
7: *
8: * Redistribution and use in source and binary forms, with or without
9: * modification, are permitted provided that the following conditions
10: * are met:
11: * 1. Redistributions of source code must retain the above copyright
12: * notice, this list of conditions and the following disclaimer.
13: * 2. Redistributions in binary form must reproduce the above copyright
14: * notice, this list of conditions and the following disclaimer in the
15: * documentation and/or other materials provided with the distribution.
16: * 3. All advertising materials mentioning features or use of this software
17: * must display the following acknowledgement:
18: * This product includes software developed by the University of
19: * California, Berkeley and its contributors.
20: * 4. Neither the name of the University nor the names of its contributors
21: * may be used to endorse or promote products derived from this software
22: * without specific prior written permission.
23: *
24: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34: * SUCH DAMAGE.
35: */
36:
37: #ifndef lint
38: static char copyright[] =
39: "@(#) Copyright (c) 1993\n\
40: The Regents of the University of California. All rights reserved.\n";
41: #endif /* not lint */
42:
43: #ifndef lint
44: #if 0
45: static char sccsid[] = "@(#)jot.c 8.1 (Berkeley) 6/6/93";
46: #endif
1.5 ! deraadt 47: static char rcsid[] = "$OpenBSD: jot.c,v 1.4 1999/12/04 21:28:34 deraadt Exp $";
1.1 deraadt 48: #endif /* not lint */
49:
50: /*
51: * jot - print sequential or random data
52: *
53: * Author: John Kunze, Office of Comp. Affairs, UCB
54: */
55:
56: #include <ctype.h>
57: #include <limits.h>
58: #include <stdio.h>
59: #include <stdlib.h>
60: #include <string.h>
61: #include <time.h>
62:
63: #define REPS_DEF 100
64: #define BEGIN_DEF 1
65: #define ENDER_DEF 100
66: #define STEP_DEF 1
67:
68: #define isdefault(s) (strcmp((s), "-") == 0)
69:
70: double begin;
71: double ender;
72: double s;
73: long reps;
74: int randomize;
75: int infinity;
76: int boring;
77: int prec;
78: int dox;
79: int chardata;
80: int nofinalnl;
81: char sepstring[BUFSIZ] = "\n";
82: char format[BUFSIZ];
83:
84: void error __P((char *, char *));
85: void getargs __P((int, char *[]));
86: void getformat __P((void));
87: int getprec __P((char *));
88: void putdata __P((double, long));
89:
90: int
91: main(argc, argv)
92: int argc;
93: char *argv[];
94: {
95: double xd, yd;
96: long id;
97: register double *x = &xd;
98: register double *y = &yd;
99: register long *i = &id;
100:
101: getargs(argc, argv);
102: if (randomize) {
103: *x = (ender - begin) * (ender > begin ? 1 : -1);
104: srandom((int) s);
105: for (*i = 1; *i <= reps || infinity; (*i)++) {
106: *y = (double) random() / INT_MAX;
107: putdata(*y * *x + begin, reps - *i);
108: }
109: }
110: else
111: for (*i = 1, *x = begin; *i <= reps || infinity; (*i)++, *x += s)
112: putdata(*x, reps - *i);
113: if (!nofinalnl)
114: putchar('\n');
115: exit(0);
116: }
117:
118: void
119: getargs(ac, av)
120: int ac;
121: char *av[];
122: {
123: register unsigned int mask = 0;
124: register int n = 0;
125:
126: while (--ac && **++av == '-' && !isdefault(*av))
127: switch ((*av)[1]) {
128: case 'r':
129: randomize = 1;
130: break;
131: case 'c':
132: chardata = 1;
133: break;
134: case 'n':
135: nofinalnl = 1;
136: break;
137: case 'b':
138: boring = 1;
139: case 'w':
1.5 ! deraadt 140: if ((*av)[2]) {
1.3 deraadt 141: if (strlcpy(format, *av + 2, sizeof(format)) >=
142: sizeof(format))
143: error("-w word too long", "");
1.5 ! deraadt 144: } else if (!--ac)
1.1 deraadt 145: error("Need context word after -w or -b", "");
1.5 ! deraadt 146: else {
1.4 deraadt 147: if (strlcpy(format, *++av, sizeof(format)) >=
148: sizeof(format))
149: error("-w word too long", "");
1.5 ! deraadt 150: }
1.1 deraadt 151: break;
152: case 's':
1.5 ! deraadt 153: if ((*av)[2]) {
1.3 deraadt 154: if (strlcpy(sepstring, *av + 2, sizeof(sepstring)) >=
155: sizeof(sepstring))
156: error("-s word too long", "");
1.5 ! deraadt 157: } else if (!--ac)
1.1 deraadt 158: error("Need string after -s", "");
1.5 ! deraadt 159: else {
1.4 deraadt 160: if (strlcpy(sepstring, *++av, sizeof(sepstring)) >=
161: sizeof(sepstring))
162: error("-s word too long", "");
1.5 ! deraadt 163: }
1.1 deraadt 164: break;
165: case 'p':
166: if ((*av)[2])
167: prec = atoi(*av + 2);
168: else if (!--ac)
169: error("Need number after -p", "");
170: else
171: prec = atoi(*++av);
172: if (prec <= 0)
173: error("Bad precision value", "");
174: break;
175: default:
176: error("Unknown option %s", *av);
177: }
178:
179: switch (ac) { /* examine args right to left, falling thru cases */
180: case 4:
181: if (!isdefault(av[3])) {
182: if (!sscanf(av[3], "%lf", &s))
183: error("Bad s value: %s", av[3]);
184: mask |= 01;
185: }
186: case 3:
187: if (!isdefault(av[2])) {
188: if (!sscanf(av[2], "%lf", &ender))
189: ender = av[2][strlen(av[2])-1];
190: mask |= 02;
191: if (!prec)
192: n = getprec(av[2]);
193: }
194: case 2:
195: if (!isdefault(av[1])) {
196: if (!sscanf(av[1], "%lf", &begin))
197: begin = av[1][strlen(av[1])-1];
198: mask |= 04;
199: if (!prec)
200: prec = getprec(av[1]);
201: if (n > prec) /* maximum precision */
202: prec = n;
203: }
204: case 1:
205: if (!isdefault(av[0])) {
206: if (!sscanf(av[0], "%ld", &reps))
207: error("Bad reps value: %s", av[0]);
208: mask |= 010;
209: }
210: break;
211: case 0:
212: error("jot - print sequential or random data", "");
213: default:
214: error("Too many arguments. What do you mean by %s?", av[4]);
215: }
216: getformat();
217: while (mask) /* 4 bit mask has 1's where last 4 args were given */
218: switch (mask) { /* fill in the 0's by default or computation */
219: case 001:
220: reps = REPS_DEF;
221: mask = 011;
222: break;
223: case 002:
224: reps = REPS_DEF;
225: mask = 012;
226: break;
227: case 003:
228: reps = REPS_DEF;
229: mask = 013;
230: break;
231: case 004:
232: reps = REPS_DEF;
233: mask = 014;
234: break;
235: case 005:
236: reps = REPS_DEF;
237: mask = 015;
238: break;
239: case 006:
240: reps = REPS_DEF;
241: mask = 016;
242: break;
243: case 007:
244: if (randomize) {
245: reps = REPS_DEF;
246: mask = 0;
247: break;
248: }
249: if (s == 0.0) {
250: reps = 0;
251: mask = 0;
252: break;
253: }
254: reps = (ender - begin + s) / s;
255: if (reps <= 0)
256: error("Impossible stepsize", "");
257: mask = 0;
258: break;
259: case 010:
260: begin = BEGIN_DEF;
261: mask = 014;
262: break;
263: case 011:
264: begin = BEGIN_DEF;
265: mask = 015;
266: break;
267: case 012:
268: s = (randomize ? time(0) : STEP_DEF);
269: mask = 013;
270: break;
271: case 013:
272: if (randomize)
273: begin = BEGIN_DEF;
274: else if (reps == 0)
275: error("Must specify begin if reps == 0", "");
276: begin = ender - reps * s + s;
277: mask = 0;
278: break;
279: case 014:
280: s = (randomize ? time(0) : STEP_DEF);
281: mask = 015;
282: break;
283: case 015:
284: if (randomize)
285: ender = ENDER_DEF;
286: else
287: ender = begin + reps * s - s;
288: mask = 0;
289: break;
290: case 016:
291: if (randomize)
292: s = time(0);
293: else if (reps == 0)
294: error("Infinite sequences cannot be bounded",
295: "");
296: else if (reps == 1)
297: s = 0.0;
298: else
299: s = (ender - begin) / (reps - 1);
300: mask = 0;
301: break;
302: case 017: /* if reps given and implied, */
303: if (!randomize && s != 0.0) {
304: long t = (ender - begin + s) / s;
305: if (t <= 0)
306: error("Impossible stepsize", "");
307: if (t < reps) /* take lesser */
308: reps = t;
309: }
310: mask = 0;
311: break;
312: default:
313: error("Bad mask", "");
314: }
315: if (reps == 0)
316: infinity = 1;
317: }
318:
319: void
320: putdata(x, notlast)
321: double x;
322: long notlast;
323: {
324: long d = x;
325: register long *dp = &d;
326:
327: if (boring) /* repeated word */
328: printf("%s", format);
329: else if (dox) /* scalar */
330: printf(format, *dp);
331: else /* real */
332: printf(format, x);
333: if (notlast != 0)
334: fputs(sepstring, stdout);
335: }
336:
337: void
338: error(msg, s)
339: char *msg, *s;
340: {
341: fprintf(stderr, "jot: ");
342: fprintf(stderr, msg, s);
343: fprintf(stderr,
344: "\nusage: jot [ options ] [ reps [ begin [ end [ s ] ] ] ]\n");
345: if (strncmp("jot - ", msg, 6) == 0)
346: fprintf(stderr, "Options:\n\t%s\t%s\t%s\t%s\t%s\t%s\t%s",
347: "-r random data\n",
348: "-c character data\n",
349: "-n no final newline\n",
350: "-b word repeated word\n",
351: "-w word context word\n",
352: "-s string data separator\n",
353: "-p precision number of characters\n");
354: exit(1);
355: }
356:
357: int
358: getprec(s)
359: char *s;
360: {
361: register char *p;
362: register char *q;
363:
364: for (p = s; *p; p++)
365: if (*p == '.')
366: break;
367: if (!*p)
368: return (0);
369: for (q = ++p; *p; p++)
370: if (!isdigit(*p))
371: break;
372: return (p - q);
373: }
374:
375: void
376: getformat()
377: {
378: register char *p;
379:
380: if (boring) /* no need to bother */
381: return;
382: for (p = format; *p; p++) /* look for '%' */
383: if (*p == '%' && *(p+1) != '%') /* leave %% alone */
384: break;
385: if (!*p && !chardata)
386: sprintf(p, "%%.%df", prec);
387: else if (!*p && chardata) {
388: strcpy(p, "%c");
389: dox = 1;
390: }
391: else if (!*(p+1))
392: strcat(format, "%"); /* cannot end in single '%' */
393: else {
394: while (!isalpha(*p))
395: p++;
396: switch (*p) {
397: case 'f': case 'e': case 'g': case '%':
398: break;
399: case 's':
400: error("Cannot convert numeric data to strings", "");
401: break;
402: /* case 'd': case 'o': case 'x': case 'D': case 'O': case 'X':
403: case 'c': case 'u': */
404: default:
405: dox = 1;
406: break;
407: }
408: }
409: }