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);
592 p = format (p, "%s%u/topology/physical_package_id%c", sys_cpu_path,
594 clib_sysfs_read ((char *) p, "%d", &numa_id);
597 w->core_id = core_id;
598 w->numa_id = numa_id;
601 static clib_error_t *
602 vlib_launch_thread_int (void *fp, vlib_worker_thread_t * w, unsigned cpu_id)
604 vlib_thread_main_t *tm = &vlib_thread_main;
605 void *(*fp_arg) (void *) = fp;
609 vlib_get_thread_core_numa (w, cpu_id);
611 /* Set up NUMA-bound heap if indicated */
612 if (clib_per_numa_mheaps[w->numa_id] == 0)
614 /* If the user requested a NUMA heap, create it... */
615 if (tm->numa_heap_size)
617 numa_heap = clib_mem_init_thread_safe_numa
618 (0 /* DIY */ , tm->numa_heap_size, w->numa_id);
619 clib_per_numa_mheaps[w->numa_id] = numa_heap;
623 /* Or, use the main heap */
624 clib_per_numa_mheaps[w->numa_id] = w->thread_mheap;
628 if (tm->cb.vlib_launch_thread_cb && !w->registration->use_pthreads)
629 return tm->cb.vlib_launch_thread_cb (fp, (void *) w, cpu_id);
635 CPU_SET (cpu_id, &cpuset);
637 if (pthread_create (&worker, NULL /* attr */ , fp_arg, (void *) w))
638 return clib_error_return_unix (0, "pthread_create");
640 if (pthread_setaffinity_np (worker, sizeof (cpu_set_t), &cpuset))
641 return clib_error_return_unix (0, "pthread_setaffinity_np");
647 static clib_error_t *
648 start_workers (vlib_main_t * vm)
651 vlib_worker_thread_t *w;
652 vlib_main_t *vm_clone;
654 vlib_thread_main_t *tm = &vlib_thread_main;
655 vlib_thread_registration_t *tr;
656 vlib_node_runtime_t *rt;
657 u32 n_vlib_mains = tm->n_vlib_mains;
658 u32 worker_thread_index;
659 u8 *main_heap = clib_mem_get_per_cpu_heap ();
661 vec_reset_length (vlib_worker_threads);
663 /* Set up the main thread */
664 vec_add2_aligned (vlib_worker_threads, w, 1, CLIB_CACHE_LINE_BYTES);
665 w->elog_track.name = "main thread";
666 elog_track_register (&vm->elog_main, &w->elog_track);
668 if (vec_len (tm->thread_prefix))
670 w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
671 vlib_set_thread_name ((char *) w->name);
675 clib_mem_alloc_aligned (CLIB_CACHE_LINE_BYTES, CLIB_CACHE_LINE_BYTES);
676 vm->elog_main.lock[0] = 0;
678 if (n_vlib_mains > 1)
680 /* Replace hand-crafted length-1 vector with a real vector */
683 vec_validate_aligned (vlib_mains, tm->n_vlib_mains - 1,
684 CLIB_CACHE_LINE_BYTES);
685 _vec_len (vlib_mains) = 0;
686 vec_add1_aligned (vlib_mains, vm, CLIB_CACHE_LINE_BYTES);
688 vlib_worker_threads->wait_at_barrier =
689 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
690 vlib_worker_threads->workers_at_barrier =
691 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
693 vlib_worker_threads->node_reforks_required =
694 clib_mem_alloc_aligned (sizeof (u32), CLIB_CACHE_LINE_BYTES);
696 /* We'll need the rpc vector lock... */
697 clib_spinlock_init (&vm->pending_rpc_lock);
699 /* Ask for an initial barrier sync */
700 *vlib_worker_threads->workers_at_barrier = 0;
701 *vlib_worker_threads->wait_at_barrier = 1;
703 /* Without update or refork */
704 *vlib_worker_threads->node_reforks_required = 0;
705 vm->need_vlib_worker_thread_node_runtime_update = 0;
708 vm->barrier_epoch = 0;
709 vm->barrier_no_close_before = 0;
711 worker_thread_index = 1;
713 for (i = 0; i < vec_len (tm->registrations); i++)
715 vlib_node_main_t *nm, *nm_clone;
718 tr = tm->registrations[i];
723 for (k = 0; k < tr->count; k++)
727 vec_add2 (vlib_worker_threads, w, 1);
728 /* Currently unused, may not really work */
731 #if USE_DLMALLOC == 0
733 mheap_alloc (0 /* use VM */ , tr->mheap_size);
735 w->thread_mheap = create_mspace (tr->mheap_size,
740 w->thread_mheap = main_heap;
743 vlib_thread_stack_init (w - vlib_worker_threads);
744 w->thread_function = tr->function;
745 w->thread_function_arg = w;
747 w->registration = tr;
750 (char *) format (0, "%s %d", tr->name, k + 1);
751 vec_add1 (w->elog_track.name, 0);
752 elog_track_register (&vm->elog_main, &w->elog_track);
754 if (tr->no_data_structure_clone)
757 /* Fork vlib_global_main et al. Look for bugs here */
758 oldheap = clib_mem_set_heap (w->thread_mheap);
760 vm_clone = clib_mem_alloc_aligned (sizeof (*vm_clone),
761 CLIB_CACHE_LINE_BYTES);
762 clib_memcpy (vm_clone, vlib_mains[0], sizeof (*vm_clone));
764 vm_clone->thread_index = worker_thread_index;
765 vm_clone->heap_base = w->thread_mheap;
766 vm_clone->heap_aligned_base = (void *)
767 (((uword) w->thread_mheap) & ~(VLIB_FRAME_ALIGN - 1));
768 vm_clone->init_functions_called =
769 hash_create (0, /* value bytes */ 0);
770 vm_clone->pending_rpc_requests = 0;
771 vec_validate (vm_clone->pending_rpc_requests, 0);
772 _vec_len (vm_clone->pending_rpc_requests) = 0;
773 clib_memset (&vm_clone->random_buffer, 0,
774 sizeof (vm_clone->random_buffer));
776 nm = &vlib_mains[0]->node_main;
777 nm_clone = &vm_clone->node_main;
778 /* fork next frames array, preserving node runtime indices */
779 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
780 CLIB_CACHE_LINE_BYTES);
781 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
783 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
784 u32 save_node_runtime_index;
787 save_node_runtime_index = nf->node_runtime_index;
788 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
789 vlib_next_frame_init (nf);
790 nf->node_runtime_index = save_node_runtime_index;
791 nf->flags = save_flags;
794 /* fork the frame dispatch queue */
795 nm_clone->pending_frames = 0;
796 vec_validate (nm_clone->pending_frames, 10);
797 _vec_len (nm_clone->pending_frames) = 0;
802 /* Allocate all nodes in single block for speed */
803 n = clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*n));
805 for (j = 0; j < vec_len (nm->nodes); j++)
807 clib_memcpy (n, nm->nodes[j], sizeof (*n));
808 /* none of the copied nodes have enqueue rights given out */
809 n->owner_node_index = VLIB_INVALID_NODE_INDEX;
810 clib_memset (&n->stats_total, 0, sizeof (n->stats_total));
811 clib_memset (&n->stats_last_clear, 0,
812 sizeof (n->stats_last_clear));
813 vec_add1 (nm_clone->nodes, n);
816 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
817 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
818 CLIB_CACHE_LINE_BYTES);
820 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
822 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
823 rt->thread_index = vm_clone->thread_index;
824 /* copy initial runtime_data from node */
825 if (n->runtime_data && n->runtime_data_bytes > 0)
826 clib_memcpy (rt->runtime_data, n->runtime_data,
827 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
828 n->runtime_data_bytes));
831 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
832 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
833 CLIB_CACHE_LINE_BYTES);
834 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
836 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
837 rt->thread_index = vm_clone->thread_index;
838 /* copy initial runtime_data from node */
839 if (n->runtime_data && n->runtime_data_bytes > 0)
840 clib_memcpy (rt->runtime_data, n->runtime_data,
841 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
842 n->runtime_data_bytes));
845 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
846 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
847 CLIB_CACHE_LINE_BYTES);
849 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
851 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
852 rt->thread_index = vm_clone->thread_index;
853 /* copy initial runtime_data from node */
854 if (n->runtime_data && n->runtime_data_bytes > 0)
855 clib_memcpy (rt->runtime_data, n->runtime_data,
856 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
857 n->runtime_data_bytes));
860 nm_clone->processes = vec_dup_aligned (nm->processes,
861 CLIB_CACHE_LINE_BYTES);
863 /* Create per-thread frame freelist */
864 nm_clone->frame_sizes = vec_new (vlib_frame_size_t, 1);
865 #ifdef VLIB_SUPPORTS_ARBITRARY_SCALAR_SIZES
866 nm_clone->frame_size_hash = hash_create (0, sizeof (uword));
868 nm_clone->node_by_error = nm->node_by_error;
870 /* Packet trace buffers are guaranteed to be empty, nothing to do here */
872 clib_mem_set_heap (oldheap);
873 vec_add1_aligned (vlib_mains, vm_clone, CLIB_CACHE_LINE_BYTES);
875 /* Switch to the stats segment ... */
876 void *oldheap = vlib_stats_push_heap (0);
877 vm_clone->error_main.counters = vec_dup_aligned
878 (vlib_mains[0]->error_main.counters, CLIB_CACHE_LINE_BYTES);
879 vlib_stats_pop_heap2 (vm_clone->error_main.counters,
880 worker_thread_index, oldheap, 1);
882 vm_clone->error_main.counters_last_clear = vec_dup_aligned
883 (vlib_mains[0]->error_main.counters_last_clear,
884 CLIB_CACHE_LINE_BYTES);
886 worker_thread_index++;
892 /* only have non-data-structure copy threads to create... */
893 for (i = 0; i < vec_len (tm->registrations); i++)
895 tr = tm->registrations[i];
897 for (j = 0; j < tr->count; j++)
899 vec_add2 (vlib_worker_threads, w, 1);
902 #if USE_DLMALLOC == 0
904 mheap_alloc (0 /* use VM */ , tr->mheap_size);
907 create_mspace (tr->mheap_size, 0 /* locked */ );
911 w->thread_mheap = main_heap;
913 vlib_thread_stack_init (w - vlib_worker_threads);
914 w->thread_function = tr->function;
915 w->thread_function_arg = w;
918 (char *) format (0, "%s %d", tr->name, j + 1);
919 w->registration = tr;
920 vec_add1 (w->elog_track.name, 0);
921 elog_track_register (&vm->elog_main, &w->elog_track);
926 worker_thread_index = 1;
928 for (i = 0; i < vec_len (tm->registrations); i++)
933 tr = tm->registrations[i];
935 if (tr->use_pthreads || tm->use_pthreads)
937 for (j = 0; j < tr->count; j++)
939 w = vlib_worker_threads + worker_thread_index++;
940 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
943 clib_error_report (err);
950 clib_bitmap_foreach (c, tr->coremask, ({
951 w = vlib_worker_threads + worker_thread_index++;
952 err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
955 clib_error_report (err);
960 vlib_worker_thread_barrier_sync (vm);
961 vlib_worker_thread_barrier_release (vm);
965 VLIB_MAIN_LOOP_ENTER_FUNCTION (start_workers);
969 worker_thread_node_runtime_update_internal (void)
973 vlib_node_main_t *nm, *nm_clone;
974 vlib_main_t *vm_clone;
975 vlib_node_runtime_t *rt;
977 vlib_node_runtime_sync_stats (vlib_main_t * vm,
978 vlib_node_runtime_t * r,
980 uword n_vectors, uword n_clocks);
982 ASSERT (vlib_get_thread_index () == 0);
987 ASSERT (*vlib_worker_threads->wait_at_barrier == 1);
990 * Scrape all runtime stats, so we don't lose node runtime(s) with
991 * pending counts, or throw away worker / io thread counts.
993 for (j = 0; j < vec_len (nm->nodes); j++)
997 vlib_node_sync_stats (vm, n);
1000 for (i = 1; i < vec_len (vlib_mains); i++)
1004 vm_clone = vlib_mains[i];
1005 nm_clone = &vm_clone->node_main;
1007 for (j = 0; j < vec_len (nm_clone->nodes); j++)
1009 n = nm_clone->nodes[j];
1011 rt = vlib_node_get_runtime (vm_clone, n->index);
1012 vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
1016 /* Per-worker clone rebuilds are now done on each thread */
1021 vlib_worker_thread_node_refork (void)
1023 vlib_main_t *vm, *vm_clone;
1024 vlib_node_main_t *nm, *nm_clone;
1025 vlib_node_t **old_nodes_clone;
1026 vlib_node_runtime_t *rt, *old_rt;
1028 vlib_node_t *new_n_clone;
1033 nm = &vm->node_main;
1034 vm_clone = vlib_get_main ();
1035 nm_clone = &vm_clone->node_main;
1037 /* Re-clone error heap */
1038 u64 *old_counters = vm_clone->error_main.counters;
1039 u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
1041 clib_memcpy_fast (&vm_clone->error_main, &vm->error_main,
1042 sizeof (vm->error_main));
1043 j = vec_len (vm->error_main.counters) - 1;
1045 /* Switch to the stats segment ... */
1046 void *oldheap = vlib_stats_push_heap (0);
1047 vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
1048 vm_clone->error_main.counters = old_counters;
1049 vlib_stats_pop_heap2 (vm_clone->error_main.counters, vm_clone->thread_index,
1052 vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
1053 vm_clone->error_main.counters_last_clear = old_counters_all_clear;
1055 nm_clone = &vm_clone->node_main;
1056 vec_free (nm_clone->next_frames);
1057 nm_clone->next_frames = vec_dup_aligned (nm->next_frames,
1058 CLIB_CACHE_LINE_BYTES);
1060 for (j = 0; j < vec_len (nm_clone->next_frames); j++)
1062 vlib_next_frame_t *nf = &nm_clone->next_frames[j];
1063 u32 save_node_runtime_index;
1066 save_node_runtime_index = nf->node_runtime_index;
1067 save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
1068 vlib_next_frame_init (nf);
1069 nf->node_runtime_index = save_node_runtime_index;
1070 nf->flags = save_flags;
1073 old_nodes_clone = nm_clone->nodes;
1074 nm_clone->nodes = 0;
1078 /* Allocate all nodes in single block for speed */
1080 clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*new_n_clone));
1081 for (j = 0; j < vec_len (nm->nodes); j++)
1083 vlib_node_t *new_n = nm->nodes[j];
1085 clib_memcpy_fast (new_n_clone, new_n, sizeof (*new_n));
1086 /* none of the copied nodes have enqueue rights given out */
1087 new_n_clone->owner_node_index = VLIB_INVALID_NODE_INDEX;
1089 if (j >= vec_len (old_nodes_clone))
1091 /* new node, set to zero */
1092 clib_memset (&new_n_clone->stats_total, 0,
1093 sizeof (new_n_clone->stats_total));
1094 clib_memset (&new_n_clone->stats_last_clear, 0,
1095 sizeof (new_n_clone->stats_last_clear));
1099 vlib_node_t *old_n_clone = old_nodes_clone[j];
1100 /* Copy stats if the old data is valid */
1101 clib_memcpy_fast (&new_n_clone->stats_total,
1102 &old_n_clone->stats_total,
1103 sizeof (new_n_clone->stats_total));
1104 clib_memcpy_fast (&new_n_clone->stats_last_clear,
1105 &old_n_clone->stats_last_clear,
1106 sizeof (new_n_clone->stats_last_clear));
1108 /* keep previous node state */
1109 new_n_clone->state = old_n_clone->state;
1111 vec_add1 (nm_clone->nodes, new_n_clone);
1114 /* Free the old node clones */
1115 clib_mem_free (old_nodes_clone[0]);
1117 vec_free (old_nodes_clone);
1120 /* re-clone internal nodes */
1121 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL];
1122 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL] =
1123 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
1124 CLIB_CACHE_LINE_BYTES);
1126 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL])
1128 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1129 rt->thread_index = vm_clone->thread_index;
1130 /* copy runtime_data, will be overwritten later for existing rt */
1131 if (n->runtime_data && n->runtime_data_bytes > 0)
1132 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1133 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1134 n->runtime_data_bytes));
1137 for (j = 0; j < vec_len (old_rt); j++)
1139 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1140 rt->state = old_rt[j].state;
1141 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1142 VLIB_NODE_RUNTIME_DATA_SIZE);
1147 /* re-clone input nodes */
1148 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
1149 nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
1150 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
1151 CLIB_CACHE_LINE_BYTES);
1153 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT])
1155 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1156 rt->thread_index = vm_clone->thread_index;
1157 /* copy runtime_data, will be overwritten later for existing rt */
1158 if (n->runtime_data && n->runtime_data_bytes > 0)
1159 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1160 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1161 n->runtime_data_bytes));
1164 for (j = 0; j < vec_len (old_rt); j++)
1166 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1167 rt->state = old_rt[j].state;
1168 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1169 VLIB_NODE_RUNTIME_DATA_SIZE);
1174 /* re-clone pre-input nodes */
1175 old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT];
1176 nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT] =
1177 vec_dup_aligned (nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT],
1178 CLIB_CACHE_LINE_BYTES);
1180 vec_foreach (rt, nm_clone->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
1182 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1183 rt->thread_index = vm_clone->thread_index;
1184 /* copy runtime_data, will be overwritten later for existing rt */
1185 if (n->runtime_data && n->runtime_data_bytes > 0)
1186 clib_memcpy_fast (rt->runtime_data, n->runtime_data,
1187 clib_min (VLIB_NODE_RUNTIME_DATA_SIZE,
1188 n->runtime_data_bytes));
1191 for (j = 0; j < vec_len (old_rt); j++)
1193 rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1194 rt->state = old_rt[j].state;
1195 clib_memcpy_fast (rt->runtime_data, old_rt[j].runtime_data,
1196 VLIB_NODE_RUNTIME_DATA_SIZE);
1201 nm_clone->processes = vec_dup_aligned (nm->processes,
1202 CLIB_CACHE_LINE_BYTES);
1203 nm_clone->node_by_error = nm->node_by_error;
1207 vlib_worker_thread_node_runtime_update (void)
1210 * Make a note that we need to do a node runtime update
1211 * prior to releasing the barrier.
1213 vlib_global_main.need_vlib_worker_thread_node_runtime_update = 1;
1217 unformat_sched_policy (unformat_input_t * input, va_list * args)
1219 u32 *r = va_arg (*args, u32 *);
1222 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
1223 foreach_sched_policy
1230 static clib_error_t *
1231 cpu_config (vlib_main_t * vm, unformat_input_t * input)
1233 vlib_thread_registration_t *tr;
1235 vlib_thread_main_t *tm = &vlib_thread_main;
1240 tm->thread_registrations_by_name = hash_create_string (0, sizeof (uword));
1242 tm->n_thread_stacks = 1; /* account for main thread */
1243 tm->sched_policy = ~0;
1244 tm->sched_priority = ~0;
1245 tm->main_lcore = ~0;
1251 hash_set_mem (tm->thread_registrations_by_name, tr->name, (uword) tr);
1255 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1257 if (unformat (input, "use-pthreads"))
1258 tm->use_pthreads = 1;
1259 else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1261 else if (unformat (input, "main-core %u", &tm->main_lcore))
1263 else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1265 else if (unformat (input, "numa-heap-size %U",
1266 unformat_memory_size, &tm->numa_heap_size))
1268 else if (unformat (input, "coremask-%s %U", &name,
1269 unformat_bitmap_mask, &bitmap) ||
1270 unformat (input, "corelist-%s %U", &name,
1271 unformat_bitmap_list, &bitmap))
1273 p = hash_get_mem (tm->thread_registrations_by_name, name);
1275 return clib_error_return (0, "no such thread type '%s'", name);
1277 tr = (vlib_thread_registration_t *) p[0];
1279 if (tr->use_pthreads)
1280 return clib_error_return (0,
1281 "corelist cannot be set for '%s' threads",
1284 tr->coremask = bitmap;
1285 tr->count = clib_bitmap_count_set_bits (tr->coremask);
1289 (input, "scheduler-policy %U", unformat_sched_policy,
1292 else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1294 else if (unformat (input, "%s %u", &name, &count))
1296 p = hash_get_mem (tm->thread_registrations_by_name, name);
1298 return clib_error_return (0, "no such thread type 3 '%s'", name);
1300 tr = (vlib_thread_registration_t *) p[0];
1301 if (tr->fixed_count)
1302 return clib_error_return
1303 (0, "number of %s threads not configurable", tr->name);
1310 if (tm->sched_priority != ~0)
1312 if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1314 u32 prio_max = sched_get_priority_max (tm->sched_policy);
1315 u32 prio_min = sched_get_priority_min (tm->sched_policy);
1316 if (tm->sched_priority > prio_max)
1317 tm->sched_priority = prio_max;
1318 if (tm->sched_priority < prio_min)
1319 tm->sched_priority = prio_min;
1323 return clib_error_return
1325 "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1326 tm->sched_priority);
1331 if (!tm->thread_prefix)
1332 tm->thread_prefix = format (0, "vpp");
1336 tm->n_thread_stacks += tr->count;
1337 tm->n_pthreads += tr->count * tr->use_pthreads;
1338 tm->n_threads += tr->count * (tr->use_pthreads == 0);
1345 VLIB_EARLY_CONFIG_FUNCTION (cpu_config, "cpu");
1347 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1349 vnet_main_fixup (vlib_fork_fixup_t which)
1354 vlib_worker_thread_fork_fixup (vlib_fork_fixup_t which)
1356 vlib_main_t *vm = vlib_get_main ();
1358 if (vlib_mains == 0)
1361 ASSERT (vlib_get_thread_index () == 0);
1362 vlib_worker_thread_barrier_sync (vm);
1366 case VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX:
1367 vnet_main_fixup (VLIB_WORKER_THREAD_FORK_FIXUP_NEW_SW_IF_INDEX);
1373 vlib_worker_thread_barrier_release (vm);
1377 * Enforce minimum open time to minimize packet loss due to Rx overflow,
1378 * based on a test based heuristic that barrier should be open for at least
1379 * 3 time as long as it is closed (with an upper bound of 1ms because by that
1380 * point it is probably too late to make a difference)
1383 #ifndef BARRIER_MINIMUM_OPEN_LIMIT
1384 #define BARRIER_MINIMUM_OPEN_LIMIT 0.001
1387 #ifndef BARRIER_MINIMUM_OPEN_FACTOR
1388 #define BARRIER_MINIMUM_OPEN_FACTOR 3
1392 vlib_worker_thread_initial_barrier_sync_and_release (vlib_main_t * vm)
1395 f64 now = vlib_time_now (vm);
1396 u32 count = vec_len (vlib_mains) - 1;
1398 /* No worker threads? */
1402 deadline = now + BARRIER_SYNC_TIMEOUT;
1403 *vlib_worker_threads->wait_at_barrier = 1;
1404 while (*vlib_worker_threads->workers_at_barrier != count)
1406 if ((now = vlib_time_now (vm)) > deadline)
1408 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1413 *vlib_worker_threads->wait_at_barrier = 0;
1417 vlib_worker_thread_barrier_sync_int (vlib_main_t * vm, const char *func_name)
1424 f64 max_vector_rate;
1428 if (vec_len (vlib_mains) < 2)
1431 ASSERT (vlib_get_thread_index () == 0);
1433 vlib_worker_threads[0].barrier_caller = func_name;
1434 count = vec_len (vlib_mains) - 1;
1436 /* Record entry relative to last close */
1437 now = vlib_time_now (vm);
1438 t_entry = now - vm->barrier_epoch;
1440 /* Tolerate recursive calls */
1441 if (++vlib_worker_threads[0].recursion_level > 1)
1443 barrier_trace_sync_rec (t_entry);
1448 * Need data to decide if we're working hard enough to honor
1449 * the barrier hold-down timer.
1451 max_vector_rate = 0.0;
1452 for (i = 1; i < vec_len (vlib_mains); i++)
1454 clib_max (max_vector_rate,
1455 (f64) vlib_last_vectors_per_main_loop (vlib_mains[i]));
1457 vlib_worker_threads[0].barrier_sync_count++;
1459 /* Enforce minimum barrier open time to minimize packet loss */
1460 ASSERT (vm->barrier_no_close_before <= (now + BARRIER_MINIMUM_OPEN_LIMIT));
1463 * If any worker thread seems busy, which we define
1464 * as a vector rate above 10, we enforce the barrier hold-down timer
1466 if (max_vector_rate > 10.0)
1470 now = vlib_time_now (vm);
1471 /* Barrier hold-down timer expired? */
1472 if (now >= vm->barrier_no_close_before)
1474 if ((vm->barrier_no_close_before - now)
1475 > (2.0 * BARRIER_MINIMUM_OPEN_LIMIT))
1478 ("clock change: would have waited for %.4f seconds",
1479 (vm->barrier_no_close_before - now));
1484 /* Record time of closure */
1485 t_open = now - vm->barrier_epoch;
1486 vm->barrier_epoch = now;
1488 deadline = now + BARRIER_SYNC_TIMEOUT;
1490 *vlib_worker_threads->wait_at_barrier = 1;
1491 while (*vlib_worker_threads->workers_at_barrier != count)
1493 if ((now = vlib_time_now (vm)) > deadline)
1495 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1500 t_closed = now - vm->barrier_epoch;
1502 barrier_trace_sync (t_entry, t_open, t_closed);
1507 vlib_worker_thread_barrier_release (vlib_main_t * vm)
1514 f64 t_update_main = 0.0;
1515 int refork_needed = 0;
1517 if (vec_len (vlib_mains) < 2)
1520 ASSERT (vlib_get_thread_index () == 0);
1523 now = vlib_time_now (vm);
1524 t_entry = now - vm->barrier_epoch;
1526 if (--vlib_worker_threads[0].recursion_level > 0)
1528 barrier_trace_release_rec (t_entry);
1532 /* Update (all) node runtimes before releasing the barrier, if needed */
1533 if (vm->need_vlib_worker_thread_node_runtime_update)
1536 * Lock stat segment here, so we's safe when
1537 * rebuilding the stat segment node clones from the
1540 vlib_stat_segment_lock ();
1542 /* Do stats elements on main thread */
1543 worker_thread_node_runtime_update_internal ();
1544 vm->need_vlib_worker_thread_node_runtime_update = 0;
1546 /* Do per thread rebuilds in parallel */
1548 clib_atomic_fetch_add (vlib_worker_threads->node_reforks_required,
1549 (vec_len (vlib_mains) - 1));
1550 now = vlib_time_now (vm);
1551 t_update_main = now - vm->barrier_epoch;
1554 deadline = now + BARRIER_SYNC_TIMEOUT;
1557 * Note when we let go of the barrier.
1558 * Workers can use this to derive a reasonably accurate
1559 * time offset. See vlib_time_now(...)
1561 vm->time_last_barrier_release = vlib_time_now (vm);
1562 CLIB_MEMORY_STORE_BARRIER ();
1564 *vlib_worker_threads->wait_at_barrier = 0;
1566 while (*vlib_worker_threads->workers_at_barrier > 0)
1568 if ((now = vlib_time_now (vm)) > deadline)
1570 fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1575 /* Wait for reforks before continuing */
1578 now = vlib_time_now (vm);
1580 deadline = now + BARRIER_SYNC_TIMEOUT;
1582 while (*vlib_worker_threads->node_reforks_required > 0)
1584 if ((now = vlib_time_now (vm)) > deadline)
1586 fformat (stderr, "%s: worker thread refork deadlock\n",
1591 vlib_stat_segment_unlock ();
1594 t_closed_total = now - vm->barrier_epoch;
1596 minimum_open = t_closed_total * BARRIER_MINIMUM_OPEN_FACTOR;
1598 if (minimum_open > BARRIER_MINIMUM_OPEN_LIMIT)
1600 minimum_open = BARRIER_MINIMUM_OPEN_LIMIT;
1603 vm->barrier_no_close_before = now + minimum_open;
1605 /* Record barrier epoch (used to enforce minimum open time) */
1606 vm->barrier_epoch = now;
1608 barrier_trace_release (t_entry, t_closed_total, t_update_main);
1613 * Check the frame queue to see if any frames are available.
1614 * If so, pull the packets off the frames and put them to
1618 vlib_frame_queue_dequeue (vlib_main_t * vm, vlib_frame_queue_main_t * fqm)
1620 u32 thread_id = vm->thread_index;
1621 vlib_frame_queue_t *fq = fqm->vlib_frame_queues[thread_id];
1622 vlib_frame_queue_elt_t *elt;
1631 ASSERT (vm == vlib_mains[thread_id]);
1633 if (PREDICT_FALSE (fqm->node_index == ~0))
1636 * Gather trace data for frame queues
1638 if (PREDICT_FALSE (fq->trace))
1640 frame_queue_trace_t *fqt;
1641 frame_queue_nelt_counter_t *fqh;
1644 fqt = &fqm->frame_queue_traces[thread_id];
1646 fqt->nelts = fq->nelts;
1647 fqt->head = fq->head;
1648 fqt->head_hint = fq->head_hint;
1649 fqt->tail = fq->tail;
1650 fqt->threshold = fq->vector_threshold;
1651 fqt->n_in_use = fqt->tail - fqt->head;
1652 if (fqt->n_in_use >= fqt->nelts)
1654 // if beyond max then use max
1655 fqt->n_in_use = fqt->nelts - 1;
1658 /* Record the number of elements in use in the histogram */
1659 fqh = &fqm->frame_queue_histogram[thread_id];
1660 fqh->count[fqt->n_in_use]++;
1662 /* Record a snapshot of the elements in use */
1663 for (elix = 0; elix < fqt->nelts; elix++)
1665 elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1666 if (1 || elt->valid)
1668 fqt->n_vectors[elix] = elt->n_vectors;
1677 if (fq->head == fq->tail)
1679 fq->head_hint = fq->head;
1683 elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1687 fq->head_hint = fq->head;
1691 from = elt->buffer_index;
1692 msg_type = elt->msg_type;
1694 ASSERT (msg_type == VLIB_FRAME_QUEUE_ELT_DISPATCH_FRAME);
1695 ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1697 f = vlib_get_frame_to_node (vm, fqm->node_index);
1699 /* If the first vector is traced, set the frame trace flag */
1700 b = vlib_get_buffer (vm, from[0]);
1701 if (b->flags & VLIB_BUFFER_IS_TRACED)
1702 f->frame_flags |= VLIB_NODE_FLAG_TRACE;
1704 to = vlib_frame_vector_args (f);
1706 n_left_to_node = elt->n_vectors;
1708 while (n_left_to_node >= 4)
1716 n_left_to_node -= 4;
1719 while (n_left_to_node > 0)
1727 vectors += elt->n_vectors;
1728 f->n_vectors = elt->n_vectors;
1729 vlib_put_frame_to_node (vm, fqm->node_index, f);
1733 elt->msg_type = 0xfefefefe;
1734 CLIB_MEMORY_BARRIER ();
1739 * Limit the number of packets pushed into the graph
1741 if (vectors >= fq->vector_threshold)
1743 fq->head_hint = fq->head;
1752 vlib_worker_thread_fn (void *arg)
1754 vlib_worker_thread_t *w = (vlib_worker_thread_t *) arg;
1755 vlib_thread_main_t *tm = vlib_get_thread_main ();
1756 vlib_main_t *vm = vlib_get_main ();
1759 ASSERT (vm->thread_index == vlib_get_thread_index ());
1761 vlib_worker_thread_init (w);
1762 clib_time_init (&vm->clib_time);
1763 clib_mem_set_heap (w->thread_mheap);
1765 e = vlib_call_init_exit_functions_no_sort
1766 (vm, &vm->worker_init_function_registrations, 1 /* call_once */ );
1768 clib_error_report (e);
1770 /* Wait until the dpdk init sequence is complete */
1771 while (tm->extern_thread_mgmt && tm->worker_thread_release == 0)
1772 vlib_worker_thread_barrier_check ();
1774 vlib_worker_loop (vm);
1778 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1781 .function = vlib_worker_thread_fn,
1786 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts)
1788 vlib_thread_main_t *tm = vlib_get_thread_main ();
1789 vlib_frame_queue_main_t *fqm;
1790 vlib_frame_queue_t *fq;
1793 if (frame_queue_nelts == 0)
1794 frame_queue_nelts = FRAME_QUEUE_MAX_NELTS;
1796 ASSERT (frame_queue_nelts >= 8);
1798 vec_add2 (tm->frame_queue_mains, fqm, 1);
1800 fqm->node_index = node_index;
1801 fqm->frame_queue_nelts = frame_queue_nelts;
1802 fqm->queue_hi_thresh = frame_queue_nelts - 2;
1804 vec_validate (fqm->vlib_frame_queues, tm->n_vlib_mains - 1);
1805 vec_validate (fqm->per_thread_data, tm->n_vlib_mains - 1);
1806 _vec_len (fqm->vlib_frame_queues) = 0;
1807 for (i = 0; i < tm->n_vlib_mains; i++)
1809 vlib_frame_queue_per_thread_data_t *ptd;
1810 fq = vlib_frame_queue_alloc (frame_queue_nelts);
1811 vec_add1 (fqm->vlib_frame_queues, fq);
1813 ptd = vec_elt_at_index (fqm->per_thread_data, i);
1814 vec_validate (ptd->handoff_queue_elt_by_thread_index,
1815 tm->n_vlib_mains - 1);
1816 vec_validate_init_empty (ptd->congested_handoff_queue_by_thread_index,
1817 tm->n_vlib_mains - 1,
1818 (vlib_frame_queue_t *) (~0));
1821 return (fqm - tm->frame_queue_mains);
1825 vlib_thread_cb_register (struct vlib_main_t *vm, vlib_thread_callbacks_t * cb)
1827 vlib_thread_main_t *tm = vlib_get_thread_main ();
1829 if (tm->extern_thread_mgmt)
1832 tm->cb.vlib_launch_thread_cb = cb->vlib_launch_thread_cb;
1833 tm->extern_thread_mgmt = 1;
1838 vlib_process_signal_event_mt_helper (vlib_process_signal_event_mt_args_t *
1841 ASSERT (vlib_get_thread_index () == 0);
1842 vlib_process_signal_event (vlib_get_main (), args->node_index,
1843 args->type_opaque, args->data);
1846 void *rpc_call_main_thread_cb_fn;
1849 vlib_rpc_call_main_thread (void *callback, u8 * args, u32 arg_size)
1851 if (rpc_call_main_thread_cb_fn)
1853 void (*fp) (void *, u8 *, u32) = rpc_call_main_thread_cb_fn;
1854 (*fp) (callback, args, arg_size);
1857 clib_warning ("BUG: rpc_call_main_thread_cb_fn NULL!");
1861 threads_init (vlib_main_t * vm)
1866 VLIB_INIT_FUNCTION (threads_init);
1869 static clib_error_t *
1870 show_clock_command_fn (vlib_main_t * vm,
1871 unformat_input_t * input, vlib_cli_command_t * cmd)
1876 (void) unformat (input, "verbose %=", &verbose, 1);
1878 vlib_cli_output (vm, "%U", format_clib_time, &vm->clib_time, verbose);
1880 if (vec_len (vlib_mains) == 1)
1883 vlib_cli_output (vm, "Time last barrier release %.9f",
1884 vm->time_last_barrier_release);
1886 for (i = 1; i < vec_len (vlib_mains); i++)
1888 if (vlib_mains[i] == 0)
1891 vlib_cli_output (vm, "%d: %U", i, format_clib_time,
1892 &vlib_mains[i]->clib_time, verbose);
1894 vlib_cli_output (vm, "Thread %d offset %.9f error %.9f", i,
1895 vlib_mains[i]->time_offset,
1896 vm->time_last_barrier_release -
1897 vlib_mains[i]->time_last_barrier_release);
1903 VLIB_CLI_COMMAND (f_command, static) =
1905 .path = "show clock",
1906 .short_help = "show clock",
1907 .function = show_clock_command_fn,
1912 * fd.io coding-style-patch-verification: ON
1915 * eval: (c-set-style "gnu")