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 21625518 : #define FD_ORD_TXN_ROOT_FREE 0
110 18009638 : #define FD_ORD_TXN_ROOT_PENDING 1
111 13279608 : #define FD_ORD_TXN_ROOT_PENDING_VOTE 2
112 1116 : #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 28437270 : #define FD_PACK_IN_USE_WRITABLE (0x8000000000000000UL)
121 15389583 : #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 1508553 : #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 1491 : #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 2659 : #define FD_PACK_IB_STATE_NOT_INITIALIZED 0
221 9 : #define FD_PACK_IB_STATE_PENDING 1
222 9 : #define FD_PACK_IB_STATE_FAILED 2
223 27 : #define FD_PACK_IB_STATE_READY 3
224 :
225 :
226 : /* Returns 1 if x.rewards/x.compute < y.rewards/y.compute. Not robust. */
227 84606091 : #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 1674 : #define POOL_T fd_pack_ord_txn_t
238 : #define POOL_IDX_T ushort
239 31566840 : #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 180662448 : #define TREAP_IDX_T ushort
248 : #define TREAP_OPTIMIZE_ITERATION 1
249 84606091 : #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 13582962 : #define MAP_ELE_T fd_pack_ord_txn_t
257 36586247 : #define MAP_PREV sigmap_prev
258 35019003 : #define MAP_NEXT sigmap_next
259 13588243 : #define MAP_IDX_T ushort
260 : #define MAP_KEY_T wrapped_sig_t
261 26657455 : #define MAP_KEY sig
262 1088 : #define MAP_KEY_EQ(k0,k1) (!memcmp( (k0),(k1), FD_TXN_SIGNATURE_SZ) )
263 26658529 : #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 4221 : #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 94476809 : #define MAP_T fd_pack_addr_use_t
363 111477074 : #define MAP_KEY_T fd_acct_addr_t
364 347652875 : #define MAP_KEY_NULL null_addr
365 : #if FD_HAS_AVX
366 111477074 : # 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 77454774 : #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 94482894 : #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 52428638 : #define MAP_T fd_pack_bitset_acct_mapping_t
379 65768289 : #define MAP_KEY_T fd_acct_addr_t
380 1377300677 : #define MAP_KEY_NULL null_addr
381 : #if FD_HAS_AVX
382 1655049057 : # 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 39125601 : #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 52455688 : #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 32839600 : #define PRQ_T fd_pack_expq_t
401 27154257 : #define PRQ_TIMEOUT_T ulong
402 27154257 : #define PRQ_TIMEOUT expires_at
403 15896009 : #define PRQ_TMP_ST(p,t) do { \
404 15896009 : (p)[0] = (t); \
405 15896009 : t.txn->expq_idx = (ulong)((p)-heap); \
406 15896009 : } 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 4239520 : #define MAP_T fd_pack_penalty_treap_t
455 4241304 : #define MAP_KEY_T fd_acct_addr_t
456 21315285 : #define MAP_KEY_NULL null_addr
457 : #if FD_HAS_AVX
458 29073816 : # 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 4235502 : #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 4238401 : #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 29535405 : #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 13587790 : #define FD_PACK_SKIP_CNT 50UL
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 ulong 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 375 : fd_pack_limits_t const * limits ) {
691 375 : if( FD_UNLIKELY( (bank_tile_cnt==0) | (bank_tile_cnt>FD_PACK_MAX_BANK_TILES) ) ) return 0UL;
692 375 : if( FD_UNLIKELY( pack_depth<4UL ) ) return 0UL;
693 :
694 375 : int enable_bundles = !!bundle_meta_sz;
695 375 : ulong l;
696 375 : 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 375 : ulong max_acct_in_treap = pack_depth * FD_TXN_ACCT_ADDR_MAX;
698 375 : ulong max_txn_per_mblk = fd_ulong_max( limits->max_txn_per_microblock,
699 375 : fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE, 0UL ) );
700 375 : ulong max_acct_in_flight = bank_tile_cnt * (FD_TXN_ACCT_ADDR_MAX * max_txn_per_mblk + 1UL);
701 375 : ulong max_txn_in_flight = bank_tile_cnt * max_txn_per_mblk;
702 :
703 375 : ulong max_w_per_block = fd_ulong_min( limits->max_cost_per_block / FD_PACK_COST_PER_WRITABLE_ACCT,
704 375 : max_txn_per_mblk * limits->max_microblocks_per_block * FD_TXN_ACCT_ADDR_MAX );
705 375 : ulong written_list_max = fd_ulong_min( max_w_per_block>>1, DEFAULT_WRITTEN_LIST_MAX );
706 375 : ulong bundle_temp_accts = fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE*FD_TXN_ACCT_ADDR_MAX, 1UL );
707 375 : ulong sig_chain_cnt = sig2txn_chain_cnt_est( pack_depth );
708 375 : 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 375 : int lg_uses_tbl_sz = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_flight ) );
712 375 : int lg_max_writers = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_w_per_block ) );
713 375 : int lg_acct_in_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap ) );
714 375 : int lg_penalty_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap/PENALTY_TREAP_THRESHOLD ) );
715 375 : int lg_bundle_temp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*bundle_temp_accts ) );
716 :
717 375 : l = FD_LAYOUT_INIT;
718 375 : l = FD_LAYOUT_APPEND( l, FD_PACK_ALIGN, sizeof(fd_pack_t) );
719 375 : l = FD_LAYOUT_APPEND( l, trp_pool_align (), trp_pool_footprint ( pack_depth+extra_depth ) ); /* pool */
720 375 : l = FD_LAYOUT_APPEND( l, penalty_map_align(), penalty_map_footprint( lg_penalty_trp ) ); /* penalty_treaps */
721 375 : l = FD_LAYOUT_APPEND( l, expq_align (), expq_footprint ( pack_depth ) ); /* expiration prq */
722 375 : l = FD_LAYOUT_APPEND( l, acct_uses_align(), acct_uses_footprint( lg_uses_tbl_sz ) ); /* acct_in_use */
723 375 : l = FD_LAYOUT_APPEND( l, acct_uses_align(), acct_uses_footprint( lg_max_writers ) ); /* writer_costs */
724 375 : l = FD_LAYOUT_APPEND( l, 32UL, sizeof(fd_pack_addr_use_t*)*written_list_max ); /* written_list */
725 375 : l = FD_LAYOUT_APPEND( l, noncemap_align (), noncemap_footprint ( nonce_chain_cnt ) ); /* noncemap */
726 375 : l = FD_LAYOUT_APPEND( l, sig2txn_align (), sig2txn_footprint ( sig_chain_cnt ) ); /* signature_map */
727 375 : l = FD_LAYOUT_APPEND( l, acct_uses_align(), acct_uses_footprint( lg_bundle_temp ) ); /* bundle_temp_map*/
728 375 : l = FD_LAYOUT_APPEND( l, 32UL, sizeof(fd_pack_addr_use_t)*max_acct_in_flight ); /* use_by_bank */
729 375 : l = FD_LAYOUT_APPEND( l, 32UL, sizeof(ulong)*max_txn_in_flight ); /* use_by_bank_txn*/
730 375 : l = FD_LAYOUT_APPEND( l, bitset_map_align(), bitset_map_footprint( lg_acct_in_trp ) ); /* acct_to_bitset */
731 375 : l = FD_LAYOUT_APPEND( l, 64UL, (pack_depth+extra_depth)*bundle_meta_sz ); /* bundle_meta */
732 375 : return FD_LAYOUT_FINI( l, FD_PACK_ALIGN );
733 375 : }
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 558 : fd_rng_t * rng ) {
742 :
743 558 : int enable_bundles = !!bundle_meta_sz;
744 558 : ulong extra_depth = fd_ulong_if( enable_bundles, 1UL+2UL*FD_PACK_MAX_TXN_PER_BUNDLE, 1UL );
745 558 : ulong max_acct_in_treap = pack_depth * FD_TXN_ACCT_ADDR_MAX;
746 558 : ulong max_txn_per_mblk = fd_ulong_max( limits->max_txn_per_microblock,
747 558 : fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE, 0UL ) );
748 558 : ulong max_acct_in_flight = bank_tile_cnt * (FD_TXN_ACCT_ADDR_MAX * max_txn_per_mblk + 1UL);
749 558 : ulong max_txn_in_flight = bank_tile_cnt * max_txn_per_mblk;
750 :
751 558 : ulong max_w_per_block = fd_ulong_min( limits->max_cost_per_block / FD_PACK_COST_PER_WRITABLE_ACCT,
752 558 : max_txn_per_mblk * limits->max_microblocks_per_block * FD_TXN_ACCT_ADDR_MAX );
753 558 : ulong written_list_max = fd_ulong_min( max_w_per_block>>1, DEFAULT_WRITTEN_LIST_MAX );
754 558 : ulong bundle_temp_accts = fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE*FD_TXN_ACCT_ADDR_MAX, 1UL );
755 558 : ulong sig_chain_cnt = sig2txn_chain_cnt_est( pack_depth );
756 558 : 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 558 : int lg_uses_tbl_sz = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_flight ) );
760 558 : int lg_max_writers = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_w_per_block ) );
761 558 : int lg_acct_in_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap ) );
762 558 : int lg_penalty_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap/PENALTY_TREAP_THRESHOLD ) );
763 558 : int lg_bundle_temp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*bundle_temp_accts ) );
764 :
765 558 : FD_SCRATCH_ALLOC_INIT( l, mem );
766 558 : 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 558 : void * _pool = FD_SCRATCH_ALLOC_APPEND( l, trp_pool_align(), trp_pool_footprint ( pack_depth+extra_depth ) );
770 558 : void * _penalty_map = FD_SCRATCH_ALLOC_APPEND( l, penalty_map_align(), penalty_map_footprint( lg_penalty_trp ) );
771 558 : void * _expq = FD_SCRATCH_ALLOC_APPEND( l, expq_align(), expq_footprint ( pack_depth ) );
772 558 : void * _uses = FD_SCRATCH_ALLOC_APPEND( l, acct_uses_align(), acct_uses_footprint( lg_uses_tbl_sz ) );
773 558 : void * _writer_cost = FD_SCRATCH_ALLOC_APPEND( l, acct_uses_align(), acct_uses_footprint( lg_max_writers ) );
774 558 : void * _written_lst = FD_SCRATCH_ALLOC_APPEND( l, 32UL, sizeof(fd_pack_addr_use_t*)*written_list_max );
775 558 : void * _noncemap = FD_SCRATCH_ALLOC_APPEND( l, noncemap_align(), noncemap_footprint ( nonce_chain_cnt ) );
776 558 : void * _sig_map = FD_SCRATCH_ALLOC_APPEND( l, sig2txn_align(), sig2txn_footprint ( sig_chain_cnt ) );
777 558 : void * _bundle_temp = FD_SCRATCH_ALLOC_APPEND( l, acct_uses_align(), acct_uses_footprint( lg_bundle_temp ) );
778 558 : void * _use_by_bank = FD_SCRATCH_ALLOC_APPEND( l, 32UL, sizeof(fd_pack_addr_use_t)*max_acct_in_flight );
779 558 : void * _use_by_txn = FD_SCRATCH_ALLOC_APPEND( l, 32UL, sizeof(ulong)*max_txn_in_flight );
780 558 : void * _acct_bitset = FD_SCRATCH_ALLOC_APPEND( l, bitset_map_align(), bitset_map_footprint( lg_acct_in_trp ) );
781 558 : 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 558 : pack->bundle_meta_sz = bundle_meta_sz;
785 558 : pack->bank_tile_cnt = bank_tile_cnt;
786 558 : pack->lim[0] = *limits;
787 558 : pack->pending_txn_cnt = 0UL;
788 558 : pack->microblock_cnt = 0UL;
789 558 : pack->data_bytes_consumed = 0UL;
790 558 : pack->rng = rng;
791 558 : pack->cumulative_block_cost = 0UL;
792 558 : pack->cumulative_vote_cost = 0UL;
793 558 : pack->expire_before = 0UL;
794 558 : pack->outstanding_microblock_mask = 0UL;
795 558 : pack->cumulative_rebated_cus = 0UL;
796 :
797 :
798 558 : trp_pool_new( _pool, pack_depth+extra_depth );
799 :
800 558 : fd_pack_ord_txn_t * pool = trp_pool_join( _pool );
801 558 : treap_seed( pool, pack_depth+extra_depth, fd_rng_ulong( rng ) );
802 4152228 : for( ulong i=0UL; i<pack_depth+extra_depth; i++ ) pool[i].root = FD_ORD_TXN_ROOT_FREE;
803 :
804 558 : (void)trp_pool_leave( pool );
805 :
806 558 : 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 558 : treap_new( (void*)pack->pending, pack_depth+extra_depth );
811 558 : treap_new( (void*)pack->pending_votes, pack_depth+extra_depth );
812 558 : treap_new( (void*)pack->pending_bundles, pack_depth+extra_depth );
813 :
814 558 : pack->pending_smallest->cus = ULONG_MAX;
815 558 : pack->pending_smallest->bytes = ULONG_MAX;
816 558 : pack->pending_votes_smallest->cus = ULONG_MAX;
817 558 : pack->pending_votes_smallest->bytes = ULONG_MAX;
818 :
819 558 : expq_new( _expq, pack_depth );
820 :
821 558 : FD_PACK_BITSET_CLEAR( pack->bitset_rw_in_use );
822 558 : FD_PACK_BITSET_CLEAR( pack->bitset_w_in_use );
823 :
824 558 : acct_uses_new( _uses, lg_uses_tbl_sz );
825 558 : acct_uses_new( _writer_cost, lg_max_writers );
826 558 : acct_uses_new( _bundle_temp, lg_bundle_temp );
827 :
828 558 : pack->written_list = _written_lst;
829 558 : pack->written_list_cnt = 0UL;
830 558 : pack->written_list_max = written_list_max;
831 :
832 558 : noncemap_new( _noncemap, nonce_chain_cnt, fd_rng_ulong( rng ) );
833 :
834 558 : sig2txn_new( _sig_map, sig_chain_cnt, fd_rng_ulong( rng ) );
835 :
836 558 : fd_pack_addr_use_t * use_by_bank = (fd_pack_addr_use_t *)_use_by_bank;
837 558 : ulong * use_by_bank_txn = (ulong *)_use_by_txn;
838 6843 : for( ulong i=0UL; i<bank_tile_cnt; i++ ) {
839 6285 : pack->use_by_bank [i] = use_by_bank + i*(FD_TXN_ACCT_ADDR_MAX*max_txn_per_mblk+1UL);
840 6285 : pack->use_by_bank_cnt[i] = 0UL;
841 6285 : pack->use_by_bank_txn[i] = use_by_bank_txn + i*max_txn_per_mblk;
842 6285 : pack->use_by_bank_txn[i][0] = 0UL;
843 6285 : }
844 28869 : for( ulong i=bank_tile_cnt; i<FD_PACK_MAX_BANK_TILES; i++ ) {
845 28311 : pack->use_by_bank [i] = NULL;
846 28311 : pack->use_by_bank_cnt[i] = 0UL;
847 28311 : pack->use_by_bank_txn[i] = NULL;
848 28311 : }
849 :
850 558 : fd_histf_new( pack->txn_per_microblock, FD_MHIST_MIN( PACK, TOTAL_TRANSACTIONS_PER_MICROBLOCK_COUNT ),
851 558 : FD_MHIST_MAX( PACK, TOTAL_TRANSACTIONS_PER_MICROBLOCK_COUNT ) );
852 558 : fd_histf_new( pack->vote_per_microblock, FD_MHIST_MIN( PACK, VOTES_PER_MICROBLOCK_COUNT ),
853 558 : FD_MHIST_MAX( PACK, VOTES_PER_MICROBLOCK_COUNT ) );
854 :
855 558 : fd_histf_new( pack->scheduled_cus_per_block, FD_MHIST_MIN( PACK, CUS_SCHEDULED ),
856 558 : FD_MHIST_MAX( PACK, CUS_SCHEDULED ) );
857 558 : fd_histf_new( pack->rebated_cus_per_block, FD_MHIST_MIN( PACK, CUS_REBATED ),
858 558 : FD_MHIST_MAX( PACK, CUS_REBATED ) );
859 558 : fd_histf_new( pack->net_cus_per_block, FD_MHIST_MIN( PACK, CUS_NET ),
860 558 : FD_MHIST_MAX( PACK, CUS_NET ) );
861 558 : fd_histf_new( pack->pct_cus_per_block, FD_MHIST_MIN( PACK, CUS_PCT ),
862 558 : FD_MHIST_MAX( PACK, CUS_PCT ) );
863 :
864 558 : pack->compressed_slot_number = (ushort)(FD_PACK_SKIP_CNT+1);
865 :
866 558 : pack->bitset_avail[ 0 ] = FD_PACK_BITSET_SLOWPATH;
867 191022 : for( ulong i=0UL; i<FD_PACK_BITSET_MAX; i++ ) pack->bitset_avail[ i+1UL ] = (ushort)i;
868 558 : pack->bitset_avail_cnt = FD_PACK_BITSET_MAX;
869 :
870 558 : bitset_map_new( _acct_bitset, lg_acct_in_trp );
871 :
872 558 : fd_chkdup_new( pack->chkdup, rng );
873 :
874 558 : pack->bundle_meta = bundle_meta;
875 :
876 558 : return mem;
877 558 : }
878 :
879 : fd_pack_t *
880 558 : fd_pack_join( void * mem ) {
881 558 : FD_SCRATCH_ALLOC_INIT( l, mem );
882 558 : 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 558 : ulong pack_depth = pack->pack_depth;
886 558 : ulong extra_depth = fd_ulong_if( enable_bundles, 1UL+2UL*FD_PACK_MAX_TXN_PER_BUNDLE, 1UL );
887 558 : ulong bank_tile_cnt = pack->bank_tile_cnt;
888 558 : ulong max_txn_per_microblock = fd_ulong_max( pack->lim->max_txn_per_microblock,
889 558 : fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE, 0UL ) );
890 :
891 558 : ulong max_acct_in_treap = pack_depth * FD_TXN_ACCT_ADDR_MAX;
892 558 : ulong max_acct_in_flight = bank_tile_cnt * (FD_TXN_ACCT_ADDR_MAX * max_txn_per_microblock + 1UL);
893 558 : ulong max_txn_in_flight = bank_tile_cnt * max_txn_per_microblock;
894 558 : ulong max_w_per_block = fd_ulong_min( pack->lim->max_cost_per_block / FD_PACK_COST_PER_WRITABLE_ACCT,
895 558 : max_txn_per_microblock * pack->lim->max_microblocks_per_block * FD_TXN_ACCT_ADDR_MAX );
896 558 : ulong written_list_max = fd_ulong_min( max_w_per_block>>1, DEFAULT_WRITTEN_LIST_MAX );
897 558 : ulong bundle_temp_accts = fd_ulong_if( enable_bundles, FD_PACK_MAX_TXN_PER_BUNDLE*FD_TXN_ACCT_ADDR_MAX, 1UL );
898 558 : ulong sig_chain_cnt = sig2txn_chain_cnt_est( pack_depth );
899 558 : ulong nonce_chain_cnt = noncemap_chain_cnt_est( pack_depth );
900 :
901 558 : int lg_uses_tbl_sz = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_flight ) );
902 558 : int lg_max_writers = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_w_per_block ) );
903 558 : int lg_acct_in_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap ) );
904 558 : int lg_penalty_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap/PENALTY_TREAP_THRESHOLD ) );
905 558 : int lg_bundle_temp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*bundle_temp_accts ) );
906 :
907 :
908 558 : pack->pool = trp_pool_join( FD_SCRATCH_ALLOC_APPEND( l, trp_pool_align(), trp_pool_footprint ( pack_depth+extra_depth ) ) );
909 558 : pack->penalty_treaps= penalty_map_join(FD_SCRATCH_ALLOC_APPEND( l, penalty_map_align(),penalty_map_footprint( lg_penalty_trp ) ) );
910 558 : pack->expiration_q = expq_join ( FD_SCRATCH_ALLOC_APPEND( l, expq_align(), expq_footprint ( pack_depth ) ) );
911 558 : pack->acct_in_use = acct_uses_join( FD_SCRATCH_ALLOC_APPEND( l, acct_uses_align(), acct_uses_footprint ( lg_uses_tbl_sz ) ) );
912 558 : pack->writer_costs = acct_uses_join( FD_SCRATCH_ALLOC_APPEND( l, acct_uses_align(), acct_uses_footprint ( lg_max_writers ) ) );
913 558 : /* */ FD_SCRATCH_ALLOC_APPEND( l, 32UL, sizeof(fd_pack_addr_use_t*)*written_list_max );
914 558 : pack->noncemap = noncemap_join( FD_SCRATCH_ALLOC_APPEND( l, noncemap_align(), noncemap_footprint ( nonce_chain_cnt ) ) );
915 558 : pack->signature_map = sig2txn_join( FD_SCRATCH_ALLOC_APPEND( l, sig2txn_align(), sig2txn_footprint ( sig_chain_cnt ) ) );
916 558 : pack->bundle_temp_map=acct_uses_join( FD_SCRATCH_ALLOC_APPEND( l, acct_uses_align(), acct_uses_footprint ( lg_bundle_temp ) ) );
917 558 : /* */ FD_SCRATCH_ALLOC_APPEND( l, 32UL, sizeof(fd_pack_addr_use_t)*max_acct_in_flight );
918 558 : /* */ FD_SCRATCH_ALLOC_APPEND( l, 32UL, sizeof(ulong)*max_txn_in_flight );
919 558 : pack->acct_to_bitset= bitset_map_join( FD_SCRATCH_ALLOC_APPEND( l, bitset_map_align(), bitset_map_footprint( lg_acct_in_trp ) ) );
920 558 : /* */ FD_SCRATCH_ALLOC_APPEND( l, 64UL, (pack_depth+extra_depth)*pack->bundle_meta_sz );
921 :
922 558 : FD_MGAUGE_SET( PACK, PENDING_TRANSACTIONS_HEAP_SIZE, pack->pack_depth );
923 558 : return pack;
924 558 : }
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 13586322 : fd_pack_ord_txn_t * out ) {
932 13586322 : fd_txn_t * txn = TXN(txne->txnp);
933 13586322 : ulong sig_rewards = FD_PACK_FEE_PER_SIGNATURE * txn->signature_cnt; /* Easily in [5000, 635000] */
934 :
935 13586322 : ulong requested_execution_cus;
936 13586322 : ulong priority_rewards;
937 13586322 : ulong precompile_sigs;
938 13586322 : ulong requested_loaded_accounts_data_cost;
939 13586322 : 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 13586322 : if( FD_UNLIKELY( !cost_estimate ) ) return 0;
942 :
943 : /* precompile_sigs <= 16320, so after the addition,
944 : sig_rewards < 83,000,000 */
945 13586319 : sig_rewards += FD_PACK_FEE_PER_SIGNATURE * precompile_sigs;
946 13586319 : 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 13586319 : out->rewards = (priority_rewards < (UINT_MAX - sig_rewards)) ? (uint)(sig_rewards + priority_rewards) : UINT_MAX;
955 13586319 : out->compute_est = (uint)cost_estimate;
956 13586319 : out->txn->pack_cu.requested_exec_plus_acct_data_cus = (uint)(requested_execution_cus + requested_loaded_accounts_data_cost);
957 13586319 : out->txn->pack_cu.non_execution_cus = (uint)(cost_estimate - requested_execution_cus - requested_loaded_accounts_data_cost);
958 :
959 13586319 : return fd_int_if( txne->txnp->flags & FD_TXN_P_FLAGS_IS_SIMPLE_VOTE, 1, 2 );
960 13586322 : }
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 13586319 : fd_pack_validate_durable_nonce( fd_txn_e_t * txne ) {
968 13586319 : 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 13586319 : if( FD_UNLIKELY( txn->instr_cnt==0 ) ) return 1;
978 1421199 : if( FD_UNLIKELY( txn->instr[ 0 ].data_sz<4UL ) ) return 1;
979 1421199 : 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 13586313 : ulong price /* in lamports */) {
999 13586313 : (void)acct_addr;
1000 13586313 : (void)price;
1001 13586313 : return 1;
1002 13586313 : }
1003 :
1004 :
1005 :
1006 :
1007 :
1008 13707096 : fd_txn_e_t * fd_pack_insert_txn_init( fd_pack_t * pack ) { return trp_pool_ele_acquire( pack->pool )->txn_e; }
1009 122406 : 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 71690754 : #define ACCT_ITER_TO_PTR( iter ) (__extension__( { \
1022 71690754 : ulong __idx = fd_txn_acct_iter_idx( iter ); \
1023 71690754 : fd_ptr_if( __idx<fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM ), accts, alt_adj )+__idx; \
1024 71690754 : }))
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 : initiates a delete and returns the number of deleted transactions
1030 : (potentially more than 1 for a bundle). If it's higher than
1031 : threshold_score, it returns 0. To force this function to delete the
1032 : worst transaction if there are any eligible ones, pass FLT_MAX as
1033 : threshold_score. */
1034 : static inline ulong
1035 : delete_worst( fd_pack_t * pack,
1036 : float threshold_score,
1037 494601 : int is_vote ) {
1038 : /* If the tree is full, we want to see if this is better than the
1039 : worst element in the pool before inserting. If the new transaction
1040 : is better than that one, we'll delete it and insert the new
1041 : transaction. Otherwise, we'll throw away this transaction.
1042 :
1043 : We want to bias the definition of "worst" here to provide better
1044 : quality of service. For example, if the pool is filled with
1045 : transactions that all write to the same account or are all votes,
1046 : we want to bias towards treating one of those transactions as the
1047 : worst, even if they pay slightly higher fees per computer unit,
1048 : since we know we won't actually be able to schedule them all.
1049 :
1050 : This is a tricky task, however. All our notions of priority and
1051 : better/worse are based on static information about the transaction,
1052 : and there's not an easy way to take into account global
1053 : information, for example, how many other transactions contend with
1054 : this one. One idea is to build a heap (not a treap, since we only
1055 : need pop-min, insert, and delete) with one element for each element
1056 : in the pool, with a "delete me" score that's related but not
1057 : identical to the normal score. This would allow building in some
1058 : global information. The downside is that the global information
1059 : that gets integrated is static. E.g. if you bias a transaction's
1060 : "delete me" score to make it more likely to be deleted because
1061 : there are many conflicting transactions in the pool, the score
1062 : stays biased, even if the global conditions change (unless you come
1063 : up with some complicated re-scoring scheme). This can work, since
1064 : when the pool is full, the global bias factors are unlikely to
1065 : change significantly at the relevant timescales.
1066 :
1067 : However, rather than this, we implement a simpler probabilistic
1068 : scheme. We'll sample M transactions, find the worst transaction in
1069 : each of the M treaps, compute a "delete me" score for those <= M
1070 : transactions, and delete the worst. If one penalty treap is
1071 : starting to get big, then it becomes very likely that the random
1072 : sample will find it and choose to delete a transaction from it.
1073 :
1074 : The exact formula for the "delete me" score should be the matter of
1075 : some more intense quantitative research. For now, we'll just use
1076 : this:
1077 :
1078 : Treap with N transactions Scale Factor
1079 : Pending 1.0 unless inserting a vote and votes < 25%
1080 : Pending votes 1.0 until 75% of depth, then 0
1081 : Penalty treap 1.0 at <= 100 transactions, then sqrt(100/N)
1082 : Pending bundles inf (since the rewards value is fudged)
1083 :
1084 : We'll also use M=8. */
1085 :
1086 494601 : float worst_score = FLT_MAX;
1087 494601 : fd_pack_ord_txn_t * worst = NULL;
1088 4451409 : for( ulong i=0UL; i<8UL; i++ ) {
1089 3956808 : uint pool_max = (uint)trp_pool_max( pack->pool );
1090 3956808 : ulong sample_i = fd_rng_uint_roll( pack->rng, pool_max );
1091 :
1092 3956808 : fd_pack_ord_txn_t * sample = &pack->pool[ sample_i ];
1093 : /* Presumably if we're calling this, the pool is almost entirely
1094 : full, so the probability of choosing a free one is small. If
1095 : it does happen, find the first one that isn't free. */
1096 3959093 : while( FD_UNLIKELY( sample->root==FD_ORD_TXN_ROOT_FREE ) ) sample = &pack->pool[ (++sample_i)%pool_max ];
1097 :
1098 3956808 : int root_idx = sample->root;
1099 3956808 : float multiplier = 0.0f; /* The smaller this is, the more biased we'll be to deleting it */
1100 3956808 : treap_t * treap;
1101 3956808 : switch( root_idx & FD_ORD_TXN_ROOT_TAG_MASK ) {
1102 0 : default:
1103 0 : case FD_ORD_TXN_ROOT_FREE: {
1104 0 : FD_LOG_CRIT(( "Double free detected" ));
1105 0 : return ULONG_MAX; /* Can't be hit */
1106 0 : }
1107 3935441 : case FD_ORD_TXN_ROOT_PENDING: {
1108 3935441 : treap = pack->pending;
1109 3935441 : ulong vote_cnt = treap_ele_cnt( pack->pending_votes );
1110 3935441 : if( FD_LIKELY( !is_vote || (vote_cnt>=pack->pack_depth/4UL ) ) ) multiplier = 1.0f;
1111 3935441 : break;
1112 0 : }
1113 0 : case FD_ORD_TXN_ROOT_PENDING_VOTE: {
1114 0 : treap = pack->pending_votes;
1115 0 : ulong vote_cnt = treap_ele_cnt( pack->pending_votes );
1116 0 : if( FD_LIKELY( is_vote || (vote_cnt<=3UL*pack->pack_depth/4UL ) ) ) multiplier = 1.0f;
1117 0 : break;
1118 0 : }
1119 0 : case FD_ORD_TXN_ROOT_PENDING_BUNDLE: {
1120 : /* We don't have a way to tell how much these actually pay in
1121 : rewards, so we just assume they are very high. */
1122 0 : treap = pack->pending_bundles;
1123 : /* We cap rewards at UINT_MAX lamports for estimation, and min
1124 : CUs is about 1000, which means rewards/compute < 5e6.
1125 : FLT_MAX is around 3e38. That means, 1e20*rewards/compute is
1126 : much less than FLT_MAX, so we won't have any issues with
1127 : overflow. On the other hand, if rewards==1 lamport and
1128 : compute is 2 million CUs, 1e20*1/2e6 is still higher than any
1129 : normal transaction. */
1130 0 : multiplier = 1e20f;
1131 0 : break;
1132 0 : }
1133 21367 : case FD_ORD_TXN_ROOT_PENALTY( 0 ): {
1134 21367 : fd_txn_t * txn = TXN( sample->txn );
1135 21367 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, sample->txn->payload );
1136 21367 : fd_acct_addr_t const * alt_adj = sample->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1137 21367 : fd_acct_addr_t penalty_acct = *ACCT_IDX_TO_PTR( FD_ORD_TXN_ROOT_PENALTY_ACCT_IDX( root_idx ) );
1138 21367 : fd_pack_penalty_treap_t * q = penalty_map_query( pack->penalty_treaps, penalty_acct, NULL );
1139 21367 : FD_TEST( q );
1140 21367 : ulong cnt = treap_ele_cnt( q->penalty_treap );
1141 21367 : treap = q->penalty_treap;
1142 :
1143 21367 : multiplier = sqrtf( 100.0f / (float)fd_ulong_max( 100UL, cnt ) );
1144 21367 : break;
1145 21367 : }
1146 3956808 : }
1147 : /* Get the worst from the sampled treap */
1148 3956808 : treap_fwd_iter_t _cur=treap_fwd_iter_init( treap, pack->pool );
1149 3956808 : FD_TEST( !treap_fwd_iter_done( _cur ) ); /* It can't be empty because we just sampled an element from it. */
1150 3956808 : sample = treap_fwd_iter_ele( _cur, pack->pool );
1151 :
1152 3956808 : float score = multiplier * (float)sample->rewards / (float)sample->compute_est;
1153 3956808 : worst = fd_ptr_if( score<worst_score, sample, worst );
1154 3956808 : worst_score = fd_float_if( worst_score<score, worst_score, score );
1155 3956808 : }
1156 :
1157 494601 : if( FD_UNLIKELY( !worst ) ) return 0;
1158 494601 : if( FD_UNLIKELY( threshold_score<worst_score ) ) return 0;
1159 :
1160 494601 : return delete_transaction( pack, worst, 1, 1 );
1161 494601 : }
1162 :
1163 : static inline int
1164 : validate_transaction( fd_pack_t * pack,
1165 : fd_pack_ord_txn_t const * ord,
1166 : fd_txn_t const * txn,
1167 : fd_acct_addr_t const * accts,
1168 : fd_acct_addr_t const * alt_adj,
1169 13586313 : int check_bundle_blacklist ) {
1170 13586313 : int writes_to_sysvar = 0;
1171 13586313 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
1172 28357920 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
1173 14771607 : writes_to_sysvar |= fd_pack_unwritable_contains( ACCT_ITER_TO_PTR( iter ) );
1174 14771607 : }
1175 :
1176 13586313 : int bundle_blacklist = 0;
1177 13586313 : if( FD_UNLIKELY( check_bundle_blacklist ) ) {
1178 70974 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_ALL );
1179 463503 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
1180 392529 : bundle_blacklist |= (3==fd_pack_tip_prog_check_blacklist( ACCT_ITER_TO_PTR( iter ) ));
1181 392529 : }
1182 70974 : }
1183 :
1184 13586313 : fd_acct_addr_t const * alt = ord->txn_e->alt_accts;
1185 13586313 : fd_chkdup_t * chkdup = pack->chkdup;
1186 13586313 : ulong imm_cnt = fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1187 13586313 : ulong alt_cnt = fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_ALT );
1188 :
1189 : /* Throw out transactions ... */
1190 : /* ... that are unfunded */
1191 13586313 : if( FD_UNLIKELY( !fd_pack_can_fee_payer_afford( accts, ord->rewards ) ) ) return FD_PACK_INSERT_REJECT_UNAFFORDABLE;
1192 : /* ... that are so big they'll never run */
1193 13586313 : if( FD_UNLIKELY( ord->compute_est >= pack->lim->max_cost_per_block ) ) return FD_PACK_INSERT_REJECT_TOO_LARGE;
1194 : /* ... that load too many accounts (ignoring 9LZdXeKGeBV6hRLdxS1rHbHoEUsKqesCC2ZAPTPKJAbK) */
1195 13586313 : if( FD_UNLIKELY( fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_ALL )>64UL ) ) return FD_PACK_INSERT_REJECT_ACCOUNT_CNT;
1196 : /* ... that duplicate an account address */
1197 13586310 : if( FD_UNLIKELY( fd_chkdup_check( chkdup, accts, imm_cnt, alt, alt_cnt ) ) ) return FD_PACK_INSERT_REJECT_DUPLICATE_ACCT;
1198 : /* ... that try to write to a sysvar */
1199 13586307 : if( FD_UNLIKELY( writes_to_sysvar ) ) return FD_PACK_INSERT_REJECT_WRITES_SYSVAR;
1200 : /* ... that use an account that violates bundle rules */
1201 13586214 : if( FD_UNLIKELY( bundle_blacklist & 1 ) ) return FD_PACK_INSERT_REJECT_BUNDLE_BLACKLIST;
1202 :
1203 13586214 : return 0;
1204 13586214 : }
1205 :
1206 :
1207 :
1208 : /* returns cumulative penalty "points", i.e. the sum of the populated
1209 : section of penalties (which also tells the caller how much of the
1210 : array is populated. */
1211 : static inline ulong
1212 : populate_bitsets( fd_pack_t * pack,
1213 : fd_pack_ord_txn_t * ord,
1214 : ushort penalties [ static FD_TXN_ACCT_ADDR_MAX ],
1215 13585164 : uchar penalty_idx[ static FD_TXN_ACCT_ADDR_MAX ] ) {
1216 13585164 : FD_PACK_BITSET_CLEAR( ord->rw_bitset );
1217 13585164 : FD_PACK_BITSET_CLEAR( ord->w_bitset );
1218 :
1219 13585164 : fd_txn_t * txn = TXN(ord->txn);
1220 13585164 : uchar * payload = ord->txn->payload;
1221 :
1222 13585164 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, payload );
1223 : /* alt_adj is the pointer to the ALT expansion, adjusted so that if
1224 : account address n is the first that comes from the ALT, it can be
1225 : accessed with adj_lut[n]. */
1226 13585164 : fd_acct_addr_t const * alt_adj = ord->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1227 :
1228 13585164 : ulong cumulative_penalty = 0UL;
1229 13585164 : ulong penalty_i = 0UL;
1230 :
1231 13585164 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
1232 28352121 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
1233 14766957 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
1234 14766957 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( pack->acct_to_bitset, acct, NULL );
1235 14766957 : if( FD_UNLIKELY( q==NULL ) ) {
1236 13277342 : q = bitset_map_insert( pack->acct_to_bitset, acct );
1237 13277342 : q->ref_cnt = 0UL;
1238 13277342 : q->first_instance = ord;
1239 13277342 : q->first_instance_was_write = 1;
1240 13277342 : q->bit = FD_PACK_BITSET_FIRST_INSTANCE;
1241 13277342 : } else if( FD_UNLIKELY( q->bit == FD_PACK_BITSET_FIRST_INSTANCE ) ) {
1242 7399 : q->bit = pack->bitset_avail[ pack->bitset_avail_cnt ];
1243 7399 : pack->bitset_avail_cnt = fd_ulong_if( !!pack->bitset_avail_cnt, pack->bitset_avail_cnt-1UL, 0UL );
1244 :
1245 7399 : FD_PACK_BITSET_SETN( q->first_instance->rw_bitset, q->bit );
1246 7399 : if( q->first_instance_was_write ) FD_PACK_BITSET_SETN( q->first_instance->w_bitset, q->bit );
1247 7399 : }
1248 14766957 : ulong penalty = fd_ulong_max( q->ref_cnt, PENALTY_TREAP_THRESHOLD )-PENALTY_TREAP_THRESHOLD;
1249 14766957 : if( FD_UNLIKELY( penalty ) ) {
1250 1212867 : penalties [ penalty_i ] = (ushort)penalty;
1251 1212867 : penalty_idx[ penalty_i ] = (uchar )fd_txn_acct_iter_idx( iter );
1252 1212867 : penalty_i++;
1253 1212867 : cumulative_penalty += penalty;
1254 1212867 : }
1255 :
1256 14766957 : q->ref_cnt++;
1257 14766957 : FD_PACK_BITSET_SETN( ord->rw_bitset, q->bit );
1258 14766957 : FD_PACK_BITSET_SETN( ord->w_bitset , q->bit );
1259 14766957 : }
1260 :
1261 13585164 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_READONLY );
1262 18170178 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
1263 :
1264 4585014 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
1265 4585014 : if( FD_UNLIKELY( fd_pack_unwritable_contains( &acct ) ) ) continue;
1266 :
1267 3088449 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( pack->acct_to_bitset, acct, NULL );
1268 3088449 : if( FD_UNLIKELY( q==NULL ) ) {
1269 30096 : q = bitset_map_insert( pack->acct_to_bitset, acct );
1270 30096 : q->ref_cnt = 0UL;
1271 30096 : q->first_instance = ord;
1272 30096 : q->first_instance_was_write = 0;
1273 30096 : q->bit = FD_PACK_BITSET_FIRST_INSTANCE;
1274 3058353 : } else if( FD_UNLIKELY( q->bit == FD_PACK_BITSET_FIRST_INSTANCE ) ) {
1275 11130 : q->bit = pack->bitset_avail[ pack->bitset_avail_cnt ];
1276 11130 : pack->bitset_avail_cnt = fd_ulong_if( !!pack->bitset_avail_cnt, pack->bitset_avail_cnt-1UL, 0UL );
1277 :
1278 11130 : FD_PACK_BITSET_SETN( q->first_instance->rw_bitset, q->bit );
1279 11130 : if( q->first_instance_was_write ) FD_PACK_BITSET_SETN( q->first_instance->w_bitset, q->bit );
1280 11130 : }
1281 :
1282 3088449 : q->ref_cnt++;
1283 3088449 : FD_PACK_BITSET_SETN( ord->rw_bitset, q->bit );
1284 3088449 : }
1285 13585164 : return cumulative_penalty;
1286 13585164 : }
1287 :
1288 : int
1289 : fd_pack_insert_txn_fini( fd_pack_t * pack,
1290 : fd_txn_e_t * txne,
1291 : ulong expires_at,
1292 13584690 : ulong * delete_cnt ) {
1293 :
1294 13584690 : fd_pack_ord_txn_t * ord = (fd_pack_ord_txn_t *)txne;
1295 :
1296 13584690 : fd_txn_t * txn = TXN(txne->txnp);
1297 13584690 : uchar * payload = txne->txnp->payload;
1298 :
1299 13584690 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, payload );
1300 : /* alt_adj is the pointer to the ALT expansion, adjusted so that if
1301 : account address n is the first that comes from the ALT, it can be
1302 : accessed with adj_lut[n]. */
1303 13584690 : fd_acct_addr_t const * alt_adj = ord->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1304 :
1305 13584690 : ord->expires_at = expires_at;
1306 :
1307 13584690 : int est_result = fd_pack_estimate_rewards_and_compute( txne, ord );
1308 13584690 : if( FD_UNLIKELY( !est_result ) ) REJECT( ESTIMATION_FAIL );
1309 13584687 : int is_vote = est_result==1;
1310 :
1311 13584687 : int nonce_result = fd_pack_validate_durable_nonce( txne );
1312 13584687 : if( FD_UNLIKELY( !nonce_result ) ) REJECT( INVALID_NONCE );
1313 13584684 : int is_durable_nonce = nonce_result==2;
1314 13584684 : ord->txn->flags &= ~FD_TXN_P_FLAGS_DURABLE_NONCE;
1315 13584684 : ord->txn->flags |= fd_uint_if( is_durable_nonce, FD_TXN_P_FLAGS_DURABLE_NONCE, 0U );
1316 :
1317 13584684 : int validation_result = validate_transaction( pack, ord, txn, accts, alt_adj, !!pack->bundle_meta_sz );
1318 13584684 : if( FD_UNLIKELY( validation_result ) ) {
1319 99 : trp_pool_ele_release( pack->pool, ord );
1320 99 : return validation_result;
1321 99 : }
1322 :
1323 : /* Reject any transactions that have already expired */
1324 13584585 : if( FD_UNLIKELY( expires_at<pack->expire_before ) ) REJECT( EXPIRED );
1325 :
1326 13584573 : int replaces = 0;
1327 13584573 : *delete_cnt = 0UL;
1328 : /* If it's a durable nonce and we already have one, delete one or the
1329 : other. */
1330 13584573 : if( FD_UNLIKELY( is_durable_nonce ) ) {
1331 120 : fd_pack_ord_txn_t * same_nonce = noncemap_ele_query( pack->noncemap, txne, NULL, pack->pool );
1332 120 : if( FD_LIKELY( same_nonce ) ) { /* Seems like most nonce transactions are effectively duplicates */
1333 9 : if( FD_LIKELY( same_nonce->root == FD_ORD_TXN_ROOT_PENDING_BUNDLE || COMPARE_WORSE( ord, same_nonce ) ) ) REJECT( NONCE_PRIORITY );
1334 3 : ulong _delete_cnt = delete_transaction( pack, same_nonce, 0, 0 ); /* Not a bundle, so delete_full_bundle is 0 */
1335 3 : *delete_cnt += _delete_cnt;
1336 3 : replaces = 1;
1337 3 : }
1338 120 : }
1339 :
1340 13584567 : if( FD_UNLIKELY( pack->pending_txn_cnt == pack->pack_depth ) ) {
1341 494592 : float threshold_score = (float)ord->rewards/(float)ord->compute_est;
1342 494592 : ulong _delete_cnt = delete_worst( pack, threshold_score, is_vote );
1343 494592 : *delete_cnt += _delete_cnt;
1344 494592 : if( FD_UNLIKELY( !_delete_cnt ) ) REJECT( PRIORITY );
1345 494592 : replaces = 1;
1346 494592 : }
1347 :
1348 13584567 : ord->txn->flags &= ~(FD_TXN_P_FLAGS_BUNDLE | FD_TXN_P_FLAGS_INITIALIZER_BUNDLE);
1349 13584567 : ord->skip = FD_PACK_SKIP_CNT;
1350 :
1351 : /* At this point, we know we have space to insert the transaction and
1352 : we've committed to insert it. */
1353 :
1354 : /* Since the pool uses ushorts, the size of the pool is < USHORT_MAX.
1355 : Each transaction can reference an account at most once, which means
1356 : that the total number of references for an account is < USHORT_MAX.
1357 : If these were ulongs, the array would be 512B, which is kind of a
1358 : lot to zero out.*/
1359 13584567 : ushort penalties[ FD_TXN_ACCT_ADDR_MAX ] = {0};
1360 13584567 : uchar penalty_idx[ FD_TXN_ACCT_ADDR_MAX ];
1361 13584567 : ulong cumulative_penalty = populate_bitsets( pack, ord, penalties, penalty_idx );
1362 :
1363 13584567 : treap_t * insert_into = pack->pending;
1364 :
1365 13584567 : if( FD_UNLIKELY( cumulative_penalty && !is_vote ) ) { /* Optimize for high parallelism case */
1366 : /* Compute a weighted random choice */
1367 304959 : ulong roll = (ulong)fd_rng_uint_roll( pack->rng, (uint)cumulative_penalty ); /* cumulative_penalty < USHORT_MAX*64 < UINT_MAX */
1368 304959 : ulong i = 0UL;
1369 : /* Find the right one. This can be done in O(log N), but I imagine
1370 : N is normally so small that doesn't matter. */
1371 758568 : while( roll>=penalties[i] ) roll -= (ulong)penalties[i++];
1372 :
1373 304959 : fd_acct_addr_t penalty_acct = *ACCT_IDX_TO_PTR( penalty_idx[i] );
1374 304959 : fd_pack_penalty_treap_t * q = penalty_map_query( pack->penalty_treaps, penalty_acct, NULL );
1375 304959 : if( FD_UNLIKELY( q==NULL ) ) {
1376 2901 : q = penalty_map_insert( pack->penalty_treaps, penalty_acct );
1377 2901 : treap_new( q->penalty_treap, pack->pack_depth );
1378 2901 : }
1379 304959 : insert_into = q->penalty_treap;
1380 304959 : ord->root = FD_ORD_TXN_ROOT_PENALTY( penalty_idx[i] );
1381 13279608 : } else {
1382 13279608 : ord->root = fd_int_if( is_vote, FD_ORD_TXN_ROOT_PENDING_VOTE, FD_ORD_TXN_ROOT_PENDING );
1383 :
1384 13279608 : fd_pack_smallest_t * smallest = fd_ptr_if( is_vote, &pack->pending_votes_smallest[0], pack->pending_smallest );
1385 13279608 : smallest->cus = fd_ulong_min( smallest->cus, ord->compute_est );
1386 13279608 : smallest->bytes = fd_ulong_min( smallest->bytes, txne->txnp->payload_sz );
1387 13279608 : }
1388 :
1389 13584567 : pack->pending_txn_cnt++;
1390 :
1391 13584567 : sig2txn_ele_insert( pack->signature_map, ord, pack->pool );
1392 :
1393 13584567 : if( FD_UNLIKELY( is_durable_nonce ) ) noncemap_ele_insert( pack->noncemap, ord, pack->pool );
1394 :
1395 13584567 : fd_pack_expq_t temp[ 1 ] = {{ .expires_at = expires_at, .txn = ord }};
1396 13584567 : expq_insert( pack->expiration_q, temp );
1397 :
1398 13584567 : if( FD_LIKELY( is_vote ) ) insert_into = pack->pending_votes;
1399 :
1400 13584567 : treap_ele_insert( insert_into, ord, pack->pool );
1401 13584567 : return (is_vote) | (replaces<<1) | (is_durable_nonce<<2);
1402 13584567 : }
1403 : #undef REJECT
1404 :
1405 : fd_txn_e_t * const *
1406 : fd_pack_insert_bundle_init( fd_pack_t * pack,
1407 : fd_txn_e_t * * bundle,
1408 408 : ulong txn_cnt ) {
1409 408 : FD_TEST( txn_cnt<=FD_PACK_MAX_TXN_PER_BUNDLE );
1410 408 : FD_TEST( trp_pool_free( pack->pool )>=txn_cnt );
1411 2076 : for( ulong i=0UL; i<txn_cnt; i++ ) bundle[ i ] = trp_pool_ele_acquire( pack->pool )->txn_e;
1412 408 : return bundle;
1413 408 : }
1414 :
1415 : void
1416 : fd_pack_insert_bundle_cancel( fd_pack_t * pack,
1417 : fd_txn_e_t * const * bundle,
1418 258 : ulong txn_cnt ) {
1419 : /* There's no real reason these have to be released in reverse, but it
1420 : seems fitting to release them in the opposite order they were
1421 : acquired. */
1422 1329 : for( ulong i=0UL; i<txn_cnt; i++ ) trp_pool_ele_release( pack->pool, (fd_pack_ord_txn_t*)bundle[ txn_cnt-1UL-i ] );
1423 258 : }
1424 :
1425 : /* Explained below */
1426 : #define BUNDLE_L_PRIME 37896771UL
1427 : #define BUNDLE_N 312671UL
1428 207 : #define RC_TO_REL_BUNDLE_IDX( r, c ) (BUNDLE_N - ((ulong)(r) * 1UL<<32)/((ulong)(c) * BUNDLE_L_PRIME))
1429 :
1430 : int
1431 : fd_pack_insert_bundle_fini( fd_pack_t * pack,
1432 : fd_txn_e_t * const * bundle,
1433 : ulong txn_cnt,
1434 : ulong expires_at,
1435 : int initializer_bundle,
1436 : void const * bundle_meta,
1437 396 : ulong * delete_cnt ) {
1438 :
1439 396 : int err = 0;
1440 396 : *delete_cnt = 0UL;
1441 :
1442 396 : ulong pending_b_txn_cnt = treap_ele_cnt( pack->pending_bundles );
1443 : /* We want to prevent bundles from consuming the whole treap, but in
1444 : general, we assume bundles are lucrative. We'll set the policy
1445 : on capping bundles at half of the pack depth. We assume that the
1446 : bundles are coming in a pre-prioritized order, so it doesn't make
1447 : sense to drop an earlier bundle for this one. That means that
1448 : really, the best thing to do is drop this one. */
1449 396 : if( FD_UNLIKELY( (!initializer_bundle)&(pending_b_txn_cnt+txn_cnt>pack->pack_depth/2UL) ) ) err = FD_PACK_INSERT_REJECT_PRIORITY;
1450 :
1451 396 : if( FD_UNLIKELY( expires_at<pack->expire_before ) ) err = FD_PACK_INSERT_REJECT_EXPIRED;
1452 :
1453 :
1454 396 : int replaces = 0;
1455 396 : ulong nonce_txn_cnt = 0UL;
1456 :
1457 : /* Collect nonce hashes to detect duplicate nonces.
1458 : Use a constant-time duplicate-detection algorithm -- Vacant entries
1459 : have the MSB set, occupied entries are the noncemap hash, with the
1460 : MSB set to 0. */
1461 396 : ulong nonce_hash63[ FD_PACK_MAX_TXN_PER_BUNDLE ];
1462 2376 : for( ulong i=0UL; i<FD_PACK_MAX_TXN_PER_BUNDLE; i++ ) {
1463 1980 : nonce_hash63[ i ] = ULONG_MAX-i;
1464 1980 : }
1465 :
1466 2025 : for( ulong i=0UL; (i<txn_cnt) && !err; i++ ) {
1467 1632 : fd_pack_ord_txn_t * ord = (fd_pack_ord_txn_t *)bundle[ i ];
1468 :
1469 1632 : fd_txn_t const * txn = TXN(bundle[ i ]->txnp);
1470 1632 : uchar const * payload = bundle[ i ]->txnp->payload;
1471 :
1472 1632 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, payload );
1473 1632 : fd_acct_addr_t const * alt_adj = ord->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1474 :
1475 1632 : int est_result = fd_pack_estimate_rewards_and_compute( bundle[ i ], ord );
1476 1632 : if( FD_UNLIKELY( !est_result ) ) { err = FD_PACK_INSERT_REJECT_ESTIMATION_FAIL; break; }
1477 1632 : int nonce_result = fd_pack_validate_durable_nonce( ord->txn_e );
1478 1632 : if( FD_UNLIKELY( !nonce_result ) ) { err = FD_PACK_INSERT_REJECT_INVALID_NONCE; break; }
1479 1632 : int is_durable_nonce = nonce_result==2;
1480 1632 : nonce_txn_cnt += !!is_durable_nonce;
1481 :
1482 1632 : bundle[ i ]->txnp->flags |= FD_TXN_P_FLAGS_BUNDLE;
1483 1632 : bundle[ i ]->txnp->flags &= ~(FD_TXN_P_FLAGS_INITIALIZER_BUNDLE | FD_TXN_P_FLAGS_DURABLE_NONCE);
1484 1632 : bundle[ i ]->txnp->flags |= fd_uint_if( initializer_bundle, FD_TXN_P_FLAGS_INITIALIZER_BUNDLE, 0U );
1485 1632 : bundle[ i ]->txnp->flags |= fd_uint_if( is_durable_nonce, FD_TXN_P_FLAGS_DURABLE_NONCE, 0U );
1486 1632 : ord->expires_at = expires_at;
1487 :
1488 1632 : if( FD_UNLIKELY( is_durable_nonce ) ) {
1489 1032 : nonce_hash63[ i ] = noncemap_key_hash( ord->txn_e, pack->noncemap->seed ) & 0x7FFFFFFFFFFFFFFFUL;
1490 1032 : fd_pack_ord_txn_t * same_nonce = noncemap_ele_query( pack->noncemap, ord->txn_e, NULL, pack->pool );
1491 1032 : if( FD_LIKELY( same_nonce ) ) {
1492 : /* bundles take priority over non-bundles, and earlier bundles
1493 : take priority over later bundles. */
1494 6 : if( FD_UNLIKELY( same_nonce->txn->flags & FD_TXN_P_FLAGS_BUNDLE ) ) {
1495 3 : err = FD_PACK_INSERT_REJECT_NONCE_PRIORITY;
1496 3 : break;
1497 3 : } else {
1498 3 : ulong _delete_cnt = delete_transaction( pack, same_nonce, 0, 0 );
1499 3 : *delete_cnt += _delete_cnt;
1500 3 : replaces = 1;
1501 3 : }
1502 6 : }
1503 1032 : }
1504 :
1505 1629 : int validation_result = validate_transaction( pack, ord, txn, accts, alt_adj, !initializer_bundle );
1506 1629 : if( FD_UNLIKELY( validation_result ) ) { err = validation_result; break; }
1507 1629 : }
1508 :
1509 396 : if( FD_UNLIKELY( err ) ) {
1510 3 : fd_pack_insert_bundle_cancel( pack, bundle, txn_cnt );
1511 3 : return err;
1512 3 : }
1513 :
1514 393 : if( FD_UNLIKELY( initializer_bundle && pending_b_txn_cnt>0UL ) ) {
1515 9 : treap_rev_iter_t _cur=treap_rev_iter_init( pack->pending_bundles, pack->pool );
1516 9 : FD_TEST( !treap_rev_iter_done( _cur ) );
1517 9 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pack->pool );
1518 9 : int is_ib = !!(cur->txn->flags & FD_TXN_P_FLAGS_INITIALIZER_BUNDLE);
1519 :
1520 : /* Delete the previous IB if there is one */
1521 9 : if( FD_UNLIKELY( is_ib && 0UL==RC_TO_REL_BUNDLE_IDX( cur->rewards, cur->compute_est ) ) ) {
1522 0 : ulong _delete_cnt = delete_transaction( pack, cur, 1, 0 );
1523 0 : *delete_cnt += _delete_cnt;
1524 0 : }
1525 9 : }
1526 :
1527 402 : while( FD_UNLIKELY( pack->pending_txn_cnt+txn_cnt > pack->pack_depth ) ) {
1528 9 : ulong _delete_cnt = delete_worst( pack, FLT_MAX, 0 );
1529 9 : *delete_cnt += _delete_cnt;
1530 9 : if( FD_UNLIKELY( !_delete_cnt ) ) {
1531 0 : fd_pack_insert_bundle_cancel( pack, bundle, txn_cnt );
1532 0 : return FD_PACK_INSERT_REJECT_PRIORITY;
1533 0 : }
1534 9 : replaces = 1;
1535 9 : }
1536 :
1537 393 : if( FD_UNLIKELY( !pending_b_txn_cnt ) ) {
1538 384 : pack->relative_bundle_idx = 1UL;
1539 384 : }
1540 :
1541 393 : if( FD_LIKELY( bundle_meta ) ) {
1542 9 : 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 );
1543 9 : }
1544 :
1545 393 : if( FD_UNLIKELY( nonce_txn_cnt>1UL ) ) {
1546 : /* Do a ILP-friendly duplicate detect, naive O(n^2) algo. With max
1547 : 5 txns per bundle, this requires 10 comparisons. ~ 25 cycle. */
1548 375 : uint conflict_detected = 0u;
1549 1875 : for( ulong i=0UL; i<FD_PACK_MAX_TXN_PER_BUNDLE-1; i++ ) {
1550 5250 : for( ulong j=i+1; j<FD_PACK_MAX_TXN_PER_BUNDLE; j++ ) {
1551 3750 : ulong const ele_i = nonce_hash63[ i ];
1552 3750 : ulong const ele_j = nonce_hash63[ j ];
1553 3750 : conflict_detected |= (ele_i==ele_j);
1554 3750 : }
1555 1500 : }
1556 375 : if( FD_UNLIKELY( conflict_detected ) ) {
1557 243 : fd_pack_insert_bundle_cancel( pack, bundle, txn_cnt );
1558 243 : return FD_PACK_INSERT_REJECT_NONCE_CONFLICT;
1559 243 : }
1560 375 : }
1561 :
1562 : /* We put bundles in a treap just like all the other transactions, but
1563 : we actually want to sort them in a very specific order; the order
1564 : within the bundle is determined at bundle creation time, and the
1565 : order among the bundles is FIFO. However, it's going to be a pain
1566 : to use a different sorting function for this treap, since it's
1567 : fixed as part of the treap creation for performance. Don't fear
1568 : though; we can pull a cool math trick out of the bag to shoehorn
1569 : the order we'd like into the sort function we need, and to get even
1570 : more.
1571 :
1572 : Recall that the sort function is r_i/c_i, smallest to largest,
1573 : where r_i is the rewards and c_i is the cost units. r_i and c_i
1574 : are both uints, and the comparison is done by cross-multiplication
1575 : as ulongs. We actually use the c_i value for testing if
1576 : transactions fit, etc. so let's assume that's fixed, and we know
1577 : it's in the range [1020, 1,556,782].
1578 :
1579 : This means, if c_0, c_1, ... c_4 are the CU costs of the
1580 : transactions in the first bundle, we require r_0/c_0 > r_1/c_1 >
1581 : ... > r_4/c_4. Then, if c_5, ... c_9 are the CU costs of the
1582 : transactions in the second bundle, we also require that r_4/c_4 >
1583 : r_5/c_5. For convenience, we'll impose a slightly stronger
1584 : constraint: we want the kth bundle to obey L*(N-k) <= r_i/c_i <
1585 : L*(N+1-k), for fixed constants L and N, real and integer,
1586 : respectively, that we'll determine. For example, this means r_4/c_4
1587 : >= L*N > r_5/c_5. This enables us to group the transactions in the
1588 : same bundle more easily.
1589 :
1590 : For convenience in the math below, we'll set j=N-k and relabel the
1591 : transactions from the jth bundle c_0, ... c_4.
1592 : From above, we know that Lj <= r_4/c_4. We'd like to make it as
1593 : close as possible given that r_4 is an integers. Thus, put
1594 : r_4 = ceil( c_4 * Lj ). r_4 is clearly an integer, and it satisfies
1595 : the required inequality because:
1596 : r_4/c_4 = ceil( c_4 * Lj)/c_4 >= c_4*Lj / c_4 >= Lj.
1597 :
1598 : Following in the same spirit, put r_3 = ceil( c_3 * (r_4+1)/c_4 ).
1599 : Again, r_3 is clearly an integer, and
1600 : r_3/c_3 = ceil(c_3*(r_4+1)/c_4)/c_3
1601 : >= (c_3*(r_4+1))/(c_3 * c_4)
1602 : >= r_4/c_4 + 1/c_4
1603 : > r_4/c_4.
1604 : Following the pattern, we put
1605 : r_2 = ceil( c_2 * (r_3+1)/c_3 )
1606 : r_1 = ceil( c_1 * (r_2+1)/c_2 )
1607 : r_0 = ceil( c_0 * (r_1+1)/c_1 )
1608 : which work for the same reason that as r_3.
1609 :
1610 : We now need for r_0 to satisfy the final inequality with L, and
1611 : we'll use this to guide our choice of L. Theoretically, r_0 can be
1612 : expressed in terms of L, j, and c_0, ... c_4, but that's a truly
1613 : inscrutible expression. Instead, we need some bounds so we can get
1614 : rid of all the ceil using the property that x <= ceil(x) < x+1.
1615 : c_4 * Lj <= r_4 < c_4 * Lj + 1
1616 : The lower bound on r_3 is easy:
1617 : r_3 >= c_3 * (c_4 * Lj + 1)/c_4 = c_3 * Lj + c_3/c_4
1618 : For the upper bound,
1619 : r_3 < 1 + c_3*(r_4+1)/c_4 < 1 + c_3*(c_4*Lj+1 + 1)/c_4
1620 : = 1 + c_3 * Lj + 2*c_3/c_4
1621 : Continuing similarly gives
1622 : c_2*Lj + c_2/c_3 + c_2/c_4 <= r_2
1623 : c_1*Lj + c_1/c_2 + c_1/c_c + c_1/c_4 <= r_1
1624 : c_0*Lj + c_0/c_1 + c_0/c_2 + c_0/c_3 + c_0/c_4 <= r_0
1625 : and
1626 : r_2 < 1 + c_2*Lj + 2c_2/c_3 + 2c_2/c_4
1627 : r_1 < 1 + c_1*Lj + 2c_1/c_2 + 2c_1/c_3 + 2c_1/c_4
1628 : r_0 < 1 + c_0*Lj + 2c_0/c_1 + 2c_0/c_2 + 2c_0/c_3 + 2c_0/c_4.
1629 :
1630 : 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
1631 : is then sufficient to ensure the whole sequence of 5 fits between Lj
1632 : and L(j+1). Simplifying gives
1633 : L<= 1/c_0 + 2/c_1 + 2/c_2 + 2/c_3 + 2/c_4
1634 : but L must be a constant and not depend on individual values of c_i,
1635 : so, given that c_i >= 1020, we set L = 9/1020.
1636 :
1637 : Now all that remains is to determine N. It's a bit unfortunate
1638 : that we require N, since it limits our capacity, but it's necessary
1639 : in any system that tries to compute priorities to enforce a FIFO
1640 : order. If we've inserted more than N bundles without ever having
1641 : the bundle treap go empty, we'll briefly break the FIFO ordering as
1642 : we underflow.
1643 :
1644 : Thus, we'd like to make N as big as possible, avoiding overflow.
1645 : r_0, ..., r_4 are all uints, and taking the bounds from above,
1646 : given that for any i, i' c_i/c_{i'} < 1527, we have
1647 : r_i < 1 + 1556782 * Lj + 8*1527.
1648 : To avoid overflow, we assert the right-hand side is < 2^32, which
1649 : implies N <= 312671.
1650 :
1651 : We want to use a fixed point representation for L so that the
1652 : entire computation can be done with integer arithmetic. We can do
1653 : the arithmetic as ulongs, which means defining L' >= L * 2^s, and
1654 : we compute ceil( c_4*Lj ) as floor( (c_4 * L' * j + 2^s - 1)/2^s ),
1655 : so c_4 * L' * j + 2^s should fit in a ulong. With j<=N, this gives
1656 : s<=32, so we set s=32, which means L' = 37896771 >= 9/1020 * 2^32.
1657 : Note that 1 + 1556782 * L' * N + 8*1527 + 2^32 is approximately
1658 : 2^63.999993.
1659 :
1660 : Note that this is all checked by a proof of the code translated
1661 : into Z3. Unfortunately CBMC was too slow to prove this code
1662 : directly. */
1663 357 : #define BUNDLE_L_PRIME 37896771UL
1664 357 : #define BUNDLE_N 312671UL
1665 :
1666 150 : if( FD_UNLIKELY( pack->relative_bundle_idx>BUNDLE_N ) ) {
1667 0 : FD_LOG_WARNING(( "Too many bundles inserted without allowing pending bundles to go empty. "
1668 0 : "Ordering of bundles may be incorrect." ));
1669 0 : pack->relative_bundle_idx = 1UL;
1670 0 : }
1671 150 : ulong bundle_idx = fd_ulong_if( initializer_bundle, 0UL, pack->relative_bundle_idx );
1672 150 : insert_bundle_impl( pack, bundle_idx, txn_cnt, (fd_pack_ord_txn_t * *)bundle, expires_at );
1673 : /* if IB this is max( 1, x ), which is x. Otherwise, this is max(x,
1674 : x+1) which is x++ */
1675 150 : pack->relative_bundle_idx = fd_ulong_max( bundle_idx+1UL, pack->relative_bundle_idx );
1676 :
1677 150 : return (0) | (replaces<<1) | ((!!nonce_txn_cnt)<<2);
1678 393 : }
1679 : static inline void
1680 : insert_bundle_impl( fd_pack_t * pack,
1681 : ulong bundle_idx,
1682 : ulong txn_cnt,
1683 : fd_pack_ord_txn_t * * bundle,
1684 150 : ulong expires_at ) {
1685 150 : ulong prev_reward = ((BUNDLE_L_PRIME * (BUNDLE_N - bundle_idx))) - 1UL;
1686 150 : ulong prev_cost = 1UL<<32;
1687 :
1688 : /* Assign last to first */
1689 747 : for( ulong i=0UL; i<txn_cnt; i++ ) {
1690 597 : fd_pack_ord_txn_t * ord = bundle[ txn_cnt-1UL - i ];
1691 597 : ord->rewards = (uint)(((ulong)ord->compute_est * (prev_reward + 1UL) + prev_cost-1UL)/prev_cost);
1692 597 : ord->root = FD_ORD_TXN_ROOT_PENDING_BUNDLE;
1693 597 : prev_reward = ord->rewards;
1694 597 : prev_cost = ord->compute_est;
1695 :
1696 : /* The penalty information isn't used for bundles. */
1697 597 : ushort penalties [ FD_TXN_ACCT_ADDR_MAX ];
1698 597 : uchar penalty_idx[ FD_TXN_ACCT_ADDR_MAX ];
1699 597 : populate_bitsets( pack, ord, penalties, penalty_idx );
1700 :
1701 597 : treap_ele_insert( pack->pending_bundles, ord, pack->pool );
1702 597 : pack->pending_txn_cnt++;
1703 :
1704 597 : if( FD_UNLIKELY( ord->txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE ) ) noncemap_ele_insert( pack->noncemap, ord, pack->pool );
1705 597 : sig2txn_ele_insert( pack->signature_map, ord, pack->pool );
1706 :
1707 597 : fd_pack_expq_t temp[ 1 ] = {{ .expires_at = expires_at, .txn = ord }};
1708 597 : expq_insert( pack->expiration_q, temp );
1709 597 : }
1710 :
1711 150 : }
1712 :
1713 : void const *
1714 1320 : fd_pack_peek_bundle_meta( fd_pack_t const * pack ) {
1715 1320 : int ib_state = pack->initializer_bundle_state;
1716 1320 : if( FD_UNLIKELY( (ib_state==FD_PACK_IB_STATE_PENDING) | (ib_state==FD_PACK_IB_STATE_FAILED) ) ) return NULL;
1717 :
1718 1320 : treap_rev_iter_t _cur=treap_rev_iter_init( pack->pending_bundles, pack->pool );
1719 1320 : if( FD_UNLIKELY( treap_rev_iter_done( _cur ) ) ) return NULL; /* empty */
1720 :
1721 15 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pack->pool );
1722 15 : int is_ib = !!(cur->txn->flags & FD_TXN_P_FLAGS_INITIALIZER_BUNDLE);
1723 15 : if( FD_UNLIKELY( is_ib ) ) return NULL;
1724 :
1725 15 : return (void const *)((uchar const *)pack->bundle_meta + (ulong)_cur * pack->bundle_meta_sz);
1726 15 : }
1727 :
1728 : void
1729 9 : fd_pack_set_initializer_bundles_ready( fd_pack_t * pack ) {
1730 9 : pack->initializer_bundle_state = FD_PACK_IB_STATE_READY;
1731 9 : }
1732 :
1733 : void
1734 754212 : fd_pack_metrics_write( fd_pack_t const * pack ) {
1735 754212 : ulong pending_regular = treap_ele_cnt( pack->pending );
1736 754212 : ulong pending_votes = treap_ele_cnt( pack->pending_votes );
1737 754212 : ulong pending_bundle = treap_ele_cnt( pack->pending_bundles );
1738 754212 : ulong conflicting = pack->pending_txn_cnt - pending_votes - pending_bundle - treap_ele_cnt( pack->pending );
1739 754212 : FD_MGAUGE_SET( PACK, AVAILABLE_TRANSACTIONS_ALL, pack->pending_txn_cnt );
1740 754212 : FD_MGAUGE_SET( PACK, AVAILABLE_TRANSACTIONS_REGULAR, pending_regular );
1741 754212 : FD_MGAUGE_SET( PACK, AVAILABLE_TRANSACTIONS_VOTES, pending_votes );
1742 754212 : FD_MGAUGE_SET( PACK, AVAILABLE_TRANSACTIONS_CONFLICTING, conflicting );
1743 754212 : FD_MGAUGE_SET( PACK, AVAILABLE_TRANSACTIONS_BUNDLES, pending_bundle );
1744 754212 : FD_MGAUGE_SET( PACK, SMALLEST_PENDING_TRANSACTION, pack->pending_smallest->cus );
1745 754212 : }
1746 :
1747 : typedef struct {
1748 : ushort clear_rw_bit;
1749 : ushort clear_w_bit;
1750 : } release_result_t;
1751 :
1752 : static inline release_result_t
1753 : release_bit_reference( fd_pack_t * pack,
1754 17848662 : fd_acct_addr_t const * acct ) {
1755 :
1756 17848662 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( pack->acct_to_bitset, *acct, NULL );
1757 17848662 : FD_TEST( q ); /* q==NULL not be possible */
1758 :
1759 17848662 : q->ref_cnt--;
1760 :
1761 17848662 : if( FD_UNLIKELY( q->ref_cnt==0UL ) ) {
1762 13306205 : ushort bit = q->bit;
1763 13306205 : bitset_map_remove( pack->acct_to_bitset, q );
1764 13306205 : if( FD_LIKELY( bit<FD_PACK_BITSET_MAX ) ) pack->bitset_avail[ ++(pack->bitset_avail_cnt) ] = bit;
1765 :
1766 13306205 : fd_pack_addr_use_t * use = acct_uses_query( pack->acct_in_use, *acct, NULL );
1767 13306205 : if( FD_LIKELY( use ) ) {
1768 12810141 : use->in_use_by |= FD_PACK_IN_USE_BIT_CLEARED;
1769 12810141 : release_result_t ret = { .clear_rw_bit = bit,
1770 12810141 : .clear_w_bit = fd_ushort_if( !!(use->in_use_by & FD_PACK_IN_USE_WRITABLE), bit, FD_PACK_BITSET_MAX ) };
1771 12810141 : return ret;
1772 12810141 : }
1773 13306205 : }
1774 5038521 : release_result_t ret = { .clear_rw_bit = FD_PACK_BITSET_MAX, .clear_w_bit = FD_PACK_BITSET_MAX };
1775 5038521 : return ret;
1776 17848662 : }
1777 :
1778 : typedef struct {
1779 : ulong cus_scheduled;
1780 : ulong txns_scheduled;
1781 : ulong bytes_scheduled;
1782 : } sched_return_t;
1783 :
1784 : static inline sched_return_t
1785 : fd_pack_schedule_impl( fd_pack_t * pack,
1786 : treap_t * sched_from,
1787 : ulong cu_limit,
1788 : ulong txn_limit,
1789 : ulong byte_limit,
1790 : ulong bank_tile,
1791 : fd_pack_smallest_t * smallest_in_treap,
1792 : ulong * use_by_bank_txn,
1793 1508346 : fd_txn_p_t * out ) {
1794 :
1795 1508346 : fd_pack_ord_txn_t * pool = pack->pool;
1796 1508346 : fd_pack_addr_use_t * acct_in_use = pack->acct_in_use;
1797 1508346 : fd_pack_addr_use_t * writer_costs = pack->writer_costs;
1798 :
1799 1508346 : fd_pack_addr_use_t ** written_list = pack->written_list;
1800 1508346 : ulong written_list_cnt = pack->written_list_cnt;
1801 1508346 : ulong written_list_max = pack->written_list_max;
1802 :
1803 1508346 : FD_PACK_BITSET_DECLARE( bitset_rw_in_use );
1804 1508346 : FD_PACK_BITSET_DECLARE( bitset_w_in_use );
1805 1508346 : FD_PACK_BITSET_COPY( bitset_rw_in_use, pack->bitset_rw_in_use );
1806 1508346 : FD_PACK_BITSET_COPY( bitset_w_in_use, pack->bitset_w_in_use );
1807 :
1808 1508346 : fd_pack_addr_use_t * use_by_bank = pack->use_by_bank [bank_tile];
1809 1508346 : ulong use_by_bank_cnt = pack->use_by_bank_cnt[bank_tile];
1810 :
1811 1508346 : ulong max_write_cost_per_acct = pack->lim->max_write_cost_per_acct;
1812 :
1813 1508346 : ushort compressed_slot_number = pack->compressed_slot_number;
1814 :
1815 1508346 : ulong txns_scheduled = 0UL;
1816 1508346 : ulong cus_scheduled = 0UL;
1817 1508346 : ulong bytes_scheduled = 0UL;
1818 :
1819 1508346 : ulong bank_tile_mask = 1UL << bank_tile;
1820 :
1821 1508346 : ulong fast_path = 0UL;
1822 1508346 : ulong slow_path = 0UL;
1823 1508346 : ulong cu_limit_c = 0UL;
1824 1508346 : ulong byte_limit_c = 0UL;
1825 1508346 : ulong write_limit_c = 0UL;
1826 1508346 : ulong skip_c = 0UL;
1827 :
1828 1508346 : ulong min_cus = ULONG_MAX;
1829 1508346 : ulong min_bytes = ULONG_MAX;
1830 :
1831 1508346 : if( FD_UNLIKELY( (cu_limit<smallest_in_treap->cus) | (txn_limit==0UL) | (byte_limit<smallest_in_treap->bytes) ) ) {
1832 815496 : sched_return_t to_return = { .cus_scheduled = 0UL, .txns_scheduled = 0UL, .bytes_scheduled = 0UL };
1833 815496 : return to_return;
1834 815496 : }
1835 :
1836 692850 : treap_rev_iter_t prev = treap_idx_null();
1837 23925444 : for( treap_rev_iter_t _cur=treap_rev_iter_init( sched_from, pool ); !treap_rev_iter_done( _cur ); _cur=prev ) {
1838 : /* Capture next so that we can delete while we iterate. */
1839 23840109 : prev = treap_rev_iter_next( _cur, pool );
1840 :
1841 23840109 : # if FD_HAS_X86
1842 23840109 : _mm_prefetch( &(pool[ prev ].prev), _MM_HINT_T0 );
1843 23840109 : # endif
1844 :
1845 23840109 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pool );
1846 :
1847 23840109 : min_cus = fd_ulong_min( min_cus, cur->compute_est );
1848 23840109 : min_bytes = fd_ulong_min( min_bytes, cur->txn->payload_sz );
1849 :
1850 23840109 : ulong conflicts = 0UL;
1851 :
1852 23840109 : if( FD_UNLIKELY( cur->compute_est>cu_limit ) ) {
1853 : /* Too big to be scheduled at the moment, but might be okay for
1854 : the next microblock, so we don't want to delay it. */
1855 0 : cu_limit_c++;
1856 0 : continue;
1857 0 : }
1858 :
1859 : /* Likely? Unlikely? */
1860 23840109 : if( FD_LIKELY( !FD_PACK_BITSET_INTERSECT4_EMPTY( bitset_rw_in_use, bitset_w_in_use, cur->w_bitset, cur->rw_bitset ) ) ) {
1861 10752822 : fast_path++;
1862 10752822 : continue;
1863 10752822 : }
1864 :
1865 13087287 : if( FD_UNLIKELY( cur->skip==compressed_slot_number ) ) {
1866 0 : skip_c++;
1867 0 : continue;
1868 0 : }
1869 :
1870 : /* If skip>FD_PACK_MAX_SKIP but not compressed_slot_number, it means
1871 : it's the compressed slot number of a previous slot. We don't
1872 : care unless we're going to update the value though, so we don't
1873 : need to eagerly reset it to FD_PACK_MAX_SKIP.
1874 : compressed_slot_number is a ushort, so it's possible for it to
1875 : roll over, but the transaction lifetime is much shorter than
1876 : that, so it won't be a problem. */
1877 :
1878 13087287 : if( FD_UNLIKELY( cur->txn->payload_sz>byte_limit ) ) {
1879 6 : byte_limit_c++;
1880 6 : continue;
1881 6 : }
1882 :
1883 :
1884 13087281 : fd_txn_t const * txn = TXN(cur->txn);
1885 13087281 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, cur->txn->payload );
1886 13087281 : fd_acct_addr_t const * alt_adj = cur->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
1887 : /* Check conflicts between this transaction's writable accounts and
1888 : current readers */
1889 13087281 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
1890 27344739 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
1891 :
1892 14257461 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
1893 :
1894 14257461 : fd_pack_addr_use_t * in_wcost_table = acct_uses_query( writer_costs, acct, NULL );
1895 14257461 : if( FD_UNLIKELY( in_wcost_table && in_wcost_table->total_cost+cur->compute_est > max_write_cost_per_acct ) ) {
1896 : /* Can't be scheduled until the next block */
1897 3 : conflicts = ULONG_MAX;
1898 3 : break;
1899 3 : }
1900 :
1901 14257458 : fd_pack_addr_use_t * use = acct_uses_query( acct_in_use, acct, NULL );
1902 14257458 : if( FD_UNLIKELY( use ) ) conflicts |= use->in_use_by; /* break? */
1903 14257458 : }
1904 :
1905 13087281 : if( FD_UNLIKELY( conflicts==ULONG_MAX ) ) {
1906 : /* The logic for how to adjust skip is a bit complicated, and we
1907 : want to do it branchlessly. Let psc=FD_PACK_SKIP_CNT,
1908 : Before After
1909 : 1 compressed_slot_number
1910 : x in [2, psc] x-1
1911 : x where x>psc psc-1
1912 :
1913 : Set A=min(x, 5), B=min(A-2, compressed_slot_number-1), and
1914 : note that compressed_slot_number is in [psc+1, USHORT_MAX].
1915 : Then:
1916 : x A A-2 B B+1
1917 : 1 1 USHORT_MAX csn-1 csn
1918 : x in [2, psc] x x-2 x-2 x-1
1919 : x where x>psc psc psc-2 psc-2 psc-1
1920 : So B+1 is the desired value. */
1921 3 : cur->skip = (ushort)(1+fd_ushort_min( (ushort)(compressed_slot_number-1),
1922 3 : (ushort)(fd_ushort_min( cur->skip, FD_PACK_SKIP_CNT )-2) ) );
1923 3 : write_limit_c++;
1924 3 : continue;
1925 3 : }
1926 :
1927 13087278 : if( FD_UNLIKELY( conflicts ) ) {
1928 6 : slow_path++;
1929 6 : continue;
1930 6 : }
1931 :
1932 : /* Check conflicts between this transaction's readonly accounts and
1933 : current writers */
1934 13087272 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_READONLY );
1935 16662591 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
1936 :
1937 3575319 : fd_acct_addr_t const * acct = ACCT_ITER_TO_PTR( iter );
1938 3575319 : if( fd_pack_unwritable_contains( acct ) ) continue; /* No need to track sysvars because they can't be writable */
1939 :
1940 2578725 : fd_pack_addr_use_t * use = acct_uses_query( acct_in_use, *acct, NULL );
1941 2578725 : if( use ) conflicts |= (use->in_use_by & FD_PACK_IN_USE_WRITABLE) ? use->in_use_by : 0UL;
1942 2578725 : }
1943 :
1944 13087272 : if( FD_UNLIKELY( conflicts ) ) {
1945 0 : slow_path++;
1946 0 : continue;
1947 0 : }
1948 :
1949 : /* Include this transaction in the microblock! */
1950 13087272 : FD_PACK_BITSET_OR( bitset_rw_in_use, cur->rw_bitset );
1951 13087272 : FD_PACK_BITSET_OR( bitset_w_in_use, cur->w_bitset );
1952 :
1953 13087272 : if(
1954 4362424 : #if FD_HAS_AVX512 && FD_PACK_USE_NON_TEMPORAL_MEMCPY
1955 4362424 : FD_LIKELY( cur->txn->payload_sz>=1024UL )
1956 : #else
1957 8724848 : 0
1958 8724848 : #endif
1959 13087272 : ) {
1960 4224 : #if FD_HAS_AVX512 && FD_PACK_USE_NON_TEMPORAL_MEMCPY
1961 4224 : _mm512_stream_si512( (void*)(out->payload+ 0UL), _mm512_load_epi64( cur->txn->payload+ 0UL ) );
1962 4224 : _mm512_stream_si512( (void*)(out->payload+ 64UL), _mm512_load_epi64( cur->txn->payload+ 64UL ) );
1963 4224 : _mm512_stream_si512( (void*)(out->payload+ 128UL), _mm512_load_epi64( cur->txn->payload+ 128UL ) );
1964 4224 : _mm512_stream_si512( (void*)(out->payload+ 192UL), _mm512_load_epi64( cur->txn->payload+ 192UL ) );
1965 4224 : _mm512_stream_si512( (void*)(out->payload+ 256UL), _mm512_load_epi64( cur->txn->payload+ 256UL ) );
1966 4224 : _mm512_stream_si512( (void*)(out->payload+ 320UL), _mm512_load_epi64( cur->txn->payload+ 320UL ) );
1967 4224 : _mm512_stream_si512( (void*)(out->payload+ 384UL), _mm512_load_epi64( cur->txn->payload+ 384UL ) );
1968 4224 : _mm512_stream_si512( (void*)(out->payload+ 448UL), _mm512_load_epi64( cur->txn->payload+ 448UL ) );
1969 4224 : _mm512_stream_si512( (void*)(out->payload+ 512UL), _mm512_load_epi64( cur->txn->payload+ 512UL ) );
1970 4224 : _mm512_stream_si512( (void*)(out->payload+ 576UL), _mm512_load_epi64( cur->txn->payload+ 576UL ) );
1971 4224 : _mm512_stream_si512( (void*)(out->payload+ 640UL), _mm512_load_epi64( cur->txn->payload+ 640UL ) );
1972 4224 : _mm512_stream_si512( (void*)(out->payload+ 704UL), _mm512_load_epi64( cur->txn->payload+ 704UL ) );
1973 4224 : _mm512_stream_si512( (void*)(out->payload+ 768UL), _mm512_load_epi64( cur->txn->payload+ 768UL ) );
1974 4224 : _mm512_stream_si512( (void*)(out->payload+ 832UL), _mm512_load_epi64( cur->txn->payload+ 832UL ) );
1975 4224 : _mm512_stream_si512( (void*)(out->payload+ 896UL), _mm512_load_epi64( cur->txn->payload+ 896UL ) );
1976 4224 : _mm512_stream_si512( (void*)(out->payload+ 960UL), _mm512_load_epi64( cur->txn->payload+ 960UL ) );
1977 4224 : _mm512_stream_si512( (void*)(out->payload+1024UL), _mm512_load_epi64( cur->txn->payload+1024UL ) );
1978 4224 : _mm512_stream_si512( (void*)(out->payload+1088UL), _mm512_load_epi64( cur->txn->payload+1088UL ) );
1979 4224 : _mm512_stream_si512( (void*)(out->payload+1152UL), _mm512_load_epi64( cur->txn->payload+1152UL ) );
1980 4224 : _mm512_stream_si512( (void*)(out->payload+1216UL), _mm512_load_epi64( cur->txn->payload+1216UL ) );
1981 : /* Copied out to 1280 bytes, which copies some other fields we needed to
1982 : copy anyway. */
1983 4224 : FD_STATIC_ASSERT( offsetof(fd_txn_p_t, payload_sz )+sizeof(((fd_txn_p_t*)NULL)->payload_sz )<=1280UL, nt_memcpy );
1984 4224 : FD_STATIC_ASSERT( offsetof(fd_txn_p_t, blockhash_slot )+sizeof(((fd_txn_p_t*)NULL)->blockhash_slot)<=1280UL, nt_memcpy );
1985 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 );
1986 4224 : FD_STATIC_ASSERT( offsetof(fd_txn_p_t, source_tpu )+sizeof(((fd_txn_p_t*)NULL)->source_tpu )<=1280UL, nt_memcpy );
1987 4224 : FD_STATIC_ASSERT( offsetof(fd_txn_p_t, source_ipv4 )+sizeof(((fd_txn_p_t*)NULL)->source_ipv4 )<=1280UL, nt_memcpy );
1988 4224 : FD_STATIC_ASSERT( offsetof(fd_txn_p_t, flags )+sizeof(((fd_txn_p_t*)NULL)->flags )<=1280UL, nt_memcpy );
1989 4224 : FD_STATIC_ASSERT( offsetof(fd_txn_p_t, _ ) <=1280UL, nt_memcpy );
1990 4224 : const ulong offset_into_txn = 1280UL - offsetof(fd_txn_p_t, _ );
1991 4224 : fd_memcpy( offset_into_txn+(uchar *)TXN(out), offset_into_txn+(uchar const *)txn,
1992 4224 : fd_ulong_max( offset_into_txn, fd_txn_footprint( txn->instr_cnt, txn->addr_table_lookup_cnt ) )-offset_into_txn );
1993 4224 : #endif
1994 13083048 : } else {
1995 13083048 : fd_memcpy( out->payload, cur->txn->payload, cur->txn->payload_sz );
1996 13083048 : fd_memcpy( TXN(out), txn, fd_txn_footprint( txn->instr_cnt, txn->addr_table_lookup_cnt ) );
1997 13083048 : out->payload_sz = cur->txn->payload_sz;
1998 13083048 : out->pack_cu.requested_exec_plus_acct_data_cus = cur->txn->pack_cu.requested_exec_plus_acct_data_cus;
1999 13083048 : out->pack_cu.non_execution_cus = cur->txn->pack_cu.non_execution_cus;
2000 13083048 : out->scheduler_arrival_time_nanos = cur->txn->scheduler_arrival_time_nanos;
2001 13083048 : out->source_tpu = cur->txn->source_tpu;
2002 13083048 : out->source_ipv4 = cur->txn->source_ipv4;
2003 13083048 : out->flags = cur->txn->flags;
2004 13083048 : }
2005 13087272 : out++;
2006 :
2007 13087272 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
2008 27344715 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2009 14257443 : fd_acct_addr_t acct_addr = *ACCT_ITER_TO_PTR( iter );
2010 :
2011 14257443 : fd_pack_addr_use_t * in_wcost_table = acct_uses_query( writer_costs, acct_addr, NULL );
2012 14257443 : if( !in_wcost_table ) {
2013 794126 : in_wcost_table = acct_uses_insert( writer_costs, acct_addr );
2014 794126 : in_wcost_table->total_cost = 0UL;
2015 794126 : written_list[ written_list_cnt ] = in_wcost_table;
2016 794126 : written_list_cnt = fd_ulong_min( written_list_cnt+1UL, written_list_max-1UL );
2017 794126 : }
2018 14257443 : in_wcost_table->total_cost += cur->compute_est;
2019 :
2020 14257443 : fd_pack_addr_use_t * use = acct_uses_insert( acct_in_use, acct_addr );
2021 14257443 : use->in_use_by = bank_tile_mask | FD_PACK_IN_USE_WRITABLE;
2022 :
2023 14257443 : use_by_bank[use_by_bank_cnt++] = *use;
2024 :
2025 : /* If there aren't any more references to this account in the
2026 : heap, it can't cause any conflicts. That means we actually
2027 : don't need to record that we are using it, which is good
2028 : because we want to release the bit. */
2029 14257443 : release_result_t ret = release_bit_reference( pack, &acct_addr );
2030 14257443 : FD_PACK_BITSET_CLEARN( bitset_rw_in_use, ret.clear_rw_bit );
2031 14257443 : FD_PACK_BITSET_CLEARN( bitset_w_in_use, ret.clear_w_bit );
2032 14257443 : }
2033 13087272 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_READONLY );
2034 16662591 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2035 :
2036 3575319 : fd_acct_addr_t acct_addr = *ACCT_ITER_TO_PTR( iter );
2037 :
2038 3575319 : if( fd_pack_unwritable_contains( &acct_addr ) ) continue; /* No need to track sysvars because they can't be writable */
2039 :
2040 2578725 : fd_pack_addr_use_t * use = acct_uses_query( acct_in_use, acct_addr, NULL );
2041 2578725 : if( !use ) { use = acct_uses_insert( acct_in_use, acct_addr ); use->in_use_by = 0UL; }
2042 :
2043 2578725 : if( !(use->in_use_by & bank_tile_mask) ) use_by_bank[use_by_bank_cnt++] = *use;
2044 2578725 : use->in_use_by |= bank_tile_mask;
2045 2578725 : use->in_use_by &= ~FD_PACK_IN_USE_BIT_CLEARED;
2046 :
2047 :
2048 2578725 : release_result_t ret = release_bit_reference( pack, &acct_addr );
2049 2578725 : FD_PACK_BITSET_CLEARN( bitset_rw_in_use, ret.clear_rw_bit );
2050 2578725 : FD_PACK_BITSET_CLEARN( bitset_w_in_use, ret.clear_w_bit );
2051 2578725 : }
2052 :
2053 13087272 : txns_scheduled += 1UL; txn_limit -= 1UL;
2054 13087272 : cus_scheduled += cur->compute_est; cu_limit -= cur->compute_est;
2055 13087272 : bytes_scheduled += cur->txn->payload_sz; byte_limit -= cur->txn->payload_sz;
2056 :
2057 13087272 : *(use_by_bank_txn++) = use_by_bank_cnt;
2058 :
2059 13087272 : if( FD_UNLIKELY( cur->txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE ) ) noncemap_ele_remove_fast( pack->noncemap, cur, pack->pool );
2060 13087272 : sig2txn_ele_remove_fast( pack->signature_map, cur, pool );
2061 :
2062 13087272 : cur->root = FD_ORD_TXN_ROOT_FREE;
2063 13087272 : expq_remove( pack->expiration_q, cur->expq_idx );
2064 13087272 : treap_idx_remove( sched_from, _cur, pool );
2065 13087272 : trp_pool_idx_release( pool, _cur );
2066 13087272 : pack->pending_txn_cnt--;
2067 :
2068 13087272 : if( FD_UNLIKELY( (cu_limit<smallest_in_treap->cus) | (txn_limit==0UL) | (byte_limit<smallest_in_treap->bytes) ) ) break;
2069 13087272 : }
2070 :
2071 692850 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_TAKEN, txns_scheduled );
2072 692850 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_CU_LIMIT, cu_limit_c );
2073 692850 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_FAST_PATH, fast_path );
2074 692850 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_BYTE_LIMIT, byte_limit_c );
2075 692850 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_WRITE_COST, write_limit_c );
2076 692850 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_SLOW_PATH, slow_path );
2077 692850 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_DEFER_SKIP, skip_c );
2078 :
2079 : /* If we scanned the whole treap and didn't break early, we now have a
2080 : better estimate of the smallest. */
2081 692850 : if( FD_UNLIKELY( treap_rev_iter_done( prev ) ) ) {
2082 88392 : smallest_in_treap->cus = min_cus;
2083 88392 : smallest_in_treap->bytes = min_bytes;
2084 88392 : }
2085 :
2086 692850 : pack->use_by_bank_cnt[bank_tile] = use_by_bank_cnt;
2087 692850 : FD_PACK_BITSET_COPY( pack->bitset_rw_in_use, bitset_rw_in_use );
2088 692850 : FD_PACK_BITSET_COPY( pack->bitset_w_in_use, bitset_w_in_use );
2089 :
2090 692850 : pack->written_list_cnt = written_list_cnt;
2091 :
2092 692850 : sched_return_t to_return = { .cus_scheduled=cus_scheduled, .txns_scheduled=txns_scheduled, .bytes_scheduled=bytes_scheduled };
2093 692850 : return to_return;
2094 1508346 : }
2095 :
2096 : int
2097 : fd_pack_microblock_complete( fd_pack_t * pack,
2098 754218 : ulong bank_tile ) {
2099 : /* If the account is in use writably, and it's in use by this banking
2100 : tile, then this banking tile must be the sole writer to it, so it's
2101 : always okay to clear the writable bit. */
2102 754218 : ulong clear_mask = ~((1UL<<bank_tile) | FD_PACK_IN_USE_WRITABLE);
2103 :
2104 : /* If nothing outstanding, bail quickly */
2105 754218 : if( FD_UNLIKELY( !(pack->outstanding_microblock_mask & (1UL<<bank_tile)) ) ) return 0;
2106 :
2107 686880 : FD_PACK_BITSET_DECLARE( bitset_rw_in_use );
2108 686880 : FD_PACK_BITSET_DECLARE( bitset_w_in_use );
2109 686880 : FD_PACK_BITSET_COPY( bitset_rw_in_use, pack->bitset_rw_in_use );
2110 686880 : FD_PACK_BITSET_COPY( bitset_w_in_use, pack->bitset_w_in_use );
2111 :
2112 686880 : fd_pack_addr_use_t * base = pack->use_by_bank[bank_tile];
2113 :
2114 686880 : fd_pack_ord_txn_t * best = NULL;
2115 686880 : fd_pack_penalty_treap_t * best_penalty = NULL;
2116 686880 : ulong txn_cnt = 0UL;
2117 :
2118 16901268 : for( ulong i=0UL; i<pack->use_by_bank_cnt[bank_tile]; i++ ) {
2119 16214388 : fd_pack_addr_use_t * use = acct_uses_query( pack->acct_in_use, base[i].key, NULL );
2120 16214388 : FD_TEST( use );
2121 16214388 : use->in_use_by &= clear_mask;
2122 :
2123 : /* In order to properly bound the size of bitset_map, we need to
2124 : release the "reference" to the account when we schedule it.
2125 : However, that poses a bit of a problem here, because by the time
2126 : we complete the microblock, that account could have been assigned
2127 : a different bit in the bitset. The scheduling step tells us if
2128 : that is the case, and if so, we know that the bits in
2129 : bitset_w_in_use and bitset_rw_in_use were already cleared as
2130 : necessary.
2131 :
2132 : Note that it's possible for BIT_CLEARED to be set and then unset
2133 : by later uses, but then the account would be in use on other
2134 : banks, so we wouldn't try to observe the old value. For example:
2135 : Suppose bit 0->account A, bit 1->account B, and we have two
2136 : transactions that read A, B. We schedule a microblock to bank 0,
2137 : taking both transactions, which sets the counts for A, B to 0,
2138 : and releases the bits, clearing bits 0 and 1, and setting
2139 : BIT_CLEARED. Then we get two more transactions that read
2140 : accounts C, D, A, B, and they get assigned 0->C, 1->D, 2->A,
2141 : 3->B. We try to schedule a microblock to bank 1 that takes one
2142 : of those transactions. This unsets BIT_CLEARED for A, B.
2143 : Finally, the first microblock completes. Even though the bitset
2144 : map has the new bits for A and B which are "wrong" compared to
2145 : when the transaction was initially scheduled, those bits have
2146 : already been cleared and reset properly in the bitset as needed.
2147 : A and B will still be in use by bank 1, so we won't clear any
2148 : bits. If, on the other hand, the microblock scheduled to bank 1
2149 : completes first, bits 0 and 1 will be cleared for accounts C and
2150 : D, while bits 2 and 3 will remain set, which is correct. Then
2151 : when bank 0 completes, bits 2 and 3 will be cleared. */
2152 16214388 : if( FD_LIKELY( !use->in_use_by ) ) { /* if in_use_by==0, doesn't include BIT_CLEARED */
2153 3412404 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( pack->acct_to_bitset, base[i].key, NULL );
2154 3412404 : FD_TEST( q );
2155 3412404 : FD_PACK_BITSET_CLEARN( bitset_w_in_use, q->bit );
2156 3412404 : FD_PACK_BITSET_CLEARN( bitset_rw_in_use, q->bit );
2157 :
2158 : /* Because this account is no longer in use, it might be possible
2159 : to schedule a transaction that writes to it. Check its
2160 : penalty treap if it has one, and potentially move it to the
2161 : main treap. */
2162 3412404 : fd_pack_penalty_treap_t * p_trp = penalty_map_query( pack->penalty_treaps, base[i].key, NULL );
2163 3412404 : if( FD_UNLIKELY( p_trp ) ) {
2164 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 );
2165 752813 : if( FD_UNLIKELY( !best || COMPARE_WORSE( best, best_in_trp ) ) ) {
2166 301626 : best = best_in_trp;
2167 301626 : best_penalty = p_trp;
2168 301626 : }
2169 752813 : }
2170 3412404 : }
2171 :
2172 16214388 : if( FD_LIKELY( !(use->in_use_by & ~FD_PACK_IN_USE_BIT_CLEARED) ) ) acct_uses_remove( pack->acct_in_use, use );
2173 :
2174 16214388 : if( FD_UNLIKELY( i+1UL==pack->use_by_bank_txn[ bank_tile ][ txn_cnt ] ) ) {
2175 13083483 : txn_cnt++;
2176 13083483 : if( FD_LIKELY( best ) ) {
2177 : /* move best to the main treap */
2178 301626 : treap_ele_remove( best_penalty->penalty_treap, best, pack->pool );
2179 301626 : best->root = FD_ORD_TXN_ROOT_PENDING;
2180 301626 : treap_ele_insert( pack->pending, best, pack->pool );
2181 :
2182 301626 : pack->pending_smallest->cus = fd_ulong_min( pack->pending_smallest->cus, best->compute_est );
2183 301626 : pack->pending_smallest->bytes = fd_ulong_min( pack->pending_smallest->bytes, best->txn_e->txnp->payload_sz );
2184 :
2185 301626 : if( FD_UNLIKELY( !treap_ele_cnt( best_penalty->penalty_treap ) ) ) {
2186 2892 : treap_delete( treap_leave( best_penalty->penalty_treap ) );
2187 : /* Removal invalidates any pointers we got from
2188 : penalty_map_query, but we immediately set these to NULL, so
2189 : we're not keeping any pointers around. */
2190 2892 : penalty_map_remove( pack->penalty_treaps, best_penalty );
2191 2892 : }
2192 301626 : best = NULL;
2193 301626 : best_penalty = NULL;
2194 301626 : }
2195 13083483 : }
2196 16214388 : }
2197 :
2198 686880 : pack->use_by_bank_cnt[bank_tile] = 0UL;
2199 :
2200 686880 : FD_PACK_BITSET_COPY( pack->bitset_rw_in_use, bitset_rw_in_use );
2201 686880 : FD_PACK_BITSET_COPY( pack->bitset_w_in_use, bitset_w_in_use );
2202 :
2203 : /* outstanding_microblock_mask never has the writable bit set, so we
2204 : don't care about clearing it here either. */
2205 686880 : pack->outstanding_microblock_mask &= clear_mask;
2206 686880 : return 1;
2207 686880 : }
2208 :
2209 753993 : #define TRY_BUNDLE_NO_READY_BUNDLES 0
2210 21 : #define TRY_BUNDLE_HAS_CONFLICTS (-1)
2211 21 : #define TRY_BUNDLE_DOES_NOT_FIT (-2)
2212 21 : #define TRY_BUNDLE_SUCCESS(n) ( n) /* schedule bundle with n transactions */
2213 : static inline int
2214 : fd_pack_try_schedule_bundle( fd_pack_t * pack,
2215 : ulong bank_tile,
2216 754014 : fd_txn_p_t * out ) {
2217 754014 : int state = pack->initializer_bundle_state;
2218 754014 : if( FD_UNLIKELY( (state==FD_PACK_IB_STATE_PENDING) | (state==FD_PACK_IB_STATE_FAILED ) ) ) return TRY_BUNDLE_NO_READY_BUNDLES;
2219 :
2220 754014 : fd_pack_ord_txn_t * pool = pack->pool;
2221 754014 : treap_t * bundles = pack->pending_bundles;
2222 :
2223 754014 : int require_ib;
2224 754014 : if( FD_UNLIKELY( state==FD_PACK_IB_STATE_NOT_INITIALIZED ) ) { require_ib = 1; }
2225 754014 : if( FD_LIKELY ( state==FD_PACK_IB_STATE_READY ) ) { require_ib = 0; }
2226 :
2227 754014 : treap_rev_iter_t _cur = treap_rev_iter_init( bundles, pool );
2228 754014 : ulong bundle_idx = ULONG_MAX;
2229 :
2230 754014 : if( FD_UNLIKELY( treap_rev_iter_done( _cur ) ) ) return TRY_BUNDLE_NO_READY_BUNDLES;
2231 :
2232 21 : treap_rev_iter_t _txn0 = _cur;
2233 21 : fd_pack_ord_txn_t * txn0 = treap_rev_iter_ele( _txn0, pool );
2234 21 : int is_ib = !!(txn0->txn->flags & FD_TXN_P_FLAGS_INITIALIZER_BUNDLE);
2235 21 : bundle_idx = RC_TO_REL_BUNDLE_IDX( txn0->rewards, txn0->compute_est );
2236 :
2237 21 : if( FD_UNLIKELY( require_ib & !is_ib ) ) return TRY_BUNDLE_NO_READY_BUNDLES;
2238 :
2239 : /* At this point, we have our candidate bundle, so we'll schedule it
2240 : if we can. If we can't, we won't schedule anything. */
2241 :
2242 :
2243 21 : fd_pack_addr_use_t * bundle_temp_inserted[ FD_PACK_MAX_TXN_PER_BUNDLE * FD_TXN_ACCT_ADDR_MAX ];
2244 21 : ulong bundle_temp_inserted_cnt = 0UL;
2245 :
2246 21 : ulong bank_tile_mask = 1UL << bank_tile;
2247 :
2248 21 : int doesnt_fit = 0;
2249 21 : int has_conflict = 0;
2250 21 : ulong txn_cnt = 0UL;
2251 :
2252 21 : ulong cu_limit = pack->lim->max_cost_per_block - pack->cumulative_block_cost;
2253 21 : ulong byte_limit = pack->lim->max_data_bytes_per_block - pack->data_bytes_consumed;
2254 21 : ulong microblock_limit = pack->lim->max_microblocks_per_block - pack->microblock_cnt;
2255 :
2256 21 : FD_PACK_BITSET_DECLARE( bitset_rw_in_use );
2257 21 : FD_PACK_BITSET_DECLARE( bitset_w_in_use );
2258 21 : FD_PACK_BITSET_COPY( bitset_rw_in_use, pack->bitset_rw_in_use );
2259 21 : FD_PACK_BITSET_COPY( bitset_w_in_use, pack->bitset_w_in_use );
2260 :
2261 : /* last_use_in_txn_cnt[i+1] Keeps track of the number of accounts that
2262 : have their last reference in transaction i of the bundle. This
2263 : esoteric value is important for computing use_by_bank_txn.
2264 : last_use_in_txn_cnt[0] is garbage. */
2265 21 : ulong last_use_in_txn_cnt[ 1UL+FD_PACK_MAX_TXN_PER_BUNDLE ] = { 0UL };
2266 :
2267 21 : fd_pack_addr_use_t null_use[1] = {{{{ 0 }}, { 0 }}};
2268 :
2269 75 : while( !(doesnt_fit | has_conflict) & !treap_rev_iter_done( _cur ) ) {
2270 63 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pool );
2271 63 : ulong this_bundle_idx = RC_TO_REL_BUNDLE_IDX( cur->rewards, cur->compute_est );
2272 63 : if( FD_UNLIKELY( this_bundle_idx!=bundle_idx ) ) break;
2273 :
2274 54 : if( FD_UNLIKELY( cur->compute_est>cu_limit ) ) {
2275 0 : doesnt_fit = 1;
2276 0 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_CU_LIMIT, 1UL );
2277 0 : break;
2278 0 : }
2279 54 : cu_limit -= cur->compute_est;
2280 :
2281 : /* Each transaction in a bundle turns into a microblock */
2282 54 : if( FD_UNLIKELY( microblock_limit==0UL ) ) {
2283 0 : doesnt_fit = 1;
2284 0 : FD_MCNT_INC( PACK, MICROBLOCK_PER_BLOCK_LIMIT, 1UL );
2285 0 : break;
2286 0 : }
2287 54 : microblock_limit--;
2288 :
2289 54 : if( FD_UNLIKELY( cur->txn->payload_sz+MICROBLOCK_DATA_OVERHEAD>byte_limit ) ) {
2290 0 : doesnt_fit = 1;
2291 0 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_BYTE_LIMIT, 1UL );
2292 0 : break;
2293 0 : }
2294 54 : byte_limit -= cur->txn->payload_sz + MICROBLOCK_DATA_OVERHEAD;
2295 :
2296 54 : if( FD_UNLIKELY( !FD_PACK_BITSET_INTERSECT4_EMPTY( pack->bitset_rw_in_use, pack->bitset_w_in_use, cur->w_bitset, cur->rw_bitset ) ) ) {
2297 0 : has_conflict = 1;
2298 0 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_FAST_PATH, 1UL );
2299 0 : break;
2300 0 : }
2301 :
2302 : /* Don't update the actual in-use bitset, because the transactions
2303 : in the bundle are allowed to conflict with each other. */
2304 54 : FD_PACK_BITSET_OR( bitset_rw_in_use, cur->rw_bitset );
2305 54 : FD_PACK_BITSET_OR( bitset_w_in_use, cur->w_bitset );
2306 :
2307 :
2308 54 : fd_txn_t const * txn = TXN(cur->txn);
2309 54 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, cur->txn->payload );
2310 54 : fd_acct_addr_t const * alt_adj = cur->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
2311 :
2312 : /* Check conflicts between this transaction's writable accounts and
2313 : current readers */
2314 54 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
2315 306 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2316 :
2317 252 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
2318 :
2319 252 : fd_pack_addr_use_t * in_bundle_temp = acct_uses_query( pack->bundle_temp_map, acct, null_use );
2320 252 : ulong current_cost = acct_uses_query( pack->writer_costs, acct, null_use )->total_cost;
2321 252 : ulong carried_cost = (ulong)in_bundle_temp->carried_cost;
2322 252 : if( FD_UNLIKELY( current_cost + carried_cost + cur->compute_est > pack->lim->max_write_cost_per_acct ) ) {
2323 0 : doesnt_fit = 1;
2324 0 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_WRITE_COST, 1UL );
2325 0 : break;
2326 0 : }
2327 :
2328 252 : if( FD_LIKELY( in_bundle_temp==null_use ) ) { /* Not in temp bundle table yet */
2329 192 : in_bundle_temp = acct_uses_insert( pack->bundle_temp_map, acct );
2330 192 : in_bundle_temp->_ = 0UL;
2331 192 : bundle_temp_inserted[ bundle_temp_inserted_cnt++ ] = in_bundle_temp;
2332 192 : }
2333 252 : in_bundle_temp->carried_cost += (uint)cur->compute_est; /* < 2^21, but >0 */
2334 252 : in_bundle_temp->ref_cnt++;
2335 252 : last_use_in_txn_cnt[ in_bundle_temp->last_use_in ]--;
2336 252 : in_bundle_temp->last_use_in = (ushort)(txn_cnt+1UL);
2337 252 : last_use_in_txn_cnt[ in_bundle_temp->last_use_in ]++;
2338 :
2339 252 : if( FD_UNLIKELY( acct_uses_query( pack->acct_in_use, acct, null_use )->in_use_by ) ) {
2340 0 : has_conflict = 1;
2341 0 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_SLOW_PATH, 1UL );
2342 0 : break;
2343 0 : }
2344 252 : }
2345 54 : if( has_conflict | doesnt_fit ) break;
2346 :
2347 : /* Check conflicts between this transaction's readonly accounts and
2348 : current writers */
2349 54 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_READONLY );
2350 297 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2351 :
2352 243 : fd_acct_addr_t const * acct = ACCT_ITER_TO_PTR( iter );
2353 243 : if( fd_pack_unwritable_contains( acct ) ) continue; /* No need to track sysvars because they can't be writable */
2354 :
2355 144 : fd_pack_addr_use_t * in_bundle_temp = acct_uses_query( pack->bundle_temp_map, *acct, null_use );
2356 144 : if( FD_LIKELY( in_bundle_temp==null_use ) ) { /* Not in temp bundle table yet */
2357 87 : in_bundle_temp = acct_uses_insert( pack->bundle_temp_map, *acct );
2358 87 : in_bundle_temp->_ = 0UL;
2359 87 : bundle_temp_inserted[ bundle_temp_inserted_cnt++ ] = in_bundle_temp;
2360 87 : }
2361 144 : in_bundle_temp->ref_cnt++;
2362 144 : last_use_in_txn_cnt[ in_bundle_temp->last_use_in ]--;
2363 144 : in_bundle_temp->last_use_in = (ushort)(txn_cnt+1UL);
2364 144 : last_use_in_txn_cnt[ in_bundle_temp->last_use_in ]++;
2365 :
2366 144 : if( FD_UNLIKELY( acct_uses_query( pack->acct_in_use, *acct, null_use )->in_use_by & FD_PACK_IN_USE_WRITABLE ) ) {
2367 0 : has_conflict = 1;
2368 0 : FD_MCNT_INC( PACK, TRANSACTION_SCHEDULE_SLOW_PATH, 1UL );
2369 0 : break;
2370 0 : }
2371 144 : }
2372 :
2373 54 : if( has_conflict | doesnt_fit ) break;
2374 :
2375 54 : txn_cnt++;
2376 54 : _cur = treap_rev_iter_next( _cur, pool );
2377 54 : }
2378 21 : int retval = fd_int_if( doesnt_fit, TRY_BUNDLE_DOES_NOT_FIT,
2379 21 : fd_int_if( has_conflict, TRY_BUNDLE_HAS_CONFLICTS, TRY_BUNDLE_SUCCESS( (int)txn_cnt ) ) );
2380 :
2381 21 : if( FD_UNLIKELY( retval<=0 ) ) {
2382 0 : for( ulong i=0UL; i<bundle_temp_inserted_cnt; i++ ) {
2383 0 : acct_uses_remove( pack->bundle_temp_map, bundle_temp_inserted[ bundle_temp_inserted_cnt-i-1UL ] );
2384 0 : }
2385 0 : FD_TEST( acct_uses_key_cnt( pack->bundle_temp_map )==0UL );
2386 0 : return retval;
2387 0 : }
2388 :
2389 : /* This bundle passed validation, so now we'll take it! */
2390 21 : pack->outstanding_microblock_mask |= bank_tile_mask;
2391 :
2392 21 : treap_rev_iter_t _end = _cur;
2393 21 : treap_rev_iter_t _next;
2394 :
2395 : /* We'll carefully incrementally construct use_by_bank and
2396 : use_by_bank_txn based on the contents of bundle_temp and
2397 : last_use_in_txn_cnt. */
2398 21 : fd_pack_addr_use_t * use_by_bank = pack->use_by_bank [bank_tile];
2399 21 : ulong * use_by_bank_txn = pack->use_by_bank_txn[bank_tile];
2400 21 : ulong cum_sum = 0UL;
2401 75 : for( ulong k=0UL; k<txn_cnt; k++ ) { use_by_bank_txn[k] = cum_sum; cum_sum += last_use_in_txn_cnt[ k+1UL ]; }
2402 21 : pack->use_by_bank_cnt[bank_tile] = cum_sum;
2403 :
2404 :
2405 75 : for( _cur=_txn0; _cur!=_end; _cur=_next ) {
2406 54 : _next = treap_rev_iter_next( _cur, pool );
2407 :
2408 54 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pool );
2409 54 : fd_txn_t const * txn = TXN(cur->txn);
2410 54 : fd_memcpy( out->payload, cur->txn->payload, cur->txn->payload_sz );
2411 54 : fd_memcpy( TXN(out), txn, fd_txn_footprint( txn->instr_cnt, txn->addr_table_lookup_cnt ) );
2412 54 : out->payload_sz = cur->txn->payload_sz;
2413 54 : out->pack_cu.requested_exec_plus_acct_data_cus = cur->txn->pack_cu.requested_exec_plus_acct_data_cus;
2414 54 : out->pack_cu.non_execution_cus = cur->txn->pack_cu.non_execution_cus;
2415 54 : out->scheduler_arrival_time_nanos = cur->txn->scheduler_arrival_time_nanos;
2416 54 : out->source_tpu = cur->txn->source_tpu;
2417 54 : out->source_ipv4 = cur->txn->source_ipv4;
2418 54 : out->flags = cur->txn->flags;
2419 54 : out++;
2420 :
2421 54 : pack->cumulative_block_cost += cur->compute_est;
2422 54 : pack->data_bytes_consumed += cur->txn->payload_sz + MICROBLOCK_DATA_OVERHEAD;
2423 54 : pack->microblock_cnt += 1UL;
2424 :
2425 54 : if( FD_UNLIKELY( cur->txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE ) ) noncemap_ele_remove_fast( pack->noncemap, cur, pack->pool );
2426 54 : sig2txn_ele_remove_fast( pack->signature_map, cur, pack->pool );
2427 :
2428 54 : cur->root = FD_ORD_TXN_ROOT_FREE;
2429 54 : expq_remove( pack->expiration_q, cur->expq_idx );
2430 54 : treap_idx_remove( pack->pending_bundles, _cur, pack->pool );
2431 54 : trp_pool_idx_release( pack->pool, _cur );
2432 54 : pack->pending_txn_cnt--;
2433 54 : }
2434 :
2435 :
2436 300 : for( ulong i=0UL; i<bundle_temp_inserted_cnt; i++ ) {
2437 : /* In order to clear bundle_temp_map with the typical trick, we need
2438 : to iterate through bundle_temp_inserted backwards. */
2439 279 : fd_pack_addr_use_t * addr_use = bundle_temp_inserted[ bundle_temp_inserted_cnt-i-1UL ];
2440 :
2441 279 : int any_writers = addr_use->carried_cost>0U; /* Did any transaction in this bundle write lock this account address? */
2442 :
2443 279 : if( FD_LIKELY( any_writers ) ) { /* UNLIKELY? */
2444 192 : fd_pack_addr_use_t * in_wcost_table = acct_uses_query( pack->writer_costs, addr_use->key, NULL );
2445 192 : if( !in_wcost_table ) {
2446 177 : in_wcost_table = acct_uses_insert( pack->writer_costs, addr_use->key );
2447 177 : in_wcost_table->total_cost = 0UL;
2448 177 : pack->written_list[ pack->written_list_cnt ] = in_wcost_table;
2449 177 : pack->written_list_cnt = fd_ulong_min( pack->written_list_cnt+1UL, pack->written_list_max-1UL );
2450 177 : }
2451 192 : in_wcost_table->total_cost += (ulong)addr_use->carried_cost;
2452 192 : }
2453 :
2454 : /* in_use_by must be set before releasing the bit reference */
2455 279 : fd_pack_addr_use_t * use = acct_uses_query( pack->acct_in_use, addr_use->key, NULL );
2456 279 : if( !use ) { use = acct_uses_insert( pack->acct_in_use, addr_use->key ); use->in_use_by = 0UL; }
2457 279 : use->in_use_by |= bank_tile_mask | fd_ulong_if( any_writers, FD_PACK_IN_USE_WRITABLE, 0UL );
2458 279 : use->in_use_by &= ~FD_PACK_IN_USE_BIT_CLEARED;
2459 :
2460 279 : use_by_bank[ use_by_bank_txn[ addr_use->last_use_in-1UL ]++ ] = *use;
2461 :
2462 675 : for( ulong k=0UL; k<(ulong)addr_use->ref_cnt; k++ ) {
2463 396 : release_result_t ret = release_bit_reference( pack, &(addr_use->key) );
2464 396 : FD_PACK_BITSET_CLEARN( bitset_rw_in_use, ret.clear_rw_bit );
2465 396 : FD_PACK_BITSET_CLEARN( bitset_w_in_use, ret.clear_w_bit );
2466 396 : }
2467 :
2468 279 : acct_uses_remove( pack->bundle_temp_map, addr_use );
2469 279 : }
2470 :
2471 21 : FD_PACK_BITSET_COPY( pack->bitset_rw_in_use, bitset_rw_in_use );
2472 21 : FD_PACK_BITSET_COPY( pack->bitset_w_in_use, bitset_w_in_use );
2473 :
2474 21 : if( FD_UNLIKELY( is_ib ) ) {
2475 9 : pack->initializer_bundle_state = FD_PACK_IB_STATE_PENDING;
2476 9 : }
2477 21 : return retval;
2478 21 : }
2479 :
2480 :
2481 : ulong
2482 : fd_pack_schedule_next_microblock( fd_pack_t * pack,
2483 : ulong total_cus,
2484 : float vote_fraction,
2485 : ulong bank_tile,
2486 : int schedule_flags,
2487 754233 : fd_txn_p_t * out ) {
2488 :
2489 : /* TODO: Decide if these are exactly how we want to handle limits */
2490 754233 : total_cus = fd_ulong_min( total_cus, pack->lim->max_cost_per_block - pack->cumulative_block_cost );
2491 754233 : ulong vote_cus = fd_ulong_min( (ulong)((float)total_cus * vote_fraction),
2492 754233 : pack->lim->max_vote_cost_per_block - pack->cumulative_vote_cost );
2493 754233 : ulong vote_reserved_txns = fd_ulong_min( vote_cus/FD_PACK_SIMPLE_VOTE_COST,
2494 754233 : (ulong)((float)pack->lim->max_txn_per_microblock * vote_fraction) );
2495 :
2496 :
2497 754233 : if( FD_UNLIKELY( (pack->microblock_cnt>=pack->lim->max_microblocks_per_block) ) ) {
2498 0 : FD_MCNT_INC( PACK, MICROBLOCK_PER_BLOCK_LIMIT, 1UL );
2499 0 : return 0UL;
2500 0 : }
2501 754233 : if( FD_UNLIKELY( pack->data_bytes_consumed+MICROBLOCK_DATA_OVERHEAD+FD_TXN_MIN_SERIALIZED_SZ>pack->lim->max_data_bytes_per_block) ) {
2502 0 : FD_MCNT_INC( PACK, DATA_PER_BLOCK_LIMIT, 1UL );
2503 0 : return 0UL;
2504 0 : }
2505 :
2506 754233 : ulong * use_by_bank_txn = pack->use_by_bank_txn[ bank_tile ];
2507 :
2508 754233 : ulong cu_limit = total_cus - vote_cus;
2509 754233 : ulong txn_limit = pack->lim->max_txn_per_microblock - vote_reserved_txns;
2510 754233 : ulong scheduled = 0UL;
2511 754233 : ulong byte_limit = pack->lim->max_data_bytes_per_block - pack->data_bytes_consumed - MICROBLOCK_DATA_OVERHEAD;
2512 :
2513 754233 : sched_return_t status = {0}, status1 = {0};
2514 :
2515 754233 : if( FD_LIKELY( schedule_flags & FD_PACK_SCHEDULE_VOTE ) ) {
2516 : /* Schedule vote transactions */
2517 754134 : 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 );
2518 :
2519 754134 : scheduled += status1.txns_scheduled;
2520 754134 : pack->cumulative_vote_cost += status1.cus_scheduled;
2521 754134 : pack->cumulative_block_cost += status1.cus_scheduled;
2522 754134 : pack->data_bytes_consumed += status1.bytes_scheduled;
2523 754134 : byte_limit -= status1.bytes_scheduled;
2524 754134 : use_by_bank_txn += status1.txns_scheduled;
2525 : /* Add any remaining CUs/txns to the non-vote limits */
2526 754134 : txn_limit += vote_reserved_txns - status1.txns_scheduled;
2527 754134 : cu_limit += vote_cus - status1.cus_scheduled;
2528 754134 : }
2529 :
2530 : /* Bundle can't mix with votes, so only try to schedule a bundle if we
2531 : didn't get any votes. */
2532 754233 : if( FD_UNLIKELY( !!(schedule_flags & FD_PACK_SCHEDULE_BUNDLE) & (status1.txns_scheduled==0UL) ) ) {
2533 754014 : int bundle_result = fd_pack_try_schedule_bundle( pack, bank_tile, out );
2534 754014 : if( FD_UNLIKELY( bundle_result>0 ) ) return (ulong)bundle_result;
2535 753993 : if( FD_UNLIKELY( bundle_result==TRY_BUNDLE_HAS_CONFLICTS ) ) return 0UL;
2536 : /* in the NO_READY_BUNDLES or DOES_NOT_FIT case, we schedule like
2537 : normal. */
2538 : /* We have the early returns here because try_schedule_bundle does
2539 : the bookeeping internally, since the calculations are a bit
2540 : different in that case. */
2541 753993 : }
2542 :
2543 :
2544 : /* Fill any remaining space with non-vote transactions */
2545 754212 : if( FD_LIKELY( schedule_flags & FD_PACK_SCHEDULE_TXN ) ) {
2546 754212 : 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 );
2547 :
2548 754212 : scheduled += status.txns_scheduled;
2549 754212 : pack->cumulative_block_cost += status.cus_scheduled;
2550 754212 : pack->data_bytes_consumed += status.bytes_scheduled;
2551 754212 : }
2552 :
2553 754212 : ulong nonempty = (ulong)(scheduled>0UL);
2554 754212 : pack->microblock_cnt += nonempty;
2555 754212 : pack->outstanding_microblock_mask |= nonempty << bank_tile;
2556 754212 : pack->data_bytes_consumed += nonempty * MICROBLOCK_DATA_OVERHEAD;
2557 :
2558 : /* Update metrics counters */
2559 754212 : fd_pack_metrics_write( pack );
2560 754212 : FD_MGAUGE_SET( PACK, CUS_CONSUMED_IN_BLOCK, pack->cumulative_block_cost );
2561 :
2562 754212 : fd_histf_sample( pack->txn_per_microblock, scheduled );
2563 754212 : fd_histf_sample( pack->vote_per_microblock, status1.txns_scheduled );
2564 :
2565 251404 : #if FD_HAS_AVX512 && FD_PACK_USE_NON_TEMPORAL_MEMCPY
2566 251404 : _mm_sfence();
2567 251404 : #endif
2568 :
2569 754212 : return scheduled;
2570 754233 : }
2571 :
2572 274530 : ulong fd_pack_bank_tile_cnt ( fd_pack_t const * pack ) { return pack->bank_tile_cnt; }
2573 1369 : ulong fd_pack_current_block_cost( fd_pack_t const * pack ) { return pack->cumulative_block_cost; }
2574 :
2575 :
2576 : void
2577 40 : fd_pack_set_block_limits( fd_pack_t * pack, fd_pack_limits_t const * limits ) {
2578 40 : FD_TEST( limits->max_cost_per_block >= FD_PACK_MAX_COST_PER_BLOCK_LOWER_BOUND );
2579 40 : FD_TEST( limits->max_vote_cost_per_block >= FD_PACK_MAX_VOTE_COST_PER_BLOCK_LOWER_BOUND );
2580 40 : FD_TEST( limits->max_write_cost_per_acct >= FD_PACK_MAX_WRITE_COST_PER_ACCT_LOWER_BOUND );
2581 :
2582 40 : pack->lim->max_microblocks_per_block = limits->max_microblocks_per_block;
2583 40 : pack->lim->max_data_bytes_per_block = limits->max_data_bytes_per_block;
2584 40 : pack->lim->max_cost_per_block = limits->max_cost_per_block;
2585 40 : pack->lim->max_vote_cost_per_block = limits->max_vote_cost_per_block;
2586 40 : pack->lim->max_write_cost_per_acct = limits->max_write_cost_per_acct;
2587 40 : }
2588 :
2589 : void
2590 : fd_pack_rebate_cus( fd_pack_t * pack,
2591 15 : fd_pack_rebate_t const * rebate ) {
2592 15 : if( FD_UNLIKELY( (rebate->ib_result!=0) & (pack->initializer_bundle_state==FD_PACK_IB_STATE_PENDING ) ) ) {
2593 9 : pack->initializer_bundle_state = fd_int_if( rebate->ib_result==1, FD_PACK_IB_STATE_READY, FD_PACK_IB_STATE_FAILED );
2594 9 : }
2595 :
2596 15 : pack->cumulative_block_cost -= rebate->total_cost_rebate;
2597 15 : pack->cumulative_vote_cost -= rebate->vote_cost_rebate;
2598 15 : pack->data_bytes_consumed -= rebate->data_bytes_rebate;
2599 15 : pack->cumulative_rebated_cus += rebate->total_cost_rebate;
2600 : /* For now, we want to ignore the microblock count rebate. There are
2601 : 3 places the microblock count is kept (here, in the pack tile, and
2602 : in the PoH tile), and they all need to count microblocks that end
2603 : up being empty in the same way. It would be better from a
2604 : DoS-resistance perspective for them all not to count empty
2605 : microblocks towards the total, but there's a race condition:
2606 : suppose pack schedules a microblock containing one transaction that
2607 : doesn't land on chain, the slot ends, and then pack informs PoH of
2608 : the number of microblocks before the final rebate comes through.
2609 : This isn't unsolvable, but it's pretty gross, so it's probably
2610 : better to just not apply the rebate for now. */
2611 15 : (void)rebate->microblock_cnt_rebate;
2612 :
2613 15 : fd_pack_addr_use_t * writer_costs = pack->writer_costs;
2614 27 : for( ulong i=0UL; i<rebate->writer_cnt; i++ ) {
2615 12 : fd_pack_addr_use_t * in_wcost_table = acct_uses_query( writer_costs, rebate->writer_rebates[i].key, NULL );
2616 12 : if( FD_UNLIKELY( !in_wcost_table ) ) FD_LOG_ERR(( "Rebate to unknown written account" ));
2617 12 : in_wcost_table->total_cost -= rebate->writer_rebates[i].rebate_cus;
2618 : /* Important: Even if this is 0, don't delete it from the table so
2619 : that the insert order doesn't get messed up. */
2620 12 : }
2621 15 : }
2622 :
2623 :
2624 : ulong
2625 : fd_pack_expire_before( fd_pack_t * pack,
2626 55 : ulong expire_before ) {
2627 55 : expire_before = fd_ulong_max( expire_before, pack->expire_before );
2628 55 : ulong deleted_cnt = 0UL;
2629 55 : fd_pack_expq_t * prq = pack->expiration_q;
2630 367 : while( (expq_cnt( prq )>0UL) & (prq->expires_at<expire_before) ) {
2631 312 : fd_pack_ord_txn_t * expired = prq->txn;
2632 :
2633 : /* fd_pack_delete_transaction also removes it from the heap */
2634 : /* All the transactions in the same bundle have the same expiration
2635 : time, so this loop will end up deleting them all, even with
2636 : delete_full_bundle set to 0. */
2637 312 : ulong _delete_cnt = delete_transaction( pack, expired, 0, 1 );
2638 312 : deleted_cnt += _delete_cnt;
2639 312 : FD_TEST( _delete_cnt );
2640 312 : }
2641 :
2642 55 : pack->expire_before = expire_before;
2643 55 : return deleted_cnt;
2644 55 : }
2645 :
2646 : void
2647 2659 : fd_pack_end_block( fd_pack_t * pack ) {
2648 : /* rounded division */
2649 2659 : ulong pct_cus_per_block = (pack->cumulative_block_cost*100UL + (pack->lim->max_cost_per_block>>1))/pack->lim->max_cost_per_block;
2650 2659 : fd_histf_sample( pack->pct_cus_per_block, pct_cus_per_block );
2651 2659 : fd_histf_sample( pack->net_cus_per_block, pack->cumulative_block_cost );
2652 2659 : fd_histf_sample( pack->rebated_cus_per_block, pack->cumulative_rebated_cus );
2653 2659 : fd_histf_sample( pack->scheduled_cus_per_block, pack->cumulative_rebated_cus + pack->cumulative_block_cost );
2654 :
2655 2659 : pack->microblock_cnt = 0UL;
2656 2659 : pack->data_bytes_consumed = 0UL;
2657 2659 : pack->cumulative_block_cost = 0UL;
2658 2659 : pack->cumulative_vote_cost = 0UL;
2659 2659 : pack->cumulative_rebated_cus = 0UL;
2660 2659 : pack->outstanding_microblock_mask = 0UL;
2661 :
2662 2659 : pack->initializer_bundle_state = FD_PACK_IB_STATE_NOT_INITIALIZED;
2663 :
2664 2659 : acct_uses_clear( pack->acct_in_use );
2665 :
2666 2659 : if( FD_LIKELY( pack->written_list_cnt<pack->written_list_max-1UL ) ) {
2667 : /* The less dangerous way of doing this is to instead record the
2668 : keys we inserted and do a query followed by a delete for each
2669 : key. The downside of that is that keys are 32 bytes and a
2670 : pointer is only 8 bytes, plus the computational cost for the
2671 : query.
2672 :
2673 : However, if we're careful, we can pull this off. We require two
2674 : things. First, we started from an empty map and did nothing but
2675 : insert and update. In particular, no deletions. Second, we have
2676 : to be careful to delete in the opposite order that we inserted.
2677 : This is essentially like unwinding the inserts we did. The
2678 : common case is that the element after the one we delete will be
2679 : empty, so we'll hit that case. It's possible that there's
2680 : another independent probe sequence that will be entirely intact
2681 : starting in the element after, but we'll never hit the MAP_MOVE
2682 : case. */
2683 779333 : for( ulong i=0UL; i<pack->written_list_cnt; i++ ) {
2684 : /* Clearing the cost field here is unnecessary (since it gets
2685 : cleared on insert), but makes debugging a bit easier. */
2686 776674 : pack->written_list[ pack->written_list_cnt - 1UL - i ]->total_cost = 0UL;
2687 776674 : acct_uses_remove( pack->writer_costs, pack->written_list[ pack->written_list_cnt - 1UL - i ] );
2688 776674 : }
2689 2659 : } else {
2690 0 : acct_uses_clear( pack->writer_costs );
2691 0 : }
2692 2659 : pack->written_list_cnt = 0UL;
2693 :
2694 : /* compressed_slot_number is > FD_PACK_SKIP_CNT, which means +1 is the
2695 : max unless it overflows. */
2696 2659 : pack->compressed_slot_number = fd_ushort_max( (ushort)(pack->compressed_slot_number+1), (ushort)(FD_PACK_SKIP_CNT+1) );
2697 :
2698 2659 : FD_PACK_BITSET_CLEAR( pack->bitset_rw_in_use );
2699 2659 : FD_PACK_BITSET_CLEAR( pack->bitset_w_in_use );
2700 :
2701 9260 : for( ulong i=0UL; i<pack->bank_tile_cnt; i++ ) pack->use_by_bank_cnt[i] = 0UL;
2702 :
2703 : /* If our stake is low and we don't become leader often, end_block
2704 : might get called on the order of O(1/hr), which feels too
2705 : infrequent to do anything related to metrics. However, we only
2706 : update the histograms when we are leader, so this is actually a
2707 : good place to copy them. */
2708 2659 : FD_MHIST_COPY( PACK, TOTAL_TRANSACTIONS_PER_MICROBLOCK_COUNT, pack->txn_per_microblock );
2709 2659 : FD_MHIST_COPY( PACK, VOTES_PER_MICROBLOCK_COUNT, pack->vote_per_microblock );
2710 :
2711 2659 : FD_MGAUGE_SET( PACK, CUS_CONSUMED_IN_BLOCK, 0UL );
2712 2659 : FD_MHIST_COPY( PACK, CUS_SCHEDULED, pack->scheduled_cus_per_block );
2713 2659 : FD_MHIST_COPY( PACK, CUS_REBATED, pack->rebated_cus_per_block );
2714 2659 : FD_MHIST_COPY( PACK, CUS_NET, pack->net_cus_per_block );
2715 2659 : FD_MHIST_COPY( PACK, CUS_PCT, pack->pct_cus_per_block );
2716 2659 : }
2717 :
2718 : static void
2719 : release_tree( treap_t * treap,
2720 : sig2txn_t * signature_map,
2721 : noncemap_t * noncemap,
2722 9 : fd_pack_ord_txn_t * pool ) {
2723 9 : treap_fwd_iter_t next;
2724 18 : for( treap_fwd_iter_t it=treap_fwd_iter_init( treap, pool ); !treap_fwd_iter_done( it ); it=next ) {
2725 9 : next = treap_fwd_iter_next( it, pool );
2726 9 : ulong idx = treap_fwd_iter_idx( it );
2727 9 : pool[ idx ].root = FD_ORD_TXN_ROOT_FREE;
2728 9 : treap_idx_remove ( treap, idx, pool );
2729 9 : sig2txn_idx_remove_fast( signature_map, idx, pool );
2730 9 : trp_pool_idx_release ( pool, idx );
2731 9 : if( pool[ idx ].txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE ) {
2732 9 : noncemap_idx_remove_fast( noncemap, idx, pool );
2733 9 : }
2734 9 : }
2735 9 : }
2736 :
2737 : void
2738 3 : fd_pack_clear_all( fd_pack_t * pack ) {
2739 3 : pack->pending_txn_cnt = 0UL;
2740 3 : pack->microblock_cnt = 0UL;
2741 3 : pack->cumulative_block_cost = 0UL;
2742 3 : pack->cumulative_vote_cost = 0UL;
2743 3 : pack->cumulative_rebated_cus = 0UL;
2744 :
2745 3 : pack->pending_smallest->cus = ULONG_MAX;
2746 3 : pack->pending_smallest->bytes = ULONG_MAX;
2747 3 : pack->pending_votes_smallest->cus = ULONG_MAX;
2748 3 : pack->pending_votes_smallest->bytes = ULONG_MAX;
2749 :
2750 3 : release_tree( pack->pending, pack->signature_map, pack->noncemap, pack->pool );
2751 3 : release_tree( pack->pending_votes, pack->signature_map, pack->noncemap, pack->pool );
2752 3 : release_tree( pack->pending_bundles, pack->signature_map, pack->noncemap, pack->pool );
2753 :
2754 3 : ulong const pool_max = trp_pool_max( pack->pool );
2755 132 : for( ulong i=0UL; i<pool_max; i++ ) {
2756 129 : if( FD_UNLIKELY( pack->pool[ i ].root!=FD_ORD_TXN_ROOT_FREE ) ) {
2757 0 : fd_pack_ord_txn_t * const del = pack->pool + i;
2758 0 : fd_txn_t * txn = TXN( del->txn );
2759 0 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, del->txn->payload );
2760 0 : fd_acct_addr_t const * alt_adj = del->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
2761 0 : fd_acct_addr_t penalty_acct = *ACCT_IDX_TO_PTR( FD_ORD_TXN_ROOT_PENALTY_ACCT_IDX( del->root ) );
2762 0 : fd_pack_penalty_treap_t * penalty_treap = penalty_map_query( pack->penalty_treaps, penalty_acct, NULL );
2763 0 : FD_TEST( penalty_treap );
2764 0 : release_tree( penalty_treap->penalty_treap, pack->signature_map, pack->noncemap, pack->pool );
2765 0 : }
2766 129 : }
2767 :
2768 3 : pack->compressed_slot_number = (ushort)(FD_PACK_SKIP_CNT+1);
2769 :
2770 3 : expq_remove_all( pack->expiration_q );
2771 :
2772 3 : acct_uses_clear( pack->acct_in_use );
2773 3 : acct_uses_clear( pack->writer_costs );
2774 :
2775 3 : penalty_map_clear( pack->penalty_treaps );
2776 :
2777 3 : FD_PACK_BITSET_CLEAR( pack->bitset_rw_in_use );
2778 3 : FD_PACK_BITSET_CLEAR( pack->bitset_w_in_use );
2779 3 : bitset_map_clear( pack->acct_to_bitset );
2780 3 : pack->bitset_avail[ 0 ] = FD_PACK_BITSET_SLOWPATH;
2781 1027 : for( ulong i=0UL; i<FD_PACK_BITSET_MAX; i++ ) pack->bitset_avail[ i+1UL ] = (ushort)i;
2782 3 : pack->bitset_avail_cnt = FD_PACK_BITSET_MAX;
2783 :
2784 6 : for( ulong i=0UL; i<pack->bank_tile_cnt; i++ ) pack->use_by_bank_cnt[i] = 0UL;
2785 3 : }
2786 :
2787 :
2788 : /* If delete_full_bundle is non-zero and the transaction to delete is
2789 : part of a bundle, the rest of the bundle it is part of will be
2790 : deleted as well.
2791 : If move_from_penalty_treap is non-zero and the transaction to delete
2792 : is in the pending treap, move the best transaction in any of the
2793 : conflicting penalty treaps to the pending treap (if there is one). */
2794 : static ulong
2795 : delete_transaction( fd_pack_t * pack,
2796 : fd_pack_ord_txn_t * containing,
2797 : int delete_full_bundle,
2798 495471 : int move_from_penalty_treap ) {
2799 :
2800 495471 : fd_txn_t * txn = TXN( containing->txn );
2801 495471 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, containing->txn->payload );
2802 495471 : fd_acct_addr_t const * alt_adj = containing->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
2803 :
2804 495471 : treap_t * root = NULL;
2805 495471 : int root_idx = containing->root;
2806 495471 : fd_pack_penalty_treap_t * penalty_treap = NULL;
2807 495471 : switch( root_idx & FD_ORD_TXN_ROOT_TAG_MASK ) {
2808 0 : case FD_ORD_TXN_ROOT_FREE: FD_LOG_CRIT(( "Double free detected" ));
2809 492291 : case FD_ORD_TXN_ROOT_PENDING: root = pack->pending; break;
2810 0 : case FD_ORD_TXN_ROOT_PENDING_VOTE: root = pack->pending_votes; break;
2811 519 : case FD_ORD_TXN_ROOT_PENDING_BUNDLE: root = pack->pending_bundles; break;
2812 2661 : case FD_ORD_TXN_ROOT_PENALTY( 0 ): {
2813 2661 : fd_acct_addr_t penalty_acct = *ACCT_IDX_TO_PTR( FD_ORD_TXN_ROOT_PENALTY_ACCT_IDX( root_idx ) );
2814 2661 : penalty_treap = penalty_map_query( pack->penalty_treaps, penalty_acct, NULL );
2815 2661 : FD_TEST( penalty_treap );
2816 2661 : root = penalty_treap->penalty_treap;
2817 2661 : break;
2818 2661 : }
2819 495471 : }
2820 :
2821 495471 : ulong delete_cnt = 0UL;
2822 495471 : if( FD_UNLIKELY( delete_full_bundle & (root==pack->pending_bundles) ) ) {
2823 : /* When we delete, the structure of the treap may move around, but
2824 : pointers to inside the pool will remain valid */
2825 123 : fd_pack_ord_txn_t * bundle_ptrs[ FD_PACK_MAX_TXN_PER_BUNDLE-1UL ];
2826 123 : fd_pack_ord_txn_t * pool = pack->pool;
2827 123 : ulong cnt = 0UL;
2828 123 : ulong bundle_idx = RC_TO_REL_BUNDLE_IDX( containing->rewards, containing->compute_est );
2829 :
2830 : /* Iterate in both directions from the current transaction */
2831 123 : for( treap_fwd_iter_t _cur=treap_fwd_iter_next( (treap_fwd_iter_t)treap_idx_fast( containing, pool ), pool );
2832 426 : !treap_fwd_iter_done( _cur ); _cur=treap_fwd_iter_next( _cur, pool ) ) {
2833 303 : fd_pack_ord_txn_t * cur = treap_fwd_iter_ele( _cur, pool );
2834 303 : if( FD_LIKELY( bundle_idx==RC_TO_REL_BUNDLE_IDX( cur->rewards, cur->compute_est ) ) ) {
2835 303 : bundle_ptrs[ cnt++ ] = cur;
2836 303 : } else {
2837 0 : break;
2838 0 : }
2839 303 : FD_TEST( cnt<FD_PACK_MAX_TXN_PER_BUNDLE );
2840 303 : }
2841 :
2842 123 : for( treap_rev_iter_t _cur=treap_rev_iter_next( (treap_rev_iter_t)treap_idx_fast( containing, pool ), pool );
2843 216 : !treap_rev_iter_done( _cur ); _cur=treap_rev_iter_next( _cur, pool ) ) {
2844 93 : fd_pack_ord_txn_t * cur = treap_rev_iter_ele( _cur, pool );
2845 93 : if( FD_LIKELY( bundle_idx==RC_TO_REL_BUNDLE_IDX( cur->rewards, cur->compute_est ) ) ) {
2846 93 : bundle_ptrs[ cnt++ ] = cur;
2847 93 : } else {
2848 0 : break;
2849 0 : }
2850 93 : FD_TEST( cnt<FD_PACK_MAX_TXN_PER_BUNDLE );
2851 93 : }
2852 :
2853 : /* Delete them each, setting delete_full_bundle to 0 to avoid
2854 : infinite recursion. */
2855 519 : for( ulong k=0UL; k<cnt; k++ ) delete_cnt += delete_transaction( pack, bundle_ptrs[ k ], 0, 0 );
2856 123 : }
2857 :
2858 :
2859 495471 : if( FD_UNLIKELY( move_from_penalty_treap & (root==pack->pending) ) ) {
2860 :
2861 492285 : fd_pack_ord_txn_t * best = NULL;
2862 492285 : fd_pack_penalty_treap_t * best_penalty = NULL;
2863 :
2864 492285 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
2865 986394 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2866 494109 : fd_pack_penalty_treap_t * p_trp = penalty_map_query( pack->penalty_treaps, *ACCT_ITER_TO_PTR( iter ), NULL );
2867 494109 : if( FD_UNLIKELY( p_trp ) ) {
2868 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 );
2869 1289 : if( FD_UNLIKELY( !best || COMPARE_WORSE( best, best_in_trp ) ) ) {
2870 672 : best = best_in_trp;
2871 672 : best_penalty = p_trp;
2872 672 : }
2873 1289 : }
2874 494109 : }
2875 :
2876 492285 : if( FD_LIKELY( best ) ) {
2877 : /* move best to the main treap */
2878 672 : treap_ele_remove( best_penalty->penalty_treap, best, pack->pool );
2879 672 : best->root = FD_ORD_TXN_ROOT_PENDING;
2880 672 : treap_ele_insert( pack->pending, best, pack->pool );
2881 :
2882 672 : pack->pending_smallest->cus = fd_ulong_min( pack->pending_smallest->cus, best->compute_est );
2883 672 : pack->pending_smallest->bytes = fd_ulong_min( pack->pending_smallest->bytes, best->txn_e->txnp->payload_sz );
2884 :
2885 672 : if( FD_UNLIKELY( !treap_ele_cnt( best_penalty->penalty_treap ) ) ) {
2886 9 : treap_delete( treap_leave( best_penalty->penalty_treap ) );
2887 9 : penalty_map_remove( pack->penalty_treaps, best_penalty );
2888 9 : }
2889 672 : }
2890 492285 : }
2891 :
2892 495471 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_ALL );
2893 2004108 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
2894 1508637 : if( FD_UNLIKELY( fd_pack_unwritable_contains( ACCT_ITER_TO_PTR( iter ) ) ) ) continue;
2895 :
2896 1012098 : release_result_t ret = release_bit_reference( pack, ACCT_ITER_TO_PTR( iter ) );
2897 1012098 : FD_PACK_BITSET_CLEARN( pack->bitset_rw_in_use, ret.clear_rw_bit );
2898 1012098 : FD_PACK_BITSET_CLEARN( pack->bitset_w_in_use, ret.clear_w_bit );
2899 1012098 : }
2900 :
2901 495471 : if( FD_UNLIKELY( containing->txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE ) ) {
2902 261 : noncemap_ele_remove_fast( pack->noncemap, containing, pack->pool );
2903 261 : }
2904 495471 : expq_remove( pack->expiration_q, containing->expq_idx );
2905 495471 : containing->root = FD_ORD_TXN_ROOT_FREE;
2906 495471 : treap_ele_remove( root, containing, pack->pool );
2907 495471 : sig2txn_ele_remove_fast( pack->signature_map, containing, pack->pool );
2908 495471 : trp_pool_ele_release( pack->pool, containing );
2909 :
2910 495471 : delete_cnt += 1UL;
2911 495471 : pack->pending_txn_cnt--;
2912 :
2913 495471 : if( FD_UNLIKELY( penalty_treap && treap_ele_cnt( root )==0UL ) ) {
2914 0 : penalty_map_remove( pack->penalty_treaps, penalty_treap );
2915 0 : }
2916 :
2917 495471 : return delete_cnt;
2918 495471 : }
2919 :
2920 : ulong
2921 : fd_pack_delete_transaction( fd_pack_t * pack,
2922 180 : fd_ed25519_sig_t const * sig0 ) {
2923 180 : ulong cnt = 0;
2924 180 : ulong next = ULONG_MAX;
2925 180 : for( ulong idx = sig2txn_idx_query_const( pack->signature_map, (wrapped_sig_t const *)sig0, ULONG_MAX, pack->pool );
2926 336 : idx!=ULONG_MAX; idx=next ) {
2927 : /* Iterating while deleting, not just this element, but perhaps the
2928 : whole bundle, feels a bit dangerous, but is actually fine because
2929 : a bundle can't contain two transactions with the same signature.
2930 : That means we know next is not part of the same bundle as idx,
2931 : which means that deleting idx will not delete next. */
2932 156 : next = sig2txn_idx_next_const( idx, ULONG_MAX, pack->pool );
2933 156 : cnt += delete_transaction( pack, pack->pool+idx, 1, 1 );
2934 156 : }
2935 :
2936 180 : return cnt;
2937 180 : }
2938 :
2939 :
2940 : int
2941 : fd_pack_verify( fd_pack_t * pack,
2942 438 : void * scratch ) {
2943 : /* Invariants:
2944 : sig2txn_query has exact same contents as all treaps combined
2945 : root matches treap
2946 : Keys of acct_to_bitset is exactly union of all accounts in all
2947 : transactions in treaps, with ref counted appropriately
2948 : bits in bitset_avail is complement of bits allocated in
2949 : acct_to_bitset
2950 : expires_at consistent between treap, prq
2951 : use_by_bank does not contain duplicates
2952 : use_by_bank consistent with acct_in_use
2953 : elements in pool but not in a treap have root set to free
2954 : all penalty treaps have at least one transaction
2955 : all elements in penalty treaps are in the one that the root indicates
2956 : */
2957 :
2958 : /* TODO:
2959 : bitset_{r}w_in_use = bitset_map_query( everything in acct_in_use that doesn't have FD_PACK_IN_USE_BIT_CLEARED )
2960 : bitset_w_in_use & bitset_rw_in_use == bitset_w_in_use
2961 : */
2962 316762 : #define VERIFY_TEST( cond, ... ) do { \
2963 316762 : if( FD_UNLIKELY( !(cond) ) ) { \
2964 0 : FD_LOG_WARNING(( __VA_ARGS__ )); \
2965 0 : return -(__LINE__); \
2966 0 : } \
2967 316762 : } while( 0 )
2968 :
2969 438 : ulong max_acct_in_treap = pack->pack_depth * FD_TXN_ACCT_ADDR_MAX;
2970 438 : int lg_acct_in_trp = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*max_acct_in_treap ) );
2971 438 : void * _bitset_map_copy = scratch;
2972 438 : void * _bitset_map_orig = bitset_map_leave( pack->acct_to_bitset );
2973 438 : fd_memcpy( _bitset_map_copy, _bitset_map_orig, bitset_map_footprint( lg_acct_in_trp ) );
2974 :
2975 438 : fd_pack_bitset_acct_mapping_t * bitset_copy = bitset_map_join( _bitset_map_copy );
2976 :
2977 : /* Check that each bit is in exactly one place */
2978 438 : FD_PACK_BITSET_DECLARE( processed ); FD_PACK_BITSET_CLEAR( processed );
2979 438 : FD_PACK_BITSET_DECLARE( bit ); FD_PACK_BITSET_CLEAR( bit );
2980 438 : FD_PACK_BITSET_DECLARE( full ); FD_PACK_BITSET_CLEAR( full );
2981 :
2982 438 : if( FD_UNLIKELY( pack->bitset_avail[0]!=FD_PACK_BITSET_SLOWPATH ) ) return -1;
2983 149264 : for( ulong i=1UL; i<=pack->bitset_avail_cnt; i++ ) {
2984 148826 : FD_PACK_BITSET_CLEAR( bit );
2985 148826 : FD_PACK_BITSET_SETN( bit, pack->bitset_avail[ i ] );
2986 148826 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, processed, processed ),
2987 148826 : "bit %hu in avail set twice", pack->bitset_avail[ i ] );
2988 148826 : FD_PACK_BITSET_OR( processed, bit );
2989 148826 : }
2990 :
2991 438 : ulong total_references = 0UL;
2992 1589281206 : for( ulong i=0UL; i<bitset_map_slot_cnt( bitset_copy ); i++ ) {
2993 1589280768 : if( !bitset_map_key_inval( bitset_copy[ i ].key ) ) {
2994 1080 : VERIFY_TEST( bitset_copy[ i ].ref_cnt>0UL, "account address in table with 0 ref count" );
2995 :
2996 1080 : total_references += bitset_copy[ i ].ref_cnt;
2997 :
2998 1080 : FD_PACK_BITSET_CLEAR( bit );
2999 1080 : FD_PACK_BITSET_SETN( bit, bitset_copy[ i ].bit );
3000 1080 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, processed, processed ), "bit %hu used twice", bitset_copy[ i ].bit );
3001 1080 : FD_PACK_BITSET_OR( processed, bit );
3002 1080 : }
3003 1589280768 : }
3004 149942 : for( ulong i=0UL; i<FD_PACK_BITSET_MAX; i++ ) {
3005 149504 : FD_PACK_BITSET_CLEAR( bit );
3006 149504 : FD_PACK_BITSET_SETN( bit, i );
3007 149504 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, processed, processed ), "bit %lu missing", i );
3008 149504 : FD_PACK_BITSET_SETN( full, i );
3009 149504 : }
3010 :
3011 :
3012 438 : fd_pack_ord_txn_t * pool = pack->pool;
3013 438 : treap_t * treaps[ 3 ] = { pack->pending, pack->pending_votes, pack->pending_bundles };
3014 438 : ulong txn_cnt = 0UL;
3015 :
3016 24834264 : for( ulong k=0UL; k<3UL+penalty_map_slot_cnt( pack->penalty_treaps ); k++ ) {
3017 24833826 : treap_t * treap = NULL;
3018 :
3019 24833826 : if( k<3UL ) treap = treaps[ k ];
3020 24832512 : else if( FD_LIKELY( penalty_map_key_inval( pack->penalty_treaps[ k-3UL ].key ) ) ) continue;
3021 0 : else {
3022 0 : treap = pack->penalty_treaps[ k-3UL ].penalty_treap;
3023 0 : VERIFY_TEST( treap_ele_cnt( treap )>0UL, "empty penalty treap in map" );
3024 0 : }
3025 :
3026 1737 : for( treap_rev_iter_t _cur=treap_rev_iter_init( treap, pool ); !treap_rev_iter_done( _cur );
3027 1314 : _cur=treap_rev_iter_next( _cur, pool ) ) {
3028 423 : txn_cnt++;
3029 423 : fd_pack_ord_txn_t const * cur = treap_rev_iter_ele_const( _cur, pool );
3030 423 : fd_txn_t const * txn = TXN(cur->txn);
3031 423 : fd_acct_addr_t const * accts = fd_txn_get_acct_addrs( txn, cur->txn->payload );
3032 423 : fd_acct_addr_t const * alt_adj = cur->txn_e->alt_accts - fd_txn_account_cnt( txn, FD_TXN_ACCT_CAT_IMM );
3033 :
3034 423 : fd_ed25519_sig_t const * sig0 = fd_txn_get_signatures( txn, cur->txn->payload );
3035 :
3036 423 : fd_pack_ord_txn_t const * in_tbl = sig2txn_ele_query_const( pack->signature_map, (wrapped_sig_t const *)sig0, NULL, pool );
3037 423 : VERIFY_TEST( in_tbl, "signature missing from sig2txn" );
3038 :
3039 423 : VERIFY_TEST( (ulong)(cur->root & FD_ORD_TXN_ROOT_TAG_MASK)==fd_ulong_min( k, 3UL )+1UL, "treap element had bad root" );
3040 423 : if( FD_LIKELY( (cur->root & FD_ORD_TXN_ROOT_TAG_MASK)==FD_ORD_TXN_ROOT_PENALTY(0) ) ) {
3041 0 : fd_acct_addr_t const * penalty_acct = ACCT_IDX_TO_PTR( FD_ORD_TXN_ROOT_PENALTY_ACCT_IDX( cur->root ) );
3042 0 : VERIFY_TEST( !memcmp( penalty_acct, pack->penalty_treaps[ k-3UL ].key.b, 32UL ), "transaction in wrong penalty treap" );
3043 0 : }
3044 423 : VERIFY_TEST( cur->expires_at>=pack->expire_before, "treap element expired" );
3045 :
3046 423 : fd_pack_expq_t const * eq = pack->expiration_q + cur->expq_idx;
3047 423 : VERIFY_TEST( eq->txn==cur, "expq inconsistent" );
3048 423 : VERIFY_TEST( eq->expires_at==cur->expires_at, "expq expires_at inconsistent" );
3049 :
3050 423 : FD_PACK_BITSET_DECLARE( complement );
3051 423 : FD_PACK_BITSET_COPY( complement, full );
3052 423 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_WRITABLE );
3053 1413 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
3054 990 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
3055 :
3056 990 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( bitset_copy, acct, NULL );
3057 990 : VERIFY_TEST( q, "account in transaction missing from bitset mapping" );
3058 990 : VERIFY_TEST( q->ref_cnt>0UL, "account in transaction ref_cnt already 0" );
3059 990 : q->ref_cnt--;
3060 990 : total_references--;
3061 :
3062 990 : FD_PACK_BITSET_CLEAR( bit );
3063 990 : FD_PACK_BITSET_SETN( bit, q->bit );
3064 990 : if( q->bit<FD_PACK_BITSET_MAX ) {
3065 597 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, cur->rw_bitset, cur->rw_bitset ), "missing from rw bitset" );
3066 597 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, cur->w_bitset, cur->w_bitset ), "missing from w bitset" );
3067 597 : }
3068 990 : FD_PACK_BITSET_CLEARN( complement, q->bit );
3069 990 : }
3070 423 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( complement, complement, cur->w_bitset, cur->w_bitset ), "extra in w bitset" );
3071 :
3072 423 : for( fd_txn_acct_iter_t iter=fd_txn_acct_iter_init( txn, FD_TXN_ACCT_CAT_READONLY );
3073 1836 : iter!=fd_txn_acct_iter_end(); iter=fd_txn_acct_iter_next( iter ) ) {
3074 :
3075 1413 : fd_acct_addr_t acct = *ACCT_ITER_TO_PTR( iter );
3076 1413 : if( FD_UNLIKELY( fd_pack_unwritable_contains( &acct ) ) ) continue;
3077 888 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( bitset_copy, acct, NULL );
3078 888 : VERIFY_TEST( q, "account in transaction missing from bitset mapping" );
3079 888 : VERIFY_TEST( q->ref_cnt>0UL, "account in transaction ref_cnt already 0" );
3080 888 : q->ref_cnt--;
3081 888 : total_references--;
3082 :
3083 888 : FD_PACK_BITSET_CLEAR( bit );
3084 888 : FD_PACK_BITSET_SETN( bit, q->bit );
3085 888 : if( q->bit<FD_PACK_BITSET_MAX ) {
3086 879 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, cur->rw_bitset, cur->rw_bitset ), "missing from rw bitset" );
3087 879 : }
3088 888 : FD_PACK_BITSET_CLEARN( complement, q->bit );
3089 888 : }
3090 423 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( complement, complement, cur->rw_bitset, cur->rw_bitset ), "extra in rw bitset" );
3091 423 : }
3092 1314 : }
3093 :
3094 438 : bitset_map_leave( bitset_copy );
3095 438 : VERIFY_TEST( txn_cnt==pack->pending_txn_cnt, "txn_cnt" );
3096 :
3097 438 : VERIFY_TEST( total_references==0UL, "extra references in bitset mapping" );
3098 438 : ulong sig2txn_key_cnt = 0UL;
3099 438 : for( sig2txn_iter_t iter = sig2txn_iter_init( pack->signature_map, pool );
3100 861 : !sig2txn_iter_done( iter, pack->signature_map, pool );
3101 438 : iter = sig2txn_iter_next( iter, pack->signature_map, pool ) ) {
3102 423 : sig2txn_key_cnt++;
3103 423 : }
3104 438 : VERIFY_TEST( txn_cnt==sig2txn_key_cnt, "extra signatures in sig2txn" );
3105 438 : VERIFY_TEST( !sig2txn_verify( pack->signature_map, trp_pool_max( pool ), pool ), "sig2txn corrupt" );
3106 :
3107 : /* Count noncemap keys */
3108 438 : ulong noncemap_key_cnt = 0UL;
3109 438 : for( noncemap_iter_t iter = noncemap_iter_init( pack->noncemap, pool );
3110 486 : !noncemap_iter_done( iter, pack->noncemap, pool );
3111 438 : iter = noncemap_iter_next( iter, pack->noncemap, pool ) ) {
3112 48 : noncemap_key_cnt++;
3113 : /* Ensure element is in pool */
3114 48 : fd_pack_ord_txn_t const * ord = noncemap_iter_ele_const( iter, pack->noncemap, pool );
3115 48 : VERIFY_TEST( ord->txn->flags & FD_TXN_P_FLAGS_DURABLE_NONCE, "invalid entry in noncemap" );
3116 :
3117 : /* Although pack allows multiple transactions with the same
3118 : signature in sig2txn (MAP_MULTI==1), the noncemap checks prevent
3119 : multiple nonce transactions with the same signature. */
3120 48 : wrapped_sig_t sig = FD_LOAD( wrapped_sig_t, fd_txn_get_signatures( TXN( ord->txn ), ord->txn->payload ) );
3121 48 : VERIFY_TEST( ord==sig2txn_ele_query_const( pack->signature_map, &sig, NULL, pool ), "noncemap and sig2txn desynced" );
3122 48 : }
3123 438 : VERIFY_TEST( txn_cnt>=noncemap_key_cnt, "phantom txns in noncemap" );
3124 438 : VERIFY_TEST( !noncemap_verify( pack->noncemap, trp_pool_max( pool ), pool ), "noncemap corrupt" );
3125 :
3126 438 : ulong slots_found = 0UL;
3127 438 : ulong const pool_max = trp_pool_max( pool );
3128 3890922 : for( ulong i=0UL; i<pool_max; i++ ) {
3129 3890484 : fd_pack_ord_txn_t * ord = pack->pool + i;
3130 3890484 : if( ord->root!=FD_ORD_TXN_ROOT_FREE ) slots_found++;
3131 3890484 : }
3132 438 : VERIFY_TEST( slots_found==txn_cnt, "phantom slots in pool" );
3133 :
3134 438 : bitset_map_join( _bitset_map_orig );
3135 :
3136 438 : int lg_uses_tbl_sz = acct_uses_lg_slot_cnt( pack->acct_in_use );
3137 :
3138 438 : void * _acct_in_use_copy = scratch;
3139 438 : void * _acct_in_use_orig = acct_uses_leave( pack->acct_in_use );
3140 438 : fd_memcpy( _acct_in_use_copy, _acct_in_use_orig, acct_uses_footprint( lg_uses_tbl_sz ) );
3141 :
3142 438 : fd_pack_addr_use_t * acct_in_use_copy = acct_uses_join( _acct_in_use_copy );
3143 :
3144 438 : FD_PACK_BITSET_DECLARE( w_complement );
3145 438 : FD_PACK_BITSET_DECLARE( rw_complement );
3146 438 : FD_PACK_BITSET_COPY( w_complement, full );
3147 438 : FD_PACK_BITSET_COPY( rw_complement, full );
3148 :
3149 438 : FD_PACK_BITSET_DECLARE( rw_bitset ); FD_PACK_BITSET_COPY( rw_bitset, pack->bitset_rw_in_use );
3150 438 : FD_PACK_BITSET_DECLARE( w_bitset ); FD_PACK_BITSET_COPY( w_bitset, pack->bitset_w_in_use );
3151 :
3152 :
3153 438 : ulong const EMPTY_MASK = ~(FD_PACK_IN_USE_WRITABLE | FD_PACK_IN_USE_BIT_CLEARED);
3154 :
3155 12255 : for( ulong bank=0UL; bank<pack->bank_tile_cnt; bank++ ) {
3156 :
3157 11817 : fd_pack_addr_use_t const * base = pack->use_by_bank[ bank ];
3158 11817 : ulong bank_mask = 1UL << bank;
3159 :
3160 12672 : for( ulong i=0UL; i<pack->use_by_bank_cnt[ bank ]; i++ ) {
3161 855 : fd_pack_addr_use_t * use = acct_uses_query( acct_in_use_copy, base[i].key, NULL );
3162 855 : VERIFY_TEST( use, "acct in use by bank not in acct_in_use, or in uses_by_bank twice" );
3163 :
3164 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" );
3165 :
3166 855 : fd_pack_bitset_acct_mapping_t * q = bitset_map_query( pack->acct_to_bitset, base[i].key, NULL );
3167 : /* The normal case is that the acct->bit mapping is preserved
3168 : while in use by other transactions in the pending list. This
3169 : might not always happen though. It's okay for the mapping to
3170 : get deleted while the acct is in use, which is noted with
3171 : BIT_CLEARED. If that is set, the mapping may not exist, or it
3172 : may have been re-created, perhaps with a different bit. */
3173 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" );
3174 0 : else if( !(use->in_use_by & FD_PACK_IN_USE_BIT_CLEARED) ) {
3175 0 : FD_PACK_BITSET_CLEAR( bit );
3176 0 : FD_PACK_BITSET_SETN( bit, q->bit );
3177 0 : if( q->bit<FD_PACK_BITSET_MAX ) {
3178 0 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, rw_bitset, rw_bitset ), "missing from rw bitset" );
3179 0 : if( use->in_use_by & FD_PACK_IN_USE_WRITABLE ) {
3180 0 : VERIFY_TEST( !FD_PACK_BITSET_INTERSECT4_EMPTY( bit, bit, w_bitset, w_bitset ), "missing from w bitset" );
3181 0 : FD_PACK_BITSET_CLEARN( w_complement, q->bit );
3182 0 : }
3183 0 : }
3184 0 : FD_PACK_BITSET_CLEARN( rw_complement, q->bit );
3185 0 : }
3186 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" );
3187 :
3188 855 : use->in_use_by &= ~bank_mask;
3189 855 : if( !(use->in_use_by & EMPTY_MASK) ) acct_uses_remove( acct_in_use_copy, use );
3190 855 : }
3191 11817 : }
3192 438 : VERIFY_TEST( acct_uses_key_cnt( acct_in_use_copy )==0UL, "stray uses in acct_in_use" );
3193 438 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( rw_complement, rw_complement, rw_bitset, rw_bitset ), "extra in rw bitset" );
3194 438 : VERIFY_TEST( FD_PACK_BITSET_INTERSECT4_EMPTY( w_complement, w_complement, w_bitset, w_bitset ), "extra in w bitset" );
3195 :
3196 438 : acct_uses_leave( acct_in_use_copy );
3197 :
3198 438 : acct_uses_join( _acct_in_use_orig );
3199 438 : return 0;
3200 438 : }
3201 :
3202 3 : void * fd_pack_leave ( fd_pack_t * pack ) { FD_COMPILER_MFENCE(); return (void *)pack; }
3203 3 : void * fd_pack_delete( void * mem ) { FD_COMPILER_MFENCE(); return mem; }
|
