Line data Source code
1 : #include "fd_wksp_private.h"
2 :
3 : FD_TL int fd_wksp_oom_silent = 0;
4 :
5 : /* fd_wksp_private_split_before splits a partition (index i2) into two
6 : smaller partitions and returns the partition index (i1) of the
7 : partition created by the split. The created partition will be
8 : immediately before the original partition. It will be in the
9 : partitioning with a zero tag. It will not be in the idle stack, used
10 : treap or free treap.
11 :
12 : sz is size of the original partition post split. This should be in
13 : (0,original_sz) (yes, open on both ends such that the post split
14 : partitions both have non-zero size.
15 :
16 : This will pop the idle stack once to assign the index of the newly
17 : created partition. Assumes the caller knows the idle stack is not
18 : empty.
19 :
20 : Assumes the original partition is in the partitioning with a zero
21 : tag. Further assumes the original partition is not in the idle
22 : stack, used treap or free treap.
23 :
24 : fd_wksp_private_split_after is identical except the partition created
25 : by the split is after the original partition. */
26 :
27 : static ulong /* In [0,part_max) */
28 : fd_wksp_private_split_before( ulong i2, /* In [0,part_max) */
29 : ulong s2, /* In (0,size of i2) */
30 : fd_wksp_t * wksp, /* Current local join */
31 7556121 : fd_wksp_private_pinfo_t * pinfo ) { /* == fd_wksp_private_pinfo( wksp ) */
32 :
33 7556121 : ulong g3 = pinfo[ i2 ].gaddr_hi; /* Old end here */
34 7556121 : ulong g2 = g3 - s2; /* New ends here */
35 7556121 : ulong g1 = pinfo[ i2 ].gaddr_lo; /* New starts here */
36 :
37 7556121 : ulong i0 = fd_wksp_private_pinfo_idx( pinfo[ i2 ].prev_cidx ); /* Old before */
38 7556121 : ulong i1 = fd_wksp_private_idle_stack_pop( wksp, pinfo ); /* New before */
39 :
40 7556121 : pinfo[ i1 ].gaddr_lo = g1;
41 7556121 : pinfo[ i1 ].gaddr_hi = g2;
42 7556121 : pinfo[ i1 ].tag = 0UL;
43 7556121 : pinfo[ i1 ].in_same = 0U;
44 7556121 : pinfo[ i1 ].prev_cidx = fd_wksp_private_pinfo_cidx( i0 );
45 7556121 : pinfo[ i1 ].next_cidx = fd_wksp_private_pinfo_cidx( i2 );
46 7556121 : pinfo[ i1 ].left_cidx = fd_wksp_private_pinfo_cidx( FD_WKSP_PRIVATE_PINFO_IDX_NULL );
47 7556121 : pinfo[ i1 ].right_cidx = fd_wksp_private_pinfo_cidx( FD_WKSP_PRIVATE_PINFO_IDX_NULL );
48 7556121 : pinfo[ i1 ].same_cidx = fd_wksp_private_pinfo_cidx( FD_WKSP_PRIVATE_PINFO_IDX_NULL );
49 7556121 : pinfo[ i1 ].parent_cidx = fd_wksp_private_pinfo_cidx( FD_WKSP_PRIVATE_PINFO_IDX_NULL );
50 :
51 7556121 : pinfo[ i2 ].gaddr_lo = g2;
52 7556121 : pinfo[ i2 ].prev_cidx = fd_wksp_private_pinfo_cidx( i1 );
53 :
54 7556121 : if( fd_wksp_private_pinfo_idx_is_null( i0 ) ) wksp->part_head_cidx = fd_wksp_private_pinfo_cidx( i1 );
55 7553388 : else pinfo[ i0 ].next_cidx = fd_wksp_private_pinfo_cidx( i1 );
56 :
57 7556121 : return i1;
58 7556121 : }
59 :
60 : static ulong /* In [0,part_max) */
61 : fd_wksp_private_split_after( ulong i1, /* In [0,part_max) */
62 : ulong s1, /* In (0,size of i2) */
63 : fd_wksp_t * wksp, /* Current local join */
64 14350272 : fd_wksp_private_pinfo_t * pinfo ) { /* == fd_wksp_private_pinfo( wksp ) */
65 :
66 14350272 : ulong g1 = pinfo[ i1 ].gaddr_lo; /* Old starts here */
67 14350272 : ulong g2 = g1 + s1; /* New starts here */
68 14350272 : ulong g3 = pinfo[ i1 ].gaddr_hi; /* New end here */
69 :
70 14350272 : ulong i2 = fd_wksp_private_idle_stack_pop( wksp, pinfo ); /* New before */
71 14350272 : ulong i3 = fd_wksp_private_pinfo_idx( pinfo[ i1 ].next_cidx ); /* Old after */
72 :
73 14350272 : pinfo[ i2 ].gaddr_lo = g2;
74 14350272 : pinfo[ i2 ].gaddr_hi = g3;
75 14350272 : pinfo[ i2 ].tag = 0UL;
76 14350272 : pinfo[ i2 ].in_same = 0U;
77 14350272 : pinfo[ i2 ].prev_cidx = fd_wksp_private_pinfo_cidx( i1 );
78 14350272 : pinfo[ i2 ].next_cidx = fd_wksp_private_pinfo_cidx( i3 );
79 14350272 : pinfo[ i2 ].left_cidx = fd_wksp_private_pinfo_cidx( FD_WKSP_PRIVATE_PINFO_IDX_NULL );
80 14350272 : pinfo[ i2 ].right_cidx = fd_wksp_private_pinfo_cidx( FD_WKSP_PRIVATE_PINFO_IDX_NULL );
81 14350272 : pinfo[ i2 ].same_cidx = fd_wksp_private_pinfo_cidx( FD_WKSP_PRIVATE_PINFO_IDX_NULL );
82 14350272 : pinfo[ i2 ].parent_cidx = fd_wksp_private_pinfo_cidx( FD_WKSP_PRIVATE_PINFO_IDX_NULL );
83 :
84 14350272 : pinfo[ i1 ].gaddr_hi = g2;
85 14350272 : pinfo[ i1 ].next_cidx = fd_wksp_private_pinfo_cidx( i2 );
86 :
87 14350272 : if( fd_wksp_private_pinfo_idx_is_null( i3 ) ) wksp->part_tail_cidx = fd_wksp_private_pinfo_cidx( i2 );
88 12597672 : else pinfo[ i3 ].prev_cidx = fd_wksp_private_pinfo_cidx( i2 );
89 :
90 14350272 : return i2;
91 14350272 : }
92 :
93 : /* fd_wksp_private_merge_before i1 into i2 where i1 is the partition
94 : immediately preceding i2. Assumes that i2 and the partition before
95 : it are not tagged and not in the idle stack, free treap or used
96 : treap.
97 :
98 : This will push the idle stack once to make the index used for the
99 : preceding partition available for future use.
100 :
101 : fd_wksp_private_merge_after is identical except the partition to
102 : merge the split is after the original partition. */
103 :
104 : static void
105 : fd_wksp_private_merge_before( ulong i1, /* In [0,part_max), == prev to i2, on idle stack on return */
106 : ulong i2, /* In [0,part_max) */
107 : fd_wksp_t * wksp, /* Current local join */
108 10594929 : fd_wksp_private_pinfo_t * pinfo ) { /* == fd_wksp_private_pinfo( wksp ) */
109 :
110 10594929 : ulong i0 = fd_wksp_private_pinfo_idx( pinfo[ i1 ].prev_cidx ); /* Partition before that (if any) */
111 :
112 10594929 : pinfo[ i2 ].gaddr_lo = pinfo[ i1 ].gaddr_lo;
113 10594929 : pinfo[ i2 ].prev_cidx = fd_wksp_private_pinfo_cidx( i0 );
114 :
115 10594929 : if( fd_wksp_private_pinfo_idx_is_null( i0 ) ) wksp->part_head_cidx = fd_wksp_private_pinfo_cidx( i2 );
116 10299060 : else pinfo[ i0 ].next_cidx = fd_wksp_private_pinfo_cidx( i2 );
117 :
118 10594929 : fd_wksp_private_idle_stack_push( i1, wksp, pinfo );
119 10594929 : }
120 :
121 : static void
122 : fd_wksp_private_merge_after( ulong i1, /* In [0,part_max) */
123 : ulong i2, /* In [0,part_max), == next to i1, on idle stack on return */
124 : fd_wksp_t * wksp, /* Current local join */
125 11307324 : fd_wksp_private_pinfo_t * pinfo ) { /* == fd_wksp_private_pinfo( wksp ) */
126 :
127 11307324 : ulong i3 = fd_wksp_private_pinfo_idx( pinfo[ i2 ].next_cidx ); /* Partition after that (if any) */
128 :
129 11307324 : pinfo[ i1 ].gaddr_hi = pinfo[ i2 ].gaddr_hi;
130 11307324 : pinfo[ i1 ].next_cidx = fd_wksp_private_pinfo_cidx( i3 );
131 :
132 11307324 : if( fd_wksp_private_pinfo_idx_is_null( i3 ) ) wksp->part_tail_cidx = fd_wksp_private_pinfo_cidx( i1 );
133 10295028 : else pinfo[ i3 ].prev_cidx = fd_wksp_private_pinfo_cidx( i1 );
134 :
135 11307324 : fd_wksp_private_idle_stack_push( i2, wksp, pinfo );
136 11307324 : }
137 :
138 : static void
139 : fd_wksp_private_free( ulong i, /* Partition to free, in [0,part_max) */
140 : fd_wksp_t * wksp, /* Current local join */
141 15006591 : fd_wksp_private_pinfo_t * pinfo ) { /* == fd_wksp_private_pinfo( wksp ) */
142 :
143 15006591 : ulong part_max = wksp->part_max;
144 :
145 : /* Officially free i */
146 :
147 15006591 : FD_COMPILER_MFENCE();
148 15006591 : FD_VOLATILE( pinfo[ i ].tag ) = 0UL;
149 15006591 : FD_COMPILER_MFENCE();
150 :
151 : /* Remove it from various structures. It is okay if we are killed in
152 : this as next person to try to lock the wksp will detect this and
153 : rebuild the workspace. */
154 :
155 15006591 : if( FD_UNLIKELY( fd_wksp_private_used_treap_remove( i, wksp, pinfo ) ) ) {
156 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
157 0 : return;
158 0 : }
159 :
160 15006591 : ulong p = fd_wksp_private_pinfo_idx( pinfo[ i ].prev_cidx );
161 15006591 : if( FD_LIKELY( p<part_max ) && !pinfo[ p ].tag ) {
162 10594929 : if( FD_UNLIKELY( fd_wksp_private_free_treap_remove( p, wksp, pinfo ) ) ) {
163 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
164 0 : return;
165 0 : }
166 10594929 : fd_wksp_private_merge_before( p, i, wksp, pinfo );
167 10594929 : }
168 :
169 15006591 : ulong n = fd_wksp_private_pinfo_idx( pinfo[ i ].next_cidx );
170 15006591 : if( FD_LIKELY( n<part_max ) && !pinfo[ n ].tag ) {
171 11307324 : if( FD_UNLIKELY( fd_wksp_private_free_treap_remove( n, wksp, pinfo ) ) ) {
172 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
173 0 : return;
174 0 : }
175 11307324 : fd_wksp_private_merge_after( i, n, wksp, pinfo );
176 11307324 : }
177 :
178 15006591 : if( FD_UNLIKELY( fd_wksp_private_free_treap_insert( i, wksp, pinfo ) ) ) {
179 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
180 0 : return;
181 0 : }
182 :
183 : # if FD_HAS_DEEPASAN
184 : /* Poison the data region of the now freed allocation. */
185 : fd_asan_poison( fd_wksp_laddr_fast( wksp, pinfo[ i ].gaddr_lo ), pinfo[ i ].gaddr_hi - pinfo[ i ].gaddr_lo );
186 : # endif
187 15006591 : }
188 :
189 : /* user APIs **********************************************************/
190 :
191 : void *
192 : fd_wksp_laddr( fd_wksp_t const * wksp,
193 199044 : ulong gaddr ) {
194 199044 : if( FD_UNLIKELY( !wksp ) ) { FD_LOG_WARNING(( "NULL wksp" )); return NULL; }
195 :
196 199029 : if( !gaddr ) return NULL; /* "NULL" maps to NULL */
197 :
198 : /* Note: <= used for gaddr_hi below to support mapping ranges of the
199 : form [lo,hi) between local and global address spaces with no
200 : special handling if allocation put hi at the very end of the
201 : workspace. */
202 :
203 199023 : if( FD_UNLIKELY( !((wksp->gaddr_lo<=gaddr) & (gaddr<=wksp->gaddr_hi)) ) ) { FD_LOG_WARNING(( "bad gaddr" )); return NULL; }
204 :
205 199017 : return fd_wksp_laddr_fast( wksp, gaddr );
206 199023 : }
207 :
208 : ulong
209 : fd_wksp_gaddr( fd_wksp_t const * wksp,
210 196638 : void const * laddr ) {
211 196638 : if( FD_UNLIKELY( !wksp ) ) { FD_LOG_WARNING(( "NULL wksp" )); return 0UL; }
212 :
213 196623 : if( !laddr ) return 0UL; /* NULL maps to "NULL" */
214 :
215 196620 : ulong gaddr = fd_wksp_gaddr_fast( wksp, laddr );
216 :
217 : /* See note above about why <= for gaddr_hi */
218 :
219 196620 : if( FD_UNLIKELY( !((wksp->gaddr_lo<=gaddr) & (gaddr<=wksp->gaddr_hi)) ) ) { FD_LOG_WARNING(( "bad laddr" )); return 0UL; }
220 :
221 196614 : return gaddr;
222 196620 : }
223 :
224 : ulong
225 : fd_wksp_alloc_at_least( fd_wksp_t * wksp,
226 : ulong align,
227 : ulong sz,
228 : ulong tag,
229 : ulong * _lo,
230 15198915 : ulong * _hi ) {
231 15198915 : align = fd_ulong_if( !align, FD_WKSP_ALIGN_DEFAULT, align );
232 15198915 : ulong footprint = sz + align - 1UL;
233 :
234 15198915 : if( FD_UNLIKELY( !sz ) ) goto fail; /* silent */
235 15198900 : if( FD_UNLIKELY( !wksp ) ) { FD_LOG_WARNING(( "NULL wksp" )); goto fail; }
236 15198891 : if( FD_UNLIKELY( !fd_ulong_is_pow2( align ) ) ) { FD_LOG_WARNING(( "bad align" )); goto fail; }
237 15198873 : if( FD_UNLIKELY( !tag ) ) { FD_LOG_WARNING(( "bad tag" )); goto fail; }
238 :
239 : # if FD_HAS_DEEPASAN
240 : /* ASan poisons in 8 byte shadow granules, so bump alignment (and thus
241 : footprint) to meet manual poisoning requirements. */
242 : align = fd_ulong_if( align < FD_ASAN_ALIGN, FD_ASAN_ALIGN, align );
243 : footprint = sz + align - 1UL;
244 : # endif
245 :
246 15198855 : if( FD_UNLIKELY( footprint < sz ) ) { FD_LOG_WARNING(( "sz overflow" )); goto fail; }
247 :
248 15198849 : fd_wksp_private_pinfo_t * pinfo = fd_wksp_private_pinfo( wksp );
249 :
250 15198849 : if( FD_UNLIKELY( fd_wksp_private_lock( wksp ) ) ) goto fail; /* logs details */
251 :
252 : /* Find the smallest free partition size that can handle footprint.
253 : Note: it is theoretically possible when there is corruption that a
254 : failure to find a suitable partition could be fixed by rebuilding
255 : the wksp. But this should not be common and is expensive and we
256 : can't tell if this is a run-of-the-mill allocation failure
257 : (insufficient space or too much fragmentation) or an exotic data
258 : corruption case. So we just fail to keep algo cost strict and let
259 : the user decide if they want to attempt extreme measures. */
260 :
261 15198849 : ulong i = fd_wksp_private_free_treap_query( footprint, wksp, pinfo );
262 15198849 : if( FD_UNLIKELY( fd_wksp_private_pinfo_idx_is_null( i ) ) ) {
263 6 : fd_wksp_private_unlock( wksp );
264 6 : if( !fd_wksp_oom_silent ) FD_LOG_WARNING(( "no free space available in workspace %s with data size %lu", wksp->name, wksp->data_max ));
265 6 : goto fail;
266 6 : }
267 :
268 : /* At this point, i in [0,max), there is at least one suitable
269 : partition. If there is more than one, use one from the same list. */
270 :
271 15198843 : if( !fd_wksp_private_free_treap_same_is_empty( i, wksp, pinfo ) ) i = fd_wksp_private_free_treap_same_remove( i, wksp, pinfo );
272 14486487 : else if( FD_UNLIKELY( fd_wksp_private_free_treap_remove( i, wksp, pinfo ) ) ) {
273 0 : fd_wksp_private_unlock( wksp );
274 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
275 0 : goto fail;
276 0 : }
277 :
278 : /* At this point, partition i has a zero tag and is not in the idle
279 : stack, free treap, or used treap. Further, it is guaranteed to be
280 : large enough to hold the request. Trim it to fit the request as
281 : tightly as possible. We check before we trim that there are enough
282 : idle partitions available to complete the request (this improves
283 : checkpointing as all allocated partitions will be reasonably
284 : tight). */
285 :
286 15198843 : ulong lo = pinfo[ i ].gaddr_lo;
287 15198843 : ulong hi = pinfo[ i ].gaddr_hi;
288 :
289 15198843 : ulong r0 = fd_ulong_align_up( lo, align );
290 15198843 : ulong r1 = r0 + sz;
291 :
292 15198843 : ulong part_max = wksp->part_max;
293 15198843 : ulong idle_idx = fd_wksp_private_pinfo_idx( wksp->idle_top_cidx );
294 37168578 : for( int idle_rem = (r0>lo) + (r1<hi); idle_rem; idle_rem-- ) {
295 22159026 : if( FD_UNLIKELY( idle_idx >= part_max ) ) {
296 189291 : if( FD_UNLIKELY( fd_wksp_private_free_treap_insert( i, wksp, pinfo ) ) ) { /* Could eliminate this with additional surgery */
297 0 : fd_wksp_private_unlock( wksp );
298 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
299 0 : goto fail;
300 0 : }
301 189291 : fd_wksp_private_unlock( wksp );
302 189291 : FD_LOG_WARNING(( "too few partitions available for allocation (part_max %lu)", part_max ));
303 189291 : goto fail;
304 189291 : }
305 21969735 : idle_idx = fd_wksp_private_pinfo_idx( pinfo[ idle_idx ].parent_cidx );
306 21969735 : }
307 :
308 15009552 : if( FD_UNLIKELY( r0>lo ) ) { /* opt for reasonable alignments */
309 7556121 : ulong j = fd_wksp_private_split_before( i, hi-r0, wksp, pinfo );
310 7556121 : if( FD_UNLIKELY( fd_wksp_private_free_treap_insert( j, wksp, pinfo ) ) ) {
311 0 : fd_wksp_private_unlock( wksp );
312 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
313 0 : goto fail;
314 0 : }
315 7556121 : lo = r0;
316 7556121 : }
317 :
318 15009552 : if( FD_LIKELY( r1<hi ) ) { /* opt for splitting a final large partition */
319 14350272 : ulong j = fd_wksp_private_split_after( i, sz, wksp, pinfo );
320 14350272 : if( FD_UNLIKELY( fd_wksp_private_free_treap_insert( j, wksp, pinfo ) ) ) {
321 0 : fd_wksp_private_unlock( wksp );
322 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
323 0 : goto fail;
324 0 : }
325 14350272 : hi = r1;
326 14350272 : }
327 :
328 15009552 : if( FD_UNLIKELY( fd_wksp_private_used_treap_insert( i, wksp, pinfo ) ) ) {
329 0 : fd_wksp_private_unlock( wksp );
330 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
331 0 : goto fail;
332 0 : }
333 :
334 : /* At this point, i is unofficially allocated. It is okay if we get
335 : killed at any point above as the next wksp user to try to lock the
336 : wksp will detect that we died in the middle of an operation,
337 : potentially leaving the partitioning, idle stack, used treap and/or
338 : free treap might be in an inconsistent state and thus proceed to
339 : rebuild them. We now update the tag in the array to make the
340 : allocation official. */
341 :
342 15009552 : FD_COMPILER_MFENCE();
343 15009552 : FD_VOLATILE( pinfo[ i ].tag ) = tag;
344 15009552 : FD_COMPILER_MFENCE();
345 :
346 : # if FD_HAS_DEEPASAN
347 : /* Unpoison the data region of the allocation */
348 : fd_asan_unpoison( fd_wksp_laddr_fast( wksp, lo ), hi - lo );
349 : # endif
350 :
351 15009552 : fd_wksp_private_unlock( wksp );
352 15009552 : *_lo = lo;
353 15009552 : *_hi = hi;
354 15009552 : return r0;
355 :
356 189363 : fail:
357 189363 : *_lo = 0UL;
358 189363 : *_hi = 0UL;
359 189363 : return 0UL;
360 15009552 : }
361 :
362 : void
363 : fd_wksp_free( fd_wksp_t * wksp,
364 15005748 : ulong gaddr ) {
365 15005748 : if( FD_UNLIKELY( !gaddr ) ) return;
366 :
367 15005745 : if( FD_UNLIKELY( !wksp ) ) { FD_LOG_WARNING(( "NULL wksp" )); return; }
368 :
369 15005742 : ulong part_max = wksp->part_max;
370 15005742 : fd_wksp_private_pinfo_t * pinfo = fd_wksp_private_pinfo( wksp );
371 :
372 15005742 : if( FD_UNLIKELY( fd_wksp_private_lock( wksp ) ) ) return; /* logs details */
373 :
374 15005742 : ulong i = fd_wksp_private_used_treap_query( gaddr, wksp, pinfo );
375 15005742 : if( FD_UNLIKELY( i<part_max ) ) fd_wksp_private_free( i, wksp, pinfo ); /* logs details */
376 :
377 15005742 : fd_wksp_private_unlock( wksp );
378 :
379 15005742 : if( FD_UNLIKELY( i>=part_max && i!=FD_WKSP_PRIVATE_PINFO_IDX_NULL ) ) {
380 0 : FD_LOG_WARNING(( "gaddr does not appear to be a current wksp allocation" ));
381 0 : }
382 15005742 : }
383 :
384 : ulong
385 : fd_wksp_tag( fd_wksp_t * wksp,
386 15384687 : ulong gaddr ) {
387 15384687 : if( FD_UNLIKELY( !wksp ) ) return 0UL;
388 :
389 15384684 : ulong part_max = wksp->part_max;
390 15384684 : fd_wksp_private_pinfo_t * pinfo = fd_wksp_private_pinfo( wksp );
391 :
392 15384684 : if( FD_UNLIKELY( fd_wksp_private_lock( wksp ) ) ) return 0UL; /* logs details */
393 :
394 15384684 : ulong i = fd_wksp_private_used_treap_query( gaddr, wksp, pinfo );
395 15384684 : ulong tag = FD_LIKELY( i<part_max ) ? pinfo[ i ].tag : 0UL;
396 :
397 15384684 : fd_wksp_private_unlock( wksp );
398 :
399 15384684 : return tag;
400 15384684 : }
401 :
402 : ulong
403 : fd_wksp_tag_query( fd_wksp_t * wksp,
404 : ulong const * tag,
405 : ulong tag_cnt,
406 : fd_wksp_tag_query_info_t * info,
407 195 : ulong info_max ) {
408 :
409 195 : if( FD_UNLIKELY( !tag_cnt ) ) return 0UL; /* No tags to query */
410 :
411 159 : if( FD_UNLIKELY( !wksp ) ) { FD_LOG_WARNING(( "NULL wksp" )); return 0UL; }
412 156 : if( FD_UNLIKELY( !tag ) ) { FD_LOG_WARNING(( "bad tag" )); return 0UL; }
413 :
414 153 : if( FD_UNLIKELY( (!!info_max) & (!info) ) ) { FD_LOG_WARNING(( "NULL info" )); return 0UL; }
415 :
416 150 : ulong part_max = wksp->part_max;
417 150 : fd_wksp_private_pinfo_t * pinfo = fd_wksp_private_pinfo( wksp );
418 :
419 150 : ulong info_cnt = 0UL;
420 :
421 150 : if( FD_UNLIKELY( fd_wksp_private_lock( wksp ) ) ) return 0UL; /* logs details */
422 :
423 150 : ulong cycle_tag = wksp->cycle_tag++;
424 :
425 150 : ulong i = fd_wksp_private_pinfo_idx( wksp->part_head_cidx );
426 6024 : while( !fd_wksp_private_pinfo_idx_is_null( i ) ) {
427 5874 : if( FD_UNLIKELY( i>=part_max ) || FD_UNLIKELY( pinfo[ i ].cycle_tag==cycle_tag ) ) {
428 0 : fd_wksp_private_unlock( wksp );
429 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
430 0 : return 0UL;
431 0 : }
432 5874 : pinfo[ i ].cycle_tag = cycle_tag; /* mark i as visited */
433 :
434 5874 : ulong _tag = pinfo[ i ].tag;
435 14070 : for( ulong tag_idx=0UL; tag_idx<tag_cnt; tag_idx++ ) { /* TODO: USE BETTER MATCHER */
436 9087 : if( tag[ tag_idx ]==_tag ) {
437 891 : if( FD_LIKELY( info_cnt<info_max ) ) {
438 12 : info[ info_cnt ].gaddr_lo = pinfo[ i ].gaddr_lo;
439 12 : info[ info_cnt ].gaddr_hi = pinfo[ i ].gaddr_hi;
440 12 : info[ info_cnt ].tag = pinfo[ i ].tag;
441 12 : }
442 891 : info_cnt++;
443 891 : break;
444 891 : }
445 9087 : }
446 :
447 5874 : i = fd_wksp_private_pinfo_idx( pinfo[ i ].next_cidx );
448 5874 : }
449 :
450 150 : fd_wksp_private_unlock( wksp );
451 150 : return info_cnt;
452 150 : }
453 :
454 : void
455 : fd_wksp_tag_free( fd_wksp_t * wksp,
456 : ulong const * tag,
457 135 : ulong tag_cnt ) {
458 135 : if( FD_UNLIKELY( !tag_cnt ) ) return; /* No tags to free */
459 :
460 114 : if( FD_UNLIKELY( !wksp ) ) { FD_LOG_WARNING(( "NULL wksp" )); return; }
461 111 : if( FD_UNLIKELY( !tag ) ) { FD_LOG_WARNING(( "bad tag" )); return; }
462 :
463 108 : ulong part_max = wksp->part_max;
464 108 : fd_wksp_private_pinfo_t * pinfo = fd_wksp_private_pinfo( wksp );
465 :
466 108 : if( FD_UNLIKELY( fd_wksp_private_lock( wksp ) ) ) return; /* logs details */
467 :
468 : /* Push matching used partitions onto a stack */
469 :
470 108 : ulong top = FD_WKSP_PRIVATE_PINFO_IDX_NULL;
471 :
472 108 : ulong cycle_tag = wksp->cycle_tag++;
473 :
474 108 : ulong i = fd_wksp_private_pinfo_idx( wksp->part_head_cidx );
475 3798 : while( !fd_wksp_private_pinfo_idx_is_null( i ) ) {
476 3690 : if( FD_UNLIKELY( i>=part_max ) || FD_UNLIKELY( pinfo[ i ].cycle_tag==cycle_tag ) ) {
477 0 : fd_wksp_private_unlock( wksp );
478 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
479 0 : return;
480 0 : }
481 3690 : pinfo[ i ].cycle_tag = cycle_tag; /* mark i as visited */
482 :
483 3690 : ulong _tag = pinfo[ i ].tag;
484 3690 : if( _tag ) { /* TODO: use a more efficient matcher */
485 4356 : ulong tag_idx; for( tag_idx=0UL; tag_idx<tag_cnt; tag_idx++ ) if( tag[ tag_idx ]==_tag ) break;
486 2103 : if( tag_idx<tag_cnt ) {
487 882 : pinfo[ i ].stack_cidx = fd_wksp_private_pinfo_cidx( top );
488 882 : top = i;
489 882 : }
490 2103 : }
491 3690 : i = fd_wksp_private_pinfo_idx( pinfo[ i ].next_cidx );
492 3690 : }
493 :
494 : /* Free partitions on the stack */
495 :
496 990 : while( !fd_wksp_private_pinfo_idx_is_null( top ) ) {
497 882 : i = top;
498 882 : top = fd_wksp_private_pinfo_idx( pinfo[ i ].stack_cidx );
499 882 : fd_wksp_private_free( i, wksp, pinfo );
500 882 : }
501 :
502 108 : fd_wksp_private_unlock( wksp );
503 108 : }
504 :
505 : void
506 : fd_wksp_memset( fd_wksp_t * wksp,
507 : ulong gaddr,
508 14797020 : int c ) {
509 14797020 : if( FD_UNLIKELY( !wksp ) ) { FD_LOG_WARNING(( "NULL wksp" )); return; }
510 :
511 14797017 : ulong part_max = wksp->part_max;
512 14797017 : fd_wksp_private_pinfo_t * pinfo = fd_wksp_private_pinfo( wksp );
513 :
514 14797017 : int err;
515 :
516 14797017 : if( FD_UNLIKELY( fd_wksp_private_lock( wksp ) ) ) return; /* logs details */
517 :
518 14797017 : ulong i = fd_wksp_private_used_treap_query( gaddr, wksp, pinfo );
519 14797017 : if( FD_UNLIKELY( i>=part_max ) ) err = 1;
520 14797005 : else {
521 14797005 : fd_memset( fd_wksp_laddr_fast( wksp, pinfo[ i ].gaddr_lo ), c, fd_wksp_private_pinfo_sz( pinfo + i ) );
522 14797005 : err = 0;
523 14797005 : }
524 :
525 14797017 : fd_wksp_private_unlock( wksp );
526 :
527 14797017 : if( FD_UNLIKELY( err ) ) FD_LOG_WARNING(( "gaddr does not seem to point to a current wksp allocation" ));
528 14797017 : }
529 :
530 : void
531 : fd_wksp_reset( fd_wksp_t * wksp,
532 168 : uint seed ) {
533 168 : if( FD_UNLIKELY( !wksp ) ) { FD_LOG_WARNING(( "NULL wksp" )); return; }
534 :
535 : # if FD_HAS_DEEPASAN
536 : fd_wksp_private_asan_poison_data( wksp );
537 : # endif
538 :
539 165 : ulong part_max = wksp->part_max;
540 165 : fd_wksp_private_pinfo_t * pinfo = fd_wksp_private_pinfo( wksp );
541 :
542 165 : if( FD_UNLIKELY( fd_wksp_private_lock( wksp ) ) ) return; /* logs details */
543 :
544 3932643 : for( ulong i=0; i<part_max; i++ ) pinfo[ i ].tag = 0UL;
545 165 : int err = fd_wksp_rebuild( wksp, seed );
546 :
547 165 : fd_wksp_private_unlock( wksp );
548 :
549 165 : if( FD_UNLIKELY( err ) ) FD_LOG_WARNING(( "corrupt wksp detected" ));
550 165 : }
551 :
552 : fd_wksp_usage_t *
553 : fd_wksp_usage( fd_wksp_t * wksp,
554 : ulong const * tag,
555 : ulong tag_cnt,
556 645 : fd_wksp_usage_t * usage ) {
557 :
558 : /* Check input args */
559 :
560 645 : if( FD_UNLIKELY( !usage ) ) { FD_LOG_WARNING(( "bad usage" )); return usage; }
561 :
562 642 : fd_memset( usage, 0, sizeof(fd_wksp_usage_t) );
563 :
564 642 : if( FD_UNLIKELY( !wksp ) ) { FD_LOG_WARNING(( "bad wksp" )); return usage; }
565 639 : if( FD_UNLIKELY( (!tag) & (!!tag_cnt) ) ) { FD_LOG_WARNING(( "bad tag" )); return usage; }
566 :
567 636 : ulong part_max = wksp->part_max;
568 636 : fd_wksp_private_pinfo_t * pinfo = fd_wksp_private_pinfo( wksp );
569 :
570 636 : if( FD_UNLIKELY( fd_wksp_private_lock( wksp ) ) ) { FD_LOG_WARNING(( "fd_wksp_private_lock failed" )); return usage; }
571 :
572 : /* Push matching used partitions onto a stack */
573 :
574 636 : usage->total_max = part_max;
575 :
576 636 : ulong cycle_tag = wksp->cycle_tag++;
577 :
578 636 : ulong i = fd_wksp_private_pinfo_idx( wksp->part_head_cidx );
579 42321 : while( !fd_wksp_private_pinfo_idx_is_null( i ) ) {
580 41685 : if( FD_UNLIKELY( i>=part_max ) || FD_UNLIKELY( pinfo[ i ].cycle_tag==cycle_tag ) ) {
581 0 : fd_wksp_private_unlock( wksp );
582 0 : FD_LOG_WARNING(( "corrupt wksp detected" ));
583 0 : fd_memset( usage, 0, sizeof(fd_wksp_usage_t) );
584 0 : return usage;
585 0 : }
586 41685 : pinfo[ i ].cycle_tag = cycle_tag; /* mark i as visited */
587 :
588 41685 : ulong part_sz = fd_wksp_private_pinfo_sz( pinfo + i );
589 41685 : ulong part_tag = pinfo[ i ].tag;
590 :
591 : /* TODO: use a more efficient matcher */
592 123207 : ulong tag_idx; for( tag_idx=0UL; tag_idx<tag_cnt; tag_idx++ ) if( tag[ tag_idx ]==part_tag ) break;
593 :
594 41685 : int is_free = !part_tag;
595 41685 : int is_used = tag_idx<tag_cnt;
596 :
597 41685 : usage->total_cnt += 1UL; usage->total_sz += part_sz;
598 41685 : usage->free_cnt += (ulong)is_free; usage->free_sz += fd_ulong_if( is_free, part_sz, 0UL );
599 41685 : usage->used_cnt += (ulong)is_used; usage->used_sz += fd_ulong_if( is_used, part_sz, 0UL );
600 :
601 41685 : i = fd_wksp_private_pinfo_idx( pinfo[ i ].next_cidx );
602 41685 : }
603 :
604 636 : fd_wksp_private_unlock( wksp );
605 636 : return usage;
606 636 : }
|
