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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
/*
* COPYRIGHT
*
* pcb-rnd, interactive printed circuit board design
* Copyright (C) 2020 Tibor 'Igor2' Palinkas
*
* 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 2 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Contact:
* Project page: http://repo.hu/projects/pcb-rnd
* lead developer: http://repo.hu/projects/pcb-rnd/contact.html
* mailing list: pcb-rnd (at) list.repo.hu (send "subscribe")
*/
#include "config.h"
#include <librnd/core/actions.h>
#include "bisect.h"
#define CALL(dst, value) \
do { \
argv[specn].type = FGW_DOUBLE; \
argv[specn].val.nat_double = value; \
r.val.nat_double = -1; r.type = FGW_DOUBLE; \
ferr = f->func(&r, argc-2, argv+2); \
if (ferr != 0) { \
rnd_message(RND_MSG_ERROR, "formula_bisect: '%s' returned error on value %f\n", actname, value); \
return -1; \
} \
fgw_arg_conv(&rnd_fgw, &r, FGW_DOUBLE); \
if (r.type != FGW_DOUBLE) { \
rnd_message(RND_MSG_ERROR, "formula_bisect: '%s' returned not-a-number on value %f\n", actname, value); \
return -1; \
} \
dst = r.val.nat_double; \
} while(0)
RND_INLINE int is_between(double target, double low, double high)
{
if (low > high)
rnd_swap(double, low, high);
return (target > low) && (target < high);
}
const char pcb_acts_formula_bisect[] = "formula_bisect(action, res, args)";
const char pcb_acth_formula_bisect[] = "Find the value for exactly one of the arguments that produces the expected result. One argument must be a string with type:min:max:precision, the rest of the arguments and res must be numeric.";
fgw_error_t pcb_act_formula_bisect(fgw_arg_t *res, int argc, fgw_arg_t *argv)
{
const char *actname, *spec;
double target, min, max, minv, maxv, v, err, at;
fgw_arg_t r;
int n, specn = 0, unitlen, var_is_coord = 0;
const fgw_func_t *f;
fgw_error_t ferr;
const rnd_unit_t *unit;
char sunit[32];
RND_ACT_CONVARG(1, FGW_STR, formula_bisect, actname = argv[1].val.str);
RND_ACT_CONVARG(2, FGW_DOUBLE, formula_bisect, target = argv[2].val.nat_double);
for(n = 3; n < argc; n++) {
if (((argv[n].type & FGW_STR) == FGW_STR) && (strchr(argv[n].val.str, ':') != NULL)) {
if (specn > 0) {
rnd_message(RND_MSG_ERROR, "formula_bisect: only one argument can be variable; the two are %d and %d now\n", specn, n);
return FGW_ERR_ARG_CONV;
}
else
specn = n;
}
}
if (specn <= 0) {
rnd_message(RND_MSG_ERROR, "formula_bisect: one argument needs to be a variable specification string\n");
return FGW_ERR_ARG_CONV;
}
f = rnd_act_lookup(actname);
if (f == NULL) {
rnd_message(RND_MSG_ERROR, "formula_bisect: no such action: %s\n", actname);
return FGW_ERR_ARG_CONV;
}
spec = strchr(argv[specn].val.str, ':');
unitlen = spec - argv[specn].val.str;
if (unitlen >= sizeof(sunit)) {
rnd_message(RND_MSG_ERROR, "formula_bisect: invalid unit spec (too long): '%s'\n", spec);
return FGW_ERR_ARG_CONV;
}
if (sscanf(spec+1, "%lf:%lf:%lf", &min, &max, &err) != 3) {
rnd_message(RND_MSG_ERROR, "formula_bisect: invalid range spec: '%s'\n", spec);
return FGW_ERR_ARG_CONV;
}
if (unitlen > 0) {
strncpy(sunit, argv[specn].val.str, unitlen);
sunit[unitlen] = '\0';
}
if ((unitlen == 0) || (strcmp(sunit, "double") == 0) || (strcmp(sunit, "num") == 0)) {
/* do nothing */
}
else {
unit = get_unit_by_suffix(sunit);
if (unit == NULL) {
rnd_message(RND_MSG_ERROR, "formula_bisect: invalid unit spec: '%s'\n", spec);
return FGW_ERR_ARG_CONV;
}
min = RND_MM_TO_COORD(min / unit->scale_factor);
max = RND_MM_TO_COORD(max / unit->scale_factor);
var_is_coord = ((unit->family == RND_UNIT_METRIC) || (unit->family == RND_UNIT_IMPERIAL));
}
fgw_arg_free(&rnd_fgw, &argv[specn]);
argv[specn].type = FGW_DOUBLE;
CALL(minv, min);
if (fabs(minv - target) < err) goto found;
CALL(maxv, max);
if (fabs(maxv - target) < err) goto found;
for(n = 0; (n < 256); n++) {
at = (min+max)/2.0;
CALL(v, at);
/*rnd_trace("try1: [%f %f] %f -> %f\n", min, max, at, v);*/
if (fabs(v - target) < err)
goto found;
if (is_between(target, minv, v))
max = at;
else if (is_between(target, v, maxv))
min = at;
else {
rnd_message(RND_MSG_ERROR, "formula_bisect: convergence error\n");
return -1;
}
}
res->type = FGW_PTR;
res->val.ptr_void = NULL;
return 0;
found:;
if (var_is_coord) {
res->type = FGW_COORD;
fgw_coord(res) = at;
}
else {
res->type = FGW_DOUBLE;
res->val.nat_double = at;
}
return 0;
}
|
