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