Line data Source code
1 : #include "fd_topo.h"
2 :
3 : #include "../metrics/fd_metrics.h"
4 : #include "../../util/pod/fd_pod_format.h"
5 : #include "../../util/wksp/fd_wksp_private.h"
6 : #include "../../util/shmem/fd_shmem_private.h"
7 :
8 : #include <stdio.h>
9 : #include <errno.h>
10 : #include <unistd.h>
11 : #include <sys/stat.h>
12 :
13 : void *
14 : fd_topo_obj_laddr( fd_topo_t const * topo,
15 1806 : ulong obj_id ) {
16 1806 : fd_topo_obj_t const * obj = &topo->objs[ obj_id ];
17 1806 : if( FD_UNLIKELY( obj_id==ULONG_MAX ) ) FD_LOG_CRIT(( "invalid obj_id ULONG_MAX" ));
18 1806 : if( FD_UNLIKELY( obj_id>=FD_TOPO_MAX_OBJS ) ) FD_LOG_CRIT(( "invalid obj_id %lu", obj_id ));
19 1806 : FD_TEST( obj->id == obj_id );
20 1806 : FD_TEST( obj->offset );
21 1806 : return (void *)((ulong)topo->workspaces[ obj->wksp_id ].wksp + obj->offset);
22 1806 : }
23 :
24 : void
25 : fd_topo_join_workspace( fd_topo_t * topo,
26 : fd_topo_wksp_t * wksp,
27 0 : int mode ) {
28 0 : char name[ PATH_MAX ];
29 0 : FD_TEST( fd_cstr_printf_check( name, PATH_MAX, NULL, "%s_%s.wksp", topo->app_name, wksp->name ) );
30 :
31 0 : wksp->wksp = fd_wksp_join( fd_shmem_join( name, mode, NULL, NULL, NULL ) );
32 0 : if( FD_UNLIKELY( !wksp->wksp ) ) FD_LOG_ERR(( "fd_wksp_join failed" ));
33 0 : }
34 :
35 : FD_FN_PURE static int
36 336 : tile_needs_wksp( fd_topo_t const * topo, fd_topo_tile_t const * tile, ulong wksp_id ) {
37 336 : int mode = -1;
38 11184 : for( ulong i=0UL; i<tile->uses_obj_cnt; i++ ) {
39 10848 : if( FD_UNLIKELY( topo->objs[ tile->uses_obj_id[ i ] ].wksp_id==wksp_id ) ) {
40 192 : mode = fd_int_max( mode, tile->uses_obj_mode[ i ] );
41 192 : }
42 10848 : }
43 336 : return mode;
44 336 : }
45 :
46 : void
47 : fd_topo_join_tile_workspaces( fd_topo_t * topo,
48 0 : fd_topo_tile_t * tile ) {
49 0 : for( ulong i=0UL; i<topo->wksp_cnt; i++ ) {
50 0 : int needs_wksp = tile_needs_wksp( topo, tile, i );
51 0 : if( FD_LIKELY( -1!=needs_wksp ) ) {
52 0 : fd_topo_join_workspace( topo, &topo->workspaces[ i ], needs_wksp );
53 0 : }
54 0 : }
55 0 : }
56 :
57 : void
58 : fd_topo_join_workspaces( fd_topo_t * topo,
59 0 : int mode ) {
60 0 : for( ulong i=0UL; i<topo->wksp_cnt; i++ ) {
61 0 : fd_topo_join_workspace( topo, &topo->workspaces[ i ], mode );
62 0 : }
63 0 : }
64 :
65 : void
66 : fd_topo_leave_workspace( fd_topo_t * topo FD_PARAM_UNUSED,
67 0 : fd_topo_wksp_t * wksp ) {
68 0 : if( FD_LIKELY( wksp->wksp ) ) {
69 0 : if( FD_UNLIKELY( fd_wksp_detach( wksp->wksp ) ) ) FD_LOG_ERR(( "fd_wksp_detach failed" ));
70 0 : wksp->wksp = NULL;
71 0 : wksp->known_footprint = 0UL;
72 0 : wksp->total_footprint = 0UL;
73 0 : }
74 0 : }
75 :
76 : void
77 0 : fd_topo_leave_workspaces( fd_topo_t * topo ) {
78 0 : for( ulong i=0UL; i<topo->wksp_cnt; i++ ) {
79 0 : fd_topo_leave_workspace( topo, &topo->workspaces[ i ] );
80 0 : }
81 0 : }
82 :
83 : extern char fd_shmem_private_base[ FD_SHMEM_PRIVATE_BASE_MAX ];
84 :
85 : int
86 : fd_topo_create_workspace( fd_topo_t * topo,
87 : fd_topo_wksp_t * wksp,
88 0 : int update_existing ) {
89 0 : char name[ PATH_MAX ];
90 0 : FD_TEST( fd_cstr_printf_check( name, PATH_MAX, NULL, "%s_%s.wksp", topo->app_name, wksp->name ) );
91 :
92 0 : ulong sub_page_cnt[ 1 ] = { wksp->page_cnt };
93 0 : ulong sub_cpu_idx [ 1 ] = { fd_shmem_cpu_idx( wksp->numa_idx ) };
94 :
95 0 : int err;
96 0 : if( FD_UNLIKELY( update_existing ) ) {
97 0 : err = fd_shmem_update_multi( name, wksp->page_sz, 1, sub_page_cnt, sub_cpu_idx, S_IRUSR | S_IWUSR ); /* logs details */
98 0 : } else {
99 0 : err = fd_shmem_create_multi( name, wksp->page_sz, 1, sub_page_cnt, sub_cpu_idx, S_IRUSR | S_IWUSR ); /* logs details */
100 0 : }
101 0 : if( FD_UNLIKELY( err && errno==ENOMEM ) ) return -1;
102 0 : else if( FD_UNLIKELY( err ) ) FD_LOG_ERR(( "fd_shmem_create_multi failed" ));
103 :
104 0 : void * shmem = fd_shmem_join( name, FD_SHMEM_JOIN_MODE_READ_WRITE, NULL, NULL, NULL ); /* logs details */
105 :
106 0 : void * wkspmem = fd_wksp_new( shmem, name, 0U, wksp->part_max, wksp->total_footprint ); /* logs details */
107 0 : if( FD_UNLIKELY( !wkspmem ) ) FD_LOG_ERR(( "fd_wksp_new failed" ));
108 :
109 0 : fd_wksp_t * join = fd_wksp_join( wkspmem );
110 0 : if( FD_UNLIKELY( !join ) ) FD_LOG_ERR(( "fd_wksp_join failed" ));
111 :
112 : /* Footprint has been predetermined so that this alloc() call must
113 : succeed inside the data region. The difference between total_footprint
114 : and known_footprint is given to "loose" data, that may be dynamically
115 : allocated out of the workspace at runtime. */
116 0 : if( FD_LIKELY( wksp->known_footprint ) ) {
117 0 : ulong offset = fd_wksp_alloc( join, fd_topo_workspace_align(), wksp->known_footprint, 1UL );
118 0 : if( FD_UNLIKELY( !offset ) ) FD_LOG_ERR(( "fd_wksp_alloc failed" ));
119 :
120 : /* gaddr_lo is the start of the workspace data region that can be
121 : given out in response to wksp alloc requests. We rely on an
122 : implicit assumption everywhere that the bytes we are given by
123 : this single allocation will be at gaddr_lo, so that we can find
124 : them, so we verify this here for paranoia in case the workspace
125 : alloc implementation changes. */
126 0 : if( FD_UNLIKELY( fd_ulong_align_up( ((struct fd_wksp_private*)join)->gaddr_lo, fd_topo_workspace_align() ) != offset ) )
127 0 : FD_LOG_ERR(( "wksp gaddr_lo %lu != offset %lu", fd_ulong_align_up( ((struct fd_wksp_private*)join)->gaddr_lo, fd_topo_workspace_align() ), offset ));
128 0 : }
129 :
130 0 : fd_wksp_leave( join );
131 :
132 0 : if( FD_UNLIKELY( fd_shmem_leave( shmem, NULL, NULL ) ) ) /* logs details */
133 0 : FD_LOG_ERR(( "fd_shmem_leave failed" ));
134 :
135 0 : return 0;
136 0 : }
137 :
138 : void
139 : fd_topo_wksp_new( fd_topo_t const * topo,
140 : fd_topo_wksp_t const * wksp,
141 57 : fd_topo_obj_callbacks_t ** callbacks ) {
142 14784 : for( ulong i=0UL; i<topo->obj_cnt; i++ ) {
143 14727 : fd_topo_obj_t const * obj = &topo->objs[ i ];
144 14727 : if( FD_LIKELY( obj->wksp_id!=wksp->id ) ) continue;
145 :
146 2577 : for( ulong j=0UL; callbacks[ j ]; j++ ) {
147 2577 : if( FD_LIKELY( strcmp( callbacks[ j ]->name, obj->name ) ) ) continue;
148 :
149 837 : long ts = -fd_log_wallclock();
150 837 : if( FD_LIKELY( callbacks[ j ]->new ) ) callbacks[ j ]->new( topo, obj );
151 837 : long elapsed = fd_log_wallclock() + ts;
152 837 : if( FD_UNLIKELY( elapsed>(1000L*1000L*100L ) ) ) FD_LOG_WARNING(( "fd_topo_wksp_new(%s) took %ld ms", obj->name, elapsed/(1000L*1000L) ));
153 837 : else if( FD_UNLIKELY( elapsed>(1000L*1000L*5L ) ) ) FD_LOG_INFO(( "fd_topo_wksp_new(%s) took %ld ms", obj->name, elapsed/(1000L*1000L) ));
154 837 : break;
155 2577 : }
156 837 : }
157 57 : }
158 :
159 : void
160 : fd_topo_workspace_fill( fd_topo_t * topo,
161 57 : fd_topo_wksp_t * wksp ) {
162 2874 : for( ulong i=0UL; i<topo->link_cnt; i++ ) {
163 2817 : fd_topo_link_t * link = &topo->links[ i ];
164 :
165 2817 : if( FD_UNLIKELY( topo->objs[ link->mcache_obj_id ].wksp_id!=wksp->id ) ) continue;
166 75 : link->mcache = fd_mcache_join( fd_topo_obj_laddr( topo, link->mcache_obj_id ) );
167 75 : FD_TEST( link->mcache );
168 :
169 75 : if( link->mtu ) {
170 72 : if( FD_UNLIKELY( topo->objs[ link->dcache_obj_id ].wksp_id!=wksp->id ) ) continue;
171 72 : link->dcache = fd_dcache_join( fd_topo_obj_laddr( topo, link->dcache_obj_id ) );
172 72 : FD_TEST( link->dcache );
173 72 : }
174 75 : }
175 :
176 1755 : for( ulong i=0UL; i<topo->tile_cnt; i++ ) {
177 1698 : fd_topo_tile_t * tile = &topo->tiles[ i ];
178 :
179 1698 : if( FD_LIKELY( topo->objs[ tile->metrics_obj_id ].wksp_id==wksp->id ) ) {
180 177 : tile->metrics = fd_metrics_join( fd_topo_obj_laddr( topo, tile->metrics_obj_id ) );
181 177 : FD_TEST( tile->metrics );
182 177 : }
183 :
184 6441 : for( ulong j=0UL; j<tile->in_cnt; j++ ) {
185 4743 : if( FD_UNLIKELY( topo->objs[ tile->in_link_fseq_obj_id[ j ] ].wksp_id!=wksp->id ) ) continue;
186 492 : tile->in_link_fseq[ j ] = fd_fseq_join( fd_topo_obj_laddr( topo, tile->in_link_fseq_obj_id[ j ] ) );
187 492 : FD_TEST( tile->in_link_fseq[ j ] );
188 492 : }
189 1698 : }
190 57 : }
191 :
192 : void
193 : fd_topo_fill_tile( fd_topo_t * topo,
194 6 : fd_topo_tile_t * tile ) {
195 342 : for( ulong i=0UL; i<topo->wksp_cnt; i++ ) {
196 336 : if( FD_UNLIKELY( -1!=tile_needs_wksp( topo, tile, i ) ) )
197 57 : fd_topo_workspace_fill( topo, &topo->workspaces[ i ] );
198 336 : }
199 6 : }
200 :
201 : void
202 0 : fd_topo_fill( fd_topo_t * topo ) {
203 0 : for( ulong i=0UL; i<topo->wksp_cnt; i++ ) {
204 0 : fd_topo_workspace_fill( topo, &topo->workspaces[ i ] );
205 0 : }
206 0 : }
207 :
208 : FD_FN_CONST static ulong
209 0 : fd_topo_tile_extra_huge_pages( fd_topo_tile_t const * tile ) {
210 : /* Every tile maps an additional set of pages for the stack. */
211 0 : (void)tile;
212 0 : return (FD_TILE_PRIVATE_STACK_SZ/FD_SHMEM_HUGE_PAGE_SZ)+2UL;
213 0 : }
214 :
215 : FD_FN_PURE static ulong
216 0 : fd_topo_tile_extra_normal_pages( fd_topo_tile_t const * tile ) {
217 0 : ulong key_pages = 0UL;
218 0 : if( FD_UNLIKELY( tile->keyswitch_obj_id ) ) {
219 : /* Certain tiles using fd_keyload_load need normal pages to hold
220 : key material. */
221 0 : key_pages = 5UL;
222 0 : }
223 :
224 : /* All tiles lock one normal page for the fd_log shared lock. */
225 0 : return key_pages+1UL;
226 0 : }
227 :
228 : FD_FN_PURE static ulong
229 : fd_topo_mlock_max_tile1( fd_topo_t const * topo,
230 0 : fd_topo_tile_t const * tile ) {
231 0 : ulong tile_mem = 0UL;
232 :
233 0 : for( ulong i=0UL; i<topo->wksp_cnt; i++ ) {
234 0 : if( FD_UNLIKELY( -1!=tile_needs_wksp( topo, tile, i ) ) )
235 0 : tile_mem += topo->workspaces[ i ].page_cnt * topo->workspaces[ i ].page_sz;
236 0 : }
237 :
238 0 : return tile_mem +
239 0 : fd_topo_tile_extra_huge_pages( tile ) * FD_SHMEM_HUGE_PAGE_SZ +
240 0 : fd_topo_tile_extra_normal_pages( tile ) * FD_SHMEM_NORMAL_PAGE_SZ;
241 0 : }
242 :
243 : FD_FN_PURE ulong
244 0 : fd_topo_mlock_max_tile( fd_topo_t const * topo ) {
245 0 : ulong highest_tile_mem = 0UL;
246 0 : for( ulong i=0UL; i<topo->tile_cnt; i++ ) {
247 0 : fd_topo_tile_t const * tile = &topo->tiles[ i ];
248 0 : highest_tile_mem = fd_ulong_max( highest_tile_mem, fd_topo_mlock_max_tile1( topo, tile ) );
249 0 : }
250 :
251 0 : return highest_tile_mem;
252 0 : }
253 :
254 : FD_FN_PURE ulong
255 : fd_topo_gigantic_page_cnt( fd_topo_t const * topo,
256 0 : ulong numa_idx ) {
257 0 : ulong result = 0UL;
258 0 : for( ulong i=0UL; i<topo->wksp_cnt; i++ ) {
259 0 : fd_topo_wksp_t const * wksp = &topo->workspaces[ i ];
260 0 : if( FD_LIKELY( wksp->numa_idx!=numa_idx ) ) continue;
261 :
262 0 : if( FD_LIKELY( wksp->page_sz==FD_SHMEM_GIGANTIC_PAGE_SZ ) ) {
263 0 : result += wksp->page_cnt;
264 0 : }
265 0 : }
266 0 : return result;
267 0 : }
268 :
269 : FD_FN_PURE ulong
270 : fd_topo_huge_page_cnt( fd_topo_t const * topo,
271 : ulong numa_idx,
272 0 : int include_anonymous ) {
273 0 : ulong result = 0UL;
274 0 : for( ulong i=0UL; i<topo->wksp_cnt; i++ ) {
275 0 : fd_topo_wksp_t const * wksp = &topo->workspaces[ i ];
276 0 : if( FD_LIKELY( wksp->numa_idx!=numa_idx ) ) continue;
277 :
278 0 : if( FD_LIKELY( wksp->page_sz==FD_SHMEM_HUGE_PAGE_SZ ) ) {
279 0 : result += wksp->page_cnt;
280 0 : }
281 0 : }
282 :
283 : /* The stack huge pages are also placed in the hugetlbfs. */
284 0 : for( ulong i=0UL; i<topo->tile_cnt; i++ ) {
285 0 : result += fd_topo_tile_extra_huge_pages( &topo->tiles[ i ] );
286 0 : }
287 :
288 : /* No anonymous huge pages in use yet. */
289 0 : (void)include_anonymous;
290 :
291 0 : return result;
292 0 : }
293 :
294 : FD_FN_PURE ulong
295 0 : fd_topo_normal_page_cnt( fd_topo_t * topo ) {
296 0 : ulong result = 0UL;
297 0 : for( ulong i=0UL; i<topo->tile_cnt; i++ ) {
298 0 : result += fd_topo_tile_extra_normal_pages( &topo->tiles[ i ] );
299 0 : }
300 0 : return result;
301 0 : }
302 :
303 : FD_FN_PURE ulong
304 0 : fd_topo_mlock( fd_topo_t const * topo ) {
305 0 : ulong result = 0UL;
306 0 : for( ulong i=0UL; i<topo->wksp_cnt; i++ ) {
307 0 : result += topo->workspaces[ i ].page_cnt * topo->workspaces[ i ].page_sz;
308 0 : }
309 0 : return result;
310 0 : }
311 :
312 : static void
313 0 : fd_topo_mem_sz_string( ulong sz, char out[static 24] ) {
314 0 : if( FD_LIKELY( sz >= FD_SHMEM_GIGANTIC_PAGE_SZ ) ) {
315 0 : FD_TEST( fd_cstr_printf_check( out, 24, NULL, "%lu GiB", sz / (1 << 30) ) );
316 0 : } else if( FD_LIKELY( sz >= 1048576 ) ) {
317 0 : FD_TEST( fd_cstr_printf_check( out, 24, NULL, "%lu MiB", sz / (1 << 20) ) );
318 0 : } else if( FD_LIKELY( sz >= 1024 ) ) {
319 0 : FD_TEST( fd_cstr_printf_check( out, 24, NULL, "%lu KiB", sz / (1 << 10) ) );
320 0 : } else {
321 0 : FD_TEST( fd_cstr_printf_check( out, 24, NULL, "%lu B", sz ) );
322 0 : }
323 0 : }
324 :
325 : void
326 : fd_topo_print_log( int stdout,
327 0 : fd_topo_t * topo ) {
328 0 : char message[ 32UL*4096UL ] = {0}; /* Same as FD_LOG_BUF_SZ */
329 :
330 0 : char * cur = message;
331 0 : ulong remaining = sizeof(message) - 1; /* Leave one character at the end to ensure NUL terminated */
332 :
333 0 : #define PRINT( ... ) do { \
334 0 : int n = snprintf( cur, remaining, __VA_ARGS__ ); \
335 0 : if( FD_UNLIKELY( n < 0 ) ) FD_LOG_ERR(( "snprintf failed" )); \
336 0 : if( FD_UNLIKELY( (ulong)n >= remaining ) ) FD_LOG_ERR(( "snprintf overflow" )); \
337 0 : remaining -= (ulong)n; \
338 0 : cur += n; \
339 0 : } while( 0 )
340 :
341 0 : PRINT( "\nSUMMARY\n" );
342 :
343 : /* The logic to compute number of stack pages is taken from
344 : fd_tile_thread.cxx, in function fd_topo_tile_stack_join, and this
345 : should match that. */
346 0 : ulong stack_pages = topo->tile_cnt * FD_SHMEM_HUGE_PAGE_SZ * ((FD_TILE_PRIVATE_STACK_SZ/FD_SHMEM_HUGE_PAGE_SZ)+2UL);
347 :
348 : /* The logic to map these private pages into memory is in utility.c,
349 : under fd_keyload_load, and the amount of pages should be kept in
350 : sync. */
351 0 : ulong private_key_pages = 5UL * FD_SHMEM_NORMAL_PAGE_SZ;
352 0 : ulong total_bytes = fd_topo_mlock( topo ) + stack_pages + private_key_pages;
353 :
354 0 : PRINT(" %23s: %lu\n", "Total Tiles", topo->tile_cnt );
355 0 : PRINT(" %23s: %lu bytes (%lu GiB + %lu MiB + %lu KiB)\n",
356 0 : "Total Memory Locked",
357 0 : total_bytes,
358 0 : total_bytes / (1 << 30),
359 0 : (total_bytes % (1 << 30)) / (1 << 20),
360 0 : (total_bytes % (1 << 20)) / (1 << 10) );
361 :
362 0 : ulong required_gigantic_pages = 0UL;
363 0 : ulong required_huge_pages = 0UL;
364 :
365 0 : ulong numa_node_cnt = fd_shmem_numa_cnt();
366 0 : for( ulong i=0UL; i<numa_node_cnt; i++ ) {
367 0 : required_gigantic_pages += fd_topo_gigantic_page_cnt( topo, i );
368 0 : required_huge_pages += fd_topo_huge_page_cnt( topo, i, 0 );
369 0 : }
370 0 : PRINT(" %23s: %lu\n", "Required Gigantic Pages", required_gigantic_pages );
371 0 : PRINT(" %23s: %lu\n", "Required Huge Pages", required_huge_pages );
372 0 : PRINT(" %23s: %lu\n", "Required Normal Pages", fd_topo_normal_page_cnt( topo ) );
373 0 : for( ulong i=0UL; i<numa_node_cnt; i++ ) {
374 0 : PRINT(" %23s (NUMA node %lu): %lu\n", "Required Gigantic Pages", i, fd_topo_gigantic_page_cnt( topo, i ) );
375 0 : PRINT(" %23s (NUMA node %lu): %lu\n", "Required Huge Pages", i, fd_topo_huge_page_cnt( topo, i, 0 ) );
376 0 : }
377 :
378 0 : if( FD_UNLIKELY( topo->agave_affinity_cnt>0UL ) ) {
379 0 : char agave_affinity[4096];
380 0 : ulong offset = 0UL;
381 0 : for ( ulong i = 0UL; i < topo->agave_affinity_cnt; i++ ) {
382 0 : ulong sz;
383 0 : if( FD_LIKELY( i != 0UL )) FD_TEST( fd_cstr_printf_check( agave_affinity+offset, 4096-offset, &sz, ", %lu", topo->agave_affinity_cpu_idx[ i ] ) );
384 0 : else FD_TEST( fd_cstr_printf_check( agave_affinity+offset, 4096-offset, &sz, "%lu", topo->agave_affinity_cpu_idx[ i ] ) );
385 0 : offset += sz;
386 0 : }
387 0 : PRINT( " %23s: %s\n", "Agave Affinity", agave_affinity );
388 0 : }
389 :
390 0 : PRINT( "\nWORKSPACES\n");
391 0 : for( ulong i=0UL; i<topo->wksp_cnt; i++ ) {
392 0 : fd_topo_wksp_t * wksp = &topo->workspaces[ i ];
393 :
394 0 : char size[ 24 ];
395 0 : fd_topo_mem_sz_string( wksp->page_sz * wksp->page_cnt, size );
396 0 : PRINT( " %2lu (%7s): %12s page_cnt=%3lu page_sz=%-8s numa_idx=%-2lu footprint=%10lu loose=%10lu\n", i, size, wksp->name, wksp->page_cnt, fd_shmem_page_sz_to_cstr( wksp->page_sz ), wksp->numa_idx, wksp->known_footprint, wksp->total_footprint - wksp->known_footprint );
397 0 : }
398 :
399 0 : PRINT( "\nOBJECTS\n" );
400 0 : for( ulong i=0UL; i<topo->obj_cnt; i++ ) {
401 0 : fd_topo_obj_t * obj = &topo->objs[ i ];
402 :
403 0 : char size[ 24 ];
404 0 : fd_topo_mem_sz_string( obj->footprint, size );
405 0 : PRINT( " %3lu: %12s %12s wksp_id=%-2lu footprint=%7s offset=%lu",
406 0 : i, topo->workspaces[ obj->wksp_id ].name, obj->name,
407 0 : obj->wksp_id, size, obj->offset );
408 0 : for( fd_pod_iter_t iter=fd_pod_iter_init( fd_pod_queryf_subpod( topo->props, "obj.%lu", obj->id ) );
409 0 : !fd_pod_iter_done( iter );
410 0 : iter=fd_pod_iter_next( iter ) ) {
411 0 : fd_pod_info_t info = fd_pod_iter_info( iter );
412 0 : if( !strncmp( info.key, "seed", info.key_sz ) ) continue;
413 0 : PRINT( " %.*s", (int)info.key_sz, info.key );
414 0 : switch( info.val_type ) {
415 0 : case FD_POD_VAL_TYPE_CSTR:
416 0 : PRINT( "=%.*s", (int)info.val_sz, (char const *)info.val );
417 0 : break;
418 0 : case FD_POD_VAL_TYPE_ULONG: {
419 0 : ulong val; fd_ulong_svw_dec( info.val, &val );
420 0 : PRINT( "=%lu", val );
421 0 : break;
422 0 : }
423 0 : }
424 0 : }
425 0 : PRINT( "\n" );
426 0 : }
427 :
428 0 : PRINT( "\nLINKS\n" );
429 0 : for( ulong i=0UL; i<topo->link_cnt; i++ ) {
430 0 : fd_topo_link_t * link = &topo->links[ i ];
431 :
432 0 : char size[ 24 ];
433 0 : fd_topo_mem_sz_string( fd_dcache_req_data_sz( link->mtu, link->depth, link->burst, 1 ), size );
434 0 : PRINT( " %2lu (%7s): %12s kind_id=%-2lu wksp_id=%-2lu depth=%-5lu mtu=%-9lu burst=%lu\n", i, size, link->name, link->kind_id, topo->objs[ link->dcache_obj_id ].wksp_id, link->depth, link->mtu, link->burst );
435 0 : }
436 :
437 0 : #define PRINTIN( ... ) do { \
438 0 : int n = snprintf( cur_in, remaining_in, __VA_ARGS__ ); \
439 0 : if( FD_UNLIKELY( n < 0 ) ) FD_LOG_ERR(( "snprintf failed" )); \
440 0 : if( FD_UNLIKELY( (ulong)n >= remaining_in ) ) FD_LOG_ERR(( "snprintf overflow" )); \
441 0 : remaining_in -= (ulong)n; \
442 0 : cur_in += n; \
443 0 : } while( 0 )
444 :
445 0 : #define PRINTOUT( ... ) do { \
446 0 : int n = snprintf( cur_out, remaining_out, __VA_ARGS__ ); \
447 0 : if( FD_UNLIKELY( n < 0 ) ) FD_LOG_ERR(( "snprintf failed" )); \
448 0 : if( FD_UNLIKELY( (ulong)n >= remaining_out ) ) FD_LOG_ERR(( "snprintf overflow" )); \
449 0 : remaining_out -= (ulong)n; \
450 0 : cur_out += n; \
451 0 : } while( 0 )
452 :
453 0 : PRINT( "\nTILES\n" );
454 0 : for( ulong i=0UL; i<topo->tile_cnt; i++ ) {
455 0 : fd_topo_tile_t * tile = &topo->tiles[ i ];
456 :
457 0 : char in[ 256 ] = {0};
458 0 : char * cur_in = in;
459 0 : ulong remaining_in = sizeof( in ) - 1;
460 :
461 0 : for( ulong j=0UL; j<tile->in_cnt; j++ ) {
462 0 : if( FD_LIKELY( j != 0 ) ) PRINTIN( ", " );
463 0 : if( FD_LIKELY( tile->in_link_reliable[ j ] ) ) PRINTIN( "%2lu", tile->in_link_id[ j ] );
464 0 : else PRINTIN( "%2ld", (long)-tile->in_link_id[ j ] );
465 0 : }
466 :
467 0 : char out[ 256 ] = {0};
468 0 : char * cur_out = out;
469 0 : ulong remaining_out = sizeof( out ) - 1;
470 :
471 0 : for( ulong j=0UL; j<tile->out_cnt; j++ ) {
472 0 : if( FD_LIKELY( j != 0 ) ) PRINTOUT( ", " );
473 0 : PRINTOUT( "%2lu", tile->out_link_id[ j ] );
474 0 : }
475 :
476 : /* Determine tile's NUMA node either based on CPU or wksp affinity */
477 0 : ulong tile_numa = 0UL;
478 0 : if( tile->cpu_idx!=ULONG_MAX ) {
479 0 : tile_numa = fd_shmem_numa_idx( tile->cpu_idx );
480 0 : } else {
481 0 : tile_numa = topo->workspaces[ topo->objs[ tile->tile_obj_id ].wksp_id ].numa_idx;
482 0 : }
483 :
484 0 : char size[ 24 ];
485 0 : fd_topo_mem_sz_string( fd_topo_mlock_max_tile1( topo, tile ), size );
486 0 : PRINT( " %2lu (%7s): %12s kind_id=%-2lu wksp_id=%-2lu cpu_idx=", i, size, tile->name, tile->kind_id, topo->objs[ tile->tile_obj_id ].wksp_id );
487 0 : if( tile->cpu_idx!=ULONG_MAX ) {
488 0 : PRINT( "%3lu", tile->cpu_idx );
489 0 : } else {
490 0 : PRINT( "any" );
491 0 : }
492 :
493 0 : PRINT( " numa_idx=%lu in=[%s] out=[%s] objs=[", tile_numa, in, out );
494 0 : for( ulong j=0UL; j<tile->uses_obj_cnt; j++ ) {
495 0 : if( FD_LIKELY( j!=0 ) ) PRINT( " " );
496 0 : int is_rw = tile->uses_obj_mode[ j ] == FD_SHMEM_JOIN_MODE_READ_WRITE;
497 0 : PRINT( "%lu:%s", tile->uses_obj_id[ j ], is_rw?"rw":"ro" );
498 0 : }
499 0 : PRINT( "]" );
500 :
501 0 : if( FD_LIKELY( i != topo->tile_cnt-1 ) ) PRINT( "\n" );
502 0 : }
503 :
504 0 : if( FD_UNLIKELY( stdout ) ) FD_LOG_STDOUT(( "%s\n", message ));
505 0 : else FD_LOG_INFO(( "%s", message ));
506 0 : }
|
