2 * Copyright (c) 2016 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
16 #include <svm/svm_fifo_segment.h>
19 allocate_new_fifo_chunk (svm_fifo_segment_header_t * fsh,
20 u32 data_size_in_bytes, int chunk_size)
25 u32 rounded_data_size;
29 rounded_data_size = (1 << (max_log2 (data_size_in_bytes)));
30 freelist_index = max_log2 (rounded_data_size)
31 - max_log2 (FIFO_SEGMENT_MIN_FIFO_SIZE);
33 /* Calculate space requirement $$$ round-up data_size_in_bytes */
34 size = (sizeof (*f) + rounded_data_size) * chunk_size;
36 /* Allocate fifo space. May fail. */
37 fifo_space = clib_mem_alloc_aligned_at_offset
38 (size, CLIB_CACHE_LINE_BYTES, 0 /* align_offset */ ,
39 0 /* os_out_of_memory */ );
45 /* Carve fifo space */
46 f = (svm_fifo_t *) fifo_space;
47 for (i = 0; i < chunk_size; i++)
49 f->freelist_index = freelist_index;
50 f->next = fsh->free_fifos[freelist_index];
51 fsh->free_fifos[freelist_index] = f;
52 fifo_space += sizeof (*f) + rounded_data_size;
53 f = (svm_fifo_t *) fifo_space;
58 * Pre-allocates fifo pairs in fifo segment
60 * The number of fifos pre-allocated is the minimum of the requested number
61 * of pairs and the maximum number that fit within the segment. If the maximum
62 * is hit, the number of fifo pairs requested is updated by subtracting the
63 * number of fifos that have been successfully allocated.
66 svm_fifo_segment_preallocate_fifo_pairs (svm_fifo_segment_private_t * s,
67 u32 rx_fifo_size, u32 tx_fifo_size,
70 u32 rx_rounded_data_size, tx_rounded_data_size, pair_size;
71 u32 rx_fifos_size, tx_fifos_size, pairs_to_allocate;
72 int rx_freelist_index, tx_freelist_index;
73 ssvm_shared_header_t *sh = s->ssvm.sh;
74 svm_fifo_segment_header_t *fsh = s->h;
75 u8 *rx_fifo_space, *tx_fifo_space;
76 uword space_available;
82 if (rx_fifo_size == 0 || tx_fifo_size == 0 || *n_fifo_pairs == 0)
85 if (rx_fifo_size < FIFO_SEGMENT_MIN_FIFO_SIZE ||
86 rx_fifo_size > FIFO_SEGMENT_MAX_FIFO_SIZE)
88 clib_warning ("rx fifo_size out of range %d", rx_fifo_size);
92 if (tx_fifo_size < FIFO_SEGMENT_MIN_FIFO_SIZE ||
93 tx_fifo_size > FIFO_SEGMENT_MAX_FIFO_SIZE)
95 clib_warning ("tx fifo_size out of range %d", rx_fifo_size);
99 rx_rounded_data_size = (1 << (max_log2 (rx_fifo_size)));
100 rx_freelist_index = max_log2 (rx_fifo_size)
101 - max_log2 (FIFO_SEGMENT_MIN_FIFO_SIZE);
102 tx_rounded_data_size = (1 << (max_log2 (tx_fifo_size)));
103 tx_freelist_index = max_log2 (tx_fifo_size)
104 - max_log2 (FIFO_SEGMENT_MIN_FIFO_SIZE);
106 /* Calculate space requirements */
107 pair_size = 2 * sizeof (*f) + rx_rounded_data_size + tx_rounded_data_size;
108 #if USE_DLMALLOC == 0
109 space_available = s->ssvm.ssvm_size - mheap_bytes (sh->heap);
111 space_available = s->ssvm.ssvm_size - mspace_usable_size (sh->heap);
114 pairs_to_allocate = clib_min (space_available / pair_size, *n_fifo_pairs);
115 rx_fifos_size = (sizeof (*f) + rx_rounded_data_size) * pairs_to_allocate;
116 tx_fifos_size = (sizeof (*f) + tx_rounded_data_size) * pairs_to_allocate;
118 vec_validate_init_empty (fsh->free_fifos,
119 clib_max (rx_freelist_index, tx_freelist_index),
122 oldheap = ssvm_push_heap (sh);
123 /* Allocate rx fifo space. May fail. */
124 rx_fifo_space = clib_mem_alloc_aligned_at_offset
125 (rx_fifos_size, CLIB_CACHE_LINE_BYTES, 0 /* align_offset */ ,
126 0 /* os_out_of_memory */ );
129 tx_fifo_space = clib_mem_alloc_aligned_at_offset
130 (tx_fifos_size, CLIB_CACHE_LINE_BYTES, 0 /* align_offset */ ,
131 0 /* os_out_of_memory */ );
133 /* Make sure it worked. Clean up if it didn't... */
134 if (rx_fifo_space == 0 || tx_fifo_space == 0)
137 clib_mem_free (rx_fifo_space);
139 clib_warning ("rx fifo preallocation failure: size %d npairs %d",
140 rx_fifo_size, *n_fifo_pairs);
143 clib_mem_free (tx_fifo_space);
145 clib_warning ("tx fifo preallocation failure: size %d nfifos %d",
146 tx_fifo_size, *n_fifo_pairs);
147 ssvm_pop_heap (oldheap);
151 /* Carve rx fifo space */
152 f = (svm_fifo_t *) rx_fifo_space;
153 for (i = 0; i < pairs_to_allocate; i++)
155 f->freelist_index = rx_freelist_index;
156 f->next = fsh->free_fifos[rx_freelist_index];
157 fsh->free_fifos[rx_freelist_index] = f;
158 rx_fifo_space += sizeof (*f) + rx_rounded_data_size;
159 f = (svm_fifo_t *) rx_fifo_space;
161 /* Carve tx fifo space */
162 f = (svm_fifo_t *) tx_fifo_space;
163 for (i = 0; i < pairs_to_allocate; i++)
165 f->freelist_index = tx_freelist_index;
166 f->next = fsh->free_fifos[tx_freelist_index];
167 fsh->free_fifos[tx_freelist_index] = f;
168 tx_fifo_space += sizeof (*f) + tx_rounded_data_size;
169 f = (svm_fifo_t *) tx_fifo_space;
172 /* Account for the pairs allocated */
173 *n_fifo_pairs -= pairs_to_allocate;
174 ssvm_pop_heap (oldheap);
178 * Initialize svm fifo segment shared header
181 svm_fifo_segment_init (svm_fifo_segment_private_t * s)
183 svm_fifo_segment_header_t *fsh;
184 ssvm_shared_header_t *sh;
188 oldheap = ssvm_push_heap (sh);
190 fsh = clib_mem_alloc (sizeof (*fsh));
191 clib_memset (fsh, 0, sizeof (*fsh));
192 s->h = sh->opaque[0] = fsh;
194 ssvm_pop_heap (oldheap);
201 * Create an svm fifo segment and initialize as master
204 svm_fifo_segment_create (svm_fifo_segment_main_t * sm,
205 svm_fifo_segment_create_args_t * a)
207 svm_fifo_segment_private_t *s;
210 /* Allocate a fresh segment */
211 pool_get (sm->segments, s);
212 clib_memset (s, 0, sizeof (*s));
214 s->ssvm.ssvm_size = a->segment_size;
215 s->ssvm.i_am_master = 1;
216 s->ssvm.my_pid = getpid ();
217 s->ssvm.name = format (0, "%s%c", a->segment_name, 0);
218 s->ssvm.requested_va = sm->next_baseva;
220 if ((rv = ssvm_master_init (&s->ssvm, a->segment_type)))
222 pool_put (sm->segments, s);
226 /* Note: requested_va updated due to seg base addr randomization */
227 sm->next_baseva = s->ssvm.sh->ssvm_va + a->segment_size;
229 svm_fifo_segment_init (s);
230 vec_add1 (a->new_segment_indices, s - sm->segments);
235 * Create an svm fifo segment in process-private memory
238 svm_fifo_segment_create_process_private (svm_fifo_segment_main_t * sm,
239 svm_fifo_segment_create_args_t * a)
241 svm_fifo_segment_private_t *s;
242 ssvm_shared_header_t *sh;
245 u32 pagesize = clib_mem_get_page_size ();
247 pool_get (sm->segments, s);
248 clib_memset (s, 0, sizeof (*s));
250 rnd_size = (a->segment_size + (pagesize - 1)) & ~pagesize;
252 #if USE_DLMALLOC == 0
253 heap = mheap_alloc (0, rnd_size);
256 clib_unix_warning ("mheap alloc");
257 pool_put (sm->segments, s);
261 mheap_t *heap_header;
262 heap_header = mheap_header (heap);
263 heap_header->flags |= MHEAP_FLAG_THREAD_SAFE;
266 heap = create_mspace (rnd_size, 1 /* locked */ );
269 s->ssvm.ssvm_size = rnd_size;
270 s->ssvm.i_am_master = 1;
271 s->ssvm.my_pid = getpid ();
272 s->ssvm.name = format (0, "%s%c", a->segment_name, 0);
273 s->ssvm.requested_va = ~0;
275 /* Allocate a [sic] shared memory header, in process memory... */
276 sh = clib_mem_alloc_aligned (sizeof (*sh), CLIB_CACHE_LINE_BYTES);
279 clib_memset (sh, 0, sizeof (*sh));
282 svm_fifo_segment_init (s);
283 vec_add1 (a->new_segment_indices, s - sm->segments);
289 * Attach as slave to an svm fifo segment
292 svm_fifo_segment_attach (svm_fifo_segment_main_t * sm,
293 svm_fifo_segment_create_args_t * a)
295 svm_fifo_segment_private_t *s;
298 /* Allocate a fresh segment */
299 pool_get (sm->segments, s);
300 clib_memset (s, 0, sizeof (*s));
302 s->ssvm.ssvm_size = a->segment_size;
303 s->ssvm.my_pid = getpid ();
304 s->ssvm.name = format (0, "%s%c", a->segment_name, 0);
305 s->ssvm.requested_va = sm->next_baseva;
306 if (a->segment_type == SSVM_SEGMENT_MEMFD)
307 s->ssvm.fd = a->memfd_fd;
309 s->ssvm.attach_timeout = sm->timeout_in_seconds;
311 if ((rv = ssvm_slave_init (&s->ssvm, a->segment_type)))
313 _vec_len (s) = vec_len (s) - 1;
317 /* Fish the segment header */
318 s->h = s->ssvm.sh->opaque[0];
320 vec_add1 (a->new_segment_indices, s - sm->segments);
325 svm_fifo_segment_delete (svm_fifo_segment_main_t * sm,
326 svm_fifo_segment_private_t * s)
328 ssvm_delete (&s->ssvm);
329 clib_memset (s, 0xfe, sizeof (*s));
330 pool_put (sm->segments, s);
334 * Allocate fifo in svm segment
337 svm_fifo_segment_alloc_fifo (svm_fifo_segment_private_t * fs,
338 u32 data_size_in_bytes,
339 svm_fifo_segment_freelist_t list_index)
341 ssvm_shared_header_t *sh;
342 svm_fifo_segment_header_t *fsh;
348 * 4K minimum. It's not likely that anything good will happen
349 * with a smaller FIFO.
351 if (data_size_in_bytes < FIFO_SEGMENT_MIN_FIFO_SIZE ||
352 data_size_in_bytes > FIFO_SEGMENT_MAX_FIFO_SIZE)
354 clib_warning ("fifo size out of range %d", data_size_in_bytes);
358 freelist_index = max_log2 (data_size_in_bytes)
359 - max_log2 (FIFO_SEGMENT_MIN_FIFO_SIZE);
362 ssvm_lock_non_recursive (sh, 1);
363 fsh = (svm_fifo_segment_header_t *) sh->opaque[0];
367 case FIFO_SEGMENT_RX_FREELIST:
368 case FIFO_SEGMENT_TX_FREELIST:
369 vec_validate_init_empty (fsh->free_fifos, freelist_index, 0);
370 f = fsh->free_fifos[freelist_index];
371 if (PREDICT_FALSE (!f))
373 /* Preallocated and no fifo left. Don't even try */
374 if (fsh->flags & FIFO_SEGMENT_F_IS_PREALLOCATED)
377 oldheap = ssvm_push_heap (sh);
378 allocate_new_fifo_chunk (fsh, data_size_in_bytes,
379 FIFO_SEGMENT_ALLOC_CHUNK_SIZE);
380 ssvm_pop_heap (oldheap);
381 f = fsh->free_fifos[freelist_index];
383 if (PREDICT_TRUE (f != 0))
385 fsh->free_fifos[freelist_index] = f->next;
386 /* (re)initialize the fifo, as in svm_fifo_create */
387 clib_memset (f, 0, sizeof (*f));
388 f->nitems = data_size_in_bytes;
389 f->ooos_list_head = OOO_SEGMENT_INVALID_INDEX;
390 f->ct_session_index = SVM_FIFO_INVALID_SESSION_INDEX;
392 f->freelist_index = freelist_index;
396 case FIFO_SEGMENT_FREELIST_NONE:
400 clib_warning ("ignore bogus freelist %d", list_index);
404 /* Catch all that allocates just one fifo. Note: this can fail,
405 * in which case: create another segment */
406 oldheap = ssvm_push_heap (sh);
407 f = svm_fifo_create (data_size_in_bytes);
408 ssvm_pop_heap (oldheap);
409 if (PREDICT_FALSE (f == 0))
411 f->freelist_index = freelist_index;
414 /* If rx_freelist add to active fifos list. When cleaning up segment,
415 * we need a list of active sessions that should be disconnected. Since
416 * both rx and tx fifos keep pointers to the session, it's enough to track
418 if (list_index == FIFO_SEGMENT_RX_FREELIST)
422 fsh->fifos->prev = f;
423 f->next = fsh->fifos;
427 fsh->n_active_fifos++;
430 ssvm_unlock_non_recursive (sh);
435 svm_fifo_segment_free_fifo (svm_fifo_segment_private_t * s, svm_fifo_t * f,
436 svm_fifo_segment_freelist_t list_index)
438 ssvm_shared_header_t *sh;
439 svm_fifo_segment_header_t *fsh;
443 ASSERT (f->refcnt > 0);
449 fsh = (svm_fifo_segment_header_t *) sh->opaque[0];
451 freelist_index = f->freelist_index;
453 ASSERT (freelist_index < vec_len (fsh->free_fifos));
455 ssvm_lock_non_recursive (sh, 2);
456 oldheap = ssvm_push_heap (sh);
460 case FIFO_SEGMENT_RX_FREELIST:
461 /* Remove from active list */
463 f->prev->next = f->next;
465 fsh->fifos = f->next;
467 f->next->prev = f->prev;
468 /* Fall through: we add only rx fifos to active pool */
469 case FIFO_SEGMENT_TX_FREELIST:
470 /* Add to free list */
471 f->next = fsh->free_fifos[freelist_index];
473 fsh->free_fifos[freelist_index] = f;
475 case FIFO_SEGMENT_FREELIST_NONE:
479 clib_warning ("ignore bogus freelist %d", list_index);
485 f->master_session_index = ~0;
486 f->master_thread_index = ~0;
489 fsh->n_active_fifos--;
490 ssvm_pop_heap (oldheap);
491 ssvm_unlock_non_recursive (sh);
495 svm_fifo_segment_main_init (svm_fifo_segment_main_t * sm, u64 baseva,
496 u32 timeout_in_seconds)
498 sm->next_baseva = baseva;
499 sm->timeout_in_seconds = timeout_in_seconds;
503 svm_fifo_segment_index (svm_fifo_segment_main_t * sm,
504 svm_fifo_segment_private_t * s)
506 return s - sm->segments;
510 * Retrieve svm segments pool. Used only for debug purposes.
512 svm_fifo_segment_private_t *
513 svm_fifo_segment_segments_pool (svm_fifo_segment_main_t * sm)
519 * Get number of active fifos
522 svm_fifo_segment_num_fifos (svm_fifo_segment_private_t * fifo_segment)
524 return fifo_segment->h->n_active_fifos;
528 svm_fifo_segment_num_free_fifos (svm_fifo_segment_private_t * fifo_segment,
529 u32 fifo_size_in_bytes)
531 ssvm_shared_header_t *sh;
532 svm_fifo_segment_header_t *fsh;
535 u32 count = 0, rounded_data_size, freelist_index;
537 sh = fifo_segment->ssvm.sh;
538 fsh = (svm_fifo_segment_header_t *) sh->opaque[0];
540 /* Count all free fifos? */
541 if (fifo_size_in_bytes == ~0)
543 for (i = 0; i < vec_len (fsh->free_fifos); i++)
545 f = fsh->free_fifos[i];
558 rounded_data_size = (1 << (max_log2 (fifo_size_in_bytes)));
559 freelist_index = max_log2 (rounded_data_size)
560 - max_log2 (FIFO_SEGMENT_MIN_FIFO_SIZE);
562 if (freelist_index >= vec_len (fsh->free_fifos))
565 f = fsh->free_fifos[freelist_index];
578 svm_fifo_segment_info (svm_fifo_segment_private_t * seg, uword * address,
581 if (ssvm_type (&seg->ssvm) == SSVM_SEGMENT_PRIVATE)
583 #if USE_DLMALLOC == 0
584 mheap_t *heap_header;
586 *address = pointer_to_uword (seg->ssvm.sh->heap);
587 heap_header = mheap_header (seg->ssvm.sh->heap);
588 *size = heap_header->max_size;
590 mspace_get_address_and_size (seg->ssvm.sh->heap,
591 (unsigned long long *) address,
592 (unsigned long long *) size);
597 *address = seg->ssvm.sh->ssvm_va;
598 *size = seg->ssvm.ssvm_size;
603 svm_fifo_segment_heap (svm_fifo_segment_private_t * seg)
605 return seg->ssvm.sh->heap;
609 format_svm_fifo_segment_type (u8 * s, va_list * args)
611 svm_fifo_segment_private_t *sp;
612 sp = va_arg (*args, svm_fifo_segment_private_t *);
613 ssvm_segment_type_t st = ssvm_type (&sp->ssvm);
615 if (st == SSVM_SEGMENT_PRIVATE)
616 s = format (s, "%s", "private-heap");
617 else if (st == SSVM_SEGMENT_MEMFD)
618 s = format (s, "%s", "memfd");
619 else if (st == SSVM_SEGMENT_SHM)
620 s = format (s, "%s", "shm");
622 s = format (s, "%s", "unknown");
627 * Segment format function
630 format_svm_fifo_segment (u8 * s, va_list * args)
632 svm_fifo_segment_private_t *sp
633 = va_arg (*args, svm_fifo_segment_private_t *);
634 int verbose __attribute__ ((unused)) = va_arg (*args, int);
635 svm_fifo_segment_header_t *fsh = sp->h;
640 indent = format_get_indent (s) + 2;
641 #if USE_DLMALLOC == 0
642 s = format (s, "%U segment heap: %U\n", format_white_space, indent,
643 format_mheap, svm_fifo_segment_heap (sp), verbose);
644 s = format (s, "%U segment has %u active fifos\n",
645 format_white_space, indent, svm_fifo_segment_num_fifos (sp));
648 for (i = 0; i < vec_len (fsh->free_fifos); i++)
650 f = fsh->free_fifos[i];
660 s = format (s, "%U%-5u Kb: %u free",
661 format_white_space, indent + 2,
662 1 << (i + max_log2 (FIFO_SEGMENT_MIN_FIFO_SIZE) - 10),
669 * fd.io coding-style-patch-verification: ON
672 * eval: (c-set-style "gnu")