Line data Source code
1 : #include "fd_solfuzz_private.h"
2 : #include "fd_instr_harness.h"
3 : #include "../fd_executor.h"
4 : #include "../fd_runtime.h"
5 : #include "../program/fd_bpf_loader_program.h"
6 : #include "../program/fd_precompiles.h"
7 : #include "../fd_system_ids.h"
8 : #include "../../progcache/fd_progcache_admin.h"
9 : #include "../../alpenglow/fd_alpenglow.h"
10 : #include "../../log_collector/fd_log_collector.h"
11 :
12 : void
13 : fd_solfuzz_pb_instr_ctx_create( fd_solfuzz_runner_t * runner,
14 : fd_exec_instr_ctx_t * ctx,
15 0 : fd_exec_test_instr_context_t const * test_ctx ) {
16 :
17 0 : memset( ctx, 0, sizeof(fd_exec_instr_ctx_t) );
18 :
19 : /* Create temporary fork for account loading */
20 :
21 0 : runner->bank->progcache_fork_id = fd_progcache_attach_child( runner->progcache->join, fd_progcache_fork_id_initial() );
22 0 : runner->bank->accdb_fork_id = fd_accdb_attach_child( runner->accdb, runner->root_fork_id );
23 0 : runner->bank->parent_accdb_fork_id = runner->bank->accdb_fork_id;
24 :
25 0 : fd_txn_in_t * txn_in = fd_spad_alloc( runner->spad, alignof(fd_txn_in_t), sizeof(fd_txn_in_t) );
26 0 : fd_txn_out_t * txn_out = fd_spad_alloc( runner->spad, alignof(fd_txn_out_t), sizeof(fd_txn_out_t) );
27 :
28 0 : fd_log_collector_t * log = fd_spad_alloc( runner->spad, alignof(fd_log_collector_t), sizeof(fd_log_collector_t) );
29 :
30 0 : fd_runtime_t * runtime = runner->runtime;
31 :
32 0 : runtime->log.log_collector = log;
33 :
34 0 : ctx->txn_out = txn_out;
35 0 : ctx->txn_in = txn_in;
36 :
37 0 : fd_memset( txn_out->accounts.keys, 0, sizeof(fd_pubkey_t)*MAX_TX_ACCOUNT_LOCKS );
38 0 : fd_memset( runtime->accounts.account, 0, sizeof(fd_acc_t)*MAX_TX_ACCOUNT_LOCKS );
39 0 : fd_memset( runtime->accounts.executable, 0, sizeof(fd_acc_t)*MAX_TX_ACCOUNT_LOCKS );
40 0 : for( ulong j=0UL; j<MAX_TX_ACCOUNT_LOCKS; j++ ) {
41 0 : txn_out->accounts.account[ j ] = &runtime->accounts.account[ j ];
42 0 : txn_out->accounts.executable[ j ] = &runtime->accounts.executable[ j ];
43 0 : }
44 0 : txn_out->accounts.executable_cnt = 0UL;
45 0 : fd_memset( txn_out->accounts.executable_from_parent, 0, sizeof(txn_out->accounts.executable_from_parent) );
46 0 : fd_memset( txn_out->accounts.executable_pd_write, 0, sizeof(txn_out->accounts.executable_pd_write) );
47 0 : txn_out->accounts.executable_skipped_cnt = 0;
48 :
49 : /* Bank manager */
50 0 : fd_banks_clear_bank( runner->banks, runner->bank );
51 :
52 : /* Restore features */
53 0 : FD_TEST( test_ctx->has_features );
54 0 : fd_features_t * features = &runner->bank->f.features;
55 0 : fd_exec_test_feature_set_t const * feature_set = &test_ctx->features;
56 0 : FD_TEST( fd_solfuzz_pb_restore_features( features, feature_set ) );
57 :
58 : /* Blockhash queue init */
59 0 : ulong blockhash_seed; FD_TEST( fd_rng_secure( &blockhash_seed, sizeof(ulong) ) );
60 0 : fd_blockhashes_t * blockhashes = fd_blockhashes_init( &runner->bank->f.block_hash_queue, blockhash_seed );
61 0 : fd_blockhash_info_t * placeholder = fd_blockhash_deq_push_tail_nocopy( blockhashes->d.deque );
62 0 : fd_memset( placeholder, 0, sizeof(fd_hash_t) );
63 0 : placeholder->hash_index = 0UL;
64 :
65 : /* Set up instruction context */
66 0 : fd_instr_info_t * info = fd_instr_info_new( &runtime->instr.trace[ 0UL ] );
67 0 : info->stack_height = 1;
68 :
69 : /* Set up mock txn descriptor and payload
70 : FIXME: More fields may need to be initialized. This seems to be
71 : the minimal set of fields needed to retain full context for
72 : precompile execution. */
73 0 : fd_txn_p_t * txn = fd_spad_alloc_check( runner->spad, alignof(fd_txn_p_t), sizeof(fd_txn_p_t) );
74 0 : fd_txn_t * txn_descriptor = TXN( txn );
75 :
76 0 : txn->payload_sz = 0UL;
77 0 : if( test_ctx->data ) {
78 0 : if( FD_UNLIKELY( test_ctx->data->size>FD_INSTR_DATA_MAX ) ) {
79 0 : FD_LOG_ERR(( "invariant violation: instr data sz is too large %u > %lu", test_ctx->data->size, FD_INSTR_DATA_MAX ));
80 0 : }
81 0 : info->data_sz = (ushort)test_ctx->data->size;
82 0 : memcpy( info->data, test_ctx->data->bytes, info->data_sz );
83 :
84 0 : ulong payload_sz = fd_ulong_min( test_ctx->data->size, sizeof(txn->payload) );
85 0 : memcpy( txn->payload, test_ctx->data->bytes, payload_sz );
86 0 : txn->payload_sz = (ushort)payload_sz;
87 0 : }
88 0 : txn_descriptor->transaction_version = FD_TXN_VLEGACY;
89 0 : txn_descriptor->acct_addr_cnt = (ushort)test_ctx->accounts_count;
90 0 : txn_descriptor->instr_cnt = 1;
91 0 : txn_descriptor->instr[0] = (fd_txn_instr_t) {
92 0 : .acct_cnt = (ushort)test_ctx->accounts_count,
93 0 : .data_off = 0,
94 0 : .data_sz = (ushort)txn->payload_sz,
95 0 : };
96 :
97 0 : runtime->log.enable_log_collector = 0;
98 :
99 0 : fd_compute_budget_details_new( &txn_out->details.compute_budget );
100 0 : runtime->instr.stack_sz = 0;
101 0 : txn_out->accounts.cnt = 0UL;
102 0 : txn_out->accounts.executable_cnt = 0UL;
103 :
104 0 : txn_out->details.loaded_accounts_data_size = 0UL;
105 0 : txn_out->details.accounts_resize_delta = 0L;
106 :
107 0 : memset( txn_out->details.return_data.program_id.key, 0, sizeof(fd_pubkey_t) );
108 0 : txn_out->details.return_data.len = 0;
109 :
110 0 : runtime->log.capture_ctx = NULL;
111 0 : runtime->log.dump_proto_ctx = NULL;
112 0 : runtime->log.txn_dump_ctx = NULL;
113 :
114 0 : runtime->instr.trace_length = 1UL;
115 :
116 0 : txn_out->err.exec_err = 0;
117 0 : txn_out->err.exec_err_kind = FD_EXECUTOR_ERR_KIND_NONE;
118 0 : runtime->instr.current_idx = 0;
119 :
120 0 : txn_in->txn = txn;
121 0 : txn_out->details.compute_budget.compute_unit_limit = test_ctx->cu_avail;
122 0 : txn_out->details.compute_budget.compute_meter = test_ctx->cu_avail;
123 0 : runtime->log.enable_vm_tracing = runner->enable_vm_tracing;
124 0 : runtime->log.tracing_mem = runner->enable_vm_tracing ?
125 0 : fd_spad_alloc_check( runner->spad, FD_RUNTIME_VM_TRACE_STATIC_ALIGN, FD_RUNTIME_VM_TRACE_STATIC_FOOTPRINT * FD_MAX_INSTRUCTION_STACK_DEPTH ) :
126 0 : NULL;
127 :
128 : /* Prepare borrowed account table (correctly handles aliasing) */
129 :
130 0 : if( FD_UNLIKELY( test_ctx->accounts_count > MAX_TX_ACCOUNT_LOCKS ) ) {
131 0 : FD_LOG_ERR(( "invariant violation: too many accounts (%lu > %lu)",
132 0 : (ulong)test_ctx->accounts_count, (ulong)MAX_TX_ACCOUNT_LOCKS ));
133 0 : }
134 :
135 : /* Load accounts from input */
136 :
137 : /* Mimic Agave's mock_compile_message: put the program + referenced
138 : instruction accounts in the first txn slots, the rest after. */
139 0 : uchar account_in_message[ MAX_TX_ACCOUNT_LOCKS ] = {0};
140 0 : uint input_txn_idx [ MAX_TX_ACCOUNT_LOCKS ];
141 :
142 0 : for( ulong i=0UL; i<test_ctx->instr_accounts_count; i++ ) {
143 0 : uint index = test_ctx->instr_accounts[ i ].index;
144 0 : if( FD_UNLIKELY( index>=test_ctx->accounts_count ) ) {
145 0 : FD_LOG_ERR(( "invariant violation: instruction account index out of range (%u >= %u)",
146 0 : index, test_ctx->accounts_count ));
147 0 : }
148 0 : account_in_message[ index ] = 1;
149 0 : }
150 :
151 0 : ulong program_idx = ULONG_MAX;
152 0 : for( ulong i=0UL; i<test_ctx->accounts_count; i++ ) {
153 0 : if( !memcmp( test_ctx->accounts[ i ].address, test_ctx->program_id, sizeof(fd_pubkey_t) ) ) {
154 0 : account_in_message[ i ] = 1;
155 0 : program_idx = i;
156 0 : break;
157 0 : }
158 0 : }
159 :
160 : /* Ensure the program id is in the set of accounts */
161 0 : FD_TEST( program_idx!=ULONG_MAX );
162 :
163 : /* Compile the message by filling the transaction accounts with
164 : only accounts referenced by the instruction. */
165 0 : uint message_account_cnt = 0U;
166 0 : uint tail_txn_idx = test_ctx->accounts_count;
167 0 : for( ulong i=0UL; i<test_ctx->accounts_count; i++ ) {
168 0 : input_txn_idx[ i ] = account_in_message[ i ] ? message_account_cnt++ : --tail_txn_idx;
169 0 : }
170 :
171 0 : info->program_id = (uchar)input_txn_idx[ program_idx ];
172 0 : txn_out->accounts.cnt = message_account_cnt;
173 :
174 0 : ulong loaded_data_sz = 0UL;
175 0 : for( ulong j=0UL; j < test_ctx->accounts_count; j++ ) {
176 0 : if( !account_in_message[j] ) continue;
177 :
178 0 : ulong txn_idx = input_txn_idx[j];
179 0 : fd_pubkey_t * acc_key = (fd_pubkey_t *)test_ctx->accounts[j].address;
180 :
181 0 : pb_bytes_array_t const * in_data = fd_solfuzz_acct_data( &test_ctx->accounts[j] );
182 0 : uint dlen = in_data ? in_data->size : 0U;
183 0 : loaded_data_sz += dlen;
184 0 : if( FD_UNLIKELY( dlen>FD_RUNTIME_ACC_SZ_MAX || loaded_data_sz>FD_VM_LOADED_ACCOUNTS_DATA_SIZE_LIMIT ) ) {
185 0 : FD_LOG_ERR(( "account data too large (dlen=%u total=%lu)", dlen, loaded_data_sz ));
186 0 : }
187 0 : uchar * data_buf = fd_spad_alloc( runner->spad, FD_ACCOUNT_REC_ALIGN, FD_RUNTIME_ACC_SZ_MAX );
188 0 : if( dlen ) {
189 0 : fd_memcpy( data_buf, in_data->bytes, dlen );
190 0 : }
191 :
192 : /* Initialize entry with in-memory account data (no DB backing) */
193 0 : fd_acc_t * acc = txn_out->accounts.account[txn_idx];
194 0 : memcpy( acc->pubkey, acc_key->key, 32 );
195 0 : memcpy( acc->owner, test_ctx->accounts[j].owner, 32 );
196 0 : acc->lamports = test_ctx->accounts[j].lamports;
197 0 : acc->executable = test_ctx->accounts[j].executable;
198 0 : acc->data_len = dlen;
199 0 : acc->data = data_buf;
200 0 : acc->_writable = 1;
201 0 : acc->commit = 0;
202 :
203 0 : txn_out->accounts.is_writable[txn_idx] = 1U;
204 0 : runtime->accounts.refcnt[txn_idx] = 0UL;
205 0 : txn_out->accounts.keys[txn_idx] = *acc_key;
206 0 : }
207 :
208 : /* Load in executable accounts */
209 0 : for( ulong i=0UL; i<test_ctx->accounts_count; i++ ) {
210 0 : fd_exec_test_acct_state_t const * prog = &test_ctx->accounts[i];
211 0 : fd_pubkey_t const * owner = fd_type_pun_const( prog->owner );
212 :
213 0 : if( !fd_executor_pubkey_is_bpf_loader( owner ) ) {
214 0 : continue;
215 0 : }
216 :
217 0 : if( FD_UNLIKELY( !memcmp( owner, fd_solana_bpf_loader_upgradeable_program_id.key, sizeof(fd_pubkey_t) ) ) ) {
218 0 : pb_bytes_array_t const * prog_data = fd_solfuzz_acct_data( prog );
219 0 : if( FD_UNLIKELY( !prog_data ) ) continue;
220 :
221 0 : fd_bpf_state_t program_loader_state[1];
222 0 : int err = fd_bpf_loader_program_get_state2( prog_data->bytes, prog_data->size, program_loader_state );
223 0 : if( FD_UNLIKELY( err!=FD_EXECUTOR_INSTR_SUCCESS ) ) {
224 0 : continue;
225 0 : }
226 :
227 0 : if( program_loader_state->discriminant!=FD_BPF_STATE_PROGRAM ) {
228 0 : continue;
229 0 : }
230 :
231 0 : fd_pubkey_t * programdata_acc = &program_loader_state->inner.program.programdata_address;
232 :
233 0 : fd_exec_test_acct_state_t const * pd = NULL;
234 0 : for( ulong j=0UL; j<test_ctx->accounts_count; j++ ) {
235 0 : if( !memcmp( test_ctx->accounts[j].address, programdata_acc, sizeof(fd_pubkey_t) ) ) {
236 0 : pd = &test_ctx->accounts[j];
237 0 : break;
238 0 : }
239 0 : }
240 0 : pb_bytes_array_t const * pd_data = pd ? fd_solfuzz_acct_data( pd ) : NULL;
241 0 : if( FD_UNLIKELY( pd==NULL || !pd_data ) ) {
242 0 : continue;
243 0 : }
244 :
245 0 : FD_TEST( txn_out->accounts.executable_cnt < MAX_TX_ACCOUNT_LOCKS );
246 0 : fd_acc_t * exe = txn_out->accounts.executable[ txn_out->accounts.executable_cnt ];
247 0 : memcpy( exe->pubkey, programdata_acc->key, 32 );
248 0 : memcpy( exe->owner, pd->owner, sizeof(fd_pubkey_t) );
249 : /* Agave loads a program into its ProgramCache from the
250 : programdata bytes independently of the on-chain lamports
251 : snapshot. An instruction fixture may capture a programdata
252 : account with zero lamports (a real 0-lamport account would
253 : otherwise have all its other fields cleared between
254 : transactions), and still expect the program to execute. The
255 : runtime treats an executable account as "deployed" only when it
256 : exists, so present the programdata as existing whenever it
257 : carries program data. This executable account is read-only on
258 : the invoke path and its lamports are never consumed, only used
259 : as an existence gate. */
260 0 : exe->lamports = ( !pd->lamports && pd_data->size ) ? 1UL : pd->lamports;
261 0 : exe->executable = pd->executable;
262 0 : exe->data_len = pd_data->size;
263 0 : exe->data = (uchar *)pd_data->bytes;
264 0 : txn_out->accounts.executable_cnt++;
265 0 : }
266 0 : }
267 :
268 : /* Load instruction accounts */
269 :
270 0 : if( FD_UNLIKELY( test_ctx->instr_accounts_count > FD_TXN_INSTR_ACCT_MAX ) ) {
271 0 : FD_LOG_ERR(( "invariant violation: too many instruction accounts (%lu > %lu)",
272 0 : (ulong)test_ctx->instr_accounts_count, (ulong)FD_TXN_INSTR_ACCT_MAX ));
273 0 : }
274 :
275 : /* Restore sysvar cache */
276 0 : fd_sysvar_cache_t * sysvar_cache = &runner->bank->f.sysvar_cache;
277 0 : ctx->sysvar_cache = sysvar_cache;
278 0 : for( ulong i=0UL; i<test_ctx->accounts_count; i++ ) {
279 0 : fd_exec_test_acct_state_t const * account = &test_ctx->accounts[i];
280 0 : pb_bytes_array_t const * data = fd_solfuzz_acct_data( account );
281 0 : if( FD_UNLIKELY( !data ) ) continue;
282 :
283 0 : fd_pubkey_t const * address = fd_type_pun_const( account->address );
284 0 : fd_sysvar_cache_restore_one( sysvar_cache,
285 0 : address,
286 0 : account->lamports,
287 0 : data->bytes,
288 0 : data->size );
289 0 : }
290 :
291 0 : ctx->runtime = runtime;
292 :
293 0 : fd_sol_sysvar_clock_t clock_[1];
294 0 : fd_sol_sysvar_clock_t * clock = fd_sysvar_cache_clock_read( ctx->sysvar_cache, clock_ );
295 0 : FD_TEST( clock );
296 0 : runner->bank->f.slot = clock->slot;
297 :
298 0 : runner->bank->progcache_fork_id = fd_progcache_attach_child( runner->progcache->join, runner->bank->progcache_fork_id );
299 :
300 0 : fd_epoch_schedule_t epoch_schedule_[1];
301 0 : fd_epoch_schedule_t * epoch_schedule = fd_sysvar_cache_epoch_schedule_read( ctx->sysvar_cache, epoch_schedule_ );
302 0 : FD_TEST( epoch_schedule );
303 0 : runner->bank->f.epoch_schedule = *epoch_schedule;
304 :
305 0 : fd_rent_t rent_[1];
306 0 : fd_rent_t * rent = fd_sysvar_cache_rent_read( ctx->sysvar_cache, rent_ );
307 0 : FD_TEST( rent );
308 0 : runner->bank->f.rent = *rent;
309 0 : runner->bank->f.alpenglow_migration_slot = fd_alpenglow_migration_slot( runner->bank, runner->accdb );
310 :
311 0 : if( !fd_sysvar_cache_recent_hashes_is_empty( sysvar_cache ) ) {
312 0 : uchar const * rbh_data = sysvar_cache->bin_recent_hashes;
313 0 : ulong rbh_len = FD_LOAD( ulong, rbh_data );
314 0 : ulong entry_off = sizeof(ulong) + ((rbh_len - 1UL) * 40UL);
315 0 : uchar const * entry = rbh_data + entry_off;
316 0 : FD_TEST( entry_off+40UL <= sysvar_cache->desc[ FD_SYSVAR_recent_hashes_IDX ].data_sz );
317 :
318 0 : fd_blockhashes_t * blockhashes = &runner->bank->f.block_hash_queue;
319 0 : fd_blockhashes_pop_new( blockhashes );
320 0 : fd_hash_t hash = FD_LOAD( fd_hash_t, entry );
321 0 : fd_blockhash_info_t * info = fd_blockhashes_push_new( blockhashes, &hash );
322 0 : info->lamports_per_signature = runner->bank->f.rbh_lamports_per_sig =
323 0 : FD_LOAD( ulong, entry+32UL );
324 0 : }
325 :
326 : /* Agave compiles the instruction into a message, OR-ing duplicate
327 : accounts' writable/signer flags. */
328 0 : uchar instr_is_writable[ FD_TXN_ACCT_ADDR_MAX ] = {0};
329 0 : uchar instr_is_signer [ FD_TXN_ACCT_ADDR_MAX ] = {0};
330 0 : int bpf_upgradeable_present = !memcmp( test_ctx->program_id, fd_solana_bpf_loader_upgradeable_program_id.key, sizeof(fd_pubkey_t) );
331 0 : for( ulong j=0UL; j < test_ctx->instr_accounts_count; j++ ) {
332 0 : uint index = test_ctx->instr_accounts[j].index;
333 :
334 0 : instr_is_writable[index] = (uchar)( instr_is_writable[index] | test_ctx->instr_accounts[j].is_writable );
335 0 : instr_is_signer[index] = (uchar)( instr_is_signer[index] | test_ctx->instr_accounts[j].is_signer );
336 0 : if( !memcmp( test_ctx->accounts[index].address, fd_solana_bpf_loader_upgradeable_program_id.key, sizeof(fd_pubkey_t) ) ) {
337 0 : bpf_upgradeable_present = 1;
338 0 : }
339 0 : }
340 :
341 0 : uchar acc_idx_seen[ FD_TXN_ACCT_ADDR_MAX ] = {0};
342 0 : for( ulong j=0UL; j < test_ctx->instr_accounts_count; j++ ) {
343 0 : uint index = test_ctx->instr_accounts[j].index;
344 :
345 : /* A program account is demoted to read-only unless the upgradeable
346 : loader is present. */
347 0 : uchar is_writable = instr_is_writable[index];
348 0 : if( !bpf_upgradeable_present && !memcmp( test_ctx->accounts[index].address, test_ctx->program_id, sizeof(fd_pubkey_t) ) ) {
349 0 : is_writable = 0;
350 0 : }
351 :
352 : /* Setup instruction accounts */
353 0 : fd_instr_info_setup_instr_account( info,
354 0 : acc_idx_seen,
355 0 : (ushort)input_txn_idx[index],
356 0 : (ushort)j,
357 0 : (ushort)j,
358 0 : is_writable,
359 0 : instr_is_signer[index] );
360 0 : }
361 0 : info->acct_cnt = (ushort)test_ctx->instr_accounts_count;
362 :
363 0 : ctx->instr = info;
364 0 : ctx->runtime->progcache = runner->progcache;
365 0 : ctx->runtime->accdb = runner->accdb;
366 :
367 0 : runtime->log.enable_log_collector = 0;
368 :
369 0 : fd_log_collector_init( ctx->runtime->log.log_collector, 0 );
370 0 : fd_base58_encode_32( txn_out->accounts.keys[ ctx->instr->program_id ].uc, NULL, ctx->program_id_base58 );
371 0 : }
372 :
373 : void
374 : fd_solfuzz_pb_instr_ctx_destroy( fd_solfuzz_runner_t * runner,
375 0 : fd_exec_instr_ctx_t * ctx ) {
376 0 : if( !ctx ) return;
377 :
378 0 : fd_progcache_reset( runner->progcache->join );
379 :
380 : /* Purge the fork attached in ctx_create so the accdb fork pool slot
381 : is released back for reuse. Without this, repeated harness
382 : invocations (e.g. under a fuzzer) exhaust max_live_slots. */
383 0 : fd_accdb_purge( runner->accdb, runner->bank->accdb_fork_id );
384 0 : int charge_busy = 0;
385 0 : fd_accdb_background( runner->accdb, &charge_busy );
386 :
387 0 : }
388 :
389 : /* Txn index for addr among the compiled-message accounts [0,cnt).
390 : Returns ULONG_MAX if not found. */
391 : static ulong
392 0 : instr_harness_idx_of( fd_txn_out_t const * txn_out, uchar const * addr ) {
393 0 : for( ulong i=0UL; i<txn_out->accounts.cnt; i++ ) {
394 0 : if( !memcmp( txn_out->accounts.keys[i].key, addr, sizeof(fd_pubkey_t) ) ) return i;
395 0 : }
396 0 : return ULONG_MAX;
397 0 : }
398 :
399 : ulong
400 : fd_solfuzz_pb_instr_run( fd_solfuzz_runner_t * runner,
401 : void const * input_,
402 : void ** output_,
403 : void * output_buf,
404 0 : ulong output_bufsz ) {
405 0 : fd_exec_test_instr_context_t const * input = fd_type_pun_const( input_ );
406 0 : fd_exec_test_instr_effects_t ** output = fd_type_pun( output_ );
407 :
408 : /* Convert the Protobuf inputs to a fd_exec context */
409 0 : fd_exec_instr_ctx_t ctx[1];
410 0 : fd_solfuzz_pb_instr_ctx_create( runner, ctx, input );
411 :
412 0 : fd_instr_info_t * instr = (fd_instr_info_t *) ctx->instr;
413 :
414 : /* Execute the test */
415 0 : int exec_result = fd_execute_instr( ctx->runtime, runner->bank, ctx->txn_in, ctx->txn_out, instr );
416 :
417 : /* Allocate space to capture outputs */
418 0 : ulong output_end = (ulong)output_buf + output_bufsz;
419 0 : FD_SCRATCH_ALLOC_INIT( l, output_buf );
420 :
421 0 : fd_exec_test_instr_effects_t * effects =
422 0 : FD_SCRATCH_ALLOC_APPEND( l, alignof(fd_exec_test_instr_effects_t),
423 0 : sizeof (fd_exec_test_instr_effects_t) );
424 0 : if( FD_UNLIKELY( _l > output_end ) ) {
425 0 : fd_solfuzz_pb_instr_ctx_destroy( runner, ctx );
426 0 : return 0UL;
427 0 : }
428 0 : fd_memset( effects, 0, sizeof(fd_exec_test_instr_effects_t) );
429 :
430 : /* Capture error code */
431 :
432 0 : effects->result = -exec_result;
433 0 : effects->cu_avail = ctx->txn_out->details.compute_budget.compute_meter;
434 :
435 : /* Don't capture custom error codes if the program is a precompile */
436 0 : if( FD_LIKELY( effects->result ) ) {
437 0 : int program_id_idx = ctx->instr[ 0UL ].program_id;
438 0 : if( exec_result==FD_EXECUTOR_INSTR_ERR_CUSTOM_ERR &&
439 0 : fd_executor_lookup_native_precompile_program( &ctx->txn_out->accounts.keys[ program_id_idx ] )==NULL ) {
440 0 : effects->custom_err = ctx->txn_out->err.custom_err;
441 0 : }
442 0 : }
443 :
444 : /* Allocate space for captured accounts */
445 0 : ulong modified_acct_cnt = input->accounts_count;
446 :
447 0 : fd_exec_test_acct_state_t * modified_accts =
448 0 : FD_SCRATCH_ALLOC_APPEND( l, alignof(fd_exec_test_acct_state_t),
449 0 : sizeof (fd_exec_test_acct_state_t) * modified_acct_cnt );
450 0 : if( FD_UNLIKELY( _l > output_end ) ) {
451 0 : fd_solfuzz_pb_instr_ctx_destroy( runner, ctx );
452 0 : return 0;
453 0 : }
454 0 : effects->modified_accounts = modified_accts;
455 0 : effects->modified_accounts_count = 0UL;
456 :
457 : /* Capture any accounts which may have changed */
458 :
459 0 : for( ulong j=0UL; j < input->accounts_count; j++ ) {
460 0 : fd_exec_test_acct_state_t const * in_acct = &input->accounts[j];
461 :
462 0 : ulong lamports;
463 0 : uchar const * data;
464 0 : ulong data_len;
465 0 : int executable;
466 0 : uchar const * owner;
467 :
468 : /* Capture the account from the message in case it was modified,
469 : or just report the input account otherwise. */
470 0 : ulong txn_idx = instr_harness_idx_of( ctx->txn_out, in_acct->address );
471 0 : if( txn_idx!=ULONG_MAX ) {
472 0 : fd_acc_t const * acc = ctx->txn_out->accounts.account[txn_idx];
473 0 : lamports = acc->lamports;
474 0 : data = acc->data;
475 0 : data_len = acc->data_len;
476 0 : executable = acc->executable;
477 0 : owner = acc->owner;
478 0 : } else {
479 0 : pb_bytes_array_t const * in_data = fd_solfuzz_acct_data( in_acct );
480 0 : lamports = in_acct->lamports;
481 0 : data = in_data ? in_data->bytes : NULL;
482 0 : data_len = in_data ? in_data->size : 0UL;
483 0 : executable = in_acct->executable;
484 0 : owner = in_acct->owner;
485 0 : }
486 :
487 0 : ulong modified_idx = effects->modified_accounts_count;
488 0 : if( FD_UNLIKELY( modified_idx >= modified_acct_cnt ) ) {
489 0 : FD_LOG_CRIT(( "invalid modified account index" ));
490 0 : }
491 :
492 0 : fd_exec_test_acct_state_t * out_acct = &effects->modified_accounts[ modified_idx ];
493 0 : memset( out_acct, 0, sizeof(fd_exec_test_acct_state_t) );
494 :
495 : /* Copy over account content */
496 0 : memcpy( out_acct->address, in_acct->address, sizeof(fd_pubkey_t) );
497 0 : out_acct->lamports = lamports;
498 0 : fd_solfuzz_acct_set_data_hash( out_acct, data, data_len );
499 :
500 0 : out_acct->executable = executable;
501 0 : memcpy( out_acct->owner, owner, sizeof(fd_pubkey_t) );
502 :
503 0 : effects->modified_accounts_count++;
504 0 : }
505 :
506 0 : fd_solfuzz_direct_mapping_handle_cu_exhaustion(
507 0 : runner, effects->cu_avail, effects->result,
508 0 : effects->modified_accounts, (pb_size_t)effects->modified_accounts_count );
509 :
510 : /* Capture return data */
511 0 : fd_txn_return_data_t * return_data = &ctx->txn_out->details.return_data;
512 0 : effects->return_data_hash = fd_solfuzz_hash( return_data->data, return_data->len );
513 :
514 0 : ulong actual_end = FD_SCRATCH_ALLOC_FINI( l, 1UL );
515 0 : fd_solfuzz_pb_instr_ctx_destroy( runner, ctx );
516 :
517 0 : *output = effects;
518 0 : return actual_end - (ulong)output_buf;
519 0 : }
|
