Line data Source code
1 : #include "fd_shred_dest.h"
2 : #include "../../util/fd_hash32.h"
3 :
4 : struct pubkey_to_idx {
5 : fd_pubkey_t key;
6 : ulong idx;
7 : };
8 : typedef struct pubkey_to_idx pubkey_to_idx_t;
9 :
10 : static const fd_pubkey_t null_pubkey = {{ 0 }};
11 :
12 : #define MAP_NAME pubkey_to_idx
13 0 : #define MAP_T pubkey_to_idx_t
14 0 : #define MAP_KEY_T fd_pubkey_t
15 0 : #define MAP_KEY_NULL null_pubkey
16 : #define MAP_KEY_EQUAL_IS_SLOW 1
17 : #define MAP_MEMOIZE 0
18 0 : #define MAP_KEY_INVAL(k) MAP_KEY_EQUAL((k),MAP_KEY_NULL)
19 0 : #define MAP_KEY_EQUAL(k0,k1) (!memcmp( (k0).key, (k1).key, 32UL ))
20 0 : #define MAP_KEY_HASH(k,s) ((MAP_HASH_T)fd_hash32( (k).key, (s) ))
21 :
22 : #include "../../util/tmpl/fd_map_dynamic.c"
23 :
24 :
25 : /* This 45 byte struct gets hashed to compute the seed for ChaCha to
26 : compute the shred destinations. */
27 : struct __attribute__((packed)) shred_dest_input {
28 : ulong slot;
29 : uchar type; /* Data = 0b1010_0101, Code = 0b0101_1010 */
30 : uint idx;
31 : uchar leader_pubkey[32];
32 : };
33 : typedef struct shred_dest_input shred_dest_input_t;
34 :
35 : ulong
36 0 : fd_shred_dest_footprint( ulong staked_cnt, ulong unstaked_cnt ) {
37 0 : ulong cnt = staked_cnt+unstaked_cnt;
38 0 : int lg_cnt = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*fd_ulong_max( cnt, 1UL ) ) );
39 0 : return FD_LAYOUT_FINI( FD_LAYOUT_APPEND( FD_LAYOUT_APPEND( FD_LAYOUT_APPEND( FD_LAYOUT_APPEND( FD_LAYOUT_APPEND(
40 0 : FD_LAYOUT_INIT,
41 0 : fd_shred_dest_align(), sizeof(fd_shred_dest_t) ),
42 0 : pubkey_to_idx_align(), pubkey_to_idx_footprint( lg_cnt ) ),
43 0 : alignof(fd_shred_dest_weighted_t), sizeof(fd_shred_dest_weighted_t)*cnt ),
44 0 : fd_wsample_align(), fd_wsample_footprint( staked_cnt, 1 )),
45 0 : alignof(ulong), sizeof(ulong)*unstaked_cnt ),
46 0 : FD_SHRED_DEST_ALIGN );
47 0 : }
48 :
49 :
50 : void *
51 : fd_shred_dest_new( void * mem,
52 : fd_shred_dest_weighted_t const * info,
53 : ulong cnt,
54 : fd_epoch_leaders_t const * lsched,
55 : fd_pubkey_t const * source,
56 0 : ulong seed ) {
57 :
58 0 : if( FD_UNLIKELY( !mem ) ) {
59 0 : FD_LOG_WARNING(( "NULL mem" ));
60 0 : return NULL;
61 0 : }
62 :
63 0 : if( FD_UNLIKELY( !fd_ulong_is_aligned( (ulong)mem, fd_shred_dest_align() ) ) ) {
64 0 : FD_LOG_WARNING(( "misaligned mem" ));
65 0 : return NULL;
66 0 : }
67 :
68 0 : int lg_cnt = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*fd_ulong_max( cnt, 1UL ) ) );
69 0 : FD_SCRATCH_ALLOC_INIT( footprint, mem );
70 0 : fd_shred_dest_t * sdest;
71 0 : /* */ sdest = FD_SCRATCH_ALLOC_APPEND( footprint, fd_shred_dest_align(), sizeof(fd_shred_dest_t) );
72 0 : void * _map = FD_SCRATCH_ALLOC_APPEND( footprint, pubkey_to_idx_align(), pubkey_to_idx_footprint( lg_cnt ) );
73 0 : void * _info = FD_SCRATCH_ALLOC_APPEND( footprint, alignof(fd_shred_dest_weighted_t), sizeof(fd_shred_dest_weighted_t)*cnt );
74 :
75 0 : ulong cnts[2] = { 0UL, 0UL }; /* cnts[0] = staked, cnts[1] = unstaked */
76 :
77 0 : fd_shred_dest_weighted_t * copy = (fd_shred_dest_weighted_t *)_info;
78 0 : for( ulong i=0UL; i<cnt; i++ ) {
79 0 : copy[i] = info[i];
80 0 : ulong stake = info[i].stake_lamports;
81 : /* Check to make we never have a staked node following an unstaked
82 : node, which would mean info is not sorted properly. */
83 0 : if( FD_UNLIKELY( (stake>0UL) & (cnts[1]>0UL) ) ) {
84 0 : FD_LOG_WARNING(( "info was not sorted properly. info[%lu] has non-zero stake %lu but follows an unstaked node", i, stake ));
85 0 : return NULL;
86 0 : }
87 0 : cnts[ stake==0UL ]++;
88 0 : }
89 :
90 0 : ulong staked_cnt = cnts[0];
91 0 : ulong unstaked_cnt = cnts[1];
92 :
93 0 : void * _wsample = FD_SCRATCH_ALLOC_APPEND( footprint, fd_wsample_align(), fd_wsample_footprint( staked_cnt, 1 ));
94 0 : void * _unstaked = FD_SCRATCH_ALLOC_APPEND( footprint, alignof(ulong), sizeof(ulong)*unstaked_cnt );
95 :
96 :
97 0 : fd_chacha_rng_t * rng = fd_chacha_rng_join( fd_chacha_rng_new( sdest->rng, FD_CHACHA_RNG_MODE_SHIFT ) );
98 :
99 0 : void * _staked = fd_wsample_new_init( _wsample, rng, staked_cnt, 1, FD_WSAMPLE_HINT_POWERLAW_REMOVE );
100 :
101 0 : for( ulong i=0UL; i<staked_cnt; i++ ) _staked = fd_wsample_new_add( _staked, info[i].stake_lamports );
102 0 : _staked = fd_wsample_new_fini( _staked, 0UL );
103 :
104 0 : pubkey_to_idx_t * pubkey_to_idx_map = pubkey_to_idx_join( pubkey_to_idx_new( _map, lg_cnt, seed ) );
105 0 : for( ulong i=0UL; i<cnt; i++ ) {
106 : /* we should never have duplicates in info[i].pubkey, but in case
107 : of duplicates it's better to skip than to segfault. */
108 0 : pubkey_to_idx_t * inserted = pubkey_to_idx_insert( pubkey_to_idx_map, info[i].pubkey );
109 0 : if( FD_UNLIKELY( !inserted ) ) {
110 0 : continue;
111 0 : }
112 0 : inserted->idx = i;
113 0 : }
114 0 : pubkey_to_idx_t * query = pubkey_to_idx_query( pubkey_to_idx_map, *source, NULL );
115 0 : if( FD_UNLIKELY( !query ) ) {
116 0 : FD_LOG_WARNING(( "source pubkey not found" ));
117 0 : return NULL;
118 0 : }
119 :
120 0 : memset( sdest->null_dest, 0, sizeof(fd_shred_dest_weighted_t) );
121 0 : sdest->lsched = lsched;
122 0 : sdest->cnt = cnt;
123 0 : sdest->all_destinations = copy;
124 0 : sdest->staked = fd_wsample_join( _staked );
125 0 : sdest->unstaked = _unstaked;
126 0 : sdest->unstaked_unremoved_cnt = 0UL; /* unstaked doesn't get initialized until it's needed */
127 0 : sdest->staked_cnt = staked_cnt;
128 0 : sdest->unstaked_cnt = unstaked_cnt;
129 0 : sdest->pubkey_to_idx_map = pubkey_to_idx_map;
130 0 : sdest->source_validator_orig_idx = query->idx;
131 :
132 0 : return (void *)sdest;
133 0 : }
134 :
135 0 : fd_shred_dest_t * fd_shred_dest_join( void * mem ) { return (fd_shred_dest_t *)mem; }
136 0 : void * fd_shred_dest_leave( fd_shred_dest_t * sdest ) { return (void *)sdest; }
137 :
138 0 : void * fd_shred_dest_delete( void * mem ) {
139 0 : fd_shred_dest_t * sdest = (fd_shred_dest_t *)mem;
140 :
141 0 : fd_chacha_rng_delete( fd_chacha_rng_leave( sdest->rng ) );
142 0 : fd_wsample_delete ( fd_wsample_leave ( sdest->staked ) );
143 0 : pubkey_to_idx_delete( pubkey_to_idx_leave( sdest->pubkey_to_idx_map ) );
144 0 : return mem;
145 0 : }
146 :
147 : /* sample_unstaked, sample_unstaked_noprepare, and
148 : prepare_unstaked_sampling are used to perform the specific form of
149 : unweighted random sampling that Solana uses for unstaked validators.
150 : In essence, you:
151 : 1. construct a list of all the unstaked validators,
152 : 2. delete the leader (if present)
153 : then repeatedly:
154 : 3. choose the chacha_rng_roll( |unstaked| )th element.
155 : 4. swap the last element in unstaked with the chosen element
156 : 5. return and remove the chosen element (which is now in the last
157 : position, so remove is O(1)).
158 : Steps 1 and 2 are both O(|unstaked|), but they can be combined
159 : relatively easily if we wait to construct the list until we know
160 : which element we need to delete. prepare_unstaked_sampling performs
161 : steps 1 and 2. sample_unstaked performs steps 3-5. Thus, you must
162 : call prepare_unstaked_sampling prior to calling sample_unstaked.
163 :
164 : When only sampling a single element from the list, forming the whole
165 : array is wasteful; we just need to know whether the element we choose
166 : comes before or after the element we deleted.
167 : sample_unstaked_noprepare returns the same result as
168 : prepare_unstaked_sampling followed by one call to sample_unstaked.
169 : sample_unstaked_noprepare does not read or modify the unstaked array,
170 : so it can be called without calling prepare_unstaked_sampling.
171 :
172 : remove_idx is the index of the element to remove in step 2. If it is
173 : not in [sdest->staked_cnt, sdest->staked_cnt+sdest->unstaked_cnt),
174 : then it will be ignored. sample_unstaked and
175 : sample_unstaked_noprepare return the index into
176 : sdest->all_destinations of the selected sample. The returned value
177 : will be in [sdest->staked_cnt, sdest->staked_cnt+sdest->unstaked_cnt)
178 : or FD_WSAMPLE_EMPTY. */
179 : static inline ulong
180 : sample_unstaked_noprepare( fd_shred_dest_t * sdest,
181 0 : ulong remove_idx ) {
182 : /* is remove_idx in
183 : [sdest->staked_cnt, sdest->staked_cnt+sdest->unstaked_cnt) ? */
184 0 : int remove_in_interval = (sdest->staked_cnt <= remove_idx) & (remove_idx < (sdest->staked_cnt+sdest->unstaked_cnt) );
185 0 : ulong unstaked_cnt = sdest->unstaked_cnt - (ulong)remove_in_interval;
186 0 : if( FD_UNLIKELY( unstaked_cnt==0UL ) ) return FD_WSAMPLE_EMPTY;
187 :
188 0 : ulong sample = sdest->staked_cnt + fd_chacha_rng_ulong_roll( sdest->rng, unstaked_cnt );
189 0 : return fd_ulong_if( (!remove_in_interval) | (sample<remove_idx), sample, sample+1UL );
190 0 : }
191 :
192 : /* It's cheaper to initialize unstaked without the element we want to
193 : delete than to delete it after initializing, so we defer the
194 : initialization until we know who the leader is. */
195 : static inline void
196 : prepare_unstaked_sampling( fd_shred_dest_t * sdest,
197 0 : ulong remove_idx ) {
198 0 : int remove_in_interval = (sdest->staked_cnt <= remove_idx) & (remove_idx < (sdest->staked_cnt+sdest->unstaked_cnt) );
199 0 : ulong unstaked_cnt = sdest->unstaked_cnt - (ulong)remove_in_interval;
200 0 : sdest->unstaked_unremoved_cnt = unstaked_cnt;
201 0 : if( FD_UNLIKELY( unstaked_cnt==0UL ) ) return;
202 :
203 : /* If we had to remove something in the interval, we want to make sure
204 : it doesn't occur in the list of indices. Otherwise just take them
205 : all. */
206 0 : ulong direct_index_up_to = fd_ulong_if( remove_in_interval, remove_idx - sdest->staked_cnt, unstaked_cnt );
207 0 : ulong i=0UL;
208 0 : for( ; i<direct_index_up_to; i++ ) sdest->unstaked[i] = i+sdest->staked_cnt;
209 0 : for( ; i<unstaked_cnt; i++ ) sdest->unstaked[i] = i+sdest->staked_cnt + 1UL;
210 0 : sdest->rng_avail = fd_ulong_min( unstaked_cnt, 256UL );
211 0 : sdest->rng_ptr = 0UL;
212 0 : fd_chacha_rng_ulong_roll_decreasing( sdest->rng, unstaked_cnt, sdest->rng_pregen, sdest->rng_avail );
213 :
214 0 : }
215 :
216 : static inline ulong
217 0 : sample_unstaked( fd_shred_dest_t * sdest ) {
218 0 : if( FD_UNLIKELY( sdest->unstaked_unremoved_cnt==0UL ) ) return FD_WSAMPLE_EMPTY;
219 :
220 0 : if( FD_UNLIKELY( sdest->rng_avail==0UL ) ) {
221 0 : sdest->rng_avail = fd_ulong_min( sdest->unstaked_unremoved_cnt, 256UL );
222 0 : sdest->rng_ptr = 0UL;
223 0 : fd_chacha_rng_ulong_roll_decreasing( sdest->rng, sdest->unstaked_unremoved_cnt, sdest->rng_pregen, sdest->rng_avail );
224 0 : }
225 0 : ulong sample = sdest->rng_pregen[ sdest->rng_ptr++ ];
226 0 : sdest->rng_avail--;
227 0 : ulong to_return = sdest->unstaked[sample];
228 0 : sdest->unstaked[sample] = sdest->unstaked[--sdest->unstaked_unremoved_cnt];
229 0 : return to_return;
230 0 : }
231 :
232 :
233 : /* Returns 0 on success
234 : https://github.com/anza-xyz/agave/blob/v2.2.1/ledger/src/shred.rs#L293 */
235 : static inline int
236 : compute_seeds( fd_shred_dest_t * sdest,
237 : fd_shred_t const * const * input_shreds,
238 : ulong shred_cnt,
239 : fd_pubkey_t const * leader,
240 : ulong slot,
241 0 : uchar dest_hash_output[ FD_SHRED_DEST_MAX_SHRED_CNT ][ 32 ] ) {
242 :
243 0 : shred_dest_input_t dest_hash_inputs [ FD_SHRED_DEST_MAX_SHRED_CNT ];
244 0 : fd_sha256_batch_t * sha256 = fd_sha256_batch_init( sdest->_sha256_batch );
245 :
246 0 : for( ulong i=0UL; i<shred_cnt; i++ ) {
247 0 : shred_dest_input_t * h_in = dest_hash_inputs+i;
248 0 : fd_shred_t const * shred = input_shreds[i];
249 0 : if( FD_UNLIKELY( shred->slot != slot ) ) return -1;
250 :
251 0 : uchar shred_type = fd_shred_type( shred->variant );
252 0 : h_in->slot = slot;
253 0 : h_in->type = fd_uchar_if( fd_shred_is_data( shred_type ), 0xA5, 0x5A );
254 0 : h_in->idx = shred->idx;
255 0 : memcpy( h_in->leader_pubkey, leader, 32UL );
256 :
257 0 : fd_sha256_batch_add( sha256, dest_hash_inputs+i, sizeof(shred_dest_input_t), dest_hash_output[ i ] );
258 0 : }
259 0 : fd_sha256_batch_fini( sha256 );
260 0 : return 0;
261 0 : }
262 :
263 :
264 : fd_shred_dest_idx_t *
265 : fd_shred_dest_compute_first( fd_shred_dest_t * sdest,
266 : fd_shred_t const * const * input_shreds,
267 : ulong shred_cnt,
268 0 : fd_shred_dest_idx_t * out ) {
269 :
270 0 : if( FD_UNLIKELY( shred_cnt==0UL ) ) return out;
271 :
272 0 : if( FD_UNLIKELY( sdest->cnt<=1UL ) ) {
273 : /* We are the only validator that we know about, and we can't send
274 : it to ourself, so there's nobody we can send the shred to. */
275 0 : for( ulong i=0UL; i<shred_cnt; i++ ) out[ i ] = FD_SHRED_DEST_NO_DEST;
276 0 : return out;
277 0 : }
278 :
279 0 : uchar dest_hash_outputs[ FD_SHRED_DEST_MAX_SHRED_CNT ][ 32 ];
280 :
281 0 : ulong slot = input_shreds[0]->slot;
282 0 : fd_pubkey_t const * leader = fd_epoch_leaders_get( sdest->lsched, slot );
283 0 : if( FD_UNLIKELY( !leader ) ) return NULL;
284 :
285 0 : if( FD_UNLIKELY( compute_seeds( sdest, input_shreds, shred_cnt, leader, slot, dest_hash_outputs ) ) ) return NULL;
286 :
287 : /* If we're calling this, we must be the leader. That means we had
288 : some stake when the leader schedule was created, but maybe not
289 : anymore? This version of the code is safe either way, but I should
290 : probably confirm this can happen. */
291 0 : int source_validator_is_staked = sdest->source_validator_orig_idx<sdest->staked_cnt;
292 0 : if( FD_LIKELY( source_validator_is_staked ) )
293 0 : fd_wsample_remove_idx( sdest->staked, sdest->source_validator_orig_idx );
294 :
295 0 : int any_staked_candidates = sdest->staked_cnt > (ulong)source_validator_is_staked;
296 0 : for( ulong i=0UL; i<shred_cnt; i++ ) {
297 0 : fd_wsample_seed_rng( sdest->staked, dest_hash_outputs[ i ] );
298 : /* Map FD_WSAMPLE_EMPTY (UINT_MAX) to FD_SHRED_DEST_NO_DEST.
299 : Otherwise, since wsample guarantees the returned index is in
300 : [0, INT_MAX], it will remain non-negative when cast to an int. */
301 0 : FD_STATIC_ASSERT( (int)FD_WSAMPLE_EMPTY <=-1, wsample_val );
302 0 : FD_STATIC_ASSERT( FD_SHRED_DEST_NO_DEST==(fd_shred_dest_idx_t)-1, wsample_val );
303 0 : if( FD_LIKELY( any_staked_candidates ) ) out[i] = (fd_shred_dest_idx_t)fd_int_max( (int)fd_wsample_sample( sdest->staked ), -1 );
304 0 : else out[i] = (fd_shred_dest_idx_t)sample_unstaked_noprepare( sdest, sdest->source_validator_orig_idx );
305 0 : }
306 0 : fd_wsample_restore_all( sdest->staked );
307 :
308 0 : return out;
309 0 : }
310 :
311 : fd_shred_dest_idx_t *
312 : fd_shred_dest_compute_children( fd_shred_dest_t * sdest,
313 : fd_shred_t const * const * input_shreds,
314 : ulong shred_cnt,
315 : fd_shred_dest_idx_t * out,
316 : ulong out_stride,
317 : ulong fanout,
318 : ulong dest_cnt,
319 0 : ulong * opt_max_dest_cnt ) {
320 :
321 : /* The logic here is a little tricky since we are keeping track of
322 : staked and unstaked separately and only logically concatenating
323 : them [staked, unstaked] , but that does allow us to skip some
324 : samples sometimes. We're operating from the source validator's
325 : perspective here, so everything in the first person singular refers
326 : to the source validator. */
327 :
328 0 : ulong my_orig_idx = sdest->source_validator_orig_idx;
329 0 : int i_am_staked = my_orig_idx<sdest->staked_cnt;
330 :
331 0 : fd_ulong_store_if( !!opt_max_dest_cnt, opt_max_dest_cnt, 0UL );
332 :
333 0 : if( FD_UNLIKELY( (shred_cnt==0UL) | (dest_cnt==0UL) ) ) return out; /* Nothing to do */
334 :
335 0 : ulong slot = input_shreds[0]->slot;
336 0 : fd_pubkey_t const * leader = fd_epoch_leaders_get ( sdest->lsched, slot );
337 0 : if( FD_UNLIKELY( !leader ) ) return NULL; /* Unknown slot */
338 :
339 0 : pubkey_to_idx_t * query = pubkey_to_idx_query( sdest->pubkey_to_idx_map, *leader, NULL );
340 0 : int leader_is_staked = query ? (query->idx<sdest->staked_cnt): 0;
341 0 : ulong leader_idx = query ? query->idx : ULONG_MAX;
342 0 : if( FD_UNLIKELY( leader_idx==my_orig_idx ) ) return NULL; /* I am the leader. Use compute_first */
343 :
344 0 : if( FD_UNLIKELY( (sdest->cnt<=1UL) | /* We don't know about a single destination, so we can't send
345 : anything. */
346 0 : ( (!i_am_staked) & (sdest->staked_cnt-(ulong)leader_is_staked>fanout) ) ) ) {
347 : /* My position is somewhere after all the staked nodes, which means
348 : my shuffled index is always greater than fanout. That means I'm
349 : always at the bottom of the Turbine tree so I don't have to send
350 : any shreds to anyone. Contiguous rows take one memset, NO_DEST
351 : is all bytes 0xFF. */
352 0 : if( FD_LIKELY( out_stride==shred_cnt ) ) fd_memset( out, 0xFF, dest_cnt*shred_cnt*sizeof(fd_shred_dest_idx_t) );
353 0 : else for( ulong j=0UL; j<dest_cnt; j++ ) for( ulong i=0UL; i<shred_cnt; i++ ) out[ j*out_stride + i ] = FD_SHRED_DEST_NO_DEST;
354 0 : return out;
355 0 : }
356 :
357 0 : uchar dest_hash_outputs[ FD_SHRED_DEST_MAX_SHRED_CNT ][ 32 ];
358 :
359 :
360 0 : if( FD_UNLIKELY( compute_seeds( sdest, input_shreds, shred_cnt, leader, slot, dest_hash_outputs ) ) ) return NULL;
361 :
362 0 : ulong max_dest_cnt = 0UL;
363 :
364 0 : ulong staked_shuffle[ sdest->staked_cnt+1UL ];
365 0 : ulong staked_shuffle_populated_cnt = 0UL;
366 :
367 0 : for( ulong i=0UL; i<shred_cnt; i++ ) {
368 : /* Remove the leader. */
369 0 : if( FD_LIKELY( query && leader_is_staked ) ) fd_wsample_remove_idx( sdest->staked, leader_idx );
370 :
371 0 : ulong my_idx = 0UL;
372 0 : fd_wsample_seed_rng( sdest->staked, dest_hash_outputs[ i ] ); /* Seeds both samplers since the rng is shared */
373 :
374 0 : if( FD_UNLIKELY( !i_am_staked ) ) {
375 : /* Quickly burn through all the staked nodes since I'll be in the
376 : unstaked portion. We don't care about the values, but we need
377 : to advance the RNG the right number of times, and sadly there's
378 : no other way to do it than this. There can't be too many of
379 : them since otherwise we would have taken the quick exit at the
380 : start of the function. */
381 0 : staked_shuffle_populated_cnt = sdest->staked_cnt + 1UL;
382 0 : fd_wsample_sample_and_remove_many( sdest->staked, staked_shuffle, staked_shuffle_populated_cnt );
383 0 : my_idx += sdest->staked_cnt - (ulong)(query && leader_is_staked);
384 :
385 0 : prepare_unstaked_sampling( sdest, leader_idx );
386 0 : while( my_idx <= fanout ) {
387 0 : ulong sample = sample_unstaked( sdest );
388 0 : if( FD_UNLIKELY( sample==my_orig_idx ) ) break; /* Found me! */
389 0 : if( FD_UNLIKELY( sample==FD_WSAMPLE_EMPTY ) ) return NULL; /* I couldn't find myself. This should be impossible. */
390 0 : my_idx++;
391 0 : }
392 0 : } else {
393 0 : staked_shuffle_populated_cnt = fd_ulong_min( fanout+1UL, sdest->staked_cnt+1UL );
394 0 : fd_wsample_sample_and_remove_many( sdest->staked, staked_shuffle, staked_shuffle_populated_cnt );
395 0 : while( my_idx <= fanout ) {
396 : /* my_idx < fanout+1UL because of the while loop condition.
397 : my_idx < staked_cnt+1UL because my_idx==staked_cnt will
398 : trigger sample==FD_WSAMPLE_EMPTY below. Thus, this access is
399 : safe. */
400 0 : ulong sample = staked_shuffle[ my_idx ];
401 0 : if( FD_UNLIKELY( sample==my_orig_idx ) ) break; /* Found me! */
402 0 : if( FD_UNLIKELY( sample==FD_WSAMPLE_EMPTY ) ) return NULL; /* I couldn't find myself. This should be impossible. */
403 0 : my_idx++;
404 0 : }
405 0 : }
406 :
407 0 : if( FD_LIKELY( my_idx > fanout ) ) {
408 : /* I'm at the bottom of Turbine tree for this shred. Fill in all
409 : the destinations with NO_DEST. */
410 0 : for( ulong j=0UL; j<dest_cnt; j++ ) out[ j*out_stride + i ] = FD_SHRED_DEST_NO_DEST;
411 :
412 0 : fd_wsample_restore_all( sdest->staked );
413 0 : continue; /* Next shred */
414 0 : }
415 : /* If my index is | Send to indices
416 : ------------------------------------
417 : Leader (no idx) | 0 (just for reference)
418 : 0 | 1, 2, ..., F
419 : j in [1, F] | j + l*F for l in [1,F]
420 : [F+1, F^2+F] | Nobody
421 : [F^2+F+1, inf) | Not yet implemented in Agave code
422 : */
423 0 : ulong last_dest_idx = fd_ulong_if( my_idx==0UL, fanout, my_idx+fanout*fanout ); /* inclusive */
424 0 : ulong stride = fd_ulong_if( my_idx==0UL, 1UL, fanout );
425 :
426 0 : last_dest_idx = fd_ulong_min( last_dest_idx, my_idx + stride*dest_cnt );
427 :
428 0 : ulong cursor = my_idx+1UL;
429 0 : ulong stored_cnt = 0UL;
430 :
431 0 : if( FD_LIKELY( (last_dest_idx>=staked_shuffle_populated_cnt) & (staked_shuffle_populated_cnt<sdest->staked_cnt+1UL ) ) ) {
432 0 : ulong adtl = fd_ulong_min( last_dest_idx+1UL, sdest->staked_cnt+1UL ) - staked_shuffle_populated_cnt;
433 :
434 0 : fd_wsample_sample_and_remove_many( sdest->staked, staked_shuffle+staked_shuffle_populated_cnt, adtl );
435 0 : staked_shuffle_populated_cnt += adtl;
436 0 : }
437 :
438 0 : while( cursor<=fd_ulong_min( last_dest_idx, sdest->staked_cnt ) ) {
439 0 : ulong sample = staked_shuffle[ cursor ];
440 0 : if( FD_UNLIKELY( sample==FD_WSAMPLE_EMPTY ) ) break;
441 :
442 0 : if( FD_UNLIKELY( cursor == my_idx + stride*(stored_cnt+1UL) ) ) {
443 0 : out[ stored_cnt*out_stride + i ] = (fd_shred_dest_idx_t)sample;
444 0 : stored_cnt++;
445 0 : }
446 0 : cursor++;
447 0 : }
448 :
449 : /* Next set of samples (if any) come from the unstaked portion. If I
450 : am not staked, then prepare_unstaked_sampling was already called
451 : earlier. */
452 0 : if( FD_LIKELY( (cursor<=last_dest_idx) & !!i_am_staked ) ) prepare_unstaked_sampling( sdest, leader_idx );
453 0 : while( cursor<=last_dest_idx ) {
454 0 : ulong sample = sample_unstaked( sdest );
455 0 : if( FD_UNLIKELY( sample==FD_WSAMPLE_EMPTY ) ) break;
456 :
457 0 : if( FD_UNLIKELY( cursor == my_idx + stride*(stored_cnt+1UL) ) ) {
458 0 : out[ stored_cnt*out_stride + i ] = (fd_shred_dest_idx_t)sample;
459 0 : stored_cnt++;
460 0 : }
461 0 : cursor++;
462 0 : }
463 0 : max_dest_cnt = fd_ulong_max( max_dest_cnt, stored_cnt );
464 :
465 : /* The rest of my destinations are past the end of the tree */
466 0 : for( ulong j=stored_cnt; j<dest_cnt; j++ ) out[ j*out_stride + i ] = FD_SHRED_DEST_NO_DEST;
467 :
468 0 : fd_wsample_restore_all( sdest->staked );
469 :
470 0 : }
471 0 : fd_ulong_store_if( !!opt_max_dest_cnt, opt_max_dest_cnt, max_dest_cnt );
472 0 : return out;
473 0 : }
474 :
475 : fd_shred_dest_idx_t
476 : fd_shred_dest_pubkey_to_idx( fd_shred_dest_t * sdest,
477 0 : fd_pubkey_t const * pubkey ) {
478 0 : if( FD_UNLIKELY( !memcmp( pubkey, null_pubkey.uc, 32UL ) ) ) return FD_SHRED_DEST_NO_DEST;
479 :
480 0 : pubkey_to_idx_t default_res[ 1 ] = {{ .idx = FD_SHRED_DEST_NO_DEST }};
481 0 : pubkey_to_idx_t * query = pubkey_to_idx_query( sdest->pubkey_to_idx_map, *pubkey, default_res );
482 :
483 0 : return (fd_shred_dest_idx_t)query->idx;
484 0 : }
485 :
486 : fd_shred_dest_idx_t
487 : fd_shred_dest_leader_for_slot( fd_shred_dest_t const * sdest,
488 0 : ulong slot ) {
489 0 : fd_pubkey_t const * leader = fd_epoch_leaders_get( sdest->lsched, slot );
490 0 : if( FD_UNLIKELY( !leader ) ) return FD_SHRED_DEST_NO_DEST;
491 :
492 0 : pubkey_to_idx_t default_res[ 1 ] = {{ .idx = FD_SHRED_DEST_NO_DEST }};
493 0 : pubkey_to_idx_t const * query = pubkey_to_idx_query( sdest->pubkey_to_idx_map, *leader, default_res );
494 0 : if( FD_UNLIKELY( query->idx==sdest->source_validator_orig_idx ) ) return FD_SHRED_DEST_NO_DEST;
495 :
496 0 : return (fd_shred_dest_idx_t)query->idx;
497 0 : }
498 :
|
