Line data Source code
1 : #include "fd_shred_dest.h"
2 : #include "../../flamenco/accdb/fd_accdb.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 210681063 : #define MAP_T pubkey_to_idx_t
14 255109065 : #define MAP_KEY_T fd_pubkey_t
15 764147634 : #define MAP_KEY_NULL null_pubkey
16 : #define MAP_KEY_EQUAL_IS_SLOW 1
17 : #define MAP_MEMOIZE 0
18 255109065 : #define MAP_KEY_INVAL(k) MAP_KEY_EQUAL((k),MAP_KEY_NULL)
19 304603080 : #define MAP_KEY_EQUAL(k0,k1) (!memcmp( (k0).key, (k1).key, 32UL ))
20 210114261 : #define MAP_KEY_HASH(k,s) ((MAP_HASH_T)fd_accdb_hash( (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 120606 : fd_shred_dest_footprint( ulong staked_cnt, ulong unstaked_cnt ) {
37 120606 : ulong cnt = staked_cnt+unstaked_cnt;
38 120606 : int lg_cnt = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*fd_ulong_max( cnt, 1UL ) ) );
39 120606 : return FD_LAYOUT_FINI( FD_LAYOUT_APPEND( FD_LAYOUT_APPEND( FD_LAYOUT_APPEND( FD_LAYOUT_APPEND( FD_LAYOUT_APPEND(
40 120606 : FD_LAYOUT_INIT,
41 120606 : fd_shred_dest_align(), sizeof(fd_shred_dest_t) ),
42 120606 : pubkey_to_idx_align(), pubkey_to_idx_footprint( lg_cnt ) ),
43 120606 : alignof(fd_shred_dest_weighted_t), sizeof(fd_shred_dest_weighted_t)*cnt ),
44 120606 : fd_wsample_align(), fd_wsample_footprint( staked_cnt, 1 )),
45 120606 : alignof(ulong), sizeof(ulong)*unstaked_cnt ),
46 120606 : FD_SHRED_DEST_ALIGN );
47 120606 : }
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 283407 : ulong seed ) {
57 :
58 283407 : if( FD_UNLIKELY( !mem ) ) {
59 3 : FD_LOG_WARNING(( "NULL mem" ));
60 3 : return NULL;
61 3 : }
62 :
63 283404 : if( FD_UNLIKELY( !fd_ulong_is_aligned( (ulong)mem, fd_shred_dest_align() ) ) ) {
64 3 : FD_LOG_WARNING(( "misaligned mem" ));
65 3 : return NULL;
66 3 : }
67 :
68 283401 : int lg_cnt = fd_ulong_find_msb( fd_ulong_pow2_up( 2UL*fd_ulong_max( cnt, 1UL ) ) );
69 283401 : FD_SCRATCH_ALLOC_INIT( footprint, mem );
70 283401 : fd_shred_dest_t * sdest;
71 283401 : /* */ sdest = FD_SCRATCH_ALLOC_APPEND( footprint, fd_shred_dest_align(), sizeof(fd_shred_dest_t) );
72 283401 : void * _map = FD_SCRATCH_ALLOC_APPEND( footprint, pubkey_to_idx_align(), pubkey_to_idx_footprint( lg_cnt ) );
73 283401 : void * _info = FD_SCRATCH_ALLOC_APPEND( footprint, alignof(fd_shred_dest_weighted_t), sizeof(fd_shred_dest_weighted_t)*cnt );
74 :
75 283401 : ulong cnts[2] = { 0UL, 0UL }; /* cnts[0] = staked, cnts[1] = unstaked */
76 :
77 283401 : fd_shred_dest_weighted_t * copy = (fd_shred_dest_weighted_t *)_info;
78 205898451 : for( ulong i=0UL; i<cnt; i++ ) {
79 205615050 : copy[i] = info[i];
80 205615050 : 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 205615050 : 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 205615050 : cnts[ stake==0UL ]++;
88 205615050 : }
89 :
90 283401 : ulong staked_cnt = cnts[0];
91 283401 : ulong unstaked_cnt = cnts[1];
92 :
93 283401 : void * _wsample = FD_SCRATCH_ALLOC_APPEND( footprint, fd_wsample_align(), fd_wsample_footprint( staked_cnt, 1 ));
94 283401 : void * _unstaked = FD_SCRATCH_ALLOC_APPEND( footprint, alignof(ulong), sizeof(ulong)*unstaked_cnt );
95 :
96 :
97 283401 : fd_chacha_rng_t * rng = fd_chacha_rng_join( fd_chacha_rng_new( sdest->rng, FD_CHACHA_RNG_MODE_SHIFT ) );
98 :
99 283401 : void * _staked = fd_wsample_new_init( _wsample, rng, staked_cnt, 1, FD_WSAMPLE_HINT_POWERLAW_REMOVE );
100 :
101 171291384 : for( ulong i=0UL; i<staked_cnt; i++ ) _staked = fd_wsample_new_add( _staked, info[i].stake_lamports );
102 283401 : _staked = fd_wsample_new_fini( _staked, 0UL );
103 :
104 283401 : pubkey_to_idx_t * pubkey_to_idx_map = pubkey_to_idx_join( pubkey_to_idx_new( _map, lg_cnt, seed ) );
105 205898451 : 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 205615050 : pubkey_to_idx_t * inserted = pubkey_to_idx_insert( pubkey_to_idx_map, info[i].pubkey );
109 205615050 : if( FD_UNLIKELY( !inserted ) ) {
110 0 : continue;
111 0 : }
112 205615050 : inserted->idx = i;
113 205615050 : }
114 283401 : pubkey_to_idx_t * query = pubkey_to_idx_query( pubkey_to_idx_map, *source, NULL );
115 283401 : if( FD_UNLIKELY( !query ) ) {
116 3 : FD_LOG_WARNING(( "source pubkey not found" ));
117 3 : return NULL;
118 3 : }
119 :
120 283398 : memset( sdest->null_dest, 0, sizeof(fd_shred_dest_weighted_t) );
121 283398 : sdest->lsched = lsched;
122 283398 : sdest->cnt = cnt;
123 283398 : sdest->all_destinations = copy;
124 283398 : sdest->staked = fd_wsample_join( _staked );
125 283398 : sdest->unstaked = _unstaked;
126 283398 : sdest->unstaked_unremoved_cnt = 0UL; /* unstaked doesn't get initialized until it's needed */
127 283398 : sdest->staked_cnt = staked_cnt;
128 283398 : sdest->unstaked_cnt = unstaked_cnt;
129 283398 : sdest->pubkey_to_idx_map = pubkey_to_idx_map;
130 283398 : sdest->source_validator_orig_idx = query->idx;
131 :
132 283398 : return (void *)sdest;
133 283401 : }
134 :
135 283401 : fd_shred_dest_t * fd_shred_dest_join( void * mem ) { return (fd_shred_dest_t *)mem; }
136 283179 : void * fd_shred_dest_leave( fd_shred_dest_t * sdest ) { return (void *)sdest; }
137 :
138 283179 : void * fd_shred_dest_delete( void * mem ) {
139 283179 : fd_shred_dest_t * sdest = (fd_shred_dest_t *)mem;
140 :
141 283179 : fd_chacha_rng_delete( fd_chacha_rng_leave( sdest->rng ) );
142 283179 : fd_wsample_delete ( fd_wsample_leave ( sdest->staked ) );
143 283179 : pubkey_to_idx_delete( pubkey_to_idx_leave( sdest->pubkey_to_idx_map ) );
144 283179 : return mem;
145 283179 : }
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 99 : ulong remove_idx ) {
182 : /* is remove_idx in
183 : [sdest->staked_cnt, sdest->staked_cnt+sdest->unstaked_cnt) ? */
184 99 : int remove_in_interval = (sdest->staked_cnt <= remove_idx) & (remove_idx < (sdest->staked_cnt+sdest->unstaked_cnt) );
185 99 : ulong unstaked_cnt = sdest->unstaked_cnt - (ulong)remove_in_interval;
186 99 : if( FD_UNLIKELY( unstaked_cnt==0UL ) ) return FD_WSAMPLE_EMPTY;
187 :
188 99 : ulong sample = sdest->staked_cnt + fd_chacha_rng_ulong_roll( sdest->rng, unstaked_cnt );
189 99 : return fd_ulong_if( (!remove_in_interval) | (sample<remove_idx), sample, sample+1UL );
190 99 : }
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 130893 : ulong remove_idx ) {
198 130893 : int remove_in_interval = (sdest->staked_cnt <= remove_idx) & (remove_idx < (sdest->staked_cnt+sdest->unstaked_cnt) );
199 130893 : ulong unstaked_cnt = sdest->unstaked_cnt - (ulong)remove_in_interval;
200 130893 : sdest->unstaked_unremoved_cnt = unstaked_cnt;
201 130893 : 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 130062 : ulong direct_index_up_to = fd_ulong_if( remove_in_interval, remove_idx - sdest->staked_cnt, unstaked_cnt );
207 130062 : ulong i=0UL;
208 10804059 : for( ; i<direct_index_up_to; i++ ) sdest->unstaked[i] = i+sdest->staked_cnt;
209 624657 : for( ; i<unstaked_cnt; i++ ) sdest->unstaked[i] = i+sdest->staked_cnt + 1UL;
210 130062 : }
211 :
212 : static inline ulong
213 11021757 : sample_unstaked( fd_shred_dest_t * sdest ) {
214 11021757 : if( FD_UNLIKELY( sdest->unstaked_unremoved_cnt==0UL ) ) return FD_WSAMPLE_EMPTY;
215 :
216 10909608 : ulong sample = fd_chacha_rng_ulong_roll( sdest->rng, sdest->unstaked_unremoved_cnt );
217 10909608 : ulong to_return = sdest->unstaked[sample];
218 10909608 : sdest->unstaked[sample] = sdest->unstaked[--sdest->unstaked_unremoved_cnt];
219 10909608 : return to_return;
220 11021757 : }
221 :
222 :
223 : /* Returns 0 on success
224 : https://github.com/anza-xyz/agave/blob/v2.2.1/ledger/src/shred.rs#L293 */
225 : static inline int
226 : compute_seeds( fd_shred_dest_t * sdest,
227 : fd_shred_t const * const * input_shreds,
228 : ulong shred_cnt,
229 : fd_pubkey_t const * leader,
230 : ulong slot,
231 1026765 : uchar dest_hash_output[ FD_SHRED_DEST_MAX_SHRED_CNT ][ 32 ] ) {
232 :
233 1026765 : shred_dest_input_t dest_hash_inputs [ FD_SHRED_DEST_MAX_SHRED_CNT ];
234 1026765 : fd_sha256_batch_t * sha256 = fd_sha256_batch_init( sdest->_sha256_batch );
235 :
236 2803530 : for( ulong i=0UL; i<shred_cnt; i++ ) {
237 1776765 : shred_dest_input_t * h_in = dest_hash_inputs+i;
238 1776765 : fd_shred_t const * shred = input_shreds[i];
239 1776765 : if( FD_UNLIKELY( shred->slot != slot ) ) return -1;
240 :
241 1776765 : uchar shred_type = fd_shred_type( shred->variant );
242 1776765 : h_in->slot = slot;
243 1776765 : h_in->type = fd_uchar_if( fd_shred_is_data( shred_type ), 0xA5, 0x5A );
244 1776765 : h_in->idx = shred->idx;
245 1776765 : memcpy( h_in->leader_pubkey, leader, 32UL );
246 :
247 1776765 : fd_sha256_batch_add( sha256, dest_hash_inputs+i, sizeof(shred_dest_input_t), dest_hash_output[ i ] );
248 1776765 : }
249 1026765 : fd_sha256_batch_fini( sha256 );
250 1026765 : return 0;
251 1026765 : }
252 :
253 :
254 : fd_shred_dest_idx_t *
255 : fd_shred_dest_compute_first( fd_shred_dest_t * sdest,
256 : fd_shred_t const * const * input_shreds,
257 : ulong shred_cnt,
258 5811 : fd_shred_dest_idx_t * out ) {
259 :
260 5811 : if( FD_UNLIKELY( shred_cnt==0UL ) ) return out;
261 :
262 5811 : if( FD_UNLIKELY( sdest->cnt<=1UL ) ) {
263 : /* We are the only validator that we know about, and we can't send
264 : it to ourself, so there's nobody we can send the shred to. */
265 0 : for( ulong i=0UL; i<shred_cnt; i++ ) out[ i ] = FD_SHRED_DEST_NO_DEST;
266 0 : return out;
267 0 : }
268 :
269 5811 : uchar dest_hash_outputs[ FD_SHRED_DEST_MAX_SHRED_CNT ][ 32 ];
270 :
271 5811 : ulong slot = input_shreds[0]->slot;
272 5811 : fd_pubkey_t const * leader = fd_epoch_leaders_get( sdest->lsched, slot );
273 5811 : if( FD_UNLIKELY( !leader ) ) return NULL;
274 :
275 5811 : if( FD_UNLIKELY( compute_seeds( sdest, input_shreds, shred_cnt, leader, slot, dest_hash_outputs ) ) ) return NULL;
276 :
277 : /* If we're calling this, we must be the leader. That means we had
278 : some stake when the leader schedule was created, but maybe not
279 : anymore? This version of the code is safe either way, but I should
280 : probably confirm this can happen. */
281 5811 : int source_validator_is_staked = sdest->source_validator_orig_idx<sdest->staked_cnt;
282 5811 : if( FD_LIKELY( source_validator_is_staked ) )
283 4149 : fd_wsample_remove_idx( sdest->staked, sdest->source_validator_orig_idx );
284 :
285 5811 : int any_staked_candidates = sdest->staked_cnt > (ulong)source_validator_is_staked;
286 11622 : for( ulong i=0UL; i<shred_cnt; i++ ) {
287 5811 : fd_wsample_seed_rng( sdest->staked, dest_hash_outputs[ i ] );
288 : /* Map FD_WSAMPLE_EMPTY (UINT_MAX) to FD_SHRED_DEST_NO_DEST.
289 : Otherwise, since wsample guarantees the returned index is in
290 : [0, INT_MAX], it will remain non-negative when cast to an int. */
291 5811 : FD_STATIC_ASSERT( (int)FD_WSAMPLE_EMPTY <=-1, wsample_val );
292 5811 : FD_STATIC_ASSERT( FD_SHRED_DEST_NO_DEST==(fd_shred_dest_idx_t)-1, wsample_val );
293 5811 : if( FD_LIKELY( any_staked_candidates ) ) out[i] = (fd_shred_dest_idx_t)fd_int_max( (int)fd_wsample_sample( sdest->staked ), -1 );
294 99 : else out[i] = (fd_shred_dest_idx_t)sample_unstaked_noprepare( sdest, sdest->source_validator_orig_idx );
295 5811 : }
296 5811 : fd_wsample_restore_all( sdest->staked );
297 :
298 5811 : return out;
299 5811 : }
300 :
301 : fd_shred_dest_idx_t *
302 : fd_shred_dest_compute_children( fd_shred_dest_t * sdest,
303 : fd_shred_t const * const * input_shreds,
304 : ulong shred_cnt,
305 : fd_shred_dest_idx_t * out,
306 : ulong out_stride,
307 : ulong fanout,
308 : ulong dest_cnt,
309 1059255 : ulong * opt_max_dest_cnt ) {
310 :
311 : /* The logic here is a little tricky since we are keeping track of
312 : staked and unstaked separately and only logically concatenating
313 : them [staked, unstaked] , but that does allow us to skip some
314 : samples sometimes. We're operating from the source validator's
315 : perspective here, so everything in the first person singular refers
316 : to the source validator. */
317 :
318 1059255 : ulong my_orig_idx = sdest->source_validator_orig_idx;
319 1059255 : int i_am_staked = my_orig_idx<sdest->staked_cnt;
320 :
321 1059255 : fd_ulong_store_if( !!opt_max_dest_cnt, opt_max_dest_cnt, 0UL );
322 :
323 1059255 : if( FD_UNLIKELY( (shred_cnt==0UL) | (dest_cnt==0UL) ) ) return out; /* Nothing to do */
324 :
325 1059255 : ulong slot = input_shreds[0]->slot;
326 1059255 : fd_pubkey_t const * leader = fd_epoch_leaders_get ( sdest->lsched, slot );
327 1059255 : if( FD_UNLIKELY( !leader ) ) return NULL; /* Unknown slot */
328 :
329 1059255 : pubkey_to_idx_t * query = pubkey_to_idx_query( sdest->pubkey_to_idx_map, *leader, NULL );
330 1059255 : int leader_is_staked = query ? (query->idx<sdest->staked_cnt): 0;
331 1059255 : ulong leader_idx = query ? query->idx : ULONG_MAX;
332 1059255 : if( FD_UNLIKELY( leader_idx==my_orig_idx ) ) return NULL; /* I am the leader. Use compute_first */
333 :
334 1059255 : if( FD_UNLIKELY( (sdest->cnt<=1UL) | /* We don't know about a single destination, so we can't send
335 : anything. */
336 1059255 : ( (!i_am_staked) & (sdest->staked_cnt-(ulong)leader_is_staked>fanout) ) ) ) {
337 : /* My position is somewhere after all the staked nodes, which means
338 : my shuffled index is always greater than fanout. That means I'm
339 : always at the bottom of the Turbine tree so I don't have to send
340 : any shreds to anyone. */
341 19622568 : 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;
342 38301 : return out;
343 38301 : }
344 :
345 1020954 : uchar dest_hash_outputs[ FD_SHRED_DEST_MAX_SHRED_CNT ][ 32 ];
346 :
347 :
348 1020954 : if( FD_UNLIKELY( compute_seeds( sdest, input_shreds, shred_cnt, leader, slot, dest_hash_outputs ) ) ) return NULL;
349 :
350 1020954 : ulong max_dest_cnt = 0UL;
351 :
352 1020954 : ulong staked_shuffle[ sdest->staked_cnt+1UL ];
353 1020954 : ulong staked_shuffle_populated_cnt = 0UL;
354 :
355 2791908 : for( ulong i=0UL; i<shred_cnt; i++ ) {
356 : /* Remove the leader. */
357 1770954 : if( FD_LIKELY( query && leader_is_staked ) ) fd_wsample_remove_idx( sdest->staked, leader_idx );
358 :
359 1770954 : ulong my_idx = 0UL;
360 1770954 : fd_wsample_seed_rng( sdest->staked, dest_hash_outputs[ i ] ); /* Seeds both samplers since the rng is shared */
361 :
362 1770954 : if( FD_UNLIKELY( !i_am_staked ) ) {
363 : /* Quickly burn through all the staked nodes since I'll be in the
364 : unstaked portion. We don't care about the values, but we need
365 : to advance the RNG the right number of times, and sadly there's
366 : no other way to do it than this. There can't be too many of
367 : them since otherwise we would have taken the quick exit at the
368 : start of the function. */
369 37503 : staked_shuffle_populated_cnt = sdest->staked_cnt + 1UL;
370 37503 : fd_wsample_sample_and_remove_many( sdest->staked, staked_shuffle, staked_shuffle_populated_cnt );
371 37503 : my_idx += sdest->staked_cnt - (ulong)(query && leader_is_staked);
372 :
373 37503 : prepare_unstaked_sampling( sdest, leader_idx );
374 342495 : while( my_idx <= fanout ) {
375 325584 : ulong sample = sample_unstaked( sdest );
376 325584 : if( FD_UNLIKELY( sample==my_orig_idx ) ) break; /* Found me! */
377 304992 : if( FD_UNLIKELY( sample==FD_WSAMPLE_EMPTY ) ) return NULL; /* I couldn't find myself. This should be impossible. */
378 304992 : my_idx++;
379 304992 : }
380 1733451 : } else {
381 1733451 : staked_shuffle_populated_cnt = fd_ulong_min( fanout+1UL, sdest->staked_cnt+1UL );
382 1733451 : fd_wsample_sample_and_remove_many( sdest->staked, staked_shuffle, staked_shuffle_populated_cnt );
383 199964529 : while( my_idx <= fanout ) {
384 : /* my_idx < fanout+1UL because of the while loop condition.
385 : my_idx < staked_cnt+1UL because my_idx==staked_cnt will
386 : trigger sample==FD_WSAMPLE_EMPTY below. Thus, this access is
387 : safe. */
388 199074927 : ulong sample = staked_shuffle[ my_idx ];
389 199074927 : if( FD_UNLIKELY( sample==my_orig_idx ) ) break; /* Found me! */
390 198231078 : if( FD_UNLIKELY( sample==FD_WSAMPLE_EMPTY ) ) return NULL; /* I couldn't find myself. This should be impossible. */
391 198231078 : my_idx++;
392 198231078 : }
393 1733451 : }
394 :
395 1770954 : if( FD_LIKELY( my_idx > fanout ) ) {
396 : /* I'm at the bottom of Turbine tree for this shred. Fill in all
397 : the destinations with NO_DEST. */
398 185379297 : for( ulong j=0UL; j<dest_cnt; j++ ) out[ j*out_stride + i ] = FD_SHRED_DEST_NO_DEST;
399 :
400 906513 : fd_wsample_restore_all( sdest->staked );
401 906513 : continue; /* Next shred */
402 906513 : }
403 : /* If my index is | Send to indices
404 : ------------------------------------
405 : Leader (no idx) | 0 (just for reference)
406 : 0 | 1, 2, ..., F
407 : j in [1, F] | j + l*F for l in [1,F]
408 : [F+1, F^2+F] | Nobody
409 : [F^2+F+1, inf) | Not yet implemented in Agave code
410 : */
411 864441 : ulong last_dest_idx = fd_ulong_if( my_idx==0UL, fanout, my_idx+fanout*fanout ); /* inclusive */
412 864441 : ulong stride = fd_ulong_if( my_idx==0UL, 1UL, fanout );
413 :
414 864441 : last_dest_idx = fd_ulong_min( last_dest_idx, my_idx + stride*dest_cnt );
415 :
416 864441 : ulong cursor = my_idx+1UL;
417 864441 : ulong stored_cnt = 0UL;
418 :
419 864441 : if( FD_LIKELY( (last_dest_idx>=staked_shuffle_populated_cnt) & (staked_shuffle_populated_cnt<sdest->staked_cnt+1UL ) ) ) {
420 399483 : ulong adtl = fd_ulong_min( last_dest_idx+1UL, sdest->staked_cnt+1UL ) - staked_shuffle_populated_cnt;
421 :
422 399483 : fd_wsample_sample_and_remove_many( sdest->staked, staked_shuffle+staked_shuffle_populated_cnt, adtl );
423 399483 : staked_shuffle_populated_cnt += adtl;
424 399483 : }
425 :
426 52200618 : while( cursor<=fd_ulong_min( last_dest_idx, sdest->staked_cnt ) ) {
427 51430104 : ulong sample = staked_shuffle[ cursor ];
428 51430104 : if( FD_UNLIKELY( sample==FD_WSAMPLE_EMPTY ) ) break;
429 :
430 51336177 : if( FD_UNLIKELY( cursor == my_idx + stride*(stored_cnt+1UL) ) ) {
431 3948258 : out[ stored_cnt*out_stride + i ] = (fd_shred_dest_idx_t)sample;
432 3948258 : stored_cnt++;
433 3948258 : }
434 51336177 : cursor++;
435 51336177 : }
436 :
437 : /* Next set of samples (if any) come from the unstaked portion. If I
438 : am not staked, then prepare_unstaked_sampling was already called
439 : earlier. */
440 864441 : if( FD_LIKELY( (cursor<=last_dest_idx) & !!i_am_staked ) ) prepare_unstaked_sampling( sdest, leader_idx );
441 11448465 : while( cursor<=last_dest_idx ) {
442 10696173 : ulong sample = sample_unstaked( sdest );
443 10696173 : if( FD_UNLIKELY( sample==FD_WSAMPLE_EMPTY ) ) break;
444 :
445 10584024 : if( FD_UNLIKELY( cursor == my_idx + stride*(stored_cnt+1UL) ) ) {
446 76692 : out[ stored_cnt*out_stride + i ] = (fd_shred_dest_idx_t)sample;
447 76692 : stored_cnt++;
448 76692 : }
449 10584024 : cursor++;
450 10584024 : }
451 864441 : max_dest_cnt = fd_ulong_max( max_dest_cnt, stored_cnt );
452 :
453 : /* The rest of my destinations are past the end of the tree */
454 26467605 : for( ulong j=stored_cnt; j<dest_cnt; j++ ) out[ j*out_stride + i ] = FD_SHRED_DEST_NO_DEST;
455 :
456 864441 : fd_wsample_restore_all( sdest->staked );
457 :
458 864441 : }
459 1020954 : fd_ulong_store_if( !!opt_max_dest_cnt, opt_max_dest_cnt, max_dest_cnt );
460 1020954 : return out;
461 1020954 : }
462 :
463 : fd_shred_dest_idx_t
464 : fd_shred_dest_pubkey_to_idx( fd_shred_dest_t * sdest,
465 3156555 : fd_pubkey_t const * pubkey ) {
466 3156555 : if( FD_UNLIKELY( !memcmp( pubkey, null_pubkey.uc, 32UL ) ) ) return FD_SHRED_DEST_NO_DEST;
467 :
468 3156555 : pubkey_to_idx_t default_res[ 1 ] = {{ .idx = FD_SHRED_DEST_NO_DEST }};
469 3156555 : pubkey_to_idx_t * query = pubkey_to_idx_query( sdest->pubkey_to_idx_map, *pubkey, default_res );
470 :
471 3156555 : return (fd_shred_dest_idx_t)query->idx;
472 3156555 : }
473 :
|
