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