1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
/* Copyright (c) 2019, Anthony Latorre <tlatorre at uchicago>
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation, either version 3 of the License, or (at your option)
* any later version.
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
* You should have received a copy of the GNU General Public License along with
* this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include "sno_charge.h"
#include <unistd.h>
#include <stdlib.h>
#include <errno.h> /* for errno */
#include <string.h> /* for strerror() */
void usage(void)
{
fprintf(stderr,"Usage: ./test-charge\n");
fprintf(stderr," -n number of PE\n");
fprintf(stderr," -b number of bins\n");
fprintf(stderr," --xmin Lowest value of charge\n");
fprintf(stderr," --xmax Highest value of charge\n");
fprintf(stderr," -h Display this help message\n");
exit(1);
}
int main(int argc, char **argv)
{
size_t i, j, nq, n;
double *x;
double qlo, qhi;
n = 10;
nq = 1000;
qlo = -1.0;
qhi = 1.0;
for (i = 1; i < argc; i++) {
if (!strncmp(argv[i], "--", 2)) {
if (!strcmp(argv[i]+2,"xmin")) {
qlo = strtod(argv[++i],NULL);
continue;
} else if (!strcmp(argv[i]+2,"xmax")) {
qhi = strtod(argv[++i],NULL);
continue;
}
} else if (argv[i][0] == '-') {
switch (argv[i][1]) {
case 'n':
n = atoi(argv[++i]);
break;
case 'b':
nq = atoi(argv[++i]);
break;
case 'h':
usage();
default:
fprintf(stderr, "unrecognized option '%s'\n", argv[i]);
exit(1);
}
}
}
init_charge();
x = malloc(nq*sizeof(double));
for (i = 0; i < nq; i++) {
x[i] = qlo + (qhi-qlo)*i/(nq-1);
}
FILE *pipe = popen("graph -T X --bitmap-size 2000x2000 -X 'Charge (PE)' -Y Probability", "w");
if (!pipe) {
fprintf(stderr, "error running graph command: %s\n", strerror(errno));
exit(1);
}
for (i = 1; i <= n; i++) {
for (j = 0; j < nq; j++) {
fprintf(pipe, "%.10f %.10f\n", x[j], get_pq(x[j],i));
}
fprintf(pipe, "\n\n");
}
if (pclose(pipe)) {
fprintf(stderr, "error closing graph command: %s\n", strerror(errno));
exit(1);
}
free(x);
return 0;
}
|
