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/linux/sysfs.h>
21 #include <vlib/vlib.h>
23 #include <vlib/threads.h>
24 #include <vlib/unix/cj.h>
26 #include <vlib/stat_weak_inlines.h>
28 DECLARE_CJ_GLOBAL_LOG;
37 vlib_worker_thread_t *vlib_worker_threads;
38 vlib_thread_main_t vlib_thread_main;
41 * Barrier tracing can be enabled on a normal build to collect information
42 * on barrier use, including timings and call stacks. Deliberately not
43 * keyed off CLIB_DEBUG, because that can add significant overhead which
44 * imapacts observed timings.
48 barrier_trace_sync (f64 t_entry, f64 t_open, f64 t_closed)
50 if (!vlib_worker_threads->barrier_elog_enabled)
54 ELOG_TYPE_DECLARE (e) =
56 .format = "bar-trace-%s-#%d",
57 .format_args = "T4i4",
62 u32 caller, count, t_entry, t_open, t_closed;
65 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
66 ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
67 ed->caller = elog_string (&vlib_global_main.elog_main,
68 (char *) vlib_worker_threads[0].barrier_caller);
69 ed->t_entry = (int) (1000000.0 * t_entry);
70 ed->t_open = (int) (1000000.0 * t_open);
71 ed->t_closed = (int) (1000000.0 * t_closed);
75 barrier_trace_sync_rec (f64 t_entry)
77 if (!vlib_worker_threads->barrier_elog_enabled)
81 ELOG_TYPE_DECLARE (e) =
83 .format = "bar-syncrec-%s-#%d",
84 .format_args = "T4i4",
92 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
93 ed->depth = (int) vlib_worker_threads[0].recursion_level - 1;
94 ed->caller = elog_string (&vlib_global_main.elog_main,
95 (char *) vlib_worker_threads[0].barrier_caller);
99 barrier_trace_release_rec (f64 t_entry)
101 if (!vlib_worker_threads->barrier_elog_enabled)
105 ELOG_TYPE_DECLARE (e) =
107 .format = "bar-relrrec-#%d",
116 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
117 ed->depth = (int) vlib_worker_threads[0].recursion_level;
121 barrier_trace_release (f64 t_entry, f64 t_closed_total, f64 t_update_main)
123 if (!vlib_worker_threads->barrier_elog_enabled)
127 ELOG_TYPE_DECLARE (e) =
129 .format = "bar-rel-#%d-e%d-u%d-t%d",
130 .format_args = "i4i4i4i4",
135 u32 count, t_entry, t_update_main, t_closed_total;
138 ed = ELOG_DATA (&vlib_global_main.elog_main, e);
139 ed->t_entry = (int) (1000000.0 * t_entry);
140 ed->t_update_main = (int) (1000000.0 * t_update_main);
141 ed->t_closed_total = (int) (1000000.0 * t_closed_total);
142 ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
144 /* Reset context for next trace */
145 vlib_worker_threads[0].barrier_context = NULL;
149 os_get_nthreads (void)
151 return vec_len (vlib_thread_stacks);
155 vlib_set_thread_name (char *name)
157 int pthread_setname_np (pthread_t __target_thread, const char *__name);
159 pthread_t thread = pthread_self ();
163 rv = pthread_setname_np (thread, name);
165 clib_warning ("pthread_setname_np returned %d", rv);
170 sort_registrations_by_no_clone (void *a0, void *a1)
172 vlib_thread_registration_t **tr0 = a0;
173 vlib_thread_registration_t **tr1 = a1;
175 return ((i32) ((*tr0)->no_data_structure_clone)
176 - ((i32) ((*tr1)->no_data_structure_clone)));
180 clib_sysfs_list_to_bitmap (char *filename)
185 fp = fopen (filename, "r");
190 vec_validate (buffer, 256 - 1);
191 if (fgets ((char *) buffer, 256, fp))
194 unformat_init_string (&in, (char *) buffer,
195 strlen ((char *) buffer));
196 if (unformat (&in, "%U", unformat_bitmap_list, &r) != 1)
197 clib_warning ("unformat_bitmap_list failed");
207 /* Called early in the init sequence */
210 vlib_thread_init (vlib_main_t * vm)
212 vlib_thread_main_t *tm = &vlib_thread_main;
213 vlib_worker_thread_t *w;
214 vlib_thread_registration_t *tr;
215 u32 n_vlib_mains = 1;
220 /* get bitmaps of active cpu cores and sockets */
221 tm->cpu_core_bitmap =
222 clib_sysfs_list_to_bitmap ("/sys/devices/system/cpu/online");
223 tm->cpu_socket_bitmap =
224 clib_sysfs_list_to_bitmap ("/sys/devices/system/node/online");
226 avail_cpu = clib_bitmap_dup (tm->cpu_core_bitmap);
229 for (i = 0; i < tm->skip_cores; i++)
231 uword c = clib_bitmap_first_set (avail_cpu);
233 return clib_error_return (0, "no available cpus to skip");
235 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
238 /* grab cpu for main thread */
239 if (tm->main_lcore == ~0)
241 /* if main-lcore is not set, we try to use lcore 1 */
242 if (clib_bitmap_get (avail_cpu, 1))
245 tm->main_lcore = clib_bitmap_first_set (avail_cpu);
246 if (tm->main_lcore == (u8) ~ 0)
247 return clib_error_return (0, "no available cpus to be used for the"
252 if (clib_bitmap_get (avail_cpu, tm->main_lcore) == 0)
253 return clib_error_return (0, "cpu %u is not available to be used"
254 " for the main thread", tm->main_lcore);
256 avail_cpu = clib_bitmap_set (avail_cpu, tm->main_lcore, 0);
258 /* assume that there is socket 0 only if there is no data from sysfs */
259 if (!tm->cpu_socket_bitmap)
260 tm->cpu_socket_bitmap = clib_bitmap_set (0, 0, 1);
262 /* pin main thread to main_lcore */
263 if (tm->cb.vlib_thread_set_lcore_cb)
265 tm->cb.vlib_thread_set_lcore_cb (0, tm->main_lcore);
271 CPU_SET (tm->main_lcore, &cpuset);
272 pthread_setaffinity_np (pthread_self (), sizeof (cpu_set_t), &cpuset);
275 /* Set up thread 0 */
276 vec_validate_aligned (vlib_worker_threads, 0, CLIB_CACHE_LINE_BYTES);
277 _vec_len (vlib_worker_threads) = 1;
278 w = vlib_worker_threads;
279 w->thread_mheap = clib_mem_get_heap ();
280 w->thread_stack = vlib_thread_stacks[0];
281 w->cpu_id = tm->main_lcore;
282 w->lwp = syscall (SYS_gettid);
283 w->thread_id = pthread_self ();
284 tm->n_vlib_mains = 1;
286 if (tm->sched_policy != ~0)
288 struct sched_param sched_param;
289 if (!sched_getparam (w->lwp, &sched_param))
291 if (tm->sched_priority != ~0)
292 sched_param.sched_priority = tm->sched_priority;
293 sched_setscheduler (w->lwp, tm->sched_policy, &sched_param);
297 /* assign threads to cores and set n_vlib_mains */
302 vec_add1 (tm->registrations, tr);
306 vec_sort_with_function (tm->registrations, sort_registrations_by_no_clone);
308 for (i = 0; i < vec_len (tm->registrations); i++)
311 tr = tm->registrations[i];
312 tr->first_index = first_index;
313 first_index += tr->count;
314 n_vlib_mains += (tr->no_data_structure_clone == 0) ? tr->count : 0;
316 /* construct coremask */
317 if (tr->use_pthreads || !tr->count)
324 clib_bitmap_foreach (c, tr->coremask, ({
325 if (clib_bitmap_get(avail_cpu, c) == 0)
326 return clib_error_return (0, "cpu %u is not available to be used"
327 " for the '%s' thread",c, tr->name);
329 avail_cpu = clib_bitmap_set(avail_cpu, c, 0);
335 for (j = 0; j < tr->count; j++)
337 uword c = clib_bitmap_first_set (avail_cpu);
339 return clib_error_return (0,
340 "no available cpus to be used for"
341 " the '%s' thread", tr->name);
343 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
344 tr->coremask = clib_bitmap_set (tr->coremask, c, 1);
349 clib_bitmap_free (avail_cpu);
351 tm->n_vlib_mains = n_vlib_mains;
354 * Allocate the remaining worker threads, and thread stack vector slots
355 * from now on, calls to os_get_nthreads() will return the correct
358 vec_validate_aligned (vlib_worker_threads, first_index - 1,
359 CLIB_CACHE_LINE_BYTES);
360 vec_validate (vlib_thread_stacks, vec_len (vlib_worker_threads) - 1);
365 vlib_frame_queue_alloc (int nelts)
367 vlib_frame_queue_t *fq;
369 fq = clib_mem_alloc_aligned (sizeof (*fq), CLIB_CACHE_LINE_BYTES);
370 clib_memset (fq, 0, sizeof (*fq));
372 fq->vector_threshold = 128; // packets
373 vec_validate_aligned (fq->elts, nelts - 1, CLIB_CACHE_LINE_BYTES);
377 if (((uword) & fq->tail) & (CLIB_CACHE_LINE_BYTES - 1))
378 fformat (stderr, "WARNING: fq->tail unaligned\n");
379 if (((uword) & fq->head) & (CLIB_CACHE_LINE_BYTES - 1))
380 fformat (stderr, "WARNING: fq->head unaligned\n");
381 if (((uword) fq->elts) & (CLIB_CACHE_LINE_BYTES - 1))
382 fformat (stderr, "WARNING: fq->elts unaligned\n");
384 if (sizeof (fq->elts[0]) % CLIB_CACHE_LINE_BYTES)
385 fformat (stderr, "WARNING: fq->elts[0] size %d\n",
386 sizeof (fq->elts[0]));
387 if (nelts & (nelts - 1))
389 fformat (stderr, "FATAL: nelts MUST be a power of 2\n");
397 void vl_msg_api_handler_no_free (void *) __attribute__ ((weak));
399 vl_msg_api_handler_no_free (void *v)
403 /* Turned off, save as reference material... */
406 vlib_frame_queue_dequeue_internal (int thread_id,
407 vlib_main_t * vm, vlib_node_main_t * nm)
409 vlib_frame_queue_t *fq = vlib_frame_queues[thread_id];
410 vlib_frame_queue_elt_t *elt;
412 vlib_pending_frame_t *p;
413 vlib_node_runtime_t *r;
414 u32 node_runtime_index;
419 ASSERT (vm == vlib_mains[thread_id]);
423 if (fq->head == fq->tail)
426 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
431 before = clib_cpu_time_now ();
434 node_runtime_index = elt->node_runtime_index;
435 msg_type = elt->msg_type;
439 case VLIB_FRAME_QUEUE_ELT_FREE_BUFFERS:
440 vlib_buffer_free (vm, vlib_frame_vector_args (f), f->n_vectors);
441 /* note fallthrough... */
442 case VLIB_FRAME_QUEUE_ELT_FREE_FRAME:
443 r = vec_elt_at_index (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
445 vlib_frame_free (vm, r, f);
447 case VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME:
448 vec_add2 (vm->node_main.pending_frames, p, 1);
449 f->flags |= (VLIB_FRAME_PENDING | VLIB_FRAME_FREE_AFTER_DISPATCH);
450 p->node_runtime_index = elt->node_runtime_index;
451 p->frame_index = vlib_frame_index (vm, f);
452 p->next_frame_index = VLIB_PENDING_FRAME_NO_NEXT_FRAME;
453 fq->dequeue_vectors += (u64) f->n_vectors;
455 case VLIB_FRAME_QUEUE_ELT_API_MSG:
456 vl_msg_api_handler_no_free (f);
459 clib_warning ("bogus frame queue message, type %d", msg_type);
464 fq->dequeue_ticks += clib_cpu_time_now () - before;
465 CLIB_MEMORY_BARRIER ();
474 vlib_frame_queue_dequeue (int thread_id,
475 vlib_main_t * vm, vlib_node_main_t * nm)
477 return vlib_frame_queue_dequeue_internal (thread_id, vm, nm);
481 vlib_frame_queue_enqueue (vlib_main_t * vm, u32 node_runtime_index,
482 u32 frame_queue_index, vlib_frame_t * frame,
483 vlib_frame_queue_msg_type_t type)
485 vlib_frame_queue_t *fq = vlib_frame_queues[frame_queue_index];
486 vlib_frame_queue_elt_t *elt;
489 u64 before = clib_cpu_time_now ();
493 new_tail = clib_atomic_add_fetch (&fq->tail, 1);
495 /* Wait until a ring slot is available */
496 while (new_tail >= fq->head + fq->nelts)
498 f64 b4 = vlib_time_now_ticks (vm, before);
499 vlib_worker_thread_barrier_check (vm, b4);
500 /* Bad idea. Dequeue -> enqueue -> dequeue -> trouble */
501 // vlib_frame_queue_dequeue (vm->thread_index, vm, nm);
504 elt = fq->elts + (new_tail & (fq->nelts - 1));
506 /* this would be very bad... */
511 /* Once we enqueue the frame, frame->n_vectors is owned elsewhere... */
512 save_count = frame->n_vectors;
515 elt->node_runtime_index = node_runtime_index;
516 elt->msg_type = type;
517 CLIB_MEMORY_BARRIER ();
524 /* To be called by vlib worker threads upon startup */
526 vlib_worker_thread_init (vlib_worker_thread_t * w)
528 vlib_thread_main_t *tm = vlib_get_thread_main ();
531 * Note: disabling signals in worker threads as follows
532 * prevents the api post-mortem dump scheme from working
536 * pthread_sigmask (SIG_SETMASK, &s, 0);
540 clib_mem_set_heap (w->thread_mheap);
542 if (vec_len (tm->thread_prefix) && w->registration->short_name)
544 w->name = format (0, "%v_%s_%d%c", tm->thread_prefix,
545 w->registration->short_name, w->instance_id, '\0');
546 vlib_set_thread_name ((char *) w->name);
549 if (!w->registration->use_pthreads)
552 /* Initial barrier sync, for both worker and i/o threads */
553 clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, 1);
555 while (*vlib_worker_threads->wait_at_barrier)
558 clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, -1);
563 vlib_worker_thread_bootstrap_fn (void *arg)
566 vlib_worker_thread_t *w = arg;
568 w->lwp = syscall (SYS_gettid);
569 w->thread_id = pthread_self ();
571 __os_thread_index = w - vlib_worker_threads;
573 rv = (void *) clib_calljmp
574 ((uword (*)(uword)) w->thread_function,
575 (uword) arg, w->thread_stack + VLIB_THREAD_STACK_SIZE);
576 /* NOTREACHED, we hope */
581 vlib_get_thread_core_socket (vlib_worker_thread_t * w, unsigned cpu_id)
583 const char *sys_cpu_path = "/sys/devices/system/cpu/cpu";
585 int core_id = -1, socket_id = -1;
587 p = format (p, "%s%u/topology/core_id%c", sys_cpu_path, cpu_id, 0);
588 clib_sysfs_read ((char *) p, "%d", &core_id);
589 vec_reset_length (p);
591 format (p, "%s%u/topology/physical_package_id%c", sys_cpu_path, cpu_id,
593 clib_sysfs_read ((char *) p, "%d", &socket_id);
596 w->core_id = core_id;
597 w->socket_id = socket_id;
600 static clib_error_t *
601 vlib_launch_thread_int (void *fp, vlib_worker_thread_t * w, unsigned cpu_id)
603 vlib_thread_main_t *tm = &vlib_thread_main;
604 void *(*fp_arg) (void *) = fp;
607 vlib_get_thread_core_socket (w, cpu_id);
608 if (tm->cb.vlib_launch_thread_cb && !w->registration->use_pthreads)
609 return tm->cb.vlib_launch_thread_cb (fp, (void *) w, cpu_id);
615 CPU_SET (cpu_id, &cpuset);
617 if (pthread_create (&worker, NULL /* attr */ , fp_arg, (void *) w))
618 return clib_error_return_unix (0, "pthread_create");
620 if (pthread_setaffinity_np (worker, sizeof (cpu_set_t), &cpuset))
621 return clib_error_return_unix (0, "pthread_setaffinity_np");
627 static clib_error_t *
628 start_workers (vlib_main_t * vm)
631 vlib_worker_thread_t *w;
632 vlib_main_t *vm_clone;
634 vlib_thread_main_t *tm = &vlib_thread_main;
635 vlib_thread_registration_t *tr;
636 vlib_node_runtime_t *rt;
637 u32 n_vlib_mains = tm->n_vlib_mains;
638 u32 worker_thread_index;
639 u8 *main_heap = clib_mem_get_per_cpu_heap ();
641 vec_reset_length (vlib_worker_threads);
643 /* Set up the main thread */
644 vec_add2_aligned (vlib_worker_threads, w, 1, CLIB_CACHE_LINE_BYTES);
645 w->elog_track.name = "main thread";
646 elog_track_register (&vm->elog_main, &w->elog_track);
648 if (vec_len (tm->thread_prefix))
650 w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
651 vlib_set_thread_name ((char *) w->name);
655 clib_mem_alloc_aligned (CLIB_CACHE_LINE_BYTES, CLIB_CACHE_LINE_BYTES);
656 vm->elog_main.lock[0] = 0;
658 if (n_vlib_mains > 1)
660 /* Replace hand-crafted length-1 vector with a real vector */
663 vec_validate_aligned (vlib_mains, tm->n_vlib_mains - 1,
664 CLIB_CACHE_LINE_BYTES);
665 _vec_len (vlib_mains) = 0;
666 vec_add1_aligned (vlib_mains, vm, CLIB_CACHE_LINE_BYTES);
668 vlib_worker_threads->wait_at_barrier =
669 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
670 vlib_worker_threads->workers_at_barrier =
671 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
673 vlib_worker_threads->node_reforks_required =
674 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
676 /* We'll need the rpc vector lock... */
677 clib_spinlock_init (&vm->pending_rpc_lock);
679 /* Ask for an initial barrier sync */
680 *vlib_worker_threads->workers_at_barrier = 0;
681 *vlib_worker_threads->wait_at_barrier = 1;
683 /* Without update or refork */
684 *vlib_worker_threads->node_reforks_required = 0;
685 vm->need_vlib_worker_thread_node_runtime_update = 0;
688 vm->barrier_epoch = 0;
689 vm->barrier_no_close_before = 0;
691 worker_thread_index = 1;
693 for (i = 0; i < vec_len (tm->registrations); i++)
695 vlib_node_main_t *nm, *nm_clone;
698 tr = tm->registrations[i];
703 for (k = 0; k < tr->count; k++)
707 vec_add2 (vlib_worker_threads, w, 1);
708 /* Currently unused, may not really work */
711 #if USE_DLMALLOC == 0
713 mheap_alloc (0 /* use VM */ , tr->mheap_size);
715 w->thread_mheap = create_mspace (tr->mheap_size,
720 w->thread_mheap = main_heap;
723 vlib_thread_stack_init (w - vlib_worker_threads);
724 w->thread_function = tr->function;
725 w->thread_function_arg = w;
727 w->registration = tr;
730 (char *) format (0, "%s %d", tr->name, k + 1);
731 vec_add1 (w->elog_track.name, 0);
732 elog_track_register (&vm->elog_main, &w->elog_track);
734 if (tr->no_data_structure_clone)
737 /* Fork vlib_global_main et al. Look for bugs here */
738 oldheap = clib_mem_set_heap (w->thread_mheap);
740 vm_clone = clib_mem_alloc_aligned (sizeof (*vm_clone),
741 CLIB_CACHE_LINE_BYTES);
742 clib_memcpy (vm_clone, vlib_mains[0], sizeof (*vm_clone));
744 vm_clone->thread_index = worker_thread_index;
745 vm_clone->heap_base = w->thread_mheap;
746 vm_clone->heap_aligned_base = (void *)
747 (((uword) w->thread_mheap) & ~(VLIB_FRAME_ALIGN - 1));
748 vm_clone->init_functions_called =
749 hash_create (0, /* value bytes */ 0);
750 vm_clone->pending_rpc_requests = 0;
751 vec_validate (vm_clone->pending_rpc_requests, 0);
752 _vec_len (vm_clone->pending_rpc_requests) = 0;
753 clib_memset (&vm_clone->random_buffer, 0,
754 sizeof (vm_clone->random_buffer));
756 nm = &vlib_mains[0]->node_main;
757 nm_clone = &vm_clone->node_main;
758 /* fork next frames array, preserving node runtime indices */
759 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
760 CLIB_CACHE_LINE_BYTES);
761 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
763 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
764 u32 save_node_runtime_index;
767 save_node_runtime_index = nf->node_runtime_index;
768 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
769 vlib_next_frame_init (nf);
770 nf->node_runtime_index = save_node_runtime_index;
771 nf->flags = save_flags;
774 /* fork the frame dispatch queue */
775 nm_clone->pending_frames = 0;
776 vec_validate (nm_clone->pending_frames, 10);
777 _vec_len (nm_clone->pending_frames) = 0;
782 /* Allocate all nodes in single block for speed */
783 n = clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*n));
785 for (j = 0; j < vec_len (nm->nodes); j++)
787 clib_memcpy (n, nm->nodes[j], sizeof (*n));
788 /* none of the copied nodes have enqueue rights given out */
789 n->owner_node_index = VLIB_INVALID_NODE_INDEX;
790 clib_memset (&n->stats_total, 0, sizeof (n->stats_total));
791 clib_memset (&n->stats_last_clear, 0,
792 sizeof (n->stats_last_clear));
793 vec_add1 (nm_clone->nodes, n);
796 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
797 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
798 CLIB_CACHE_LINE_BYTES);
800 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
802 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
803 rt->thread_index = vm_clone->thread_index;
804 /* copy initial runtime_data from node */
805 if (n->runtime_data && n->runtime_data_bytes > 0)
806 clib_memcpy (rt->runtime_data, n->runtime_data,
807 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
808 n->runtime_data_bytes));
811 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
812 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
813 CLIB_CACHE_LINE_BYTES);
814 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
816 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
817 rt->thread_index = vm_clone->thread_index;
818 /* copy initial runtime_data from node */
819 if (n->runtime_data && n->runtime_data_bytes > 0)
820 clib_memcpy (rt->runtime_data, n->runtime_data,
821 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
822 n->runtime_data_bytes));
825 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
826 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
827 CLIB_CACHE_LINE_BYTES);
829 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
831 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
832 rt->thread_index = vm_clone->thread_index;
833 /* copy initial runtime_data from node */
834 if (n->runtime_data && n->runtime_data_bytes > 0)
835 clib_memcpy (rt->runtime_data, n->runtime_data,
836 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
837 n->runtime_data_bytes));
840 nm_clone->processes = vec_dup_aligned (nm->processes,
841 CLIB_CACHE_LINE_BYTES);
843 /* Create per-thread frame freelist */
844 nm_clone->frame_sizes = vec_new (vlib_frame_size_t, 1);
845 #ifdef VLIB_SUPPORTS_ARBITRARY_SCALAR_SIZES
846 nm_clone->frame_size_hash = hash_create (0, sizeof (uword));
849 /* Packet trace buffers are guaranteed to be empty, nothing to do here */
851 clib_mem_set_heap (oldheap);
852 vec_add1_aligned (vlib_mains, vm_clone, CLIB_CACHE_LINE_BYTES);
854 /* Switch to the stats segment ... */
855 void *oldheap = vlib_stats_push_heap (0);
856 vm_clone->error_main.counters = vec_dup_aligned
857 (vlib_mains[0]->error_main.counters, CLIB_CACHE_LINE_BYTES);
858 vlib_stats_pop_heap2 (vm_clone->error_main.counters,
859 worker_thread_index, oldheap, 1);
861 vm_clone->error_main.counters_last_clear = vec_dup_aligned
862 (vlib_mains[0]->error_main.counters_last_clear,
863 CLIB_CACHE_LINE_BYTES);
865 worker_thread_index++;
871 /* only have non-data-structure copy threads to create... */
872 for (i = 0; i < vec_len (tm->registrations); i++)
874 tr = tm->registrations[i];
876 for (j = 0; j < tr->count; j++)
878 vec_add2 (vlib_worker_threads, w, 1);
881 #if USE_DLMALLOC == 0
883 mheap_alloc (0 /* use VM */ , tr->mheap_size);
886 create_mspace (tr->mheap_size, 0 /* locked */ );
890 w->thread_mheap = main_heap;
892 vlib_thread_stack_init (w - vlib_worker_threads);
893 w->thread_function = tr->function;
894 w->thread_function_arg = w;
897 (char *) format (0, "%s %d", tr->name, j + 1);
898 w->registration = tr;
899 vec_add1 (w->elog_track.name, 0);
900 elog_track_register (&vm->elog_main, &w->elog_track);
905 worker_thread_index = 1;
907 for (i = 0; i < vec_len (tm->registrations); i++)
912 tr = tm->registrations[i];
914 if (tr->use_pthreads || tm->use_pthreads)
916 for (j = 0; j < tr->count; j++)
918 w = vlib_worker_threads + worker_thread_index++;
919 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
922 clib_error_report (err);
929 clib_bitmap_foreach (c, tr->coremask, ({
930 w = vlib_worker_threads + worker_thread_index++;
931 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
934 clib_error_report (err);
939 vlib_worker_thread_barrier_sync (vm);
940 vlib_worker_thread_barrier_release (vm);
944 VLIB_MAIN_LOOP_ENTER_FUNCTION (start_workers);
948 worker_thread_node_runtime_update_internal (void)
952 vlib_node_main_t *nm, *nm_clone;
953 vlib_main_t *vm_clone;
954 vlib_node_runtime_t *rt;
956 vlib_node_runtime_sync_stats (vlib_main_t * vm,
957 vlib_node_runtime_t * r,
959 uword n_vectors, uword n_clocks);
961 ASSERT (vlib_get_thread_index () == 0);
966 ASSERT (*vlib_worker_threads->wait_at_barrier == 1);
969 * Scrape all runtime stats, so we don't lose node runtime(s) with
970 * pending counts, or throw away worker / io thread counts.
972 for (j = 0; j < vec_len (nm->nodes); j++)
976 vlib_node_sync_stats (vm, n);
979 for (i = 1; i < vec_len (vlib_mains); i++)
983 vm_clone = vlib_mains[i];
984 nm_clone = &vm_clone->node_main;
986 for (j = 0; j < vec_len (nm_clone->nodes); j++)
988 n = nm_clone->nodes[j];
990 rt = vlib_node_get_runtime (vm_clone, n->index);
991 vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
995 /* Per-worker clone rebuilds are now done on each thread */
1000 vlib_worker_thread_node_refork (void)
1002 vlib_main_t *vm, *vm_clone;
1003 vlib_node_main_t *nm, *nm_clone;
1004 vlib_node_t **old_nodes_clone;
1005 vlib_node_runtime_t *rt, *old_rt;
1007 vlib_node_t *new_n_clone;
1012 nm = &vm->node_main;
1013 vm_clone = vlib_get_main ();
1014 nm_clone = &vm_clone->node_main;
1016 /* Re-clone error heap */
1017 u64 *old_counters = vm_clone->error_main.counters;
1018 u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
1020 clib_memcpy_fast (&vm_clone->error_main, &vm->error_main,
1021 sizeof (vm->error_main));
1022 j = vec_len (vm->error_main.counters) - 1;
1024 /* Switch to the stats segment ... */
1025 void *oldheap = vlib_stats_push_heap (0);
1026 vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
1027 vm_clone->error_main.counters = old_counters;
1028 vlib_stats_pop_heap2 (vm_clone->error_main.counters, vm_clone->thread_index,
1031 vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
1032 vm_clone->error_main.counters_last_clear = old_counters_all_clear;
1034 nm_clone = &vm_clone->node_main;
1035 vec_free (nm_clone->next_frames);
1036 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
1037 CLIB_CACHE_LINE_BYTES);
1039 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
1041 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
1042 u32 save_node_runtime_index;
1045 save_node_runtime_index = nf->node_runtime_index;
1046 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
1047 vlib_next_frame_init (nf);
1048 nf->node_runtime_index = save_node_runtime_index;
1049 nf->flags = save_flags;
1052 old_nodes_clone = nm_clone->nodes;
1053 nm_clone->nodes = 0;
1057 /* Allocate all nodes in single block for speed */
1059 clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*new_n_clone));
1060 for (j = 0; j < vec_len (nm->nodes); j++)
1062 vlib_node_t *old_n_clone;
1065 new_n = nm->nodes[j];
1066 old_n_clone = old_nodes_clone[j];
1068 clib_memcpy_fast (new_n_clone, new_n, sizeof (*new_n));
1069 /* none of the copied nodes have enqueue rights given out */
1070 new_n_clone->owner_node_index = VLIB_INVALID_NODE_INDEX;
1072 if (j >= vec_len (old_nodes_clone))
1074 /* new node, set to zero */
1075 clib_memset (&new_n_clone->stats_total, 0,
1076 sizeof (new_n_clone->stats_total));
1077 clib_memset (&new_n_clone->stats_last_clear, 0,
1078 sizeof (new_n_clone->stats_last_clear));
1082 /* Copy stats if the old data is valid */
1083 clib_memcpy_fast (&new_n_clone->stats_total,
1084 &old_n_clone->stats_total,
1085 sizeof (new_n_clone->stats_total));
1086 clib_memcpy_fast (&new_n_clone->stats_last_clear,
1087 &old_n_clone->stats_last_clear,
1088 sizeof (new_n_clone->stats_last_clear));
1090 /* keep previous node state */
1091 new_n_clone->state = old_n_clone->state;
1093 vec_add1 (nm_clone->nodes, new_n_clone);
1096 /* Free the old node clones */
1097 clib_mem_free (old_nodes_clone[0]);
1099 vec_free (old_nodes_clone);
1102 /* re-clone internal nodes */
1103 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL];
1104 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
1105 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
1106 CLIB_CACHE_LINE_BYTES);
1108 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
1110 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1111 rt->thread_index = vm_clone->thread_index;
1112 /* copy runtime_data, will be overwritten later for existing rt */
1113 if (n->runtime_data && n->runtime_data_bytes > 0)
1114 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1115 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1116 n->runtime_data_bytes));
1119 for (j = 0; j < vec_len (old_rt); j++)
1121 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1122 rt->state = old_rt[j].state;
1123 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1124 VLIB_NODE_RUNTIME_DATA_SIZE);
1129 /* re-clone input nodes */
1130 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
1131 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
1132 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
1133 CLIB_CACHE_LINE_BYTES);
1135 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
1137 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1138 rt->thread_index = vm_clone->thread_index;
1139 /* copy runtime_data, will be overwritten later for existing rt */
1140 if (n->runtime_data && n->runtime_data_bytes > 0)
1141 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1142 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1143 n->runtime_data_bytes));
1146 for (j = 0; j < vec_len (old_rt); j++)
1148 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1149 rt->state = old_rt[j].state;
1150 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1151 VLIB_NODE_RUNTIME_DATA_SIZE);
1156 /* re-clone pre-input nodes */
1157 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT];
1158 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
1159 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
1160 CLIB_CACHE_LINE_BYTES);
1162 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
1164 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1165 rt->thread_index = vm_clone->thread_index;
1166 /* copy runtime_data, will be overwritten later for existing rt */
1167 if (n->runtime_data && n->runtime_data_bytes > 0)
1168 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1169 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1170 n->runtime_data_bytes));
1173 for (j = 0; j < vec_len (old_rt); j++)
1175 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1176 rt->state = old_rt[j].state;
1177 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1178 VLIB_NODE_RUNTIME_DATA_SIZE);
1183 nm_clone->processes = vec_dup_aligned (nm->processes,
1184 CLIB_CACHE_LINE_BYTES);
1188 vlib_worker_thread_node_runtime_update (void)
1191 * Make a note that we need to do a node runtime update
1192 * prior to releasing the barrier.
1194 vlib_global_main.need_vlib_worker_thread_node_runtime_update = 1;
1198 unformat_sched_policy (unformat_input_t * input, va_list * args)
1200 u32 *r = va_arg (*args, u32 *);
1203 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
1204 foreach_sched_policy
1211 static clib_error_t *
1212 cpu_config (vlib_main_t * vm, unformat_input_t * input)
1214 vlib_thread_registration_t *tr;
1216 vlib_thread_main_t *tm = &vlib_thread_main;
1221 tm->thread_registrations_by_name = hash_create_string (0, sizeof (uword));
1223 tm->n_thread_stacks = 1; /* account for main thread */
1224 tm->sched_policy = ~0;
1225 tm->sched_priority = ~0;
1226 tm->main_lcore = ~0;
1232 hash_set_mem (tm->thread_registrations_by_name, tr->name, (uword) tr);
1236 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1238 if (unformat (input, "use-pthreads"))
1239 tm->use_pthreads = 1;
1240 else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1242 else if (unformat (input, "main-core %u", &tm->main_lcore))
1244 else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1246 else if (unformat (input, "coremask-%s %U", &name,
1247 unformat_bitmap_mask, &bitmap) ||
1248 unformat (input, "corelist-%s %U", &name,
1249 unformat_bitmap_list, &bitmap))
1251 p = hash_get_mem (tm->thread_registrations_by_name, name);
1253 return clib_error_return (0, "no such thread type '%s'", name);
1255 tr = (vlib_thread_registration_t *) p[0];
1257 if (tr->use_pthreads)
1258 return clib_error_return (0,
1259 "corelist cannot be set for '%s' threads",
1262 tr->coremask = bitmap;
1263 tr->count = clib_bitmap_count_set_bits (tr->coremask);
1267 (input, "scheduler-policy %U", unformat_sched_policy,
1270 else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1272 else if (unformat (input, "%s %u", &name, &count))
1274 p = hash_get_mem (tm->thread_registrations_by_name, name);
1276 return clib_error_return (0, "no such thread type 3 '%s'", name);
1278 tr = (vlib_thread_registration_t *) p[0];
1279 if (tr->fixed_count)
1280 return clib_error_return
1281 (0, "number of %s threads not configurable", tr->name);
1288 if (tm->sched_priority != ~0)
1290 if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1292 u32 prio_max = sched_get_priority_max (tm->sched_policy);
1293 u32 prio_min = sched_get_priority_min (tm->sched_policy);
1294 if (tm->sched_priority > prio_max)
1295 tm->sched_priority = prio_max;
1296 if (tm->sched_priority < prio_min)
1297 tm->sched_priority = prio_min;
1301 return clib_error_return
1303 "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1304 tm->sched_priority);
1309 if (!tm->thread_prefix)
1310 tm->thread_prefix = format (0, "vpp");
1314 tm->n_thread_stacks += tr->count;
1315 tm->n_pthreads += tr->count * tr->use_pthreads;
1316 tm->n_threads += tr->count * (tr->use_pthreads == 0);
1323 VLIB_EARLY_CONFIG_FUNCTION (cpu_config, "cpu");
1325 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1327 vnet_main_fixup (vlib_fork_fixup_t which)
1332 vlib_worker_thread_fork_fixup (vlib_fork_fixup_t which)
1334 vlib_main_t *vm = vlib_get_main ();
1336 if (vlib_mains == 0)
1339 ASSERT (vlib_get_thread_index () == 0);
1340 vlib_worker_thread_barrier_sync (vm);
1344 case VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX:
1345 vnet_main_fixup (VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX);
1351 vlib_worker_thread_barrier_release (vm);
1355 * Enforce minimum open time to minimize packet loss due to Rx overflow,
1356 * based on a test based heuristic that barrier should be open for at least
1357 * 3 time as long as it is closed (with an upper bound of 1ms because by that
1358 * point it is probably too late to make a difference)
1361 #ifndef BARRIER_MINIMUM_OPEN_LIMIT
1362 #define BARRIER_MINIMUM_OPEN_LIMIT 0.001
1365 #ifndef BARRIER_MINIMUM_OPEN_FACTOR
1366 #define BARRIER_MINIMUM_OPEN_FACTOR 3
1370 vlib_worker_thread_initial_barrier_sync_and_release (vlib_main_t * vm)
1373 f64 now = vlib_time_now (vm);
1374 u32 count = vec_len (vlib_mains) - 1;
1376 /* No worker threads? */
1380 deadline = now + BARRIER_SYNC_TIMEOUT;
1381 *vlib_worker_threads->wait_at_barrier = 1;
1382 while (*vlib_worker_threads->workers_at_barrier != count)
1384 if ((now = vlib_time_now (vm)) > deadline)
1386 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1391 *vlib_worker_threads->wait_at_barrier = 0;
1395 vlib_worker_thread_barrier_sync_int (vlib_main_t * vm, const char *func_name)
1402 f64 max_vector_rate;
1406 if (vec_len (vlib_mains) < 2)
1409 ASSERT (vlib_get_thread_index () == 0);
1411 vlib_worker_threads[0].barrier_caller = func_name;
1412 count = vec_len (vlib_mains) - 1;
1414 /* Record entry relative to last close */
1415 now = vlib_time_now (vm);
1416 t_entry = now - vm->barrier_epoch;
1418 /* Tolerate recursive calls */
1419 if (++vlib_worker_threads[0].recursion_level > 1)
1421 barrier_trace_sync_rec (t_entry);
1426 * Need data to decide if we're working hard enough to honor
1427 * the barrier hold-down timer.
1429 max_vector_rate = 0.0;
1430 for (i = 1; i < vec_len (vlib_mains); i++)
1432 clib_max (max_vector_rate,
1433 vlib_last_vectors_per_main_loop_as_f64 (vlib_mains[i]));
1435 vlib_worker_threads[0].barrier_sync_count++;
1437 /* Enforce minimum barrier open time to minimize packet loss */
1438 ASSERT (vm->barrier_no_close_before <= (now + BARRIER_MINIMUM_OPEN_LIMIT));
1441 * If any worker thread seems busy, which we define
1442 * as a vector rate above 10, we enforce the barrier hold-down timer
1444 if (max_vector_rate > 10.0)
1448 now = vlib_time_now (vm);
1449 /* Barrier hold-down timer expired? */
1450 if (now >= vm->barrier_no_close_before)
1452 if ((vm->barrier_no_close_before - now)
1453 > (2.0 * BARRIER_MINIMUM_OPEN_LIMIT))
1456 ("clock change: would have waited for %.4f seconds",
1457 (vm->barrier_no_close_before - now));
1462 /* Record time of closure */
1463 t_open = now - vm->barrier_epoch;
1464 vm->barrier_epoch = now;
1466 deadline = now + BARRIER_SYNC_TIMEOUT;
1468 *vlib_worker_threads->wait_at_barrier = 1;
1469 while (*vlib_worker_threads->workers_at_barrier != count)
1471 if ((now = vlib_time_now (vm)) > deadline)
1473 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1478 t_closed = now - vm->barrier_epoch;
1480 barrier_trace_sync (t_entry, t_open, t_closed);
1485 vlib_worker_thread_barrier_release (vlib_main_t * vm)
1492 f64 t_update_main = 0.0;
1493 int refork_needed = 0;
1495 if (vec_len (vlib_mains) < 2)
1498 ASSERT (vlib_get_thread_index () == 0);
1501 now = vlib_time_now (vm);
1502 t_entry = now - vm->barrier_epoch;
1504 if (--vlib_worker_threads[0].recursion_level > 0)
1506 barrier_trace_release_rec (t_entry);
1510 /* Update (all) node runtimes before releasing the barrier, if needed */
1511 if (vm->need_vlib_worker_thread_node_runtime_update)
1514 * Lock stat segment here, so we's safe when
1515 * rebuilding the stat segment node clones from the
1518 vlib_stat_segment_lock ();
1520 /* Do stats elements on main thread */
1521 worker_thread_node_runtime_update_internal ();
1522 vm->need_vlib_worker_thread_node_runtime_update = 0;
1524 /* Do per thread rebuilds in parallel */
1526 clib_atomic_fetch_add (vlib_worker_threads->node_reforks_required,
1527 (vec_len (vlib_mains) - 1));
1528 now = vlib_time_now (vm);
1529 t_update_main = now - vm->barrier_epoch;
1532 deadline = now + BARRIER_SYNC_TIMEOUT;
1535 * Note when we let go of the barrier.
1536 * Workers can use this to derive a reasonably accurate
1537 * time offset. See vlib_time_now(...)
1539 vm->time_last_barrier_release = vlib_time_now (vm);
1540 CLIB_MEMORY_STORE_BARRIER ();
1542 *vlib_worker_threads->wait_at_barrier = 0;
1544 while (*vlib_worker_threads->workers_at_barrier > 0)
1546 if ((now = vlib_time_now (vm)) > deadline)
1548 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1553 /* Wait for reforks before continuing */
1556 now = vlib_time_now (vm);
1558 deadline = now + BARRIER_SYNC_TIMEOUT;
1560 while (*vlib_worker_threads->node_reforks_required > 0)
1562 if ((now = vlib_time_now (vm)) > deadline)
1564 fformat (stderr, "%s: worker thread refork deadlock\n",
1569 vlib_stat_segment_unlock ();
1572 t_closed_total = now - vm->barrier_epoch;
1574 minimum_open = t_closed_total * BARRIER_MINIMUM_OPEN_FACTOR;
1576 if (minimum_open > BARRIER_MINIMUM_OPEN_LIMIT)
1578 minimum_open = BARRIER_MINIMUM_OPEN_LIMIT;
1581 vm->barrier_no_close_before = now + minimum_open;
1583 /* Record barrier epoch (used to enforce minimum open time) */
1584 vm->barrier_epoch = now;
1586 barrier_trace_release (t_entry, t_closed_total, t_update_main);
1591 * Check the frame queue to see if any frames are available.
1592 * If so, pull the packets off the frames and put them to
1596 vlib_frame_queue_dequeue (vlib_main_t * vm, vlib_frame_queue_main_t * fqm)
1598 u32 thread_id = vm->thread_index;
1599 vlib_frame_queue_t *fq = fqm->vlib_frame_queues[thread_id];
1600 vlib_frame_queue_elt_t *elt;
1609 ASSERT (vm == vlib_mains[thread_id]);
1611 if (PREDICT_FALSE (fqm->node_index == ~0))
1614 * Gather trace data for frame queues
1616 if (PREDICT_FALSE (fq->trace))
1618 frame_queue_trace_t *fqt;
1619 frame_queue_nelt_counter_t *fqh;
1622 fqt = &fqm->frame_queue_traces[thread_id];
1624 fqt->nelts = fq->nelts;
1625 fqt->head = fq->head;
1626 fqt->head_hint = fq->head_hint;
1627 fqt->tail = fq->tail;
1628 fqt->threshold = fq->vector_threshold;
1629 fqt->n_in_use = fqt->tail - fqt->head;
1630 if (fqt->n_in_use >= fqt->nelts)
1632 // if beyond max then use max
1633 fqt->n_in_use = fqt->nelts - 1;
1636 /* Record the number of elements in use in the histogram */
1637 fqh = &fqm->frame_queue_histogram[thread_id];
1638 fqh->count[fqt->n_in_use]++;
1640 /* Record a snapshot of the elements in use */
1641 for (elix = 0; elix < fqt->nelts; elix++)
1643 elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1644 if (1 || elt->valid)
1646 fqt->n_vectors[elix] = elt->n_vectors;
1655 if (fq->head == fq->tail)
1657 fq->head_hint = fq->head;
1661 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1665 fq->head_hint = fq->head;
1669 from = elt->buffer_index;
1670 msg_type = elt->msg_type;
1672 ASSERT (msg_type == VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME);
1673 ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1675 f = vlib_get_frame_to_node (vm, fqm->node_index);
1677 /* If the first vector is traced, set the frame trace flag */
1678 b = vlib_get_buffer (vm, from[0]);
1679 if (b->flags & VLIB_BUFFER_IS_TRACED)
1680 f->frame_flags |= VLIB_NODE_FLAG_TRACE;
1682 to = vlib_frame_vector_args (f);
1684 n_left_to_node = elt->n_vectors;
1686 while (n_left_to_node >= 4)
1694 n_left_to_node -= 4;
1697 while (n_left_to_node > 0)
1705 vectors += elt->n_vectors;
1706 f->n_vectors = elt->n_vectors;
1707 vlib_put_frame_to_node (vm, fqm->node_index, f);
1711 elt->msg_type = 0xfefefefe;
1712 CLIB_MEMORY_BARRIER ();
1717 * Limit the number of packets pushed into the graph
1719 if (vectors >= fq->vector_threshold)
1721 fq->head_hint = fq->head;
1730 vlib_worker_thread_fn (void *arg)
1732 vlib_worker_thread_t *w = (vlib_worker_thread_t *) arg;
1733 vlib_thread_main_t *tm = vlib_get_thread_main ();
1734 vlib_main_t *vm = vlib_get_main ();
1737 ASSERT (vm->thread_index == vlib_get_thread_index ());
1739 vlib_worker_thread_init (w);
1740 clib_time_init (&vm->clib_time);
1741 clib_mem_set_heap (w->thread_mheap);
1743 e = vlib_call_init_exit_functions_no_sort
1744 (vm, &vm->worker_init_function_registrations, 1 /* call_once */ );
1746 clib_error_report (e);
1748 /* Wait until the dpdk init sequence is complete */
1749 while (tm->extern_thread_mgmt && tm->worker_thread_release == 0)
1750 vlib_worker_thread_barrier_check ();
1752 vlib_worker_loop (vm);
1756 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1759 .function = vlib_worker_thread_fn,
1764 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts)
1766 vlib_thread_main_t *tm = vlib_get_thread_main ();
1767 vlib_frame_queue_main_t *fqm;
1768 vlib_frame_queue_t *fq;
1771 if (frame_queue_nelts == 0)
1772 frame_queue_nelts = FRAME_QUEUE_MAX_NELTS;
1774 ASSERT (frame_queue_nelts >= 8);
1776 vec_add2 (tm->frame_queue_mains, fqm, 1);
1778 fqm->node_index = node_index;
1779 fqm->frame_queue_nelts = frame_queue_nelts;
1780 fqm->queue_hi_thresh = frame_queue_nelts - 2;
1782 vec_validate (fqm->vlib_frame_queues, tm->n_vlib_mains - 1);
1783 vec_validate (fqm->per_thread_data, tm->n_vlib_mains - 1);
1784 _vec_len (fqm->vlib_frame_queues) = 0;
1785 for (i = 0; i < tm->n_vlib_mains; i++)
1787 vlib_frame_queue_per_thread_data_t *ptd;
1788 fq = vlib_frame_queue_alloc (frame_queue_nelts);
1789 vec_add1 (fqm->vlib_frame_queues, fq);
1791 ptd = vec_elt_at_index (fqm->per_thread_data, i);
1792 vec_validate (ptd->handoff_queue_elt_by_thread_index,
1793 tm->n_vlib_mains - 1);
1794 vec_validate_init_empty (ptd->congested_handoff_queue_by_thread_index,
1795 tm->n_vlib_mains - 1,
1796 (vlib_frame_queue_t *) (~0));
1799 return (fqm - tm->frame_queue_mains);
1803 vlib_thread_cb_register (struct vlib_main_t *vm, vlib_thread_callbacks_t * cb)
1805 vlib_thread_main_t *tm = vlib_get_thread_main ();
1807 if (tm->extern_thread_mgmt)
1810 tm->cb.vlib_launch_thread_cb = cb->vlib_launch_thread_cb;
1811 tm->extern_thread_mgmt = 1;
1816 vlib_process_signal_event_mt_helper (vlib_process_signal_event_mt_args_t *
1819 ASSERT (vlib_get_thread_index () == 0);
1820 vlib_process_signal_event (vlib_get_main (), args->node_index,
1821 args->type_opaque, args->data);
1824 void *rpc_call_main_thread_cb_fn;
1827 vlib_rpc_call_main_thread (void *callback, u8 * args, u32 arg_size)
1829 if (rpc_call_main_thread_cb_fn)
1831 void (*fp) (void *, u8 *, u32) = rpc_call_main_thread_cb_fn;
1832 (*fp) (callback, args, arg_size);
1835 clib_warning ("BUG: rpc_call_main_thread_cb_fn NULL!");
1839 threads_init (vlib_main_t * vm)
1844 VLIB_INIT_FUNCTION (threads_init);
1847 static clib_error_t *
1848 show_clock_command_fn (vlib_main_t * vm,
1849 unformat_input_t * input, vlib_cli_command_t * cmd)
1854 now = vlib_time_now (vm);
1856 vlib_cli_output (vm, "Time now %.9f", now);
1858 if (vec_len (vlib_mains) == 1)
1861 vlib_cli_output (vm, "Time last barrier release %.9f",
1862 vm->time_last_barrier_release);
1864 for (i = 1; i < vec_len (vlib_mains); i++)
1866 if (vlib_mains[i] == 0)
1868 vlib_cli_output (vm, "Thread %d offset %.9f error %.9f", i,
1869 vlib_mains[i]->time_offset,
1870 vm->time_last_barrier_release -
1871 vlib_mains[i]->time_last_barrier_release);
1877 VLIB_CLI_COMMAND (f_command, static) =
1879 .path = "show clock",
1880 .short_help = "show clock",
1881 .function = show_clock_command_fn,
1886 * fd.io coding-style-patch-verification: ON
1889 * eval: (c-set-style "gnu")