jot.c revision 1.20 1 1.20 dsl /* $NetBSD: jot.c,v 1.20 2008/02/27 22:47:32 dsl 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.20 dsl __RCSID("$NetBSD: jot.c,v 1.20 2008/02/27 22:47:32 dsl 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.14 garbled #include <math.h>
55 1.1 jtc #include <stdio.h>
56 1.1 jtc #include <stdlib.h>
57 1.1 jtc #include <string.h>
58 1.1 jtc #include <time.h>
59 1.9 atatat #include <unistd.h>
60 1.1 jtc
61 1.1 jtc #define REPS_DEF 100
62 1.1 jtc #define BEGIN_DEF 1
63 1.1 jtc #define ENDER_DEF 100
64 1.1 jtc #define STEP_DEF 1
65 1.1 jtc
66 1.7 jdolecek #define is_default(s) (strcmp((s), "-") == 0)
67 1.1 jtc
68 1.1 jtc double begin;
69 1.1 jtc double ender;
70 1.18 dsl double step;
71 1.1 jtc long reps;
72 1.1 jtc int randomize;
73 1.1 jtc int infinity;
74 1.1 jtc int boring;
75 1.18 dsl int prec = -1;
76 1.1 jtc int dox;
77 1.1 jtc int chardata;
78 1.1 jtc int nofinalnl;
79 1.20 dsl const char *sepstring = "\n";
80 1.1 jtc char format[BUFSIZ];
81 1.1 jtc
82 1.20 dsl static void getargs(int, char *[]);
83 1.20 dsl static void getformat(void);
84 1.20 dsl static int getprec(char *);
85 1.20 dsl static void putdata(double, long);
86 1.20 dsl static void usage(void) __dead;
87 1.1 jtc
88 1.1 jtc int
89 1.13 perry main(int argc, char *argv[])
90 1.1 jtc {
91 1.16 dsl double x, y;
92 1.16 dsl long i;
93 1.1 jtc
94 1.1 jtc getargs(argc, argv);
95 1.1 jtc if (randomize) {
96 1.17 dsl x = (ender + dox - begin) * (ender > begin ? 1 : -1);
97 1.18 dsl srandom((unsigned long) step);
98 1.16 dsl for (i = 1; i <= reps || infinity; i++) {
99 1.16 dsl y = (double) random() / INT_MAX;
100 1.16 dsl putdata(y * x + begin, reps - i);
101 1.16 dsl }
102 1.20 dsl } else {
103 1.18 dsl for (i = 1, x = begin; i <= reps || infinity; i++, x += step)
104 1.16 dsl putdata(x, reps - i);
105 1.20 dsl }
106 1.1 jtc if (!nofinalnl)
107 1.1 jtc putchar('\n');
108 1.1 jtc exit(0);
109 1.1 jtc }
110 1.1 jtc
111 1.20 dsl static void
112 1.13 perry getargs(int argc, char *argv[])
113 1.1 jtc {
114 1.4 lukem unsigned int mask = 0;
115 1.4 lukem int n = 0;
116 1.20 dsl char *ep;
117 1.1 jtc
118 1.20 dsl for (;;) {
119 1.20 dsl switch (getopt(argc, argv, "b:cnp:rs:w:")) {
120 1.20 dsl default:
121 1.20 dsl usage();
122 1.20 dsl case -1:
123 1.1 jtc break;
124 1.1 jtc case 'c':
125 1.1 jtc chardata = 1;
126 1.20 dsl continue;
127 1.1 jtc case 'n':
128 1.1 jtc nofinalnl = 1;
129 1.20 dsl continue;
130 1.20 dsl case 'p':
131 1.20 dsl prec = strtol(optarg, &ep, 0);
132 1.20 dsl if (*ep != 0 || prec < 0)
133 1.20 dsl errx(EXIT_FAILURE, "Bad precision value");
134 1.20 dsl continue;
135 1.20 dsl case 'r':
136 1.20 dsl randomize = 1;
137 1.20 dsl continue;
138 1.20 dsl case 's':
139 1.20 dsl sepstring = optarg;
140 1.20 dsl continue;
141 1.1 jtc case 'b':
142 1.1 jtc boring = 1;
143 1.20 dsl /* FALLTHROUGH */
144 1.1 jtc case 'w':
145 1.20 dsl strlcpy(format, optarg, sizeof(format));
146 1.20 dsl continue;
147 1.1 jtc }
148 1.20 dsl break;
149 1.16 dsl }
150 1.20 dsl argc -= optind;
151 1.20 dsl argv += optind;
152 1.1 jtc
153 1.7 jdolecek switch (argc) { /* examine args right to left, falling thru cases */
154 1.1 jtc case 4:
155 1.7 jdolecek if (!is_default(argv[3])) {
156 1.18 dsl if (!sscanf(argv[3], "%lf", &step))
157 1.20 dsl errx(EXIT_FAILURE, "Bad step value: %s",
158 1.20 dsl argv[3]);
159 1.1 jtc mask |= 01;
160 1.1 jtc }
161 1.1 jtc case 3:
162 1.7 jdolecek if (!is_default(argv[2])) {
163 1.7 jdolecek if (!sscanf(argv[2], "%lf", &ender))
164 1.7 jdolecek ender = argv[2][strlen(argv[2])-1];
165 1.1 jtc mask |= 02;
166 1.18 dsl if (prec < 0)
167 1.7 jdolecek n = getprec(argv[2]);
168 1.1 jtc }
169 1.1 jtc case 2:
170 1.7 jdolecek if (!is_default(argv[1])) {
171 1.7 jdolecek if (!sscanf(argv[1], "%lf", &begin))
172 1.7 jdolecek begin = argv[1][strlen(argv[1])-1];
173 1.1 jtc mask |= 04;
174 1.18 dsl if (prec < 0)
175 1.7 jdolecek prec = getprec(argv[1]);
176 1.1 jtc if (n > prec) /* maximum precision */
177 1.1 jtc prec = n;
178 1.1 jtc }
179 1.1 jtc case 1:
180 1.7 jdolecek if (!is_default(argv[0])) {
181 1.7 jdolecek if (!sscanf(argv[0], "%ld", &reps))
182 1.20 dsl errx(EXIT_FAILURE, "Bad reps value: %s",
183 1.20 dsl argv[0]);
184 1.1 jtc mask |= 010;
185 1.1 jtc }
186 1.1 jtc break;
187 1.1 jtc case 0:
188 1.7 jdolecek usage();
189 1.7 jdolecek break;
190 1.1 jtc default:
191 1.20 dsl errx(EXIT_FAILURE,
192 1.20 dsl "Too many arguments. What do you mean by %s?", argv[4]);
193 1.1 jtc }
194 1.1 jtc getformat();
195 1.16 dsl while (mask) { /* 4 bit mask has 1's where last 4 args were given */
196 1.1 jtc switch (mask) { /* fill in the 0's by default or computation */
197 1.1 jtc case 001:
198 1.1 jtc reps = REPS_DEF;
199 1.1 jtc mask = 011;
200 1.1 jtc break;
201 1.1 jtc case 002:
202 1.1 jtc reps = REPS_DEF;
203 1.1 jtc mask = 012;
204 1.1 jtc break;
205 1.1 jtc case 003:
206 1.1 jtc reps = REPS_DEF;
207 1.1 jtc mask = 013;
208 1.1 jtc break;
209 1.1 jtc case 004:
210 1.1 jtc reps = REPS_DEF;
211 1.1 jtc mask = 014;
212 1.1 jtc break;
213 1.1 jtc case 005:
214 1.1 jtc reps = REPS_DEF;
215 1.1 jtc mask = 015;
216 1.1 jtc break;
217 1.1 jtc case 006:
218 1.1 jtc reps = REPS_DEF;
219 1.1 jtc mask = 016;
220 1.1 jtc break;
221 1.1 jtc case 007:
222 1.1 jtc if (randomize) {
223 1.1 jtc reps = REPS_DEF;
224 1.1 jtc mask = 0;
225 1.1 jtc break;
226 1.1 jtc }
227 1.18 dsl if (step == 0.0) {
228 1.1 jtc reps = 0;
229 1.1 jtc mask = 0;
230 1.1 jtc break;
231 1.1 jtc }
232 1.18 dsl reps = (ender - begin + step) / step;
233 1.1 jtc if (reps <= 0)
234 1.20 dsl errx(EXIT_FAILURE, "Impossible stepsize");
235 1.1 jtc mask = 0;
236 1.1 jtc break;
237 1.1 jtc case 010:
238 1.1 jtc begin = BEGIN_DEF;
239 1.1 jtc mask = 014;
240 1.1 jtc break;
241 1.1 jtc case 011:
242 1.1 jtc begin = BEGIN_DEF;
243 1.1 jtc mask = 015;
244 1.1 jtc break;
245 1.1 jtc case 012:
246 1.18 dsl step = (randomize ? time(NULL) * getpid() : STEP_DEF);
247 1.1 jtc mask = 013;
248 1.1 jtc break;
249 1.1 jtc case 013:
250 1.1 jtc if (randomize)
251 1.1 jtc begin = BEGIN_DEF;
252 1.1 jtc else if (reps == 0)
253 1.20 dsl errx(EXIT_FAILURE,
254 1.20 dsl "Must specify begin if reps == 0");
255 1.18 dsl begin = ender - reps * step + step;
256 1.1 jtc mask = 0;
257 1.1 jtc break;
258 1.1 jtc case 014:
259 1.18 dsl step = (randomize ? time(NULL) * getpid() : STEP_DEF);
260 1.1 jtc mask = 015;
261 1.1 jtc break;
262 1.1 jtc case 015:
263 1.1 jtc if (randomize)
264 1.1 jtc ender = ENDER_DEF;
265 1.1 jtc else
266 1.18 dsl ender = begin + reps * step - step;
267 1.1 jtc mask = 0;
268 1.1 jtc break;
269 1.1 jtc case 016:
270 1.1 jtc if (randomize)
271 1.18 dsl step = time(NULL) * getpid();
272 1.1 jtc else if (reps == 0)
273 1.20 dsl errx(EXIT_FAILURE,
274 1.20 dsl "Infinite sequences cannot be bounded");
275 1.1 jtc else if (reps == 1)
276 1.18 dsl step = 0.0;
277 1.1 jtc else
278 1.18 dsl step = (ender - begin) / (reps - 1);
279 1.1 jtc mask = 0;
280 1.1 jtc break;
281 1.1 jtc case 017: /* if reps given and implied, */
282 1.18 dsl if (!randomize && step != 0.0) {
283 1.18 dsl long t = (ender - begin + step) / step;
284 1.1 jtc if (t <= 0)
285 1.20 dsl errx(EXIT_FAILURE,
286 1.20 dsl "Impossible stepsize");
287 1.1 jtc if (t < reps) /* take lesser */
288 1.1 jtc reps = t;
289 1.1 jtc }
290 1.1 jtc mask = 0;
291 1.1 jtc break;
292 1.1 jtc default:
293 1.20 dsl errx(EXIT_FAILURE, "bad mask");
294 1.1 jtc }
295 1.16 dsl }
296 1.1 jtc if (reps == 0)
297 1.1 jtc infinity = 1;
298 1.18 dsl
299 1.18 dsl if (prec == -1)
300 1.18 dsl prec = 0;
301 1.1 jtc }
302 1.1 jtc
303 1.20 dsl static void
304 1.13 perry putdata(double x, long notlast)
305 1.1 jtc {
306 1.19 dsl long d = floor(x);
307 1.1 jtc
308 1.1 jtc if (boring) /* repeated word */
309 1.3 pk printf("%s", format);
310 1.1 jtc else if (dox) /* scalar */
311 1.16 dsl printf(format, d);
312 1.1 jtc else /* real */
313 1.1 jtc printf(format, x);
314 1.1 jtc if (notlast != 0)
315 1.1 jtc fputs(sepstring, stdout);
316 1.1 jtc }
317 1.1 jtc
318 1.20 dsl __dead static void
319 1.7 jdolecek usage(void)
320 1.1 jtc {
321 1.12 peter (void)fprintf(stderr, "usage: %s [-cnr] [-b word] [-p precision] "
322 1.20 dsl "[-s string] [-w word] [reps [begin [end [step | seed]]]]\n",
323 1.20 dsl getprogname());
324 1.1 jtc exit(1);
325 1.1 jtc }
326 1.1 jtc
327 1.20 dsl static int
328 1.20 dsl getprec(char *num_str)
329 1.1 jtc {
330 1.1 jtc
331 1.20 dsl num_str = strchr(num_str, '.');
332 1.20 dsl if (num_str == NULL)
333 1.20 dsl return 0;
334 1.20 dsl return strspn(num_str + 1, "0123456789");
335 1.1 jtc }
336 1.1 jtc
337 1.20 dsl static void
338 1.13 perry getformat(void)
339 1.1 jtc {
340 1.4 lukem char *p;
341 1.7 jdolecek size_t sz;
342 1.1 jtc
343 1.1 jtc if (boring) /* no need to bother */
344 1.1 jtc return;
345 1.20 dsl for (p = format; *p; p++) { /* look for '%' */
346 1.7 jdolecek if (*p == '%') {
347 1.7 jdolecek if (*(p+1) != '%')
348 1.7 jdolecek break;
349 1.7 jdolecek p++; /* leave %% alone */
350 1.7 jdolecek }
351 1.20 dsl }
352 1.7 jdolecek sz = sizeof(format) - strlen(format) - 1;
353 1.7 jdolecek if (!*p) {
354 1.17 dsl if (chardata || prec == 0) {
355 1.17 dsl if (snprintf(p, sz, "%%%s", chardata ? "c" : "ld") >= sz)
356 1.20 dsl errx(EXIT_FAILURE, "-w word too long");
357 1.8 simonb dox = 1;
358 1.7 jdolecek } else {
359 1.8 simonb if (snprintf(p, sz, "%%.%df", prec) >= (int)sz)
360 1.20 dsl errx(EXIT_FAILURE, "-w word too long");
361 1.7 jdolecek }
362 1.7 jdolecek } else if (!*(p+1)) {
363 1.7 jdolecek if (sz <= 0)
364 1.20 dsl errx(EXIT_FAILURE, "-w word too long");
365 1.1 jtc strcat(format, "%"); /* cannot end in single '%' */
366 1.7 jdolecek } else {
367 1.7 jdolecek p++; /* skip leading % */
368 1.7 jdolecek for(; *p && !isalpha((unsigned char)*p); p++) {
369 1.7 jdolecek /* allow all valid printf(3) flags, but deny '*' */
370 1.7 jdolecek if (!strchr("0123456789#-+. ", *p))
371 1.7 jdolecek break;
372 1.7 jdolecek }
373 1.7 jdolecek /* Allow 'l' prefix, but no other. */
374 1.7 jdolecek if (*p == 'l')
375 1.7 jdolecek p++;
376 1.1 jtc switch (*p) {
377 1.1 jtc case 'f': case 'e': case 'g': case '%':
378 1.7 jdolecek case 'E': case 'G':
379 1.1 jtc break;
380 1.1 jtc case 's':
381 1.20 dsl errx(EXIT_FAILURE,
382 1.20 dsl "cannot convert numeric data to strings");
383 1.1 jtc break;
384 1.7 jdolecek case 'd': case 'o': case 'x': case 'u':
385 1.7 jdolecek case 'D': case 'O': case 'X': case 'U':
386 1.7 jdolecek case 'c': case 'i':
387 1.1 jtc dox = 1;
388 1.1 jtc break;
389 1.7 jdolecek default:
390 1.20 dsl errx(EXIT_FAILURE, "unknown or invalid format `%s'",
391 1.20 dsl format);
392 1.1 jtc }
393 1.7 jdolecek /* Need to check for trailing stuff to print */
394 1.7 jdolecek for (; *p; p++) /* look for '%' */
395 1.7 jdolecek if (*p == '%') {
396 1.7 jdolecek if (*(p+1) != '%')
397 1.7 jdolecek break;
398 1.7 jdolecek p++; /* leave %% alone */
399 1.7 jdolecek }
400 1.7 jdolecek if (*p)
401 1.20 dsl errx(EXIT_FAILURE, "unknown or invalid format `%s'",
402 1.20 dsl format);
403 1.1 jtc }
404 1.1 jtc }
405