412 lines
9.1 KiB
C
412 lines
9.1 KiB
C
/* $NetBSD: jot.c,v 1.15 2006/06/13 03:22:00 christos Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
#ifndef lint
|
|
__COPYRIGHT("@(#) Copyright (c) 1993\n\
|
|
The Regents of the University of California. All rights reserved.\n");
|
|
#endif /* not lint */
|
|
|
|
#ifndef lint
|
|
#if 0
|
|
static char sccsid[] = "@(#)jot.c 8.1 (Berkeley) 6/6/93";
|
|
#endif
|
|
__RCSID("$NetBSD: jot.c,v 1.15 2006/06/13 03:22:00 christos Exp $");
|
|
#endif /* not lint */
|
|
|
|
/*
|
|
* jot - print sequential or random data
|
|
*
|
|
* Author: John Kunze, Office of Comp. Affairs, UCB
|
|
*/
|
|
|
|
#include <ctype.h>
|
|
#include <err.h>
|
|
#include <limits.h>
|
|
#include <math.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <time.h>
|
|
#include <unistd.h>
|
|
|
|
#define REPS_DEF 100
|
|
#define BEGIN_DEF 1
|
|
#define ENDER_DEF 100
|
|
#define STEP_DEF 1
|
|
|
|
#define is_default(s) (strcmp((s), "-") == 0)
|
|
|
|
double begin;
|
|
double ender;
|
|
double s;
|
|
long reps;
|
|
int randomize;
|
|
int infinity;
|
|
int boring;
|
|
int prec;
|
|
int dox;
|
|
int chardata;
|
|
int nofinalnl;
|
|
char sepstring[BUFSIZ] = "\n";
|
|
char format[BUFSIZ];
|
|
|
|
void getargs(int, char *[]);
|
|
void getformat(void);
|
|
int getprec(char *);
|
|
int main(int, char **);
|
|
void putdata(double, long);
|
|
static void usage(void);
|
|
|
|
int
|
|
main(int argc, char *argv[])
|
|
{
|
|
double xd, yd;
|
|
long id;
|
|
double *x = &xd;
|
|
double *y = &yd;
|
|
long *i = &id;
|
|
|
|
getargs(argc, argv);
|
|
if (randomize) {
|
|
*x = (ender - begin) * (ender > begin ? 1 : -1);
|
|
srandom((unsigned long) s);
|
|
for (*i = 1; *i <= reps || infinity; (*i)++) {
|
|
*y = (double) random() / INT_MAX;
|
|
putdata(*y * *x + begin, reps - *i);
|
|
}
|
|
}
|
|
else
|
|
for (*i = 1, *x = begin; *i <= reps || infinity; (*i)++, *x += s)
|
|
putdata(*x, reps - *i);
|
|
if (!nofinalnl)
|
|
putchar('\n');
|
|
exit(0);
|
|
}
|
|
|
|
void
|
|
getargs(int argc, char *argv[])
|
|
{
|
|
unsigned int mask = 0;
|
|
int n = 0;
|
|
|
|
while (--argc && **++argv == '-' && !is_default(*argv))
|
|
switch ((*argv)[1]) {
|
|
case 'r':
|
|
randomize = 1;
|
|
break;
|
|
case 'c':
|
|
chardata = 1;
|
|
break;
|
|
case 'n':
|
|
nofinalnl = 1;
|
|
break;
|
|
case 'b':
|
|
boring = 1;
|
|
case 'w':
|
|
if ((*argv)[2])
|
|
strlcpy(format, *argv + 2, sizeof(format));
|
|
else if (!--argc)
|
|
errx(1, "Need context word after -w or -b");
|
|
else
|
|
strlcpy(format, *++argv, sizeof(format));
|
|
break;
|
|
case 's':
|
|
if ((*argv)[2])
|
|
strlcpy(sepstring, *argv + 2, sizeof(sepstring));
|
|
else if (!--argc)
|
|
errx(1, "Need string after -s");
|
|
else
|
|
strlcpy(sepstring, *++argv, sizeof(sepstring));
|
|
break;
|
|
case 'p':
|
|
if ((*argv)[2])
|
|
prec = atoi(*argv + 2);
|
|
else if (!--argc)
|
|
errx(1, "Need number after -p");
|
|
else
|
|
prec = atoi(*++argv);
|
|
if (prec <= 0)
|
|
errx(1, "Bad precision value");
|
|
break;
|
|
default:
|
|
warnx("unknown option `%s'", *argv);
|
|
usage();
|
|
}
|
|
|
|
switch (argc) { /* examine args right to left, falling thru cases */
|
|
case 4:
|
|
if (!is_default(argv[3])) {
|
|
if (!sscanf(argv[3], "%lf", &s))
|
|
errx(1, "Bad s value: %s", argv[3]);
|
|
mask |= 01;
|
|
}
|
|
case 3:
|
|
if (!is_default(argv[2])) {
|
|
if (!sscanf(argv[2], "%lf", &ender))
|
|
ender = argv[2][strlen(argv[2])-1];
|
|
mask |= 02;
|
|
if (!prec)
|
|
n = getprec(argv[2]);
|
|
}
|
|
case 2:
|
|
if (!is_default(argv[1])) {
|
|
if (!sscanf(argv[1], "%lf", &begin))
|
|
begin = argv[1][strlen(argv[1])-1];
|
|
mask |= 04;
|
|
if (!prec)
|
|
prec = getprec(argv[1]);
|
|
if (n > prec) /* maximum precision */
|
|
prec = n;
|
|
}
|
|
case 1:
|
|
if (!is_default(argv[0])) {
|
|
if (!sscanf(argv[0], "%ld", &reps))
|
|
errx(1, "Bad reps value: %s", argv[0]);
|
|
mask |= 010;
|
|
}
|
|
break;
|
|
case 0:
|
|
usage();
|
|
break;
|
|
default:
|
|
errx(1, "Too many arguments. What do you mean by %s?", argv[4]);
|
|
}
|
|
getformat();
|
|
while (mask) /* 4 bit mask has 1's where last 4 args were given */
|
|
switch (mask) { /* fill in the 0's by default or computation */
|
|
case 001:
|
|
reps = REPS_DEF;
|
|
mask = 011;
|
|
break;
|
|
case 002:
|
|
reps = REPS_DEF;
|
|
mask = 012;
|
|
break;
|
|
case 003:
|
|
reps = REPS_DEF;
|
|
mask = 013;
|
|
break;
|
|
case 004:
|
|
reps = REPS_DEF;
|
|
mask = 014;
|
|
break;
|
|
case 005:
|
|
reps = REPS_DEF;
|
|
mask = 015;
|
|
break;
|
|
case 006:
|
|
reps = REPS_DEF;
|
|
mask = 016;
|
|
break;
|
|
case 007:
|
|
if (randomize) {
|
|
reps = REPS_DEF;
|
|
mask = 0;
|
|
break;
|
|
}
|
|
if (s == 0.0) {
|
|
reps = 0;
|
|
mask = 0;
|
|
break;
|
|
}
|
|
reps = (ender - begin + s) / s;
|
|
if (reps <= 0)
|
|
errx(1, "Impossible stepsize");
|
|
mask = 0;
|
|
break;
|
|
case 010:
|
|
begin = BEGIN_DEF;
|
|
mask = 014;
|
|
break;
|
|
case 011:
|
|
begin = BEGIN_DEF;
|
|
mask = 015;
|
|
break;
|
|
case 012:
|
|
s = (randomize ? time(NULL) * getpid() : STEP_DEF);
|
|
mask = 013;
|
|
break;
|
|
case 013:
|
|
if (randomize)
|
|
begin = BEGIN_DEF;
|
|
else if (reps == 0)
|
|
errx(1, "Must specify begin if reps == 0");
|
|
begin = ender - reps * s + s;
|
|
mask = 0;
|
|
break;
|
|
case 014:
|
|
s = (randomize ? time(NULL) * getpid() : STEP_DEF);
|
|
mask = 015;
|
|
break;
|
|
case 015:
|
|
if (randomize)
|
|
ender = ENDER_DEF;
|
|
else
|
|
ender = begin + reps * s - s;
|
|
mask = 0;
|
|
break;
|
|
case 016:
|
|
if (randomize)
|
|
s = time(NULL) * getpid();
|
|
else if (reps == 0)
|
|
errx(1, "Infinite sequences cannot be bounded");
|
|
else if (reps == 1)
|
|
s = 0.0;
|
|
else
|
|
s = (ender - begin) / (reps - 1);
|
|
mask = 0;
|
|
break;
|
|
case 017: /* if reps given and implied, */
|
|
if (!randomize && s != 0.0) {
|
|
long t = (ender - begin + s) / s;
|
|
if (t <= 0)
|
|
errx(1, "Impossible stepsize");
|
|
if (t < reps) /* take lesser */
|
|
reps = t;
|
|
}
|
|
mask = 0;
|
|
break;
|
|
default:
|
|
errx(1, "bad mask");
|
|
}
|
|
if (reps == 0)
|
|
infinity = 1;
|
|
}
|
|
|
|
void
|
|
putdata(double x, long notlast)
|
|
{
|
|
long d = x;
|
|
long *dp = &d;
|
|
|
|
if (boring) /* repeated word */
|
|
printf("%s", format);
|
|
else if (dox) /* scalar */
|
|
printf(format, *dp);
|
|
else if (prec == 0) /* integer */
|
|
printf(format, round(x));
|
|
else /* real */
|
|
printf(format, x);
|
|
if (notlast != 0)
|
|
fputs(sepstring, stdout);
|
|
}
|
|
|
|
static void
|
|
usage(void)
|
|
{
|
|
(void)fprintf(stderr, "usage: %s [-cnr] [-b word] [-p precision] "
|
|
"[-s string] [-w word] [reps [begin [end [s]]]]\n", getprogname());
|
|
exit(1);
|
|
}
|
|
|
|
int
|
|
getprec(char *s)
|
|
{
|
|
char *p;
|
|
char *q;
|
|
|
|
for (p = s; *p; p++)
|
|
if (*p == '.')
|
|
break;
|
|
if (!*p)
|
|
return (0);
|
|
for (q = ++p; *p; p++)
|
|
if (!isdigit((unsigned char)*p))
|
|
break;
|
|
return (p - q);
|
|
}
|
|
|
|
void
|
|
getformat(void)
|
|
{
|
|
char *p;
|
|
size_t sz;
|
|
|
|
if (boring) /* no need to bother */
|
|
return;
|
|
for (p = format; *p; p++) /* look for '%' */
|
|
if (*p == '%') {
|
|
if (*(p+1) != '%')
|
|
break;
|
|
p++; /* leave %% alone */
|
|
}
|
|
sz = sizeof(format) - strlen(format) - 1;
|
|
if (!*p) {
|
|
if (chardata) {
|
|
if (strlcpy(p, "%c", sz) >= sz)
|
|
errx(1, "-w word too long");
|
|
dox = 1;
|
|
} else {
|
|
if (snprintf(p, sz, "%%.%df", prec) >= (int)sz)
|
|
errx(1, "-w word too long");
|
|
}
|
|
} else if (!*(p+1)) {
|
|
if (sz <= 0)
|
|
errx(1, "-w word too long");
|
|
strcat(format, "%"); /* cannot end in single '%' */
|
|
} else {
|
|
p++; /* skip leading % */
|
|
for(; *p && !isalpha((unsigned char)*p); p++) {
|
|
/* allow all valid printf(3) flags, but deny '*' */
|
|
if (!strchr("0123456789#-+. ", *p))
|
|
break;
|
|
}
|
|
/* Allow 'l' prefix, but no other. */
|
|
if (*p == 'l')
|
|
p++;
|
|
switch (*p) {
|
|
case 'f': case 'e': case 'g': case '%':
|
|
case 'E': case 'G':
|
|
break;
|
|
case 's':
|
|
errx(1, "cannot convert numeric data to strings");
|
|
break;
|
|
case 'd': case 'o': case 'x': case 'u':
|
|
case 'D': case 'O': case 'X': case 'U':
|
|
case 'c': case 'i':
|
|
dox = 1;
|
|
break;
|
|
default:
|
|
errx(1, "unknown or invalid format `%s'", format);
|
|
}
|
|
/* Need to check for trailing stuff to print */
|
|
for (; *p; p++) /* look for '%' */
|
|
if (*p == '%') {
|
|
if (*(p+1) != '%')
|
|
break;
|
|
p++; /* leave %% alone */
|
|
}
|
|
if (*p)
|
|
errx(1, "unknown or invalid format `%s'", format);
|
|
}
|
|
}
|