Line data Source code
1 : #ifndef HEADER_fd_src_disco_pack_fd_pack_h
2 : #define HEADER_fd_src_disco_pack_fd_pack_h
3 :
4 : /* fd_pack defines methods that prioritizes Solana transactions,
5 : selecting a subset (potentially all) and ordering them to attempt to
6 : maximize the overall profitability of the validator. */
7 :
8 : #include "../../ballet/fd_ballet_base.h"
9 : #include "../../ballet/txn/fd_txn.h"
10 : #include "../shred/fd_shred_batch.h"
11 : #include "fd_est_tbl.h"
12 : #include "fd_microblock.h"
13 : #include "fd_pack_rebate_sum.h"
14 : #include "../metrics/generated/fd_metrics_enums.h"
15 :
16 0 : #define FD_PACK_ALIGN (128UL)
17 :
18 30675 : #define FD_PACK_MAX_EXECLE_TILES 62UL
19 :
20 74625 : #define FD_PACK_FEE_PER_SIGNATURE (5000UL) /* In lamports */
21 :
22 : /* Each block is limited to 32k parity shreds. We don't want pack to
23 : produce a block with so many transactions we can't shred it, but the
24 : correspondence between transactions and parity shreds is somewhat
25 : complicated, so we need to use conservative limits. */
26 0 : #define FD_PACK_MAX_DATA_PER_BLOCK (FD_SHRED_BATCH_BLOCK_DATA_SZ_MAX)
27 :
28 : /* Optionally allow up to 1M shreds per block for benchmarking. */
29 0 : #define LARGER_MAX_DATA_PER_BLOCK (32UL*FD_SHRED_BATCH_BLOCK_DATA_SZ_MAX)
30 :
31 : /* Optionally allow a larger limit for benchmarking */
32 0 : #define LARGER_MAX_COST_PER_BLOCK (18UL*FD_PACK_MAX_COST_PER_BLOCK_LOWER_BOUND)
33 :
34 : /* ---- End consensus-critical constants */
35 :
36 104487 : #define FD_TXN_P_FLAGS_IS_SIMPLE_VOTE ( 1U)
37 37227 : #define FD_TXN_P_FLAGS_BUNDLE ( 2U)
38 38874 : #define FD_TXN_P_FLAGS_INITIALIZER_BUNDLE ( 4U)
39 60 : #define FD_TXN_P_FLAGS_SANITIZE_SUCCESS ( 8U)
40 144 : #define FD_TXN_P_FLAGS_EXECUTE_SUCCESS (16U)
41 : #define FD_TXN_P_FLAGS_FEES_ONLY (32U)
42 74619 : #define FD_TXN_P_FLAGS_DURABLE_NONCE (64U)
43 :
44 105 : #define FD_TXN_P_FLAGS_RESULT_MASK (0xFF000000U)
45 :
46 : /* A bundle is a sequence of between 1 and FD_PACK_MAX_TXN_PER_BUNDLE
47 : transactions (both inclusive) that executes and commits atomically.
48 : */
49 12063 : #define FD_PACK_MAX_TXN_PER_BUNDLE 5UL
50 :
51 235917 : #define FD_PACK_ACCT_BLOCKLIST_LG_MAX 4
52 354 : #define FD_PACK_ACCT_BLOCKLIST_MAX (1UL<<FD_PACK_ACCT_BLOCKLIST_LG_MAX)
53 :
54 : /* The percentage of the transaction fees that are burned */
55 37311 : #define FD_PACK_TXN_FEE_BURN_PCT 50UL
56 :
57 : /* The Solana network and Firedancer implementation details impose
58 : several limits on what pack can produce. These limits are grouped in
59 : this one struct fd_pack_limits_t, which is just a convenient way to
60 : pass them around. The limits listed below are arithmetic limits.
61 : The limits imposed by practical constraints are almost certainly
62 : much, much tighter. */
63 : struct fd_pack_limits {
64 : /* max_{cost, vote_cost}_per_block, max_write_cost_per_acct are
65 : consensus-critical limits and must be agreed on cluster-wide. A
66 : block that consumes more than max_cost_per_block cost units
67 : (closely related to, but not identical to CUs) in total is invalid.
68 : Similarly, a block where the sum of the cost of all vote
69 : transactions exceeds max_vote_cost_per_block cost units is invalid.
70 : Similarly, a block in where the sum of the cost of all transactions
71 : that write to a given account exceeds max_write_cost_per_acct is
72 : invalid. */
73 : ulong max_cost_per_block; /* in [0, UINT_MAX) */
74 : ulong max_vote_cost_per_block; /* in [0, max_cost_per_block] */
75 : ulong max_write_cost_per_acct; /* in [0, max_cost_per_block] */
76 :
77 : /* max_data_bytes_per_block is derived from consensus-critical limits
78 : on the number of shreds in a block, but is not directly enforced.
79 : Separation of concerns means that it's not a good idea for pack to
80 : know exactly how the block will be shredded, but at the same time,
81 : we don't want to end up in a situation where we produced a block
82 : that had too many shreds, because the shred tile's only recourse
83 : would be to kill the block. To address this, pack limits the size
84 : of the data it puts into the block to a limit that we can prove
85 : will never cause the shred tile to produce too many shreds.
86 :
87 : This limit includes transaction and microblock headers for
88 : non-empty microblocks that pack produces. */
89 : ulong max_data_bytes_per_block; /* in [0, ULONG_MAX - 183] */
90 :
91 : /* max_txn_per_microblock and max_microblocks_per_block are
92 : Firedancer-imposed implementation limits to bound the amount of
93 : memory consumption that pack uses. Pack will produce microblocks
94 : with no more than max_txn_per_microblock transactions.
95 : Additionally, once pack produces max_microblocks_per_block
96 : non-empty microblocks in a block, all subsequent attempts to
97 : schedule a microblock will return an empty microblock until
98 : fd_pack_end_block is called. */
99 : ulong max_txn_per_microblock; /* in [0, 16777216] */
100 : ulong max_microblocks_per_block; /* in [0, 1e12) */
101 :
102 : /* max_allocated_data_per_block is a consensus-critical constant that
103 : limits the total amount of data that can be allocated by
104 : transactions in a block. This includes new accounts and extending
105 : existing accounts. This limit is not especially well specified,
106 : and rarely comes close to being hit in production, so we use a
107 : conservative estimate when packing to ensure we never hit it. It
108 : is currently limited to 100 MB, without any features to change it,
109 : but we include it here with other limits in case it is change-able
110 : in the future. */
111 : ulong max_allocated_data_per_block; /* in [1, 100,000,000 ] */
112 : };
113 : typedef struct fd_pack_limits fd_pack_limits_t;
114 :
115 : /* fd_pack_addr_use_t: Used for three distinct purposes:
116 : - to record that an address is in use and can't be used again until
117 : certain microblocks finish execution
118 : - to keep track of the cost of all transactions that write to the
119 : specified account.
120 : - to keep track of the write cost for accounts referenced by
121 : transactions in a bundle and which transactions use which
122 : accounts.
123 : Making these separate structs might make it more clear, but then
124 : they'd have identical shape and result in several fd_map_dynamic sets
125 : of functions with identical code. It doesn't seem like the compiler
126 : is very good at merging code like that, so in order to reduce code
127 : bloat, we'll just combine them. */
128 : struct fd_pack_private_addr_use_record {
129 : fd_acct_addr_t key; /* account address */
130 : union {
131 : ulong _;
132 : ulong in_use_by; /* Bitmask indicating which banks */
133 : ulong total_cost; /* In cost units/CUs */
134 : struct { uint carried_cost; /* In cost units */
135 : ushort ref_cnt; /* In transactions */
136 : ushort last_use_in; }; /* In transactions */
137 : };
138 : };
139 : typedef struct fd_pack_private_addr_use_record fd_pack_addr_use_t;
140 :
141 : /* The point of this array it to keep a simple heap of the top 5
142 : writable accounts by cus in a given slot. The top writers heap is
143 : constructed and available at the end of a leader slot, after all CUs
144 : have been rebated. */
145 16218 : #define FD_PACK_TOP_WRITERS_CNT (5UL)
146 32805 : #define FD_PACK_TOP_WRITERS_SORT_BEFORE(writer1,writer2) ( (memcmp( (writer1).key.b, &(uchar[32]){ 0 }, FD_TXN_ACCT_ADDR_SZ ) && (writer1).total_cost>(writer2).total_cost) || !memcmp( (writer2).key.b, &(uchar[32]){ 0 }, FD_TXN_ACCT_ADDR_SZ ))
147 :
148 : #define SORT_NAME fd_pack_writer_cost_sort
149 65241 : #define SORT_KEY_T fd_pack_addr_use_t
150 32805 : #define SORT_BEFORE(a,b) (FD_PACK_TOP_WRITERS_SORT_BEFORE(a,b))
151 : #define SORT_FN_ATTR __attribute__((no_sanitize("address", "undefined"))) /* excessive ASan slowdown */
152 : #include "../../util/tmpl/fd_sort.c"
153 :
154 : /* fd_pack_limit_usage_t is used to store the actual per-slot resource
155 : utilization. Each utilization field has a corresponding limit field
156 : in fd_pack_limits_t which is greater than or equal to the utilization
157 : field. */
158 : struct fd_pack_limits_usage {
159 : ulong block_cost;
160 : ulong vote_cost;
161 :
162 : /* Contains the top 5 writers in the block. If there are less than 5
163 : writeable accounts, unused slots will have their pubkey zeroed out. */
164 : fd_pack_addr_use_t top_writers[ FD_PACK_TOP_WRITERS_CNT ];
165 : ulong block_data_bytes;
166 : ulong microblocks;
167 : ulong alloc;
168 : };
169 :
170 : typedef struct fd_pack_limits_usage fd_pack_limits_usage_t;
171 :
172 : /* fd_pack_smallest: We want to keep track of the smallest transaction
173 : in each treap. That way, if we know the amount of space left in the
174 : block is less than the smallest transaction in the heap, we can just
175 : skip the heap. Since transactions can be deleted, etc. maintaining
176 : this precisely is hard, but we can maintain a conservative value
177 : fairly cheaply. Since the CU limit or the byte limit can be the one
178 : that matters, we keep track of the smallest by both. */
179 : struct fd_pack_smallest {
180 : ulong cus;
181 : ulong bytes;
182 : };
183 : typedef struct fd_pack_smallest fd_pack_smallest_t;
184 :
185 : /* Forward declare opaque handle */
186 : struct fd_pack_private;
187 : typedef struct fd_pack_private fd_pack_t;
188 :
189 : /* fd_pack_{align,footprint} return the required alignment and
190 : footprint in bytes for a region of memory to be used as a pack
191 : object.
192 :
193 : pack_depth sets the maximum number of pending transactions that pack
194 : stores and may eventually schedule. pack_depth must be at least 4.
195 :
196 : If bundle_meta_sz is non-zero, then the bundle-related functions on
197 : this pack object can be used, and it can schedule bundles.
198 : Additionally, if bundle_meta_sz is non-zero, then a region of size
199 : bundle_meta_sz bytes (with no additional alignment) will be reserved
200 : for each bundle.
201 :
202 : Note: if you'd like to use bundles, but don't require metadata for
203 : the bundles, simply use a small positive value (e.g. 1), always pass
204 : NULL in insert_bundle_fini, and never call fd_pack_peek_bundle_meta.
205 :
206 : bank_tile_cnt sets the number of bank tiles to which this pack object
207 : can schedule transactions. bank_tile_cnt must be in [1,
208 : FD_PACK_MAX_BANK_TILES].
209 :
210 : limits sets various limits for the blocks and microblocks that pack
211 : can produce. */
212 :
213 0 : FD_FN_CONST static inline ulong fd_pack_align ( void ) { return FD_PACK_ALIGN; }
214 :
215 : FD_FN_PURE ulong
216 : fd_pack_footprint( ulong pack_depth,
217 : ulong bundle_meta_sz,
218 : ulong bank_tile_cnt,
219 : fd_pack_limits_t const * limits );
220 :
221 :
222 : /* fd_pack_new formats a region of memory to be suitable for use as a
223 : pack object. mem is a non-NULL pointer to a region of memory in the
224 : local address space with the required alignment and footprint.
225 : pack_depth, bundle_meta_sz, bank_tile_cnt, and limits are as above.
226 : rng is a local join to a random number generator used to perturb
227 : estimates. acct_blocklist is a list of accounts that cannot be read
228 : or written to. acct_blocklist is accessed acct_blocklist[i] for i in
229 : [0, acct_blocklist_cnt). acct_blocklist==NULL is okay if
230 : acct_blocklist_cnt==0. acct_blocklist_cnt must be no more than
231 : FD_PACK_ACCT_BLOCKLIST_MAX. acct_blocklist must not contain
232 : duplicates or the zero address.
233 :
234 : Returns `mem` (which will be properly formatted as a pack object) on
235 : success and NULL on failure. Logs details on failure. The caller
236 : will not be joined to the pack object when this function returns. */
237 : void *
238 : fd_pack_new( void * mem,
239 : ulong pack_depth,
240 : ulong bundle_meta_sz,
241 : ulong bank_tile_cnt,
242 : fd_pack_limits_t const * limits,
243 : fd_acct_addr_t const * acct_blocklist,
244 : ulong acct_blocklist_cnt,
245 : fd_rng_t * rng );
246 :
247 : /* fd_pack_join joins the caller to the pack object. Every successful
248 : join should have a matching leave. Returns mem. */
249 : fd_pack_t * fd_pack_join( void * mem );
250 :
251 :
252 : /* fd_pack_avail_txn_cnt returns the number of transactions that this
253 : pack object has available to schedule but that have not been
254 : scheduled yet. pack must be a valid local join. The return value
255 : will be in [0, pack_depth). */
256 :
257 : /* For performance reasons, implement this here. The offset is STATIC_ASSERTed
258 : in fd_pack.c. */
259 30426 : #define FD_PACK_PENDING_TXN_CNT_OFF 80
260 : FD_FN_PURE static inline ulong
261 30426 : fd_pack_avail_txn_cnt( fd_pack_t const * pack ) {
262 30426 : return *((ulong const *)((uchar const *)pack + FD_PACK_PENDING_TXN_CNT_OFF));
263 30426 : }
264 :
265 : /* fd_pack_current_block_cost returns the number of CUs that have been
266 : scheduled in the current block, net of any rebates. It should be
267 : between 0 and the specified value of max_cost_per_block, but it can
268 : be slightly higher due to temporary cost model nonsense. Due to
269 : rebates, this number may decrease as the block progresses. pack must
270 : be a valid local join. */
271 : FD_FN_PURE ulong fd_pack_current_block_cost( fd_pack_t const * pack );
272 :
273 : /* fd_pack_bank_tile_cnt: returns the value of bank_tile_cnt provided in
274 : pack when the pack object was initialized with fd_pack_new. pack
275 : must be a valid local join. The result will be in [1,
276 : FD_PACK_MAX_BANK_TILES]. */
277 : FD_FN_PURE ulong fd_pack_bank_tile_cnt( fd_pack_t const * pack );
278 :
279 : /* fd_pack_set_block_limits: Updates the limits provided fd_pack_new to
280 : these new values. Any future microblocks produced by this pack
281 : object will not cause a block to have more than
282 : limits->max_microblocks_per_block non-empty microblocks or more than
283 : limits->max_data_bytes_per_block data bytes (counting microblock
284 : headers as before). future microblocks will also exclude those that
285 : cause the total block cost to exceed limits->max_cost_per_block.
286 : Similarly those that cause the total vote-only cost to exceed
287 : limits->max_vote_cost_per_block. Also, those that cause the total
288 : per-account, per block write cost to exceed
289 : limits->max_write_cost_per_acct. Note that
290 : limits->max_txn_per_microblock is ignored. Limits are inclusive, as
291 : per usual (i.e. a block may have exactly max_microblocks_per_block
292 : microblocks, but not more). pack must be a valid local join.
293 :
294 : The typical place to call this is immediately after
295 : fd_pack_end_block; if this is called after some microblocks have been
296 : produced for the current block, and the current block already exceeds
297 : the limits, all the remaining microblocks in the block will be empty,
298 : but the call is valid. */
299 : void fd_pack_set_block_limits( fd_pack_t * pack, fd_pack_limits_t const * limits );
300 :
301 : /* fd_pack_get_block_limits: Copies the currently active pack limits
302 : into opt_limits, if opt_limits is not NULL. Copies the current limit
303 : utilization in opt_limits_usage, if opt_limits_usage is not NULL.
304 :
305 : Limit utilization is updated both when each transactions is scheduled
306 : and when any used resources are rebated.
307 :
308 : The opt_limits_usage->top_writers field is ignored. */
309 : void fd_pack_get_block_limits( fd_pack_t * pack, fd_pack_limits_usage_t * opt_limits_usage, fd_pack_limits_t * opt_limits );
310 :
311 : /* fd_pack_get_top_writers copies the top FD_PACK_TOP_WRITERS_CNT by
312 : writer cost writers into top_writers. The copied elements will be
313 : sorted by writer cost in descending order.
314 :
315 : This should be called at the end of the relevant leader slot right
316 : after fd_pack_end_block, otherwise the copied data will be stale. */
317 : void fd_pack_get_top_writers( fd_pack_t const * pack, fd_pack_addr_use_t top_writers[static FD_PACK_TOP_WRITERS_CNT] );
318 :
319 : /* Copies the currently smallest pending,
320 : non-conflicting, non-vote transaction into opt_pending_smallest iff
321 : it is not NULL and the smallest pending vote into opt_vote_smallest
322 : iff it is not NULL. These values are updates any time a new
323 : transaction is inserted into the pending treap, or moved from another
324 : treap into the pending treap. */
325 : void fd_pack_get_pending_smallest( fd_pack_t * pack, fd_pack_smallest_t * opt_pending_smallest, fd_pack_smallest_t * opt_votes_smallest );
326 :
327 : /* Return values for fd_pack_insert_txn_fini: Non-negative values
328 : indicate the transaction was accepted and may be returned in a future
329 : microblock. Negative values indicate that the transaction was
330 : rejected and will never be returned in a future microblock.
331 : Transactions can be rejected through no fault of their own, so it
332 : doesn't necessarily imply bad behavior.
333 :
334 : The non-negative (success) codes are essentially a bitflag of three
335 : bits:
336 : * (1) whether the transaction met the criteria for a simple vote or
337 : not,
338 : * (2) whether this transaction replaced a previously accepted, low
339 : priority transaction, rather than being accepted in addition to
340 : all the previously accepted transactions.
341 : * (4) whether this transaction is a durable nonce transaction
342 :
343 : Since pack maintains a heap with a fixed max size of pack_depth,
344 : replacing transaction is necessary whenever the heap is full.
345 : Additionally, only one transaction with a given (nonce account, nonce
346 : authority, recent blockhash) value is allowed in pack's heap at a
347 : time, which means if there's already a lower priority transaction
348 : with the same nonce info, then this transaction will replace it.
349 : When the heap is full, and a nonce transaction is inserted, these
350 : return values don't allow you to disambiguate whether the replaced
351 : transaction had the same nonce info or not.
352 :
353 : Vote and durable nonce transactions are mutually exclusive.
354 :
355 : The negative (failure) codes are a normal enumeration (not a
356 : bitflag).
357 : * PRIORITY: pack's heap was full and the transaction's priority was
358 : lower than the worst currently accepted transaction.
359 : * NONCE_PRIORITY: pack's heap had a transaction with the same
360 : durable nonce info that was higher priority.
361 : * DUPLICATE: the transaction is a duplicate of a currently accepted
362 : transaction.
363 : * UNAFFORDABLE: the fee payer could not afford the transaction fee
364 : (not yet implemented).
365 : * ADDR_LUT: the transaction tried to load an account from an address
366 : lookup table, which is not yet supported.
367 : * EXPIRED: the transaction was already expired upon insertion based
368 : on the provided value of expires_at compared to the last call to
369 : fd_pack_expire_before.
370 : * TOO_LARGE: the transaction requested too many CUs and would never
371 : be scheduled if it had been accepted.
372 : * ACCOUNT_CNT: the transaction tried to load more than 64 account
373 : addresses.
374 : * DUPLICATE_ACCT: the transaction included an account address twice
375 : in its list of account addresses to load.
376 : * ESTIMATION_FAIL: estimation of the transaction's compute cost and
377 : fee failed, typically because the transaction contained a
378 : malformed ComputeBudgetProgram instruction.
379 : * WRITES_SYSVAR: the transaction attempts to write-lock a sysvar.
380 : Write-locking a sysvar can cause heavy contention. Agave
381 : solves this by downgrading these to read locks, but we instead
382 : solve it by refusing to pack such transactions.
383 : * INVALID_NONCE: the transaction looks like a durable nonce
384 : transaction, but the nonce authority did not sign the transaction.
385 : * BUNDLE_BLACKLIST: bundles are enabled and the transaction uses an
386 : account in the bundle blacklist, or the bundle contains a vote.
387 : * ACCT_BLOCKLIST: the transaction included an account address in the
388 : account blocklist.
389 : * NONCE_CONFLICT: bundle with two transactions that attempt to lock
390 : the exact same durable nonce (nonce account, authority, and block
391 : hash).
392 : * INSTR_ACCT_CNT: the transaction includes an instruction that
393 : references too many accounts.
394 :
395 : NOTE: The corresponding enum in metrics.xml must be kept in sync
396 : with any changes to these return values. */
397 : #define FD_PACK_INSERT_ACCEPT_NONCE_NONVOTE_REPLACE ( 6)
398 : #define FD_PACK_INSERT_ACCEPT_NONCE_NONVOTE_ADD ( 4)
399 : #define FD_PACK_INSERT_ACCEPT_VOTE_REPLACE ( 3)
400 : #define FD_PACK_INSERT_ACCEPT_NONVOTE_REPLACE ( 2)
401 : #define FD_PACK_INSERT_ACCEPT_VOTE_ADD ( 1)
402 : #define FD_PACK_INSERT_ACCEPT_NONVOTE_ADD ( 0)
403 0 : #define FD_PACK_INSERT_REJECT_PRIORITY ( -1)
404 9 : #define FD_PACK_INSERT_REJECT_NONCE_PRIORITY ( -2)
405 : #define FD_PACK_INSERT_REJECT_DUPLICATE ( -3)
406 0 : #define FD_PACK_INSERT_REJECT_UNAFFORDABLE ( -4)
407 : #define FD_PACK_INSERT_REJECT_ADDR_LUT ( -5)
408 12 : #define FD_PACK_INSERT_REJECT_EXPIRED ( -6)
409 0 : #define FD_PACK_INSERT_REJECT_TOO_LARGE ( -7)
410 3 : #define FD_PACK_INSERT_REJECT_ACCOUNT_CNT ( -8)
411 3 : #define FD_PACK_INSERT_REJECT_DUPLICATE_ACCT ( -9)
412 3 : #define FD_PACK_INSERT_REJECT_ESTIMATION_FAIL (-10)
413 93 : #define FD_PACK_INSERT_REJECT_WRITES_SYSVAR (-11)
414 3 : #define FD_PACK_INSERT_REJECT_INVALID_NONCE (-12)
415 3 : #define FD_PACK_INSERT_REJECT_BUNDLE_BLACKLIST (-13)
416 15 : #define FD_PACK_INSERT_REJECT_ACCT_BLOCKLIST (-14)
417 243 : #define FD_PACK_INSERT_REJECT_NONCE_CONFLICT (-15)
418 : #define FD_PACK_INSERT_REJECT_INSTR_ACCT_CNT (-16)
419 :
420 : /* The FD_PACK_INSERT_{ACCEPT, REJECT}_* values defined above are in the
421 : range [-FD_PACK_INSERT_RETVAL_OFF,
422 : -FD_PACK_INSERT_RETVAL_OFF+FD_PACK_INSERT_RETVAL_CNT ) */
423 0 : #define FD_PACK_INSERT_RETVAL_OFF 16
424 0 : #define FD_PACK_INSERT_RETVAL_CNT 23
425 :
426 : FD_STATIC_ASSERT( FD_PACK_INSERT_REJECT_INSTR_ACCT_CNT>=-FD_PACK_INSERT_RETVAL_OFF, pack_retval );
427 : FD_STATIC_ASSERT( FD_PACK_INSERT_ACCEPT_NONCE_NONVOTE_REPLACE<FD_PACK_INSERT_RETVAL_CNT-FD_PACK_INSERT_RETVAL_OFF, pack_retval );
428 :
429 : /* fd_pack_insert_txn_{init,fini,cancel} execute the process of
430 : inserting a new transaction into the pool of available transactions
431 : that may be scheduled by the pack object.
432 :
433 : fd_pack_insert_txn_init returns a piece of memory from the txnmem
434 : region where the transaction should be stored. The lifetime of this
435 : memory is managed by fd_pack as explained below.
436 :
437 : Every call to fd_pack_insert_init must be paired with a call to
438 : exactly one of _fini or _cancel. Calling fd_pack_insert_txn_fini
439 : finalizes the transaction insert process and makes the newly-inserted
440 : transaction available for scheduling. Calling
441 : fd_pack_insert_txn_cancel aborts the transaction insertion process.
442 : The txn pointer passed to _fini or _cancel must come from the most
443 : recent call to _init.
444 :
445 : The caller of these methods should not retain any read or write
446 : interest in the transaction after _fini or _cancel have been called.
447 :
448 : expires_at (for _fini only) bounds the lifetime of the inserted
449 : transaction. No particular unit is prescribed, and it need not be
450 : higher than the previous call to txn_fini. If fd_pack_expire_before
451 : has been previously called with a value larger (strictly) than the
452 : provided expires_at, the transaction will be rejected with EXPIRED.
453 : See fd_pack_expire_before for more details.
454 :
455 : pack must be a local join of a pack object. From the caller's
456 : perspective, these functions cannot fail, though pack may reject a
457 : transaction for a variety of reasons. fd_pack_insert_txn_fini
458 : returns one of the FD_PACK_INSERT_ACCEPT_* or FD_PACK_INSERT_REJECT_*
459 : codes explained above.
460 : */
461 : fd_txn_e_t * fd_pack_insert_txn_init ( fd_pack_t * pack );
462 : int fd_pack_insert_txn_fini ( fd_pack_t * pack, fd_txn_e_t * txn, ulong expires_at, ulong * delete_cnt );
463 : void fd_pack_insert_txn_cancel( fd_pack_t * pack, fd_txn_e_t * txn );
464 :
465 : /* fd_pack_insert_bundle_{init,fini,cancel} are parallel to the
466 : similarly named fd_pack_insert_txn functions but can be used to
467 : insert a bundle instead of a transaction.
468 :
469 : fd_pack_insert_bundle_init populates and returns bundle.
470 : Specifically, it populates bundle[0], ... bundle[txn_cnt-1] with
471 : pointers to fd_txn_p_t structs that should receive a new transaction.
472 : The pointers themselves should not be changed which is what the const
473 : indicates, but the contents of the fd_txn_p_t structs must be changed
474 : in order for this to be useful. bundle must be a pointer to the
475 : first element of an array of at least txn_cnt pointers.
476 :
477 : The bundle consists of the transactions in the order they are
478 : provided. I.e. bundle[0] will execute first in the bundle.
479 :
480 : Like with insert_txn, every call to fd_pack_insert_bundle_init must
481 : be paired with a call to exactly one of _fini or _cancel. Calling
482 : fd_pack_insert_bundle_fini finalizes the bundle insertion process and
483 : makes the newly-inserted bundle available for scheduling. Calling
484 : fd_pack_insert_bundle_cancel aborts the transaction insertion
485 : process. There can be at most two outstanding bundles, of which one
486 : should be an initializer bundle. The bundle argument passed to _fini
487 : or _cancel must be the return value of a call to _init with the same
488 : value of txn_cnt. Additionally, it is okay to interleave calls to
489 : the insert_txn family of functions with calls to the insert_bundle
490 : family of functions.
491 :
492 : The caller of these methods should not retain any read or write
493 : interest in the fd_txn_p_t structs that the entries of bundle
494 : point to after _fini or _cancel have been called.
495 :
496 : expires_at has the same meaning as above. Although transactions in
497 : the bundle may have different recent blockhashes, all transactions in
498 : the bundle have the same expires_at value, since if one expires, the
499 : whole bundle becomes invalid.
500 :
501 : If initializer_bundle is non-zero, this bundle will be inserted at
502 : the front of the bundle queue so that it is the next bundle
503 : scheduled. Otherwise, the bundle will be inserted at the back of the
504 : bundle queue, and will be scheduled in FIFO order with the rest of
505 : the bundles. If an initializer bundle is already present in pack's
506 : pending transactions, that bundle will be deleted. Additionally, if
507 : initializer_bundle is non-zero, the transactions in the bundle will
508 : not be checked against the bundle blacklist; otherwise, the check
509 : will be performed as normal. See the section below on initializer
510 : bundles for more details.
511 :
512 : Other than the blacklist check, transactions in a bundle are subject
513 : to the same checks as other transactions. If any transaction in the
514 : bundle fails validation, the whole bundle will be rejected.
515 :
516 : _fini also accepts bundle_meta, an optional opaque pointer to a
517 : region of memory of size bundle_meta_sz (as provided in pack_new).
518 : If bundle_meta is non-NULL, the contents of the memory will be copied
519 : to a metadata region associated with this bundle and can be retrieved
520 : later with fd_pack_peek_bundle_meta. The contents of bundle_meta is
521 : not retrievable if initializer_bundle is non-zero, so you may wish to
522 : just pass NULL in that case. This function does not retain any
523 : interest in the contents of bundle_meta after it returns.
524 :
525 : txn_cnt must be in [1, MAX_TXN_PER_BUNDLE]. A txn_cnt of 1 inserts a
526 : single-transaction bundle which is transaction with extremely high
527 : priority. That said, inserting transactions as bundles instead of
528 : transactions can hurt performance and throughput by introducing
529 : unnecessary stalls.
530 :
531 : fd_pack_insert_bundle_fini returns one of the FD_PACK_INSERT_ACCEPT_*
532 : or FD_PACK_INSERT_REJECT_* codes explained above. If there are
533 : multiple reasons for rejecting a bundle, the which of the reasons it
534 : returns is unspecified. delete_cnt is the number of existing
535 : transactions that were deleted as a side effect of insertion.
536 :
537 : These functions must not be called if the pack object was initialized
538 : with bundle_meta_sz==0. */
539 :
540 : fd_txn_e_t * const * fd_pack_insert_bundle_init ( fd_pack_t * pack, fd_txn_e_t * * bundle, ulong txn_cnt );
541 : int fd_pack_insert_bundle_fini ( fd_pack_t * pack, fd_txn_e_t * const * bundle, ulong txn_cnt,
542 : ulong expires_at, int initializer_bundle, void const * bundle_meta, ulong * delete_cnt );
543 : void fd_pack_insert_bundle_cancel( fd_pack_t * pack, fd_txn_e_t * const * bundle, ulong txn_cnt );
544 :
545 :
546 : /* =========== More details about initializer bundles ===============
547 : Initializer bundles are a special type of bundle with special support
548 : from the pack object to facilitate preparing on-chain state for the
549 : execution of bundles by this validator. This design is a bit
550 : complicated, but it eliminates excessive coupling between pack and
551 : block engine details.
552 :
553 : The pack object maintains a small state machine (initializer bundle
554 : abbreviated IB):
555 :
556 : [Not Initialized] ------------------------->|
557 : ^ | Schedule an
558 : | End Rebate shows | IB
559 : | block IB failed |
560 : |<----------[Failed]--------------| v
561 : | --===[Pending]
562 : |<------------------------------/ ^ |
563 : | End block /---| |
564 : | | | Rebate shows
565 : | Schedule | | IB succeeded
566 : | another IB | |
567 : | End block | V
568 : -----------------------------------===[Ready]
569 :
570 :
571 : When attempting to schedule a bundle the pack object checks the
572 : state, and employs the following rules:
573 : * [Not Initialized]: If the top bundle is an IB, schedule it,
574 : removing it like normal, then transition to [Pending]. Otherwise,
575 : do not schedule a bundle.
576 : * [Pending]: Do not schedule a bundle.
577 : * [Failed]: Do not schedule a bundle
578 : * [Ready]: Attempt to schedule the next bundle. If scheduling an IB,
579 : transition to [Pending].
580 :
581 : As described in the state machine, ending the block (via
582 : fd_pack_end_block) transitions to [Not Initialized], and calls to
583 : fd_pack_rebate_cus control the transition out of [Pending].
584 :
585 : This design supports a typical block engine system where some state
586 : may need to be initialized at the start of the slot and some state
587 : may need to change between runs of transactions (e.g. 5 transactions
588 : from block builder A followed by 5 transactions from block builder
589 : B). This can be done by inserting an initializer bundle whenever the
590 : top non-initializer bundle's metadata state (retrievable with
591 : fd_pack_peek_bundle_meta) doesn't match the current on-chain state.
592 : Since the initializer bundle will execute before the bundle that was
593 : previously the top one, by the time the non-initializer bundle
594 : executes, the on-chain state will be correctly configured. In this
595 : scheme, in the rare case that an initializer bundle was inserted but
596 : never executed, it should be deleted at the end of the slot.
597 :
598 : If at the start of the slot, it is determined that the on-chain state
599 : is in good shape, the state machine can transition directly to
600 : [Ready] by calling fd_pack_set_initializer_bundles_ready.
601 :
602 : Initializer bundles are not exempt from expiration, but it should not
603 : be a problem if they are always inserted with the most recent
604 : blockhash and deleted at the end of the slot.
605 :
606 : Additionally, a bundle marked as an IB is exempted from the bundle
607 : account blacklist checks. For this reason, it's important that IB be
608 : generated by trusted code with minimal or sanitized
609 : attacker-controlled input. */
610 :
611 :
612 : /* fd_pack_peek_bundle_meta returns a constant pointer to the bundle
613 : metadata associated with the bundle currently in line to be scheduled
614 : next, or NULL in any of the following cases:
615 : * There are no bundles
616 : * The bundle currently in line to be scheduled next is an IB
617 : * The bundle state is currently [Pending] or [Failed].
618 :
619 : The lifetime of the returned pointer is until the next pack insert,
620 : schedule, delete, or expire call. The size of the region pointed to
621 : by the returned pointer is bundle_meta_sz. If this bundle was
622 : inserted with bundle_meta==NULL, then the contents of the region
623 : pointed to by the returned pointer are arbitrary, but it will be safe
624 : to read.
625 :
626 : Pack doesn't do anything special to ensure the returned pointer
627 : points to memory with any particular alignment. It will naturally
628 : have an alignment of at least GCD( 64, bundle_meta_sz ). */
629 : void const * fd_pack_peek_bundle_meta( fd_pack_t const * pack );
630 :
631 : /* fd_pack_set_initializer_bundles_ready sets the IB state machine state
632 : (see long initializer bundle comment above) to the [Ready] state.
633 : This function makes it easy to use bundles without initializer
634 : bundles. pack must be a valid local join. */
635 : void fd_pack_set_initializer_bundles_ready( fd_pack_t * pack );
636 :
637 :
638 : /* FD_PACK_SCHEDULE_{VOTE,BUNDLE,TXN} form a set of bitflags used in
639 : fd_pack_schedule_next_microblock below. They control what types of
640 : scheduling are allowed. The names should be self-explanatory. */
641 14778 : #define FD_PACK_SCHEDULE_VOTE 1
642 14877 : #define FD_PACK_SCHEDULE_BUNDLE 2
643 14874 : #define FD_PACK_SCHEDULE_TXN 4
644 :
645 : /* fd_pack_schedule_next_microblock schedules pending transactions.
646 : These transaction either form a microblock, which is a set of
647 : non-conflicting transactions, or a bundle. The semantics of this
648 : function are a bit different depending on which one it picks, but
649 : there are some reasons why they both use this function.
650 :
651 : For both codepaths, pack must be a local join of a pack object.
652 : schedule_flags must be a bitwise combination of the
653 : FD_PACK_SCHEDULE_* values defined above. When the bit is set
654 : corresponding to a transaction type, this function will consider
655 : scheduling transactions of that type. Passing 0 for schedule_flags
656 : is a no-op. The full policy is as follows:
657 : 1. If the VOTE bit is set, attempt to schedule votes. This is the
658 : microblock case.
659 : 2. If the BUNDLE bit is set, and step 1 did not schedule any votes,
660 : attempt to schedule bundles. This is the bundle case.
661 : 3. If the TXN bit is set, and step 2 did not schedule any bundles
662 : for a reason other than account conflicts, attempt to schedule
663 : normal transactions. This is the microblock case.
664 : Note that it is possible to schedule a microblock containing both
665 : votes and normal transactions, but bundles cannot be combined with
666 : either other type. Additionally, if the BUNDLE bit is not set, step
667 : 2 will not schedule any bundles for that reason, which is a reason
668 : other than account conflicts, so that clause will always be
669 : satisfied.
670 :
671 : Microblock case:
672 : Transactions part of the scheduled microblock are copied to out in no
673 : particular order. The cumulative cost of these transactions will not
674 : exceed total_cus, and the number of transactions will not exceed the
675 : value of max_txn_per_microblock given in fd_pack_new.
676 :
677 : The block will not contain more than
678 : vote_fraction*max_txn_per_microblock votes, and votes in total will
679 : not consume more than vote_fraction*total_cus of the microblock.
680 :
681 : Bundle case:
682 : Transactions part of the scheduled bundled are copied in execution
683 : order (i.e. out[0] must be executed first). The number of
684 : transactions will not exceed FD_PACK_MAX_TXN_PER_BUNDLE.
685 : max_txn_per_microblock, total_cus, and vote_fraction are ignored,
686 : though the block-level limits are respected.
687 :
688 : Both cases:
689 : The non_execution_cus and requested_exec_plus_acct_data_cus fields of
690 : each transaction will be populated with the non execution CUs and
691 : requested execution CUs (including cus derived from the requested
692 : loaded accounts data size), respectively. The sum of these two
693 : values is the total cost of the transaction, i.e. what is used for
694 : all limits, including the total_cus value. The lower 3 bits of the
695 : flags field will be populated (simple vote, bundle, initializer
696 : bundle). Inspecting these flags is the proper way to tell which
697 : codepath executed.
698 :
699 : Returns the number of transactions in the scheduled microblock or
700 : bundle. The return value may be 0 if there are no eligible
701 : transactions at the moment. */
702 :
703 : ulong
704 : fd_pack_schedule_next_microblock( fd_pack_t * pack,
705 : ulong total_cus,
706 : float vote_fraction,
707 : ulong bank_tile,
708 : int schedule_flags,
709 : fd_txn_e_t * out );
710 :
711 :
712 : /* fd_pack_rebate_cus adjusts the compute unit accounting for the
713 : specified transactions to take into account the actual consumed CUs
714 : after execution. When a transaction is scheduled by
715 : schedule_next_microblock, pack assumes that it uses all the CUs it
716 : requests for the purposes of several CU limits. If it doesn't use
717 : all the requested CUs, this function "rebates" them to pack so that
718 : they can be consumed by a different transaction in the block.
719 :
720 : pack must be a valid local join of a pack object. rebate must point
721 : to a valid rebate report produced by fd_pack_rebate_sum_t.
722 :
723 : IMPORTANT: CU limits are reset at the end of each block, so this
724 : should not be called for transactions from a prior block.
725 : Specifically, there must not be a call to fd_pack_end_block between
726 : the call to schedule_next_microblock this is paired with and the call
727 : to rebate_cus.
728 :
729 : This function operates independently of microblock_complete. In
730 : general, you probably need to call both. microblock_complete must be
731 : called before scheduling another microblock to that bank tile, while
732 : rebate_cus is optional and has much more relaxed ordering
733 : constraints. The restriction about intervening calls to end_block
734 : and that this must come after schedule_next_microblock are the only
735 : ordering constraints. */
736 : void fd_pack_rebate_cus( fd_pack_t * pack, fd_pack_rebate_t const * rebate );
737 :
738 : /* fd_pack_microblock_complete signals that the bank_tile with index
739 : bank_tile has completed its previously scheduled microblock. This
740 : permits the scheduling of transactions that conflict with the
741 : previously scheduled microblock. It is safe to call this multiple
742 : times after a microblock or even if bank_tile does not have a
743 : previously scheduled; in this case, the function will return 0 and
744 : act as a no-op. Returns 1 if the bank_tile had an outstanding,
745 : previously scheduled microblock to mark as completed. */
746 : int fd_pack_microblock_complete( fd_pack_t * pack, ulong bank_tile );
747 :
748 : /* fd_pack_expire_before deletes all available transactions with
749 : expires_at values strictly less than expire_before. pack must be a
750 : local join of a pack object. Returns the number of transactions
751 : deleted. Subsequent calls to fd_pack_expire_before with the same or
752 : a smaller value are no-ops. */
753 : ulong fd_pack_expire_before( fd_pack_t * pack, ulong expire_before );
754 :
755 : /* fd_pack_delete_txn removes a transaction (identified by its first
756 : signature) from the pool of available transactions. Returns a
757 : nonzero count of the number of transactions deleted, if the
758 : transaction was found (and then removed) and 0 if not. The count
759 : might be >1 if a bundle was caused to be deleted. */
760 : ulong fd_pack_delete_transaction( fd_pack_t * pack, fd_ed25519_sig_t const * sig0 );
761 :
762 : /* fd_pack_end_block resets some state to prepare for the next block.
763 : Specifically, the per-block limits are cleared and transactions in
764 : the microblocks scheduled after the call to this function are allowed
765 : to conflict with transactions in microblocks scheduled before the
766 : call to this function, even within gap microblocks. */
767 : void fd_pack_end_block( fd_pack_t * pack );
768 :
769 :
770 : /* fd_pack_clear_all resets the state associated with this pack object.
771 : All pending transactions are removed from the pool of available
772 : transactions and all limits are reset. */
773 : void fd_pack_clear_all( fd_pack_t * pack );
774 :
775 :
776 : /* fd_pack_metrics_write writes period metric values to the metrics
777 : system. pack must be a valid local join. */
778 : void
779 : fd_pack_metrics_write( fd_pack_t const * pack );
780 :
781 : /* fd_pack_get_sched_metrics: copies the current
782 : FD_METRICS_ENUM_PACK_TXN_SCHEDULE_CNT counters to metrics */
783 : void
784 : fd_pack_get_sched_metrics( fd_pack_t const * pack, ulong * metrics );
785 :
786 : /* fd_pack_leave leaves a local join of a pack object. Returns pack. */
787 : void * fd_pack_leave( fd_pack_t * pack );
788 : /* fd_pack_delete unformats a memory region used to store a pack object
789 : and returns ownership of the memory to the caller. Returns mem. */
790 : void * fd_pack_delete( void * mem );
791 :
792 : /* fd_pack_verify (for debugging use primarily) checks to ensure several
793 : invariants are satisfied. scratch must point to the first byte of a
794 : piece of memory meeting the same alignment and footprint constraints
795 : as pack. Returns 0 on success and a negative value on failure
796 : (logging a warning with details). */
797 : int fd_pack_verify( fd_pack_t * pack, void * scratch );
798 :
799 : FD_PROTOTYPES_END
800 :
801 : #endif /* HEADER_fd_src_disco_pack_fd_pack_h */
|
