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 : 13676308 : Type SanitizeType(Type e) {
20 [ + + ]: 13676308 : int num_types = (e << "K"_mst) + (e << "V"_mst) + (e << "B"_mst) + (e << "W"_mst);
21 [ + + ]: 13676308 : if (num_types == 0) return ""_mst; // No valid type, don't care about the rest
22 [ - + ]: 8788814 : assert(num_types == 1); // K, V, B, W all conflict with each other
23 [ + + - + ]: 8788814 : assert(!(e << "z"_mst) || !(e << "o"_mst)); // z conflicts with o
24 [ + + - + ]: 8788814 : assert(!(e << "n"_mst) || !(e << "z"_mst)); // n conflicts with z
25 [ + + - + ]: 8788814 : assert(!(e << "n"_mst) || !(e << "W"_mst)); // n conflicts with W
26 [ + + - + ]: 8788814 : assert(!(e << "V"_mst) || !(e << "d"_mst)); // V conflicts with d
27 [ + + - + ]: 8788814 : assert(!(e << "K"_mst) || (e << "u"_mst)); // K implies u
28 [ + + - + ]: 8788814 : assert(!(e << "V"_mst) || !(e << "u"_mst)); // V conflicts with u
29 [ + + - + ]: 8788814 : assert(!(e << "e"_mst) || !(e << "f"_mst)); // e conflicts with f
30 [ + + - + ]: 8788814 : assert(!(e << "e"_mst) || (e << "d"_mst)); // e implies d
31 [ + + - + ]: 8788814 : assert(!(e << "V"_mst) || !(e << "e"_mst)); // V conflicts with e
32 [ + + - + ]: 8788814 : assert(!(e << "d"_mst) || !(e << "f"_mst)); // d conflicts with f
33 [ + + - + ]: 8788814 : assert(!(e << "V"_mst) || (e << "f"_mst)); // V implies f
34 [ + + - + ]: 8788814 : assert(!(e << "K"_mst) || (e << "s"_mst)); // K implies s
35 [ + + - + ]: 8788814 : assert(!(e << "z"_mst) || (e << "m"_mst)); // z implies m
36 : 8788814 : return e;
37 : : }
38 : :
39 : 16513098 : 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 [ + + ]: 16513098 : if (fragment == Fragment::SHA256 || fragment == Fragment::HASH256) {
43 [ - + ]: 20438 : assert(data_size == 32);
44 [ + + ]: 16492660 : } else if (fragment == Fragment::RIPEMD160 || fragment == Fragment::HASH160) {
45 [ - + ]: 20317 : assert(data_size == 20);
46 : : } else {
47 [ - + ]: 16472343 : assert(data_size == 0);
48 : : }
49 : : // Sanity check on k
50 [ + + ]: 16513098 : if (fragment == Fragment::OLDER || fragment == Fragment::AFTER) {
51 [ - + ]: 84503 : assert(k >= 1 && k < 0x80000000UL);
52 [ + + ]: 16428595 : } else if (fragment == Fragment::MULTI || fragment == Fragment::MULTI_A) {
53 [ + - - + ]: 34488 : assert(k >= 1 && k <= n_keys);
54 [ + + ]: 16394107 : } else if (fragment == Fragment::THRESH) {
55 [ + - - + ]: 459278 : assert(k >= 1 && k <= n_subs);
56 : : } else {
57 [ - + ]: 15934829 : assert(k == 0);
58 : : }
59 : : // Sanity check on subs
60 : 16513098 : if (fragment == Fragment::AND_V || fragment == Fragment::AND_B || fragment == Fragment::OR_B ||
61 [ + + + + ]: 16513098 : fragment == Fragment::OR_C || fragment == Fragment::OR_I || fragment == Fragment::OR_D) {
62 [ - + ]: 5943826 : assert(n_subs == 2);
63 [ + + ]: 10569272 : } else if (fragment == Fragment::ANDOR) {
64 [ - + ]: 442966 : assert(n_subs == 3);
65 : 10126306 : } else if (fragment == Fragment::WRAP_A || fragment == Fragment::WRAP_S || fragment == Fragment::WRAP_C ||
66 [ + + ]: 10126306 : fragment == Fragment::WRAP_D || fragment == Fragment::WRAP_V || fragment == Fragment::WRAP_J ||
67 : : fragment == Fragment::WRAP_N) {
68 [ - + ]: 3351894 : assert(n_subs == 1);
69 [ + + ]: 6774412 : } else if (fragment != Fragment::THRESH) {
70 [ - + ]: 6315134 : assert(n_subs == 0);
71 : : }
72 : : // Sanity check on keys
73 [ + + ]: 16053820 : if (fragment == Fragment::PK_K || fragment == Fragment::PK_H) {
74 [ - + ]: 92392 : assert(n_keys == 1);
75 [ + + ]: 16420706 : } else if (fragment == Fragment::MULTI) {
76 [ - + ]: 26891 : assert(n_keys >= 1 && n_keys <= MAX_PUBKEYS_PER_MULTISIG);
77 [ - + ]: 26891 : assert(!IsTapscript(ms_ctx));
78 [ + + ]: 16393815 : } else if (fragment == Fragment::MULTI_A) {
79 [ - + ]: 7597 : assert(n_keys >= 1 && n_keys <= MAX_PUBKEYS_PER_MULTI_A);
80 [ - + ]: 7597 : assert(IsTapscript(ms_ctx));
81 : : } else {
82 [ - + ]: 16386218 : 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 [ + + + + : 16513098 : switch (fragment) {
+ + + + +
+ + + + +
+ + + + +
+ + + + +
+ + + - ]
89 : 56605 : case Fragment::PK_K: return "Konudemsxk"_mst;
90 : 35787 : case Fragment::PK_H: return "Knudemsxk"_mst;
91 : 43908 : case Fragment::OLDER: return
92 : 43908 : "g"_mst.If(k & CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG) |
93 [ + + ]: 43908 : "h"_mst.If(!(k & CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG)) |
94 [ + + ]: 87816 : "Bzfmxk"_mst;
95 : 40595 : case Fragment::AFTER: return
96 : 40595 : "i"_mst.If(k >= LOCKTIME_THRESHOLD) |
97 [ + + ]: 40595 : "j"_mst.If(k < LOCKTIME_THRESHOLD) |
98 [ + + ]: 81190 : "Bzfmxk"_mst;
99 : 8995 : case Fragment::SHA256: return "Bonudmk"_mst;
100 : 9953 : case Fragment::RIPEMD160: return "Bonudmk"_mst;
101 : 11443 : case Fragment::HASH256: return "Bonudmk"_mst;
102 : 10364 : case Fragment::HASH160: return "Bonudmk"_mst;
103 : 1889373 : case Fragment::JUST_1: return "Bzufmxk"_mst;
104 : 4173623 : case Fragment::JUST_0: return "Bzudemsxk"_mst;
105 : 397796 : case Fragment::WRAP_A: return
106 : 397796 : "W"_mst.If(x << "B"_mst) | // W=B_x
107 [ + + ]: 397796 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
108 : 795592 : (x & "udfems"_mst) | // u=u_x, d=d_x, f=f_x, e=e_x, m=m_x, s=s_x
109 [ + + ]: 574082 : "x"_mst; // x
110 : 198691 : case Fragment::WRAP_S: return
111 : 198691 : "W"_mst.If(x << "Bo"_mst) | // W=B_x*o_x
112 [ + + ]: 198691 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
113 [ + + ]: 232853 : (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 : 822964 : case Fragment::WRAP_C: return
115 : 822964 : "B"_mst.If(x << "K"_mst) | // B=K_x
116 [ + + ]: 822964 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
117 : 1645928 : (x & "ondfem"_mst) | // o=o_x, n=n_x, d=d_x, f=f_x, e=e_x, m=m_x
118 [ + + ]: 891529 : "us"_mst; // u, s
119 : 234437 : case Fragment::WRAP_D: return
120 : 234437 : "B"_mst.If(x << "Vz"_mst) | // B=V_x*z_x
121 [ + + ]: 234437 : "o"_mst.If(x << "z"_mst) | // o=z_x
122 [ + + ]: 234437 : "e"_mst.If(x << "f"_mst) | // e=f_x
123 [ + + ]: 234437 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
124 : 468874 : (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 [ + + + + ]: 449899 : "u"_mst.If(IsTapscript(ms_ctx)) |
127 : 468874 : "ndx"_mst; // n, d, x
128 : 261357 : case Fragment::WRAP_V: return
129 : 261357 : "V"_mst.If(x << "B"_mst) | // V=B_x
130 [ + + ]: 261357 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
131 : 522714 : (x & "zonms"_mst) | // z=z_x, o=o_x, n=n_x, m=m_x, s=s_x
132 [ + + ]: 433749 : "fx"_mst; // f, x
133 : 289047 : case Fragment::WRAP_J: return
134 : 289047 : "B"_mst.If(x << "Bn"_mst) | // B=B_x*n_x
135 [ + + ]: 289047 : "e"_mst.If(x << "f"_mst) | // e=f_x
136 [ + + ]: 289047 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
137 : 578094 : (x & "oums"_mst) | // o=o_x, u=u_x, m=m_x, s=s_x
138 [ + + ]: 578094 : "ndx"_mst; // n, d, x
139 : 1147602 : case Fragment::WRAP_N: return
140 : 1147602 : (x & "ghijk"_mst) | // g=g_x, h=h_x, i=i_x, j=j_x, k=k_x
141 : 1147602 : (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 : 1147602 : "ux"_mst; // u, x
143 : 2077770 : case Fragment::AND_V: return
144 [ + + + + ]: 4291679 : (y & "KVB"_mst).If(x << "V"_mst) | // B=V_x*B_y, V=V_x*V_y, K=V_x*K_y
145 [ + + ]: 2077770 : (x & "n"_mst) | (y & "n"_mst).If(x << "z"_mst) | // n=n_x+z_x*n_y
146 [ + + ]: 2077770 : ((x | y) & "o"_mst).If((x | y) << "z"_mst) | // o=o_x*z_y+z_x*o_y
147 [ + + ]: 2077770 : (x & y & "dmz"_mst) | // d=d_x*d_y, m=m_x*m_y, z=z_x*z_y
148 [ + + ]: 2077770 : ((x | y) & "s"_mst) | // s=s_x+s_y
149 [ + + ]: 376545 : "f"_mst.If((y << "f"_mst) || (x << "s"_mst)) | // f=f_y+s_x
150 [ + + ]: 2077770 : (y & "ux"_mst) | // u=u_y, x=x_y
151 [ + + ]: 2077770 : ((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 [ + + + + ]: 2077770 : "k"_mst.If(((x & y) << "k"_mst) &&
153 [ + + + + : 272366 : !(((x << "g"_mst) && (y << "h"_mst)) ||
+ + + + ]
154 [ + + + + : 137229 : ((x << "h"_mst) && (y << "g"_mst)) ||
+ + ]
155 [ + + + + ]: 135958 : ((x << "i"_mst) && (y << "j"_mst)) ||
156 [ + + + + ]: 2212268 : ((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 : 390944 : case Fragment::AND_B: return
158 : 390944 : (x & "B"_mst).If(y << "W"_mst) | // B=B_x*W_y
159 [ + + + + ]: 552347 : ((x | y) & "o"_mst).If((x | y) << "z"_mst) | // o=o_x*z_y+z_x*o_y
160 [ + + ]: 390944 : (x & "n"_mst) | (y & "n"_mst).If(x << "z"_mst) | // n=n_x+z_x*n_y
161 [ + + + + ]: 408308 : (x & y & "e"_mst).If((x & y) << "s"_mst) | // e=e_x*e_y*s_x*s_y
162 [ + + ]: 390944 : (x & y & "dzm"_mst) | // d=d_x*d_y, z=z_x*z_y, m=m_x*m_y
163 [ + + + + ]: 380079 : "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 : 781888 : ((x | y) & "s"_mst) | // s=s_x+s_y
165 [ + + ]: 390944 : "ux"_mst | // u, x
166 [ + + ]: 390944 : ((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 [ + + + + ]: 390944 : "k"_mst.If(((x & y) << "k"_mst) &&
168 [ + + + + : 70444 : !(((x << "g"_mst) && (y << "h"_mst)) ||
+ + + + ]
169 [ + + + + : 35419 : ((x << "h"_mst) && (y << "g"_mst)) ||
+ + ]
170 [ + + + + ]: 34464 : ((x << "i"_mst) && (y << "j"_mst)) ||
171 [ + + + + ]: 424871 : ((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 : 417122 : case Fragment::OR_B: return
173 [ + + ]: 484336 : "B"_mst.If(x << "Bd"_mst && y << "Wd"_mst) | // B=B_x*d_x*W_x*d_y
174 [ + + + + ]: 589898 : ((x | y) & "o"_mst).If((x | y) << "z"_mst) | // o=o_x*z_y+z_x*o_y
175 [ + + ]: 33062 : (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 : 834244 : (x & y & "zse"_mst) | // z=z_x*z_y, s=s_x*s_y, e=e_x*e_y
177 [ + + ]: 417122 : "dux"_mst | // d, u, x
178 [ + + ]: 417122 : ((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 [ + + ]: 834244 : (x & y & "k"_mst); // k=k_x*k_y
180 : 406893 : case Fragment::OR_D: return
181 : 406893 : (y & "B"_mst).If(x << "Bdu"_mst) | // B=B_y*B_x*d_x*u_x
182 [ + + + + ]: 512613 : (x & "o"_mst).If(y << "z"_mst) | // o=o_x*z_y
183 [ + + ]: 36721 : (x & y & "m"_mst).If(x << "e"_mst && (x | y) << "s"_mst) | // m=m_x*m_y*e_x*(s_x+s_y)
184 : 813786 : (x & y & "zs"_mst) | // z=z_x*z_y, s=s_x*s_y
185 : 813786 : (y & "ufde"_mst) | // u=u_y, f=f_y, d=d_y, e=e_y
186 [ + + ]: 406893 : "x"_mst | // x
187 [ + + ]: 406893 : ((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 [ + + ]: 813786 : (x & y & "k"_mst); // k=k_x*k_y
189 : 392907 : case Fragment::OR_C: return
190 : 392907 : (y & "V"_mst).If(x << "Bdu"_mst) | // V=V_y*B_x*u_x*d_x
191 [ + + + + ]: 486142 : (x & "o"_mst).If(y << "z"_mst) | // o=o_x*z_y
192 [ + + ]: 16801 : (x & y & "m"_mst).If(x << "e"_mst && (x | y) << "s"_mst) | // m=m_x*m_y*e_x*(s_x+s_y)
193 : 785814 : (x & y & "zs"_mst) | // z=z_x*z_y, s=s_x*s_y
194 [ + + ]: 392907 : "fx"_mst | // f, x
195 [ + + ]: 392907 : ((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 [ + + ]: 785814 : (x & y & "k"_mst); // k=k_x*k_y
197 : 2258190 : case Fragment::OR_I: return
198 : 2258190 : (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 : 2258190 : "o"_mst.If((x & y) << "z"_mst) | // o=z_x*z_y
200 [ + + ]: 2258190 : ((x | y) & "e"_mst).If((x | y) << "f"_mst) | // e=e_x*f_y+f_x*e_y
201 [ + + ]: 2258190 : (x & y & "m"_mst).If((x | y) << "s"_mst) | // m=m_x*m_y*(s_x+s_y)
202 : 4516380 : ((x | y) & "d"_mst) | // d=d_x+d_y
203 [ + + ]: 2258190 : "x"_mst | // x
204 [ + + ]: 2258190 : ((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 [ + + ]: 4516380 : (x & y & "k"_mst); // k=k_x*k_y
206 : 442966 : case Fragment::ANDOR: return
207 [ + + ]: 537450 : (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 : 885932 : (x & y & z & "z"_mst) | // z=z_x*z_y*z_z
209 [ + + + + ]: 581068 : ((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 [ + + ]: 442966 : (y & z & "u"_mst) | // u=u_y*u_z
211 [ + + + + ]: 442966 : (z & "f"_mst).If((x << "s"_mst) || (y << "f"_mst)) | // f=(s_x+f_y)*f_z
212 [ + + ]: 442966 : (z & "d"_mst) | // d=d_z
213 [ + + + + ]: 442966 : (z & "e"_mst).If(x << "s"_mst || y << "f"_mst) | // e=e_z*(s_x+f_y)
214 [ + + ]: 50499 : (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 : 885932 : (z & (x | y) & "s"_mst) | // s=s_z*(s_x+s_y)
216 [ + + ]: 442966 : "x"_mst | // x
217 [ + + ]: 442966 : ((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 [ + + + + ]: 442966 : "k"_mst.If(((x & y & z) << "k"_mst) &&
219 [ + + + + : 114576 : !(((x << "g"_mst) && (y << "h"_mst)) ||
+ + + + ]
220 [ + + + + : 57981 : ((x << "h"_mst) && (y << "g"_mst)) ||
+ + ]
221 [ + + + + ]: 57021 : ((x << "i"_mst) && (y << "j"_mst)) ||
222 [ + + + + ]: 499096 : ((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 : 26891 : case Fragment::MULTI: {
224 : 26891 : return "Bnudemsk"_mst;
225 : : }
226 : 7597 : case Fragment::MULTI_A: {
227 : 7597 : return "Budemsk"_mst;
228 : : }
229 : 459278 : case Fragment::THRESH: {
230 : 459278 : bool all_e = true;
231 : 459278 : bool all_m = true;
232 : 459278 : uint32_t args = 0;
233 : 459278 : uint32_t num_s = 0;
234 : 459278 : Type acc_tl = "k"_mst;
235 [ + + ]: 647184 : for (size_t i = 0; i < sub_types.size(); ++i) {
236 [ + + ]: 582089 : Type t = sub_types[i];
237 : 582089 : static constexpr auto WDU{"Wdu"_mst}, BDU{"Bdu"_mst};
238 [ + + + + ]: 582089 : if (!(t << (i ? WDU : BDU))) return ""_mst; // Require Bdu, Wdu, Wdu, ...
239 [ + + ]: 187906 : if (!(t << "e"_mst)) all_e = false;
240 [ + + ]: 187906 : if (!(t << "m"_mst)) all_m = false;
241 [ + + ]: 187906 : if (t << "s"_mst) num_s += 1;
242 [ + + + + ]: 187906 : args += (t << "z"_mst) ? 0 : (t << "o"_mst) ? 1 : 2;
243 : 187906 : 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 [ + + + + ]: 187906 : "k"_mst.If(((acc_tl & t) << "k"_mst) && ((k <= 1) ||
248 [ + + + + : 130837 : ((k > 1) && !(((acc_tl << "g"_mst) && (t << "h"_mst)) ||
+ + + + ]
249 [ + + + + : 66209 : ((acc_tl << "h"_mst) && (t << "g"_mst)) ||
+ + ]
250 [ + + + + ]: 65280 : ((acc_tl << "i"_mst) && (t << "j"_mst)) ||
251 [ + + + + ]: 192170 : ((acc_tl << "j"_mst) && (t << "i"_mst))))));
252 : : }
253 : 130190 : return "Bdu"_mst |
254 : 65095 : "z"_mst.If(args == 0) | // z=all z
255 [ + + + + ]: 73619 : "o"_mst.If(args == 1) | // o=all z except one o
256 [ + + + + : 65095 : "e"_mst.If(all_e && num_s == n_subs) | // e=all e and all s
+ + ]
257 [ + + + + ]: 65095 : "m"_mst.If(all_e && all_m && num_s >= n_subs - k) | // m=all e, >=(n-k) s
258 [ + + + + ]: 112181 : "s"_mst.If(num_s >= n_subs - k + 1) | // s= >=(n-k+1) s
259 : 65095 : acc_tl; // timelock info
260 : : }
261 : : }
262 : 0 : assert(false);
263 : : }
264 : :
265 : 13933868 : 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 [ + + + + : 13933868 : switch (fragment) {
+ + + + +
+ + + + +
- + ]
268 : : case Fragment::JUST_1:
269 : : case Fragment::JUST_0: return 1;
270 [ + + ]: 67673 : case Fragment::PK_K: return IsTapscript(ms_ctx) ? 33 : 34;
271 : 41682 : case Fragment::PK_H: return 3 + 21;
272 : 91750 : case Fragment::OLDER:
273 [ - + ]: 91750 : case Fragment::AFTER: return 1 + BuildScript(k).size();
274 : 26574 : case Fragment::HASH256:
275 : 26574 : case Fragment::SHA256: return 4 + 2 + 33;
276 : 25950 : case Fragment::HASH160:
277 : 25950 : case Fragment::RIPEMD160: return 4 + 2 + 21;
278 [ - + + - ]: 68278 : case Fragment::MULTI: return 1 + BuildScript(n_keys).size() + BuildScript(k).size() + 34 * n_keys;
279 [ - + ]: 8771 : case Fragment::MULTI_A: return (1 + 32 + 1) * n_keys + BuildScript(k).size() + 1;
280 : 1759661 : case Fragment::AND_V: return subsize;
281 : 283784 : case Fragment::WRAP_V: return subsize + (sub0typ << "x"_mst);
282 : 2290090 : case Fragment::WRAP_S:
283 : 2290090 : case Fragment::WRAP_C:
284 : 2290090 : case Fragment::WRAP_N:
285 : 2290090 : case Fragment::AND_B:
286 : 2290090 : case Fragment::OR_B: return subsize + 1;
287 : 443508 : case Fragment::WRAP_A:
288 : 443508 : case Fragment::OR_C: return subsize + 2;
289 : 2365622 : case Fragment::WRAP_D:
290 : 2365622 : case Fragment::OR_D:
291 : 2365622 : case Fragment::OR_I:
292 : 2365622 : case Fragment::ANDOR: return subsize + 3;
293 : 286251 : case Fragment::WRAP_J: return subsize + 4;
294 [ - + ]: 92683 : case Fragment::THRESH: return subsize + n_subs + BuildScript(k).size();
295 : : }
296 : 0 : assert(false);
297 : : }
298 : :
299 : 2376066 : InputStack& InputStack::SetAvailable(Availability avail) {
300 : 2376066 : available = avail;
301 [ + + ]: 2376066 : if (avail == Availability::NO) {
302 : 2295452 : stack.clear();
303 : 2295452 : size = std::numeric_limits<size_t>::max();
304 : 2295452 : has_sig = false;
305 : 2295452 : malleable = false;
306 : 2295452 : non_canon = false;
307 : : }
308 : 2376066 : return *this;
309 : : }
310 : :
311 : 123360 : InputStack& InputStack::SetWithSig() {
312 : 123360 : has_sig = true;
313 : 123360 : return *this;
314 : : }
315 : :
316 : 104846 : InputStack& InputStack::SetNonCanon() {
317 : 104846 : non_canon = true;
318 : 104846 : return *this;
319 : : }
320 : :
321 : 54012 : InputStack& InputStack::SetMalleable(bool x) {
322 : 54012 : malleable = x;
323 : 54012 : return *this;
324 : : }
325 : :
326 : 3513326 : InputStack operator+(InputStack a, InputStack b) {
327 [ + - ]: 3513326 : a.stack = Cat(std::move(a.stack), std::move(b.stack));
328 [ + + + + ]: 3513326 : if (a.available != Availability::NO && b.available != Availability::NO) a.size += b.size;
329 : 3513326 : a.has_sig |= b.has_sig;
330 : 3513326 : a.malleable |= b.malleable;
331 : 3513326 : a.non_canon |= b.non_canon;
332 [ + + + + ]: 3513326 : if (a.available == Availability::NO || b.available == Availability::NO) {
333 : 2231394 : a.SetAvailable(Availability::NO);
334 [ + - - + ]: 1281932 : } else if (a.available == Availability::MAYBE || b.available == Availability::MAYBE) {
335 : 0 : a.SetAvailable(Availability::MAYBE);
336 : : }
337 : 3513326 : return a;
338 : : }
339 : :
340 : 1793582 : 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 [ + + ]: 1793582 : if (a.available == Availability::NO) return b;
343 [ + + ]: 718592 : if (b.available == Availability::NO) return a;
344 : : // If only one of the solutions has a signature, we must pick the other one.
345 [ + + + + ]: 501986 : if (!a.has_sig && b.has_sig) return a;
346 [ + + + + ]: 496958 : if (!b.has_sig && a.has_sig) return b;
347 [ + + + - ]: 490118 : if (!a.has_sig && !b.has_sig) {
348 : : // If neither solution requires a signature, the result is inevitably malleable.
349 : 48024 : a.malleable = true;
350 : 48024 : b.malleable = true;
351 : : } else {
352 : : // If both options require a signature, prefer the non-malleable one.
353 [ + + + + ]: 442094 : if (b.malleable && !a.malleable) return a;
354 [ + + + + ]: 440358 : 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 [ + - + - ]: 487316 : if (a.available == Availability::YES && b.available == Availability::YES) {
359 [ + + ]: 509570 : 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 : 16684 : std::optional<std::vector<Opcode>> DecomposeScript(const CScript& script)
370 : : {
371 : 16684 : std::vector<Opcode> out;
372 [ + + ]: 33368 : CScript::const_iterator it = script.begin(), itend = script.end();
373 [ + + ]: 6354724 : while (it != itend) {
374 : 6339007 : std::vector<unsigned char> push_data;
375 : 6339007 : opcodetype opcode;
376 [ + - + + ]: 6339007 : if (!script.GetOp(it, opcode, push_data)) {
377 : 904 : return {};
378 [ + + ]: 6338103 : } else if (opcode >= OP_1 && opcode <= OP_16) {
379 : : // Deal with OP_n (GetOp does not turn them into pushes).
380 [ + - ]: 161752 : push_data.assign(1, CScript::DecodeOP_N(opcode));
381 [ + + ]: 6176351 : } else if (opcode == OP_CHECKSIGVERIFY) {
382 : : // Decompose OP_CHECKSIGVERIFY into OP_CHECKSIG OP_VERIFY
383 [ + - ]: 10383 : out.emplace_back(OP_CHECKSIG, std::vector<unsigned char>());
384 : 10383 : opcode = OP_VERIFY;
385 [ + + ]: 6165968 : } else if (opcode == OP_CHECKMULTISIGVERIFY) {
386 : : // Decompose OP_CHECKMULTISIGVERIFY into OP_CHECKMULTISIG OP_VERIFY
387 [ + - ]: 5300 : out.emplace_back(OP_CHECKMULTISIG, std::vector<unsigned char>());
388 : 5300 : opcode = OP_VERIFY;
389 [ + + ]: 6160668 : } else if (opcode == OP_EQUALVERIFY) {
390 : : // Decompose OP_EQUALVERIFY into OP_EQUAL OP_VERIFY
391 [ + - ]: 44806 : out.emplace_back(OP_EQUAL, std::vector<unsigned char>());
392 : 44806 : opcode = OP_VERIFY;
393 [ + + ]: 6115862 : } else if (opcode == OP_NUMEQUALVERIFY) {
394 : : // Decompose OP_NUMEQUALVERIFY into OP_NUMEQUAL OP_VERIFY
395 [ + - ]: 2421 : out.emplace_back(OP_NUMEQUAL, std::vector<unsigned char>());
396 : 2421 : opcode = OP_VERIFY;
397 [ + + ]: 6113441 : } else if (IsPushdataOp(opcode)) {
398 [ + - + + ]: 152162 : if (!CheckMinimalPush(push_data, opcode)) return {};
399 [ + + + + : 5961279 : } 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 : 4 : return {};
402 : : }
403 [ + - ]: 6338040 : out.emplace_back(opcode, std::move(push_data));
404 : 6339007 : }
405 : 15717 : std::reverse(out.begin(), out.end());
406 : 15717 : return out;
407 : 16684 : }
408 : :
409 : 96286 : std::optional<int64_t> ParseScriptNumber(const Opcode& in) {
410 [ + + ]: 96286 : if (in.first == OP_0) {
411 : 55 : return 0;
412 : : }
413 [ + + ]: 96231 : if (!in.second.empty()) {
414 [ + + - + ]: 96103 : if (IsPushdataOp(in.first) && !CheckMinimalPush(in.second, in.first)) return {};
415 : 96103 : try {
416 [ + + ]: 96103 : return CScriptNum(in.second, true).GetInt64();
417 [ - + ]: 463 : } catch(const scriptnum_error&) {}
418 : : }
419 : 591 : return {};
420 : : }
421 : :
422 : 314750 : int FindNextChar(Span<const char> sp, const char m)
423 : : {
424 [ + + ]: 8997031 : for (int i = 0; i < (int)sp.size(); ++i) {
425 [ + + ]: 8996867 : if (sp[i] == m) return i;
426 : : // We only search within the current parentheses
427 [ + + ]: 8698232 : if (sp[i] == ')') break;
428 : : }
429 : : return -1;
430 : : }
431 : :
432 : : } // namespace internal
433 : : } // namespace miniscript
|
