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