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