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 vlib_process_start_switch_stack (vlib_mains[__os_thread_index], 0);
585 rv = (void *) clib_calljmp
586 ((uword (*)(uword)) w->thread_function,
587 (uword) arg, w->thread_stack + VLIB_THREAD_STACK_SIZE);
588 /* NOTREACHED, we hope */
593 vlib_get_thread_core_numa (vlib_worker_thread_t * w, unsigned cpu_id)
595 const char *sys_cpu_path = "/sys/devices/system/cpu/cpu";
596 const char *sys_node_path = "/sys/devices/system/node/node";
597 clib_bitmap_t *nbmp = 0, *cbmp = 0;
600 int core_id = -1, numa_id = -1;
602 p = format (p, "%s%u/topology/core_id%c", sys_cpu_path, cpu_id, 0);
603 clib_sysfs_read ((char *) p, "%d", &core_id);
604 vec_reset_length (p);
607 clib_sysfs_read ("/sys/devices/system/node/online", "%U",
608 unformat_bitmap_list, &nbmp);
609 clib_bitmap_foreach (node, nbmp, ({
610 p = format (p, "%s%u/cpulist%c", sys_node_path, node, 0);
611 clib_sysfs_read ((char *) p, "%U", unformat_bitmap_list, &cbmp);
612 if (clib_bitmap_get (cbmp, cpu_id))
614 vec_reset_length (cbmp);
615 vec_reset_length (p);
622 w->core_id = core_id;
623 w->numa_id = numa_id;
626 static clib_error_t *
627 vlib_launch_thread_int (void *fp, vlib_worker_thread_t * w, unsigned cpu_id)
629 clib_mem_main_t *mm = &clib_mem_main;
630 vlib_thread_main_t *tm = &vlib_thread_main;
631 void *(*fp_arg) (void *) = fp;
635 vlib_get_thread_core_numa (w, cpu_id);
637 /* Set up NUMA-bound heap if indicated */
638 if (mm->per_numa_mheaps[w->numa_id] == 0)
640 /* If the user requested a NUMA heap, create it... */
641 if (tm->numa_heap_size)
643 numa_heap = clib_mem_init_thread_safe_numa
644 (0 /* DIY */ , tm->numa_heap_size, w->numa_id);
645 mm->per_numa_mheaps[w->numa_id] = numa_heap;
649 /* Or, use the main heap */
650 mm->per_numa_mheaps[w->numa_id] = w->thread_mheap;
654 if (tm->cb.vlib_launch_thread_cb && !w->registration->use_pthreads)
655 return tm->cb.vlib_launch_thread_cb (fp, (void *) w, cpu_id);
661 CPU_SET (cpu_id, &cpuset);
663 if (pthread_create (&worker, NULL /* attr */ , fp_arg, (void *) w))
664 return clib_error_return_unix (0, "pthread_create");
666 if (pthread_setaffinity_np (worker, sizeof (cpu_set_t), &cpuset))
667 return clib_error_return_unix (0, "pthread_setaffinity_np");
673 static clib_error_t *
674 start_workers (vlib_main_t * vm)
677 vlib_worker_thread_t *w;
678 vlib_main_t *vm_clone;
680 vlib_thread_main_t *tm = &vlib_thread_main;
681 vlib_thread_registration_t *tr;
682 vlib_node_runtime_t *rt;
683 u32 n_vlib_mains = tm->n_vlib_mains;
684 u32 worker_thread_index;
685 u8 *main_heap = clib_mem_get_per_cpu_heap ();
687 vec_reset_length (vlib_worker_threads);
689 /* Set up the main thread */
690 vec_add2_aligned (vlib_worker_threads, w, 1, CLIB_CACHE_LINE_BYTES);
691 w->elog_track.name = "main thread";
692 elog_track_register (&vm->elog_main, &w->elog_track);
694 if (vec_len (tm->thread_prefix))
696 w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
697 vlib_set_thread_name ((char *) w->name);
701 clib_mem_alloc_aligned (CLIB_CACHE_LINE_BYTES, CLIB_CACHE_LINE_BYTES);
702 vm->elog_main.lock[0] = 0;
704 clib_callback_data_init (&vm->vlib_node_runtime_perf_callbacks,
705 &vm->worker_thread_main_loop_callback_lock);
707 if (n_vlib_mains > 1)
709 /* Replace hand-crafted length-1 vector with a real vector */
712 vec_validate_aligned (vlib_mains, tm->n_vlib_mains - 1,
713 CLIB_CACHE_LINE_BYTES);
714 _vec_len (vlib_mains) = 0;
715 vec_add1_aligned (vlib_mains, vm, CLIB_CACHE_LINE_BYTES);
717 vlib_worker_threads->wait_at_barrier =
718 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
719 vlib_worker_threads->workers_at_barrier =
720 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
722 vlib_worker_threads->node_reforks_required =
723 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
725 /* We'll need the rpc vector lock... */
726 clib_spinlock_init (&vm->pending_rpc_lock);
728 /* Ask for an initial barrier sync */
729 *vlib_worker_threads->workers_at_barrier = 0;
730 *vlib_worker_threads->wait_at_barrier = 1;
732 /* Without update or refork */
733 *vlib_worker_threads->node_reforks_required = 0;
734 vm->need_vlib_worker_thread_node_runtime_update = 0;
737 vm->barrier_epoch = 0;
738 vm->barrier_no_close_before = 0;
740 worker_thread_index = 1;
741 clib_spinlock_init (&vm->worker_thread_main_loop_callback_lock);
743 for (i = 0; i < vec_len (tm->registrations); i++)
745 vlib_node_main_t *nm, *nm_clone;
748 tr = tm->registrations[i];
753 for (k = 0; k < tr->count; k++)
757 vec_add2 (vlib_worker_threads, w, 1);
758 /* Currently unused, may not really work */
760 w->thread_mheap = create_mspace (tr->mheap_size,
763 w->thread_mheap = main_heap;
766 vlib_thread_stack_init (w - vlib_worker_threads);
767 w->thread_function = tr->function;
768 w->thread_function_arg = w;
770 w->registration = tr;
773 (char *) format (0, "%s %d", tr->name, k + 1);
774 vec_add1 (w->elog_track.name, 0);
775 elog_track_register (&vm->elog_main, &w->elog_track);
777 if (tr->no_data_structure_clone)
780 /* Fork vlib_global_main et al. Look for bugs here */
781 oldheap = clib_mem_set_heap (w->thread_mheap);
783 vm_clone = clib_mem_alloc_aligned (sizeof (*vm_clone),
784 CLIB_CACHE_LINE_BYTES);
785 clib_memcpy (vm_clone, vlib_mains[0], sizeof (*vm_clone));
787 vm_clone->thread_index = worker_thread_index;
788 vm_clone->heap_base = w->thread_mheap;
789 vm_clone->heap_aligned_base = (void *)
790 (((uword) w->thread_mheap) & ~(VLIB_FRAME_ALIGN - 1));
791 vm_clone->init_functions_called =
792 hash_create (0, /* value bytes */ 0);
793 vm_clone->pending_rpc_requests = 0;
794 vec_validate (vm_clone->pending_rpc_requests, 0);
795 _vec_len (vm_clone->pending_rpc_requests) = 0;
796 clib_memset (&vm_clone->random_buffer, 0,
797 sizeof (vm_clone->random_buffer));
799 (&vm_clone->worker_thread_main_loop_callback_lock);
800 clib_callback_data_init
801 (&vm_clone->vlib_node_runtime_perf_callbacks,
802 &vm_clone->worker_thread_main_loop_callback_lock);
804 nm = &vlib_mains[0]->node_main;
805 nm_clone = &vm_clone->node_main;
806 /* fork next frames array, preserving node runtime indices */
807 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
808 CLIB_CACHE_LINE_BYTES);
809 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
811 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
812 u32 save_node_runtime_index;
815 save_node_runtime_index = nf->node_runtime_index;
816 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
817 vlib_next_frame_init (nf);
818 nf->node_runtime_index = save_node_runtime_index;
819 nf->flags = save_flags;
822 /* fork the frame dispatch queue */
823 nm_clone->pending_frames = 0;
824 vec_validate (nm_clone->pending_frames, 10);
825 _vec_len (nm_clone->pending_frames) = 0;
830 /* Allocate all nodes in single block for speed */
831 n = clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*n));
833 for (j = 0; j < vec_len (nm->nodes); j++)
835 clib_memcpy (n, nm->nodes[j], sizeof (*n));
836 /* none of the copied nodes have enqueue rights given out */
837 n->owner_node_index = VLIB_INVALID_NODE_INDEX;
838 clib_memset (&n->stats_total, 0, sizeof (n->stats_total));
839 clib_memset (&n->stats_last_clear, 0,
840 sizeof (n->stats_last_clear));
841 vec_add1 (nm_clone->nodes, n);
844 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
845 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
846 CLIB_CACHE_LINE_BYTES);
848 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
850 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
851 rt->thread_index = vm_clone->thread_index;
852 /* copy initial runtime_data from node */
853 if (n->runtime_data && n->runtime_data_bytes > 0)
854 clib_memcpy (rt->runtime_data, n->runtime_data,
855 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
856 n->runtime_data_bytes));
859 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
860 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
861 CLIB_CACHE_LINE_BYTES);
862 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
864 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
865 rt->thread_index = vm_clone->thread_index;
866 /* copy initial runtime_data from node */
867 if (n->runtime_data && n->runtime_data_bytes > 0)
868 clib_memcpy (rt->runtime_data, n->runtime_data,
869 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
870 n->runtime_data_bytes));
873 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
874 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
875 CLIB_CACHE_LINE_BYTES);
877 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
879 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
880 rt->thread_index = vm_clone->thread_index;
881 /* copy initial runtime_data from node */
882 if (n->runtime_data && n->runtime_data_bytes > 0)
883 clib_memcpy (rt->runtime_data, n->runtime_data,
884 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
885 n->runtime_data_bytes));
888 nm_clone->processes = vec_dup_aligned (nm->processes,
889 CLIB_CACHE_LINE_BYTES);
891 /* Create per-thread frame freelist */
892 nm_clone->frame_sizes = vec_new (vlib_frame_size_t, 1);
893 #ifdef VLIB_SUPPORTS_ARBITRARY_SCALAR_SIZES
894 nm_clone->frame_size_hash = hash_create (0, sizeof (uword));
896 nm_clone->node_by_error = nm->node_by_error;
898 /* Packet trace buffers are guaranteed to be empty, nothing to do here */
900 clib_mem_set_heap (oldheap);
901 vec_add1_aligned (vlib_mains, vm_clone, CLIB_CACHE_LINE_BYTES);
903 /* Switch to the stats segment ... */
904 void *oldheap = vlib_stats_push_heap (0);
905 vm_clone->error_main.counters = vec_dup_aligned
906 (vlib_mains[0]->error_main.counters, CLIB_CACHE_LINE_BYTES);
907 vlib_stats_pop_heap2 (vm_clone->error_main.counters,
908 worker_thread_index, oldheap, 1);
910 vm_clone->error_main.counters_last_clear = vec_dup_aligned
911 (vlib_mains[0]->error_main.counters_last_clear,
912 CLIB_CACHE_LINE_BYTES);
914 worker_thread_index++;
920 /* only have non-data-structure copy threads to create... */
921 for (i = 0; i < vec_len (tm->registrations); i++)
923 tr = tm->registrations[i];
925 for (j = 0; j < tr->count; j++)
927 vec_add2 (vlib_worker_threads, w, 1);
931 create_mspace (tr->mheap_size, 0 /* locked */ );
934 w->thread_mheap = main_heap;
936 vlib_thread_stack_init (w - vlib_worker_threads);
937 w->thread_function = tr->function;
938 w->thread_function_arg = w;
941 (char *) format (0, "%s %d", tr->name, j + 1);
942 w->registration = tr;
943 vec_add1 (w->elog_track.name, 0);
944 elog_track_register (&vm->elog_main, &w->elog_track);
949 worker_thread_index = 1;
951 for (i = 0; i < vec_len (tm->registrations); i++)
956 tr = tm->registrations[i];
958 if (tr->use_pthreads || tm->use_pthreads)
960 for (j = 0; j < tr->count; j++)
962 w = vlib_worker_threads + worker_thread_index++;
963 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
966 clib_error_report (err);
973 clib_bitmap_foreach (c, tr->coremask, ({
974 w = vlib_worker_threads + worker_thread_index++;
975 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
978 clib_error_report (err);
983 vlib_worker_thread_barrier_sync (vm);
984 vlib_worker_thread_barrier_release (vm);
988 VLIB_MAIN_LOOP_ENTER_FUNCTION (start_workers);
992 worker_thread_node_runtime_update_internal (void)
996 vlib_node_main_t *nm, *nm_clone;
997 vlib_main_t *vm_clone;
998 vlib_node_runtime_t *rt;
1000 vlib_node_runtime_sync_stats (vlib_main_t * vm,
1001 vlib_node_runtime_t * r,
1003 uword n_vectors, uword n_clocks);
1005 ASSERT (vlib_get_thread_index () == 0);
1008 nm = &vm->node_main;
1010 ASSERT (*vlib_worker_threads->wait_at_barrier == 1);
1013 * Scrape all runtime stats, so we don't lose node runtime(s) with
1014 * pending counts, or throw away worker / io thread counts.
1016 for (j = 0; j < vec_len (nm->nodes); j++)
1020 vlib_node_sync_stats (vm, n);
1023 for (i = 1; i < vec_len (vlib_mains); i++)
1027 vm_clone = vlib_mains[i];
1028 nm_clone = &vm_clone->node_main;
1030 for (j = 0; j < vec_len (nm_clone->nodes); j++)
1032 n = nm_clone->nodes[j];
1034 rt = vlib_node_get_runtime (vm_clone, n->index);
1035 vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
1039 /* Per-worker clone rebuilds are now done on each thread */
1044 vlib_worker_thread_node_refork (void)
1046 vlib_main_t *vm, *vm_clone;
1047 vlib_node_main_t *nm, *nm_clone;
1048 vlib_node_t **old_nodes_clone;
1049 vlib_node_runtime_t *rt, *old_rt;
1051 vlib_node_t *new_n_clone;
1056 nm = &vm->node_main;
1057 vm_clone = vlib_get_main ();
1058 nm_clone = &vm_clone->node_main;
1060 /* Re-clone error heap */
1061 u64 *old_counters = vm_clone->error_main.counters;
1062 u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
1064 clib_memcpy_fast (&vm_clone->error_main, &vm->error_main,
1065 sizeof (vm->error_main));
1066 j = vec_len (vm->error_main.counters) - 1;
1068 /* Switch to the stats segment ... */
1069 void *oldheap = vlib_stats_push_heap (0);
1070 vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
1071 vm_clone->error_main.counters = old_counters;
1072 vlib_stats_pop_heap2 (vm_clone->error_main.counters, vm_clone->thread_index,
1075 vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
1076 vm_clone->error_main.counters_last_clear = old_counters_all_clear;
1078 nm_clone = &vm_clone->node_main;
1079 vec_free (nm_clone->next_frames);
1080 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
1081 CLIB_CACHE_LINE_BYTES);
1083 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
1085 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
1086 u32 save_node_runtime_index;
1089 save_node_runtime_index = nf->node_runtime_index;
1090 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
1091 vlib_next_frame_init (nf);
1092 nf->node_runtime_index = save_node_runtime_index;
1093 nf->flags = save_flags;
1096 old_nodes_clone = nm_clone->nodes;
1097 nm_clone->nodes = 0;
1101 /* Allocate all nodes in single block for speed */
1103 clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*new_n_clone));
1104 for (j = 0; j < vec_len (nm->nodes); j++)
1106 vlib_node_t *new_n = nm->nodes[j];
1108 clib_memcpy_fast (new_n_clone, new_n, sizeof (*new_n));
1109 /* none of the copied nodes have enqueue rights given out */
1110 new_n_clone->owner_node_index = VLIB_INVALID_NODE_INDEX;
1112 if (j >= vec_len (old_nodes_clone))
1114 /* new node, set to zero */
1115 clib_memset (&new_n_clone->stats_total, 0,
1116 sizeof (new_n_clone->stats_total));
1117 clib_memset (&new_n_clone->stats_last_clear, 0,
1118 sizeof (new_n_clone->stats_last_clear));
1122 vlib_node_t *old_n_clone = old_nodes_clone[j];
1123 /* Copy stats if the old data is valid */
1124 clib_memcpy_fast (&new_n_clone->stats_total,
1125 &old_n_clone->stats_total,
1126 sizeof (new_n_clone->stats_total));
1127 clib_memcpy_fast (&new_n_clone->stats_last_clear,
1128 &old_n_clone->stats_last_clear,
1129 sizeof (new_n_clone->stats_last_clear));
1131 /* keep previous node state */
1132 new_n_clone->state = old_n_clone->state;
1134 vec_add1 (nm_clone->nodes, new_n_clone);
1137 /* Free the old node clones */
1138 clib_mem_free (old_nodes_clone[0]);
1140 vec_free (old_nodes_clone);
1143 /* re-clone internal nodes */
1144 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL];
1145 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
1146 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
1147 CLIB_CACHE_LINE_BYTES);
1149 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
1151 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1152 rt->thread_index = vm_clone->thread_index;
1153 /* copy runtime_data, will be overwritten later for existing rt */
1154 if (n->runtime_data && n->runtime_data_bytes > 0)
1155 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1156 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1157 n->runtime_data_bytes));
1160 for (j = 0; j < vec_len (old_rt); j++)
1162 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1163 rt->state = old_rt[j].state;
1164 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1165 VLIB_NODE_RUNTIME_DATA_SIZE);
1170 /* re-clone input nodes */
1171 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
1172 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
1173 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
1174 CLIB_CACHE_LINE_BYTES);
1176 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
1178 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1179 rt->thread_index = vm_clone->thread_index;
1180 /* copy runtime_data, will be overwritten later for existing rt */
1181 if (n->runtime_data && n->runtime_data_bytes > 0)
1182 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1183 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1184 n->runtime_data_bytes));
1187 for (j = 0; j < vec_len (old_rt); j++)
1189 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1190 rt->state = old_rt[j].state;
1191 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1192 VLIB_NODE_RUNTIME_DATA_SIZE);
1197 /* re-clone pre-input nodes */
1198 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT];
1199 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
1200 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
1201 CLIB_CACHE_LINE_BYTES);
1203 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
1205 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1206 rt->thread_index = vm_clone->thread_index;
1207 /* copy runtime_data, will be overwritten later for existing rt */
1208 if (n->runtime_data && n->runtime_data_bytes > 0)
1209 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1210 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1211 n->runtime_data_bytes));
1214 for (j = 0; j < vec_len (old_rt); j++)
1216 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1217 rt->state = old_rt[j].state;
1218 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1219 VLIB_NODE_RUNTIME_DATA_SIZE);
1224 nm_clone->processes = vec_dup_aligned (nm->processes,
1225 CLIB_CACHE_LINE_BYTES);
1226 nm_clone->node_by_error = nm->node_by_error;
1230 vlib_worker_thread_node_runtime_update (void)
1233 * Make a note that we need to do a node runtime update
1234 * prior to releasing the barrier.
1236 vlib_global_main.need_vlib_worker_thread_node_runtime_update = 1;
1240 unformat_sched_policy (unformat_input_t * input, va_list * args)
1242 u32 *r = va_arg (*args, u32 *);
1245 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
1246 foreach_sched_policy
1253 static clib_error_t *
1254 cpu_config (vlib_main_t * vm, unformat_input_t * input)
1256 vlib_thread_registration_t *tr;
1258 vlib_thread_main_t *tm = &vlib_thread_main;
1263 tm->thread_registrations_by_name = hash_create_string (0, sizeof (uword));
1265 tm->n_thread_stacks = 1; /* account for main thread */
1266 tm->sched_policy = ~0;
1267 tm->sched_priority = ~0;
1268 tm->main_lcore = ~0;
1274 hash_set_mem (tm->thread_registrations_by_name, tr->name, (uword) tr);
1278 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1280 if (unformat (input, "use-pthreads"))
1281 tm->use_pthreads = 1;
1282 else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1284 else if (unformat (input, "main-core %u", &tm->main_lcore))
1286 else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1288 else if (unformat (input, "numa-heap-size %U",
1289 unformat_memory_size, &tm->numa_heap_size))
1291 else if (unformat (input, "coremask-%s %U", &name,
1292 unformat_bitmap_mask, &bitmap) ||
1293 unformat (input, "corelist-%s %U", &name,
1294 unformat_bitmap_list, &bitmap))
1296 p = hash_get_mem (tm->thread_registrations_by_name, name);
1298 return clib_error_return (0, "no such thread type '%s'", name);
1300 tr = (vlib_thread_registration_t *) p[0];
1302 if (tr->use_pthreads)
1303 return clib_error_return (0,
1304 "corelist cannot be set for '%s' threads",
1307 return clib_error_return
1308 (0, "core placement of '%s' threads is already configured",
1311 tr->coremask = bitmap;
1312 tr->count = clib_bitmap_count_set_bits (tr->coremask);
1316 (input, "scheduler-policy %U", unformat_sched_policy,
1319 else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1321 else if (unformat (input, "%s %u", &name, &count))
1323 p = hash_get_mem (tm->thread_registrations_by_name, name);
1325 return clib_error_return (0, "no such thread type 3 '%s'", name);
1327 tr = (vlib_thread_registration_t *) p[0];
1329 if (tr->fixed_count)
1330 return clib_error_return
1331 (0, "number of '%s' threads not configurable", name);
1333 return clib_error_return
1334 (0, "number of '%s' threads is already configured", name);
1342 if (tm->sched_priority != ~0)
1344 if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1346 u32 prio_max = sched_get_priority_max (tm->sched_policy);
1347 u32 prio_min = sched_get_priority_min (tm->sched_policy);
1348 if (tm->sched_priority > prio_max)
1349 tm->sched_priority = prio_max;
1350 if (tm->sched_priority < prio_min)
1351 tm->sched_priority = prio_min;
1355 return clib_error_return
1357 "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1358 tm->sched_priority);
1363 if (!tm->thread_prefix)
1364 tm->thread_prefix = format (0, "vpp");
1368 tm->n_thread_stacks += tr->count;
1369 tm->n_pthreads += tr->count * tr->use_pthreads;
1370 tm->n_threads += tr->count * (tr->use_pthreads == 0);
1377 VLIB_EARLY_CONFIG_FUNCTION (cpu_config, "cpu");
1379 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1381 vnet_main_fixup (vlib_fork_fixup_t which)
1386 vlib_worker_thread_fork_fixup (vlib_fork_fixup_t which)
1388 vlib_main_t *vm = vlib_get_main ();
1390 if (vlib_mains == 0)
1393 ASSERT (vlib_get_thread_index () == 0);
1394 vlib_worker_thread_barrier_sync (vm);
1398 case VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX:
1399 vnet_main_fixup (VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX);
1405 vlib_worker_thread_barrier_release (vm);
1409 * Enforce minimum open time to minimize packet loss due to Rx overflow,
1410 * based on a test based heuristic that barrier should be open for at least
1411 * 3 time as long as it is closed (with an upper bound of 1ms because by that
1412 * point it is probably too late to make a difference)
1415 #ifndef BARRIER_MINIMUM_OPEN_LIMIT
1416 #define BARRIER_MINIMUM_OPEN_LIMIT 0.001
1419 #ifndef BARRIER_MINIMUM_OPEN_FACTOR
1420 #define BARRIER_MINIMUM_OPEN_FACTOR 3
1424 vlib_worker_thread_initial_barrier_sync_and_release (vlib_main_t * vm)
1427 f64 now = vlib_time_now (vm);
1428 u32 count = vec_len (vlib_mains) - 1;
1430 /* No worker threads? */
1434 deadline = now + BARRIER_SYNC_TIMEOUT;
1435 *vlib_worker_threads->wait_at_barrier = 1;
1436 while (*vlib_worker_threads->workers_at_barrier != count)
1438 if ((now = vlib_time_now (vm)) > deadline)
1440 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1445 *vlib_worker_threads->wait_at_barrier = 0;
1449 * Return true if the wroker thread barrier is held
1452 vlib_worker_thread_barrier_held (void)
1454 if (vec_len (vlib_mains) < 2)
1457 return (*vlib_worker_threads->wait_at_barrier == 1);
1461 vlib_worker_thread_barrier_sync_int (vlib_main_t * vm, const char *func_name)
1468 f64 max_vector_rate;
1472 if (vec_len (vlib_mains) < 2)
1475 ASSERT (vlib_get_thread_index () == 0);
1477 vlib_worker_threads[0].barrier_caller = func_name;
1478 count = vec_len (vlib_mains) - 1;
1480 /* Record entry relative to last close */
1481 now = vlib_time_now (vm);
1482 t_entry = now - vm->barrier_epoch;
1484 /* Tolerate recursive calls */
1485 if (++vlib_worker_threads[0].recursion_level > 1)
1487 barrier_trace_sync_rec (t_entry);
1491 if (PREDICT_FALSE (vec_len (vm->barrier_perf_callbacks) != 0))
1492 clib_call_callbacks (vm->barrier_perf_callbacks, vm,
1493 vm->clib_time.last_cpu_time, 0 /* enter */ );
1496 * Need data to decide if we're working hard enough to honor
1497 * the barrier hold-down timer.
1499 max_vector_rate = 0.0;
1500 for (i = 1; i < vec_len (vlib_mains); i++)
1502 clib_max (max_vector_rate,
1503 (f64) vlib_last_vectors_per_main_loop (vlib_mains[i]));
1505 vlib_worker_threads[0].barrier_sync_count++;
1507 /* Enforce minimum barrier open time to minimize packet loss */
1508 ASSERT (vm->barrier_no_close_before <= (now + BARRIER_MINIMUM_OPEN_LIMIT));
1511 * If any worker thread seems busy, which we define
1512 * as a vector rate above 10, we enforce the barrier hold-down timer
1514 if (max_vector_rate > 10.0)
1518 now = vlib_time_now (vm);
1519 /* Barrier hold-down timer expired? */
1520 if (now >= vm->barrier_no_close_before)
1522 if ((vm->barrier_no_close_before - now)
1523 > (2.0 * BARRIER_MINIMUM_OPEN_LIMIT))
1526 ("clock change: would have waited for %.4f seconds",
1527 (vm->barrier_no_close_before - now));
1532 /* Record time of closure */
1533 t_open = now - vm->barrier_epoch;
1534 vm->barrier_epoch = now;
1536 deadline = now + BARRIER_SYNC_TIMEOUT;
1538 *vlib_worker_threads->wait_at_barrier = 1;
1539 while (*vlib_worker_threads->workers_at_barrier != count)
1541 if ((now = vlib_time_now (vm)) > deadline)
1543 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1548 t_closed = now - vm->barrier_epoch;
1550 barrier_trace_sync (t_entry, t_open, t_closed);
1555 vlib_worker_thread_barrier_release (vlib_main_t * vm)
1562 f64 t_update_main = 0.0;
1563 int refork_needed = 0;
1565 if (vec_len (vlib_mains) < 2)
1568 ASSERT (vlib_get_thread_index () == 0);
1571 now = vlib_time_now (vm);
1572 t_entry = now - vm->barrier_epoch;
1574 if (--vlib_worker_threads[0].recursion_level > 0)
1576 barrier_trace_release_rec (t_entry);
1580 /* Update (all) node runtimes before releasing the barrier, if needed */
1581 if (vm->need_vlib_worker_thread_node_runtime_update)
1584 * Lock stat segment here, so we's safe when
1585 * rebuilding the stat segment node clones from the
1588 vlib_stat_segment_lock ();
1590 /* Do stats elements on main thread */
1591 worker_thread_node_runtime_update_internal ();
1592 vm->need_vlib_worker_thread_node_runtime_update = 0;
1594 /* Do per thread rebuilds in parallel */
1596 clib_atomic_fetch_add (vlib_worker_threads->node_reforks_required,
1597 (vec_len (vlib_mains) - 1));
1598 now = vlib_time_now (vm);
1599 t_update_main = now - vm->barrier_epoch;
1602 deadline = now + BARRIER_SYNC_TIMEOUT;
1605 * Note when we let go of the barrier.
1606 * Workers can use this to derive a reasonably accurate
1607 * time offset. See vlib_time_now(...)
1609 vm->time_last_barrier_release = vlib_time_now (vm);
1610 CLIB_MEMORY_STORE_BARRIER ();
1612 *vlib_worker_threads->wait_at_barrier = 0;
1614 while (*vlib_worker_threads->workers_at_barrier > 0)
1616 if ((now = vlib_time_now (vm)) > deadline)
1618 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1623 /* Wait for reforks before continuing */
1626 now = vlib_time_now (vm);
1628 deadline = now + BARRIER_SYNC_TIMEOUT;
1630 while (*vlib_worker_threads->node_reforks_required > 0)
1632 if ((now = vlib_time_now (vm)) > deadline)
1634 fformat (stderr, "%s: worker thread refork deadlock\n",
1639 vlib_stat_segment_unlock ();
1642 t_closed_total = now - vm->barrier_epoch;
1644 minimum_open = t_closed_total * BARRIER_MINIMUM_OPEN_FACTOR;
1646 if (minimum_open > BARRIER_MINIMUM_OPEN_LIMIT)
1648 minimum_open = BARRIER_MINIMUM_OPEN_LIMIT;
1651 vm->barrier_no_close_before = now + minimum_open;
1653 /* Record barrier epoch (used to enforce minimum open time) */
1654 vm->barrier_epoch = now;
1656 barrier_trace_release (t_entry, t_closed_total, t_update_main);
1658 if (PREDICT_FALSE (vec_len (vm->barrier_perf_callbacks) != 0))
1659 clib_call_callbacks (vm->barrier_perf_callbacks, vm,
1660 vm->clib_time.last_cpu_time, 1 /* leave */ );
1664 * Wait until each of the workers has been once around the track
1667 vlib_worker_wait_one_loop (void)
1669 ASSERT (vlib_get_thread_index () == 0);
1671 if (vec_len (vlib_mains) < 2)
1674 if (vlib_worker_thread_barrier_held ())
1680 vec_validate (counts, vec_len (vlib_mains) - 1);
1682 /* record the current loop counts */
1683 vec_foreach_index (ii, vlib_mains)
1684 counts[ii] = vlib_mains[ii]->main_loop_count;
1686 /* spin until each changes, apart from the main thread, or we'd be
1688 for (ii = 1; ii < vec_len (counts); ii++)
1690 while (counts[ii] == vlib_mains[ii]->main_loop_count)
1699 * Check the frame queue to see if any frames are available.
1700 * If so, pull the packets off the frames and put them to
1704 vlib_frame_queue_dequeue (vlib_main_t * vm, vlib_frame_queue_main_t * fqm)
1706 u32 thread_id = vm->thread_index;
1707 vlib_frame_queue_t *fq = fqm->vlib_frame_queues[thread_id];
1708 vlib_frame_queue_elt_t *elt;
1717 ASSERT (vm == vlib_mains[thread_id]);
1719 if (PREDICT_FALSE (fqm->node_index == ~0))
1722 * Gather trace data for frame queues
1724 if (PREDICT_FALSE (fq->trace))
1726 frame_queue_trace_t *fqt;
1727 frame_queue_nelt_counter_t *fqh;
1730 fqt = &fqm->frame_queue_traces[thread_id];
1732 fqt->nelts = fq->nelts;
1733 fqt->head = fq->head;
1734 fqt->head_hint = fq->head_hint;
1735 fqt->tail = fq->tail;
1736 fqt->threshold = fq->vector_threshold;
1737 fqt->n_in_use = fqt->tail - fqt->head;
1738 if (fqt->n_in_use >= fqt->nelts)
1740 // if beyond max then use max
1741 fqt->n_in_use = fqt->nelts - 1;
1744 /* Record the number of elements in use in the histogram */
1745 fqh = &fqm->frame_queue_histogram[thread_id];
1746 fqh->count[fqt->n_in_use]++;
1748 /* Record a snapshot of the elements in use */
1749 for (elix = 0; elix < fqt->nelts; elix++)
1751 elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1752 if (1 || elt->valid)
1754 fqt->n_vectors[elix] = elt->n_vectors;
1763 if (fq->head == fq->tail)
1765 fq->head_hint = fq->head;
1769 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1773 fq->head_hint = fq->head;
1777 from = elt->buffer_index;
1778 msg_type = elt->msg_type;
1780 ASSERT (msg_type == VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME);
1781 ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1783 f = vlib_get_frame_to_node (vm, fqm->node_index);
1785 /* If the first vector is traced, set the frame trace flag */
1786 b = vlib_get_buffer (vm, from[0]);
1787 if (b->flags & VLIB_BUFFER_IS_TRACED)
1788 f->frame_flags |= VLIB_NODE_FLAG_TRACE;
1790 to = vlib_frame_vector_args (f);
1792 n_left_to_node = elt->n_vectors;
1794 while (n_left_to_node >= 4)
1802 n_left_to_node -= 4;
1805 while (n_left_to_node > 0)
1813 vectors += elt->n_vectors;
1814 f->n_vectors = elt->n_vectors;
1815 vlib_put_frame_to_node (vm, fqm->node_index, f);
1819 elt->msg_type = 0xfefefefe;
1820 CLIB_MEMORY_BARRIER ();
1825 * Limit the number of packets pushed into the graph
1827 if (vectors >= fq->vector_threshold)
1829 fq->head_hint = fq->head;
1838 vlib_worker_thread_fn (void *arg)
1840 vlib_worker_thread_t *w = (vlib_worker_thread_t *) arg;
1841 vlib_thread_main_t *tm = vlib_get_thread_main ();
1842 vlib_main_t *vm = vlib_get_main ();
1845 vlib_process_finish_switch_stack (vm);
1847 ASSERT (vm->thread_index == vlib_get_thread_index ());
1849 vlib_worker_thread_init (w);
1850 clib_time_init (&vm->clib_time);
1851 clib_mem_set_heap (w->thread_mheap);
1853 e = vlib_call_init_exit_functions_no_sort
1854 (vm, &vm->worker_init_function_registrations, 1 /* call_once */ );
1856 clib_error_report (e);
1858 /* Wait until the dpdk init sequence is complete */
1859 while (tm->extern_thread_mgmt && tm->worker_thread_release == 0)
1860 vlib_worker_thread_barrier_check ();
1862 vlib_worker_loop (vm);
1866 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1869 .function = vlib_worker_thread_fn,
1874 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts)
1876 vlib_thread_main_t *tm = vlib_get_thread_main ();
1877 vlib_frame_queue_main_t *fqm;
1878 vlib_frame_queue_t *fq;
1882 if (frame_queue_nelts == 0)
1883 frame_queue_nelts = FRAME_QUEUE_MAX_NELTS;
1885 num_threads = 1 /* main thread */ + tm->n_threads;
1886 ASSERT (frame_queue_nelts >= 8 + num_threads);
1888 vec_add2 (tm->frame_queue_mains, fqm, 1);
1890 fqm->node_index = node_index;
1891 fqm->frame_queue_nelts = frame_queue_nelts;
1892 fqm->queue_hi_thresh = frame_queue_nelts - num_threads;
1894 vec_validate (fqm->vlib_frame_queues, tm->n_vlib_mains - 1);
1895 vec_validate (fqm->per_thread_data, tm->n_vlib_mains - 1);
1896 _vec_len (fqm->vlib_frame_queues) = 0;
1897 for (i = 0; i < tm->n_vlib_mains; i++)
1899 vlib_frame_queue_per_thread_data_t *ptd;
1900 fq = vlib_frame_queue_alloc (frame_queue_nelts);
1901 vec_add1 (fqm->vlib_frame_queues, fq);
1903 ptd = vec_elt_at_index (fqm->per_thread_data, i);
1904 vec_validate (ptd->handoff_queue_elt_by_thread_index,
1905 tm->n_vlib_mains - 1);
1906 vec_validate_init_empty (ptd->congested_handoff_queue_by_thread_index,
1907 tm->n_vlib_mains - 1,
1908 (vlib_frame_queue_t *) (~0));
1911 return (fqm - tm->frame_queue_mains);
1915 vlib_thread_cb_register (struct vlib_main_t *vm, vlib_thread_callbacks_t * cb)
1917 vlib_thread_main_t *tm = vlib_get_thread_main ();
1919 if (tm->extern_thread_mgmt)
1922 tm->cb.vlib_launch_thread_cb = cb->vlib_launch_thread_cb;
1923 tm->extern_thread_mgmt = 1;
1928 vlib_process_signal_event_mt_helper (vlib_process_signal_event_mt_args_t *
1931 ASSERT (vlib_get_thread_index () == 0);
1932 vlib_process_signal_event (vlib_get_main (), args->node_index,
1933 args->type_opaque, args->data);
1936 void *rpc_call_main_thread_cb_fn;
1939 vlib_rpc_call_main_thread (void *callback, u8 * args, u32 arg_size)
1941 if (rpc_call_main_thread_cb_fn)
1943 void (*fp) (void *, u8 *, u32) = rpc_call_main_thread_cb_fn;
1944 (*fp) (callback, args, arg_size);
1947 clib_warning ("BUG: rpc_call_main_thread_cb_fn NULL!");
1951 threads_init (vlib_main_t * vm)
1956 VLIB_INIT_FUNCTION (threads_init);
1959 static clib_error_t *
1960 show_clock_command_fn (vlib_main_t * vm,
1961 unformat_input_t * input, vlib_cli_command_t * cmd)
1965 clib_timebase_t _tb, *tb = &_tb;
1967 (void) unformat (input, "verbose %=", &verbose, 1);
1969 clib_timebase_init (tb, 0 /* GMT */ , CLIB_TIMEBASE_DAYLIGHT_NONE,
1972 vlib_cli_output (vm, "%U, %U GMT", format_clib_time, &vm->clib_time,
1973 verbose, format_clib_timebase_time,
1974 clib_timebase_now (tb));
1976 if (vec_len (vlib_mains) == 1)
1979 vlib_cli_output (vm, "Time last barrier release %.9f",
1980 vm->time_last_barrier_release);
1982 for (i = 1; i < vec_len (vlib_mains); i++)
1984 if (vlib_mains[i] == 0)
1987 vlib_cli_output (vm, "%d: %U", i, format_clib_time,
1988 &vlib_mains[i]->clib_time, verbose);
1990 vlib_cli_output (vm, "Thread %d offset %.9f error %.9f", i,
1991 vlib_mains[i]->time_offset,
1992 vm->time_last_barrier_release -
1993 vlib_mains[i]->time_last_barrier_release);
1999 VLIB_CLI_COMMAND (f_command, static) =
2001 .path = "show clock",
2002 .short_help = "show clock",
2003 .function = show_clock_command_fn,
2008 * fd.io coding-style-patch-verification: ON
2011 * eval: (c-set-style "gnu")