jot.c revision 23511
1/*- 2 * Copyright (c) 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 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. 20 * 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 31 * SUCH DAMAGE. 32 */ 33 34#ifndef lint 35static char copyright[] = 36"@(#) Copyright (c) 1993\n\ 37 The Regents of the University of California. All rights reserved.\n"; 38#endif /* not lint */ 39 40#ifndef lint 41static char sccsid[] = "@(#)jot.c 8.1 (Berkeley) 6/6/93"; 42#endif /* not lint */ 43 44/* 45 * jot - print sequential or random data 46 * 47 * Author: John Kunze, Office of Comp. Affairs, UCB 48 */ 49 50#include <ctype.h> 51#include <limits.h> 52#include <stdio.h> 53#include <stdlib.h> 54#include <string.h> 55#include <time.h> 56#include <unistd.h> 57 58#define REPS_DEF 100 59#define BEGIN_DEF 1 60#define ENDER_DEF 100 61#define STEP_DEF 1 62 63#define isdefault(s) (strcmp((s), "-") == 0) 64 65double begin; 66double ender; 67double s; 68long reps; 69int randomize; 70int infinity; 71int boring; 72int prec; 73int dox; 74int chardata; 75int nofinalnl; 76char *sepstring = "\n"; 77char format[BUFSIZ]; 78 79void error __P((char *, char *)); 80void getargs __P((int, char *[])); 81void getformat __P((void)); 82int getprec __P((char *)); 83void putdata __P((double, long)); 84 85int 86main(argc, argv) 87 int argc; 88 char *argv[]; 89{ 90 double xd, yd; 91 long id; 92 register double *x = &xd; 93 register double *y = &yd; 94 register long *i = &id; 95 96 getargs(argc, argv); 97 if (randomize) { 98 *x = (ender - begin) * (ender > begin ? 1 : -1); 99 srandom((unsigned) s); 100 for (*i = 1; *i <= reps || infinity; (*i)++) { 101 *y = (double) random() / LONG_MAX; 102 putdata(*y * *x + begin, reps - *i); 103 } 104 } 105 else 106 for (*i = 1, *x = begin; *i <= reps || infinity; (*i)++, *x += s) 107 putdata(*x, reps - *i); 108 if (!nofinalnl) 109 putchar('\n'); 110 exit(0); 111} 112 113void 114getargs(ac, av) 115 int ac; 116 char *av[]; 117{ 118 register unsigned int mask = 0; 119 register int n = 0; 120 121 while (--ac && **++av == '-' && !isdefault(*av)) 122 switch ((*av)[1]) { 123 case 'r': 124 randomize = 1; 125 break; 126 case 'c': 127 chardata = 1; 128 break; 129 case 'n': 130 nofinalnl = 1; 131 break; 132 case 'b': 133 boring = 1; 134 case 'w': 135 if ((*av)[2]) 136 strcpy(format, *av + 2); 137 else if (!--ac) 138 error("Need context word after -w or -b", ""); 139 else 140 strcpy(format, *++av); 141 break; 142 case 's': 143 if ((*av)[2]) 144 sepstring = *av + 2; 145 else if (!--ac) 146 error("Need string after -s", ""); 147 else 148 sepstring = *++av; 149 break; 150 case 'p': 151 if ((*av)[2]) 152 prec = atoi(*av + 2); 153 else if (!--ac) 154 error("Need number after -p", ""); 155 else 156 prec = atoi(*++av); 157 if (prec <= 0) 158 error("Bad precision value", ""); 159 break; 160 default: 161 error("Unknown option %s", *av); 162 } 163 164 switch (ac) { /* examine args right to left, falling thru cases */ 165 case 4: 166 if (!isdefault(av[3])) { 167 if (!sscanf(av[3], "%lf", &s)) 168 error("Bad s value: %s", av[3]); 169 mask |= 01; 170 } 171 case 3: 172 if (!isdefault(av[2])) { 173 if (!sscanf(av[2], "%lf", &ender)) 174 ender = av[2][strlen(av[2])-1]; 175 mask |= 02; 176 if (!prec) 177 n = getprec(av[2]); 178 } 179 case 2: 180 if (!isdefault(av[1])) { 181 if (!sscanf(av[1], "%lf", &begin)) 182 begin = av[1][strlen(av[1])-1]; 183 mask |= 04; 184 if (!prec) 185 prec = getprec(av[1]); 186 if (n > prec) /* maximum precision */ 187 prec = n; 188 } 189 case 1: 190 if (!isdefault(av[0])) { 191 if (!sscanf(av[0], "%ld", &reps)) 192 error("Bad reps value: %s", av[0]); 193 mask |= 010; 194 } 195 break; 196 case 0: 197 error("jot - print sequential or random data", ""); 198 default: 199 error("Too many arguments. What do you mean by %s?", av[4]); 200 } 201 getformat(); 202 while (mask) /* 4 bit mask has 1's where last 4 args were given */ 203 switch (mask) { /* fill in the 0's by default or computation */ 204 case 001: 205 reps = REPS_DEF; 206 mask = 011; 207 break; 208 case 002: 209 reps = REPS_DEF; 210 mask = 012; 211 break; 212 case 003: 213 reps = REPS_DEF; 214 mask = 013; 215 break; 216 case 004: 217 reps = REPS_DEF; 218 mask = 014; 219 break; 220 case 005: 221 reps = REPS_DEF; 222 mask = 015; 223 break; 224 case 006: 225 reps = REPS_DEF; 226 mask = 016; 227 break; 228 case 007: 229 if (randomize) { 230 reps = REPS_DEF; 231 mask = 0; 232 break; 233 } 234 if (s == 0.0) { 235 reps = 0; 236 mask = 0; 237 break; 238 } 239 reps = (ender - begin + s) / s; 240 if (reps <= 0) 241 error("Impossible stepsize", ""); 242 mask = 0; 243 break; 244 case 010: 245 begin = BEGIN_DEF; 246 mask = 014; 247 break; 248 case 011: 249 begin = BEGIN_DEF; 250 mask = 015; 251 break; 252 case 012: 253 s = (randomize ? time(NULL) ^ getpid() : STEP_DEF); 254 mask = 013; 255 break; 256 case 013: 257 if (randomize) 258 begin = BEGIN_DEF; 259 else if (reps == 0) 260 error("Must specify begin if reps == 0", ""); 261 begin = ender - reps * s + s; 262 mask = 0; 263 break; 264 case 014: 265 s = (randomize ? time(NULL) ^ getpid() : STEP_DEF); 266 mask = 015; 267 break; 268 case 015: 269 if (randomize) 270 ender = ENDER_DEF; 271 else 272 ender = begin + reps * s - s; 273 mask = 0; 274 break; 275 case 016: 276 if (randomize) 277 s = time(NULL) ^ getpid(); 278 else if (reps == 0) 279 error("Infinite sequences cannot be bounded", 280 ""); 281 else if (reps == 1) 282 s = 0.0; 283 else 284 s = (ender - begin) / (reps - 1); 285 mask = 0; 286 break; 287 case 017: /* if reps given and implied, */ 288 if (!randomize && s != 0.0) { 289 long t = (ender - begin + s) / s; 290 if (t <= 0) 291 error("Impossible stepsize", ""); 292 if (t < reps) /* take lesser */ 293 reps = t; 294 } 295 mask = 0; 296 break; 297 default: 298 error("Bad mask", ""); 299 } 300 if (reps == 0) 301 infinity = 1; 302} 303 304void 305putdata(x, notlast) 306 double x; 307 long notlast; 308{ 309 long d = x; 310 register long *dp = &d; 311 312 if (boring) /* repeated word */ 313 printf(format); 314 else if (dox) /* scalar */ 315 printf(format, *dp); 316 else /* real */ 317 printf(format, x); 318 if (notlast != 0) 319 fputs(sepstring, stdout); 320} 321 322void 323error(msg, s) 324 char *msg, *s; 325{ 326 fprintf(stderr, "jot: "); 327 fprintf(stderr, msg, s); 328 fprintf(stderr, 329 "\nusage: jot [ options ] [ reps [ begin [ end [ s ] ] ] ]\n"); 330 if (strncmp("jot - ", msg, 6) == 0) 331 fprintf(stderr, "Options:\n\t%s\t%s\t%s\t%s\t%s\t%s\t%s", 332 "-r random data\n", 333 "-c character data\n", 334 "-n no final newline\n", 335 "-b word repeated word\n", 336 "-w word context word\n", 337 "-s string data separator\n", 338 "-p precision number of characters\n"); 339 exit(1); 340} 341 342int 343getprec(s) 344 char *s; 345{ 346 register char *p; 347 register char *q; 348 349 for (p = s; *p; p++) 350 if (*p == '.') 351 break; 352 if (!*p) 353 return (0); 354 for (q = ++p; *p; p++) 355 if (!isdigit(*p)) 356 break; 357 return (p - q); 358} 359 360void 361getformat() 362{ 363 register char *p; 364 365 if (boring) /* no need to bother */ 366 return; 367 for (p = format; *p; p++) /* look for '%' */ 368 if (*p == '%' && *(p+1) != '%') /* leave %% alone */ 369 break; 370 if (!*p && !chardata) 371 sprintf(p, "%%.%df", prec); 372 else if (!*p && chardata) { 373 strcpy(p, "%c"); 374 dox = 1; 375 } 376 else if (!*(p+1)) 377 strcat(format, "%"); /* cannot end in single '%' */ 378 else { 379 while (!isalpha(*p)) 380 p++; 381 switch (*p) { 382 case 'f': case 'e': case 'g': case '%': 383 break; 384 case 's': 385 error("Cannot convert numeric data to strings", ""); 386 break; 387 /* case 'd': case 'o': case 'x': case 'D': case 'O': case 'X': 388 case 'c': case 'u': */ 389 default: 390 dox = 1; 391 break; 392 } 393 } 394} 395