Branch data Line data Source code
1 : : // Copyright (c) 2019-present The Bitcoin Core developers
2 : : // Distributed under the MIT software license, see the accompanying
3 : : // file COPYING or http://www.opensource.org/licenses/mit-license.php.
4 : :
5 : : #include <limits>
6 : : #include <vector>
7 : :
8 : : #include <primitives/transaction.h>
9 : : #include <script/miniscript.h>
10 : : #include <script/script.h>
11 : : #include <script/solver.h>
12 : : #include <span.h>
13 : : #include <util/check.h>
14 : : #include <util/vector.h>
15 : :
16 : : namespace miniscript {
17 : : namespace internal {
18 : :
19 : 5307583 : Type SanitizeType(Type e) {
20 [ + + ]: 5307583 : int num_types = (e << "K"_mst) + (e << "V"_mst) + (e << "B"_mst) + (e << "W"_mst);
21 [ + + ]: 5307583 : if (num_types == 0) return ""_mst; // No valid type, don't care about the rest
22 [ - + ]: 5307508 : assert(num_types == 1); // K, V, B, W all conflict with each other
23 [ + + - + ]: 5307508 : assert(!(e << "z"_mst) || !(e << "o"_mst)); // z conflicts with o
24 [ + + - + ]: 5307508 : assert(!(e << "n"_mst) || !(e << "z"_mst)); // n conflicts with z
25 [ + + - + ]: 5307508 : assert(!(e << "n"_mst) || !(e << "W"_mst)); // n conflicts with W
26 [ + + - + ]: 5307508 : assert(!(e << "V"_mst) || !(e << "d"_mst)); // V conflicts with d
27 [ + + - + ]: 5307508 : assert(!(e << "K"_mst) || (e << "u"_mst)); // K implies u
28 [ + + - + ]: 5307508 : assert(!(e << "V"_mst) || !(e << "u"_mst)); // V conflicts with u
29 [ + + - + ]: 5307508 : assert(!(e << "e"_mst) || !(e << "f"_mst)); // e conflicts with f
30 [ + + - + ]: 5307508 : assert(!(e << "e"_mst) || (e << "d"_mst)); // e implies d
31 [ + + - + ]: 5307508 : assert(!(e << "V"_mst) || !(e << "e"_mst)); // V conflicts with e
32 [ + + - + ]: 5307508 : assert(!(e << "d"_mst) || !(e << "f"_mst)); // d conflicts with f
33 [ + + - + ]: 5307508 : assert(!(e << "V"_mst) || (e << "f"_mst)); // V implies f
34 [ + + - + ]: 5307508 : assert(!(e << "K"_mst) || (e << "s"_mst)); // K implies s
35 [ + + - + ]: 5307508 : assert(!(e << "z"_mst) || (e << "m"_mst)); // z implies m
36 : 5307508 : return e;
37 : : }
38 : :
39 : 5307583 : Type ComputeType(Fragment fragment, Type x, Type y, Type z, const std::vector<Type>& sub_types, uint32_t k,
40 : : size_t data_size, size_t n_subs, size_t n_keys, MiniscriptContext ms_ctx) {
41 : : // Sanity check on data
42 [ + + ]: 5307583 : if (fragment == Fragment::SHA256 || fragment == Fragment::HASH256) {
43 [ - + ]: 204 : assert(data_size == 32);
44 [ + + ]: 5307379 : } else if (fragment == Fragment::RIPEMD160 || fragment == Fragment::HASH160) {
45 [ - + ]: 156 : assert(data_size == 20);
46 : : } else {
47 [ - + ]: 5307223 : assert(data_size == 0);
48 : : }
49 : : // Sanity check on k
50 [ + + ]: 5307583 : if (fragment == Fragment::OLDER || fragment == Fragment::AFTER) {
51 [ - + ]: 8146 : assert(k >= 1 && k < 0x80000000UL);
52 [ + + ]: 5299437 : } else if (fragment == Fragment::MULTI || fragment == Fragment::MULTI_A) {
53 [ + - - + ]: 985 : assert(k >= 1 && k <= n_keys);
54 [ + + ]: 5298452 : } else if (fragment == Fragment::THRESH) {
55 [ + - - + ]: 277 : assert(k >= 1 && k <= n_subs);
56 : : } else {
57 [ - + ]: 5298175 : assert(k == 0);
58 : : }
59 : : // Sanity check on subs
60 : 5307583 : if (fragment == Fragment::AND_V || fragment == Fragment::AND_B || fragment == Fragment::OR_B ||
61 [ + + + + ]: 5307583 : fragment == Fragment::OR_C || fragment == Fragment::OR_I || fragment == Fragment::OR_D) {
62 [ - + ]: 8504 : assert(n_subs == 2);
63 [ + + ]: 5299079 : } else if (fragment == Fragment::ANDOR) {
64 [ - + ]: 237 : assert(n_subs == 3);
65 : 5298842 : } else if (fragment == Fragment::WRAP_A || fragment == Fragment::WRAP_S || fragment == Fragment::WRAP_C ||
66 [ + + ]: 5298842 : fragment == Fragment::WRAP_D || fragment == Fragment::WRAP_V || fragment == Fragment::WRAP_J ||
67 : : fragment == Fragment::WRAP_N) {
68 [ - + ]: 5284326 : assert(n_subs == 1);
69 [ + + ]: 14516 : } else if (fragment != Fragment::THRESH) {
70 [ - + ]: 14239 : assert(n_subs == 0);
71 : : }
72 : : // Sanity check on keys
73 [ + + ]: 5307306 : if (fragment == Fragment::PK_K || fragment == Fragment::PK_H) {
74 [ - + ]: 4223 : assert(n_keys == 1);
75 [ + + ]: 5303360 : } else if (fragment == Fragment::MULTI) {
76 [ - + ]: 165 : assert(n_keys >= 1 && n_keys <= MAX_PUBKEYS_PER_MULTISIG);
77 [ - + ]: 165 : assert(!IsTapscript(ms_ctx));
78 [ + + ]: 5303195 : } else if (fragment == Fragment::MULTI_A) {
79 [ - + ]: 820 : assert(n_keys >= 1 && n_keys <= MAX_PUBKEYS_PER_MULTI_A);
80 [ - + ]: 820 : assert(IsTapscript(ms_ctx));
81 : : } else {
82 [ - + ]: 5302375 : assert(n_keys == 0);
83 : : }
84 : :
85 : : // Below is the per-fragment logic for computing the expression types.
86 : : // It heavily relies on Type's << operator (where "X << a_mst" means
87 : : // "X has all properties listed in a").
88 [ + + + + : 5307583 : switch (fragment) {
+ + + + +
+ + + + +
+ + + + +
+ + + + +
+ + + - ]
89 : 3648 : case Fragment::PK_K: return "Konudemsxk"_mst;
90 : 575 : case Fragment::PK_H: return "Knudemsxk"_mst;
91 : 7900 : case Fragment::OLDER: return
92 : 7900 : "g"_mst.If(k & CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG) |
93 [ + + ]: 7900 : "h"_mst.If(!(k & CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG)) |
94 [ + + ]: 15800 : "Bzfmxk"_mst;
95 : 246 : case Fragment::AFTER: return
96 : 246 : "i"_mst.If(k >= LOCKTIME_THRESHOLD) |
97 [ + + ]: 246 : "j"_mst.If(k < LOCKTIME_THRESHOLD) |
98 [ + + ]: 492 : "Bzfmxk"_mst;
99 : 96 : case Fragment::SHA256: return "Bonudmk"_mst;
100 : 69 : case Fragment::RIPEMD160: return "Bonudmk"_mst;
101 : 108 : case Fragment::HASH256: return "Bonudmk"_mst;
102 : 87 : case Fragment::HASH160: return "Bonudmk"_mst;
103 : 235 : case Fragment::JUST_1: return "Bzufmxk"_mst;
104 : 290 : case Fragment::JUST_0: return "Bzudemsxk"_mst;
105 : 7535 : case Fragment::WRAP_A: return
106 : 7535 : "W"_mst.If(x << "B"_mst) | // W=B_x
107 [ + - ]: 7535 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
108 : 15070 : (x & "udfems"_mst) | // u=u_x, d=d_x, f=f_x, e=e_x, m=m_x, s=s_x
109 [ + - ]: 15070 : "x"_mst; // x
110 : 193 : case Fragment::WRAP_S: return
111 : 193 : "W"_mst.If(x << "Bo"_mst) | // W=B_x*o_x
112 [ + - ]: 193 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
113 [ + - ]: 386 : (x & "udfemsx"_mst); // u=u_x, d=d_x, f=f_x, e=e_x, m=m_x, s=s_x, x=x_x
114 : 4153 : case Fragment::WRAP_C: return
115 : 4153 : "B"_mst.If(x << "K"_mst) | // B=K_x
116 [ + + ]: 4153 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
117 : 8306 : (x & "ondfem"_mst) | // o=o_x, n=n_x, d=d_x, f=f_x, e=e_x, m=m_x
118 [ + + ]: 8304 : "us"_mst; // u, s
119 : 104 : case Fragment::WRAP_D: return
120 : 104 : "B"_mst.If(x << "Vz"_mst) | // B=V_x*z_x
121 [ + - ]: 104 : "o"_mst.If(x << "z"_mst) | // o=z_x
122 [ + - ]: 104 : "e"_mst.If(x << "f"_mst) | // e=f_x
123 [ + - ]: 104 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
124 : 208 : (x & "ms"_mst) | // m=m_x, s=s_x
125 : : // NOTE: 'd:' is 'u' under Tapscript but not P2WSH as MINIMALIF is only a policy rule there.
126 [ + + + - ]: 130 : "u"_mst.If(IsTapscript(ms_ctx)) |
127 : 208 : "ndx"_mst; // n, d, x
128 : 976 : case Fragment::WRAP_V: return
129 : 976 : "V"_mst.If(x << "B"_mst) | // V=B_x
130 [ + + ]: 976 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
131 : 1952 : (x & "zonms"_mst) | // z=z_x, o=o_x, n=n_x, m=m_x, s=s_x
132 [ + + ]: 1948 : "fx"_mst; // f, x
133 : 16 : case Fragment::WRAP_J: return
134 : 16 : "B"_mst.If(x << "Bn"_mst) | // B=B_x*n_x
135 [ + - ]: 16 : "e"_mst.If(x << "f"_mst) | // e=f_x
136 [ + + ]: 16 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
137 : 32 : (x & "oums"_mst) | // o=o_x, u=u_x, m=m_x, s=s_x
138 [ + + ]: 32 : "ndx"_mst; // n, d, x
139 : 5271349 : case Fragment::WRAP_N: return
140 : 5271349 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
141 : 5271349 : (x & "Bzondfems"_mst) | // B=B_x, z=z_x, o=o_x, n=n_x, d=d_x, f=f_x, e=e_x, m=m_x, s=s_x
142 : 5271349 : "ux"_mst; // u, x
143 : 847 : case Fragment::AND_V: return
144 [ + + + + ]: 2526 : (y & "KVB"_mst).If(x << "V"_mst) | // B=V_x*B_y, V=V_x*V_y, K=V_x*K_y
145 [ + + ]: 847 : (x & "n"_mst) | (y & "n"_mst).If(x << "z"_mst) | // n=n_x+z_x*n_y
146 [ + + ]: 847 : ((x | y) & "o"_mst).If((x | y) << "z"_mst) | // o=o_x*z_y+z_x*o_y
147 [ + + ]: 847 : (x & y & "dmz"_mst) | // d=d_x*d_y, m=m_x*m_y, z=z_x*z_y
148 [ + + ]: 847 : ((x | y) & "s"_mst) | // s=s_x+s_y
149 [ + + ]: 383 : "f"_mst.If((y << "f"_mst) || (x << "s"_mst)) | // f=f_y+s_x
150 [ + + ]: 847 : (y & "ux"_mst) | // u=u_y, x=x_y
151 [ + + ]: 847 : ((x | y) & "ghij"_mst) | // g=g_x+g_y, h=h_x+h_y, i=i_x+i_y, j=j_x+j_y
152 [ + + + + ]: 847 : "k"_mst.If(((x & y) << "k"_mst) &&
153 [ + + + - : 1674 : !(((x << "g"_mst) && (y << "h"_mst)) ||
+ + + + ]
154 [ + + + - : 837 : ((x << "h"_mst) && (y << "g"_mst)) ||
+ + ]
155 [ + + + - ]: 837 : ((x << "i"_mst) && (y << "j"_mst)) ||
156 [ + + + - ]: 1684 : ((x << "j"_mst) && (y << "i"_mst)))); // k=k_x*k_y*!(g_x*h_y + h_x*g_y + i_x*j_y + j_x*i_y)
157 : 7174 : case Fragment::AND_B: return
158 : 7174 : (x & "B"_mst).If(y << "W"_mst) | // B=B_x*W_y
159 [ + + + + ]: 13191 : ((x | y) & "o"_mst).If((x | y) << "z"_mst) | // o=o_x*z_y+z_x*o_y
160 [ + + ]: 7174 : (x & "n"_mst) | (y & "n"_mst).If(x << "z"_mst) | // n=n_x+z_x*n_y
161 [ + + + + ]: 8309 : (x & y & "e"_mst).If((x & y) << "s"_mst) | // e=e_x*e_y*s_x*s_y
162 [ + + ]: 7174 : (x & y & "dzm"_mst) | // d=d_x*d_y, z=z_x*z_y, m=m_x*m_y
163 [ + - + - ]: 7147 : "f"_mst.If(((x & y) << "f"_mst) || (x << "sf"_mst) || (y << "sf"_mst)) | // f=f_x*f_y + f_x*s_x + f_y*s_y
164 : 14348 : ((x | y) & "s"_mst) | // s=s_x+s_y
165 [ + + ]: 7174 : "ux"_mst | // u, x
166 [ + + ]: 7174 : ((x | y) & "ghij"_mst) | // g=g_x+g_y, h=h_x+h_y, i=i_x+i_y, j=j_x+j_y
167 [ + + + + ]: 7174 : "k"_mst.If(((x & y) << "k"_mst) &&
168 [ + + - + : 14338 : !(((x << "g"_mst) && (y << "h"_mst)) ||
+ + + + ]
169 [ + + + + : 7168 : ((x << "h"_mst) && (y << "g"_mst)) ||
- + ]
170 [ - + - - ]: 7166 : ((x << "i"_mst) && (y << "j"_mst)) ||
171 [ + + - + ]: 14340 : ((x << "j"_mst) && (y << "i"_mst)))); // k=k_x*k_y*!(g_x*h_y + h_x*g_y + i_x*j_y + j_x*i_y)
172 : 73 : case Fragment::OR_B: return
173 [ + + ]: 77 : "B"_mst.If(x << "Bd"_mst && y << "Wd"_mst) | // B=B_x*d_x*W_x*d_y
174 [ + + + + ]: 85 : ((x | y) & "o"_mst).If((x | y) << "z"_mst) | // o=o_x*z_y+z_x*o_y
175 [ + + ]: 65 : (x & y & "m"_mst).If((x | y) << "s"_mst && (x & y) << "e"_mst) | // m=m_x*m_y*e_x*e_y*(s_x+s_y)
176 : 146 : (x & y & "zse"_mst) | // z=z_x*z_y, s=s_x*s_y, e=e_x*e_y
177 [ + + ]: 73 : "dux"_mst | // d, u, x
178 [ + + ]: 73 : ((x | y) & "ghij"_mst) | // g=g_x+g_y, h=h_x+h_y, i=i_x+i_y, j=j_x+j_y
179 [ + + ]: 146 : (x & y & "k"_mst); // k=k_x*k_y
180 : 114 : case Fragment::OR_D: return
181 : 114 : (y & "B"_mst).If(x << "Bdu"_mst) | // B=B_y*B_x*d_x*u_x
182 [ + + + + ]: 138 : (x & "o"_mst).If(y << "z"_mst) | // o=o_x*z_y
183 [ + + ]: 100 : (x & y & "m"_mst).If(x << "e"_mst && (x | y) << "s"_mst) | // m=m_x*m_y*e_x*(s_x+s_y)
184 : 228 : (x & y & "zs"_mst) | // z=z_x*z_y, s=s_x*s_y
185 : 228 : (y & "ufde"_mst) | // u=u_y, f=f_y, d=d_y, e=e_y
186 [ + + ]: 114 : "x"_mst | // x
187 [ + + ]: 114 : ((x | y) & "ghij"_mst) | // g=g_x+g_y, h=h_x+h_y, i=i_x+i_y, j=j_x+j_y
188 [ + + ]: 228 : (x & y & "k"_mst); // k=k_x*k_y
189 : 54 : case Fragment::OR_C: return
190 : 54 : (y & "V"_mst).If(x << "Bdu"_mst) | // V=V_y*B_x*u_x*d_x
191 [ + + + + ]: 70 : (x & "o"_mst).If(y << "z"_mst) | // o=o_x*z_y
192 [ + + ]: 50 : (x & y & "m"_mst).If(x << "e"_mst && (x | y) << "s"_mst) | // m=m_x*m_y*e_x*(s_x+s_y)
193 : 108 : (x & y & "zs"_mst) | // z=z_x*z_y, s=s_x*s_y
194 [ + + ]: 54 : "fx"_mst | // f, x
195 [ + + ]: 54 : ((x | y) & "ghij"_mst) | // g=g_x+g_y, h=h_x+h_y, i=i_x+i_y, j=j_x+j_y
196 [ + + ]: 108 : (x & y & "k"_mst); // k=k_x*k_y
197 : 242 : case Fragment::OR_I: return
198 : 242 : (x & y & "VBKufs"_mst) | // V=V_x*V_y, B=B_x*B_y, K=K_x*K_y, u=u_x*u_y, f=f_x*f_y, s=s_x*s_y
199 : 242 : "o"_mst.If((x & y) << "z"_mst) | // o=z_x*z_y
200 [ + + ]: 242 : ((x | y) & "e"_mst).If((x | y) << "f"_mst) | // e=e_x*f_y+f_x*e_y
201 [ + + ]: 242 : (x & y & "m"_mst).If((x | y) << "s"_mst) | // m=m_x*m_y*(s_x+s_y)
202 : 484 : ((x | y) & "d"_mst) | // d=d_x+d_y
203 [ + + ]: 242 : "x"_mst | // x
204 [ + + ]: 242 : ((x | y) & "ghij"_mst) | // g=g_x+g_y, h=h_x+h_y, i=i_x+i_y, j=j_x+j_y
205 [ + + ]: 484 : (x & y & "k"_mst); // k=k_x*k_y
206 : 237 : case Fragment::ANDOR: return
207 [ + + ]: 466 : (y & z & "BKV"_mst).If(x << "Bdu"_mst) | // B=B_x*d_x*u_x*B_y*B_z, K=B_x*d_x*u_x*K_y*K_z, V=B_x*d_x*u_x*V_y*V_z
208 : 474 : (x & y & z & "z"_mst) | // z=z_x*z_y*z_z
209 [ + + + + ]: 349 : ((x | (y & z)) & "o"_mst).If((x | (y & z)) << "z"_mst) | // o=o_x*z_y*z_z+z_x*o_y*o_z
210 [ + + ]: 237 : (y & z & "u"_mst) | // u=u_y*u_z
211 [ + + + + ]: 237 : (z & "f"_mst).If((x << "s"_mst) || (y << "f"_mst)) | // f=(s_x+f_y)*f_z
212 [ + + ]: 237 : (z & "d"_mst) | // d=d_z
213 [ + + + + ]: 237 : (z & "e"_mst).If(x << "s"_mst || y << "f"_mst) | // e=e_z*(s_x+f_y)
214 [ + + ]: 209 : (x & y & z & "m"_mst).If(x << "e"_mst && (x | y | z) << "s"_mst) | // m=m_x*m_y*m_z*e_x*(s_x+s_y+s_z)
215 : 474 : (z & (x | y) & "s"_mst) | // s=s_z*(s_x+s_y)
216 [ + + ]: 237 : "x"_mst | // x
217 [ + + ]: 237 : ((x | y | z) & "ghij"_mst) | // g=g_x+g_y+g_z, h=h_x+h_y+h_z, i=i_x+i_y+i_z, j=j_x+j_y_j_z
218 [ + + - + ]: 237 : "k"_mst.If(((x & y & z) << "k"_mst) &&
219 [ - + - - : 462 : !(((x << "g"_mst) && (y << "h"_mst)) ||
+ + + + ]
220 [ + + + - : 231 : ((x << "h"_mst) && (y << "g"_mst)) ||
- + ]
221 [ - + - - ]: 231 : ((x << "i"_mst) && (y << "j"_mst)) ||
222 [ + + + - ]: 468 : ((x << "j"_mst) && (y << "i"_mst)))); // k=k_x*k_y*k_z* !(g_x*h_y + h_x*g_y + i_x*j_y + j_x*i_y)
223 : 165 : case Fragment::MULTI: {
224 : 165 : return "Bnudemsk"_mst;
225 : : }
226 : 820 : case Fragment::MULTI_A: {
227 : 820 : return "Budemsk"_mst;
228 : : }
229 : 277 : case Fragment::THRESH: {
230 : 277 : bool all_e = true;
231 : 277 : bool all_m = true;
232 : 277 : uint32_t args = 0;
233 : 277 : uint32_t num_s = 0;
234 : 277 : Type acc_tl = "k"_mst;
235 [ + + ]: 1015 : for (size_t i = 0; i < sub_types.size(); ++i) {
236 [ + + ]: 740 : Type t = sub_types[i];
237 : 740 : static constexpr auto WDU{"Wdu"_mst}, BDU{"Bdu"_mst};
238 [ + + + + ]: 740 : if (!(t << (i ? WDU : BDU))) return ""_mst; // Require Bdu, Wdu, Wdu, ...
239 [ + + ]: 738 : if (!(t << "e"_mst)) all_e = false;
240 [ - + ]: 738 : if (!(t << "m"_mst)) all_m = false;
241 [ + + ]: 738 : if (t << "s"_mst) num_s += 1;
242 [ + - + + ]: 738 : args += (t << "z"_mst) ? 0 : (t << "o"_mst) ? 1 : 2;
243 : 738 : acc_tl = ((acc_tl | t) & "ghij"_mst) |
244 : : // Thresh contains a combination of timelocks if it has threshold > 1 and
245 : : // it contains two different children that have different types of timelocks
246 : : // Note how if any of the children don't have "k", the parent also does not have "k"
247 [ + + + + ]: 738 : "k"_mst.If(((acc_tl & t) << "k"_mst) && ((k <= 1) ||
248 [ - + - - : 1180 : ((k > 1) && !(((acc_tl << "g"_mst) && (t << "h"_mst)) ||
+ + + + ]
249 [ + + + - : 594 : ((acc_tl << "h"_mst) && (t << "g"_mst)) ||
+ + ]
250 [ + + - + ]: 594 : ((acc_tl << "i"_mst) && (t << "j"_mst)) ||
251 [ + + + - ]: 798 : ((acc_tl << "j"_mst) && (t << "i"_mst))))));
252 : : }
253 : 550 : return "Bdu"_mst |
254 : 275 : "z"_mst.If(args == 0) | // z=all z
255 [ - + - + ]: 275 : "o"_mst.If(args == 1) | // o=all z except one o
256 [ + + + + : 275 : "e"_mst.If(all_e && num_s == n_subs) | // e=all e and all s
- + ]
257 [ + + + + ]: 275 : "m"_mst.If(all_e && all_m && num_s >= n_subs - k) | // m=all e, >=(n-k) s
258 [ + + + + ]: 530 : "s"_mst.If(num_s >= n_subs - k + 1) | // s= >=(n-k+1) s
259 : 275 : acc_tl; // timelock info
260 : : }
261 : : }
262 : 0 : assert(false);
263 : : }
264 : :
265 : 5307583 : size_t ComputeScriptLen(Fragment fragment, Type sub0typ, size_t subsize, uint32_t k, size_t n_subs,
266 : : size_t n_keys, MiniscriptContext ms_ctx) {
267 [ + + + + : 5307583 : switch (fragment) {
+ + + + +
+ + + + +
- + ]
268 : : case Fragment::JUST_1:
269 : : case Fragment::JUST_0: return 1;
270 [ + + ]: 3648 : case Fragment::PK_K: return IsTapscript(ms_ctx) ? 33 : 34;
271 : 575 : case Fragment::PK_H: return 3 + 21;
272 : 8146 : case Fragment::OLDER:
273 [ - + ]: 8146 : case Fragment::AFTER: return 1 + BuildScript(k).size();
274 : 204 : case Fragment::HASH256:
275 : 204 : case Fragment::SHA256: return 4 + 2 + 33;
276 : 156 : case Fragment::HASH160:
277 : 156 : case Fragment::RIPEMD160: return 4 + 2 + 21;
278 [ - + + - ]: 330 : case Fragment::MULTI: return 1 + BuildScript(n_keys).size() + BuildScript(k).size() + 34 * n_keys;
279 [ - + ]: 820 : case Fragment::MULTI_A: return (1 + 32 + 1) * n_keys + BuildScript(k).size() + 1;
280 : 847 : case Fragment::AND_V: return subsize;
281 : 976 : case Fragment::WRAP_V: return subsize + (sub0typ << "x"_mst);
282 : 5282942 : case Fragment::WRAP_S:
283 : 5282942 : case Fragment::WRAP_C:
284 : 5282942 : case Fragment::WRAP_N:
285 : 5282942 : case Fragment::AND_B:
286 : 5282942 : case Fragment::OR_B: return subsize + 1;
287 : 7589 : case Fragment::WRAP_A:
288 : 7589 : case Fragment::OR_C: return subsize + 2;
289 : 697 : case Fragment::WRAP_D:
290 : 697 : case Fragment::OR_D:
291 : 697 : case Fragment::OR_I:
292 : 697 : case Fragment::ANDOR: return subsize + 3;
293 : 16 : case Fragment::WRAP_J: return subsize + 4;
294 [ - + ]: 277 : case Fragment::THRESH: return subsize + n_subs + BuildScript(k).size();
295 : : }
296 : 0 : assert(false);
297 : : }
298 : :
299 : 98359547 : InputStack& InputStack::SetAvailable(Availability avail) {
300 : 98359547 : available = avail;
301 [ + + ]: 98359547 : if (avail == Availability::NO) {
302 : 98168166 : stack.clear();
303 : 98168166 : size = std::numeric_limits<size_t>::max();
304 : 98168166 : has_sig = false;
305 : 98168166 : malleable = false;
306 : 98168166 : non_canon = false;
307 : : }
308 : 98359547 : return *this;
309 : : }
310 : :
311 : 479254 : InputStack& InputStack::SetWithSig() {
312 : 479254 : has_sig = true;
313 : 479254 : return *this;
314 : : }
315 : :
316 : 818636 : InputStack& InputStack::SetNonCanon() {
317 : 818636 : non_canon = true;
318 : 818636 : return *this;
319 : : }
320 : :
321 : 820714 : InputStack& InputStack::SetMalleable(bool x) {
322 : 820714 : malleable = x;
323 : 820714 : return *this;
324 : : }
325 : :
326 : 98623243 : InputStack operator+(InputStack a, InputStack b) {
327 [ + - ]: 98623243 : a.stack = Cat(std::move(a.stack), std::move(b.stack));
328 [ + + + + ]: 98623243 : if (a.available != Availability::NO && b.available != Availability::NO) a.size += b.size;
329 : 98623243 : a.has_sig |= b.has_sig;
330 : 98623243 : a.malleable |= b.malleable;
331 : 98623243 : a.non_canon |= b.non_canon;
332 [ + + + + ]: 98623243 : if (a.available == Availability::NO || b.available == Availability::NO) {
333 : 97874848 : a.SetAvailable(Availability::NO);
334 [ + - - + ]: 748395 : } else if (a.available == Availability::MAYBE || b.available == Availability::MAYBE) {
335 : 0 : a.SetAvailable(Availability::MAYBE);
336 : : }
337 : 98623243 : return a;
338 : : }
339 : :
340 : 49207344 : InputStack operator|(InputStack a, InputStack b) {
341 : : // If only one is invalid, pick the other one. If both are invalid, pick an arbitrary one.
342 [ + + ]: 49207344 : if (a.available == Availability::NO) return b;
343 [ + + ]: 766092 : if (b.available == Availability::NO) return a;
344 : : // If only one of the solutions has a signature, we must pick the other one.
345 [ + + + + ]: 206573 : if (!a.has_sig && b.has_sig) return a;
346 [ + + + + ]: 11123 : if (!b.has_sig && a.has_sig) return b;
347 [ + + + - ]: 10955 : if (!a.has_sig && !b.has_sig) {
348 : : // If neither solution requires a signature, the result is inevitably malleable.
349 : 1042 : a.malleable = true;
350 : 1042 : b.malleable = true;
351 : : } else {
352 : : // If both options require a signature, prefer the non-malleable one.
353 [ + + + - ]: 9913 : if (b.malleable && !a.malleable) return a;
354 [ + + + - ]: 9881 : if (a.malleable && !b.malleable) return b;
355 : : }
356 : : // Between two malleable or two non-malleable solutions, pick the smaller one between
357 : : // YESes, and the bigger ones between MAYBEs. Prefer YES over MAYBE.
358 [ + - + - ]: 10918 : if (a.available == Availability::YES && b.available == Availability::YES) {
359 [ + + ]: 11663 : return std::move(a.size <= b.size ? a : b);
360 [ # # # # ]: 0 : } else if (a.available == Availability::MAYBE && b.available == Availability::MAYBE) {
361 [ # # ]: 0 : return std::move(a.size >= b.size ? a : b);
362 [ # # ]: 0 : } else if (a.available == Availability::YES) {
363 : 0 : return a;
364 : : } else {
365 : 0 : return b;
366 : : }
367 : : }
368 : :
369 : 2744 : std::optional<std::vector<Opcode>> DecomposeScript(const CScript& script)
370 : : {
371 : 2744 : std::vector<Opcode> out;
372 [ + + ]: 5488 : CScript::const_iterator it = script.begin(), itend = script.end();
373 [ + + ]: 5170007 : while (it != itend) {
374 : 5167267 : std::vector<unsigned char> push_data;
375 : 5167267 : opcodetype opcode;
376 [ + - - + ]: 5167267 : if (!script.GetOp(it, opcode, push_data)) {
377 : 0 : return {};
378 [ + + ]: 5167267 : } else if (opcode >= OP_1 && opcode <= OP_16) {
379 : : // Deal with OP_n (GetOp does not turn them into pushes).
380 [ + - ]: 3571 : push_data.assign(1, CScript::DecodeOP_N(opcode));
381 [ + + ]: 5163696 : } else if (opcode == OP_CHECKSIGVERIFY) {
382 : : // Decompose OP_CHECKSIGVERIFY into OP_CHECKSIG OP_VERIFY
383 [ + - ]: 243 : out.emplace_back(OP_CHECKSIG, std::vector<unsigned char>());
384 : 243 : opcode = OP_VERIFY;
385 [ + + ]: 5163453 : } else if (opcode == OP_CHECKMULTISIGVERIFY) {
386 : : // Decompose OP_CHECKMULTISIGVERIFY into OP_CHECKMULTISIG OP_VERIFY
387 [ + - ]: 23 : out.emplace_back(OP_CHECKMULTISIG, std::vector<unsigned char>());
388 : 23 : opcode = OP_VERIFY;
389 [ + + ]: 5163430 : } else if (opcode == OP_EQUALVERIFY) {
390 : : // Decompose OP_EQUALVERIFY into OP_EQUAL OP_VERIFY
391 [ + - ]: 1042 : out.emplace_back(OP_EQUAL, std::vector<unsigned char>());
392 : 1042 : opcode = OP_VERIFY;
393 [ + + ]: 5162388 : } else if (opcode == OP_NUMEQUALVERIFY) {
394 : : // Decompose OP_NUMEQUALVERIFY into OP_NUMEQUAL OP_VERIFY
395 [ + - ]: 1 : out.emplace_back(OP_NUMEQUAL, std::vector<unsigned char>());
396 : 1 : opcode = OP_VERIFY;
397 [ + + ]: 5162387 : } else if (IsPushdataOp(opcode)) {
398 [ + - + + ]: 102918 : if (!CheckMinimalPush(push_data, opcode)) return {};
399 [ + + + + : 5059469 : } else if (it != itend && (opcode == OP_CHECKSIG || opcode == OP_CHECKMULTISIG || opcode == OP_EQUAL || opcode == OP_NUMEQUAL) && (*it == OP_VERIFY)) {
+ + ]
400 : : // Rule out non minimal VERIFY sequences
401 : 2 : return {};
402 : : }
403 [ + - ]: 5167263 : out.emplace_back(opcode, std::move(push_data));
404 : 5167267 : }
405 : 2740 : std::reverse(out.begin(), out.end());
406 : 2740 : return out;
407 : 2744 : }
408 : :
409 : 4083 : std::optional<int64_t> ParseScriptNumber(const Opcode& in) {
410 [ - + ]: 4083 : if (in.first == OP_0) {
411 : 0 : return 0;
412 : : }
413 [ + + ]: 4083 : if (!in.second.empty()) {
414 [ + + - + ]: 4082 : if (IsPushdataOp(in.first) && !CheckMinimalPush(in.second, in.first)) return {};
415 : 4082 : try {
416 [ + - ]: 4082 : return CScriptNum(in.second, true).GetInt64();
417 [ - - ]: 0 : } catch(const scriptnum_error&) {}
418 : : }
419 : 1 : return {};
420 : : }
421 : :
422 : 7107 : int FindNextChar(Span<const char> sp, const char m)
423 : : {
424 [ + - ]: 114053 : for (int i = 0; i < (int)sp.size(); ++i) {
425 [ + + ]: 114053 : if (sp[i] == m) return i;
426 : : // We only search within the current parentheses
427 [ + + ]: 106991 : if (sp[i] == ')') break;
428 : : }
429 : : return -1;
430 : : }
431 : :
432 : : } // namespace internal
433 : : } // namespace miniscript
|
