2 * Copyright (c) 2015 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.
19 #include <vppinfra/format.h>
20 #include <vppinfra/time_range.h>
21 #include <vppinfra/linux/sysfs.h>
22 #include <vlib/vlib.h>
24 #include <vlib/threads.h>
26 #include <vlib/stat_weak_inlines.h>
34 vlib_worker_thread_t *vlib_worker_threads;
35 vlib_thread_main_t vlib_thread_main;
38 * Barrier tracing can be enabled on a normal build to collect information
39 * on barrier use, including timings and call stacks. Deliberately not
40 * keyed off CLIB_DEBUG, because that can add significant overhead which
41 * imapacts observed timings.
45 barrier_trace_sync (f64 t_entry, f64 t_open, f64 t_closed)
47 if (!vlib_worker_threads->barrier_elog_enabled)
51 ELOG_TYPE_DECLARE (e) =
53 .format = "bar-trace-%s-#%d",
54 .format_args = "T4i4",
59 u32 caller, count, t_entry, t_open, t_closed;
62 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
63 ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
64 ed->caller = elog_string (&vlib_global_main.elog_main,
65 (char *) vlib_worker_threads[0].barrier_caller);
66 ed->t_entry = (int) (1000000.0 * t_entry);
67 ed->t_open = (int) (1000000.0 * t_open);
68 ed->t_closed = (int) (1000000.0 * t_closed);
72 barrier_trace_sync_rec (f64 t_entry)
74 if (!vlib_worker_threads->barrier_elog_enabled)
78 ELOG_TYPE_DECLARE (e) =
80 .format = "bar-syncrec-%s-#%d",
81 .format_args = "T4i4",
89 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
90 ed->depth = (int) vlib_worker_threads[0].recursion_level - 1;
91 ed->caller = elog_string (&vlib_global_main.elog_main,
92 (char *) vlib_worker_threads[0].barrier_caller);
96 barrier_trace_release_rec (f64 t_entry)
98 if (!vlib_worker_threads->barrier_elog_enabled)
102 ELOG_TYPE_DECLARE (e) =
104 .format = "bar-relrrec-#%d",
113 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
114 ed->depth = (int) vlib_worker_threads[0].recursion_level;
118 barrier_trace_release (f64 t_entry, f64 t_closed_total, f64 t_update_main)
120 if (!vlib_worker_threads->barrier_elog_enabled)
124 ELOG_TYPE_DECLARE (e) =
126 .format = "bar-rel-#%d-e%d-u%d-t%d",
127 .format_args = "i4i4i4i4",
132 u32 count, t_entry, t_update_main, t_closed_total;
135 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
136 ed->t_entry = (int) (1000000.0 * t_entry);
137 ed->t_update_main = (int) (1000000.0 * t_update_main);
138 ed->t_closed_total = (int) (1000000.0 * t_closed_total);
139 ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
141 /* Reset context for next trace */
142 vlib_worker_threads[0].barrier_context = NULL;
146 os_get_nthreads (void)
148 return vec_len (vlib_thread_stacks);
152 vlib_set_thread_name (char *name)
154 int pthread_setname_np (pthread_t __target_thread, const char *__name);
156 pthread_t thread = pthread_self ();
160 rv = pthread_setname_np (thread, name);
162 clib_warning ("pthread_setname_np returned %d", rv);
167 sort_registrations_by_no_clone (void *a0, void *a1)
169 vlib_thread_registration_t **tr0 = a0;
170 vlib_thread_registration_t **tr1 = a1;
172 return ((i32) ((*tr0)->no_data_structure_clone)
173 - ((i32) ((*tr1)->no_data_structure_clone)));
177 clib_sysfs_list_to_bitmap (char *filename)
182 fp = fopen (filename, "r");
187 vec_validate (buffer, 256 - 1);
188 if (fgets ((char *) buffer, 256, fp))
191 unformat_init_string (&in, (char *) buffer,
192 strlen ((char *) buffer));
193 if (unformat (&in, "%U", unformat_bitmap_list, &r) != 1)
194 clib_warning ("unformat_bitmap_list failed");
204 /* Called early in the init sequence */
207 vlib_thread_init (vlib_main_t * vm)
209 vlib_thread_main_t *tm = &vlib_thread_main;
210 vlib_worker_thread_t *w;
211 vlib_thread_registration_t *tr;
212 u32 n_vlib_mains = 1;
217 /* get bitmaps of active cpu cores and sockets */
218 tm->cpu_core_bitmap =
219 clib_sysfs_list_to_bitmap ("/sys/devices/system/cpu/online");
220 tm->cpu_socket_bitmap =
221 clib_sysfs_list_to_bitmap ("/sys/devices/system/node/online");
223 avail_cpu = clib_bitmap_dup (tm->cpu_core_bitmap);
226 for (i = 0; i < tm->skip_cores; i++)
228 uword c = clib_bitmap_first_set (avail_cpu);
230 return clib_error_return (0, "no available cpus to skip");
232 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
235 /* grab cpu for main thread */
236 if (tm->main_lcore == ~0)
238 /* if main-lcore is not set, we try to use lcore 1 */
239 if (clib_bitmap_get (avail_cpu, 1))
242 tm->main_lcore = clib_bitmap_first_set (avail_cpu);
243 if (tm->main_lcore == (u8) ~ 0)
244 return clib_error_return (0, "no available cpus to be used for the"
249 if (clib_bitmap_get (avail_cpu, tm->main_lcore) == 0)
250 return clib_error_return (0, "cpu %u is not available to be used"
251 " for the main thread", tm->main_lcore);
253 avail_cpu = clib_bitmap_set (avail_cpu, tm->main_lcore, 0);
255 /* assume that there is socket 0 only if there is no data from sysfs */
256 if (!tm->cpu_socket_bitmap)
257 tm->cpu_socket_bitmap = clib_bitmap_set (0, 0, 1);
259 /* pin main thread to main_lcore */
260 if (tm->cb.vlib_thread_set_lcore_cb)
262 tm->cb.vlib_thread_set_lcore_cb (0, tm->main_lcore);
268 CPU_SET (tm->main_lcore, &cpuset);
269 pthread_setaffinity_np (pthread_self (), sizeof (cpu_set_t), &cpuset);
272 /* Set up thread 0 */
273 vec_validate_aligned (vlib_worker_threads, 0, CLIB_CACHE_LINE_BYTES);
274 _vec_len (vlib_worker_threads) = 1;
275 w = vlib_worker_threads;
276 w->thread_mheap = clib_mem_get_heap ();
277 w->thread_stack = vlib_thread_stacks[0];
278 w->cpu_id = tm->main_lcore;
279 w->lwp = syscall (SYS_gettid);
280 w->thread_id = pthread_self ();
281 tm->n_vlib_mains = 1;
283 vlib_get_thread_core_numa (w, w->cpu_id);
285 if (tm->sched_policy != ~0)
287 struct sched_param sched_param;
288 if (!sched_getparam (w->lwp, &sched_param))
290 if (tm->sched_priority != ~0)
291 sched_param.sched_priority = tm->sched_priority;
292 sched_setscheduler (w->lwp, tm->sched_policy, &sched_param);
296 /* assign threads to cores and set n_vlib_mains */
301 vec_add1 (tm->registrations, tr);
305 vec_sort_with_function (tm->registrations, sort_registrations_by_no_clone);
307 for (i = 0; i < vec_len (tm->registrations); i++)
310 tr = tm->registrations[i];
311 tr->first_index = first_index;
312 first_index += tr->count;
313 n_vlib_mains += (tr->no_data_structure_clone == 0) ? tr->count : 0;
315 /* construct coremask */
316 if (tr->use_pthreads || !tr->count)
323 clib_bitmap_foreach (c, tr->coremask, ({
324 if (clib_bitmap_get(avail_cpu, c) == 0)
325 return clib_error_return (0, "cpu %u is not available to be used"
326 " for the '%s' thread",c, tr->name);
328 avail_cpu = clib_bitmap_set(avail_cpu, c, 0);
334 for (j = 0; j < tr->count; j++)
336 /* Do not use CPU 0 by default - leave it to the host and IRQs */
337 uword avail_c0 = clib_bitmap_get (avail_cpu, 0);
338 avail_cpu = clib_bitmap_set (avail_cpu, 0, 0);
340 uword c = clib_bitmap_first_set (avail_cpu);
341 /* Use CPU 0 as a last resort */
342 if (c == ~0 && avail_c0)
349 return clib_error_return (0,
350 "no available cpus to be used for"
351 " the '%s' thread", tr->name);
353 avail_cpu = clib_bitmap_set (avail_cpu, 0, avail_c0);
354 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
355 tr->coremask = clib_bitmap_set (tr->coremask, c, 1);
360 clib_bitmap_free (avail_cpu);
362 tm->n_vlib_mains = n_vlib_mains;
365 * Allocate the remaining worker threads, and thread stack vector slots
366 * from now on, calls to os_get_nthreads() will return the correct
369 vec_validate_aligned (vlib_worker_threads, first_index - 1,
370 CLIB_CACHE_LINE_BYTES);
371 vec_validate (vlib_thread_stacks, vec_len (vlib_worker_threads) - 1);
376 vlib_frame_queue_alloc (int nelts)
378 vlib_frame_queue_t *fq;
380 fq = clib_mem_alloc_aligned (sizeof (*fq), CLIB_CACHE_LINE_BYTES);
381 clib_memset (fq, 0, sizeof (*fq));
383 fq->vector_threshold = 128; // packets
384 vec_validate_aligned (fq->elts, nelts - 1, CLIB_CACHE_LINE_BYTES);
388 if (((uword) & fq->tail) & (CLIB_CACHE_LINE_BYTES - 1))
389 fformat (stderr, "WARNING: fq->tail unaligned\n");
390 if (((uword) & fq->head) & (CLIB_CACHE_LINE_BYTES - 1))
391 fformat (stderr, "WARNING: fq->head unaligned\n");
392 if (((uword) fq->elts) & (CLIB_CACHE_LINE_BYTES - 1))
393 fformat (stderr, "WARNING: fq->elts unaligned\n");
395 if (sizeof (fq->elts[0]) % CLIB_CACHE_LINE_BYTES)
396 fformat (stderr, "WARNING: fq->elts[0] size %d\n",
397 sizeof (fq->elts[0]));
398 if (nelts & (nelts - 1))
400 fformat (stderr, "FATAL: nelts MUST be a power of 2\n");
408 void vl_msg_api_handler_no_free (void *) __attribute__ ((weak));
410 vl_msg_api_handler_no_free (void *v)
414 /* Turned off, save as reference material... */
417 vlib_frame_queue_dequeue_internal (int thread_id,
418 vlib_main_t * vm, vlib_node_main_t * nm)
420 vlib_frame_queue_t *fq = vlib_frame_queues[thread_id];
421 vlib_frame_queue_elt_t *elt;
423 vlib_pending_frame_t *p;
424 vlib_node_runtime_t *r;
425 u32 node_runtime_index;
430 ASSERT (vm == vlib_mains[thread_id]);
434 if (fq->head == fq->tail)
437 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
442 before = clib_cpu_time_now ();
445 node_runtime_index = elt->node_runtime_index;
446 msg_type = elt->msg_type;
450 case VLIB_FRAME_QUEUE_ELT_FREE_BUFFERS:
451 vlib_buffer_free (vm, vlib_frame_vector_args (f), f->n_vectors);
452 /* note fallthrough... */
453 case VLIB_FRAME_QUEUE_ELT_FREE_FRAME:
454 r = vec_elt_at_index (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
456 vlib_frame_free (vm, r, f);
458 case VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME:
459 vec_add2 (vm->node_main.pending_frames, p, 1);
460 f->flags |= (VLIB_FRAME_PENDING | VLIB_FRAME_FREE_AFTER_DISPATCH);
461 p->node_runtime_index = elt->node_runtime_index;
462 p->frame_index = vlib_frame_index (vm, f);
463 p->next_frame_index = VLIB_PENDING_FRAME_NO_NEXT_FRAME;
464 fq->dequeue_vectors += (u64) f->n_vectors;
466 case VLIB_FRAME_QUEUE_ELT_API_MSG:
467 vl_msg_api_handler_no_free (f);
470 clib_warning ("bogus frame queue message, type %d", msg_type);
475 fq->dequeue_ticks += clib_cpu_time_now () - before;
476 CLIB_MEMORY_BARRIER ();
485 vlib_frame_queue_dequeue (int thread_id,
486 vlib_main_t * vm, vlib_node_main_t * nm)
488 return vlib_frame_queue_dequeue_internal (thread_id, vm, nm);
492 vlib_frame_queue_enqueue (vlib_main_t * vm, u32 node_runtime_index,
493 u32 frame_queue_index, vlib_frame_t * frame,
494 vlib_frame_queue_msg_type_t type)
496 vlib_frame_queue_t *fq = vlib_frame_queues[frame_queue_index];
497 vlib_frame_queue_elt_t *elt;
500 u64 before = clib_cpu_time_now ();
504 new_tail = clib_atomic_add_fetch (&fq->tail, 1);
506 /* Wait until a ring slot is available */
507 while (new_tail >= fq->head + fq->nelts)
509 f64 b4 = vlib_time_now_ticks (vm, before);
510 vlib_worker_thread_barrier_check (vm, b4);
511 /* Bad idea. Dequeue -> enqueue -> dequeue -> trouble */
512 // vlib_frame_queue_dequeue (vm->thread_index, vm, nm);
515 elt = fq->elts + (new_tail & (fq->nelts - 1));
517 /* this would be very bad... */
522 /* Once we enqueue the frame, frame->n_vectors is owned elsewhere... */
523 save_count = frame->n_vectors;
526 elt->node_runtime_index = node_runtime_index;
527 elt->msg_type = type;
528 CLIB_MEMORY_BARRIER ();
535 /* To be called by vlib worker threads upon startup */
537 vlib_worker_thread_init (vlib_worker_thread_t * w)
539 vlib_thread_main_t *tm = vlib_get_thread_main ();
542 * Note: disabling signals in worker threads as follows
543 * prevents the api post-mortem dump scheme from working
547 * pthread_sigmask (SIG_SETMASK, &s, 0);
551 clib_mem_set_heap (w->thread_mheap);
553 if (vec_len (tm->thread_prefix) && w->registration->short_name)
555 w->name = format (0, "%v_%s_%d%c", tm->thread_prefix,
556 w->registration->short_name, w->instance_id, '\0');
557 vlib_set_thread_name ((char *) w->name);
560 if (!w->registration->use_pthreads)
563 /* Initial barrier sync, for both worker and i/o threads */
564 clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, 1);
566 while (*vlib_worker_threads->wait_at_barrier)
569 clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, -1);
574 vlib_worker_thread_bootstrap_fn (void *arg)
577 vlib_worker_thread_t *w = arg;
579 w->lwp = syscall (SYS_gettid);
580 w->thread_id = pthread_self ();
582 __os_thread_index = w - vlib_worker_threads;
584 rv = (void *) clib_calljmp
585 ((uword (*)(uword)) w->thread_function,
586 (uword) arg, w->thread_stack + VLIB_THREAD_STACK_SIZE);
587 /* NOTREACHED, we hope */
592 vlib_get_thread_core_numa (vlib_worker_thread_t * w, unsigned cpu_id)
594 const char *sys_cpu_path = "/sys/devices/system/cpu/cpu";
595 const char *sys_node_path = "/sys/devices/system/node/node";
596 clib_bitmap_t *nbmp = 0, *cbmp = 0;
599 int core_id = -1, numa_id = -1;
601 p = format (p, "%s%u/topology/core_id%c", sys_cpu_path, cpu_id, 0);
602 clib_sysfs_read ((char *) p, "%d", &core_id);
603 vec_reset_length (p);
606 clib_sysfs_read ("/sys/devices/system/node/online", "%U",
607 unformat_bitmap_list, &nbmp);
608 clib_bitmap_foreach (node, nbmp, ({
609 p = format (p, "%s%u/cpulist%c", sys_node_path, node, 0);
610 clib_sysfs_read ((char *) p, "%U", unformat_bitmap_list, &cbmp);
611 if (clib_bitmap_get (cbmp, cpu_id))
613 vec_reset_length (cbmp);
614 vec_reset_length (p);
621 w->core_id = core_id;
622 w->numa_id = numa_id;
625 static clib_error_t *
626 vlib_launch_thread_int (void *fp, vlib_worker_thread_t * w, unsigned cpu_id)
628 vlib_thread_main_t *tm = &vlib_thread_main;
629 void *(*fp_arg) (void *) = fp;
633 vlib_get_thread_core_numa (w, cpu_id);
635 /* Set up NUMA-bound heap if indicated */
636 if (clib_per_numa_mheaps[w->numa_id] == 0)
638 /* If the user requested a NUMA heap, create it... */
639 if (tm->numa_heap_size)
641 numa_heap = clib_mem_init_thread_safe_numa
642 (0 /* DIY */ , tm->numa_heap_size, w->numa_id);
643 clib_per_numa_mheaps[w->numa_id] = numa_heap;
647 /* Or, use the main heap */
648 clib_per_numa_mheaps[w->numa_id] = w->thread_mheap;
652 if (tm->cb.vlib_launch_thread_cb && !w->registration->use_pthreads)
653 return tm->cb.vlib_launch_thread_cb (fp, (void *) w, cpu_id);
659 CPU_SET (cpu_id, &cpuset);
661 if (pthread_create (&worker, NULL /* attr */ , fp_arg, (void *) w))
662 return clib_error_return_unix (0, "pthread_create");
664 if (pthread_setaffinity_np (worker, sizeof (cpu_set_t), &cpuset))
665 return clib_error_return_unix (0, "pthread_setaffinity_np");
671 static clib_error_t *
672 start_workers (vlib_main_t * vm)
675 vlib_worker_thread_t *w;
676 vlib_main_t *vm_clone;
678 vlib_thread_main_t *tm = &vlib_thread_main;
679 vlib_thread_registration_t *tr;
680 vlib_node_runtime_t *rt;
681 u32 n_vlib_mains = tm->n_vlib_mains;
682 u32 worker_thread_index;
683 u8 *main_heap = clib_mem_get_per_cpu_heap ();
685 vec_reset_length (vlib_worker_threads);
687 /* Set up the main thread */
688 vec_add2_aligned (vlib_worker_threads, w, 1, CLIB_CACHE_LINE_BYTES);
689 w->elog_track.name = "main thread";
690 elog_track_register (&vm->elog_main, &w->elog_track);
692 if (vec_len (tm->thread_prefix))
694 w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
695 vlib_set_thread_name ((char *) w->name);
699 clib_mem_alloc_aligned (CLIB_CACHE_LINE_BYTES, CLIB_CACHE_LINE_BYTES);
700 vm->elog_main.lock[0] = 0;
702 if (n_vlib_mains > 1)
704 /* Replace hand-crafted length-1 vector with a real vector */
707 vec_validate_aligned (vlib_mains, tm->n_vlib_mains - 1,
708 CLIB_CACHE_LINE_BYTES);
709 _vec_len (vlib_mains) = 0;
710 vec_add1_aligned (vlib_mains, vm, CLIB_CACHE_LINE_BYTES);
712 vlib_worker_threads->wait_at_barrier =
713 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
714 vlib_worker_threads->workers_at_barrier =
715 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
717 vlib_worker_threads->node_reforks_required =
718 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
720 /* We'll need the rpc vector lock... */
721 clib_spinlock_init (&vm->pending_rpc_lock);
723 /* Ask for an initial barrier sync */
724 *vlib_worker_threads->workers_at_barrier = 0;
725 *vlib_worker_threads->wait_at_barrier = 1;
727 /* Without update or refork */
728 *vlib_worker_threads->node_reforks_required = 0;
729 vm->need_vlib_worker_thread_node_runtime_update = 0;
732 vm->barrier_epoch = 0;
733 vm->barrier_no_close_before = 0;
735 worker_thread_index = 1;
737 for (i = 0; i < vec_len (tm->registrations); i++)
739 vlib_node_main_t *nm, *nm_clone;
742 tr = tm->registrations[i];
747 for (k = 0; k < tr->count; k++)
751 vec_add2 (vlib_worker_threads, w, 1);
752 /* Currently unused, may not really work */
754 w->thread_mheap = create_mspace (tr->mheap_size,
757 w->thread_mheap = main_heap;
760 vlib_thread_stack_init (w - vlib_worker_threads);
761 w->thread_function = tr->function;
762 w->thread_function_arg = w;
764 w->registration = tr;
767 (char *) format (0, "%s %d", tr->name, k + 1);
768 vec_add1 (w->elog_track.name, 0);
769 elog_track_register (&vm->elog_main, &w->elog_track);
771 if (tr->no_data_structure_clone)
774 /* Fork vlib_global_main et al. Look for bugs here */
775 oldheap = clib_mem_set_heap (w->thread_mheap);
777 vm_clone = clib_mem_alloc_aligned (sizeof (*vm_clone),
778 CLIB_CACHE_LINE_BYTES);
779 clib_memcpy (vm_clone, vlib_mains[0], sizeof (*vm_clone));
781 vm_clone->thread_index = worker_thread_index;
782 vm_clone->heap_base = w->thread_mheap;
783 vm_clone->heap_aligned_base = (void *)
784 (((uword) w->thread_mheap) & ~(VLIB_FRAME_ALIGN - 1));
785 vm_clone->init_functions_called =
786 hash_create (0, /* value bytes */ 0);
787 vm_clone->pending_rpc_requests = 0;
788 vec_validate (vm_clone->pending_rpc_requests, 0);
789 _vec_len (vm_clone->pending_rpc_requests) = 0;
790 clib_memset (&vm_clone->random_buffer, 0,
791 sizeof (vm_clone->random_buffer));
793 nm = &vlib_mains[0]->node_main;
794 nm_clone = &vm_clone->node_main;
795 /* fork next frames array, preserving node runtime indices */
796 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
797 CLIB_CACHE_LINE_BYTES);
798 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
800 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
801 u32 save_node_runtime_index;
804 save_node_runtime_index = nf->node_runtime_index;
805 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
806 vlib_next_frame_init (nf);
807 nf->node_runtime_index = save_node_runtime_index;
808 nf->flags = save_flags;
811 /* fork the frame dispatch queue */
812 nm_clone->pending_frames = 0;
813 vec_validate (nm_clone->pending_frames, 10);
814 _vec_len (nm_clone->pending_frames) = 0;
819 /* Allocate all nodes in single block for speed */
820 n = clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*n));
822 for (j = 0; j < vec_len (nm->nodes); j++)
824 clib_memcpy (n, nm->nodes[j], sizeof (*n));
825 /* none of the copied nodes have enqueue rights given out */
826 n->owner_node_index = VLIB_INVALID_NODE_INDEX;
827 clib_memset (&n->stats_total, 0, sizeof (n->stats_total));
828 clib_memset (&n->stats_last_clear, 0,
829 sizeof (n->stats_last_clear));
830 vec_add1 (nm_clone->nodes, n);
833 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
834 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
835 CLIB_CACHE_LINE_BYTES);
837 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
839 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
840 rt->thread_index = vm_clone->thread_index;
841 /* copy initial runtime_data from node */
842 if (n->runtime_data && n->runtime_data_bytes > 0)
843 clib_memcpy (rt->runtime_data, n->runtime_data,
844 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
845 n->runtime_data_bytes));
848 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
849 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
850 CLIB_CACHE_LINE_BYTES);
851 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
853 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
854 rt->thread_index = vm_clone->thread_index;
855 /* copy initial runtime_data from node */
856 if (n->runtime_data && n->runtime_data_bytes > 0)
857 clib_memcpy (rt->runtime_data, n->runtime_data,
858 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
859 n->runtime_data_bytes));
862 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
863 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
864 CLIB_CACHE_LINE_BYTES);
866 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
868 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
869 rt->thread_index = vm_clone->thread_index;
870 /* copy initial runtime_data from node */
871 if (n->runtime_data && n->runtime_data_bytes > 0)
872 clib_memcpy (rt->runtime_data, n->runtime_data,
873 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
874 n->runtime_data_bytes));
877 nm_clone->processes = vec_dup_aligned (nm->processes,
878 CLIB_CACHE_LINE_BYTES);
880 /* Create per-thread frame freelist */
881 nm_clone->frame_sizes = vec_new (vlib_frame_size_t, 1);
882 #ifdef VLIB_SUPPORTS_ARBITRARY_SCALAR_SIZES
883 nm_clone->frame_size_hash = hash_create (0, sizeof (uword));
885 nm_clone->node_by_error = nm->node_by_error;
887 /* Packet trace buffers are guaranteed to be empty, nothing to do here */
889 clib_mem_set_heap (oldheap);
890 vec_add1_aligned (vlib_mains, vm_clone, CLIB_CACHE_LINE_BYTES);
892 /* Switch to the stats segment ... */
893 void *oldheap = vlib_stats_push_heap (0);
894 vm_clone->error_main.counters = vec_dup_aligned
895 (vlib_mains[0]->error_main.counters, CLIB_CACHE_LINE_BYTES);
896 vlib_stats_pop_heap2 (vm_clone->error_main.counters,
897 worker_thread_index, oldheap, 1);
899 vm_clone->error_main.counters_last_clear = vec_dup_aligned
900 (vlib_mains[0]->error_main.counters_last_clear,
901 CLIB_CACHE_LINE_BYTES);
903 worker_thread_index++;
909 /* only have non-data-structure copy threads to create... */
910 for (i = 0; i < vec_len (tm->registrations); i++)
912 tr = tm->registrations[i];
914 for (j = 0; j < tr->count; j++)
916 vec_add2 (vlib_worker_threads, w, 1);
920 create_mspace (tr->mheap_size, 0 /* locked */ );
923 w->thread_mheap = main_heap;
925 vlib_thread_stack_init (w - vlib_worker_threads);
926 w->thread_function = tr->function;
927 w->thread_function_arg = w;
930 (char *) format (0, "%s %d", tr->name, j + 1);
931 w->registration = tr;
932 vec_add1 (w->elog_track.name, 0);
933 elog_track_register (&vm->elog_main, &w->elog_track);
938 worker_thread_index = 1;
940 for (i = 0; i < vec_len (tm->registrations); i++)
945 tr = tm->registrations[i];
947 if (tr->use_pthreads || tm->use_pthreads)
949 for (j = 0; j < tr->count; j++)
951 w = vlib_worker_threads + worker_thread_index++;
952 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
955 clib_error_report (err);
962 clib_bitmap_foreach (c, tr->coremask, ({
963 w = vlib_worker_threads + worker_thread_index++;
964 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
967 clib_error_report (err);
972 vlib_worker_thread_barrier_sync (vm);
973 vlib_worker_thread_barrier_release (vm);
977 VLIB_MAIN_LOOP_ENTER_FUNCTION (start_workers);
981 worker_thread_node_runtime_update_internal (void)
985 vlib_node_main_t *nm, *nm_clone;
986 vlib_main_t *vm_clone;
987 vlib_node_runtime_t *rt;
989 vlib_node_runtime_sync_stats (vlib_main_t * vm,
990 vlib_node_runtime_t * r,
992 uword n_vectors, uword n_clocks);
994 ASSERT (vlib_get_thread_index () == 0);
999 ASSERT (*vlib_worker_threads->wait_at_barrier == 1);
1002 * Scrape all runtime stats, so we don't lose node runtime(s) with
1003 * pending counts, or throw away worker / io thread counts.
1005 for (j = 0; j < vec_len (nm->nodes); j++)
1009 vlib_node_sync_stats (vm, n);
1012 for (i = 1; i < vec_len (vlib_mains); i++)
1016 vm_clone = vlib_mains[i];
1017 nm_clone = &vm_clone->node_main;
1019 for (j = 0; j < vec_len (nm_clone->nodes); j++)
1021 n = nm_clone->nodes[j];
1023 rt = vlib_node_get_runtime (vm_clone, n->index);
1024 vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
1028 /* Per-worker clone rebuilds are now done on each thread */
1033 vlib_worker_thread_node_refork (void)
1035 vlib_main_t *vm, *vm_clone;
1036 vlib_node_main_t *nm, *nm_clone;
1037 vlib_node_t **old_nodes_clone;
1038 vlib_node_runtime_t *rt, *old_rt;
1040 vlib_node_t *new_n_clone;
1045 nm = &vm->node_main;
1046 vm_clone = vlib_get_main ();
1047 nm_clone = &vm_clone->node_main;
1049 /* Re-clone error heap */
1050 u64 *old_counters = vm_clone->error_main.counters;
1051 u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
1053 clib_memcpy_fast (&vm_clone->error_main, &vm->error_main,
1054 sizeof (vm->error_main));
1055 j = vec_len (vm->error_main.counters) - 1;
1057 /* Switch to the stats segment ... */
1058 void *oldheap = vlib_stats_push_heap (0);
1059 vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
1060 vm_clone->error_main.counters = old_counters;
1061 vlib_stats_pop_heap2 (vm_clone->error_main.counters, vm_clone->thread_index,
1064 vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
1065 vm_clone->error_main.counters_last_clear = old_counters_all_clear;
1067 nm_clone = &vm_clone->node_main;
1068 vec_free (nm_clone->next_frames);
1069 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
1070 CLIB_CACHE_LINE_BYTES);
1072 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
1074 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
1075 u32 save_node_runtime_index;
1078 save_node_runtime_index = nf->node_runtime_index;
1079 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
1080 vlib_next_frame_init (nf);
1081 nf->node_runtime_index = save_node_runtime_index;
1082 nf->flags = save_flags;
1085 old_nodes_clone = nm_clone->nodes;
1086 nm_clone->nodes = 0;
1090 /* Allocate all nodes in single block for speed */
1092 clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*new_n_clone));
1093 for (j = 0; j < vec_len (nm->nodes); j++)
1095 vlib_node_t *new_n = nm->nodes[j];
1097 clib_memcpy_fast (new_n_clone, new_n, sizeof (*new_n));
1098 /* none of the copied nodes have enqueue rights given out */
1099 new_n_clone->owner_node_index = VLIB_INVALID_NODE_INDEX;
1101 if (j >= vec_len (old_nodes_clone))
1103 /* new node, set to zero */
1104 clib_memset (&new_n_clone->stats_total, 0,
1105 sizeof (new_n_clone->stats_total));
1106 clib_memset (&new_n_clone->stats_last_clear, 0,
1107 sizeof (new_n_clone->stats_last_clear));
1111 vlib_node_t *old_n_clone = old_nodes_clone[j];
1112 /* Copy stats if the old data is valid */
1113 clib_memcpy_fast (&new_n_clone->stats_total,
1114 &old_n_clone->stats_total,
1115 sizeof (new_n_clone->stats_total));
1116 clib_memcpy_fast (&new_n_clone->stats_last_clear,
1117 &old_n_clone->stats_last_clear,
1118 sizeof (new_n_clone->stats_last_clear));
1120 /* keep previous node state */
1121 new_n_clone->state = old_n_clone->state;
1123 vec_add1 (nm_clone->nodes, new_n_clone);
1126 /* Free the old node clones */
1127 clib_mem_free (old_nodes_clone[0]);
1129 vec_free (old_nodes_clone);
1132 /* re-clone internal nodes */
1133 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL];
1134 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
1135 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
1136 CLIB_CACHE_LINE_BYTES);
1138 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
1140 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1141 rt->thread_index = vm_clone->thread_index;
1142 /* copy runtime_data, will be overwritten later for existing rt */
1143 if (n->runtime_data && n->runtime_data_bytes > 0)
1144 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1145 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1146 n->runtime_data_bytes));
1149 for (j = 0; j < vec_len (old_rt); j++)
1151 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1152 rt->state = old_rt[j].state;
1153 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1154 VLIB_NODE_RUNTIME_DATA_SIZE);
1159 /* re-clone input nodes */
1160 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
1161 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
1162 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
1163 CLIB_CACHE_LINE_BYTES);
1165 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
1167 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1168 rt->thread_index = vm_clone->thread_index;
1169 /* copy runtime_data, will be overwritten later for existing rt */
1170 if (n->runtime_data && n->runtime_data_bytes > 0)
1171 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1172 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1173 n->runtime_data_bytes));
1176 for (j = 0; j < vec_len (old_rt); j++)
1178 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1179 rt->state = old_rt[j].state;
1180 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1181 VLIB_NODE_RUNTIME_DATA_SIZE);
1186 /* re-clone pre-input nodes */
1187 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT];
1188 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
1189 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
1190 CLIB_CACHE_LINE_BYTES);
1192 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
1194 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1195 rt->thread_index = vm_clone->thread_index;
1196 /* copy runtime_data, will be overwritten later for existing rt */
1197 if (n->runtime_data && n->runtime_data_bytes > 0)
1198 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1199 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1200 n->runtime_data_bytes));
1203 for (j = 0; j < vec_len (old_rt); j++)
1205 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1206 rt->state = old_rt[j].state;
1207 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1208 VLIB_NODE_RUNTIME_DATA_SIZE);
1213 nm_clone->processes = vec_dup_aligned (nm->processes,
1214 CLIB_CACHE_LINE_BYTES);
1215 nm_clone->node_by_error = nm->node_by_error;
1219 vlib_worker_thread_node_runtime_update (void)
1222 * Make a note that we need to do a node runtime update
1223 * prior to releasing the barrier.
1225 vlib_global_main.need_vlib_worker_thread_node_runtime_update = 1;
1229 unformat_sched_policy (unformat_input_t * input, va_list * args)
1231 u32 *r = va_arg (*args, u32 *);
1234 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
1235 foreach_sched_policy
1242 static clib_error_t *
1243 cpu_config (vlib_main_t * vm, unformat_input_t * input)
1245 vlib_thread_registration_t *tr;
1247 vlib_thread_main_t *tm = &vlib_thread_main;
1252 tm->thread_registrations_by_name = hash_create_string (0, sizeof (uword));
1254 tm->n_thread_stacks = 1; /* account for main thread */
1255 tm->sched_policy = ~0;
1256 tm->sched_priority = ~0;
1257 tm->main_lcore = ~0;
1263 hash_set_mem (tm->thread_registrations_by_name, tr->name, (uword) tr);
1267 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1269 if (unformat (input, "use-pthreads"))
1270 tm->use_pthreads = 1;
1271 else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1273 else if (unformat (input, "main-core %u", &tm->main_lcore))
1275 else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1277 else if (unformat (input, "numa-heap-size %U",
1278 unformat_memory_size, &tm->numa_heap_size))
1280 else if (unformat (input, "coremask-%s %U", &name,
1281 unformat_bitmap_mask, &bitmap) ||
1282 unformat (input, "corelist-%s %U", &name,
1283 unformat_bitmap_list, &bitmap))
1285 p = hash_get_mem (tm->thread_registrations_by_name, name);
1287 return clib_error_return (0, "no such thread type '%s'", name);
1289 tr = (vlib_thread_registration_t *) p[0];
1291 if (tr->use_pthreads)
1292 return clib_error_return (0,
1293 "corelist cannot be set for '%s' threads",
1296 return clib_error_return
1297 (0, "core placement of '%s' threads is already configured",
1300 tr->coremask = bitmap;
1301 tr->count = clib_bitmap_count_set_bits (tr->coremask);
1305 (input, "scheduler-policy %U", unformat_sched_policy,
1308 else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1310 else if (unformat (input, "%s %u", &name, &count))
1312 p = hash_get_mem (tm->thread_registrations_by_name, name);
1314 return clib_error_return (0, "no such thread type 3 '%s'", name);
1316 tr = (vlib_thread_registration_t *) p[0];
1318 if (tr->fixed_count)
1319 return clib_error_return
1320 (0, "number of '%s' threads not configurable", name);
1322 return clib_error_return
1323 (0, "number of '%s' threads is already configured", name);
1331 if (tm->sched_priority != ~0)
1333 if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1335 u32 prio_max = sched_get_priority_max (tm->sched_policy);
1336 u32 prio_min = sched_get_priority_min (tm->sched_policy);
1337 if (tm->sched_priority > prio_max)
1338 tm->sched_priority = prio_max;
1339 if (tm->sched_priority < prio_min)
1340 tm->sched_priority = prio_min;
1344 return clib_error_return
1346 "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1347 tm->sched_priority);
1352 if (!tm->thread_prefix)
1353 tm->thread_prefix = format (0, "vpp");
1357 tm->n_thread_stacks += tr->count;
1358 tm->n_pthreads += tr->count * tr->use_pthreads;
1359 tm->n_threads += tr->count * (tr->use_pthreads == 0);
1366 VLIB_EARLY_CONFIG_FUNCTION (cpu_config, "cpu");
1368 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1370 vnet_main_fixup (vlib_fork_fixup_t which)
1375 vlib_worker_thread_fork_fixup (vlib_fork_fixup_t which)
1377 vlib_main_t *vm = vlib_get_main ();
1379 if (vlib_mains == 0)
1382 ASSERT (vlib_get_thread_index () == 0);
1383 vlib_worker_thread_barrier_sync (vm);
1387 case VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX:
1388 vnet_main_fixup (VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX);
1394 vlib_worker_thread_barrier_release (vm);
1398 * Enforce minimum open time to minimize packet loss due to Rx overflow,
1399 * based on a test based heuristic that barrier should be open for at least
1400 * 3 time as long as it is closed (with an upper bound of 1ms because by that
1401 * point it is probably too late to make a difference)
1404 #ifndef BARRIER_MINIMUM_OPEN_LIMIT
1405 #define BARRIER_MINIMUM_OPEN_LIMIT 0.001
1408 #ifndef BARRIER_MINIMUM_OPEN_FACTOR
1409 #define BARRIER_MINIMUM_OPEN_FACTOR 3
1413 vlib_worker_thread_initial_barrier_sync_and_release (vlib_main_t * vm)
1416 f64 now = vlib_time_now (vm);
1417 u32 count = vec_len (vlib_mains) - 1;
1419 /* No worker threads? */
1423 deadline = now + BARRIER_SYNC_TIMEOUT;
1424 *vlib_worker_threads->wait_at_barrier = 1;
1425 while (*vlib_worker_threads->workers_at_barrier != count)
1427 if ((now = vlib_time_now (vm)) > deadline)
1429 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1434 *vlib_worker_threads->wait_at_barrier = 0;
1438 vlib_worker_thread_barrier_sync_int (vlib_main_t * vm, const char *func_name)
1445 f64 max_vector_rate;
1449 if (vec_len (vlib_mains) < 2)
1452 ASSERT (vlib_get_thread_index () == 0);
1454 vlib_worker_threads[0].barrier_caller = func_name;
1455 count = vec_len (vlib_mains) - 1;
1457 /* Record entry relative to last close */
1458 now = vlib_time_now (vm);
1459 t_entry = now - vm->barrier_epoch;
1461 /* Tolerate recursive calls */
1462 if (++vlib_worker_threads[0].recursion_level > 1)
1464 barrier_trace_sync_rec (t_entry);
1469 * Need data to decide if we're working hard enough to honor
1470 * the barrier hold-down timer.
1472 max_vector_rate = 0.0;
1473 for (i = 1; i < vec_len (vlib_mains); i++)
1475 clib_max (max_vector_rate,
1476 (f64) vlib_last_vectors_per_main_loop (vlib_mains[i]));
1478 vlib_worker_threads[0].barrier_sync_count++;
1480 /* Enforce minimum barrier open time to minimize packet loss */
1481 ASSERT (vm->barrier_no_close_before <= (now + BARRIER_MINIMUM_OPEN_LIMIT));
1484 * If any worker thread seems busy, which we define
1485 * as a vector rate above 10, we enforce the barrier hold-down timer
1487 if (max_vector_rate > 10.0)
1491 now = vlib_time_now (vm);
1492 /* Barrier hold-down timer expired? */
1493 if (now >= vm->barrier_no_close_before)
1495 if ((vm->barrier_no_close_before - now)
1496 > (2.0 * BARRIER_MINIMUM_OPEN_LIMIT))
1499 ("clock change: would have waited for %.4f seconds",
1500 (vm->barrier_no_close_before - now));
1505 /* Record time of closure */
1506 t_open = now - vm->barrier_epoch;
1507 vm->barrier_epoch = now;
1509 deadline = now + BARRIER_SYNC_TIMEOUT;
1511 *vlib_worker_threads->wait_at_barrier = 1;
1512 while (*vlib_worker_threads->workers_at_barrier != count)
1514 if ((now = vlib_time_now (vm)) > deadline)
1516 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1521 t_closed = now - vm->barrier_epoch;
1523 barrier_trace_sync (t_entry, t_open, t_closed);
1528 vlib_worker_thread_barrier_release (vlib_main_t * vm)
1535 f64 t_update_main = 0.0;
1536 int refork_needed = 0;
1538 if (vec_len (vlib_mains) < 2)
1541 ASSERT (vlib_get_thread_index () == 0);
1544 now = vlib_time_now (vm);
1545 t_entry = now - vm->barrier_epoch;
1547 if (--vlib_worker_threads[0].recursion_level > 0)
1549 barrier_trace_release_rec (t_entry);
1553 /* Update (all) node runtimes before releasing the barrier, if needed */
1554 if (vm->need_vlib_worker_thread_node_runtime_update)
1557 * Lock stat segment here, so we's safe when
1558 * rebuilding the stat segment node clones from the
1561 vlib_stat_segment_lock ();
1563 /* Do stats elements on main thread */
1564 worker_thread_node_runtime_update_internal ();
1565 vm->need_vlib_worker_thread_node_runtime_update = 0;
1567 /* Do per thread rebuilds in parallel */
1569 clib_atomic_fetch_add (vlib_worker_threads->node_reforks_required,
1570 (vec_len (vlib_mains) - 1));
1571 now = vlib_time_now (vm);
1572 t_update_main = now - vm->barrier_epoch;
1575 deadline = now + BARRIER_SYNC_TIMEOUT;
1578 * Note when we let go of the barrier.
1579 * Workers can use this to derive a reasonably accurate
1580 * time offset. See vlib_time_now(...)
1582 vm->time_last_barrier_release = vlib_time_now (vm);
1583 CLIB_MEMORY_STORE_BARRIER ();
1585 *vlib_worker_threads->wait_at_barrier = 0;
1587 while (*vlib_worker_threads->workers_at_barrier > 0)
1589 if ((now = vlib_time_now (vm)) > deadline)
1591 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1596 /* Wait for reforks before continuing */
1599 now = vlib_time_now (vm);
1601 deadline = now + BARRIER_SYNC_TIMEOUT;
1603 while (*vlib_worker_threads->node_reforks_required > 0)
1605 if ((now = vlib_time_now (vm)) > deadline)
1607 fformat (stderr, "%s: worker thread refork deadlock\n",
1612 vlib_stat_segment_unlock ();
1615 t_closed_total = now - vm->barrier_epoch;
1617 minimum_open = t_closed_total * BARRIER_MINIMUM_OPEN_FACTOR;
1619 if (minimum_open > BARRIER_MINIMUM_OPEN_LIMIT)
1621 minimum_open = BARRIER_MINIMUM_OPEN_LIMIT;
1624 vm->barrier_no_close_before = now + minimum_open;
1626 /* Record barrier epoch (used to enforce minimum open time) */
1627 vm->barrier_epoch = now;
1629 barrier_trace_release (t_entry, t_closed_total, t_update_main);
1634 * Check the frame queue to see if any frames are available.
1635 * If so, pull the packets off the frames and put them to
1639 vlib_frame_queue_dequeue (vlib_main_t * vm, vlib_frame_queue_main_t * fqm)
1641 u32 thread_id = vm->thread_index;
1642 vlib_frame_queue_t *fq = fqm->vlib_frame_queues[thread_id];
1643 vlib_frame_queue_elt_t *elt;
1652 ASSERT (vm == vlib_mains[thread_id]);
1654 if (PREDICT_FALSE (fqm->node_index == ~0))
1657 * Gather trace data for frame queues
1659 if (PREDICT_FALSE (fq->trace))
1661 frame_queue_trace_t *fqt;
1662 frame_queue_nelt_counter_t *fqh;
1665 fqt = &fqm->frame_queue_traces[thread_id];
1667 fqt->nelts = fq->nelts;
1668 fqt->head = fq->head;
1669 fqt->head_hint = fq->head_hint;
1670 fqt->tail = fq->tail;
1671 fqt->threshold = fq->vector_threshold;
1672 fqt->n_in_use = fqt->tail - fqt->head;
1673 if (fqt->n_in_use >= fqt->nelts)
1675 // if beyond max then use max
1676 fqt->n_in_use = fqt->nelts - 1;
1679 /* Record the number of elements in use in the histogram */
1680 fqh = &fqm->frame_queue_histogram[thread_id];
1681 fqh->count[fqt->n_in_use]++;
1683 /* Record a snapshot of the elements in use */
1684 for (elix = 0; elix < fqt->nelts; elix++)
1686 elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1687 if (1 || elt->valid)
1689 fqt->n_vectors[elix] = elt->n_vectors;
1698 if (fq->head == fq->tail)
1700 fq->head_hint = fq->head;
1704 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1708 fq->head_hint = fq->head;
1712 from = elt->buffer_index;
1713 msg_type = elt->msg_type;
1715 ASSERT (msg_type == VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME);
1716 ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1718 f = vlib_get_frame_to_node (vm, fqm->node_index);
1720 /* If the first vector is traced, set the frame trace flag */
1721 b = vlib_get_buffer (vm, from[0]);
1722 if (b->flags & VLIB_BUFFER_IS_TRACED)
1723 f->frame_flags |= VLIB_NODE_FLAG_TRACE;
1725 to = vlib_frame_vector_args (f);
1727 n_left_to_node = elt->n_vectors;
1729 while (n_left_to_node >= 4)
1737 n_left_to_node -= 4;
1740 while (n_left_to_node > 0)
1748 vectors += elt->n_vectors;
1749 f->n_vectors = elt->n_vectors;
1750 vlib_put_frame_to_node (vm, fqm->node_index, f);
1754 elt->msg_type = 0xfefefefe;
1755 CLIB_MEMORY_BARRIER ();
1760 * Limit the number of packets pushed into the graph
1762 if (vectors >= fq->vector_threshold)
1764 fq->head_hint = fq->head;
1773 vlib_worker_thread_fn (void *arg)
1775 vlib_worker_thread_t *w = (vlib_worker_thread_t *) arg;
1776 vlib_thread_main_t *tm = vlib_get_thread_main ();
1777 vlib_main_t *vm = vlib_get_main ();
1780 ASSERT (vm->thread_index == vlib_get_thread_index ());
1782 vlib_worker_thread_init (w);
1783 clib_time_init (&vm->clib_time);
1784 clib_mem_set_heap (w->thread_mheap);
1786 e = vlib_call_init_exit_functions_no_sort
1787 (vm, &vm->worker_init_function_registrations, 1 /* call_once */ );
1789 clib_error_report (e);
1791 /* Wait until the dpdk init sequence is complete */
1792 while (tm->extern_thread_mgmt && tm->worker_thread_release == 0)
1793 vlib_worker_thread_barrier_check ();
1795 vlib_worker_loop (vm);
1799 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1802 .function = vlib_worker_thread_fn,
1807 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts)
1809 vlib_thread_main_t *tm = vlib_get_thread_main ();
1810 vlib_frame_queue_main_t *fqm;
1811 vlib_frame_queue_t *fq;
1815 if (frame_queue_nelts == 0)
1816 frame_queue_nelts = FRAME_QUEUE_MAX_NELTS;
1818 num_threads = 1 /* main thread */ + tm->n_threads;
1819 ASSERT (frame_queue_nelts >= 8 + num_threads);
1821 vec_add2 (tm->frame_queue_mains, fqm, 1);
1823 fqm->node_index = node_index;
1824 fqm->frame_queue_nelts = frame_queue_nelts;
1825 fqm->queue_hi_thresh = frame_queue_nelts - num_threads;
1827 vec_validate (fqm->vlib_frame_queues, tm->n_vlib_mains - 1);
1828 vec_validate (fqm->per_thread_data, tm->n_vlib_mains - 1);
1829 _vec_len (fqm->vlib_frame_queues) = 0;
1830 for (i = 0; i < tm->n_vlib_mains; i++)
1832 vlib_frame_queue_per_thread_data_t *ptd;
1833 fq = vlib_frame_queue_alloc (frame_queue_nelts);
1834 vec_add1 (fqm->vlib_frame_queues, fq);
1836 ptd = vec_elt_at_index (fqm->per_thread_data, i);
1837 vec_validate (ptd->handoff_queue_elt_by_thread_index,
1838 tm->n_vlib_mains - 1);
1839 vec_validate_init_empty (ptd->congested_handoff_queue_by_thread_index,
1840 tm->n_vlib_mains - 1,
1841 (vlib_frame_queue_t *) (~0));
1844 return (fqm - tm->frame_queue_mains);
1848 vlib_thread_cb_register (struct vlib_main_t *vm, vlib_thread_callbacks_t * cb)
1850 vlib_thread_main_t *tm = vlib_get_thread_main ();
1852 if (tm->extern_thread_mgmt)
1855 tm->cb.vlib_launch_thread_cb = cb->vlib_launch_thread_cb;
1856 tm->extern_thread_mgmt = 1;
1861 vlib_process_signal_event_mt_helper (vlib_process_signal_event_mt_args_t *
1864 ASSERT (vlib_get_thread_index () == 0);
1865 vlib_process_signal_event (vlib_get_main (), args->node_index,
1866 args->type_opaque, args->data);
1869 void *rpc_call_main_thread_cb_fn;
1872 vlib_rpc_call_main_thread (void *callback, u8 * args, u32 arg_size)
1874 if (rpc_call_main_thread_cb_fn)
1876 void (*fp) (void *, u8 *, u32) = rpc_call_main_thread_cb_fn;
1877 (*fp) (callback, args, arg_size);
1880 clib_warning ("BUG: rpc_call_main_thread_cb_fn NULL!");
1884 threads_init (vlib_main_t * vm)
1889 VLIB_INIT_FUNCTION (threads_init);
1892 static clib_error_t *
1893 show_clock_command_fn (vlib_main_t * vm,
1894 unformat_input_t * input, vlib_cli_command_t * cmd)
1898 clib_timebase_t _tb, *tb = &_tb;
1900 (void) unformat (input, "verbose %=", &verbose, 1);
1902 clib_timebase_init (tb, 0 /* GMT */ , CLIB_TIMEBASE_DAYLIGHT_NONE,
1905 vlib_cli_output (vm, "%U, %U GMT", format_clib_time, &vm->clib_time,
1906 verbose, format_clib_timebase_time,
1907 clib_timebase_now (tb));
1909 if (vec_len (vlib_mains) == 1)
1912 vlib_cli_output (vm, "Time last barrier release %.9f",
1913 vm->time_last_barrier_release);
1915 for (i = 1; i < vec_len (vlib_mains); i++)
1917 if (vlib_mains[i] == 0)
1920 vlib_cli_output (vm, "%d: %U", i, format_clib_time,
1921 &vlib_mains[i]->clib_time, verbose);
1923 vlib_cli_output (vm, "Thread %d offset %.9f error %.9f", i,
1924 vlib_mains[i]->time_offset,
1925 vm->time_last_barrier_release -
1926 vlib_mains[i]->time_last_barrier_release);
1932 VLIB_CLI_COMMAND (f_command, static) =
1934 .path = "show clock",
1935 .short_help = "show clock",
1936 .function = show_clock_command_fn,
1941 * fd.io coding-style-patch-verification: ON
1944 * eval: (c-set-style "gnu")