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 vlib_get_thread_core_numa (w, w->cpu_id);
288 if (tm->sched_policy != ~0)
290 struct sched_param sched_param;
291 if (!sched_getparam (w->lwp, &sched_param))
293 if (tm->sched_priority != ~0)
294 sched_param.sched_priority = tm->sched_priority;
295 sched_setscheduler (w->lwp, tm->sched_policy, &sched_param);
299 /* assign threads to cores and set n_vlib_mains */
304 vec_add1 (tm->registrations, tr);
308 vec_sort_with_function (tm->registrations, sort_registrations_by_no_clone);
310 for (i = 0; i < vec_len (tm->registrations); i++)
313 tr = tm->registrations[i];
314 tr->first_index = first_index;
315 first_index += tr->count;
316 n_vlib_mains += (tr->no_data_structure_clone == 0) ? tr->count : 0;
318 /* construct coremask */
319 if (tr->use_pthreads || !tr->count)
326 clib_bitmap_foreach (c, tr->coremask, ({
327 if (clib_bitmap_get(avail_cpu, c) == 0)
328 return clib_error_return (0, "cpu %u is not available to be used"
329 " for the '%s' thread",c, tr->name);
331 avail_cpu = clib_bitmap_set(avail_cpu, c, 0);
337 for (j = 0; j < tr->count; j++)
339 uword c = clib_bitmap_first_set (avail_cpu);
341 return clib_error_return (0,
342 "no available cpus to be used for"
343 " the '%s' thread", tr->name);
345 avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
346 tr->coremask = clib_bitmap_set (tr->coremask, c, 1);
351 clib_bitmap_free (avail_cpu);
353 tm->n_vlib_mains = n_vlib_mains;
356 * Allocate the remaining worker threads, and thread stack vector slots
357 * from now on, calls to os_get_nthreads() will return the correct
360 vec_validate_aligned (vlib_worker_threads, first_index - 1,
361 CLIB_CACHE_LINE_BYTES);
362 vec_validate (vlib_thread_stacks, vec_len (vlib_worker_threads) - 1);
367 vlib_frame_queue_alloc (int nelts)
369 vlib_frame_queue_t *fq;
371 fq = clib_mem_alloc_aligned (sizeof (*fq), CLIB_CACHE_LINE_BYTES);
372 clib_memset (fq, 0, sizeof (*fq));
374 fq->vector_threshold = 128; // packets
375 vec_validate_aligned (fq->elts, nelts - 1, CLIB_CACHE_LINE_BYTES);
379 if (((uword) & fq->tail) & (CLIB_CACHE_LINE_BYTES - 1))
380 fformat (stderr, "WARNING: fq->tail unaligned\n");
381 if (((uword) & fq->head) & (CLIB_CACHE_LINE_BYTES - 1))
382 fformat (stderr, "WARNING: fq->head unaligned\n");
383 if (((uword) fq->elts) & (CLIB_CACHE_LINE_BYTES - 1))
384 fformat (stderr, "WARNING: fq->elts unaligned\n");
386 if (sizeof (fq->elts[0]) % CLIB_CACHE_LINE_BYTES)
387 fformat (stderr, "WARNING: fq->elts[0] size %d\n",
388 sizeof (fq->elts[0]));
389 if (nelts & (nelts - 1))
391 fformat (stderr, "FATAL: nelts MUST be a power of 2\n");
399 void vl_msg_api_handler_no_free (void *) __attribute__ ((weak));
401 vl_msg_api_handler_no_free (void *v)
405 /* Turned off, save as reference material... */
408 vlib_frame_queue_dequeue_internal (int thread_id,
409 vlib_main_t * vm, vlib_node_main_t * nm)
411 vlib_frame_queue_t *fq = vlib_frame_queues[thread_id];
412 vlib_frame_queue_elt_t *elt;
414 vlib_pending_frame_t *p;
415 vlib_node_runtime_t *r;
416 u32 node_runtime_index;
421 ASSERT (vm == vlib_mains[thread_id]);
425 if (fq->head == fq->tail)
428 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
433 before = clib_cpu_time_now ();
436 node_runtime_index = elt->node_runtime_index;
437 msg_type = elt->msg_type;
441 case VLIB_FRAME_QUEUE_ELT_FREE_BUFFERS:
442 vlib_buffer_free (vm, vlib_frame_vector_args (f), f->n_vectors);
443 /* note fallthrough... */
444 case VLIB_FRAME_QUEUE_ELT_FREE_FRAME:
445 r = vec_elt_at_index (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
447 vlib_frame_free (vm, r, f);
449 case VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME:
450 vec_add2 (vm->node_main.pending_frames, p, 1);
451 f->flags |= (VLIB_FRAME_PENDING | VLIB_FRAME_FREE_AFTER_DISPATCH);
452 p->node_runtime_index = elt->node_runtime_index;
453 p->frame_index = vlib_frame_index (vm, f);
454 p->next_frame_index = VLIB_PENDING_FRAME_NO_NEXT_FRAME;
455 fq->dequeue_vectors += (u64) f->n_vectors;
457 case VLIB_FRAME_QUEUE_ELT_API_MSG:
458 vl_msg_api_handler_no_free (f);
461 clib_warning ("bogus frame queue message, type %d", msg_type);
466 fq->dequeue_ticks += clib_cpu_time_now () - before;
467 CLIB_MEMORY_BARRIER ();
476 vlib_frame_queue_dequeue (int thread_id,
477 vlib_main_t * vm, vlib_node_main_t * nm)
479 return vlib_frame_queue_dequeue_internal (thread_id, vm, nm);
483 vlib_frame_queue_enqueue (vlib_main_t * vm, u32 node_runtime_index,
484 u32 frame_queue_index, vlib_frame_t * frame,
485 vlib_frame_queue_msg_type_t type)
487 vlib_frame_queue_t *fq = vlib_frame_queues[frame_queue_index];
488 vlib_frame_queue_elt_t *elt;
491 u64 before = clib_cpu_time_now ();
495 new_tail = clib_atomic_add_fetch (&fq->tail, 1);
497 /* Wait until a ring slot is available */
498 while (new_tail >= fq->head + fq->nelts)
500 f64 b4 = vlib_time_now_ticks (vm, before);
501 vlib_worker_thread_barrier_check (vm, b4);
502 /* Bad idea. Dequeue -> enqueue -> dequeue -> trouble */
503 // vlib_frame_queue_dequeue (vm->thread_index, vm, nm);
506 elt = fq->elts + (new_tail & (fq->nelts - 1));
508 /* this would be very bad... */
513 /* Once we enqueue the frame, frame->n_vectors is owned elsewhere... */
514 save_count = frame->n_vectors;
517 elt->node_runtime_index = node_runtime_index;
518 elt->msg_type = type;
519 CLIB_MEMORY_BARRIER ();
526 /* To be called by vlib worker threads upon startup */
528 vlib_worker_thread_init (vlib_worker_thread_t * w)
530 vlib_thread_main_t *tm = vlib_get_thread_main ();
533 * Note: disabling signals in worker threads as follows
534 * prevents the api post-mortem dump scheme from working
538 * pthread_sigmask (SIG_SETMASK, &s, 0);
542 clib_mem_set_heap (w->thread_mheap);
544 if (vec_len (tm->thread_prefix) && w->registration->short_name)
546 w->name = format (0, "%v_%s_%d%c", tm->thread_prefix,
547 w->registration->short_name, w->instance_id, '\0');
548 vlib_set_thread_name ((char *) w->name);
551 if (!w->registration->use_pthreads)
554 /* Initial barrier sync, for both worker and i/o threads */
555 clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, 1);
557 while (*vlib_worker_threads->wait_at_barrier)
560 clib_atomic_fetch_add (vlib_worker_threads->workers_at_barrier, -1);
565 vlib_worker_thread_bootstrap_fn (void *arg)
568 vlib_worker_thread_t *w = arg;
570 w->lwp = syscall (SYS_gettid);
571 w->thread_id = pthread_self ();
573 __os_thread_index = w - vlib_worker_threads;
575 rv = (void *) clib_calljmp
576 ((uword (*)(uword)) w->thread_function,
577 (uword) arg, w->thread_stack + VLIB_THREAD_STACK_SIZE);
578 /* NOTREACHED, we hope */
583 vlib_get_thread_core_numa (vlib_worker_thread_t * w, unsigned cpu_id)
585 const char *sys_cpu_path = "/sys/devices/system/cpu/cpu";
587 int core_id = -1, numa_id = -1;
589 p = format (p, "%s%u/topology/core_id%c", sys_cpu_path, cpu_id, 0);
590 clib_sysfs_read ((char *) p, "%d", &core_id);
591 vec_reset_length (p);
593 format (p, "%s%u/topology/physical_package_id%c", sys_cpu_path, cpu_id,
595 clib_sysfs_read ((char *) p, "%d", &numa_id);
598 w->core_id = core_id;
599 w->numa_id = numa_id;
602 static clib_error_t *
603 vlib_launch_thread_int (void *fp, vlib_worker_thread_t * w, unsigned cpu_id)
605 vlib_thread_main_t *tm = &vlib_thread_main;
606 void *(*fp_arg) (void *) = fp;
610 vlib_get_thread_core_numa (w, cpu_id);
611 os_set_numa_index (w->numa_id);
613 /* Set up NUMA-bound heap if indicated */
614 if (clib_per_numa_mheaps[w->numa_id] == 0)
616 /* If the user requested a NUMA heap, create it... */
617 if (tm->numa_heap_size)
619 numa_heap = clib_mem_init_thread_safe_numa
620 (0 /* DIY */ , tm->numa_heap_size);
621 clib_per_numa_mheaps[w->numa_id] = numa_heap;
625 /* Or, use the main heap */
626 clib_per_numa_mheaps[w->numa_id] = w->thread_mheap;
630 if (tm->cb.vlib_launch_thread_cb && !w->registration->use_pthreads)
631 return tm->cb.vlib_launch_thread_cb (fp, (void *) w, cpu_id);
637 CPU_SET (cpu_id, &cpuset);
639 if (pthread_create (&worker, NULL /* attr */ , fp_arg, (void *) w))
640 return clib_error_return_unix (0, "pthread_create");
642 if (pthread_setaffinity_np (worker, sizeof (cpu_set_t), &cpuset))
643 return clib_error_return_unix (0, "pthread_setaffinity_np");
649 static clib_error_t *
650 start_workers (vlib_main_t * vm)
653 vlib_worker_thread_t *w;
654 vlib_main_t *vm_clone;
656 vlib_thread_main_t *tm = &vlib_thread_main;
657 vlib_thread_registration_t *tr;
658 vlib_node_runtime_t *rt;
659 u32 n_vlib_mains = tm->n_vlib_mains;
660 u32 worker_thread_index;
661 u8 *main_heap = clib_mem_get_per_cpu_heap ();
663 vec_reset_length (vlib_worker_threads);
665 /* Set up the main thread */
666 vec_add2_aligned (vlib_worker_threads, w, 1, CLIB_CACHE_LINE_BYTES);
667 w->elog_track.name = "main thread";
668 elog_track_register (&vm->elog_main, &w->elog_track);
670 if (vec_len (tm->thread_prefix))
672 w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
673 vlib_set_thread_name ((char *) w->name);
677 clib_mem_alloc_aligned (CLIB_CACHE_LINE_BYTES, CLIB_CACHE_LINE_BYTES);
678 vm->elog_main.lock[0] = 0;
680 if (n_vlib_mains > 1)
682 /* Replace hand-crafted length-1 vector with a real vector */
685 vec_validate_aligned (vlib_mains, tm->n_vlib_mains - 1,
686 CLIB_CACHE_LINE_BYTES);
687 _vec_len (vlib_mains) = 0;
688 vec_add1_aligned (vlib_mains, vm, CLIB_CACHE_LINE_BYTES);
690 vlib_worker_threads->wait_at_barrier =
691 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
692 vlib_worker_threads->workers_at_barrier =
693 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
695 vlib_worker_threads->node_reforks_required =
696 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
698 /* We'll need the rpc vector lock... */
699 clib_spinlock_init (&vm->pending_rpc_lock);
701 /* Ask for an initial barrier sync */
702 *vlib_worker_threads->workers_at_barrier = 0;
703 *vlib_worker_threads->wait_at_barrier = 1;
705 /* Without update or refork */
706 *vlib_worker_threads->node_reforks_required = 0;
707 vm->need_vlib_worker_thread_node_runtime_update = 0;
710 vm->barrier_epoch = 0;
711 vm->barrier_no_close_before = 0;
713 worker_thread_index = 1;
715 for (i = 0; i < vec_len (tm->registrations); i++)
717 vlib_node_main_t *nm, *nm_clone;
720 tr = tm->registrations[i];
725 for (k = 0; k < tr->count; k++)
729 vec_add2 (vlib_worker_threads, w, 1);
730 /* Currently unused, may not really work */
733 #if USE_DLMALLOC == 0
735 mheap_alloc (0 /* use VM */ , tr->mheap_size);
737 w->thread_mheap = create_mspace (tr->mheap_size,
742 w->thread_mheap = main_heap;
745 vlib_thread_stack_init (w - vlib_worker_threads);
746 w->thread_function = tr->function;
747 w->thread_function_arg = w;
749 w->registration = tr;
752 (char *) format (0, "%s %d", tr->name, k + 1);
753 vec_add1 (w->elog_track.name, 0);
754 elog_track_register (&vm->elog_main, &w->elog_track);
756 if (tr->no_data_structure_clone)
759 /* Fork vlib_global_main et al. Look for bugs here */
760 oldheap = clib_mem_set_heap (w->thread_mheap);
762 vm_clone = clib_mem_alloc_aligned (sizeof (*vm_clone),
763 CLIB_CACHE_LINE_BYTES);
764 clib_memcpy (vm_clone, vlib_mains[0], sizeof (*vm_clone));
766 vm_clone->thread_index = worker_thread_index;
767 vm_clone->heap_base = w->thread_mheap;
768 vm_clone->heap_aligned_base = (void *)
769 (((uword) w->thread_mheap) & ~(VLIB_FRAME_ALIGN - 1));
770 vm_clone->init_functions_called =
771 hash_create (0, /* value bytes */ 0);
772 vm_clone->pending_rpc_requests = 0;
773 vec_validate (vm_clone->pending_rpc_requests, 0);
774 _vec_len (vm_clone->pending_rpc_requests) = 0;
775 clib_memset (&vm_clone->random_buffer, 0,
776 sizeof (vm_clone->random_buffer));
778 nm = &vlib_mains[0]->node_main;
779 nm_clone = &vm_clone->node_main;
780 /* fork next frames array, preserving node runtime indices */
781 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
782 CLIB_CACHE_LINE_BYTES);
783 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
785 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
786 u32 save_node_runtime_index;
789 save_node_runtime_index = nf->node_runtime_index;
790 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
791 vlib_next_frame_init (nf);
792 nf->node_runtime_index = save_node_runtime_index;
793 nf->flags = save_flags;
796 /* fork the frame dispatch queue */
797 nm_clone->pending_frames = 0;
798 vec_validate (nm_clone->pending_frames, 10);
799 _vec_len (nm_clone->pending_frames) = 0;
804 /* Allocate all nodes in single block for speed */
805 n = clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*n));
807 for (j = 0; j < vec_len (nm->nodes); j++)
809 clib_memcpy (n, nm->nodes[j], sizeof (*n));
810 /* none of the copied nodes have enqueue rights given out */
811 n->owner_node_index = VLIB_INVALID_NODE_INDEX;
812 clib_memset (&n->stats_total, 0, sizeof (n->stats_total));
813 clib_memset (&n->stats_last_clear, 0,
814 sizeof (n->stats_last_clear));
815 vec_add1 (nm_clone->nodes, n);
818 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
819 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
820 CLIB_CACHE_LINE_BYTES);
822 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
824 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
825 rt->thread_index = vm_clone->thread_index;
826 /* copy initial runtime_data from node */
827 if (n->runtime_data && n->runtime_data_bytes > 0)
828 clib_memcpy (rt->runtime_data, n->runtime_data,
829 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
830 n->runtime_data_bytes));
833 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
834 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
835 CLIB_CACHE_LINE_BYTES);
836 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
838 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
839 rt->thread_index = vm_clone->thread_index;
840 /* copy initial runtime_data from node */
841 if (n->runtime_data && n->runtime_data_bytes > 0)
842 clib_memcpy (rt->runtime_data, n->runtime_data,
843 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
844 n->runtime_data_bytes));
847 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
848 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
849 CLIB_CACHE_LINE_BYTES);
851 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_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->processes = vec_dup_aligned (nm->processes,
863 CLIB_CACHE_LINE_BYTES);
865 /* Create per-thread frame freelist */
866 nm_clone->frame_sizes = vec_new (vlib_frame_size_t, 1);
867 #ifdef VLIB_SUPPORTS_ARBITRARY_SCALAR_SIZES
868 nm_clone->frame_size_hash = hash_create (0, sizeof (uword));
870 nm_clone->node_by_error = nm->node_by_error;
872 /* Packet trace buffers are guaranteed to be empty, nothing to do here */
874 clib_mem_set_heap (oldheap);
875 vec_add1_aligned (vlib_mains, vm_clone, CLIB_CACHE_LINE_BYTES);
877 /* Switch to the stats segment ... */
878 void *oldheap = vlib_stats_push_heap (0);
879 vm_clone->error_main.counters = vec_dup_aligned
880 (vlib_mains[0]->error_main.counters, CLIB_CACHE_LINE_BYTES);
881 vlib_stats_pop_heap2 (vm_clone->error_main.counters,
882 worker_thread_index, oldheap, 1);
884 vm_clone->error_main.counters_last_clear = vec_dup_aligned
885 (vlib_mains[0]->error_main.counters_last_clear,
886 CLIB_CACHE_LINE_BYTES);
888 worker_thread_index++;
894 /* only have non-data-structure copy threads to create... */
895 for (i = 0; i < vec_len (tm->registrations); i++)
897 tr = tm->registrations[i];
899 for (j = 0; j < tr->count; j++)
901 vec_add2 (vlib_worker_threads, w, 1);
904 #if USE_DLMALLOC == 0
906 mheap_alloc (0 /* use VM */ , tr->mheap_size);
909 create_mspace (tr->mheap_size, 0 /* locked */ );
913 w->thread_mheap = main_heap;
915 vlib_thread_stack_init (w - vlib_worker_threads);
916 w->thread_function = tr->function;
917 w->thread_function_arg = w;
920 (char *) format (0, "%s %d", tr->name, j + 1);
921 w->registration = tr;
922 vec_add1 (w->elog_track.name, 0);
923 elog_track_register (&vm->elog_main, &w->elog_track);
928 worker_thread_index = 1;
930 for (i = 0; i < vec_len (tm->registrations); i++)
935 tr = tm->registrations[i];
937 if (tr->use_pthreads || tm->use_pthreads)
939 for (j = 0; j < tr->count; j++)
941 w = vlib_worker_threads + worker_thread_index++;
942 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
945 clib_error_report (err);
952 clib_bitmap_foreach (c, tr->coremask, ({
953 w = vlib_worker_threads + worker_thread_index++;
954 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
957 clib_error_report (err);
962 vlib_worker_thread_barrier_sync (vm);
963 vlib_worker_thread_barrier_release (vm);
967 VLIB_MAIN_LOOP_ENTER_FUNCTION (start_workers);
971 worker_thread_node_runtime_update_internal (void)
975 vlib_node_main_t *nm, *nm_clone;
976 vlib_main_t *vm_clone;
977 vlib_node_runtime_t *rt;
979 vlib_node_runtime_sync_stats (vlib_main_t * vm,
980 vlib_node_runtime_t * r,
982 uword n_vectors, uword n_clocks);
984 ASSERT (vlib_get_thread_index () == 0);
989 ASSERT (*vlib_worker_threads->wait_at_barrier == 1);
992 * Scrape all runtime stats, so we don't lose node runtime(s) with
993 * pending counts, or throw away worker / io thread counts.
995 for (j = 0; j < vec_len (nm->nodes); j++)
999 vlib_node_sync_stats (vm, n);
1002 for (i = 1; i < vec_len (vlib_mains); i++)
1006 vm_clone = vlib_mains[i];
1007 nm_clone = &vm_clone->node_main;
1009 for (j = 0; j < vec_len (nm_clone->nodes); j++)
1011 n = nm_clone->nodes[j];
1013 rt = vlib_node_get_runtime (vm_clone, n->index);
1014 vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
1018 /* Per-worker clone rebuilds are now done on each thread */
1023 vlib_worker_thread_node_refork (void)
1025 vlib_main_t *vm, *vm_clone;
1026 vlib_node_main_t *nm, *nm_clone;
1027 vlib_node_t **old_nodes_clone;
1028 vlib_node_runtime_t *rt, *old_rt;
1030 vlib_node_t *new_n_clone;
1035 nm = &vm->node_main;
1036 vm_clone = vlib_get_main ();
1037 nm_clone = &vm_clone->node_main;
1039 /* Re-clone error heap */
1040 u64 *old_counters = vm_clone->error_main.counters;
1041 u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
1043 clib_memcpy_fast (&vm_clone->error_main, &vm->error_main,
1044 sizeof (vm->error_main));
1045 j = vec_len (vm->error_main.counters) - 1;
1047 /* Switch to the stats segment ... */
1048 void *oldheap = vlib_stats_push_heap (0);
1049 vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
1050 vm_clone->error_main.counters = old_counters;
1051 vlib_stats_pop_heap2 (vm_clone->error_main.counters, vm_clone->thread_index,
1054 vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
1055 vm_clone->error_main.counters_last_clear = old_counters_all_clear;
1057 nm_clone = &vm_clone->node_main;
1058 vec_free (nm_clone->next_frames);
1059 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
1060 CLIB_CACHE_LINE_BYTES);
1062 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
1064 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
1065 u32 save_node_runtime_index;
1068 save_node_runtime_index = nf->node_runtime_index;
1069 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
1070 vlib_next_frame_init (nf);
1071 nf->node_runtime_index = save_node_runtime_index;
1072 nf->flags = save_flags;
1075 old_nodes_clone = nm_clone->nodes;
1076 nm_clone->nodes = 0;
1080 /* Allocate all nodes in single block for speed */
1082 clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*new_n_clone));
1083 for (j = 0; j < vec_len (nm->nodes); j++)
1085 vlib_node_t *new_n = nm->nodes[j];
1087 clib_memcpy_fast (new_n_clone, new_n, sizeof (*new_n));
1088 /* none of the copied nodes have enqueue rights given out */
1089 new_n_clone->owner_node_index = VLIB_INVALID_NODE_INDEX;
1091 if (j >= vec_len (old_nodes_clone))
1093 /* new node, set to zero */
1094 clib_memset (&new_n_clone->stats_total, 0,
1095 sizeof (new_n_clone->stats_total));
1096 clib_memset (&new_n_clone->stats_last_clear, 0,
1097 sizeof (new_n_clone->stats_last_clear));
1101 vlib_node_t *old_n_clone = old_nodes_clone[j];
1102 /* Copy stats if the old data is valid */
1103 clib_memcpy_fast (&new_n_clone->stats_total,
1104 &old_n_clone->stats_total,
1105 sizeof (new_n_clone->stats_total));
1106 clib_memcpy_fast (&new_n_clone->stats_last_clear,
1107 &old_n_clone->stats_last_clear,
1108 sizeof (new_n_clone->stats_last_clear));
1110 /* keep previous node state */
1111 new_n_clone->state = old_n_clone->state;
1113 vec_add1 (nm_clone->nodes, new_n_clone);
1116 /* Free the old node clones */
1117 clib_mem_free (old_nodes_clone[0]);
1119 vec_free (old_nodes_clone);
1122 /* re-clone internal nodes */
1123 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL];
1124 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
1125 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
1126 CLIB_CACHE_LINE_BYTES);
1128 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
1130 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1131 rt->thread_index = vm_clone->thread_index;
1132 /* copy runtime_data, will be overwritten later for existing rt */
1133 if (n->runtime_data && n->runtime_data_bytes > 0)
1134 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1135 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1136 n->runtime_data_bytes));
1139 for (j = 0; j < vec_len (old_rt); j++)
1141 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1142 rt->state = old_rt[j].state;
1143 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1144 VLIB_NODE_RUNTIME_DATA_SIZE);
1149 /* re-clone input nodes */
1150 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
1151 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
1152 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
1153 CLIB_CACHE_LINE_BYTES);
1155 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
1157 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1158 rt->thread_index = vm_clone->thread_index;
1159 /* copy runtime_data, will be overwritten later for existing rt */
1160 if (n->runtime_data && n->runtime_data_bytes > 0)
1161 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1162 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1163 n->runtime_data_bytes));
1166 for (j = 0; j < vec_len (old_rt); j++)
1168 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1169 rt->state = old_rt[j].state;
1170 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1171 VLIB_NODE_RUNTIME_DATA_SIZE);
1176 /* re-clone pre-input nodes */
1177 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT];
1178 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
1179 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
1180 CLIB_CACHE_LINE_BYTES);
1182 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
1184 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1185 rt->thread_index = vm_clone->thread_index;
1186 /* copy runtime_data, will be overwritten later for existing rt */
1187 if (n->runtime_data && n->runtime_data_bytes > 0)
1188 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1189 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1190 n->runtime_data_bytes));
1193 for (j = 0; j < vec_len (old_rt); j++)
1195 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1196 rt->state = old_rt[j].state;
1197 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1198 VLIB_NODE_RUNTIME_DATA_SIZE);
1203 nm_clone->processes = vec_dup_aligned (nm->processes,
1204 CLIB_CACHE_LINE_BYTES);
1205 nm_clone->node_by_error = nm->node_by_error;
1209 vlib_worker_thread_node_runtime_update (void)
1212 * Make a note that we need to do a node runtime update
1213 * prior to releasing the barrier.
1215 vlib_global_main.need_vlib_worker_thread_node_runtime_update = 1;
1219 unformat_sched_policy (unformat_input_t * input, va_list * args)
1221 u32 *r = va_arg (*args, u32 *);
1224 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
1225 foreach_sched_policy
1232 static clib_error_t *
1233 cpu_config (vlib_main_t * vm, unformat_input_t * input)
1235 vlib_thread_registration_t *tr;
1237 vlib_thread_main_t *tm = &vlib_thread_main;
1242 tm->thread_registrations_by_name = hash_create_string (0, sizeof (uword));
1244 tm->n_thread_stacks = 1; /* account for main thread */
1245 tm->sched_policy = ~0;
1246 tm->sched_priority = ~0;
1247 tm->main_lcore = ~0;
1253 hash_set_mem (tm->thread_registrations_by_name, tr->name, (uword) tr);
1257 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1259 if (unformat (input, "use-pthreads"))
1260 tm->use_pthreads = 1;
1261 else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1263 else if (unformat (input, "main-core %u", &tm->main_lcore))
1265 else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1267 else if (unformat (input, "numa-heap-size %U",
1268 unformat_memory_size, &tm->numa_heap_size))
1270 else if (unformat (input, "coremask-%s %U", &name,
1271 unformat_bitmap_mask, &bitmap) ||
1272 unformat (input, "corelist-%s %U", &name,
1273 unformat_bitmap_list, &bitmap))
1275 p = hash_get_mem (tm->thread_registrations_by_name, name);
1277 return clib_error_return (0, "no such thread type '%s'", name);
1279 tr = (vlib_thread_registration_t *) p[0];
1281 if (tr->use_pthreads)
1282 return clib_error_return (0,
1283 "corelist cannot be set for '%s' threads",
1286 tr->coremask = bitmap;
1287 tr->count = clib_bitmap_count_set_bits (tr->coremask);
1291 (input, "scheduler-policy %U", unformat_sched_policy,
1294 else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1296 else if (unformat (input, "%s %u", &name, &count))
1298 p = hash_get_mem (tm->thread_registrations_by_name, name);
1300 return clib_error_return (0, "no such thread type 3 '%s'", name);
1302 tr = (vlib_thread_registration_t *) p[0];
1303 if (tr->fixed_count)
1304 return clib_error_return
1305 (0, "number of %s threads not configurable", tr->name);
1312 if (tm->sched_priority != ~0)
1314 if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1316 u32 prio_max = sched_get_priority_max (tm->sched_policy);
1317 u32 prio_min = sched_get_priority_min (tm->sched_policy);
1318 if (tm->sched_priority > prio_max)
1319 tm->sched_priority = prio_max;
1320 if (tm->sched_priority < prio_min)
1321 tm->sched_priority = prio_min;
1325 return clib_error_return
1327 "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1328 tm->sched_priority);
1333 if (!tm->thread_prefix)
1334 tm->thread_prefix = format (0, "vpp");
1338 tm->n_thread_stacks += tr->count;
1339 tm->n_pthreads += tr->count * tr->use_pthreads;
1340 tm->n_threads += tr->count * (tr->use_pthreads == 0);
1347 VLIB_EARLY_CONFIG_FUNCTION (cpu_config, "cpu");
1349 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1351 vnet_main_fixup (vlib_fork_fixup_t which)
1356 vlib_worker_thread_fork_fixup (vlib_fork_fixup_t which)
1358 vlib_main_t *vm = vlib_get_main ();
1360 if (vlib_mains == 0)
1363 ASSERT (vlib_get_thread_index () == 0);
1364 vlib_worker_thread_barrier_sync (vm);
1368 case VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX:
1369 vnet_main_fixup (VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX);
1375 vlib_worker_thread_barrier_release (vm);
1379 * Enforce minimum open time to minimize packet loss due to Rx overflow,
1380 * based on a test based heuristic that barrier should be open for at least
1381 * 3 time as long as it is closed (with an upper bound of 1ms because by that
1382 * point it is probably too late to make a difference)
1385 #ifndef BARRIER_MINIMUM_OPEN_LIMIT
1386 #define BARRIER_MINIMUM_OPEN_LIMIT 0.001
1389 #ifndef BARRIER_MINIMUM_OPEN_FACTOR
1390 #define BARRIER_MINIMUM_OPEN_FACTOR 3
1394 vlib_worker_thread_initial_barrier_sync_and_release (vlib_main_t * vm)
1397 f64 now = vlib_time_now (vm);
1398 u32 count = vec_len (vlib_mains) - 1;
1400 /* No worker threads? */
1404 deadline = now + BARRIER_SYNC_TIMEOUT;
1405 *vlib_worker_threads->wait_at_barrier = 1;
1406 while (*vlib_worker_threads->workers_at_barrier != count)
1408 if ((now = vlib_time_now (vm)) > deadline)
1410 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1415 *vlib_worker_threads->wait_at_barrier = 0;
1419 vlib_worker_thread_barrier_sync_int (vlib_main_t * vm, const char *func_name)
1426 f64 max_vector_rate;
1430 if (vec_len (vlib_mains) < 2)
1433 ASSERT (vlib_get_thread_index () == 0);
1435 vlib_worker_threads[0].barrier_caller = func_name;
1436 count = vec_len (vlib_mains) - 1;
1438 /* Record entry relative to last close */
1439 now = vlib_time_now (vm);
1440 t_entry = now - vm->barrier_epoch;
1442 /* Tolerate recursive calls */
1443 if (++vlib_worker_threads[0].recursion_level > 1)
1445 barrier_trace_sync_rec (t_entry);
1450 * Need data to decide if we're working hard enough to honor
1451 * the barrier hold-down timer.
1453 max_vector_rate = 0.0;
1454 for (i = 1; i < vec_len (vlib_mains); i++)
1456 clib_max (max_vector_rate,
1457 (f64) vlib_last_vectors_per_main_loop (vlib_mains[i]));
1459 vlib_worker_threads[0].barrier_sync_count++;
1461 /* Enforce minimum barrier open time to minimize packet loss */
1462 ASSERT (vm->barrier_no_close_before <= (now + BARRIER_MINIMUM_OPEN_LIMIT));
1465 * If any worker thread seems busy, which we define
1466 * as a vector rate above 10, we enforce the barrier hold-down timer
1468 if (max_vector_rate > 10.0)
1472 now = vlib_time_now (vm);
1473 /* Barrier hold-down timer expired? */
1474 if (now >= vm->barrier_no_close_before)
1476 if ((vm->barrier_no_close_before - now)
1477 > (2.0 * BARRIER_MINIMUM_OPEN_LIMIT))
1480 ("clock change: would have waited for %.4f seconds",
1481 (vm->barrier_no_close_before - now));
1486 /* Record time of closure */
1487 t_open = now - vm->barrier_epoch;
1488 vm->barrier_epoch = now;
1490 deadline = now + BARRIER_SYNC_TIMEOUT;
1492 *vlib_worker_threads->wait_at_barrier = 1;
1493 while (*vlib_worker_threads->workers_at_barrier != count)
1495 if ((now = vlib_time_now (vm)) > deadline)
1497 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1502 t_closed = now - vm->barrier_epoch;
1504 barrier_trace_sync (t_entry, t_open, t_closed);
1509 vlib_worker_thread_barrier_release (vlib_main_t * vm)
1516 f64 t_update_main = 0.0;
1517 int refork_needed = 0;
1519 if (vec_len (vlib_mains) < 2)
1522 ASSERT (vlib_get_thread_index () == 0);
1525 now = vlib_time_now (vm);
1526 t_entry = now - vm->barrier_epoch;
1528 if (--vlib_worker_threads[0].recursion_level > 0)
1530 barrier_trace_release_rec (t_entry);
1534 /* Update (all) node runtimes before releasing the barrier, if needed */
1535 if (vm->need_vlib_worker_thread_node_runtime_update)
1538 * Lock stat segment here, so we's safe when
1539 * rebuilding the stat segment node clones from the
1542 vlib_stat_segment_lock ();
1544 /* Do stats elements on main thread */
1545 worker_thread_node_runtime_update_internal ();
1546 vm->need_vlib_worker_thread_node_runtime_update = 0;
1548 /* Do per thread rebuilds in parallel */
1550 clib_atomic_fetch_add (vlib_worker_threads->node_reforks_required,
1551 (vec_len (vlib_mains) - 1));
1552 now = vlib_time_now (vm);
1553 t_update_main = now - vm->barrier_epoch;
1556 deadline = now + BARRIER_SYNC_TIMEOUT;
1559 * Note when we let go of the barrier.
1560 * Workers can use this to derive a reasonably accurate
1561 * time offset. See vlib_time_now(...)
1563 vm->time_last_barrier_release = vlib_time_now (vm);
1564 CLIB_MEMORY_STORE_BARRIER ();
1566 *vlib_worker_threads->wait_at_barrier = 0;
1568 while (*vlib_worker_threads->workers_at_barrier > 0)
1570 if ((now = vlib_time_now (vm)) > deadline)
1572 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1577 /* Wait for reforks before continuing */
1580 now = vlib_time_now (vm);
1582 deadline = now + BARRIER_SYNC_TIMEOUT;
1584 while (*vlib_worker_threads->node_reforks_required > 0)
1586 if ((now = vlib_time_now (vm)) > deadline)
1588 fformat (stderr, "%s: worker thread refork deadlock\n",
1593 vlib_stat_segment_unlock ();
1596 t_closed_total = now - vm->barrier_epoch;
1598 minimum_open = t_closed_total * BARRIER_MINIMUM_OPEN_FACTOR;
1600 if (minimum_open > BARRIER_MINIMUM_OPEN_LIMIT)
1602 minimum_open = BARRIER_MINIMUM_OPEN_LIMIT;
1605 vm->barrier_no_close_before = now + minimum_open;
1607 /* Record barrier epoch (used to enforce minimum open time) */
1608 vm->barrier_epoch = now;
1610 barrier_trace_release (t_entry, t_closed_total, t_update_main);
1615 * Check the frame queue to see if any frames are available.
1616 * If so, pull the packets off the frames and put them to
1620 vlib_frame_queue_dequeue (vlib_main_t * vm, vlib_frame_queue_main_t * fqm)
1622 u32 thread_id = vm->thread_index;
1623 vlib_frame_queue_t *fq = fqm->vlib_frame_queues[thread_id];
1624 vlib_frame_queue_elt_t *elt;
1633 ASSERT (vm == vlib_mains[thread_id]);
1635 if (PREDICT_FALSE (fqm->node_index == ~0))
1638 * Gather trace data for frame queues
1640 if (PREDICT_FALSE (fq->trace))
1642 frame_queue_trace_t *fqt;
1643 frame_queue_nelt_counter_t *fqh;
1646 fqt = &fqm->frame_queue_traces[thread_id];
1648 fqt->nelts = fq->nelts;
1649 fqt->head = fq->head;
1650 fqt->head_hint = fq->head_hint;
1651 fqt->tail = fq->tail;
1652 fqt->threshold = fq->vector_threshold;
1653 fqt->n_in_use = fqt->tail - fqt->head;
1654 if (fqt->n_in_use >= fqt->nelts)
1656 // if beyond max then use max
1657 fqt->n_in_use = fqt->nelts - 1;
1660 /* Record the number of elements in use in the histogram */
1661 fqh = &fqm->frame_queue_histogram[thread_id];
1662 fqh->count[fqt->n_in_use]++;
1664 /* Record a snapshot of the elements in use */
1665 for (elix = 0; elix < fqt->nelts; elix++)
1667 elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1668 if (1 || elt->valid)
1670 fqt->n_vectors[elix] = elt->n_vectors;
1679 if (fq->head == fq->tail)
1681 fq->head_hint = fq->head;
1685 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1689 fq->head_hint = fq->head;
1693 from = elt->buffer_index;
1694 msg_type = elt->msg_type;
1696 ASSERT (msg_type == VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME);
1697 ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1699 f = vlib_get_frame_to_node (vm, fqm->node_index);
1701 /* If the first vector is traced, set the frame trace flag */
1702 b = vlib_get_buffer (vm, from[0]);
1703 if (b->flags & VLIB_BUFFER_IS_TRACED)
1704 f->frame_flags |= VLIB_NODE_FLAG_TRACE;
1706 to = vlib_frame_vector_args (f);
1708 n_left_to_node = elt->n_vectors;
1710 while (n_left_to_node >= 4)
1718 n_left_to_node -= 4;
1721 while (n_left_to_node > 0)
1729 vectors += elt->n_vectors;
1730 f->n_vectors = elt->n_vectors;
1731 vlib_put_frame_to_node (vm, fqm->node_index, f);
1735 elt->msg_type = 0xfefefefe;
1736 CLIB_MEMORY_BARRIER ();
1741 * Limit the number of packets pushed into the graph
1743 if (vectors >= fq->vector_threshold)
1745 fq->head_hint = fq->head;
1754 vlib_worker_thread_fn (void *arg)
1756 vlib_worker_thread_t *w = (vlib_worker_thread_t *) arg;
1757 vlib_thread_main_t *tm = vlib_get_thread_main ();
1758 vlib_main_t *vm = vlib_get_main ();
1761 ASSERT (vm->thread_index == vlib_get_thread_index ());
1763 vlib_worker_thread_init (w);
1764 clib_time_init (&vm->clib_time);
1765 clib_mem_set_heap (w->thread_mheap);
1767 e = vlib_call_init_exit_functions_no_sort
1768 (vm, &vm->worker_init_function_registrations, 1 /* call_once */ );
1770 clib_error_report (e);
1772 /* Wait until the dpdk init sequence is complete */
1773 while (tm->extern_thread_mgmt && tm->worker_thread_release == 0)
1774 vlib_worker_thread_barrier_check ();
1776 vlib_worker_loop (vm);
1780 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1783 .function = vlib_worker_thread_fn,
1788 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts)
1790 vlib_thread_main_t *tm = vlib_get_thread_main ();
1791 vlib_frame_queue_main_t *fqm;
1792 vlib_frame_queue_t *fq;
1795 if (frame_queue_nelts == 0)
1796 frame_queue_nelts = FRAME_QUEUE_MAX_NELTS;
1798 ASSERT (frame_queue_nelts >= 8);
1800 vec_add2 (tm->frame_queue_mains, fqm, 1);
1802 fqm->node_index = node_index;
1803 fqm->frame_queue_nelts = frame_queue_nelts;
1804 fqm->queue_hi_thresh = frame_queue_nelts - 2;
1806 vec_validate (fqm->vlib_frame_queues, tm->n_vlib_mains - 1);
1807 vec_validate (fqm->per_thread_data, tm->n_vlib_mains - 1);
1808 _vec_len (fqm->vlib_frame_queues) = 0;
1809 for (i = 0; i < tm->n_vlib_mains; i++)
1811 vlib_frame_queue_per_thread_data_t *ptd;
1812 fq = vlib_frame_queue_alloc (frame_queue_nelts);
1813 vec_add1 (fqm->vlib_frame_queues, fq);
1815 ptd = vec_elt_at_index (fqm->per_thread_data, i);
1816 vec_validate (ptd->handoff_queue_elt_by_thread_index,
1817 tm->n_vlib_mains - 1);
1818 vec_validate_init_empty (ptd->congested_handoff_queue_by_thread_index,
1819 tm->n_vlib_mains - 1,
1820 (vlib_frame_queue_t *) (~0));
1823 return (fqm - tm->frame_queue_mains);
1827 vlib_thread_cb_register (struct vlib_main_t *vm, vlib_thread_callbacks_t * cb)
1829 vlib_thread_main_t *tm = vlib_get_thread_main ();
1831 if (tm->extern_thread_mgmt)
1834 tm->cb.vlib_launch_thread_cb = cb->vlib_launch_thread_cb;
1835 tm->extern_thread_mgmt = 1;
1840 vlib_process_signal_event_mt_helper (vlib_process_signal_event_mt_args_t *
1843 ASSERT (vlib_get_thread_index () == 0);
1844 vlib_process_signal_event (vlib_get_main (), args->node_index,
1845 args->type_opaque, args->data);
1848 void *rpc_call_main_thread_cb_fn;
1851 vlib_rpc_call_main_thread (void *callback, u8 * args, u32 arg_size)
1853 if (rpc_call_main_thread_cb_fn)
1855 void (*fp) (void *, u8 *, u32) = rpc_call_main_thread_cb_fn;
1856 (*fp) (callback, args, arg_size);
1859 clib_warning ("BUG: rpc_call_main_thread_cb_fn NULL!");
1863 threads_init (vlib_main_t * vm)
1868 VLIB_INIT_FUNCTION (threads_init);
1871 static clib_error_t *
1872 show_clock_command_fn (vlib_main_t * vm,
1873 unformat_input_t * input, vlib_cli_command_t * cmd)
1878 (void) unformat (input, "verbose %=", &verbose, 1);
1880 vlib_cli_output (vm, "%U", format_clib_time, &vm->clib_time, verbose);
1882 if (vec_len (vlib_mains) == 1)
1885 vlib_cli_output (vm, "Time last barrier release %.9f",
1886 vm->time_last_barrier_release);
1888 for (i = 1; i < vec_len (vlib_mains); i++)
1890 if (vlib_mains[i] == 0)
1893 vlib_cli_output (vm, "%d: %U", i, format_clib_time,
1894 &vlib_mains[i]->clib_time, verbose);
1896 vlib_cli_output (vm, "Thread %d offset %.9f error %.9f", i,
1897 vlib_mains[i]->time_offset,
1898 vm->time_last_barrier_release -
1899 vlib_mains[i]->time_last_barrier_release);
1905 VLIB_CLI_COMMAND (f_command, static) =
1907 .path = "show clock",
1908 .short_help = "show clock",
1909 .function = show_clock_command_fn,
1914 * fd.io coding-style-patch-verification: ON
1917 * eval: (c-set-style "gnu")