Mercurial > hg > wm
view Meerwald/gen_corvi_sig.c @ 8:f83ef905a63d
fixing many warnings
increase capacity for coordinates in bruyn
fix some uninit. variables
author | Peter Meerwald <pmeerw@cosy.sbg.ac.at> |
---|---|
date | Tue, 22 Apr 2008 13:36:05 +0200 |
parents | be303a3f5ea8 |
children |
line wrap: on
line source
#include "wm.h" char *progname; void usage(void) { fprintf(stderr, "usage: %s [-a n] [-d n] [-e n] [-f n] [-F file] [-m n] [-n n] [-o file] [-s n]\n\n", progname); fprintf(stderr, "\t-a n\t\talpha factor (default 0.1)\n"); fprintf(stderr, "\t-d n\t\tdeviation (default 1.0)\n"); fprintf(stderr, "\t-e n\t\twavelet filtering method (default 2)\n"); fprintf(stderr, "\t-f n\t\tfilter number (default 1)\n"); fprintf(stderr, "\t-F file\t\tfilter definition file (default 'filter.dat')\n"); fprintf(stderr, "\t-h\t\tprint usage\n"); fprintf(stderr, "\t-m n \t\tmean value (default 0.0)\n"); fprintf(stderr, "\t-n n\t\twatermark length (default 1000)\n"); fprintf(stderr, "\t-o file\t\toutput file\n"); fprintf(stderr, "\t-s n\t\tseed\n"); exit(0); } int main(int argc, char *argv[]) { FILE *out = stdout; char output_name[MAXPATHLEN] = "(stdout)"; int c; int n = 1000; int s = 0; int e = 2; int f = 1; char F[MAXPATHLEN] = "filter.dat"; double a = 0.1; double m = 0.0; double d = 1.0; progname = argv[0]; while ((c = getopt(argc, argv, "a:d:e:f:F:h?m:n:o:s:")) != EOF) { switch (c) { case 'a': a = atof(optarg); if (a <= 0.0) { fprintf(stderr, "%s: alpha factor %f out of range\n", progname, a); exit(1); } break; case 'd': d = atof(optarg); if (d <= 0.0) { fprintf(stderr, "%s: deviation %f out of range\n", progname, d); exit(1); } break; case 'e': e = atoi(optarg); if (e < 0) { fprintf(stderr, "%s: wavelet filtering method %d out of range\n", progname, e); } break; case 'f': f = atoi(optarg); if (f <= 0) { fprintf(stderr, "%s: filter number %d out of range\n", progname, f); exit(1); } break; case 'F': strcpy(F, optarg); break; case 'h': case '?': usage(); break; case 'm': m = atof(optarg); break; case 'n': n = atoi(optarg); if (n < 1 || n > 32000) { fprintf(stderr, "%s: watermark length %d out of range\n", progname, n); exit(1); } break; case 'o': if ((out = fopen(optarg, "w")) == NULL) { fprintf(stderr, "%s: unable to open output file %s\n", progname, optarg); exit(1); } strcpy(output_name, optarg); break; case 's': s = atoi(optarg); break; } } argc -= optind; argv += optind; if (argc > 0) { usage(); exit(1); } if (s) srandom(s); else srandom(time(NULL) * getpid()); fprintf(out, "CVSG\n"); fprintf(out, "%d\n", n); fprintf(out, "%f\n", a); fprintf(out, "%d\n", e); fprintf(out, "%d\n", f); fprintf(out, "%s\n", F); n >>= 1; while (n > 0) { double x; double x1, x2; /* * Algorithm P (Polar method for normal deviates), * Knuth, D., "The Art of Computer Programming", Vol. 2, 3rd Edition, p. 122 */ do { x1 = 2.0 * ((random() & RAND_MAX) / ((double) RAND_MAX + 1.0)) - 1.0; x2 = 2.0 * ((random() & RAND_MAX) / ((double) RAND_MAX + 1.0)) - 1.0; x = x1 * x1 + x2 * x2; } while (x >= 1.0); x1 *= sqrt((-2.0) * log(x) / x); x2 *= sqrt((-2.0) * log(x) / x); fprintf(out, "%f\n", m + d * x1); fprintf(out, "%f\n", m + d * x2); n--; } fclose(out); exit(0); }