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