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