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