Line data Source code
1 : #define FD_UNALIGNED_ACCESS_STYLE 0
2 : #include "fd_pack.h"
3 : #include "fd_pack_cost.h"
4 : #include "fd_pack_bitset.h"
5 : #include "fd_pack_unwritable.h"
6 : #include "fd_chkdup.h"
7 : #include "fd_pack_tip_prog_blacklist.h"
8 : #include <math.h> /* for sqrt */
9 : #include <stddef.h> /* for offsetof */
10 : #include "../metrics/fd_metrics.h"
11 : #include "../../util/fd_hash32.h"
12 :
13 : #define FD_PACK_USE_NON_TEMPORAL_MEMCPY 1
14 :
15 : #if FD_HAS_AVX512 && FD_PACK_USE_NON_TEMPORAL_MEMCPY
16 : #include "../../util/simd/fd_nt_memcpy.h"
17 4504 : #define pack_memcpy_out fd_memcpy_nt_nofence
18 5039 : #define pack_memcpy_fini() _mm_sfence()
19 : #else
20 9008 : #define pack_memcpy_out fd_memcpy
21 : #define pack_memcpy_fini()
22 : #endif
23 :
24 : /* Declare a bunch of helper structs used for pack-internal data
25 : structures. */
26 : typedef struct {
27 : fd_acct_addr_t key;
28 : } wrapped_acct_t;
29 :
30 : /* fd_pack_ord_txn_t: An fd_txn_p_t with information required to order
31 : it by priority. */
32 : struct fd_pack_private_ord_txn {
33 : /* It's important that there be no padding here (asserted below)
34 : because the code casts back and forth from pointers to this element
35 : to pointers to the whole struct. */
36 : union {
37 : fd_txn_p_t txn[1]; /* txn is an alias for txn_e->txnp */
38 : fd_txn_e_t txn_e[1];
39 : fd_txn_e_t _txn_e; /* Non-array type needed for map_chain */
40 : };
41 :
42 : /* Since this struct can be in one of several trees, it's helpful to
43 : store which tree. This should be one of the FD_ORD_TXN_ROOT_*
44 : values. */
45 : int root;
46 :
47 : /* The sig2txn map_chain fields */
48 : ushort sigmap_next;
49 : ushort sigmap_prev;
50 :
51 : /* Each transaction is inserted with an expiration "time." This code
52 : doesn't care about the units (blocks, rdtsc tick, ns, etc.), and
53 : doesn't require transactions to be inserted in expiration date
54 : order. */
55 : ulong expires_at;
56 : /* expq_idx: When this object is part of one of the treaps, it's
57 : also in the expiration priority queue. This field (which is
58 : manipulated behind the scenes by the fd_prq code) stores where so
59 : that if we delete this transaction, we can also delete it from the
60 : expiration priority queue. */
61 : ulong expq_idx;
62 :
63 : /* The noncemap map_chain fields */
64 : ushort noncemap_next;
65 : ushort noncemap_prev;
66 :
67 : /* We want rewards*compute_est to fit in a ulong so that r1/c1 < r2/c2 can be
68 : computed as r1*c2 < r2*c1, with the product fitting in a ulong.
69 : compute_est has a small natural limit of mid-20 bits. rewards doesn't have
70 : a natural limit, so there is some argument to be made for raising the
71 : limit for rewards to 40ish bits. The struct has better packing with
72 : uint/uint though. */
73 : uint __attribute__((aligned(64))) /* We want the treap fields and the bitsets
74 : to be on the same double cache line pair */
75 : rewards; /* in Lamports */
76 : uint compute_est; /* in compute units */
77 :
78 : /* The treap fields */
79 : ushort left;
80 : ushort right;
81 : ushort parent;
82 : ushort prio;
83 : ushort prev;
84 : ushort next;
85 :
86 : /* skip: if we skip this transaction more than FD_PACK_SKIP_CNT times
87 : for reasons that won't go away until the end of the block, then we
88 : want to skip it very quickly. If skip is in [1, FD_PACK_SKIP_CNT],
89 : then that means we have to skip it `skip` more times before taking
90 : any action. If skip>FD_PACK_SKIP_CNT, then it is a compressed slot
91 : number during which it should be skipped, and we'll skip it until
92 : the compressed slot reaches a new value. skip is never 0. */
93 : ushort skip;
94 :
95 : FD_PACK_BITSET_DECLARE( rw_bitset ); /* all accts this txn references */
96 : FD_PACK_BITSET_DECLARE( w_bitset ); /* accts this txn write-locks */
97 :
98 : };
99 : typedef struct fd_pack_private_ord_txn fd_pack_ord_txn_t;
100 :
101 : /* We require that the payload starts at byte 0 of fd_pack_ord_txn_t,
102 : because we cast back and forth between fd_txn_p_t* and
103 : fd_pack_ord_txn_t*.
104 : GCC and Clang seem to disagree on the rules of offsetof. */
105 : FD_STATIC_ASSERT( offsetof( fd_pack_ord_txn_t, txn )==0UL, fd_pack_ord_txn_t );
106 : #if FD_USING_CLANG
107 : FD_STATIC_ASSERT( offsetof( fd_txn_p_t, payload )==0UL, fd_pack_ord_txn_t );
108 : #else
109 : FD_STATIC_ASSERT( offsetof( fd_pack_ord_txn_t, txn->payload )==0UL, fd_pack_ord_txn_t );
110 : FD_STATIC_ASSERT( offsetof( fd_pack_ord_txn_t, txn_e->txnp )==0UL, fd_pack_ord_txn_t );
111 : #endif
112 :
113 : /* FD_ORD_TXN_ROOT is essentially a small union packed into an int. The low
114 : byte is the "tag". The higher 3 bytes depend on the low byte. */
115 28599 : #define FD_ORD_TXN_ROOT_TAG_MASK 0xFF
116 1088592 : #define FD_ORD_TXN_ROOT_FREE 0
117 37232 : #define FD_ORD_TXN_ROOT_PENDING 1
118 29553 : #define FD_ORD_TXN_ROOT_PENDING_VOTE 2
119 1425 : #define FD_ORD_TXN_ROOT_PENDING_BUNDLE 3
120 30067 : #define FD_ORD_TXN_ROOT_PENALTY( idx ) (4 | (idx)<<8)
121 :
122 : /* if root & TAG_MASK == PENALTY, then PENALTY_ACCT_IDX(root) gives the index
123 : in the transaction's list of account addresses of which penalty treap the
124 : transaction is in. */
125 : #define FD_ORD_TXN_ROOT_PENALTY_ACCT_IDX( root ) (((root) & 0xFF00)>>8)
126 :
127 179562 : #define FD_PACK_IN_USE_WRITABLE (0x8000000000000000UL)
128 145615 : #define FD_PACK_IN_USE_BIT_CLEARED (0x4000000000000000UL)
129 :
130 : /* Each non-empty microblock we schedule also has an overhead of 48
131 : bytes that counts towards shed limits. That comes from the 32 byte
132 : hash, the hash count (8 bytes) and the transaction count (8 bytes).
133 : We don't have to pay this overhead if the microblock is empty, since
134 : those microblocks get dropped. */
135 30864 : #define MICROBLOCK_DATA_OVERHEAD 48UL
136 :
137 : FD_STATIC_ASSERT( sizeof(fd_acct_addr_t)==sizeof(fd_pubkey_t), "" );
138 :
139 : /* fd_pack_expq_t: An element of an fd_prq to sort the transactions by
140 : timeout. This structure has several invariants for entries
141 : corresponding to pending transactions:
142 : expires_at == txn->expires_at
143 : txn->exp_prq_idx is the index of this structure
144 : Notice that prq is an array-based heap, which means the indexes of
145 : elements change. The PRQ_TMP_ST macro is hijacked to keep that
146 : invariant up to date.
147 :
148 : Note: this could be easier if fd_heap supported deleting from the
149 : middle, but that's not possible with the current design of fd_heap,
150 : which omits a parent pointer for improved performance. */
151 : struct fd_pack_expq {
152 : ulong expires_at;
153 : fd_pack_ord_txn_t * txn;
154 : };
155 : typedef struct fd_pack_expq fd_pack_expq_t;
156 :
157 :
158 : /* fd_pack_bitset_acct_mapping_t: An element of an fd_map_dynamic that
159 : maps an account address to the number of transactions that are
160 : referencing it and the bit that is reserved to indicate it in the
161 : bitset, if any. */
162 : struct fd_pack_bitset_acct_mapping {
163 : fd_acct_addr_t key; /* account address */
164 : ulong ref_cnt;
165 :
166 : /* first_instance and first_instance_was_write are only valid when
167 : bit==FD_PACK_BITSET_FIRST_INSTANCE, which is set when ref_cnt
168 : transitions from 0 to 1. These just exist to implement the
169 : optimization that accounts referenced a single time aren't
170 : allocated a bit, but this seems to be an important optimization. */
171 : fd_pack_ord_txn_t * first_instance;
172 : int first_instance_was_write;
173 :
174 : /* bit is in [0, FD_PACK_BITSET_MAX) U
175 : { FD_PACK_BITSET_FIRST_INSTANCE, FD_PACK_BITSET_SLOWPATH }. */
176 : ushort bit;
177 : };
178 : typedef struct fd_pack_bitset_acct_mapping fd_pack_bitset_acct_mapping_t;
179 :
180 :
181 : struct fd_pack_wcost_ele {
182 : fd_acct_addr_t key; /* account address */
183 : ulong total_cost;
184 : union {
185 : uint map_next;
186 : uint pool_next;
187 : };
188 : uint map_prev;
189 : uint dlist_next;
190 : uint dlist_prev;
191 : };
192 : typedef struct fd_pack_wcost_ele fd_pack_wcost_ele_t;
193 :
194 :
195 : /* pack maintains a small state machine related to initializer bundles.
196 : See the header file for more details about it, but it's
197 : also summarized here:
198 : * NOT_INITIALIZED: The starting state for each block
199 : * PENDING: an initializer bundle has been scheduled, but pack has
200 : not observed its result yet, so we don't know if it was successful
201 : or not.
202 : * FAILED: the most recently scheduled initializer bundle failed
203 : for reasons other than already being executed. Most commonly, this
204 : could be because of a bug in the code that generated the
205 : initializer bundle, a lack of fee payer balance, or an expired
206 : blockhash.
207 : * READY: the most recently scheduled initialization bundle succeeded
208 : and normal bundles can be scheduled in this slot. */
209 12 : #define FD_PACK_IB_STATE_NOT_INITIALIZED 0
210 0 : #define FD_PACK_IB_STATE_PENDING 1
211 0 : #define FD_PACK_IB_STATE_FAILED 2
212 123 : #define FD_PACK_IB_STATE_READY 3
213 :
214 :
215 : /* Returns 1 if x.rewards/x.compute < y.rewards/y.compute. Not robust. */
216 127139 : #define COMPARE_WORSE(x,y) ( ((ulong)((x)->rewards)*(ulong)((y)->compute_est)) < ((ulong)((y)->rewards)*(ulong)((x)->compute_est)) )
217 :
218 : /* Declare all the data structures */
219 :
220 :
221 : /* Define the big max-"heap" that we pull transactions off to schedule.
222 : The priority is given by reward/compute. We may want to add in some
223 : additional terms at a later point. In order to cheaply remove nodes,
224 : we actually use a treap. */
225 : #define POOL_NAME trp_pool
226 1602 : #define POOL_T fd_pack_ord_txn_t
227 : #define POOL_IDX_T ushort
228 667977 : #define POOL_NEXT parent
229 : #include "../../util/tmpl/fd_pool.c"
230 :
231 : #define TREAP_T fd_pack_ord_txn_t
232 : #define TREAP_NAME treap
233 : #define TREAP_QUERY_T void * /* We don't use query ... */
234 : #define TREAP_CMP(a,b) (__extension__({ (void)(a); (void)(b); -1; })) /* which means we don't need to give a real
235 : implementation to cmp either */
236 472071 : #define TREAP_IDX_T ushort
237 : #define TREAP_OPTIMIZE_ITERATION 1
238 127139 : #define TREAP_LT COMPARE_WORSE
239 : #include "../../util/tmpl/fd_treap.c"
240 :
241 :
242 : #define MAP_NAME sig2txn
243 : #define MAP_OPTIMIZE_RANDOM_ACCESS_REMOVAL 1
244 : #define MAP_MULTI 1
245 34899 : #define MAP_ELE_T fd_pack_ord_txn_t
246 57979 : #define MAP_PREV sigmap_prev
247 81090 : #define MAP_NEXT sigmap_next
248 39675 : #define MAP_IDX_T ushort
249 :
250 : #define MAP_KEY_T fd_txn_e_t
251 68417 : #define MAP_KEY _txn_e
252 71635 : #define TXNE_TO_SIG(ptr) (__extension__({ fd_txn_p_t const * __p = (ptr)->txnp; __p->payload + TXN(__p)->signature_off; }))
253 1072 : #define MAP_KEY_EQ(k0,k1) (!memcmp( TXNE_TO_SIG(k0), TXNE_TO_SIG(k1), FD_TXN_SIGNATURE_SZ) )
254 69491 : #define MAP_KEY_HASH(key,seed) fd_hash( (seed), TXNE_TO_SIG(key), 64UL )
255 : #include "../../util/tmpl/fd_map_chain.c"
256 :
257 :
258 : /* noncemap: A map from (nonce account, nonce authority, recent
259 : blockhash) to a durable nonce transaction containing it. We only
260 : want to allow one transaction in the pool at a time with a given
261 : (nonce account, recent blockhash) tuple value. The question is: can
262 : adding this limitation cause us to throw out potentially valuable
263 : transaction? The answer is yes, but only very rarely, and the
264 : savings are worth it. Suppose we have durable nonce transactions t1
265 : and t2 that advance the same nonce account and have the same value
266 : for the recent blockhash.
267 :
268 : - If t1 lands on chain, then it will advance the nonce account, and
269 : t2 will certainly not land on chain.
270 : - If t1 fails with AlreadyExecuted, that means the nonce account was
271 : advanced when t1 landed in a previous block, so t2 will certainly not
272 : land on chain.
273 : - If t1 fails with BlockhashNotFound, then the nonce account was
274 : advanced in some previous transaction, so again, t2 will certainly
275 : not land on chain.
276 : - If t1 does not land on chain because of an issue with the fee
277 : payer, it's possible that t2 could land on chain if it used a
278 : different fee payer, but historical data shows this is unlikely.
279 : - If t1 does not land on chain because it is part of a bundle that
280 : fails for an unrelated reason, it's possible that t2 could land on
281 : chain, but again, historical data says this is rare.
282 :
283 : We need to include the nonce authority in the hash to prevent one
284 : user from being able to DoS another user. */
285 :
286 : typedef struct {
287 : uchar const * recent_blockhash;
288 : fd_acct_addr_t const * nonce_acct;
289 : fd_acct_addr_t const * nonce_auth;
290 : } noncemap_extract_t;
291 :
292 : /* k must be a valid, durable nonce transaction. No error checking is
293 : done. */
294 : static inline void
295 : noncemap_extract( fd_txn_e_t const * k,
296 3382 : noncemap_extract_t * out ) {
297 3382 : fd_txn_t const * txn = TXN(k->txnp);
298 3382 : out->recent_blockhash = fd_txn_get_recent_blockhash( txn, k->txnp->payload );
299 :
300 3382 : ulong nonce_idx = k->txnp->payload[ txn->instr[ 0 ].acct_off+0 ];
301 3382 : ulong autho_idx = k->txnp->payload[ txn->instr[ 0 ].acct_off+2 ];
302 :
303 3382 : ulong imm_cnt = fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
304 3382 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, k->txnp->payload );
305 3382 : fd_acct_addr_t const * alt_adj = k->alt_accts - imm_cnt;
306 3382 : out->nonce_acct = fd_ptr_if( nonce_idx<imm_cnt, accts, alt_adj )+nonce_idx;
307 : /* The nonce authority must be a signer, so it must be an immediate
308 : account. */
309 3382 : out->nonce_auth = accts+autho_idx;
310 3382 : }
311 :
312 : static inline int
313 : noncemap_key_eq_internal( fd_txn_e_t const * k0,
314 174 : fd_txn_e_t const * k1 ) {
315 174 : noncemap_extract_t e0[1], e1[1];
316 174 : noncemap_extract( k0, e0 );
317 174 : noncemap_extract( k1, e1 );
318 :
319 174 : if( FD_UNLIKELY( memcmp( e0->recent_blockhash, e1->recent_blockhash, 32UL ) ) ) return 0;
320 63 : if( FD_UNLIKELY( memcmp( e0->nonce_acct, e1->nonce_acct, 32UL ) ) ) return 0;
321 63 : if( FD_UNLIKELY( memcmp( e0->nonce_auth, e1->nonce_auth, 32UL ) ) ) return 0;
322 63 : return 1;
323 63 : }
324 :
325 : #if FD_HAS_INT128
326 :
327 : /* unrolled xxHash3 */
328 :
329 : static inline ulong
330 : noncemap_key_hash_internal( ulong seed,
331 3034 : fd_txn_e_t const * k ) {
332 3034 : noncemap_extract_t e[1];
333 3034 : noncemap_extract( k, e );
334 :
335 3034 : ulong k0 = FD_LOAD( ulong, e->recent_blockhash+ 0 );
336 3034 : ulong k1 = FD_LOAD( ulong, e->recent_blockhash+ 8 );
337 3034 : ulong k2 = FD_LOAD( ulong, e->recent_blockhash+16 );
338 3034 : ulong k3 = FD_LOAD( ulong, e->recent_blockhash+24 );
339 3034 : ulong k4 = FD_LOAD( ulong, e->nonce_acct->b + 0 );
340 3034 : ulong k5 = FD_LOAD( ulong, e->nonce_acct->b + 8 );
341 3034 : ulong k6 = FD_LOAD( ulong, e->nonce_acct->b +16 );
342 3034 : ulong k7 = FD_LOAD( ulong, e->nonce_acct->b +24 );
343 3034 : ulong k8 = FD_LOAD( ulong, e->nonce_auth->b + 0 );
344 3034 : ulong k9 = FD_LOAD( ulong, e->nonce_auth->b + 8 );
345 3034 : ulong ka = FD_LOAD( ulong, e->nonce_auth->b +16 );
346 3034 : ulong kb = FD_LOAD( ulong, e->nonce_auth->b +24 );
347 :
348 3034 : ulong acc = 96 * 0x9E3779B185EBCA87ULL;
349 3034 : acc += fd_xxh3_mix16b( k4, k5, 0xcb00c391bb52283cUL, 0xa32e531b8b65d088UL, seed );
350 3034 : acc += fd_xxh3_mix16b( k6, k7, 0x4ef90da297486471UL, 0xd8acdea946ef1938UL, seed );
351 3034 : acc += fd_xxh3_mix16b( k2, k3, 0x78e5c0cc4ee679cbUL, 0x2172ffcc7dd05a82UL, seed );
352 3034 : acc += fd_xxh3_mix16b( k8, k9, 0x8e2443f7744608b8UL, 0x4c263a81e69035e0UL, seed );
353 3034 : acc += fd_xxh3_mix16b( k0, k1, 0xbe4ba423396cfeb8UL, 0x1cad21f72c81017cUL, seed );
354 3034 : acc += fd_xxh3_mix16b( ka, kb, 0xdb979083e96dd4deUL, 0x1f67b3b7a4a44072UL, seed );
355 3034 : acc = acc ^ (acc >> 37);
356 3034 : acc *= 0x165667919E3779F9ULL;
357 3034 : acc = acc ^ (acc >> 32);
358 3034 : return acc;
359 3034 : }
360 :
361 : #else
362 :
363 : static inline ulong
364 : noncemap_key_hash_internal( ulong seed,
365 : fd_txn_e_t const * k ) {
366 : noncemap_extract_t e[1];
367 : noncemap_extract( k, e );
368 :
369 : uchar buf[ 96 ];
370 : memcpy( buf, e->recent_blockhash, 32UL );
371 : memcpy( buf+32, e->nonce_acct->b, 32UL );
372 : memcpy( buf+64, e->nonce_auth->b, 32UL );
373 : return fd_hash( seed, buf, 96UL );
374 : }
375 :
376 : #endif
377 :
378 : #define MAP_NAME noncemap
379 : #define MAP_OPTIMIZE_RANDOM_ACCESS_REMOVAL 1
380 : #define MAP_MULTI 0
381 375 : #define MAP_ELE_T fd_pack_ord_txn_t
382 571 : #define MAP_PREV noncemap_prev
383 1081 : #define MAP_NEXT noncemap_next
384 4190 : #define MAP_IDX_T ushort
385 : #define MAP_KEY_T fd_txn_e_t
386 754 : #define MAP_KEY _txn_e
387 174 : #define MAP_KEY_EQ(k0,k1) noncemap_key_eq_internal( (k0), (k1) )
388 3034 : #define MAP_KEY_HASH(key,seed) noncemap_key_hash_internal( (seed), (key) )
389 : #include "../../util/tmpl/fd_map_chain.c"
390 :
391 :
392 : static const fd_acct_addr_t null_addr = { 0 };
393 :
394 : #define MAP_NAME acct_uses
395 518049 : #define MAP_T fd_pack_addr_use_t
396 632312 : #define MAP_KEY_T fd_acct_addr_t
397 13429651 : #define MAP_KEY_NULL null_addr
398 : #if FD_HAS_AVX
399 632312 : # define MAP_KEY_INVAL(k) _mm256_testz_si256( wb_ldu( (k).b ), wb_ldu( (k).b ) )
400 : #else
401 : # define MAP_KEY_INVAL(k) MAP_KEY_EQUAL(k, null_addr)
402 : #endif
403 399734 : #define MAP_KEY_EQUAL(k0,k1) (!memcmp((k0).b,(k1).b, FD_TXN_ACCT_ADDR_SZ))
404 : #define MAP_KEY_EQUAL_IS_SLOW 1
405 : #define MAP_MEMOIZE 0
406 517312 : #define MAP_KEY_HASH(key,s) ((uint)fd_hash32( (key).b, (s) ))
407 : #include "../../util/tmpl/fd_map_dynamic.c"
408 :
409 : #define MAP_NAME wcost_map
410 8154 : #define MAP_ELE_T fd_pack_wcost_ele_t
411 : #define MAP_KEY_T fd_acct_addr_t
412 224791 : #define MAP_IDX_T uint
413 28688 : #define MAP_NEXT map_next
414 20397 : #define MAP_PREV map_prev
415 : #define MAP_OPTIMIZE_RANDOM_ACCESS_REMOVAL 1
416 95719 : #define MAP_KEY_EQ(k0,k1) (!memcmp((k0)->b,(k1)->b, FD_TXN_ACCT_ADDR_SZ))
417 164404 : #define MAP_KEY_HASH(key,s) ((uint)fd_hash32( (key)->b, (s) ))
418 : #include "../../util/tmpl/fd_map_chain.c"
419 :
420 : #define POOL_NAME wcost_pool
421 1068 : #define POOL_T fd_pack_wcost_ele_t
422 : #define POOL_IDX_T uint
423 85468387 : #define POOL_NEXT pool_next
424 : #include "../../util/tmpl/fd_pool.c"
425 :
426 : #define DLIST_NAME wcost_dlist
427 : #define DLIST_ELE_T fd_pack_wcost_ele_t
428 : #define DLIST_IDX_T uint
429 28387 : #define DLIST_NEXT dlist_next
430 20236 : #define DLIST_PREV dlist_prev
431 : #include "../../util/tmpl/fd_dlist.c"
432 :
433 : #define MAP_NAME bitset_map
434 463795 : #define MAP_T fd_pack_bitset_acct_mapping_t
435 544878 : #define MAP_KEY_T fd_acct_addr_t
436 80126523 : #define MAP_KEY_NULL null_addr
437 : #if FD_HAS_AVX
438 63410286 : # define MAP_KEY_INVAL(k) _mm256_testz_si256( wb_ldu( (k).b ), wb_ldu( (k).b ) )
439 : #else
440 : # define MAP_KEY_INVAL(k) MAP_KEY_EQUAL(k, null_addr)
441 : #endif
442 375947 : #define MAP_KEY_EQUAL(k0,k1) (!memcmp((k0).b,(k1).b, FD_TXN_ACCT_ADDR_SZ))
443 : #define MAP_KEY_EQUAL_IS_SLOW 1
444 : #define MAP_MEMOIZE 0
445 462048 : #define MAP_KEY_HASH(key,s) ((uint)fd_hash32( (key).b, (s) ))
446 : #include "../../util/tmpl/fd_map_dynamic.c"
447 :
448 :
449 : #define MAP_NAME acct_blocklist
450 229323 : #define MAP_T wrapped_acct_t
451 : /* Add 1 to the slot cnt to ensure the map is sparse even at capacity */
452 246612 : #define MAP_LG_SLOT_CNT (FD_PACK_ACCT_BLOCKLIST_LG_MAX+1)
453 228792 : #define MAP_KEY_T fd_acct_addr_t
454 17280 : #define MAP_KEY_NULL null_addr
455 : #if FD_HAS_AVX
456 459126 : # define MAP_KEY_INVAL(k) _mm256_testz_si256( wb_ldu( (k).b ), wb_ldu( (k).b ) )
457 : #else
458 : # define MAP_KEY_INVAL(k) MAP_KEY_EQUAL(k, null_addr)
459 : #endif
460 228729 : #define MAP_KEY_EQUAL(k0,k1) (!memcmp((k0).b,(k1).b, FD_TXN_ACCT_ADDR_SZ))
461 : /* It would be nice if this were seeded, but since fd_map doesn't have
462 : any auxiliary data, there's not a clear place to store the seed.
463 : It's okay though, because the insert process is trusted, since it
464 : comes from operator config. */
465 228783 : #define MAP_KEY_HASH(key) ((uint)fd_ulong_hash( fd_ulong_load_8( (key).b ) ))
466 : #define MAP_KEY_EQUAL_IS_SLOW 1
467 : #define MAP_MEMOIZE 0
468 : #define MAX_QUERY_OPT 2 /* rare hits */
469 : #include "../../util/tmpl/fd_map.c"
470 :
471 : /* Since transactions can also expire, we also maintain a parallel
472 : priority queue. This means elements are simultaneously part of the
473 : treap (ordered by priority) and the expiration queue (ordered by
474 : expiration). It's tempting to use the priority field of the treap
475 : for this purpose, but that can result in degenerate treaps in some
476 : cases. */
477 : #define PRQ_NAME expq
478 113535 : #define PRQ_T fd_pack_expq_t
479 70020 : #define PRQ_TIMEOUT_T ulong
480 70020 : #define PRQ_TIMEOUT expires_at
481 54690 : #define PRQ_TMP_ST(p,t) do { \
482 54690 : (p)[0] = (t); \
483 54690 : t.txn->expq_idx = (ulong)((p)-heap); \
484 54690 : } while( 0 )
485 : #include "../../util/tmpl/fd_prq.c"
486 :
487 : /* With realistic traffic patterns, we often see many, many transactions
488 : competing for the same writable account. Since only one of these can
489 : execute at a time, we sometimes waste lots of scheduling time going
490 : through them one at a time. To combat that, when a transaction
491 : writes to an account with more than PENALTY_TREAP_THRESHOLD
492 : references (readers or writers), instead of inserting it into the
493 : main treap, we insert it into a penalty treap for that specific hot
494 : account address. These transactions are not immediately available
495 : for scheduling. Then, when a transaction that writes to the hot
496 : address completes, we move the most lucrative transaction from the
497 : penalty treap to the main treap, making it available for scheduling.
498 : This policy may slightly violate the price-time priority scheduling
499 : approach pack normally uses: if the most lucrative transaction
500 : competing for hot state arrives after PENALTY_TREAP_THRESHOLD has
501 : been hit, it may be scheduled second instead of first. However, if
502 : the account is in use at the time the new transaction arrives, it
503 : will be scheduled next, as desired. This minor difference seems
504 : reasonable to reduce complexity.
505 :
506 : fd_pack_penalty_treap is one account-specific penalty treap. All the
507 : transactions in the penalty_treap treap write to key.
508 :
509 : penalty_map is the fd_map_dynamic that maps accounts to their
510 : respective penalty treaps. */
511 : struct fd_pack_penalty_treap {
512 : fd_acct_addr_t key;
513 : treap_t penalty_treap[1];
514 : };
515 : typedef struct fd_pack_penalty_treap fd_pack_penalty_treap_t;
516 :
517 : #define MAP_NAME penalty_map
518 73930 : #define MAP_T fd_pack_penalty_treap_t
519 72880 : #define MAP_KEY_T fd_acct_addr_t
520 1250709 : #define MAP_KEY_NULL null_addr
521 : #if FD_HAS_AVX
522 1055152 : # define MAP_KEY_INVAL(k) _mm256_testz_si256( wb_ldu( (k).b ), wb_ldu( (k).b ) )
523 : #else
524 : # define MAP_KEY_INVAL(k) MAP_KEY_EQUAL(k, null_addr)
525 : #endif
526 72838 : #define MAP_KEY_EQUAL(k0,k1) (!memcmp((k0).b,(k1).b, FD_TXN_ACCT_ADDR_SZ))
527 : #define MAP_KEY_EQUAL_IS_SLOW 1
528 : #define MAP_MEMOIZE 0
529 72859 : #define MAP_KEY_HASH(key,s) ((uint)fd_hash32( (key).b, (s) ))
530 : #include "../../util/tmpl/fd_map_dynamic.c"
531 :
532 : /* PENALTY_TREAP_THRESHOLD: How many references to an account do we
533 : allow before subsequent transactions that write to the account go to
534 : the penalty treap. */
535 174987 : #define PENALTY_TREAP_THRESHOLD 64UL
536 :
537 :
538 : /* FD_PACK_SKIP_CNT: How many times we'll skip a transaction (for
539 : reasons other than account conflicts) before we won't consider it
540 : until the next slot. For performance reasons, this doesn't reset at
541 : the end of a slot, so e.g. we might skip twice in slot 1, then three
542 : times in slot 2, which would be enough to prevent considering it
543 : until slot 3. The main reason this is not 1 is that some skips that
544 : seem permanent until the end of the slot can actually go away based
545 : on rebates. */
546 38205 : #define FD_PACK_SKIP_CNT 50UL
547 :
548 : /* Finally, we can now declare the main pack data structure */
549 : struct fd_pack_private {
550 : ulong pack_depth;
551 : ulong bundle_meta_sz; /* if 0, bundles are disabled */
552 : ulong bank_tile_cnt;
553 :
554 : fd_pack_limits_t lim[1];
555 :
556 : ulong pending_txn_cnt; /* Summed across all treaps */
557 : ulong microblock_cnt; /* How many microblocks have we
558 : generated in this block? */
559 : ulong data_bytes_consumed; /* How much data is in this block so
560 : far ? */
561 : /* There's a limit on the total amount that transactions in a block
562 : can allocate. How much of that limit have we consumed? */
563 : ulong alloc_consumed;
564 :
565 : /* counters / gauge for schedule outcome enums */
566 : ulong sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_CNT ];
567 :
568 : fd_rng_t * rng;
569 :
570 : ulong cumulative_block_cost;
571 : ulong cumulative_vote_cost;
572 :
573 : /* expire_before: Any transactions with expires_at strictly less than
574 : the current expire_before are removed from the available pending
575 : transaction. Here, "expire" is used as a verb: cause all
576 : transactions before this time to expire. */
577 : ulong expire_before;
578 :
579 : /* outstanding_microblock_mask: a bitmask indicating which banking
580 : tiles have outstanding microblocks, i.e. fd_pack has generated a
581 : microblock for that banking tile and the banking tile has not yet
582 : notified fd_pack that it has completed it. */
583 : ulong outstanding_microblock_mask;
584 :
585 : /* The actual footprint for the pool and maps is allocated
586 : in the same order in which they are declared immediately following
587 : the struct. I.e. these pointers point to memory not far after the
588 : struct. The trees are just pointers into the pool so don't take up
589 : more space. */
590 :
591 : fd_pack_ord_txn_t * pool;
592 :
593 : /* Treaps (sorted by priority) of pending transactions. We store the
594 : pending simple votes and transactions that come from bundles
595 : separately. */
596 : treap_t pending[1];
597 : treap_t pending_votes[1];
598 : treap_t pending_bundles[1];
599 :
600 : /* penalty_treaps: an fd_map_dynamic mapping hotly contended account
601 : addresses to treaps of transactions that write to them. We try not
602 : to allow more than roughly PENALTY_TREAP_THRESHOLD transactions in
603 : the main treap that write to each account, though this is not
604 : exact. */
605 : fd_pack_penalty_treap_t * penalty_treaps;
606 :
607 : /* initializer_bundle_state: The current state of the initialization
608 : bundle state machine. One of the FD_PACK_IB_STATE_* values. See
609 : the long comment in the header and the comments attached to the
610 : respective values for a discussion of what each state means and the
611 : transitions between them. */
612 : int initializer_bundle_state;
613 :
614 : /* relative_bundle_idx: the number of bundles that have been inserted
615 : since the last time pending_bundles was empty. See the long
616 : comment about encoding this index in the rewards field of each
617 : transaction in the bundle, and why it is important that this reset
618 : to 0 as frequently as possible. */
619 : ulong relative_bundle_idx;
620 :
621 : /* pending{_votes}_smallest: keep a conservative estimate of the
622 : smallest transaction (by cost units and by bytes) in each heap.
623 : Both CUs and bytes should be set to ULONG_MAX is the treap is
624 : empty. */
625 : fd_pack_smallest_t pending_smallest[1];
626 : fd_pack_smallest_t pending_votes_smallest[1];
627 :
628 : /* expiration_q: At the same time that a transaction is in exactly one
629 : of the above treaps, it is also in the expiration queue, sorted by
630 : its expiration time. This enables deleting all transactions that
631 : have expired, regardless of which treap they are in. */
632 : fd_pack_expq_t * expiration_q;
633 :
634 : /* acct_in_use: Map from account address to bitmask indicating which
635 : bank tiles are using the account and whether that use is read or
636 : write (msb). */
637 : fd_pack_addr_use_t * acct_in_use;
638 :
639 : /* bitset_{w, rw}_in_use stores a subset of the information in
640 : acct_in_use using the compressed set format explained at the top of
641 : this file. rw_in_use stores accounts in use for read or write
642 : while w_in_use stores only those in use for write. */
643 : FD_PACK_BITSET_DECLARE( bitset_rw_in_use );
644 : FD_PACK_BITSET_DECLARE( bitset_w_in_use );
645 :
646 : /* writer_costs: Map (fd_map_chain) from account addresses to the sum
647 : of costs of transactions that write to the account. Used for
648 : enforcing limits on the max write cost per account per block. */
649 : wcost_map_t * writer_costs;
650 :
651 : /* written_list: At the end of every slot, we have to clear out
652 : writer_costs. The map is large, but typically very sparsely
653 : populated. As an optimization, we keep a doubly linked list of the
654 : elements actually used */
655 : wcost_dlist_t written_list[1];
656 :
657 : /* writers: This is the fd_pool that backs writer_costs and
658 : written_list. Each element is either in writers (as a fd_pool) OR
659 : in both writer_costs and written_list. */
660 : fd_pack_wcost_ele_t * writers;
661 :
662 : /* top_writers: A simple max heap of the top 5 writers in the slot,
663 : used by downstream consumers for monitoring purposes. */
664 : fd_pack_addr_use_t top_writers[ FD_PACK_TOP_WRITERS_CNT ];
665 :
666 : /* At initialization time, the caller can configure a blocklist of
667 : accounts. Any transaction that includes one of these accounts will
668 : be rejected. This is an fd_map, and it's effectively const. */
669 : wrapped_acct_t acct_blocklist[ 2*FD_PACK_ACCT_BLOCKLIST_MAX ];
670 :
671 : /* Noncemap is a map_chain that maps from tuples (nonce account,
672 : recent blockhash value, nonce authority) to a transaction. This
673 : map stores exactly the transactions in pool that have the nonce
674 : flag set. */
675 : noncemap_t * noncemap;
676 :
677 : sig2txn_t * signature_map; /* Stores pointers into pool for deleting by signature */
678 :
679 : /* bundle_temp_map: A fd_map_dynamic (although it could be an fd_map)
680 : used during fd_pack_try_schedule_bundle to store information about
681 : what accounts are used by transactions in the bundle. It's empty
682 : (in a map sense) outside of calls to try_schedule_bundle, and each
683 : call to try_schedule_bundle clears it after use. If bundles are
684 : disabled, this is a valid fd_map_dynamic, but it's as small as
685 : convenient and remains empty. */
686 : fd_pack_addr_use_t * bundle_temp_map;
687 :
688 :
689 : /* use_by_bank: An array of size (max_txn_per_microblock *
690 : FD_TXN_ACCT_ADDR_MAX) for each banking tile. Only the MSB of
691 : in_use_by is relevant. Addressed use_by_bank[i][j] where i is in
692 : [0, bank_tile_cnt) and j is in [0, use_by_bank_cnt[i]). Used
693 : mostly for clearing the proper bits of acct_in_use when a
694 : microblock finishes.
695 :
696 : use_by_bank_txn: indexed [i][j], where i is in [0, bank_tile_cnt)
697 : and j is in [0, max_txn_per_microblock). Transaction j in the
698 : microblock currently scheduled to bank i uses account addresses in
699 : use_by_bank[i][k] where k is in [0, use_by_bank[i][j]). For
700 : example, if use_by_bank[i][0] = 2 and use_by_bank[i][1] = 3, then
701 : all the accounts that the first transaction in the outstanding
702 : microblock for bank 0 uses are contained in the set
703 : { use_by_bank[i][0], use_by_bank[i][1] },
704 : and all the accounts in the second transaction in the microblock
705 : are in the set
706 : { use_by_bank[i][0], use_by_bank[i][1], use_by_bank[i][2] }.
707 : Each transaction writes to at least one account (the fee payer)
708 : that no other transaction scheduled to the bank uses, which means
709 : that use_by_bank_txn[i][j] - use_by_bank_txn[i][j-1] >= 1 (with 0
710 : for use_by_bank_txn[i][-1]). This means we can stop iterating when
711 : use_by_bank_txn[i][j] == use_by_bank_cnt[i]. */
712 : fd_pack_addr_use_t * use_by_bank [ FD_PACK_MAX_EXECLE_TILES ];
713 : ulong use_by_bank_cnt[ FD_PACK_MAX_EXECLE_TILES ];
714 : ulong * use_by_bank_txn[ FD_PACK_MAX_EXECLE_TILES ];
715 :
716 : fd_histf_t txn_per_microblock [ 1 ];
717 : fd_histf_t vote_per_microblock[ 1 ];
718 :
719 : fd_histf_t scheduled_cus_per_block[ 1 ];
720 : fd_histf_t rebated_cus_per_block [ 1 ];
721 : fd_histf_t net_cus_per_block [ 1 ];
722 : fd_histf_t pct_cus_per_block [ 1 ];
723 : ulong cumulative_rebated_cus;
724 :
725 :
726 : /* compressed_slot_number: a number in (FD_PACK_SKIP_CNT, USHORT_MAX]
727 : that advances each time we start packing for a new slot. */
728 : ushort compressed_slot_number;
729 :
730 : /* bitset_avail: a stack of which bits are not currently reserved and
731 : can be used to represent an account address.
732 : Indexed [0, bitset_avail_cnt]. Element 0 is fixed at
733 : FD_PACK_BITSET_SLOWPATH. */
734 : ushort bitset_avail[ 1UL+FD_PACK_BITSET_MAX ];
735 : ulong bitset_avail_cnt;
736 :
737 : /* acct_to_bitset: an fd_map_dynamic that maps acct addresses to the
738 : reference count, which bit, etc. */
739 : fd_pack_bitset_acct_mapping_t * acct_to_bitset;
740 :
741 : /* chdkup: scratch memory chkdup needs for its internal processing */
742 : fd_chkdup_t chkdup[ 1 ];
743 :
744 : /* bundle_meta: an array, parallel to the pool, with each element
745 : having size bundle_meta_sz. I.e. if pool[i] has an associated
746 : bundle meta, it's located at bundle_meta[j] for j in
747 : [i*bundle_meta_sz, (i+1)*bundle_meta_sz). */
748 : void * bundle_meta;
749 : };
750 :
751 : typedef struct fd_pack_private fd_pack_t;
752 :
753 : FD_STATIC_ASSERT( offsetof(fd_pack_t, pending_txn_cnt)==FD_PACK_PENDING_TXN_CNT_OFF, txn_cnt_off );
754 :
755 : /* Forward-declare some helper functions */
756 : static ulong delete_transaction( fd_pack_t * pack, fd_pack_ord_txn_t * txn, int delete_full_bundle, int move_from_penalty_treap );
757 : static inline void insert_bundle_impl( fd_pack_t * pack, ulong bundle_idx, ulong txn_cnt, fd_pack_ord_txn_t * * bundle, ulong expires_at );
758 :
759 : FD_FN_PURE ulong
760 : fd_pack_footprint( ulong pack_depth,
761 : ulong bundle_meta_sz,
762 : ulong bank_tile_cnt,
763 525 : fd_pack_limits_t const * limits ) {
764 525 : if( FD_UNLIKELY( (bank_tile_cnt==0) | (bank_tile_cnt>FD_PACK_MAX_EXECLE_TILES) ) ) return 0UL;
765 525 : if( FD_UNLIKELY( pack_depth<4UL ) ) return 0UL;
766 :
767 525 : int enable_bundles = !!bundle_meta_sz;
768 525 : ulong l;
769 525 : ulong extra_depth = fd_ulong_if( enable_bundles, 1UL+2UL*FD_PACK_MAX_TXN_PER_BUNDLE, 1UL ); /* space for use between init and fini */
770 525 : ulong max_acct_in_treap = pack_depth * FD_TXN_ACCT_ADDR_MAX;
771 525 : ulong max_txn_per_mblk = fd_ulong_max( limits->max_txn_per_microblock,
772 525 : fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE, 0UL ) );
773 525 : ulong max_acct_in_flight = bank_tile_cnt * (FD_TXN_ACCT_ADDR_MAX * max_txn_per_mblk + 1UL);
774 525 : ulong max_txn_in_flight = bank_tile_cnt * max_txn_per_mblk;
775 :
776 525 : ulong max_w_per_block = fd_ulong_min( limits->max_cost_per_block / FD_PACK_COST_PER_WRITABLE_ACCT,
777 525 : max_txn_per_mblk * limits->max_microblocks_per_block * FD_TXN_ACCT_ADDR_MAX );
778 525 : ulong wcost_chain_cnt = wcost_map_chain_cnt_est( max_w_per_block );
779 525 : ulong bundle_temp_accts = fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE*FD_TXN_ACCT_ADDR_MAX, 1UL );
780 525 : ulong sig_chain_cnt = sig2txn_chain_cnt_est( pack_depth );
781 525 : ulong nonce_chain_cnt = noncemap_chain_cnt_est( pack_depth );
782 :
783 : /* log base 2, but with a 2* so that the hash table stays sparse */
784 525 : int lg_uses_tbl_sz = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_flight ) );
785 525 : int lg_acct_in_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap ) );
786 525 : int lg_penalty_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap/PENALTY_TREAP_THRESHOLD ) );
787 525 : int lg_bundle_temp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*bundle_temp_accts ) );
788 :
789 525 : l = FD_LAYOUT_INIT;
790 525 : l = FD_LAYOUT_APPEND( l, FD_PACK_ALIGN, sizeof(fd_pack_t) );
791 525 : l = FD_LAYOUT_APPEND( l, trp_pool_align (), trp_pool_footprint ( pack_depth+extra_depth ) ); /* pool */
792 525 : l = FD_LAYOUT_APPEND( l, penalty_map_align(), penalty_map_footprint( lg_penalty_trp ) ); /* penalty_treaps */
793 525 : l = FD_LAYOUT_APPEND( l, expq_align (), expq_footprint ( pack_depth ) ); /* expiration prq */
794 525 : l = FD_LAYOUT_APPEND( l, acct_uses_align(), acct_uses_footprint( lg_uses_tbl_sz ) ); /* acct_in_use */
795 525 : l = FD_LAYOUT_APPEND( l, wcost_map_align(), wcost_map_footprint( wcost_chain_cnt ) ); /* writer_costs */
796 525 : l = FD_LAYOUT_APPEND( l, wcost_pool_align(), wcost_pool_footprint( max_w_per_block ) ); /* writers */
797 525 : l = FD_LAYOUT_APPEND( l, noncemap_align (), noncemap_footprint ( nonce_chain_cnt ) ); /* noncemap */
798 525 : l = FD_LAYOUT_APPEND( l, sig2txn_align (), sig2txn_footprint ( sig_chain_cnt ) ); /* signature_map */
799 525 : l = FD_LAYOUT_APPEND( l, acct_uses_align(), acct_uses_footprint( lg_bundle_temp ) ); /* bundle_temp_map*/
800 525 : l = FD_LAYOUT_APPEND( l, 32UL, sizeof(fd_pack_addr_use_t)*max_acct_in_flight ); /* use_by_bank */
801 525 : l = FD_LAYOUT_APPEND( l, 32UL, sizeof(ulong)*max_txn_in_flight ); /* use_by_bank_txn*/
802 525 : l = FD_LAYOUT_APPEND( l, bitset_map_align(), bitset_map_footprint( lg_acct_in_trp ) ); /* acct_to_bitset */
803 525 : l = FD_LAYOUT_APPEND( l, 64UL, (pack_depth+extra_depth)*bundle_meta_sz ); /* bundle_meta */
804 525 : return FD_LAYOUT_FINI( l, FD_PACK_ALIGN );
805 525 : }
806 :
807 : void *
808 : fd_pack_new( void * mem,
809 : ulong pack_depth,
810 : ulong bundle_meta_sz,
811 : ulong bank_tile_cnt,
812 : fd_pack_limits_t const * limits,
813 : fd_acct_addr_t const * acct_blocklist,
814 : ulong acct_blocklist_cnt,
815 540 : fd_rng_t * rng ) {
816 :
817 540 : int enable_bundles = !!bundle_meta_sz;
818 540 : ulong extra_depth = fd_ulong_if( enable_bundles, 1UL+2UL*FD_PACK_MAX_TXN_PER_BUNDLE, 1UL );
819 540 : ulong max_acct_in_treap = pack_depth * FD_TXN_ACCT_ADDR_MAX;
820 540 : ulong max_txn_per_mblk = fd_ulong_max( limits->max_txn_per_microblock,
821 540 : fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE, 0UL ) );
822 540 : ulong max_acct_in_flight = bank_tile_cnt * (FD_TXN_ACCT_ADDR_MAX * max_txn_per_mblk + 1UL);
823 540 : ulong max_txn_in_flight = bank_tile_cnt * max_txn_per_mblk;
824 :
825 540 : ulong max_w_per_block = fd_ulong_min( limits->max_cost_per_block / FD_PACK_COST_PER_WRITABLE_ACCT,
826 540 : max_txn_per_mblk * limits->max_microblocks_per_block * FD_TXN_ACCT_ADDR_MAX );
827 540 : ulong wcost_chain_cnt = wcost_map_chain_cnt_est( max_w_per_block );
828 540 : ulong bundle_temp_accts = fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE*FD_TXN_ACCT_ADDR_MAX, 1UL );
829 540 : ulong sig_chain_cnt = sig2txn_chain_cnt_est( pack_depth );
830 540 : ulong nonce_chain_cnt = noncemap_chain_cnt_est( pack_depth );
831 :
832 : /* log base 2, but with a 2* so that the hash table stays sparse */
833 540 : int lg_uses_tbl_sz = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_flight ) );
834 540 : int lg_acct_in_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap ) );
835 540 : int lg_penalty_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap/PENALTY_TREAP_THRESHOLD ) );
836 540 : int lg_bundle_temp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*bundle_temp_accts ) );
837 :
838 540 : FD_SCRATCH_ALLOC_INIT( l, mem );
839 540 : fd_pack_t * pack = FD_SCRATCH_ALLOC_APPEND( l, FD_PACK_ALIGN, sizeof(fd_pack_t) );
840 : /* The pool has one extra element that is used between insert_init and
841 : cancel/fini. */
842 540 : void * _pool = FD_SCRATCH_ALLOC_APPEND( l, trp_pool_align(), trp_pool_footprint ( pack_depth+extra_depth ) );
843 540 : void * _penalty_map = FD_SCRATCH_ALLOC_APPEND( l, penalty_map_align(), penalty_map_footprint( lg_penalty_trp ) );
844 540 : void * _expq = FD_SCRATCH_ALLOC_APPEND( l, expq_align(), expq_footprint ( pack_depth ) );
845 540 : void * _uses = FD_SCRATCH_ALLOC_APPEND( l, acct_uses_align(), acct_uses_footprint( lg_uses_tbl_sz ) );
846 540 : void * _writer_cost = FD_SCRATCH_ALLOC_APPEND( l, wcost_map_align(), wcost_map_footprint( wcost_chain_cnt ) );
847 540 : void * _written_lst = FD_SCRATCH_ALLOC_APPEND( l, wcost_pool_align(), wcost_pool_footprint( max_w_per_block ) );
848 540 : void * _noncemap = FD_SCRATCH_ALLOC_APPEND( l, noncemap_align(), noncemap_footprint ( nonce_chain_cnt ) );
849 540 : void * _sig_map = FD_SCRATCH_ALLOC_APPEND( l, sig2txn_align(), sig2txn_footprint ( sig_chain_cnt ) );
850 540 : void * _bundle_temp = FD_SCRATCH_ALLOC_APPEND( l, acct_uses_align(), acct_uses_footprint( lg_bundle_temp ) );
851 540 : void * _use_by_bank = FD_SCRATCH_ALLOC_APPEND( l, 32UL, sizeof(fd_pack_addr_use_t)*max_acct_in_flight );
852 540 : void * _use_by_txn = FD_SCRATCH_ALLOC_APPEND( l, 32UL, sizeof(ulong)*max_txn_in_flight );
853 540 : void * _acct_bitset = FD_SCRATCH_ALLOC_APPEND( l, bitset_map_align(), bitset_map_footprint( lg_acct_in_trp ) );
854 540 : void * bundle_meta = FD_SCRATCH_ALLOC_APPEND( l, 64UL, (pack_depth+extra_depth)*bundle_meta_sz );
855 :
856 540 : pack->pack_depth = pack_depth;
857 540 : pack->bundle_meta_sz = bundle_meta_sz;
858 540 : pack->bank_tile_cnt = bank_tile_cnt;
859 540 : pack->lim[0] = *limits;
860 540 : pack->pending_txn_cnt = 0UL;
861 540 : pack->microblock_cnt = 0UL;
862 540 : pack->data_bytes_consumed = 0UL;
863 540 : pack->alloc_consumed = 0UL;
864 540 : memset( pack->sched_results, 0, sizeof(pack->sched_results) );
865 540 : pack->rng = rng;
866 540 : pack->cumulative_block_cost = 0UL;
867 540 : pack->cumulative_vote_cost = 0UL;
868 540 : pack->expire_before = 0UL;
869 540 : pack->outstanding_microblock_mask = 0UL;
870 540 : pack->cumulative_rebated_cus = 0UL;
871 :
872 540 : acct_blocklist_new( pack->acct_blocklist );
873 540 : int ins_failed = acct_blocklist_cnt>FD_PACK_ACCT_BLOCKLIST_MAX;
874 606 : for( ulong i=0UL; (!ins_failed) & (i<acct_blocklist_cnt); i++ ) {
875 66 : ins_failed |= acct_blocklist_key_inval( acct_blocklist[i] ) ||
876 66 : (NULL==acct_blocklist_insert( pack->acct_blocklist, acct_blocklist[i] ));
877 66 : }
878 540 : if( FD_UNLIKELY( ins_failed ) ) {
879 6 : FD_LOG_WARNING(( "constructing the account blocklist failed. Ensure the list contains no more than %lu "
880 6 : "entries, and does not contain duplicates or the System Program (11...111)", FD_PACK_ACCT_BLOCKLIST_MAX ));
881 6 : return NULL;
882 6 : }
883 :
884 534 : trp_pool_new( _pool, pack_depth+extra_depth );
885 :
886 534 : fd_pack_ord_txn_t * pool = trp_pool_join( _pool );
887 534 : treap_seed( pool, pack_depth+extra_depth, fd_rng_ulong( rng ) );
888 594792 : for( ulong i=0UL; i<pack_depth+extra_depth; i++ ) pool[i].root = FD_ORD_TXN_ROOT_FREE;
889 :
890 534 : (void)trp_pool_leave( pool );
891 :
892 534 : penalty_map_new( _penalty_map, lg_penalty_trp, fd_rng_ulong( rng ) );
893 :
894 : /* These treaps can have at most pack_depth elements at any moment,
895 : but they come from a pool of size pack_depth+extra_depth. */
896 534 : treap_new( (void*)pack->pending, pack_depth+extra_depth );
897 534 : treap_new( (void*)pack->pending_votes, pack_depth+extra_depth );
898 534 : treap_new( (void*)pack->pending_bundles, pack_depth+extra_depth );
899 :
900 534 : pack->pending_smallest->cus = ULONG_MAX;
901 534 : pack->pending_smallest->bytes = ULONG_MAX;
902 534 : pack->pending_votes_smallest->cus = ULONG_MAX;
903 534 : pack->pending_votes_smallest->bytes = ULONG_MAX;
904 :
905 534 : expq_new( _expq, pack_depth );
906 :
907 534 : FD_PACK_BITSET_CLEAR( pack->bitset_rw_in_use );
908 534 : FD_PACK_BITSET_CLEAR( pack->bitset_w_in_use );
909 :
910 534 : acct_uses_new( _uses, lg_uses_tbl_sz, fd_rng_ulong( rng ) );
911 534 : acct_uses_new( _bundle_temp, lg_bundle_temp, fd_rng_ulong( rng ) );
912 :
913 534 : wcost_map_new ( _writer_cost, wcost_chain_cnt, fd_rng_ulong( rng ) );
914 534 : wcost_dlist_new( pack->written_list );
915 534 : wcost_pool_new ( _written_lst, max_w_per_block );
916 :
917 534 : noncemap_new( _noncemap, nonce_chain_cnt, fd_rng_ulong( rng ) );
918 :
919 534 : sig2txn_new( _sig_map, sig_chain_cnt, fd_rng_ulong( rng ) );
920 :
921 534 : fd_pack_addr_use_t * use_by_bank = (fd_pack_addr_use_t *)_use_by_bank;
922 534 : ulong * use_by_bank_txn = (ulong *)_use_by_txn;
923 6765 : for( ulong i=0UL; i<bank_tile_cnt; i++ ) {
924 6231 : pack->use_by_bank [i] = use_by_bank + i*(FD_TXN_ACCT_ADDR_MAX*max_txn_per_mblk+1UL);
925 6231 : pack->use_by_bank_cnt[i] = 0UL;
926 6231 : pack->use_by_bank_txn[i] = use_by_bank_txn + i*max_txn_per_mblk;
927 6231 : pack->use_by_bank_txn[i][0] = 0UL;
928 6231 : }
929 27411 : for( ulong i=bank_tile_cnt; i<FD_PACK_MAX_EXECLE_TILES; i++ ) {
930 26877 : pack->use_by_bank [i] = NULL;
931 26877 : pack->use_by_bank_cnt[i] = 0UL;
932 26877 : pack->use_by_bank_txn[i] = NULL;
933 26877 : }
934 :
935 534 : fd_histf_new( pack->txn_per_microblock, FD_MHIST_MIN( PACK, TXN_PER_MICROBLOCK ),
936 534 : FD_MHIST_MAX( PACK, TXN_PER_MICROBLOCK ) );
937 534 : fd_histf_new( pack->vote_per_microblock, FD_MHIST_MIN( PACK, VOTE_PER_MICROBLOCK ),
938 534 : FD_MHIST_MAX( PACK, VOTE_PER_MICROBLOCK ) );
939 :
940 534 : fd_histf_new( pack->scheduled_cus_per_block, FD_MHIST_MIN( PACK, CU_SCHEDULED_PER_BLOCK ),
941 534 : FD_MHIST_MAX( PACK, CU_SCHEDULED_PER_BLOCK ) );
942 534 : fd_histf_new( pack->rebated_cus_per_block, FD_MHIST_MIN( PACK, CU_REBATED_PER_BLOCK ),
943 534 : FD_MHIST_MAX( PACK, CU_REBATED_PER_BLOCK ) );
944 534 : fd_histf_new( pack->net_cus_per_block, FD_MHIST_MIN( PACK, CU_NET_PER_BLOCK ),
945 534 : FD_MHIST_MAX( PACK, CU_NET_PER_BLOCK ) );
946 534 : fd_histf_new( pack->pct_cus_per_block, FD_MHIST_MIN( PACK, CU_PCT ),
947 534 : FD_MHIST_MAX( PACK, CU_PCT ) );
948 :
949 534 : pack->compressed_slot_number = (ushort)(FD_PACK_SKIP_CNT+1);
950 :
951 534 : pack->bitset_avail[ 0 ] = FD_PACK_BITSET_SLOWPATH;
952 182806 : for( ulong i=0UL; i<FD_PACK_BITSET_MAX; i++ ) pack->bitset_avail[ i+1UL ] = (ushort)i;
953 534 : pack->bitset_avail_cnt = FD_PACK_BITSET_MAX;
954 :
955 534 : bitset_map_new( _acct_bitset, lg_acct_in_trp, fd_rng_ulong( rng ) );
956 :
957 534 : fd_chkdup_new( pack->chkdup, rng );
958 :
959 534 : pack->bundle_meta = bundle_meta;
960 :
961 534 : return mem;
962 540 : }
963 :
964 : fd_pack_t *
965 534 : fd_pack_join( void * mem ) {
966 534 : FD_SCRATCH_ALLOC_INIT( l, mem );
967 534 : fd_pack_t * pack = FD_SCRATCH_ALLOC_APPEND( l, FD_PACK_ALIGN, sizeof(fd_pack_t) );
968 :
969 534 : int enable_bundles = !!pack->bundle_meta_sz;
970 534 : ulong pack_depth = pack->pack_depth;
971 534 : ulong extra_depth = fd_ulong_if( enable_bundles, 1UL+2UL*FD_PACK_MAX_TXN_PER_BUNDLE, 1UL );
972 534 : ulong bank_tile_cnt = pack->bank_tile_cnt;
973 534 : ulong max_txn_per_microblock = fd_ulong_max( pack->lim->max_txn_per_microblock,
974 534 : fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE, 0UL ) );
975 :
976 534 : ulong max_acct_in_treap = pack_depth * FD_TXN_ACCT_ADDR_MAX;
977 534 : ulong max_acct_in_flight = bank_tile_cnt * (FD_TXN_ACCT_ADDR_MAX * max_txn_per_microblock + 1UL);
978 534 : ulong max_txn_in_flight = bank_tile_cnt * max_txn_per_microblock;
979 534 : ulong max_w_per_block = fd_ulong_min( pack->lim->max_cost_per_block / FD_PACK_COST_PER_WRITABLE_ACCT,
980 534 : max_txn_per_microblock * pack->lim->max_microblocks_per_block * FD_TXN_ACCT_ADDR_MAX );
981 534 : ulong wcost_chain_cnt = wcost_map_chain_cnt_est( max_w_per_block );
982 534 : ulong bundle_temp_accts = fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE*FD_TXN_ACCT_ADDR_MAX, 1UL );
983 534 : ulong sig_chain_cnt = sig2txn_chain_cnt_est( pack_depth );
984 534 : ulong nonce_chain_cnt = noncemap_chain_cnt_est( pack_depth );
985 :
986 534 : int lg_uses_tbl_sz = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_flight ) );
987 534 : int lg_acct_in_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap ) );
988 534 : int lg_penalty_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap/PENALTY_TREAP_THRESHOLD ) );
989 534 : int lg_bundle_temp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*bundle_temp_accts ) );
990 :
991 :
992 534 : pack->pool = trp_pool_join( FD_SCRATCH_ALLOC_APPEND( l, trp_pool_align(), trp_pool_footprint ( pack_depth+extra_depth ) ) );
993 534 : pack->penalty_treaps= penalty_map_join(FD_SCRATCH_ALLOC_APPEND( l, penalty_map_align(),penalty_map_footprint( lg_penalty_trp ) ) );
994 534 : pack->expiration_q = expq_join ( FD_SCRATCH_ALLOC_APPEND( l, expq_align(), expq_footprint ( pack_depth ) ) );
995 534 : pack->acct_in_use = acct_uses_join( FD_SCRATCH_ALLOC_APPEND( l, acct_uses_align(), acct_uses_footprint ( lg_uses_tbl_sz ) ) );
996 534 : pack->writer_costs = wcost_map_join( FD_SCRATCH_ALLOC_APPEND( l, wcost_map_align(), wcost_map_footprint ( wcost_chain_cnt ) ) );
997 534 : pack->writers = wcost_pool_join( FD_SCRATCH_ALLOC_APPEND( l, wcost_pool_align(), wcost_pool_footprint( max_w_per_block ) ) );
998 534 : pack->noncemap = noncemap_join( FD_SCRATCH_ALLOC_APPEND( l, noncemap_align(), noncemap_footprint ( nonce_chain_cnt ) ) );
999 534 : pack->signature_map = sig2txn_join( FD_SCRATCH_ALLOC_APPEND( l, sig2txn_align(), sig2txn_footprint ( sig_chain_cnt ) ) );
1000 534 : pack->bundle_temp_map=acct_uses_join( FD_SCRATCH_ALLOC_APPEND( l, acct_uses_align(), acct_uses_footprint ( lg_bundle_temp ) ) );
1001 534 : /* */ FD_SCRATCH_ALLOC_APPEND( l, 32UL, sizeof(fd_pack_addr_use_t)*max_acct_in_flight );
1002 534 : /* */ FD_SCRATCH_ALLOC_APPEND( l, 32UL, sizeof(ulong)*max_txn_in_flight );
1003 534 : pack->acct_to_bitset= bitset_map_join( FD_SCRATCH_ALLOC_APPEND( l, bitset_map_align(), bitset_map_footprint( lg_acct_in_trp ) ) );
1004 534 : /* */ FD_SCRATCH_ALLOC_APPEND( l, 64UL, (pack_depth+extra_depth)*pack->bundle_meta_sz );
1005 :
1006 534 : wcost_dlist_join( pack->written_list );
1007 :
1008 534 : FD_MGAUGE_SET( PACK, TXN_PENDING_CAPACITY, pack->pack_depth );
1009 534 : memset( pack->top_writers, 0, sizeof(pack->top_writers) );
1010 :
1011 534 : return pack;
1012 534 : }
1013 :
1014 :
1015 : /* Returns 0 on failure, 1 on success for a vote, 2 on success for a
1016 : non-vote. */
1017 : static int
1018 : fd_pack_estimate_rewards_and_compute( fd_txn_e_t * txne,
1019 : fd_pack_ord_txn_t * out,
1020 37794 : fd_pack_limits_t const * lim ) {
1021 37794 : fd_txn_t * txn = TXN(txne->txnp);
1022 37794 : ulong sig_rewards = FD_PACK_FEE_PER_SIGNATURE * txn->signature_cnt; /* Easily in [5000, 635000] */
1023 :
1024 37794 : ulong requested_execution_cus;
1025 37794 : ulong priority_rewards;
1026 37794 : ulong precompile_sigs;
1027 37794 : ulong requested_loaded_accounts_data_cost;
1028 37794 : ulong allocated_data;
1029 37794 : ulong cost_estimate = fd_pack_compute_cost( txn, txne->txnp->payload, &txne->txnp->flags, &requested_execution_cus, &priority_rewards, &precompile_sigs, &requested_loaded_accounts_data_cost, &allocated_data );
1030 :
1031 37794 : if( FD_UNLIKELY( !cost_estimate ) ) return 0;
1032 :
1033 : /* precompile_sigs <= 16320, so after the addition,
1034 : sig_rewards < 83,000,000 */
1035 37791 : sig_rewards += FD_PACK_FEE_PER_SIGNATURE * precompile_sigs;
1036 37791 : sig_rewards = sig_rewards * FD_PACK_TXN_FEE_BURN_PCT / 100UL;
1037 :
1038 : /* No fancy CU estimation in this version of pack
1039 : for( ulong i=0UL; i<(ulong)txn->instr_cnt; i++ ) {
1040 : uchar prog_id_idx = txn->instr[ i ].program_id;
1041 : fd_acct_addr_t const * acct_addr = fd_txn_get_acct_addrs( txn, txnp->payload ) + (ulong)prog_id_idx;
1042 : }
1043 : */
1044 37791 : out->rewards = (priority_rewards < (UINT_MAX - sig_rewards)) ? (uint)(sig_rewards + priority_rewards) : UINT_MAX;
1045 37791 : out->compute_est = (uint)cost_estimate;
1046 37791 : out->txn->pack_cu.requested_exec_plus_acct_data_cus = (uint)(requested_execution_cus + requested_loaded_accounts_data_cost);
1047 37791 : out->txn->pack_cu.non_execution_cus = (uint)(cost_estimate - requested_execution_cus - requested_loaded_accounts_data_cost);
1048 37791 : out->txn->pack_alloc = (uint)allocated_data;
1049 :
1050 : /* If a transaction allocates a lot, we want to treat it as if it
1051 : requests more CUs. However, we use compute_est in the block
1052 : limit calculations, so we can't touch it. To have the same
1053 : effect, we decrease rewards.
1054 : divisor is 1 unless
1055 : allocated_data cost_estimate
1056 : ---------------------------- >= ------------------
1057 : max_allocated_data_per_block max_cost_per_block
1058 :
1059 : 0 <=allocated_data <=20 * 1024^2
1060 : 30*10^6 <= max_cost_per_block < 2^32
1061 : 1020 <= cost_estimate < 1.6 * 10^6
1062 : 50*10^6 <= max_allocated_data_per_block <= 100 * 1000^2
1063 : (changes with the slot time duration)
1064 : So the numerator (<2^57) and denominator (<2^48) can't overflow.
1065 : Both cost_estimate and max_allocated_data_per_block non-zero,
1066 : so the denominator is never zero.
1067 : 1 <= divisor <= 1 + (max_cost_per_block * .000206)
1068 : */
1069 37791 : ulong divisor = 1UL + (allocated_data * lim->max_cost_per_block) / (cost_estimate * lim->max_allocated_data_per_block);
1070 37791 : out->rewards /= (uint)divisor;
1071 :
1072 37791 : return fd_int_if( txne->txnp->flags & FD_TXN_P_FLAGS_IS_SIMPLE_VOTE, 1, 2 );
1073 37794 : }
1074 :
1075 : /* Returns 0 on failure, 1 if not a durable nonce transaction, and 2 if
1076 : it is. FIXME: These return codes are set to harmonize with
1077 : estimate_rewards_and_compute but -1/0/1 makes a lot more sense to me.
1078 : */
1079 : static int
1080 37788 : fd_pack_validate_durable_nonce( fd_txn_e_t * txne ) {
1081 37788 : fd_txn_t const * txn = TXN(txne->txnp);
1082 :
1083 : /* First instruction invokes system program with 4 bytes of
1084 : instruction data with the little-endian value 4. It also has 3
1085 : accounts: the nonce account, recent blockhashes sysvar, and the
1086 : nonce authority. It seems like technically the nonce authority may
1087 : not need to be passed in, but we disallow that. We also allow
1088 : trailing data and trailing accounts. We want to organize the
1089 : checks somewhat to minimize cache misses. */
1090 37788 : if( FD_UNLIKELY( txn->instr_cnt==0 ) ) return 1;
1091 37788 : if( FD_UNLIKELY( txn->instr[ 0 ].data_sz<4UL ) ) return 1;
1092 37788 : if( FD_UNLIKELY( txn->instr[ 0 ].acct_cnt<3UL ) ) return 1; /* It seems like technically 2 is allowed, but never used */
1093 8034 : if( FD_LIKELY ( fd_uint_load_4( txne->txnp->payload + txn->instr[ 0 ].data_off )!=4U ) ) return 1;
1094 : /* The program has to be a static account */
1095 1155 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, txne->txnp->payload );
1096 1155 : if( FD_UNLIKELY( !fd_memeq( accts[ txn->instr[ 0 ].program_id ].b, null_addr.b, 32UL ) ) ) return 1;
1097 1155 : if( FD_UNLIKELY( !fd_txn_is_signer( txn, txne->txnp->payload[ txn->instr[ 0 ].acct_off+2 ] ) ) ) return 0;
1098 : /* We could check recent blockhash, but it's not necessary */
1099 1152 : return 2;
1100 1155 : }
1101 :
1102 : /* Can the fee payer afford to pay a transaction with the specified
1103 : price? Returns 1 if so, 0 otherwise. This is just a stub that
1104 : always returns 1 for now, and the real check is deferred to the bank
1105 : tile. In general, this function can't be totally accurate, because
1106 : the transactions immediately prior to this one can affect the balance
1107 : of this fee payer, but a simple check here may be helpful for
1108 : reducing spam. */
1109 : static int
1110 : fd_pack_can_fee_payer_afford( fd_acct_addr_t const * acct_addr,
1111 37782 : ulong price /* in lamports */) {
1112 37782 : (void)acct_addr;
1113 37782 : (void)price;
1114 37782 : return 1;
1115 37782 : }
1116 :
1117 :
1118 :
1119 :
1120 :
1121 35850 : fd_txn_e_t * fd_pack_insert_txn_init( fd_pack_t * pack ) { return trp_pool_ele_acquire( pack->pool )->txn_e; }
1122 0 : void fd_pack_insert_txn_cancel( fd_pack_t * pack, fd_txn_e_t * txn ) { trp_pool_ele_release( pack->pool, (fd_pack_ord_txn_t*)txn ); }
1123 :
1124 24 : #define REJECT( reason ) do { \
1125 24 : trp_pool_ele_release( pack->pool, ord ); \
1126 24 : return FD_PACK_INSERT_REJECT_ ## reason; \
1127 24 : } while( 0 )
1128 :
1129 : /* These require txn, accts, and alt_adj to be defined as per usual */
1130 30067 : #define ACCT_IDX_TO_PTR( idx ) (__extension__( { \
1131 30067 : ulong __idx = (ulong)(idx); \
1132 30067 : fd_ptr_if( __idx<fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM ), accts, alt_adj )+__idx; \
1133 30067 : }))
1134 1384527 : #define ACCT_ITER_TO_PTR( iter ) (__extension__( { \
1135 1384527 : ulong __idx = fd_txn_acct_iter_idx( iter ); \
1136 1384527 : fd_ptr_if( __idx<fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM ), accts, alt_adj )+__idx; \
1137 1384527 : }))
1138 :
1139 :
1140 : /* Tries to find the worst transaction in any treap in pack. If that
1141 : transaction's score is worse than or equal to threshold_score, it
1142 : initiates a delete and returns the number of deleted transactions
1143 : (potentially more than 1 for a bundle). If it's higher than
1144 : threshold_score, it returns 0. To force this function to delete the
1145 : worst transaction if there are any eligible ones, pass FLT_MAX as
1146 : threshold_score. */
1147 : static inline ulong
1148 : delete_worst( fd_pack_t * pack,
1149 : float threshold_score,
1150 3081 : int is_vote ) {
1151 : /* If the tree is full, we want to see if this is better than the
1152 : worst element in the pool before inserting. If the new transaction
1153 : is better than that one, we'll delete it and insert the new
1154 : transaction. Otherwise, we'll throw away this transaction.
1155 :
1156 : We want to bias the definition of "worst" here to provide better
1157 : quality of service. For example, if the pool is filled with
1158 : transactions that all write to the same account or are all votes,
1159 : we want to bias towards treating one of those transactions as the
1160 : worst, even if they pay slightly higher fees per computer unit,
1161 : since we know we won't actually be able to schedule them all.
1162 :
1163 : This is a tricky task, however. All our notions of priority and
1164 : better/worse are based on static information about the transaction,
1165 : and there's not an easy way to take into account global
1166 : information, for example, how many other transactions contend with
1167 : this one. One idea is to build a heap (not a treap, since we only
1168 : need pop-min, insert, and delete) with one element for each element
1169 : in the pool, with a "delete me" score that's related but not
1170 : identical to the normal score. This would allow building in some
1171 : global information. The downside is that the global information
1172 : that gets integrated is static. E.g. if you bias a transaction's
1173 : "delete me" score to make it more likely to be deleted because
1174 : there are many conflicting transactions in the pool, the score
1175 : stays biased, even if the global conditions change (unless you come
1176 : up with some complicated re-scoring scheme). This can work, since
1177 : when the pool is full, the global bias factors are unlikely to
1178 : change significantly at the relevant timescales.
1179 :
1180 : However, rather than this, we implement a simpler probabilistic
1181 : scheme. We'll sample M transactions, find the worst transaction in
1182 : each of the M treaps, compute a "delete me" score for those <= M
1183 : transactions, and delete the worst. If one penalty treap is
1184 : starting to get big, then it becomes very likely that the random
1185 : sample will find it and choose to delete a transaction from it.
1186 :
1187 : The exact formula for the "delete me" score should be the matter of
1188 : some more intense quantitative research. For now, we'll just use
1189 : this:
1190 :
1191 : Treap with N transactions Scale Factor
1192 : Pending 1.0 unless inserting a vote and votes < 25%
1193 : Pending votes 1.0 until 75% of depth, then 0
1194 : Penalty treap 1.0 at <= 100 transactions, then sqrt(100/N)
1195 : Pending bundles inf (since the rewards value is fudged)
1196 :
1197 : We'll also use M=8. */
1198 :
1199 3081 : float worst_score = FLT_MAX;
1200 3081 : fd_pack_ord_txn_t * worst = NULL;
1201 27729 : for( ulong i=0UL; i<8UL; i++ ) {
1202 24648 : uint pool_max = (uint)trp_pool_max( pack->pool );
1203 24648 : ulong sample_i = fd_rng_uint_roll( pack->rng, pool_max );
1204 :
1205 24648 : fd_pack_ord_txn_t * sample = &pack->pool[ sample_i ];
1206 : /* Presumably if we're calling this, the pool is almost entirely
1207 : full, so the probability of choosing a free one is small. If
1208 : it does happen, find the first one that isn't free. */
1209 26119 : while( FD_UNLIKELY( sample->root==FD_ORD_TXN_ROOT_FREE ) ) sample = &pack->pool[ (++sample_i)%pool_max ];
1210 :
1211 24648 : int root_idx = sample->root;
1212 24648 : float multiplier = 0.0f; /* The smaller this is, the more biased we'll be to deleting it */
1213 24648 : treap_t * treap;
1214 24648 : switch( root_idx & FD_ORD_TXN_ROOT_TAG_MASK ) {
1215 0 : default:
1216 0 : case FD_ORD_TXN_ROOT_FREE: {
1217 0 : FD_LOG_CRIT(( "Double free detected" ));
1218 0 : return ULONG_MAX; /* Can't be hit */
1219 0 : }
1220 3392 : case FD_ORD_TXN_ROOT_PENDING: {
1221 3392 : treap = pack->pending;
1222 3392 : ulong vote_cnt = treap_ele_cnt( pack->pending_votes );
1223 3392 : if( FD_LIKELY( !is_vote || (vote_cnt>=pack->pack_depth/4UL ) ) ) multiplier = 1.0f;
1224 3392 : break;
1225 0 : }
1226 0 : case FD_ORD_TXN_ROOT_PENDING_VOTE: {
1227 0 : treap = pack->pending_votes;
1228 0 : ulong vote_cnt = treap_ele_cnt( pack->pending_votes );
1229 0 : if( FD_LIKELY( is_vote || (vote_cnt<=3UL*pack->pack_depth/4UL ) ) ) multiplier = 1.0f;
1230 0 : break;
1231 0 : }
1232 0 : case FD_ORD_TXN_ROOT_PENDING_BUNDLE: {
1233 : /* We don't have a way to tell how much these actually pay in
1234 : rewards, so we just assume they are very high. */
1235 0 : treap = pack->pending_bundles;
1236 : /* We cap rewards at UINT_MAX lamports for estimation, and min
1237 : CUs is about 1000, which means rewards/compute < 5e6.
1238 : FLT_MAX is around 3e38. That means, 1e20*rewards/compute is
1239 : much less than FLT_MAX, so we won't have any issues with
1240 : overflow. On the other hand, if rewards==1 lamport and
1241 : compute is 2 million CUs, 1e20*1/2e6 is still higher than any
1242 : normal transaction. */
1243 0 : multiplier = 1e20f;
1244 0 : break;
1245 0 : }
1246 21256 : case FD_ORD_TXN_ROOT_PENALTY( 0 ): {
1247 21256 : fd_txn_t * txn = TXN( sample->txn );
1248 21256 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, sample->txn->payload );
1249 21256 : fd_acct_addr_t const * alt_adj = sample->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1250 21256 : fd_acct_addr_t penalty_acct = *ACCT_IDX_TO_PTR( FD_ORD_TXN_ROOT_PENALTY_ACCT_IDX( root_idx ) );
1251 21256 : fd_pack_penalty_treap_t * q = penalty_map_query( pack->penalty_treaps, penalty_acct, NULL );
1252 21256 : FD_TEST( q );
1253 21256 : ulong cnt = treap_ele_cnt( q->penalty_treap );
1254 21256 : treap = q->penalty_treap;
1255 :
1256 21256 : multiplier = sqrtf( 100.0f / (float)fd_ulong_max( 100UL, cnt ) );
1257 21256 : break;
1258 21256 : }
1259 24648 : }
1260 : /* Get the worst from the sampled treap */
1261 24648 : treap_fwd_iter_t _cur=treap_fwd_iter_init( treap, pack->pool );
1262 24648 : FD_TEST( !treap_fwd_iter_done( _cur ) ); /* It can't be empty because we just sampled an element from it. */
1263 24648 : sample = treap_fwd_iter_ele( _cur, pack->pool );
1264 :
1265 24648 : float score = multiplier * (float)sample->rewards / (float)sample->compute_est;
1266 24648 : worst = fd_ptr_if( score<worst_score, sample, worst );
1267 24648 : worst_score = fd_float_if( worst_score<score, worst_score, score );
1268 24648 : }
1269 :
1270 3081 : if( FD_UNLIKELY( !worst ) ) return 0;
1271 3081 : if( FD_UNLIKELY( threshold_score<worst_score ) ) return 0;
1272 :
1273 3081 : return delete_transaction( pack, worst, 1, 1 );
1274 3081 : }
1275 :
1276 : static inline int
1277 : validate_transaction( fd_pack_t * pack,
1278 : fd_pack_ord_txn_t const * ord,
1279 : fd_txn_t const * txn,
1280 : fd_acct_addr_t const * accts,
1281 : fd_acct_addr_t const * alt_adj,
1282 37782 : int check_bundle_blacklist ) {
1283 37782 : int writes_to_sysvar = 0;
1284 37782 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
1285 129159 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
1286 91377 : writes_to_sysvar |= fd_pack_unwritable_contains( ACCT_ITER_TO_PTR( iter ) );
1287 91377 : }
1288 :
1289 37782 : int bundle_blacklist = 0;
1290 37782 : int acct_blocklist = 0;
1291 37782 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_ALL );
1292 268050 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
1293 230268 : bundle_blacklist |= (3==fd_pack_tip_prog_check_blacklist( ACCT_ITER_TO_PTR( iter ) ));
1294 : /* querying for the inval key is a violation of the fd_map
1295 : contract, even though it's actually fine... */
1296 230268 : acct_blocklist |= (!acct_blocklist_key_inval( *ACCT_ITER_TO_PTR( iter ) )) &&
1297 230268 : !!acct_blocklist_query( pack->acct_blocklist, *ACCT_ITER_TO_PTR( iter ), NULL );
1298 230268 : }
1299 :
1300 37782 : fd_acct_addr_t const * alt = ord->txn_e->alt_accts;
1301 37782 : fd_chkdup_t * chkdup = pack->chkdup;
1302 37782 : ulong imm_cnt = fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1303 37782 : ulong alt_cnt = fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_ALT );
1304 :
1305 : /* Throw out transactions ... */
1306 : /* ... that are unfunded */
1307 37782 : if( FD_UNLIKELY( !fd_pack_can_fee_payer_afford( accts, ord->rewards ) ) ) return FD_PACK_INSERT_REJECT_UNAFFORDABLE;
1308 : /* ... that are so big they'll never run */
1309 37782 : if( FD_UNLIKELY( ord->compute_est >= pack->lim->max_cost_per_block ) ) return FD_PACK_INSERT_REJECT_TOO_LARGE;
1310 : /* ... that load too many accounts (ignoring 9LZdXeKGeBV6hRLdxS1rHbHoEUsKqesCC2ZAPTPKJAbK) */
1311 37782 : if( FD_UNLIKELY( fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_ALL )>64UL ) ) return FD_PACK_INSERT_REJECT_ACCOUNT_CNT;
1312 : /* ... that duplicate an account address */
1313 37779 : if( FD_UNLIKELY( fd_chkdup_check( chkdup, accts, imm_cnt, alt, alt_cnt ) ) ) return FD_PACK_INSERT_REJECT_DUPLICATE_ACCT;
1314 : /* ... that try to write to a sysvar */
1315 37776 : if( FD_UNLIKELY( writes_to_sysvar ) ) return FD_PACK_INSERT_REJECT_WRITES_SYSVAR;
1316 : /* ... that use an account that violates bundle rules */
1317 37683 : if( FD_UNLIKELY( bundle_blacklist & !!check_bundle_blacklist ) ) return FD_PACK_INSERT_REJECT_BUNDLE_BLACKLIST;
1318 : /* ... that use a blocklisted account */
1319 37683 : if( FD_UNLIKELY( acct_blocklist ) ) return FD_PACK_INSERT_REJECT_ACCT_BLOCKLIST;
1320 :
1321 37668 : return 0;
1322 37683 : }
1323 :
1324 :
1325 :
1326 : /* returns cumulative penalty "points", i.e. the sum of the populated
1327 : section of penalties (which also tells the caller how much of the
1328 : array is populated. */
1329 : static inline ulong
1330 : populate_bitsets( fd_pack_t * pack,
1331 : fd_pack_ord_txn_t * ord,
1332 : ushort penalties [ static FD_TXN_ACCT_ADDR_MAX ],
1333 36618 : uchar penalty_idx[ static FD_TXN_ACCT_ADDR_MAX ] ) {
1334 36618 : FD_PACK_BITSET_CLEAR( ord->rw_bitset );
1335 36618 : FD_PACK_BITSET_CLEAR( ord->w_bitset );
1336 :
1337 36618 : fd_txn_t * txn = TXN(ord->txn);
1338 36618 : uchar * payload = ord->txn->payload;
1339 :
1340 36618 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, payload );
1341 : /* alt_adj is the pointer to the ALT expansion, adjusted so that if
1342 : account address n is the first that comes from the ALT, it can be
1343 : accessed with adj_lut[n]. */
1344 36618 : fd_acct_addr_t const * alt_adj = ord->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1345 :
1346 36618 : ulong cumulative_penalty = 0UL;
1347 36618 : ulong penalty_i = 0UL;
1348 :
1349 36618 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
1350 123312 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
1351 86694 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
1352 86694 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( pack->acct_to_bitset, acct, NULL );
1353 86694 : if( FD_UNLIKELY( q==NULL ) ) {
1354 62482 : q = bitset_map_insert( pack->acct_to_bitset, acct );
1355 62482 : q->ref_cnt = 0UL;
1356 62482 : q->first_instance = ord;
1357 62482 : q->first_instance_was_write = 1;
1358 62482 : q->bit = FD_PACK_BITSET_FIRST_INSTANCE;
1359 62482 : } else if( FD_UNLIKELY( q->bit == FD_PACK_BITSET_FIRST_INSTANCE ) ) {
1360 1844 : q->bit = pack->bitset_avail[ pack->bitset_avail_cnt ];
1361 1844 : pack->bitset_avail_cnt = fd_ulong_if( !!pack->bitset_avail_cnt, pack->bitset_avail_cnt-1UL, 0UL );
1362 :
1363 1844 : FD_PACK_BITSET_SETN( q->first_instance->rw_bitset, q->bit );
1364 1844 : if( q->first_instance_was_write ) FD_PACK_BITSET_SETN( q->first_instance->w_bitset, q->bit );
1365 1844 : }
1366 86694 : ulong penalty = fd_ulong_max( q->ref_cnt, PENALTY_TREAP_THRESHOLD )-PENALTY_TREAP_THRESHOLD;
1367 86694 : if( FD_UNLIKELY( penalty ) ) {
1368 17667 : penalties [ penalty_i ] = (ushort)penalty;
1369 17667 : penalty_idx[ penalty_i ] = (uchar )fd_txn_acct_iter_idx( iter );
1370 17667 : penalty_i++;
1371 17667 : cumulative_penalty += penalty;
1372 17667 : }
1373 :
1374 86694 : q->ref_cnt++;
1375 86694 : FD_PACK_BITSET_SETN( ord->rw_bitset, q->bit );
1376 86694 : FD_PACK_BITSET_SETN( ord->w_bitset , q->bit );
1377 86694 : }
1378 :
1379 36618 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_READONLY );
1380 169617 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
1381 :
1382 132999 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
1383 132999 : if( FD_UNLIKELY( fd_pack_unwritable_contains( &acct ) ) ) continue;
1384 :
1385 81615 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( pack->acct_to_bitset, acct, NULL );
1386 81615 : if( FD_UNLIKELY( q==NULL ) ) {
1387 23781 : q = bitset_map_insert( pack->acct_to_bitset, acct );
1388 23781 : q->ref_cnt = 0UL;
1389 23781 : q->first_instance = ord;
1390 23781 : q->first_instance_was_write = 0;
1391 23781 : q->bit = FD_PACK_BITSET_FIRST_INSTANCE;
1392 57834 : } else if( FD_UNLIKELY( q->bit == FD_PACK_BITSET_FIRST_INSTANCE ) ) {
1393 3723 : q->bit = pack->bitset_avail[ pack->bitset_avail_cnt ];
1394 3723 : pack->bitset_avail_cnt = fd_ulong_if( !!pack->bitset_avail_cnt, pack->bitset_avail_cnt-1UL, 0UL );
1395 :
1396 3723 : FD_PACK_BITSET_SETN( q->first_instance->rw_bitset, q->bit );
1397 3723 : if( q->first_instance_was_write ) FD_PACK_BITSET_SETN( q->first_instance->w_bitset, q->bit );
1398 3723 : }
1399 :
1400 81615 : q->ref_cnt++;
1401 81615 : FD_PACK_BITSET_SETN( ord->rw_bitset, q->bit );
1402 81615 : }
1403 36618 : return cumulative_penalty;
1404 36618 : }
1405 :
1406 : int
1407 : fd_pack_insert_txn_fini( fd_pack_t * pack,
1408 : fd_txn_e_t * txne,
1409 : ulong expires_at,
1410 35850 : ulong * delete_cnt ) {
1411 35850 : *delete_cnt = 0UL;
1412 :
1413 35850 : fd_pack_ord_txn_t * ord = (fd_pack_ord_txn_t *)txne;
1414 :
1415 35850 : fd_txn_t * txn = TXN(txne->txnp);
1416 35850 : uchar * payload = txne->txnp->payload;
1417 :
1418 35850 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, payload );
1419 : /* alt_adj is the pointer to the ALT expansion, adjusted so that if
1420 : account address n is the first that comes from the ALT, it can be
1421 : accessed with adj_lut[n]. */
1422 35850 : fd_acct_addr_t const * alt_adj = ord->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1423 :
1424 35850 : ord->expires_at = expires_at;
1425 :
1426 35850 : int est_result = fd_pack_estimate_rewards_and_compute( txne, ord, pack->lim );
1427 35850 : if( FD_UNLIKELY( !est_result ) ) REJECT( ESTIMATION_FAIL );
1428 35847 : int is_vote = est_result==1;
1429 :
1430 35847 : int nonce_result = fd_pack_validate_durable_nonce( txne );
1431 35847 : if( FD_UNLIKELY( !nonce_result ) ) REJECT( INVALID_NONCE );
1432 35844 : int is_durable_nonce = nonce_result==2;
1433 35844 : ord->txn->flags &= ~FD_TXN_P_FLAGS_DURABLE_NONCE;
1434 35844 : ord->txn->flags |= fd_uint_if( is_durable_nonce, FD_TXN_P_FLAGS_DURABLE_NONCE, 0U );
1435 :
1436 35844 : int validation_result = validate_transaction( pack, ord, txn, accts, alt_adj, !!pack->bundle_meta_sz );
1437 35844 : if( FD_UNLIKELY( validation_result ) ) {
1438 114 : trp_pool_ele_release( pack->pool, ord );
1439 114 : return validation_result;
1440 114 : }
1441 :
1442 : /* Reject any transactions that have already expired */
1443 35730 : if( FD_UNLIKELY( expires_at<pack->expire_before ) ) REJECT( EXPIRED );
1444 :
1445 35718 : int replaces = 0;
1446 : /* If it's a durable nonce and we already have one, delete one or the
1447 : other. */
1448 35718 : if( FD_UNLIKELY( is_durable_nonce ) ) {
1449 120 : fd_pack_ord_txn_t * same_nonce = noncemap_ele_query( pack->noncemap, txne, NULL, pack->pool );
1450 120 : if( FD_LIKELY( same_nonce ) ) { /* Seems like most nonce transactions are effectively duplicates */
1451 9 : if( FD_LIKELY( same_nonce->root == FD_ORD_TXN_ROOT_PENDING_BUNDLE || COMPARE_WORSE( ord, same_nonce ) ) ) REJECT( NONCE_PRIORITY );
1452 3 : ulong _delete_cnt = delete_transaction( pack, same_nonce, 0, 0 ); /* Not a bundle, so delete_full_bundle is 0 */
1453 3 : *delete_cnt += _delete_cnt;
1454 3 : replaces = 1;
1455 3 : }
1456 120 : }
1457 :
1458 35712 : if( FD_UNLIKELY( pack->pending_txn_cnt == pack->pack_depth ) ) {
1459 3072 : float threshold_score = (float)ord->rewards/(float)ord->compute_est;
1460 3072 : ulong _delete_cnt = delete_worst( pack, threshold_score, is_vote );
1461 3072 : *delete_cnt += _delete_cnt;
1462 3072 : if( FD_UNLIKELY( !_delete_cnt ) ) REJECT( PRIORITY );
1463 3072 : replaces = 1;
1464 3072 : }
1465 :
1466 35712 : ord->txn->flags &= ~(FD_TXN_P_FLAGS_BUNDLE | FD_TXN_P_FLAGS_INITIALIZER_BUNDLE);
1467 35712 : ord->skip = FD_PACK_SKIP_CNT;
1468 :
1469 : /* At this point, we know we have space to insert the transaction and
1470 : we've committed to insert it. */
1471 :
1472 : /* Since the pool uses ushorts, the size of the pool is < USHORT_MAX.
1473 : Each transaction can reference an account at most once, which means
1474 : that the total number of references for an account is < USHORT_MAX.
1475 : If these were ulongs, the array would be 512B, which is kind of a
1476 : lot to zero out.*/
1477 35712 : ushort penalties[ FD_TXN_ACCT_ADDR_MAX ] = {0};
1478 35712 : uchar penalty_idx[ FD_TXN_ACCT_ADDR_MAX ];
1479 35712 : ulong cumulative_penalty = populate_bitsets( pack, ord, penalties, penalty_idx );
1480 :
1481 35712 : treap_t * insert_into = pack->pending;
1482 :
1483 35712 : if( FD_UNLIKELY( cumulative_penalty && !is_vote ) ) { /* Optimize for high parallelism case */
1484 : /* Compute a weighted random choice */
1485 6159 : ulong roll = (ulong)fd_rng_uint_roll( pack->rng, (uint)cumulative_penalty ); /* cumulative_penalty < USHORT_MAX*64 < UINT_MAX */
1486 6159 : ulong i = 0UL;
1487 : /* Find the right one. This can be done in O(log N), but I imagine
1488 : N is normally so small that doesn't matter. */
1489 11941 : while( roll>=penalties[i] ) roll -= (ulong)penalties[i++];
1490 :
1491 6159 : fd_acct_addr_t penalty_acct = *ACCT_IDX_TO_PTR( penalty_idx[i] );
1492 6159 : fd_pack_penalty_treap_t * q = penalty_map_query( pack->penalty_treaps, penalty_acct, NULL );
1493 6159 : if( FD_UNLIKELY( q==NULL ) ) {
1494 21 : q = penalty_map_insert( pack->penalty_treaps, penalty_acct );
1495 21 : treap_new( q->penalty_treap, trp_pool_max( pack->pool ) );
1496 21 : }
1497 6159 : insert_into = q->penalty_treap;
1498 6159 : ord->root = FD_ORD_TXN_ROOT_PENALTY( penalty_idx[i] );
1499 29553 : } else {
1500 29553 : ord->root = fd_int_if( is_vote, FD_ORD_TXN_ROOT_PENDING_VOTE, FD_ORD_TXN_ROOT_PENDING );
1501 :
1502 29553 : fd_pack_smallest_t * smallest = fd_ptr_if( is_vote, &pack->pending_votes_smallest[0], pack->pending_smallest );
1503 29553 : smallest->cus = fd_ulong_min( smallest->cus, ord->compute_est );
1504 29553 : smallest->bytes = fd_ulong_min( smallest->bytes, txne->txnp->payload_sz );
1505 29553 : }
1506 :
1507 35712 : pack->pending_txn_cnt++;
1508 :
1509 35712 : sig2txn_ele_insert( pack->signature_map, ord, pack->pool );
1510 :
1511 35712 : if( FD_UNLIKELY( is_durable_nonce ) ) noncemap_ele_insert( pack->noncemap, ord, pack->pool );
1512 :
1513 35712 : fd_pack_expq_t temp[ 1 ] = {{ .expires_at = expires_at, .txn = ord }};
1514 35712 : expq_insert( pack->expiration_q, temp );
1515 :
1516 35712 : if( FD_LIKELY( is_vote ) ) insert_into = pack->pending_votes;
1517 :
1518 35712 : treap_ele_insert( insert_into, ord, pack->pool );
1519 35712 : return (is_vote) | (replaces<<1) | (is_durable_nonce<<2);
1520 35712 : }
1521 : #undef REJECT
1522 :
1523 : fd_txn_e_t * const *
1524 : fd_pack_insert_bundle_init( fd_pack_t * pack,
1525 : fd_txn_e_t * * bundle,
1526 501 : ulong txn_cnt ) {
1527 501 : FD_TEST( txn_cnt<=FD_PACK_MAX_TXN_PER_BUNDLE );
1528 501 : FD_TEST( trp_pool_free( pack->pool )>=txn_cnt );
1529 2448 : for( ulong i=0UL; i<txn_cnt; i++ ) bundle[ i ] = trp_pool_ele_acquire( pack->pool )->txn_e;
1530 501 : return bundle;
1531 501 : }
1532 :
1533 : void
1534 : fd_pack_insert_bundle_cancel( fd_pack_t * pack,
1535 : fd_txn_e_t * const * bundle,
1536 249 : ulong txn_cnt ) {
1537 : /* There's no real reason these have to be released in reverse, but it
1538 : seems fitting to release them in the opposite order they were
1539 : acquired. */
1540 1290 : for( ulong i=0UL; i<txn_cnt; i++ ) trp_pool_ele_release( pack->pool, (fd_pack_ord_txn_t*)bundle[ txn_cnt-1UL-i ] );
1541 249 : }
1542 :
1543 : /* Explained below */
1544 : #define BUNDLE_L_PRIME 37896771UL
1545 : #define BUNDLE_N 313721UL
1546 627 : #define RC_TO_REL_BUNDLE_IDX( r, c ) (BUNDLE_N - ((ulong)(r) * 1UL<<32)/((ulong)(c) * BUNDLE_L_PRIME))
1547 :
1548 : int
1549 : fd_pack_insert_bundle_fini( fd_pack_t * pack,
1550 : fd_txn_e_t * const * bundle,
1551 : ulong txn_cnt,
1552 : ulong expires_at,
1553 : int initializer_bundle,
1554 : void const * bundle_meta,
1555 501 : ulong * delete_cnt ) {
1556 :
1557 501 : int err = 0;
1558 501 : *delete_cnt = 0UL;
1559 :
1560 501 : ulong pending_b_txn_cnt = treap_ele_cnt( pack->pending_bundles );
1561 : /* We want to prevent bundles from consuming the whole treap, but in
1562 : general, we assume bundles are lucrative. We'll set the policy
1563 : on capping bundles at half of the pack depth. We assume that the
1564 : bundles are coming in a pre-prioritized order, so it doesn't make
1565 : sense to drop an earlier bundle for this one. That means that
1566 : really, the best thing to do is drop this one. */
1567 501 : if( FD_UNLIKELY( (!initializer_bundle)&(pending_b_txn_cnt+txn_cnt>pack->pack_depth/2UL) ) ) err = FD_PACK_INSERT_REJECT_PRIORITY;
1568 :
1569 501 : if( FD_UNLIKELY( expires_at<pack->expire_before ) ) err = FD_PACK_INSERT_REJECT_EXPIRED;
1570 :
1571 :
1572 501 : int replaces = 0;
1573 501 : ulong nonce_txn_cnt = 0UL;
1574 :
1575 : /* Collect nonce hashes to detect duplicate nonces.
1576 : Use a constant-time duplicate-detection algorithm -- Vacant entries
1577 : have the MSB set, occupied entries are the noncemap hash, with the
1578 : MSB set to 0. */
1579 501 : ulong nonce_hash63[ FD_PACK_MAX_TXN_PER_BUNDLE ];
1580 3006 : for( ulong i=0UL; i<FD_PACK_MAX_TXN_PER_BUNDLE; i++ ) {
1581 2505 : nonce_hash63[ i ] = ULONG_MAX-i;
1582 2505 : }
1583 :
1584 2439 : for( ulong i=0UL; (i<txn_cnt) && !err; i++ ) {
1585 1944 : fd_pack_ord_txn_t * ord = (fd_pack_ord_txn_t *)bundle[ i ];
1586 :
1587 1944 : fd_txn_t const * txn = TXN(bundle[ i ]->txnp);
1588 1944 : uchar const * payload = bundle[ i ]->txnp->payload;
1589 :
1590 1944 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, payload );
1591 1944 : fd_acct_addr_t const * alt_adj = ord->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1592 :
1593 1944 : int est_result = fd_pack_estimate_rewards_and_compute( bundle[ i ], ord, pack->lim );
1594 1944 : if( FD_UNLIKELY( est_result==0 ) ) { err = FD_PACK_INSERT_REJECT_ESTIMATION_FAIL; break; }
1595 : /* Votes not allowed in bundles */
1596 1944 : if( FD_UNLIKELY( est_result==1 ) ) { err = FD_PACK_INSERT_REJECT_BUNDLE_BLACKLIST; break; }
1597 1941 : int nonce_result = fd_pack_validate_durable_nonce( ord->txn_e );
1598 1941 : if( FD_UNLIKELY( !nonce_result ) ) { err = FD_PACK_INSERT_REJECT_INVALID_NONCE; break; }
1599 1941 : int is_durable_nonce = nonce_result==2;
1600 1941 : nonce_txn_cnt += !!is_durable_nonce;
1601 :
1602 1941 : bundle[ i ]->txnp->flags |= FD_TXN_P_FLAGS_BUNDLE;
1603 1941 : bundle[ i ]->txnp->flags &= ~(FD_TXN_P_FLAGS_INITIALIZER_BUNDLE | FD_TXN_P_FLAGS_DURABLE_NONCE);
1604 1941 : bundle[ i ]->txnp->flags |= fd_uint_if( initializer_bundle, FD_TXN_P_FLAGS_INITIALIZER_BUNDLE, 0U );
1605 1941 : bundle[ i ]->txnp->flags |= fd_uint_if( is_durable_nonce, FD_TXN_P_FLAGS_DURABLE_NONCE, 0U );
1606 1941 : ord->skip = FD_PACK_SKIP_CNT;
1607 1941 : ord->expires_at = expires_at;
1608 :
1609 1941 : if( FD_UNLIKELY( is_durable_nonce ) ) {
1610 1032 : nonce_hash63[ i ] = noncemap_key_hash( ord->txn_e, pack->noncemap->seed ) & 0x7FFFFFFFFFFFFFFFUL;
1611 1032 : fd_pack_ord_txn_t * same_nonce = noncemap_ele_query( pack->noncemap, ord->txn_e, NULL, pack->pool );
1612 1032 : if( FD_LIKELY( same_nonce ) ) {
1613 : /* bundles take priority over non-bundles, and earlier bundles
1614 : take priority over later bundles. */
1615 6 : if( FD_UNLIKELY( same_nonce->txn->flags & FD_TXN_P_FLAGS_BUNDLE ) ) {
1616 3 : err = FD_PACK_INSERT_REJECT_NONCE_PRIORITY;
1617 3 : break;
1618 3 : } else {
1619 3 : ulong _delete_cnt = delete_transaction( pack, same_nonce, 0, 0 );
1620 3 : *delete_cnt += _delete_cnt;
1621 3 : replaces = 1;
1622 3 : }
1623 6 : }
1624 1032 : }
1625 :
1626 1938 : int validation_result = validate_transaction( pack, ord, txn, accts, alt_adj, !initializer_bundle );
1627 1938 : if( FD_UNLIKELY( validation_result ) ) { err = validation_result; break; }
1628 1938 : }
1629 :
1630 501 : if( FD_UNLIKELY( err ) ) {
1631 6 : fd_pack_insert_bundle_cancel( pack, bundle, txn_cnt );
1632 6 : return err;
1633 6 : }
1634 :
1635 495 : if( FD_UNLIKELY( initializer_bundle && pending_b_txn_cnt>0UL ) ) {
1636 0 : treap_rev_iter_t _cur=treap_rev_iter_init( pack->pending_bundles, pack->pool );
1637 0 : FD_TEST( !treap_rev_iter_done( _cur ) );
1638 0 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pack->pool );
1639 0 : int is_ib = !!(cur->txn->flags & FD_TXN_P_FLAGS_INITIALIZER_BUNDLE);
1640 :
1641 : /* Delete the previous IB if there is one */
1642 0 : if( FD_UNLIKELY( is_ib && 0UL==RC_TO_REL_BUNDLE_IDX( cur->rewards, cur->compute_est ) ) ) {
1643 0 : ulong _delete_cnt = delete_transaction( pack, cur, 1, 0 );
1644 0 : *delete_cnt += _delete_cnt;
1645 0 : }
1646 0 : }
1647 :
1648 504 : while( FD_UNLIKELY( pack->pending_txn_cnt+txn_cnt > pack->pack_depth ) ) {
1649 9 : ulong _delete_cnt = delete_worst( pack, FLT_MAX, 0 );
1650 9 : *delete_cnt += _delete_cnt;
1651 9 : if( FD_UNLIKELY( !_delete_cnt ) ) {
1652 0 : fd_pack_insert_bundle_cancel( pack, bundle, txn_cnt );
1653 0 : return FD_PACK_INSERT_REJECT_PRIORITY;
1654 0 : }
1655 9 : replaces = 1;
1656 9 : }
1657 :
1658 495 : if( FD_UNLIKELY( !pending_b_txn_cnt ) ) {
1659 495 : pack->relative_bundle_idx = 1UL;
1660 495 : }
1661 :
1662 495 : if( FD_LIKELY( bundle_meta ) ) {
1663 0 : memcpy( (uchar *)pack->bundle_meta + (ulong)((fd_pack_ord_txn_t *)bundle[0]-pack->pool)*pack->bundle_meta_sz, bundle_meta, pack->bundle_meta_sz );
1664 0 : }
1665 :
1666 495 : if( FD_UNLIKELY( nonce_txn_cnt>1UL ) ) {
1667 : /* Do a ILP-friendly duplicate detect, naive O(n^2) algo. With max
1668 : 5 txns per bundle, this requires 10 comparisons. ~ 25 cycle. */
1669 375 : uint conflict_detected = 0u;
1670 1875 : for( ulong i=0UL; i<FD_PACK_MAX_TXN_PER_BUNDLE-1; i++ ) {
1671 5250 : for( ulong j=i+1; j<FD_PACK_MAX_TXN_PER_BUNDLE; j++ ) {
1672 3750 : ulong const ele_i = nonce_hash63[ i ];
1673 3750 : ulong const ele_j = nonce_hash63[ j ];
1674 3750 : conflict_detected |= (ele_i==ele_j);
1675 3750 : }
1676 1500 : }
1677 375 : if( FD_UNLIKELY( conflict_detected ) ) {
1678 243 : fd_pack_insert_bundle_cancel( pack, bundle, txn_cnt );
1679 243 : return FD_PACK_INSERT_REJECT_NONCE_CONFLICT;
1680 243 : }
1681 375 : }
1682 :
1683 : /* We put bundles in a treap just like all the other transactions, but
1684 : we actually want to sort them in a very specific order; the order
1685 : within the bundle is determined at bundle creation time, and the
1686 : order among the bundles is FIFO. However, it's going to be a pain
1687 : to use a different sorting function for this treap, since it's
1688 : fixed as part of the treap creation for performance. Don't fear
1689 : though; we can pull a cool math trick out of the bag to shoehorn
1690 : the order we'd like into the sort function we need, and to get even
1691 : more.
1692 :
1693 : Recall that the sort function is r_i/c_i, smallest to largest,
1694 : where r_i is the rewards and c_i is the cost units. r_i and c_i
1695 : are both uints, and the comparison is done by cross-multiplication
1696 : as ulongs. We actually use the c_i value for testing if
1697 : transactions fit, etc. so let's assume that's fixed, and we know
1698 : it's in the range [1020, 1,551,570].
1699 :
1700 : This means, if c_0, c_1, ... c_4 are the CU costs of the
1701 : transactions in the first bundle, we require r_0/c_0 > r_1/c_1 >
1702 : ... > r_4/c_4. Then, if c_5, ... c_9 are the CU costs of the
1703 : transactions in the second bundle, we also require that r_4/c_4 >
1704 : r_5/c_5. For convenience, we'll impose a slightly stronger
1705 : constraint: we want the kth bundle to obey L*(N-k) <= r_i/c_i <
1706 : L*(N+1-k), for fixed constants L and N, real and integer,
1707 : respectively, that we'll determine. For example, this means r_4/c_4
1708 : >= L*N > r_5/c_5. This enables us to group the transactions in the
1709 : same bundle more easily.
1710 :
1711 : For convenience in the math below, we'll set j=N-k and relabel the
1712 : transactions from the jth bundle c_0, ... c_4.
1713 : From above, we know that Lj <= r_4/c_4. We'd like to make it as
1714 : close as possible given that r_4 is an integers. Thus, put
1715 : r_4 = ceil( c_4 * Lj ). r_4 is clearly an integer, and it satisfies
1716 : the required inequality because:
1717 : r_4/c_4 = ceil( c_4 * Lj)/c_4 >= c_4*Lj / c_4 >= Lj.
1718 :
1719 : Following in the same spirit, put r_3 = ceil( c_3 * (r_4+1)/c_4 ).
1720 : Again, r_3 is clearly an integer, and
1721 : r_3/c_3 = ceil(c_3*(r_4+1)/c_4)/c_3
1722 : >= (c_3*(r_4+1))/(c_3 * c_4)
1723 : >= r_4/c_4 + 1/c_4
1724 : > r_4/c_4.
1725 : Following the pattern, we put
1726 : r_2 = ceil( c_2 * (r_3+1)/c_3 )
1727 : r_1 = ceil( c_1 * (r_2+1)/c_2 )
1728 : r_0 = ceil( c_0 * (r_1+1)/c_1 )
1729 : which work for the same reason that as r_3.
1730 :
1731 : We now need for r_0 to satisfy the final inequality with L, and
1732 : we'll use this to guide our choice of L. Theoretically, r_0 can be
1733 : expressed in terms of L, j, and c_0, ... c_4, but that's a truly
1734 : inscrutible expression. Instead, we need some bounds so we can get
1735 : rid of all the ceil using the property that x <= ceil(x) < x+1.
1736 : c_4 * Lj <= r_4 < c_4 * Lj + 1
1737 : The lower bound on r_3 is easy:
1738 : r_3 >= c_3 * (c_4 * Lj + 1)/c_4 = c_3 * Lj + c_3/c_4
1739 : For the upper bound,
1740 : r_3 < 1 + c_3*(r_4+1)/c_4 < 1 + c_3*(c_4*Lj+1 + 1)/c_4
1741 : = 1 + c_3 * Lj + 2*c_3/c_4
1742 : Continuing similarly gives
1743 : c_2*Lj + c_2/c_3 + c_2/c_4 <= r_2
1744 : c_1*Lj + c_1/c_2 + c_1/c_c + c_1/c_4 <= r_1
1745 : c_0*Lj + c_0/c_1 + c_0/c_2 + c_0/c_3 + c_0/c_4 <= r_0
1746 : and
1747 : r_2 < 1 + c_2*Lj + 2c_2/c_3 + 2c_2/c_4
1748 : r_1 < 1 + c_1*Lj + 2c_1/c_2 + 2c_1/c_3 + 2c_1/c_4
1749 : r_0 < 1 + c_0*Lj + 2c_0/c_1 + 2c_0/c_2 + 2c_0/c_3 + 2c_0/c_4.
1750 :
1751 : Setting L(j+1)>=(1 + c_0*Lj+2c_0/c_1+2c_0/c_2+2c_0/c_3+2c_0/c_4)/c_0
1752 : is then sufficient to ensure the whole sequence of 5 fits between Lj
1753 : and L(j+1). Simplifying gives
1754 : L<= 1/c_0 + 2/c_1 + 2/c_2 + 2/c_3 + 2/c_4
1755 : but L must be a constant and not depend on individual values of c_i,
1756 : so, given that c_i >= 1020, we set L = 9/1020.
1757 :
1758 : Now all that remains is to determine N. It's a bit unfortunate
1759 : that we require N, since it limits our capacity, but it's necessary
1760 : in any system that tries to compute priorities to enforce a FIFO
1761 : order. If we've inserted more than N bundles without ever having
1762 : the bundle treap go empty, we'll briefly break the FIFO ordering as
1763 : we underflow.
1764 :
1765 : Thus, we'd like to make N as big as possible, avoiding overflow.
1766 : r_0, ..., r_4 are all uints, and taking the bounds from above,
1767 : given that for any i, i' c_i/c_{i'} <= 1551570/1020 < 1522, we have
1768 : r_i < 1 + 1551570 * Lj + 8*1522.
1769 : To avoid overflow, we assert the right-hand side is < 2^32, which
1770 : implies N <= 313721.
1771 :
1772 : We want to use a fixed point representation for L so that the
1773 : entire computation can be done with integer arithmetic. We can do
1774 : the arithmetic as ulongs, which means defining L' >= L * 2^s, and
1775 : we compute ceil( c_4*Lj ) as floor( (c_4 * L' * j + 2^s - 1)/2^s ),
1776 : so c_4 * L' * j + 2^s should fit in a ulong. With j<=N, this gives
1777 : s<=32, so we set s=32, which means L' = 37896771 >= 9/1020 * 2^32.
1778 : Note that 1 + 1551570 * L' * N + 8*1522 + 2^32 is approximately
1779 : 2^63.999992.
1780 :
1781 : Note that this is all checked by a proof of the code translated
1782 : into Z3. Unfortunately CBMC was too slow to prove this code
1783 : directly. */
1784 252 : FD_STATIC_ASSERT( FD_PACK_MIN_TXN_COST== 1020UL, adjust_constants );
1785 252 : FD_STATIC_ASSERT( FD_PACK_MAX_TXN_COST==1551570UL, adjust_constants );
1786 879 : #define BUNDLE_L_PRIME 37896771UL
1787 879 : #define BUNDLE_N 313721UL
1788 :
1789 252 : if( FD_UNLIKELY( pack->relative_bundle_idx>BUNDLE_N ) ) {
1790 0 : FD_LOG_WARNING(( "Too many bundles inserted without allowing pending bundles to go empty. "
1791 0 : "Ordering of bundles may be incorrect." ));
1792 0 : pack->relative_bundle_idx = 1UL;
1793 0 : }
1794 252 : ulong bundle_idx = fd_ulong_if( initializer_bundle, 0UL, pack->relative_bundle_idx );
1795 252 : insert_bundle_impl( pack, bundle_idx, txn_cnt, (fd_pack_ord_txn_t * *)bundle, expires_at );
1796 : /* if IB this is max( 1, x ), which is x. Otherwise, this is max(x,
1797 : x+1) which is x++ */
1798 252 : pack->relative_bundle_idx = fd_ulong_max( bundle_idx+1UL, pack->relative_bundle_idx );
1799 :
1800 252 : return (0) | (replaces<<1) | ((!!nonce_txn_cnt)<<2);
1801 495 : }
1802 : static inline void
1803 : insert_bundle_impl( fd_pack_t * pack,
1804 : ulong bundle_idx,
1805 : ulong txn_cnt,
1806 : fd_pack_ord_txn_t * * bundle,
1807 252 : ulong expires_at ) {
1808 252 : ulong prev_reward = ((BUNDLE_L_PRIME * (BUNDLE_N - bundle_idx))) - 1UL;
1809 252 : ulong prev_cost = 1UL<<32;
1810 :
1811 : /* Assign last to first */
1812 1158 : for( ulong i=0UL; i<txn_cnt; i++ ) {
1813 906 : fd_pack_ord_txn_t * ord = bundle[ txn_cnt-1UL - i ];
1814 906 : ord->rewards = (uint)(((ulong)ord->compute_est * (prev_reward + 1UL) + prev_cost-1UL)/prev_cost);
1815 906 : ord->root = FD_ORD_TXN_ROOT_PENDING_BUNDLE;
1816 906 : prev_reward = ord->rewards;
1817 906 : prev_cost = ord->compute_est;
1818 :
1819 : /* The penalty information isn't used for bundles. */
1820 906 : ushort penalties [ FD_TXN_ACCT_ADDR_MAX ];
1821 906 : uchar penalty_idx[ FD_TXN_ACCT_ADDR_MAX ];
1822 906 : populate_bitsets( pack, ord, penalties, penalty_idx );
1823 :
1824 906 : treap_ele_insert( pack->pending_bundles, ord, pack->pool );
1825 906 : pack->pending_txn_cnt++;
1826 :
1827 906 : if( FD_UNLIKELY( ord->txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE ) ) noncemap_ele_insert( pack->noncemap, ord, pack->pool );
1828 906 : sig2txn_ele_insert( pack->signature_map, ord, pack->pool );
1829 :
1830 906 : fd_pack_expq_t temp[ 1 ] = {{ .expires_at = expires_at, .txn = ord }};
1831 906 : expq_insert( pack->expiration_q, temp );
1832 906 : }
1833 :
1834 252 : }
1835 :
1836 : void const *
1837 0 : fd_pack_peek_bundle_meta( fd_pack_t const * pack ) {
1838 0 : int ib_state = pack->initializer_bundle_state;
1839 0 : if( FD_UNLIKELY( (ib_state==FD_PACK_IB_STATE_PENDING) | (ib_state==FD_PACK_IB_STATE_FAILED) ) ) return NULL;
1840 :
1841 0 : treap_rev_iter_t _cur=treap_rev_iter_init( pack->pending_bundles, pack->pool );
1842 0 : if( FD_UNLIKELY( treap_rev_iter_done( _cur ) ) ) return NULL; /* empty */
1843 :
1844 0 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pack->pool );
1845 0 : int is_ib = !!(cur->txn->flags & FD_TXN_P_FLAGS_INITIALIZER_BUNDLE);
1846 0 : if( FD_UNLIKELY( is_ib ) ) return NULL;
1847 :
1848 0 : return (void const *)((uchar const *)pack->bundle_meta + (ulong)_cur * pack->bundle_meta_sz);
1849 0 : }
1850 :
1851 : void
1852 123 : fd_pack_set_initializer_bundles_ready( fd_pack_t * pack ) {
1853 123 : pack->initializer_bundle_state = FD_PACK_IB_STATE_READY;
1854 123 : }
1855 :
1856 : void
1857 0 : fd_pack_metrics_write( fd_pack_t const * pack ) {
1858 0 : ulong pending_regular = treap_ele_cnt( pack->pending );
1859 0 : ulong pending_votes = treap_ele_cnt( pack->pending_votes );
1860 0 : ulong pending_bundle = treap_ele_cnt( pack->pending_bundles );
1861 0 : ulong conflicting = pack->pending_txn_cnt - pending_votes - pending_bundle - treap_ele_cnt( pack->pending );
1862 0 : FD_MGAUGE_SET( PACK, TXN_AVAILABLE_ALL, pack->pending_txn_cnt );
1863 0 : FD_MGAUGE_SET( PACK, TXN_AVAILABLE_REGULAR, pending_regular );
1864 0 : FD_MGAUGE_SET( PACK, TXN_AVAILABLE_VOTES, pending_votes );
1865 0 : FD_MGAUGE_SET( PACK, TXN_AVAILABLE_CONFLICTING, conflicting );
1866 0 : FD_MGAUGE_SET( PACK, TXN_AVAILABLE_BUNDLES, pending_bundle );
1867 0 : FD_MGAUGE_SET( PACK, TXN_PENDING_SMALLEST_CU, pack->pending_smallest->cus );
1868 0 : FD_MGAUGE_SET( PACK, BLOCK_CU_CONSUMED, pack->cumulative_block_cost );
1869 :
1870 0 : FD_MCNT_ENUM_COPY( PACK, TXN_SCHEDULED, pack->sched_results );
1871 0 : }
1872 :
1873 : void
1874 0 : fd_pack_get_sched_metrics( fd_pack_t const * pack, ulong * metrics ) {
1875 0 : fd_memcpy( metrics, pack->sched_results, sizeof(pack->sched_results) );
1876 0 : }
1877 :
1878 : typedef struct {
1879 : ushort clear_rw_bit;
1880 : ushort clear_w_bit;
1881 : } release_result_t;
1882 :
1883 : static inline release_result_t
1884 : release_bit_reference( fd_pack_t * pack,
1885 164397 : fd_acct_addr_t const * acct ) {
1886 :
1887 164397 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( pack->acct_to_bitset, *acct, NULL );
1888 164397 : FD_TEST( q ); /* q==NULL not be possible */
1889 :
1890 164397 : q->ref_cnt--;
1891 :
1892 164397 : if( FD_UNLIKELY( q->ref_cnt==0UL ) ) {
1893 82474 : ushort bit = q->bit;
1894 82474 : bitset_map_remove( pack->acct_to_bitset, q );
1895 82474 : if( FD_LIKELY( bit<FD_PACK_BITSET_MAX ) ) pack->bitset_avail[ ++(pack->bitset_avail_cnt) ] = bit;
1896 :
1897 82474 : fd_pack_addr_use_t * use = acct_uses_query( pack->acct_in_use, *acct, NULL );
1898 82474 : if( FD_LIKELY( use ) ) {
1899 78007 : use->in_use_by |= FD_PACK_IN_USE_BIT_CLEARED;
1900 78007 : release_result_t ret = { .clear_rw_bit = bit,
1901 78007 : .clear_w_bit = fd_ushort_if( !!(use->in_use_by & FD_PACK_IN_USE_WRITABLE), bit, FD_PACK_BITSET_MAX ) };
1902 78007 : return ret;
1903 78007 : }
1904 82474 : }
1905 86390 : release_result_t ret = { .clear_rw_bit = FD_PACK_BITSET_MAX, .clear_w_bit = FD_PACK_BITSET_MAX };
1906 86390 : return ret;
1907 164397 : }
1908 :
1909 : typedef struct {
1910 : ulong cus_scheduled;
1911 : ulong txns_scheduled;
1912 : ulong bytes_scheduled;
1913 : ulong alloc_scheduled;
1914 : } sched_return_t;
1915 :
1916 : static inline sched_return_t
1917 : fd_pack_schedule_impl( fd_pack_t * pack,
1918 : treap_t * sched_from,
1919 : ulong cu_limit,
1920 : ulong txn_limit,
1921 : ulong byte_limit,
1922 : ulong alloc_limit,
1923 : ulong bank_tile,
1924 : fd_pack_smallest_t * smallest_in_treap,
1925 : ulong * use_by_bank_txn,
1926 29769 : fd_txn_e_t * out ) {
1927 29769 : if( FD_UNLIKELY( (cu_limit<smallest_in_treap->cus) | (txn_limit==0UL) | (byte_limit<smallest_in_treap->bytes) ) ) {
1928 14960 : sched_return_t to_return = { .cus_scheduled = 0UL, .txns_scheduled = 0UL, .bytes_scheduled = 0UL };
1929 14960 : return to_return;
1930 14960 : }
1931 :
1932 14809 : fd_pack_ord_txn_t * pool = pack->pool;
1933 14809 : fd_pack_addr_use_t * acct_in_use = pack->acct_in_use;
1934 14809 : wcost_map_t * writer_costs = pack->writer_costs;
1935 14809 : fd_pack_wcost_ele_t * writers = pack->writers;
1936 14809 : wcost_dlist_t * written_list = pack->written_list;
1937 :
1938 14809 : FD_PACK_BITSET_DECLARE( bitset_rw_in_use );
1939 14809 : FD_PACK_BITSET_DECLARE( bitset_w_in_use );
1940 14809 : FD_PACK_BITSET_COPY( bitset_rw_in_use, pack->bitset_rw_in_use );
1941 14809 : FD_PACK_BITSET_COPY( bitset_w_in_use, pack->bitset_w_in_use );
1942 :
1943 14809 : fd_pack_addr_use_t * use_by_bank = pack->use_by_bank [bank_tile];
1944 14809 : ulong use_by_bank_cnt = pack->use_by_bank_cnt[bank_tile];
1945 :
1946 14809 : ulong max_write_cost_per_acct = pack->lim->max_write_cost_per_acct;
1947 :
1948 14809 : ushort compressed_slot_number = pack->compressed_slot_number;
1949 :
1950 14809 : ulong txns_scheduled = 0UL;
1951 14809 : ulong cus_scheduled = 0UL;
1952 14809 : ulong bytes_scheduled = 0UL;
1953 14809 : ulong alloc_scheduled = 0UL;
1954 :
1955 14809 : ulong bank_tile_mask = 1UL << bank_tile;
1956 :
1957 14809 : ulong fast_path = 0UL;
1958 14809 : ulong slow_path = 0UL;
1959 14809 : ulong cu_limit_c = 0UL;
1960 14809 : ulong byte_limit_c = 0UL;
1961 14809 : ulong alloc_limit_c = 0UL;
1962 14809 : ulong write_limit_c = 0UL;
1963 14809 : ulong skip_c = 0UL;
1964 :
1965 14809 : ulong min_cus = ULONG_MAX;
1966 14809 : ulong min_bytes = ULONG_MAX;
1967 :
1968 14809 : treap_rev_iter_t prev = treap_idx_null();
1969 246396 : for( treap_rev_iter_t _cur=treap_rev_iter_init( sched_from, pool ); !treap_rev_iter_done( _cur ); _cur=prev ) {
1970 : /* Capture next so that we can delete while we iterate. */
1971 234451 : prev = treap_rev_iter_next( _cur, pool );
1972 :
1973 234451 : # if FD_HAS_X86
1974 234451 : _mm_prefetch( &(pool[ prev ].prev), _MM_HINT_T0 );
1975 234451 : # endif
1976 :
1977 234451 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pool );
1978 :
1979 234451 : min_cus = fd_ulong_min( min_cus, cur->compute_est );
1980 234451 : min_bytes = fd_ulong_min( min_bytes, cur->txn->payload_sz );
1981 :
1982 234451 : ulong conflicts = 0UL;
1983 :
1984 234451 : if( FD_UNLIKELY( cur->compute_est>cu_limit ) ) {
1985 : /* Too big to be scheduled at the moment, but might be okay for
1986 : the next microblock, so we don't want to delay it. */
1987 0 : cu_limit_c++;
1988 0 : continue;
1989 0 : }
1990 :
1991 234451 : if( FD_UNLIKELY( cur->txn->pack_alloc>alloc_limit ) ) {
1992 : /* We don't want to consider this until the next block, but
1993 : checking alloc is as cheap as checking cur->skip, so there's
1994 : not a big difference. */
1995 18 : alloc_limit_c++;
1996 18 : continue;
1997 18 : }
1998 :
1999 : /* Likely? Unlikely? */
2000 234433 : if( FD_LIKELY( !FD_PACK_BITSET_INTERSECT4_EMPTY( bitset_rw_in_use, bitset_w_in_use, cur->w_bitset, cur->rw_bitset ) ) ) {
2001 204013 : fast_path++;
2002 204013 : continue;
2003 204013 : }
2004 :
2005 30420 : if( FD_UNLIKELY( cur->skip==compressed_slot_number ) ) {
2006 0 : skip_c++;
2007 0 : continue;
2008 0 : }
2009 :
2010 : /* If skip>FD_PACK_MAX_SKIP but not compressed_slot_number, it means
2011 : it's the compressed slot number of a previous slot. We don't
2012 : care unless we're going to update the value though, so we don't
2013 : need to eagerly reset it to FD_PACK_MAX_SKIP.
2014 : compressed_slot_number is a ushort, so it's possible for it to
2015 : roll over, but the transaction lifetime is much shorter than
2016 : that, so it won't be a problem. */
2017 :
2018 30420 : if( FD_UNLIKELY( cur->txn->payload_sz>byte_limit ) ) {
2019 6 : byte_limit_c++;
2020 6 : continue;
2021 6 : }
2022 :
2023 :
2024 30414 : fd_txn_t const * txn = TXN(cur->txn);
2025 30414 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, cur->txn->payload );
2026 30414 : fd_acct_addr_t const * alt_adj = cur->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
2027 : /* Check conflicts between this transaction's writable accounts and
2028 : current readers */
2029 30414 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
2030 97653 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2031 :
2032 67242 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
2033 :
2034 67242 : fd_pack_wcost_ele_t const * in_wcost_table = wcost_map_ele_query_const( writer_costs, &acct, NULL, writers );
2035 67242 : if( FD_UNLIKELY( in_wcost_table && in_wcost_table->total_cost+cur->compute_est > max_write_cost_per_acct ) ) {
2036 : /* Can't be scheduled until the next block */
2037 3 : conflicts = ULONG_MAX;
2038 3 : break;
2039 3 : }
2040 :
2041 67239 : fd_pack_addr_use_t * use = acct_uses_query( acct_in_use, acct, NULL );
2042 67239 : if( FD_UNLIKELY( use ) ) conflicts |= use->in_use_by; /* break? */
2043 67239 : }
2044 :
2045 30414 : if( FD_UNLIKELY( conflicts==ULONG_MAX ) ) {
2046 : /* The logic for how to adjust skip is a bit complicated, and we
2047 : want to do it branchlessly. Let psc=FD_PACK_SKIP_CNT,
2048 : Before After
2049 : 1 compressed_slot_number
2050 : x in [2, psc] x-1
2051 : x where x>psc psc-1
2052 :
2053 : Set A=min(x, 5), B=min(A-2, compressed_slot_number-1), and
2054 : note that compressed_slot_number is in [psc+1, USHORT_MAX].
2055 : Then:
2056 : x A A-2 B B+1
2057 : 1 1 USHORT_MAX csn-1 csn
2058 : x in [2, psc] x x-2 x-2 x-1
2059 : x where x>psc psc psc-2 psc-2 psc-1
2060 : So B+1 is the desired value. */
2061 3 : cur->skip = (ushort)(1+fd_ushort_min( (ushort)(compressed_slot_number-1),
2062 3 : (ushort)(fd_ushort_min( cur->skip, FD_PACK_SKIP_CNT )-2) ) );
2063 3 : write_limit_c++;
2064 3 : continue;
2065 3 : }
2066 :
2067 30411 : if( FD_UNLIKELY( conflicts ) ) {
2068 6 : slow_path++;
2069 6 : continue;
2070 6 : }
2071 :
2072 : /* Check conflicts between this transaction's readonly accounts and
2073 : current writers */
2074 30405 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_READONLY );
2075 136659 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2076 :
2077 106254 : fd_acct_addr_t const * acct = ACCT_ITER_TO_PTR( iter );
2078 106254 : if( fd_pack_unwritable_contains( acct ) ) continue; /* No need to track sysvars because they can't be writable */
2079 :
2080 65385 : fd_pack_addr_use_t * use = acct_uses_query( acct_in_use, *acct, NULL );
2081 65385 : if( use ) conflicts |= (use->in_use_by & FD_PACK_IN_USE_WRITABLE) ? use->in_use_by : 0UL;
2082 65385 : }
2083 :
2084 30405 : if( FD_UNLIKELY( conflicts ) ) {
2085 0 : slow_path++;
2086 0 : continue;
2087 0 : }
2088 :
2089 : /* Include this transaction in the microblock! */
2090 30405 : FD_PACK_BITSET_OR( bitset_rw_in_use, cur->rw_bitset );
2091 30405 : FD_PACK_BITSET_OR( bitset_w_in_use, cur->w_bitset );
2092 :
2093 30405 : fd_txn_p_t * out_txnp = out->txnp;
2094 30405 : if( FD_LIKELY( cur->txn->payload_sz>=1024UL ) ) pack_memcpy_out( out_txnp->payload, cur->txn->payload, cur->txn->payload_sz );
2095 17613 : else fd_memcpy ( out_txnp->payload, cur->txn->payload, cur->txn->payload_sz );
2096 :
2097 30405 : out_txnp->payload_sz = cur->txn->payload_sz;
2098 30405 : out_txnp->pack_cu.requested_exec_plus_acct_data_cus = cur->txn->pack_cu.requested_exec_plus_acct_data_cus;
2099 30405 : out_txnp->pack_cu.non_execution_cus = cur->txn->pack_cu.non_execution_cus;
2100 30405 : out_txnp->pack_alloc = cur->txn->pack_alloc;
2101 30405 : out_txnp->scheduler_arrival_time_nanos = cur->txn->scheduler_arrival_time_nanos;
2102 30405 : out_txnp->first_seen_nanos = cur->txn->first_seen_nanos;
2103 30405 : out_txnp->source_tpu = cur->txn->source_tpu;
2104 30405 : out_txnp->source_ipv4 = cur->txn->source_ipv4;
2105 30405 : out_txnp->flags = cur->txn->flags;
2106 30405 : fd_memcpy( TXN(out_txnp), txn, fd_txn_footprint( txn->instr_cnt, txn->addr_table_lookup_cnt ) );
2107 :
2108 : /* Copy the ALT accounts from the source fd_txn_e_t */
2109 30405 : ulong alt_acct_cnt = (ulong)txn->addr_table_adtl_cnt;
2110 30405 : if( FD_UNLIKELY( alt_acct_cnt ) ) pack_memcpy_out( out->alt_accts, cur->txn_e->alt_accts, alt_acct_cnt*sizeof(fd_acct_addr_t) );
2111 30405 : out++;
2112 :
2113 30405 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
2114 97629 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2115 67224 : fd_acct_addr_t acct_addr = *ACCT_ITER_TO_PTR( iter );
2116 :
2117 67224 : fd_pack_wcost_ele_t * in_wcost_table = wcost_map_ele_query( writer_costs, &acct_addr, NULL, writers );
2118 67224 : if( !in_wcost_table ) {
2119 19498 : in_wcost_table = wcost_pool_ele_acquire( writers );
2120 19498 : in_wcost_table->key = acct_addr;
2121 19498 : in_wcost_table->total_cost = 0UL;
2122 19498 : wcost_map_ele_insert ( writer_costs, in_wcost_table, writers );
2123 19498 : wcost_dlist_ele_push_tail( written_list, in_wcost_table, writers );
2124 19498 : }
2125 67224 : in_wcost_table->total_cost += cur->compute_est;
2126 :
2127 67224 : fd_pack_addr_use_t * use = acct_uses_insert( acct_in_use, acct_addr );
2128 67224 : use->in_use_by = bank_tile_mask | FD_PACK_IN_USE_WRITABLE;
2129 :
2130 67224 : use_by_bank[use_by_bank_cnt++] = *use;
2131 :
2132 : /* If there aren't any more references to this account in the
2133 : heap, it can't cause any conflicts. That means we actually
2134 : don't need to record that we are using it, which is good
2135 : because we want to release the bit. */
2136 67224 : release_result_t ret = release_bit_reference( pack, &acct_addr );
2137 67224 : FD_PACK_BITSET_CLEARN( bitset_rw_in_use, ret.clear_rw_bit );
2138 67224 : FD_PACK_BITSET_CLEARN( bitset_w_in_use, ret.clear_w_bit );
2139 67224 : }
2140 30405 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_READONLY );
2141 136659 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2142 :
2143 106254 : fd_acct_addr_t acct_addr = *ACCT_ITER_TO_PTR( iter );
2144 :
2145 106254 : if( fd_pack_unwritable_contains( &acct_addr ) ) continue; /* No need to track sysvars because they can't be writable */
2146 :
2147 65385 : fd_pack_addr_use_t * use = acct_uses_query( acct_in_use, acct_addr, NULL );
2148 65385 : if( !use ) { use = acct_uses_insert( acct_in_use, acct_addr ); use->in_use_by = 0UL; }
2149 :
2150 65385 : if( !(use->in_use_by & bank_tile_mask) ) use_by_bank[use_by_bank_cnt++] = *use;
2151 65385 : use->in_use_by |= bank_tile_mask;
2152 65385 : use->in_use_by &= ~FD_PACK_IN_USE_BIT_CLEARED;
2153 :
2154 :
2155 65385 : release_result_t ret = release_bit_reference( pack, &acct_addr );
2156 65385 : FD_PACK_BITSET_CLEARN( bitset_rw_in_use, ret.clear_rw_bit );
2157 65385 : FD_PACK_BITSET_CLEARN( bitset_w_in_use, ret.clear_w_bit );
2158 65385 : }
2159 :
2160 30405 : txns_scheduled += 1UL; txn_limit -= 1UL;
2161 30405 : cus_scheduled += cur->compute_est; cu_limit -= cur->compute_est;
2162 30405 : bytes_scheduled += cur->txn->payload_sz; byte_limit -= cur->txn->payload_sz;
2163 30405 : alloc_scheduled += cur->txn->pack_alloc; alloc_limit -= cur->txn->pack_alloc;
2164 :
2165 30405 : *(use_by_bank_txn++) = use_by_bank_cnt;
2166 :
2167 30405 : if( FD_UNLIKELY( cur->txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE ) ) noncemap_ele_remove_fast( pack->noncemap, cur, pack->pool );
2168 30405 : sig2txn_ele_remove_fast( pack->signature_map, cur, pool );
2169 :
2170 30405 : cur->root = FD_ORD_TXN_ROOT_FREE;
2171 30405 : expq_remove( pack->expiration_q, cur->expq_idx );
2172 30405 : treap_idx_remove( sched_from, _cur, pool );
2173 30405 : trp_pool_idx_release( pool, _cur );
2174 30405 : pack->pending_txn_cnt--;
2175 :
2176 30405 : if( FD_UNLIKELY( (cu_limit<smallest_in_treap->cus) | (txn_limit==0UL) | (byte_limit<smallest_in_treap->bytes) ) ) break;
2177 30405 : }
2178 :
2179 14809 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_TAKEN_IDX ] += txns_scheduled;
2180 14809 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_CU_LIMIT_IDX ] += cu_limit_c;
2181 14809 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_FAST_PATH_IDX ] += fast_path;
2182 14809 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_BYTE_LIMIT_IDX ] += byte_limit_c;
2183 14809 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_ALLOC_LIMIT_IDX ] += alloc_limit_c;
2184 14809 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_WRITE_COST_IDX ] += write_limit_c;
2185 14809 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_SLOW_PATH_IDX ] += slow_path;
2186 14809 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_DEFER_SKIP_IDX ] += skip_c;
2187 :
2188 : /* If we scanned the whole treap and didn't break early, we now have a
2189 : better estimate of the smallest. */
2190 14809 : if( FD_UNLIKELY( treap_rev_iter_done( prev ) ) ) {
2191 14486 : smallest_in_treap->cus = min_cus;
2192 14486 : smallest_in_treap->bytes = min_bytes;
2193 14486 : }
2194 :
2195 14809 : pack->use_by_bank_cnt[bank_tile] = use_by_bank_cnt;
2196 14809 : FD_PACK_BITSET_COPY( pack->bitset_rw_in_use, bitset_rw_in_use );
2197 14809 : FD_PACK_BITSET_COPY( pack->bitset_w_in_use, bitset_w_in_use );
2198 :
2199 14809 : sched_return_t to_return = { .cus_scheduled=cus_scheduled, .txns_scheduled=txns_scheduled,
2200 14809 : .bytes_scheduled=bytes_scheduled, .alloc_scheduled=alloc_scheduled };
2201 14809 : return to_return;
2202 29769 : }
2203 :
2204 : int
2205 : fd_pack_microblock_complete( fd_pack_t * pack,
2206 14997 : ulong bank_tile ) {
2207 : /* If the account is in use writably, and it's in use by this banking
2208 : tile, then this banking tile must be the sole writer to it, so it's
2209 : always okay to clear the writable bit. */
2210 14997 : ulong clear_mask = ~((1UL<<bank_tile) | FD_PACK_IN_USE_WRITABLE);
2211 :
2212 : /* If nothing outstanding, bail quickly */
2213 14997 : if( FD_UNLIKELY( !(pack->outstanding_microblock_mask & (1UL<<bank_tile)) ) ) return 0;
2214 :
2215 8716 : FD_PACK_BITSET_DECLARE( bitset_rw_in_use );
2216 8716 : FD_PACK_BITSET_DECLARE( bitset_w_in_use );
2217 8716 : FD_PACK_BITSET_COPY( bitset_rw_in_use, pack->bitset_rw_in_use );
2218 8716 : FD_PACK_BITSET_COPY( bitset_w_in_use, pack->bitset_w_in_use );
2219 :
2220 8716 : fd_pack_addr_use_t * base = pack->use_by_bank[bank_tile];
2221 :
2222 8716 : fd_pack_ord_txn_t * best = NULL;
2223 8716 : fd_pack_penalty_treap_t * best_penalty = NULL;
2224 8716 : ulong txn_cnt = 0UL;
2225 :
2226 116441 : for( ulong i=0UL; i<pack->use_by_bank_cnt[bank_tile]; i++ ) {
2227 107725 : fd_pack_addr_use_t * use = acct_uses_query( pack->acct_in_use, base[i].key, NULL );
2228 107725 : FD_TEST( use );
2229 107725 : use->in_use_by &= clear_mask;
2230 :
2231 : /* In order to properly bound the size of bitset_map, we need to
2232 : release the "reference" to the account when we schedule it.
2233 : However, that poses a bit of a problem here, because by the time
2234 : we complete the microblock, that account could have been assigned
2235 : a different bit in the bitset. The scheduling step tells us if
2236 : that is the case, and if so, we know that the bits in
2237 : bitset_w_in_use and bitset_rw_in_use were already cleared as
2238 : necessary.
2239 :
2240 : Note that it's possible for BIT_CLEARED to be set and then unset
2241 : by later uses, but then the account would be in use on other
2242 : banks, so we wouldn't try to observe the old value. For example:
2243 : Suppose bit 0->account A, bit 1->account B, and we have two
2244 : transactions that read A, B. We schedule a microblock to bank 0,
2245 : taking both transactions, which sets the counts for A, B to 0,
2246 : and releases the bits, clearing bits 0 and 1, and setting
2247 : BIT_CLEARED. Then we get two more transactions that read
2248 : accounts C, D, A, B, and they get assigned 0->C, 1->D, 2->A,
2249 : 3->B. We try to schedule a microblock to bank 1 that takes one
2250 : of those transactions. This unsets BIT_CLEARED for A, B.
2251 : Finally, the first microblock completes. Even though the bitset
2252 : map has the new bits for A and B which are "wrong" compared to
2253 : when the transaction was initially scheduled, those bits have
2254 : already been cleared and reset properly in the bitset as needed.
2255 : A and B will still be in use by bank 1, so we won't clear any
2256 : bits. If, on the other hand, the microblock scheduled to bank 1
2257 : completes first, bits 0 and 1 will be cleared for accounts C and
2258 : D, while bits 2 and 3 will remain set, which is correct. Then
2259 : when bank 0 completes, bits 2 and 3 will be cleared. */
2260 107725 : if( FD_LIKELY( !use->in_use_by ) ) { /* if in_use_by==0, doesn't include BIT_CLEARED */
2261 40146 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( pack->acct_to_bitset, base[i].key, NULL );
2262 40146 : FD_TEST( q );
2263 40146 : FD_PACK_BITSET_CLEARN( bitset_w_in_use, q->bit );
2264 40146 : FD_PACK_BITSET_CLEARN( bitset_rw_in_use, q->bit );
2265 :
2266 : /* Because this account is no longer in use, it might be possible
2267 : to schedule a transaction that writes to it. Check its
2268 : penalty treap if it has one, and potentially move it to the
2269 : main treap. */
2270 40146 : fd_pack_penalty_treap_t * p_trp = penalty_map_query( pack->penalty_treaps, base[i].key, NULL );
2271 40146 : if( FD_UNLIKELY( p_trp ) ) {
2272 5507 : fd_pack_ord_txn_t * best_in_trp = treap_rev_iter_ele( treap_rev_iter_init( p_trp->penalty_treap, pack->pool ), pack->pool );
2273 5507 : if( FD_UNLIKELY( !best || COMPARE_WORSE( best, best_in_trp ) ) ) {
2274 2806 : best = best_in_trp;
2275 2806 : best_penalty = p_trp;
2276 2806 : }
2277 5507 : }
2278 40146 : }
2279 :
2280 107725 : if( FD_LIKELY( !(use->in_use_by & ~FD_PACK_IN_USE_BIT_CLEARED) ) ) acct_uses_remove( pack->acct_in_use, use );
2281 :
2282 107725 : if( FD_UNLIKELY( i+1UL==pack->use_by_bank_txn[ bank_tile ][ txn_cnt ] ) ) {
2283 26502 : txn_cnt++;
2284 26502 : if( FD_LIKELY( best ) ) {
2285 : /* move best to the main treap */
2286 2806 : treap_ele_remove( best_penalty->penalty_treap, best, pack->pool );
2287 2806 : best->root = FD_ORD_TXN_ROOT_PENDING;
2288 2806 : treap_ele_insert( pack->pending, best, pack->pool );
2289 :
2290 2806 : pack->pending_smallest->cus = fd_ulong_min( pack->pending_smallest->cus, best->compute_est );
2291 2806 : pack->pending_smallest->bytes = fd_ulong_min( pack->pending_smallest->bytes, best->txn_e->txnp->payload_sz );
2292 :
2293 2806 : if( FD_UNLIKELY( !treap_ele_cnt( best_penalty->penalty_treap ) ) ) {
2294 12 : treap_delete( treap_leave( best_penalty->penalty_treap ) );
2295 : /* Removal invalidates any pointers we got from
2296 : penalty_map_query, but we immediately set these to NULL, so
2297 : we're not keeping any pointers around. */
2298 12 : penalty_map_remove( pack->penalty_treaps, best_penalty );
2299 12 : }
2300 2806 : best = NULL;
2301 2806 : best_penalty = NULL;
2302 2806 : }
2303 26502 : }
2304 107725 : }
2305 :
2306 8716 : pack->use_by_bank_cnt[bank_tile] = 0UL;
2307 :
2308 8716 : FD_PACK_BITSET_COPY( pack->bitset_rw_in_use, bitset_rw_in_use );
2309 8716 : FD_PACK_BITSET_COPY( pack->bitset_w_in_use, bitset_w_in_use );
2310 :
2311 : /* outstanding_microblock_mask never has the writable bit set, so we
2312 : don't care about clearing it here either. */
2313 8716 : pack->outstanding_microblock_mask &= clear_mask;
2314 8716 : return 1;
2315 8716 : }
2316 :
2317 14718 : #define TRY_BUNDLE_NO_READY_BUNDLES 0
2318 126 : #define TRY_BUNDLE_HAS_CONFLICTS (-1)
2319 126 : #define TRY_BUNDLE_DOES_NOT_FIT (-2)
2320 126 : #define TRY_BUNDLE_SUCCESS(n) ( n) /* schedule bundle with n transactions */
2321 : static inline int
2322 : fd_pack_try_schedule_bundle( fd_pack_t * pack,
2323 : ulong bank_tile,
2324 14844 : fd_txn_e_t * out ) {
2325 14844 : int state = pack->initializer_bundle_state;
2326 14844 : if( FD_UNLIKELY( (state==FD_PACK_IB_STATE_PENDING) | (state==FD_PACK_IB_STATE_FAILED ) ) ) return TRY_BUNDLE_NO_READY_BUNDLES;
2327 :
2328 14844 : fd_pack_ord_txn_t * pool = pack->pool;
2329 14844 : treap_t * bundles = pack->pending_bundles;
2330 :
2331 14844 : int require_ib;
2332 14844 : if( FD_UNLIKELY( state==FD_PACK_IB_STATE_NOT_INITIALIZED ) ) { require_ib = 1; }
2333 14844 : if( FD_LIKELY ( state==FD_PACK_IB_STATE_READY ) ) { require_ib = 0; }
2334 :
2335 14844 : treap_rev_iter_t _cur = treap_rev_iter_init( bundles, pool );
2336 14844 : ulong bundle_idx = ULONG_MAX;
2337 :
2338 : /* Skip any that we've marked as won't fit in this block */
2339 14844 : while( FD_UNLIKELY( !treap_rev_iter_done( _cur ) && treap_rev_iter_ele( _cur, pool )->skip==pack->compressed_slot_number ) ) {
2340 0 : _cur = treap_rev_iter_next( _cur, pool );
2341 0 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_DEFER_SKIP_IDX ]++;
2342 0 : }
2343 :
2344 14844 : if( FD_UNLIKELY( treap_rev_iter_done( _cur ) ) ) return TRY_BUNDLE_NO_READY_BUNDLES;
2345 :
2346 126 : treap_rev_iter_t _txn0 = _cur;
2347 126 : fd_pack_ord_txn_t * txn0 = treap_rev_iter_ele( _txn0, pool );
2348 126 : int is_ib = !!(txn0->txn->flags & FD_TXN_P_FLAGS_INITIALIZER_BUNDLE);
2349 126 : bundle_idx = RC_TO_REL_BUNDLE_IDX( txn0->rewards, txn0->compute_est );
2350 :
2351 126 : if( FD_UNLIKELY( require_ib & !is_ib ) ) return TRY_BUNDLE_NO_READY_BUNDLES;
2352 :
2353 : /* At this point, we have our candidate bundle, so we'll schedule it
2354 : if we can. If we can't, we won't schedule anything. */
2355 :
2356 :
2357 126 : fd_pack_addr_use_t * bundle_temp_inserted[ FD_PACK_MAX_TXN_PER_BUNDLE * FD_TXN_ACCT_ADDR_MAX ];
2358 126 : ulong bundle_temp_inserted_cnt = 0UL;
2359 :
2360 126 : ulong bank_tile_mask = 1UL << bank_tile;
2361 :
2362 126 : int doesnt_fit = 0;
2363 126 : int has_conflict = 0;
2364 126 : ulong txn_cnt = 0UL;
2365 :
2366 126 : ulong cu_limit = pack->lim->max_cost_per_block - pack->cumulative_block_cost;
2367 126 : ulong byte_limit = pack->lim->max_data_bytes_per_block - pack->data_bytes_consumed;
2368 126 : ulong microblock_limit = pack->lim->max_microblocks_per_block - pack->microblock_cnt;
2369 126 : ulong alloc_limit = pack->lim->max_allocated_data_per_block - pack->alloc_consumed;
2370 :
2371 126 : FD_PACK_BITSET_DECLARE( bitset_rw_in_use );
2372 126 : FD_PACK_BITSET_DECLARE( bitset_w_in_use );
2373 126 : FD_PACK_BITSET_COPY( bitset_rw_in_use, pack->bitset_rw_in_use );
2374 126 : FD_PACK_BITSET_COPY( bitset_w_in_use, pack->bitset_w_in_use );
2375 :
2376 : /* last_use_in_txn_cnt[i+1] Keeps track of the number of accounts that
2377 : have their last reference in transaction i of the bundle. This
2378 : esoteric value is important for computing use_by_bank_txn.
2379 : last_use_in_txn_cnt[0] is garbage. */
2380 126 : ulong last_use_in_txn_cnt[ 1UL+FD_PACK_MAX_TXN_PER_BUNDLE ] = { 0UL };
2381 :
2382 126 : fd_pack_addr_use_t null_use[1] = {{{{ 0 }}, { 0 }}};
2383 126 : fd_pack_wcost_ele_t null_wcost[1] = { 0 };
2384 :
2385 504 : while( !(doesnt_fit | has_conflict) & !treap_rev_iter_done( _cur ) ) {
2386 378 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pool );
2387 378 : ulong this_bundle_idx = RC_TO_REL_BUNDLE_IDX( cur->rewards, cur->compute_est );
2388 378 : if( FD_UNLIKELY( this_bundle_idx!=bundle_idx ) ) break;
2389 :
2390 378 : if( FD_UNLIKELY( cur->compute_est>cu_limit ) ) {
2391 0 : doesnt_fit = 1;
2392 0 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_CU_LIMIT_IDX ]++;
2393 0 : break;
2394 0 : }
2395 378 : cu_limit -= cur->compute_est;
2396 :
2397 : /* Each transaction in a bundle turns into a microblock */
2398 378 : if( FD_UNLIKELY( microblock_limit==0UL ) ) {
2399 0 : doesnt_fit = 1;
2400 0 : FD_MCNT_INC( PACK, MICROBLOCK_PER_BLOCK_LIMIT_REACHED, 1UL );
2401 0 : break;
2402 0 : }
2403 378 : microblock_limit--;
2404 :
2405 378 : if( FD_UNLIKELY( cur->txn->payload_sz+MICROBLOCK_DATA_OVERHEAD>byte_limit ) ) {
2406 0 : doesnt_fit = 1;
2407 0 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_BYTE_LIMIT_IDX ]++;
2408 0 : break;
2409 0 : }
2410 378 : byte_limit -= cur->txn->payload_sz + MICROBLOCK_DATA_OVERHEAD;
2411 :
2412 378 : if( FD_UNLIKELY( cur->txn->pack_alloc>alloc_limit ) ) {
2413 0 : doesnt_fit = 1;
2414 0 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_ALLOC_LIMIT_IDX ]++;
2415 0 : break;
2416 0 : }
2417 378 : alloc_limit -= cur->txn->pack_alloc;
2418 :
2419 378 : if( FD_UNLIKELY( !FD_PACK_BITSET_INTERSECT4_EMPTY( pack->bitset_rw_in_use, pack->bitset_w_in_use, cur->w_bitset, cur->rw_bitset ) ) ) {
2420 0 : has_conflict = 1;
2421 0 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_FAST_PATH_IDX ]++;
2422 0 : break;
2423 0 : }
2424 :
2425 : /* Don't update the actual in-use bitset, because the transactions
2426 : in the bundle are allowed to conflict with each other. */
2427 378 : FD_PACK_BITSET_OR( bitset_rw_in_use, cur->rw_bitset );
2428 378 : FD_PACK_BITSET_OR( bitset_w_in_use, cur->w_bitset );
2429 :
2430 :
2431 378 : fd_txn_t const * txn = TXN(cur->txn);
2432 378 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, cur->txn->payload );
2433 378 : fd_acct_addr_t const * alt_adj = cur->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
2434 :
2435 : /* Check conflicts between this transaction's writable accounts and
2436 : current readers */
2437 378 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
2438 1188 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2439 :
2440 810 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
2441 :
2442 810 : fd_pack_addr_use_t * in_bundle_temp = acct_uses_query ( pack->bundle_temp_map, acct, null_use );
2443 810 : ulong current_cost = wcost_map_ele_query_const( pack->writer_costs, &acct, null_wcost, pack->writers )->total_cost;
2444 810 : ulong carried_cost = (ulong)in_bundle_temp->carried_cost;
2445 810 : if( FD_UNLIKELY( current_cost + carried_cost + cur->compute_est > pack->lim->max_write_cost_per_acct ) ) {
2446 0 : doesnt_fit = 1;
2447 0 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_WRITE_COST_IDX ]++;
2448 0 : break;
2449 0 : }
2450 :
2451 810 : if( FD_LIKELY( in_bundle_temp==null_use ) ) { /* Not in temp bundle table yet */
2452 750 : in_bundle_temp = acct_uses_insert( pack->bundle_temp_map, acct );
2453 750 : in_bundle_temp->_ = 0UL;
2454 750 : bundle_temp_inserted[ bundle_temp_inserted_cnt++ ] = in_bundle_temp;
2455 750 : }
2456 810 : in_bundle_temp->carried_cost += (uint)cur->compute_est; /* < 2^21, but >0 */
2457 810 : in_bundle_temp->ref_cnt++;
2458 810 : last_use_in_txn_cnt[ in_bundle_temp->last_use_in ]--;
2459 810 : in_bundle_temp->last_use_in = (ushort)(txn_cnt+1UL);
2460 810 : last_use_in_txn_cnt[ in_bundle_temp->last_use_in ]++;
2461 :
2462 810 : if( FD_UNLIKELY( acct_uses_query( pack->acct_in_use, acct, null_use )->in_use_by ) ) {
2463 0 : has_conflict = 1;
2464 0 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_SLOW_PATH_IDX ]++;
2465 0 : break;
2466 0 : }
2467 810 : }
2468 378 : if( has_conflict | doesnt_fit ) break;
2469 :
2470 : /* Check conflicts between this transaction's readonly accounts and
2471 : current writers */
2472 378 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_READONLY );
2473 2106 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2474 :
2475 1728 : fd_acct_addr_t const * acct = ACCT_ITER_TO_PTR( iter );
2476 1728 : if( fd_pack_unwritable_contains( acct ) ) continue; /* No need to track sysvars because they can't be writable */
2477 :
2478 1314 : fd_pack_addr_use_t * in_bundle_temp = acct_uses_query( pack->bundle_temp_map, *acct, null_use );
2479 1314 : if( FD_LIKELY( in_bundle_temp==null_use ) ) { /* Not in temp bundle table yet */
2480 1038 : in_bundle_temp = acct_uses_insert( pack->bundle_temp_map, *acct );
2481 1038 : in_bundle_temp->_ = 0UL;
2482 1038 : bundle_temp_inserted[ bundle_temp_inserted_cnt++ ] = in_bundle_temp;
2483 1038 : }
2484 1314 : in_bundle_temp->ref_cnt++;
2485 1314 : last_use_in_txn_cnt[ in_bundle_temp->last_use_in ]--;
2486 1314 : in_bundle_temp->last_use_in = (ushort)(txn_cnt+1UL);
2487 1314 : last_use_in_txn_cnt[ in_bundle_temp->last_use_in ]++;
2488 :
2489 1314 : if( FD_UNLIKELY( acct_uses_query( pack->acct_in_use, *acct, null_use )->in_use_by & FD_PACK_IN_USE_WRITABLE ) ) {
2490 0 : has_conflict = 1;
2491 0 : pack->sched_results[ FD_METRICS_ENUM_PACK_TXN_SCHEDULE_V_SLOW_PATH_IDX ]++;
2492 0 : break;
2493 0 : }
2494 1314 : }
2495 :
2496 378 : if( has_conflict | doesnt_fit ) break;
2497 :
2498 378 : txn_cnt++;
2499 378 : _cur = treap_rev_iter_next( _cur, pool );
2500 378 : }
2501 126 : int retval = fd_int_if( doesnt_fit, TRY_BUNDLE_DOES_NOT_FIT,
2502 126 : fd_int_if( has_conflict, TRY_BUNDLE_HAS_CONFLICTS, TRY_BUNDLE_SUCCESS( (int)txn_cnt ) ) );
2503 :
2504 126 : if( FD_UNLIKELY( retval<=0 ) ) {
2505 0 : for( ulong i=0UL; i<bundle_temp_inserted_cnt; i++ ) {
2506 0 : acct_uses_remove( pack->bundle_temp_map, bundle_temp_inserted[ bundle_temp_inserted_cnt-i-1UL ] );
2507 0 : }
2508 0 : FD_TEST( acct_uses_key_cnt( pack->bundle_temp_map )==0UL );
2509 :
2510 0 : if( FD_UNLIKELY( retval==TRY_BUNDLE_DOES_NOT_FIT ) ) {
2511 : /* Decrement the skip count for the bundle we just tried. */
2512 :
2513 0 : for( _cur=_txn0; !treap_rev_iter_done( _cur ); _cur=treap_rev_iter_next( _cur, pool ) ) {
2514 0 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pool );
2515 0 : ulong this_bundle_idx = RC_TO_REL_BUNDLE_IDX( cur->rewards, cur->compute_est );
2516 0 : if( FD_UNLIKELY( this_bundle_idx!=bundle_idx ) ) break;
2517 :
2518 : /* See fd_pack_schedule_impl for this line */
2519 0 : cur->skip = (ushort)(1+fd_ushort_min( (ushort)(pack->compressed_slot_number-1),
2520 0 : (ushort)(fd_ushort_min( cur->skip, FD_PACK_SKIP_CNT )-2) ) );
2521 0 : }
2522 0 : }
2523 0 : return retval;
2524 0 : }
2525 :
2526 : /* This bundle passed validation, so now we'll take it! */
2527 126 : pack->outstanding_microblock_mask |= bank_tile_mask;
2528 :
2529 126 : treap_rev_iter_t _end = _cur;
2530 126 : treap_rev_iter_t _next;
2531 :
2532 : /* We'll carefully incrementally construct use_by_bank and
2533 : use_by_bank_txn based on the contents of bundle_temp and
2534 : last_use_in_txn_cnt. */
2535 126 : fd_pack_addr_use_t * use_by_bank = pack->use_by_bank [bank_tile];
2536 126 : ulong * use_by_bank_txn = pack->use_by_bank_txn[bank_tile];
2537 126 : ulong cum_sum = 0UL;
2538 504 : for( ulong k=0UL; k<txn_cnt; k++ ) { use_by_bank_txn[k] = cum_sum; cum_sum += last_use_in_txn_cnt[ k+1UL ]; }
2539 126 : pack->use_by_bank_cnt[bank_tile] = cum_sum;
2540 :
2541 :
2542 504 : for( _cur=_txn0; _cur!=_end; _cur=_next ) {
2543 378 : _next = treap_rev_iter_next( _cur, pool );
2544 :
2545 378 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pool );
2546 378 : fd_txn_t const * txn = TXN(cur->txn);
2547 378 : fd_txn_p_t * out_txnp = out->txnp;
2548 378 : if( FD_LIKELY( cur->txn->payload_sz>=1024UL ) ) pack_memcpy_out( out_txnp->payload, cur->txn->payload, cur->txn->payload_sz );
2549 18 : else fd_memcpy ( out_txnp->payload, cur->txn->payload, cur->txn->payload_sz );
2550 378 : fd_memcpy( TXN(out_txnp), txn, fd_txn_footprint( txn->instr_cnt, txn->addr_table_lookup_cnt ) );
2551 378 : out_txnp->payload_sz = cur->txn->payload_sz;
2552 378 : out_txnp->pack_cu.requested_exec_plus_acct_data_cus = cur->txn->pack_cu.requested_exec_plus_acct_data_cus;
2553 378 : out_txnp->pack_cu.non_execution_cus = cur->txn->pack_cu.non_execution_cus;
2554 378 : out_txnp->pack_alloc = cur->txn->pack_alloc;
2555 378 : out_txnp->scheduler_arrival_time_nanos = cur->txn->scheduler_arrival_time_nanos;
2556 378 : out_txnp->first_seen_nanos = cur->txn->first_seen_nanos;
2557 378 : out_txnp->source_tpu = cur->txn->source_tpu;
2558 378 : out_txnp->source_ipv4 = cur->txn->source_ipv4;
2559 378 : out_txnp->flags = cur->txn->flags;
2560 : /* Copy the ALT accounts from the source fd_txn_e_t */
2561 378 : ulong alt_acct_cnt = (ulong)txn->addr_table_adtl_cnt;
2562 378 : if( FD_UNLIKELY( alt_acct_cnt ) ) pack_memcpy_out( out->alt_accts, cur->txn_e->alt_accts, alt_acct_cnt*sizeof(fd_acct_addr_t) );
2563 378 : out++;
2564 :
2565 378 : pack->cumulative_block_cost += cur->compute_est;
2566 378 : pack->data_bytes_consumed += cur->txn->payload_sz + MICROBLOCK_DATA_OVERHEAD;
2567 378 : pack->alloc_consumed += cur->txn->pack_alloc;
2568 378 : pack->microblock_cnt += 1UL;
2569 :
2570 378 : if( FD_UNLIKELY( cur->txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE ) ) noncemap_ele_remove_fast( pack->noncemap, cur, pack->pool );
2571 378 : sig2txn_ele_remove_fast( pack->signature_map, cur, pack->pool );
2572 :
2573 378 : cur->root = FD_ORD_TXN_ROOT_FREE;
2574 378 : expq_remove( pack->expiration_q, cur->expq_idx );
2575 378 : treap_idx_remove( pack->pending_bundles, _cur, pack->pool );
2576 378 : trp_pool_idx_release( pack->pool, _cur );
2577 378 : pack->pending_txn_cnt--;
2578 378 : }
2579 :
2580 :
2581 1914 : for( ulong i=0UL; i<bundle_temp_inserted_cnt; i++ ) {
2582 : /* In order to clear bundle_temp_map with the typical trick, we need
2583 : to iterate through bundle_temp_inserted backwards. */
2584 1788 : fd_pack_addr_use_t * addr_use = bundle_temp_inserted[ bundle_temp_inserted_cnt-i-1UL ];
2585 :
2586 1788 : int any_writers = addr_use->carried_cost>0U; /* Did any transaction in this bundle write lock this account address? */
2587 :
2588 1788 : if( FD_LIKELY( any_writers ) ) { /* UNLIKELY? */
2589 750 : fd_pack_wcost_ele_t * in_wcost_table = wcost_map_ele_query( pack->writer_costs, &addr_use->key, NULL, pack->writers );
2590 750 : if( !in_wcost_table ) {
2591 735 : in_wcost_table = wcost_pool_ele_acquire( pack->writers );
2592 735 : in_wcost_table->key = addr_use->key;
2593 735 : in_wcost_table->total_cost = 0UL;
2594 735 : wcost_map_ele_insert ( pack->writer_costs, in_wcost_table, pack->writers );
2595 735 : wcost_dlist_ele_push_tail( pack->written_list, in_wcost_table, pack->writers );
2596 735 : }
2597 750 : in_wcost_table->total_cost += (ulong)addr_use->carried_cost;
2598 750 : }
2599 :
2600 : /* in_use_by must be set before releasing the bit reference */
2601 1788 : fd_pack_addr_use_t * use = acct_uses_query( pack->acct_in_use, addr_use->key, NULL );
2602 1788 : if( !use ) { use = acct_uses_insert( pack->acct_in_use, addr_use->key ); use->in_use_by = 0UL; }
2603 1788 : use->in_use_by |= bank_tile_mask | fd_ulong_if( any_writers, FD_PACK_IN_USE_WRITABLE, 0UL );
2604 1788 : use->in_use_by &= ~FD_PACK_IN_USE_BIT_CLEARED;
2605 :
2606 1788 : use_by_bank[ use_by_bank_txn[ addr_use->last_use_in-1UL ]++ ] = *use;
2607 :
2608 3912 : for( ulong k=0UL; k<(ulong)addr_use->ref_cnt; k++ ) {
2609 2124 : release_result_t ret = release_bit_reference( pack, &(addr_use->key) );
2610 2124 : FD_PACK_BITSET_CLEARN( bitset_rw_in_use, ret.clear_rw_bit );
2611 2124 : FD_PACK_BITSET_CLEARN( bitset_w_in_use, ret.clear_w_bit );
2612 2124 : }
2613 :
2614 1788 : acct_uses_remove( pack->bundle_temp_map, addr_use );
2615 1788 : }
2616 :
2617 126 : FD_PACK_BITSET_COPY( pack->bitset_rw_in_use, bitset_rw_in_use );
2618 126 : FD_PACK_BITSET_COPY( pack->bitset_w_in_use, bitset_w_in_use );
2619 :
2620 126 : if( FD_UNLIKELY( is_ib ) ) {
2621 0 : pack->initializer_bundle_state = FD_PACK_IB_STATE_PENDING;
2622 0 : }
2623 126 : pack_memcpy_fini();
2624 126 : return retval;
2625 126 : }
2626 :
2627 :
2628 : ulong
2629 : fd_pack_schedule_next_microblock( fd_pack_t * pack,
2630 : ulong total_cus,
2631 : float vote_fraction,
2632 : ulong bank_tile,
2633 : int schedule_flags,
2634 15117 : fd_txn_e_t * out ) {
2635 :
2636 : /* TODO: Decide if these are exactly how we want to handle limits */
2637 15117 : total_cus = fd_ulong_min( total_cus, pack->lim->max_cost_per_block - pack->cumulative_block_cost );
2638 15117 : ulong vote_cus = fd_ulong_min( (ulong)((float)total_cus * vote_fraction),
2639 15117 : pack->lim->max_vote_cost_per_block - pack->cumulative_vote_cost );
2640 15117 : ulong vote_reserved_txns = fd_ulong_min( vote_cus/FD_PACK_MAX_SIMPLE_VOTE_COST,
2641 15117 : (ulong)((float)pack->lim->max_txn_per_microblock * vote_fraction) );
2642 :
2643 :
2644 15117 : if( FD_UNLIKELY( (pack->microblock_cnt>=pack->lim->max_microblocks_per_block) ) ) {
2645 0 : FD_MCNT_INC( PACK, MICROBLOCK_PER_BLOCK_LIMIT_REACHED, 1UL );
2646 0 : return 0UL;
2647 0 : }
2648 15117 : if( FD_UNLIKELY( pack->data_bytes_consumed+MICROBLOCK_DATA_OVERHEAD+FD_TXN_MIN_SERIALIZED_SZ>pack->lim->max_data_bytes_per_block) ) {
2649 0 : FD_MCNT_INC( PACK, DATA_PER_BLOCK_LIMIT_REACHED, 1UL );
2650 0 : return 0UL;
2651 0 : }
2652 :
2653 15117 : ulong * use_by_bank_txn = pack->use_by_bank_txn[ bank_tile ];
2654 :
2655 15117 : #if FD_HAS_X86
2656 : /* out is a cold dcache chunk. Its payload is streamed, but the
2657 : metadata and TXN() lines are regular stores; start those reads for
2658 : ownership under the scheduling work. */
2659 15117 : _mm_prefetch( (uchar *)out+FD_TPU_MTU, _MM_HINT_ET0 );
2660 15117 : _mm_prefetch( (uchar *)out+FD_TPU_MTU+ 64UL, _MM_HINT_ET0 );
2661 15117 : _mm_prefetch( (uchar *)out+FD_TPU_MTU+128UL, _MM_HINT_ET0 );
2662 15117 : #endif
2663 :
2664 15117 : ulong cu_limit = total_cus - vote_cus;
2665 15117 : ulong txn_limit = pack->lim->max_txn_per_microblock - vote_reserved_txns;
2666 15117 : ulong scheduled = 0UL;
2667 15117 : ulong byte_limit = pack->lim->max_data_bytes_per_block - pack->data_bytes_consumed - MICROBLOCK_DATA_OVERHEAD;
2668 15117 : ulong alloc_limit = pack->lim->max_allocated_data_per_block - pack->alloc_consumed;
2669 :
2670 15117 : sched_return_t status = {0}, status1 = {0};
2671 :
2672 15117 : if( FD_LIKELY( schedule_flags & FD_PACK_SCHEDULE_VOTE ) ) {
2673 : /* Schedule vote transactions */
2674 14778 : status1= fd_pack_schedule_impl( pack, pack->pending_votes, vote_cus, vote_reserved_txns, byte_limit, alloc_limit, bank_tile,
2675 14778 : pack->pending_votes_smallest, use_by_bank_txn, out+scheduled );
2676 :
2677 14778 : scheduled += status1.txns_scheduled;
2678 14778 : pack->cumulative_vote_cost += status1.cus_scheduled;
2679 14778 : pack->cumulative_block_cost += status1.cus_scheduled;
2680 14778 : pack->data_bytes_consumed += status1.bytes_scheduled;
2681 14778 : byte_limit -= status1.bytes_scheduled;
2682 14778 : pack->alloc_consumed += status1.alloc_scheduled;
2683 14778 : alloc_limit -= status1.alloc_scheduled;
2684 14778 : use_by_bank_txn += status1.txns_scheduled;
2685 : /* Add any remaining CUs/txns to the non-vote limits */
2686 14778 : txn_limit += vote_reserved_txns - status1.txns_scheduled;
2687 14778 : cu_limit += vote_cus - status1.cus_scheduled;
2688 14778 : }
2689 :
2690 : /* Bundle can't mix with votes, so only try to schedule a bundle if we
2691 : didn't get any votes. */
2692 15117 : if( FD_UNLIKELY( !!(schedule_flags & FD_PACK_SCHEDULE_BUNDLE) & (status1.txns_scheduled==0UL) ) ) {
2693 14844 : int bundle_result = fd_pack_try_schedule_bundle( pack, bank_tile, out );
2694 14844 : if( FD_UNLIKELY( bundle_result>0 ) ) return (ulong)bundle_result;
2695 14718 : if( FD_UNLIKELY( bundle_result==TRY_BUNDLE_HAS_CONFLICTS ) ) return 0UL;
2696 : /* in the NO_READY_BUNDLES or DOES_NOT_FIT case, we schedule like
2697 : normal. */
2698 : /* We have the early returns here because try_schedule_bundle does
2699 : the bookkeeping internally, since the calculations are a bit
2700 : different in that case. */
2701 14718 : }
2702 :
2703 :
2704 : /* Fill any remaining space with non-vote transactions */
2705 14991 : if( FD_LIKELY( schedule_flags & FD_PACK_SCHEDULE_TXN ) ) {
2706 14991 : status = fd_pack_schedule_impl( pack, pack->pending, cu_limit, txn_limit, byte_limit, alloc_limit, bank_tile,
2707 14991 : pack->pending_smallest, use_by_bank_txn, out+scheduled );
2708 :
2709 14991 : scheduled += status.txns_scheduled;
2710 14991 : pack->cumulative_block_cost += status.cus_scheduled;
2711 14991 : pack->data_bytes_consumed += status.bytes_scheduled;
2712 14991 : pack->alloc_consumed += status.alloc_scheduled;
2713 14991 : }
2714 :
2715 14991 : ulong nonempty = (ulong)(scheduled>0UL);
2716 14991 : pack->microblock_cnt += nonempty;
2717 14991 : pack->outstanding_microblock_mask |= nonempty << bank_tile;
2718 14991 : pack->data_bytes_consumed += nonempty * MICROBLOCK_DATA_OVERHEAD;
2719 :
2720 14991 : fd_histf_sample( pack->txn_per_microblock, scheduled );
2721 14991 : fd_histf_sample( pack->vote_per_microblock, status1.txns_scheduled );
2722 :
2723 14991 : pack_memcpy_fini();
2724 14991 : return scheduled;
2725 15117 : }
2726 :
2727 274518 : ulong fd_pack_bank_tile_cnt ( fd_pack_t const * pack ) { return pack->bank_tile_cnt; }
2728 0 : ulong fd_pack_current_block_cost( fd_pack_t const * pack ) { return pack->cumulative_block_cost; }
2729 :
2730 :
2731 : void
2732 0 : fd_pack_set_block_limits( fd_pack_t * pack, fd_pack_limits_t const * limits ) {
2733 0 : FD_TEST( limits->max_cost_per_block >= FD_PACK_MAX_COST_PER_BLOCK_LOWER_BOUND );
2734 0 : FD_TEST( limits->max_vote_cost_per_block >= FD_PACK_MAX_VOTE_COST_PER_BLOCK_LOWER_BOUND );
2735 0 : FD_TEST( limits->max_write_cost_per_acct >= FD_PACK_MAX_WRITE_COST_PER_ACCT_LOWER_BOUND );
2736 :
2737 0 : pack->lim->max_microblocks_per_block = limits->max_microblocks_per_block;
2738 0 : pack->lim->max_data_bytes_per_block = limits->max_data_bytes_per_block;
2739 0 : pack->lim->max_cost_per_block = limits->max_cost_per_block;
2740 0 : pack->lim->max_vote_cost_per_block = limits->max_vote_cost_per_block;
2741 0 : pack->lim->max_write_cost_per_acct = limits->max_write_cost_per_acct;
2742 0 : pack->lim->max_allocated_data_per_block = limits->max_allocated_data_per_block;
2743 0 : }
2744 :
2745 : void
2746 0 : fd_pack_get_block_limits( fd_pack_t * pack, fd_pack_limits_usage_t * opt_limits_usage, fd_pack_limits_t * opt_limits ) {
2747 0 : if( FD_LIKELY( opt_limits_usage ) ) {
2748 0 : opt_limits_usage->block_cost = pack->cumulative_block_cost;
2749 0 : opt_limits_usage->vote_cost = pack->cumulative_vote_cost;
2750 0 : opt_limits_usage->block_data_bytes = pack->data_bytes_consumed;
2751 0 : opt_limits_usage->microblocks = pack->microblock_cnt;
2752 0 : opt_limits_usage->alloc = pack->alloc_consumed;
2753 0 : }
2754 0 : if( FD_LIKELY( opt_limits ) ) fd_memcpy( opt_limits, pack->lim, sizeof(fd_pack_limits_t) );
2755 0 : }
2756 :
2757 : void
2758 0 : fd_pack_get_top_writers( fd_pack_t const * pack, fd_pack_addr_use_t top_writers[static FD_PACK_TOP_WRITERS_CNT] ) {
2759 0 : fd_memcpy( top_writers, pack->top_writers, sizeof(pack->top_writers) );
2760 0 : }
2761 :
2762 : void
2763 0 : fd_pack_get_pending_smallest( fd_pack_t * pack, fd_pack_smallest_t * opt_pending_smallest, fd_pack_smallest_t * opt_votes_smallest ) {
2764 0 : if( FD_LIKELY( opt_pending_smallest ) ) fd_memcpy( opt_pending_smallest, pack->pending_smallest, sizeof(fd_pack_smallest_t) );
2765 0 : if( FD_LIKELY( opt_votes_smallest ) ) fd_memcpy( opt_votes_smallest, pack->pending_votes_smallest, sizeof(fd_pack_smallest_t) );
2766 0 : }
2767 :
2768 : void
2769 : fd_pack_rebate_cus( fd_pack_t * pack,
2770 6 : fd_pack_rebate_t const * rebate ) {
2771 6 : if( FD_UNLIKELY( (rebate->ib_result!=0) & (pack->initializer_bundle_state==FD_PACK_IB_STATE_PENDING ) ) ) {
2772 0 : pack->initializer_bundle_state = fd_int_if( rebate->ib_result==1, FD_PACK_IB_STATE_READY, FD_PACK_IB_STATE_FAILED );
2773 0 : }
2774 :
2775 6 : pack->cumulative_block_cost -= rebate->total_cost_rebate;
2776 6 : pack->cumulative_vote_cost -= rebate->vote_cost_rebate;
2777 6 : pack->data_bytes_consumed -= rebate->data_bytes_rebate;
2778 6 : pack->alloc_consumed -= rebate->alloc_rebate;
2779 6 : pack->cumulative_rebated_cus += rebate->total_cost_rebate;
2780 : /* For now, we want to ignore the microblock count rebate. There are
2781 : 3 places the microblock count is kept (here, in the pack tile, and
2782 : in the PoH tile), and they all need to count microblocks that end
2783 : up being empty in the same way. It would be better from a
2784 : DoS-resistance perspective for them all not to count empty
2785 : microblocks towards the total, but there's a race condition:
2786 : suppose pack schedules a microblock containing one transaction that
2787 : doesn't land on chain, the slot ends, and then pack informs PoH of
2788 : the number of microblocks before the final rebate comes through.
2789 : This isn't unsolvable, but it's pretty gross, so it's probably
2790 : better to just not apply the rebate for now. */
2791 6 : (void)rebate->microblock_cnt_rebate;
2792 :
2793 6 : wcost_map_t * writer_costs = pack->writer_costs;
2794 18 : for( ulong i=0UL; i<rebate->writer_cnt; i++ ) {
2795 12 : fd_pack_wcost_ele_t * in_wcost_table = wcost_map_ele_query( writer_costs, &rebate->writer_rebates[i].key, NULL, pack->writers );
2796 12 : if( FD_UNLIKELY( !in_wcost_table ) ) FD_LOG_ERR(( "Rebate to unknown written account" ));
2797 12 : in_wcost_table->total_cost -= rebate->writer_rebates[i].rebate_cus;
2798 : /* If the rebate drops it to zero, return it to the pool */
2799 12 : if( FD_UNLIKELY( !in_wcost_table->total_cost ) ) {
2800 3 : wcost_map_ele_remove_fast( writer_costs, in_wcost_table, pack->writers );
2801 3 : wcost_dlist_ele_remove ( pack->written_list, in_wcost_table, pack->writers );
2802 3 : wcost_pool_ele_release ( pack->writers, in_wcost_table );
2803 3 : }
2804 12 : }
2805 6 : }
2806 :
2807 :
2808 : ulong
2809 : fd_pack_expire_before( fd_pack_t * pack,
2810 15 : ulong expire_before ) {
2811 15 : expire_before = fd_ulong_max( expire_before, pack->expire_before );
2812 15 : ulong deleted_cnt = 0UL;
2813 15 : fd_pack_expq_t * prq = pack->expiration_q;
2814 327 : while( (expq_cnt( prq )>0UL) & (prq->expires_at<expire_before) ) {
2815 312 : fd_pack_ord_txn_t * expired = prq->txn;
2816 :
2817 : /* fd_pack_delete_transaction also removes it from the heap */
2818 : /* All the transactions in the same bundle have the same expiration
2819 : time, so this loop will end up deleting them all, even with
2820 : delete_full_bundle set to 0. */
2821 312 : ulong _delete_cnt = delete_transaction( pack, expired, 0, 1 );
2822 312 : deleted_cnt += _delete_cnt;
2823 312 : FD_TEST( _delete_cnt );
2824 312 : }
2825 :
2826 15 : pack->expire_before = expire_before;
2827 15 : return deleted_cnt;
2828 15 : }
2829 :
2830 : void
2831 12 : fd_pack_end_block( fd_pack_t * pack ) {
2832 : /* rounded division */
2833 12 : ulong pct_cus_per_block = (pack->cumulative_block_cost*100UL + (pack->lim->max_cost_per_block>>1))/pack->lim->max_cost_per_block;
2834 12 : fd_histf_sample( pack->pct_cus_per_block, pct_cus_per_block );
2835 12 : fd_histf_sample( pack->net_cus_per_block, pack->cumulative_block_cost );
2836 12 : fd_histf_sample( pack->rebated_cus_per_block, pack->cumulative_rebated_cus );
2837 12 : fd_histf_sample( pack->scheduled_cus_per_block, pack->cumulative_rebated_cus + pack->cumulative_block_cost );
2838 :
2839 12 : pack->microblock_cnt = 0UL;
2840 12 : pack->data_bytes_consumed = 0UL;
2841 12 : pack->cumulative_block_cost = 0UL;
2842 12 : pack->cumulative_vote_cost = 0UL;
2843 12 : pack->cumulative_rebated_cus = 0UL;
2844 12 : pack->outstanding_microblock_mask = 0UL;
2845 12 : pack->alloc_consumed = 0UL;
2846 :
2847 12 : pack->initializer_bundle_state = FD_PACK_IB_STATE_NOT_INITIALIZED;
2848 :
2849 12 : acct_uses_clear( pack->acct_in_use );
2850 12 : memset( pack->top_writers, 0, sizeof(pack->top_writers) );
2851 :
2852 12 : fd_pack_addr_use_t * last_top_writer = pack->top_writers + FD_PACK_TOP_WRITERS_CNT-1UL;
2853 :
2854 8148 : while( !wcost_dlist_is_empty( pack->written_list, pack->writers ) ) {
2855 8136 : fd_pack_wcost_ele_t * writer = wcost_dlist_ele_pop_head( pack->written_list, pack->writers );
2856 8136 : if( FD_UNLIKELY( writer->total_cost>last_top_writer->total_cost ) ) {
2857 81 : last_top_writer->key = writer->key;
2858 81 : last_top_writer->total_cost = writer->total_cost;
2859 81 : fd_pack_writer_cost_sort_insert( pack->top_writers, FD_PACK_TOP_WRITERS_CNT );
2860 81 : }
2861 : /* Clearing the cost field here is unnecessary (since it gets
2862 : cleared on insert), but makes debugging a bit easier. */
2863 8136 : writer->total_cost = 0UL;
2864 8136 : wcost_map_ele_remove_fast( pack->writer_costs, writer, pack->writers );
2865 8136 : wcost_pool_ele_release( pack->writers, writer );
2866 8136 : }
2867 :
2868 : /* compressed_slot_number is > FD_PACK_SKIP_CNT, which means +1 is the
2869 : max unless it overflows. */
2870 12 : pack->compressed_slot_number = fd_ushort_max( (ushort)(pack->compressed_slot_number+1), (ushort)(FD_PACK_SKIP_CNT+1) );
2871 :
2872 12 : FD_PACK_BITSET_CLEAR( pack->bitset_rw_in_use );
2873 12 : FD_PACK_BITSET_CLEAR( pack->bitset_w_in_use );
2874 :
2875 24 : for( ulong i=0UL; i<pack->bank_tile_cnt; i++ ) pack->use_by_bank_cnt[i] = 0UL;
2876 :
2877 : /* If our stake is low and we don't become leader often, end_block
2878 : might get called on the order of O(1/hr), which feels too
2879 : infrequent to do anything related to metrics. However, we only
2880 : update the histograms when we are leader, so this is actually a
2881 : good place to copy them. */
2882 12 : FD_MHIST_COPY( PACK, TXN_PER_MICROBLOCK, pack->txn_per_microblock );
2883 12 : FD_MHIST_COPY( PACK, VOTE_PER_MICROBLOCK, pack->vote_per_microblock );
2884 :
2885 12 : FD_MGAUGE_SET( PACK, BLOCK_CU_CONSUMED, 0UL );
2886 12 : FD_MHIST_COPY( PACK, CU_SCHEDULED_PER_BLOCK, pack->scheduled_cus_per_block );
2887 12 : FD_MHIST_COPY( PACK, CU_REBATED_PER_BLOCK, pack->rebated_cus_per_block );
2888 12 : FD_MHIST_COPY( PACK, CU_NET_PER_BLOCK, pack->net_cus_per_block );
2889 12 : FD_MHIST_COPY( PACK, CU_PCT, pack->pct_cus_per_block );
2890 12 : }
2891 :
2892 : static void
2893 : release_tree( treap_t * treap,
2894 : sig2txn_t * signature_map,
2895 : noncemap_t * noncemap,
2896 9 : fd_pack_ord_txn_t * pool ) {
2897 9 : treap_fwd_iter_t next;
2898 18 : for( treap_fwd_iter_t it=treap_fwd_iter_init( treap, pool ); !treap_fwd_iter_done( it ); it=next ) {
2899 9 : next = treap_fwd_iter_next( it, pool );
2900 9 : ulong idx = treap_fwd_iter_idx( it );
2901 9 : pool[ idx ].root = FD_ORD_TXN_ROOT_FREE;
2902 9 : treap_idx_remove ( treap, idx, pool );
2903 9 : sig2txn_idx_remove_fast( signature_map, idx, pool );
2904 9 : trp_pool_idx_release ( pool, idx );
2905 9 : if( pool[ idx ].txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE ) {
2906 9 : noncemap_idx_remove_fast( noncemap, idx, pool );
2907 9 : }
2908 9 : }
2909 9 : }
2910 :
2911 : void
2912 3 : fd_pack_clear_all( fd_pack_t * pack ) {
2913 3 : pack->pending_txn_cnt = 0UL;
2914 3 : pack->microblock_cnt = 0UL;
2915 3 : pack->cumulative_block_cost = 0UL;
2916 3 : pack->cumulative_vote_cost = 0UL;
2917 3 : pack->cumulative_rebated_cus = 0UL;
2918 3 : pack->data_bytes_consumed = 0UL;
2919 3 : pack->alloc_consumed = 0UL;
2920 :
2921 3 : pack->pending_smallest->cus = ULONG_MAX;
2922 3 : pack->pending_smallest->bytes = ULONG_MAX;
2923 3 : pack->pending_votes_smallest->cus = ULONG_MAX;
2924 3 : pack->pending_votes_smallest->bytes = ULONG_MAX;
2925 :
2926 3 : release_tree( pack->pending, pack->signature_map, pack->noncemap, pack->pool );
2927 3 : release_tree( pack->pending_votes, pack->signature_map, pack->noncemap, pack->pool );
2928 3 : release_tree( pack->pending_bundles, pack->signature_map, pack->noncemap, pack->pool );
2929 :
2930 3 : ulong const pool_max = trp_pool_max( pack->pool );
2931 132 : for( ulong i=0UL; i<pool_max; i++ ) {
2932 129 : if( FD_UNLIKELY( pack->pool[ i ].root!=FD_ORD_TXN_ROOT_FREE ) ) {
2933 0 : fd_pack_ord_txn_t * const del = pack->pool + i;
2934 0 : fd_txn_t * txn = TXN( del->txn );
2935 0 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, del->txn->payload );
2936 0 : fd_acct_addr_t const * alt_adj = del->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
2937 0 : fd_acct_addr_t penalty_acct = *ACCT_IDX_TO_PTR( FD_ORD_TXN_ROOT_PENALTY_ACCT_IDX( del->root ) );
2938 0 : fd_pack_penalty_treap_t * penalty_treap = penalty_map_query( pack->penalty_treaps, penalty_acct, NULL );
2939 0 : FD_TEST( penalty_treap );
2940 0 : release_tree( penalty_treap->penalty_treap, pack->signature_map, pack->noncemap, pack->pool );
2941 0 : }
2942 129 : }
2943 :
2944 3 : pack->compressed_slot_number = (ushort)(FD_PACK_SKIP_CNT+1);
2945 :
2946 3 : expq_remove_all( pack->expiration_q );
2947 :
2948 3 : acct_uses_clear( pack->acct_in_use );
2949 :
2950 18 : while( !wcost_dlist_is_empty( pack->written_list, pack->writers ) ) {
2951 15 : fd_pack_wcost_ele_t * writer = wcost_dlist_ele_pop_head( pack->written_list, pack->writers );
2952 15 : writer->total_cost = 0UL;
2953 15 : wcost_map_ele_remove_fast( pack->writer_costs, writer, pack->writers );
2954 15 : wcost_pool_ele_release( pack->writers, writer );
2955 15 : }
2956 :
2957 3 : penalty_map_clear( pack->penalty_treaps );
2958 :
2959 3 : FD_PACK_BITSET_CLEAR( pack->bitset_rw_in_use );
2960 3 : FD_PACK_BITSET_CLEAR( pack->bitset_w_in_use );
2961 3 : bitset_map_clear( pack->acct_to_bitset );
2962 3 : pack->bitset_avail[ 0 ] = FD_PACK_BITSET_SLOWPATH;
2963 1027 : for( ulong i=0UL; i<FD_PACK_BITSET_MAX; i++ ) pack->bitset_avail[ i+1UL ] = (ushort)i;
2964 3 : pack->bitset_avail_cnt = FD_PACK_BITSET_MAX;
2965 :
2966 6 : for( ulong i=0UL; i<pack->bank_tile_cnt; i++ ) pack->use_by_bank_cnt[i] = 0UL;
2967 3 : }
2968 :
2969 :
2970 : /* If delete_full_bundle is non-zero and the transaction to delete is
2971 : part of a bundle, the rest of the bundle it is part of will be
2972 : deleted as well.
2973 : If move_from_penalty_treap is non-zero and the transaction to delete
2974 : is in the pending treap, move the best transaction in any of the
2975 : conflicting penalty treaps to the pending treap (if there is one). */
2976 : static ulong
2977 : delete_transaction( fd_pack_t * pack,
2978 : fd_pack_ord_txn_t * containing,
2979 : int delete_full_bundle,
2980 3951 : int move_from_penalty_treap ) {
2981 :
2982 3951 : fd_txn_t * txn = TXN( containing->txn );
2983 3951 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, containing->txn->payload );
2984 3951 : fd_acct_addr_t const * alt_adj = containing->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
2985 :
2986 3951 : treap_t * root = NULL;
2987 3951 : int root_idx = containing->root;
2988 3951 : fd_pack_penalty_treap_t * penalty_treap = NULL;
2989 3951 : switch( root_idx & FD_ORD_TXN_ROOT_TAG_MASK ) {
2990 0 : case FD_ORD_TXN_ROOT_FREE: FD_LOG_CRIT(( "Double free detected" ));
2991 780 : case FD_ORD_TXN_ROOT_PENDING: root = pack->pending; break;
2992 0 : case FD_ORD_TXN_ROOT_PENDING_VOTE: root = pack->pending_votes; break;
2993 519 : case FD_ORD_TXN_ROOT_PENDING_BUNDLE: root = pack->pending_bundles; break;
2994 2652 : case FD_ORD_TXN_ROOT_PENALTY( 0 ): {
2995 2652 : fd_acct_addr_t penalty_acct = *ACCT_IDX_TO_PTR( FD_ORD_TXN_ROOT_PENALTY_ACCT_IDX( root_idx ) );
2996 2652 : penalty_treap = penalty_map_query( pack->penalty_treaps, penalty_acct, NULL );
2997 2652 : FD_TEST( penalty_treap );
2998 2652 : root = penalty_treap->penalty_treap;
2999 2652 : break;
3000 2652 : }
3001 3951 : }
3002 :
3003 3951 : ulong delete_cnt = 0UL;
3004 3951 : if( FD_UNLIKELY( delete_full_bundle & (root==pack->pending_bundles) ) ) {
3005 : /* When we delete, the structure of the treap may move around, but
3006 : pointers to inside the pool will remain valid */
3007 123 : fd_pack_ord_txn_t * bundle_ptrs[ FD_PACK_MAX_TXN_PER_BUNDLE-1UL ];
3008 123 : fd_pack_ord_txn_t * pool = pack->pool;
3009 123 : ulong cnt = 0UL;
3010 123 : ulong bundle_idx = RC_TO_REL_BUNDLE_IDX( containing->rewards, containing->compute_est );
3011 :
3012 : /* Iterate in both directions from the current transaction */
3013 123 : for( treap_fwd_iter_t _cur=treap_fwd_iter_next( (treap_fwd_iter_t)treap_idx_fast( containing, pool ), pool );
3014 426 : !treap_fwd_iter_done( _cur ); _cur=treap_fwd_iter_next( _cur, pool ) ) {
3015 303 : fd_pack_ord_txn_t * cur = treap_fwd_iter_ele( _cur, pool );
3016 303 : if( FD_LIKELY( bundle_idx==RC_TO_REL_BUNDLE_IDX( cur->rewards, cur->compute_est ) ) ) {
3017 303 : bundle_ptrs[ cnt++ ] = cur;
3018 303 : } else {
3019 0 : break;
3020 0 : }
3021 303 : FD_TEST( cnt<FD_PACK_MAX_TXN_PER_BUNDLE );
3022 303 : }
3023 :
3024 123 : for( treap_rev_iter_t _cur=treap_rev_iter_next( (treap_rev_iter_t)treap_idx_fast( containing, pool ), pool );
3025 216 : !treap_rev_iter_done( _cur ); _cur=treap_rev_iter_next( _cur, pool ) ) {
3026 93 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pool );
3027 93 : if( FD_LIKELY( bundle_idx==RC_TO_REL_BUNDLE_IDX( cur->rewards, cur->compute_est ) ) ) {
3028 93 : bundle_ptrs[ cnt++ ] = cur;
3029 93 : } else {
3030 0 : break;
3031 0 : }
3032 93 : FD_TEST( cnt<FD_PACK_MAX_TXN_PER_BUNDLE );
3033 93 : }
3034 :
3035 : /* Delete them each, setting delete_full_bundle to 0 to avoid
3036 : infinite recursion. */
3037 519 : for( ulong k=0UL; k<cnt; k++ ) delete_cnt += delete_transaction( pack, bundle_ptrs[ k ], 0, 0 );
3038 123 : }
3039 :
3040 :
3041 3951 : if( FD_UNLIKELY( move_from_penalty_treap & (root==pack->pending) ) ) {
3042 :
3043 774 : fd_pack_ord_txn_t * best = NULL;
3044 774 : fd_pack_penalty_treap_t * best_penalty = NULL;
3045 :
3046 774 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
3047 3399 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
3048 2625 : fd_pack_penalty_treap_t * p_trp = penalty_map_query( pack->penalty_treaps, *ACCT_ITER_TO_PTR( iter ), NULL );
3049 2625 : if( FD_UNLIKELY( p_trp ) ) {
3050 1340 : fd_pack_ord_txn_t * best_in_trp = treap_rev_iter_ele( treap_rev_iter_init( p_trp->penalty_treap, pack->pool ), pack->pool );
3051 1340 : if( FD_UNLIKELY( !best || COMPARE_WORSE( best, best_in_trp ) ) ) {
3052 701 : best = best_in_trp;
3053 701 : best_penalty = p_trp;
3054 701 : }
3055 1340 : }
3056 2625 : }
3057 :
3058 774 : if( FD_LIKELY( best ) ) {
3059 : /* move best to the main treap */
3060 701 : treap_ele_remove( best_penalty->penalty_treap, best, pack->pool );
3061 701 : best->root = FD_ORD_TXN_ROOT_PENDING;
3062 701 : treap_ele_insert( pack->pending, best, pack->pool );
3063 :
3064 701 : pack->pending_smallest->cus = fd_ulong_min( pack->pending_smallest->cus, best->compute_est );
3065 701 : pack->pending_smallest->bytes = fd_ulong_min( pack->pending_smallest->bytes, best->txn_e->txnp->payload_sz );
3066 :
3067 701 : if( FD_UNLIKELY( !treap_ele_cnt( best_penalty->penalty_treap ) ) ) {
3068 9 : treap_delete( treap_leave( best_penalty->penalty_treap ) );
3069 9 : penalty_map_remove( pack->penalty_treaps, best_penalty );
3070 9 : }
3071 701 : }
3072 774 : }
3073 :
3074 3951 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_ALL );
3075 38088 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
3076 34137 : if( FD_UNLIKELY( fd_pack_unwritable_contains( ACCT_ITER_TO_PTR( iter ) ) ) ) continue;
3077 :
3078 29664 : release_result_t ret = release_bit_reference( pack, ACCT_ITER_TO_PTR( iter ) );
3079 29664 : FD_PACK_BITSET_CLEARN( pack->bitset_rw_in_use, ret.clear_rw_bit );
3080 29664 : FD_PACK_BITSET_CLEARN( pack->bitset_w_in_use, ret.clear_w_bit );
3081 29664 : }
3082 :
3083 3951 : if( FD_UNLIKELY( containing->txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE ) ) {
3084 261 : noncemap_ele_remove_fast( pack->noncemap, containing, pack->pool );
3085 261 : }
3086 3951 : expq_remove( pack->expiration_q, containing->expq_idx );
3087 3951 : containing->root = FD_ORD_TXN_ROOT_FREE;
3088 3951 : treap_ele_remove( root, containing, pack->pool );
3089 3951 : sig2txn_ele_remove_fast( pack->signature_map, containing, pack->pool );
3090 3951 : trp_pool_ele_release( pack->pool, containing );
3091 :
3092 3951 : delete_cnt += 1UL;
3093 3951 : pack->pending_txn_cnt--;
3094 :
3095 3951 : if( FD_UNLIKELY( penalty_treap && treap_ele_cnt( root )==0UL ) ) {
3096 0 : penalty_map_remove( pack->penalty_treaps, penalty_treap );
3097 0 : }
3098 :
3099 3951 : return delete_cnt;
3100 3951 : }
3101 :
3102 : ulong
3103 : fd_pack_delete_transaction( fd_pack_t * pack,
3104 180 : fd_ed25519_sig_t const * sig0 ) {
3105 180 : ulong cnt = 0;
3106 180 : ulong next = ULONG_MAX;
3107 :
3108 180 : fd_txn_e_t query_e = {0};
3109 180 : fd_memcpy( query_e.txnp[0].payload, sig0, FD_TXN_SIGNATURE_SZ );
3110 180 : for( ulong idx = sig2txn_idx_query_const( pack->signature_map, &query_e, ULONG_MAX, pack->pool );
3111 336 : idx!=ULONG_MAX; idx=next ) {
3112 : /* Iterating while deleting, not just this element, but perhaps the
3113 : whole bundle, feels a bit dangerous, but is actually fine because
3114 : a bundle can't contain two transactions with the same signature.
3115 : That means we know next is not part of the same bundle as idx,
3116 : which means that deleting idx will not delete next. */
3117 156 : next = sig2txn_idx_next_const( idx, ULONG_MAX, pack->pool );
3118 156 : cnt += delete_transaction( pack, pack->pool+idx, 1, 1 );
3119 156 : }
3120 :
3121 180 : return cnt;
3122 180 : }
3123 :
3124 :
3125 : int
3126 : fd_pack_verify( fd_pack_t * pack,
3127 435 : void * scratch ) {
3128 : /* Invariants:
3129 : sig2txn_query has exact same contents as all treaps combined
3130 : root matches treap
3131 : Keys of acct_to_bitset is exactly union of all accounts in all
3132 : transactions in treaps, with ref counted appropriately
3133 : bits in bitset_avail is complement of bits allocated in
3134 : acct_to_bitset
3135 : expires_at consistent between treap, prq
3136 : use_by_bank does not contain duplicates
3137 : use_by_bank consistent with acct_in_use
3138 : elements in pool but not in a treap have root set to free
3139 : all penalty treaps have at least one transaction
3140 : all elements in penalty treaps are in the one that the root indicates
3141 : */
3142 :
3143 : /* TODO:
3144 : bitset_{r}w_in_use = bitset_map_query( everything in acct_in_use that doesn't have FD_PACK_IN_USE_BIT_CLEARED )
3145 : bitset_w_in_use & bitset_rw_in_use == bitset_w_in_use
3146 : */
3147 314708 : #define VERIFY_TEST( cond, ... ) do { \
3148 314708 : if( FD_UNLIKELY( !(cond) ) ) { \
3149 0 : FD_LOG_WARNING(( __VA_ARGS__ )); \
3150 0 : return -(__LINE__); \
3151 0 : } \
3152 314708 : } while( 0 )
3153 :
3154 435 : ulong max_acct_in_treap = pack->pack_depth * FD_TXN_ACCT_ADDR_MAX;
3155 435 : int lg_acct_in_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap ) );
3156 435 : void * _bitset_map_copy = scratch;
3157 435 : void * _bitset_map_orig = bitset_map_leave( pack->acct_to_bitset );
3158 435 : fd_memcpy( _bitset_map_copy, _bitset_map_orig, bitset_map_footprint( lg_acct_in_trp ) );
3159 :
3160 435 : fd_pack_bitset_acct_mapping_t * bitset_copy = bitset_map_join( _bitset_map_copy );
3161 :
3162 : /* Check that each bit is in exactly one place */
3163 435 : FD_PACK_BITSET_DECLARE( processed ); FD_PACK_BITSET_CLEAR( processed );
3164 435 : FD_PACK_BITSET_DECLARE( bit ); FD_PACK_BITSET_CLEAR( bit );
3165 435 : FD_PACK_BITSET_DECLARE( full ); FD_PACK_BITSET_CLEAR( full );
3166 :
3167 435 : if( FD_UNLIKELY( pack->bitset_avail[0]!=FD_PACK_BITSET_SLOWPATH ) ) return -1;
3168 148237 : for( ulong i=1UL; i<=pack->bitset_avail_cnt; i++ ) {
3169 147802 : FD_PACK_BITSET_CLEAR( bit );
3170 147802 : FD_PACK_BITSET_SETN( bit, pack->bitset_avail[ i ] );
3171 147802 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, processed, processed ),
3172 147802 : "bit %hu in avail set twice", pack->bitset_avail[ i ] );
3173 147802 : FD_PACK_BITSET_OR( processed, bit );
3174 147802 : }
3175 :
3176 435 : ulong total_references = 0UL;
3177 62865843 : for( ulong i=0UL; i<bitset_map_slot_cnt( bitset_copy ); i++ ) {
3178 62865408 : if( !bitset_map_key_inval( bitset_copy[ i ].key ) ) {
3179 1086 : VERIFY_TEST( bitset_copy[ i ].ref_cnt>0UL, "account address in table with 0 ref count" );
3180 :
3181 1086 : total_references += bitset_copy[ i ].ref_cnt;
3182 :
3183 1086 : FD_PACK_BITSET_CLEAR( bit );
3184 1086 : FD_PACK_BITSET_SETN( bit, bitset_copy[ i ].bit );
3185 1086 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, processed, processed ), "bit %hu used twice", bitset_copy[ i ].bit );
3186 1086 : FD_PACK_BITSET_OR( processed, bit );
3187 1086 : }
3188 62865408 : }
3189 148915 : for( ulong i=0UL; i<FD_PACK_BITSET_MAX; i++ ) {
3190 148480 : FD_PACK_BITSET_CLEAR( bit );
3191 148480 : FD_PACK_BITSET_SETN( bit, i );
3192 148480 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, processed, processed ), "bit %lu missing", i );
3193 148480 : FD_PACK_BITSET_SETN( full, i );
3194 148480 : }
3195 :
3196 :
3197 435 : fd_pack_ord_txn_t * pool = pack->pool;
3198 435 : treap_t * treaps[ 3 ] = { pack->pending, pack->pending_votes, pack->pending_bundles };
3199 435 : ulong txn_cnt = 0UL;
3200 :
3201 984012 : for( ulong k=0UL; k<3UL+penalty_map_slot_cnt( pack->penalty_treaps ); k++ ) {
3202 983577 : treap_t * treap = NULL;
3203 :
3204 983577 : if( k<3UL ) treap = treaps[ k ];
3205 982272 : else if( FD_LIKELY( penalty_map_key_inval( pack->penalty_treaps[ k-3UL ].key ) ) ) continue;
3206 0 : else {
3207 0 : treap = pack->penalty_treaps[ k-3UL ].penalty_treap;
3208 0 : VERIFY_TEST( treap_ele_cnt( treap )>0UL, "empty penalty treap in map" );
3209 0 : }
3210 :
3211 1728 : for( treap_rev_iter_t _cur=treap_rev_iter_init( treap, pool ); !treap_rev_iter_done( _cur );
3212 1305 : _cur=treap_rev_iter_next( _cur, pool ) ) {
3213 423 : txn_cnt++;
3214 423 : fd_pack_ord_txn_t const * cur = treap_rev_iter_ele_const( _cur, pool );
3215 423 : fd_txn_t const * txn = TXN(cur->txn);
3216 423 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, cur->txn->payload );
3217 423 : fd_acct_addr_t const * alt_adj = cur->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
3218 :
3219 423 : fd_pack_ord_txn_t const * in_tbl = sig2txn_ele_query_const( pack->signature_map, &cur->_txn_e, NULL, pool );
3220 423 : VERIFY_TEST( in_tbl, "signature missing from sig2txn" );
3221 :
3222 423 : VERIFY_TEST( (ulong)(cur->root & FD_ORD_TXN_ROOT_TAG_MASK)==fd_ulong_min( k, 3UL )+1UL, "treap element had bad root" );
3223 423 : if( FD_LIKELY( (cur->root & FD_ORD_TXN_ROOT_TAG_MASK)==FD_ORD_TXN_ROOT_PENALTY(0) ) ) {
3224 0 : fd_acct_addr_t const * penalty_acct = ACCT_IDX_TO_PTR( FD_ORD_TXN_ROOT_PENALTY_ACCT_IDX( cur->root ) );
3225 0 : VERIFY_TEST( !memcmp( penalty_acct, pack->penalty_treaps[ k-3UL ].key.b, 32UL ), "transaction in wrong penalty treap" );
3226 0 : }
3227 423 : VERIFY_TEST( cur->expires_at>=pack->expire_before, "treap element expired" );
3228 :
3229 423 : fd_pack_expq_t const * eq = pack->expiration_q + cur->expq_idx;
3230 423 : VERIFY_TEST( eq->txn==cur, "expq inconsistent" );
3231 423 : VERIFY_TEST( eq->expires_at==cur->expires_at, "expq expires_at inconsistent" );
3232 :
3233 423 : FD_PACK_BITSET_DECLARE( complement );
3234 423 : FD_PACK_BITSET_COPY( complement, full );
3235 423 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
3236 1413 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
3237 990 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
3238 :
3239 990 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( bitset_copy, acct, NULL );
3240 990 : VERIFY_TEST( q, "account in transaction missing from bitset mapping" );
3241 990 : VERIFY_TEST( q->ref_cnt>0UL, "account in transaction ref_cnt already 0" );
3242 990 : q->ref_cnt--;
3243 990 : total_references--;
3244 :
3245 990 : FD_PACK_BITSET_CLEAR( bit );
3246 990 : FD_PACK_BITSET_SETN( bit, q->bit );
3247 990 : if( q->bit<FD_PACK_BITSET_MAX ) {
3248 597 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, cur->rw_bitset, cur->rw_bitset ), "missing from rw bitset" );
3249 597 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, cur->w_bitset, cur->w_bitset ), "missing from w bitset" );
3250 597 : }
3251 990 : FD_PACK_BITSET_CLEARN( complement, q->bit );
3252 990 : }
3253 423 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( complement, complement, cur->w_bitset, cur->w_bitset ), "extra in w bitset" );
3254 :
3255 423 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_READONLY );
3256 1836 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
3257 :
3258 1413 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
3259 1413 : if( FD_UNLIKELY( fd_pack_unwritable_contains( &acct ) ) ) continue;
3260 894 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( bitset_copy, acct, NULL );
3261 894 : VERIFY_TEST( q, "account in transaction missing from bitset mapping" );
3262 894 : VERIFY_TEST( q->ref_cnt>0UL, "account in transaction ref_cnt already 0" );
3263 894 : q->ref_cnt--;
3264 894 : total_references--;
3265 :
3266 894 : FD_PACK_BITSET_CLEAR( bit );
3267 894 : FD_PACK_BITSET_SETN( bit, q->bit );
3268 894 : if( q->bit<FD_PACK_BITSET_MAX ) {
3269 879 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, cur->rw_bitset, cur->rw_bitset ), "missing from rw bitset" );
3270 879 : }
3271 894 : FD_PACK_BITSET_CLEARN( complement, q->bit );
3272 894 : }
3273 423 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( complement, complement, cur->rw_bitset, cur->rw_bitset ), "extra in rw bitset" );
3274 423 : }
3275 1305 : }
3276 :
3277 435 : bitset_map_leave( bitset_copy );
3278 435 : VERIFY_TEST( txn_cnt==pack->pending_txn_cnt, "txn_cnt" );
3279 :
3280 435 : VERIFY_TEST( total_references==0UL, "extra references in bitset mapping" );
3281 435 : ulong sig2txn_key_cnt = 0UL;
3282 435 : for( sig2txn_iter_t iter = sig2txn_iter_init( pack->signature_map, pool );
3283 858 : !sig2txn_iter_done( iter, pack->signature_map, pool );
3284 435 : iter = sig2txn_iter_next( iter, pack->signature_map, pool ) ) {
3285 423 : sig2txn_key_cnt++;
3286 423 : }
3287 435 : VERIFY_TEST( txn_cnt==sig2txn_key_cnt, "extra signatures in sig2txn" );
3288 435 : VERIFY_TEST( !sig2txn_verify( pack->signature_map, trp_pool_max( pool ), pool ), "sig2txn corrupt" );
3289 :
3290 : /* Count noncemap keys */
3291 435 : ulong noncemap_key_cnt = 0UL;
3292 435 : for( noncemap_iter_t iter = noncemap_iter_init( pack->noncemap, pool );
3293 483 : !noncemap_iter_done( iter, pack->noncemap, pool );
3294 435 : iter = noncemap_iter_next( iter, pack->noncemap, pool ) ) {
3295 48 : noncemap_key_cnt++;
3296 : /* Ensure element is in pool */
3297 48 : fd_pack_ord_txn_t const * ord = noncemap_iter_ele_const( iter, pack->noncemap, pool );
3298 48 : VERIFY_TEST( ord->txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE, "invalid entry in noncemap" );
3299 :
3300 : /* Although pack allows multiple transactions with the same
3301 : signature in sig2txn (MAP_MULTI==1), the noncemap checks prevent
3302 : multiple nonce transactions with the same signature. */
3303 48 : VERIFY_TEST( ord==sig2txn_ele_query_const( pack->signature_map, &ord->_txn_e, NULL, pool ), "noncemap and sig2txn desynced" );
3304 48 : }
3305 435 : VERIFY_TEST( txn_cnt>=noncemap_key_cnt, "phantom txns in noncemap" );
3306 435 : VERIFY_TEST( !noncemap_verify( pack->noncemap, trp_pool_max( pool ), pool ), "noncemap corrupt" );
3307 :
3308 435 : ulong slots_found = 0UL;
3309 435 : ulong const pool_max = trp_pool_max( pool );
3310 459492 : for( ulong i=0UL; i<pool_max; i++ ) {
3311 459057 : fd_pack_ord_txn_t * ord = pack->pool + i;
3312 459057 : if( ord->root!=FD_ORD_TXN_ROOT_FREE ) slots_found++;
3313 459057 : }
3314 435 : VERIFY_TEST( slots_found==txn_cnt, "phantom slots in pool" );
3315 :
3316 435 : bitset_map_join( _bitset_map_orig );
3317 :
3318 435 : int lg_uses_tbl_sz = acct_uses_lg_slot_cnt( pack->acct_in_use );
3319 :
3320 435 : void * _acct_in_use_copy = scratch;
3321 435 : void * _acct_in_use_orig = acct_uses_leave( pack->acct_in_use );
3322 435 : fd_memcpy( _acct_in_use_copy, _acct_in_use_orig, acct_uses_footprint( lg_uses_tbl_sz ) );
3323 :
3324 435 : fd_pack_addr_use_t * acct_in_use_copy = acct_uses_join( _acct_in_use_copy );
3325 :
3326 435 : FD_PACK_BITSET_DECLARE( w_complement );
3327 435 : FD_PACK_BITSET_DECLARE( rw_complement );
3328 435 : FD_PACK_BITSET_COPY( w_complement, full );
3329 435 : FD_PACK_BITSET_COPY( rw_complement, full );
3330 :
3331 435 : FD_PACK_BITSET_DECLARE( rw_bitset ); FD_PACK_BITSET_COPY( rw_bitset, pack->bitset_rw_in_use );
3332 435 : FD_PACK_BITSET_DECLARE( w_bitset ); FD_PACK_BITSET_COPY( w_bitset, pack->bitset_w_in_use );
3333 :
3334 :
3335 435 : ulong const EMPTY_MASK = ~(FD_PACK_IN_USE_WRITABLE | FD_PACK_IN_USE_BIT_CLEARED);
3336 :
3337 12240 : for( ulong bank=0UL; bank<pack->bank_tile_cnt; bank++ ) {
3338 :
3339 11805 : fd_pack_addr_use_t const * base = pack->use_by_bank[ bank ];
3340 11805 : ulong bank_mask = 1UL << bank;
3341 :
3342 12660 : for( ulong i=0UL; i<pack->use_by_bank_cnt[ bank ]; i++ ) {
3343 855 : fd_pack_addr_use_t * use = acct_uses_query( acct_in_use_copy, base[i].key, NULL );
3344 855 : VERIFY_TEST( use, "acct in use by bank not in acct_in_use, or in uses_by_bank twice" );
3345 :
3346 855 : VERIFY_TEST( use->in_use_by & bank_mask, "acct in uses_by_bank doesn't have corresponding bit set in acct_in_use, or it was in the list twice" );
3347 :
3348 855 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( pack->acct_to_bitset, base[i].key, NULL );
3349 : /* The normal case is that the acct->bit mapping is preserved
3350 : while in use by other transactions in the pending list. This
3351 : might not always happen though. It's okay for the mapping to
3352 : get deleted while the acct is in use, which is noted with
3353 : BIT_CLEARED. If that is set, the mapping may not exist, or it
3354 : may have been re-created, perhaps with a different bit. */
3355 855 : if( q==NULL ) VERIFY_TEST( use->in_use_by & FD_PACK_IN_USE_BIT_CLEARED, "acct in use not in acct_to_bitset, but not marked as cleared" );
3356 0 : else if( !(use->in_use_by & FD_PACK_IN_USE_BIT_CLEARED) ) {
3357 0 : FD_PACK_BITSET_CLEAR( bit );
3358 0 : FD_PACK_BITSET_SETN( bit, q->bit );
3359 0 : if( q->bit<FD_PACK_BITSET_MAX ) {
3360 0 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, rw_bitset, rw_bitset ), "missing from rw bitset" );
3361 0 : if( use->in_use_by & FD_PACK_IN_USE_WRITABLE ) {
3362 0 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, w_bitset, w_bitset ), "missing from w bitset" );
3363 0 : FD_PACK_BITSET_CLEARN( w_complement, q->bit );
3364 0 : }
3365 0 : }
3366 0 : FD_PACK_BITSET_CLEARN( rw_complement, q->bit );
3367 0 : }
3368 855 : if( use->in_use_by & FD_PACK_IN_USE_WRITABLE ) VERIFY_TEST( (use->in_use_by & EMPTY_MASK)==bank_mask, "writable, but in use by multiple" );
3369 :
3370 855 : use->in_use_by &= ~bank_mask;
3371 855 : if( !(use->in_use_by & EMPTY_MASK) ) acct_uses_remove( acct_in_use_copy, use );
3372 855 : }
3373 11805 : }
3374 435 : VERIFY_TEST( acct_uses_key_cnt( acct_in_use_copy )==0UL, "stray uses in acct_in_use" );
3375 435 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( rw_complement, rw_complement, rw_bitset, rw_bitset ), "extra in rw bitset" );
3376 435 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( w_complement, w_complement, w_bitset, w_bitset ), "extra in w bitset" );
3377 :
3378 435 : acct_uses_leave( acct_in_use_copy );
3379 :
3380 435 : acct_uses_join( _acct_in_use_orig );
3381 435 : return 0;
3382 435 : }
3383 :
3384 243 : void * fd_pack_leave ( fd_pack_t * pack ) { FD_COMPILER_MFENCE(); return (void *)pack; }
3385 243 : void * fd_pack_delete( void * mem ) { FD_COMPILER_MFENCE(); return mem; }
|
