FD.io VPP  v17.10-9-gd594711
Vector Packet Processing
threads.c
Go to the documentation of this file.
1 /*
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:
6  *
7  * http://www.apache.org/licenses/LICENSE-2.0
8  *
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.
14  */
15 #define _GNU_SOURCE
16 
17 #include <signal.h>
18 #include <math.h>
19 #include <vppinfra/format.h>
20 #include <vlib/vlib.h>
21 
22 #include <vlib/threads.h>
23 #include <vlib/unix/cj.h>
24 
26 
27 #define FRAME_QUEUE_NELTS 32
28 
29 u32
30 vl (void *p)
31 {
32  return vec_len (p);
33 }
34 
37 
38 /*
39  * Barrier tracing can be enabled on a normal build to collect information
40  * on barrier use, including timings and call stacks. Deliberately not
41  * keyed off CLIB_DEBUG, because that can add significant overhead which
42  * imapacts observed timings.
43  */
44 
45 #ifdef BARRIER_TRACING
46  /*
47  * Output of barrier tracing can be to syslog or elog as suits
48  */
49 #ifdef BARRIER_TRACING_ELOG
50 static u32
51 elog_id_for_msg_name (const char *msg_name)
52 {
53  uword *p, r;
54  static uword *h;
55  u8 *name_copy;
56 
57  if (!h)
58  h = hash_create_string (0, sizeof (uword));
59 
60  p = hash_get_mem (h, msg_name);
61  if (p)
62  return p[0];
63  r = elog_string (&vlib_global_main.elog_main, "%s", msg_name);
64 
65  name_copy = format (0, "%s%c", msg_name, 0);
66 
67  hash_set_mem (h, name_copy, r);
68 
69  return r;
70 }
71 
72  /*
73  * elog Barrier trace functions, which are nulled out if BARRIER_TRACING isn't
74  * defined
75  */
76 
77 static inline void
78 barrier_trace_sync (f64 t_entry, f64 t_open, f64 t_closed)
79 {
80  /* *INDENT-OFF* */
81  ELOG_TYPE_DECLARE (e) =
82  {
83  .format = "barrier <%d#%s(O:%dus:%dus)(%dus)",
84  .format_args = "i4T4i4i4i4",
85  };
86  /* *INDENT-ON* */
87  struct
88  {
89  u32 count, caller, t_entry, t_open, t_closed;
90  } *ed = 0;
91 
93  ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
94  ed->caller = elog_id_for_msg_name (vlib_worker_threads[0].barrier_caller);
95  ed->t_entry = (int) (1000000.0 * t_entry);
96  ed->t_open = (int) (1000000.0 * t_open);
97  ed->t_closed = (int) (1000000.0 * t_closed);
98 }
99 
100 static inline void
101 barrier_trace_sync_rec (f64 t_entry)
102 {
103  /* *INDENT-OFF* */
104  ELOG_TYPE_DECLARE (e) =
105  {
106  .format = "barrier <%d(%dus)%s",
107  .format_args = "i4i4T4",
108  };
109  /* *INDENT-ON* */
110  struct
111  {
112  u32 depth, t_entry, caller;
113  } *ed = 0;
114 
116  ed->depth = (int) vlib_worker_threads[0].recursion_level - 1;
117  ed->t_entry = (int) (1000000.0 * t_entry);
118  ed->caller = elog_id_for_msg_name (vlib_worker_threads[0].barrier_caller);
119 }
120 
121 static inline void
123 {
124  /* *INDENT-OFF* */
125  ELOG_TYPE_DECLARE (e) =
126  {
127  .format = "barrier (%dus)%d>",
128  .format_args = "i4i4",
129  };
130  /* *INDENT-ON* */
131  struct
132  {
133  u32 t_entry, depth;
134  } *ed = 0;
135 
137  ed->t_entry = (int) (1000000.0 * t_entry);
138  ed->depth = (int) vlib_worker_threads[0].recursion_level;
139 }
140 
141 static inline void
142 barrier_trace_release (f64 t_entry, f64 t_closed_total, f64 t_update_main)
143 {
144  /* *INDENT-OFF* */
145  ELOG_TYPE_DECLARE (e) =
146  {
147  .format = "barrier (%dus){%d}(C:%dus)#%d>",
148  .format_args = "i4i4i4i4",
149  };
150  /* *INDENT-ON* */
151  struct
152  {
153  u32 t_entry, t_update_main, t_closed_total, count;
154  } *ed = 0;
155 
157  ed->t_entry = (int) (1000000.0 * t_entry);
158  ed->t_update_main = (int) (1000000.0 * t_update_main);
159  ed->t_closed_total = (int) (1000000.0 * t_closed_total);
160  ed->count = (int) vlib_worker_threads[0].barrier_sync_count;
161 
162  /* Reset context for next trace */
163  vlib_worker_threads[0].barrier_context = NULL;
164 }
165 #else
166 char barrier_trace[65536];
167 char *btp = barrier_trace;
168 
169  /*
170  * syslog Barrier trace functions, which are nulled out if BARRIER_TRACING
171  * isn't defined
172  */
173 
174 
175 static inline void
176 barrier_trace_sync (f64 t_entry, f64 t_open, f64 t_closed)
177 {
178  btp += sprintf (btp, "<%u#%s",
179  (unsigned int) vlib_worker_threads[0].barrier_sync_count,
180  vlib_worker_threads[0].barrier_caller);
181 
182  if (vlib_worker_threads[0].barrier_context)
183  {
184  btp += sprintf (btp, "[%s]", vlib_worker_threads[0].barrier_context);
185 
186  }
187 
188  btp += sprintf (btp, "(O:%dus:%dus)(%dus):",
189  (int) (1000000.0 * t_entry),
190  (int) (1000000.0 * t_open), (int) (1000000.0 * t_closed));
191 
192 }
193 
194 static inline void
195 barrier_trace_sync_rec (f64 t_entry)
196 {
197  btp += sprintf (btp, "<%u(%dus)%s:",
198  (int) vlib_worker_threads[0].recursion_level - 1,
199  (int) (1000000.0 * t_entry),
200  vlib_worker_threads[0].barrier_caller);
201 }
202 
203 static inline void
205 {
206  btp += sprintf (btp, ":(%dus)%u>", (int) (1000000.0 * t_entry),
207  (int) vlib_worker_threads[0].recursion_level);
208 }
209 
210 static inline void
211 barrier_trace_release (f64 t_entry, f64 t_closed_total, f64 t_update_main)
212 {
213 
214  btp += sprintf (btp, ":(%dus)", (int) (1000000.0 * t_entry));
215  if (t_update_main > 0)
216  {
217  btp += sprintf (btp, "{%dus}", (int) (1000000.0 * t_update_main));
218  }
219 
220  btp += sprintf (btp, "(C:%dus)#%u>",
221  (int) (1000000.0 * t_closed_total),
222  (int) vlib_worker_threads[0].barrier_sync_count);
223 
224  /* Dump buffer to syslog, and reset for next trace */
225  fformat (stderr, "BTRC %s\n", barrier_trace);
226  btp = barrier_trace;
227  vlib_worker_threads[0].barrier_context = NULL;
228 }
229 #endif
230 #else
231 
232  /* Null functions for default case where barrier tracing isn't used */
233 static inline void
234 barrier_trace_sync (f64 t_entry, f64 t_open, f64 t_closed)
235 {
236 }
237 
238 static inline void
240 {
241 }
242 
243 static inline void
245 {
246 }
247 
248 static inline void
249 barrier_trace_release (f64 t_entry, f64 t_closed_total, f64 t_update_main)
250 {
251 }
252 #endif
253 
254 uword
256 {
257  u32 len;
258 
259  len = vec_len (vlib_thread_stacks);
260  if (len == 0)
261  return 1;
262  else
263  return len;
264 }
265 
266 void
268 {
269  int pthread_setname_np (pthread_t __target_thread, const char *__name);
270  int rv;
271  pthread_t thread = pthread_self ();
272 
273  if (thread)
274  {
275  rv = pthread_setname_np (thread, name);
276  if (rv)
277  clib_warning ("pthread_setname_np returned %d", rv);
278  }
279 }
280 
281 static int
282 sort_registrations_by_no_clone (void *a0, void *a1)
283 {
284  vlib_thread_registration_t **tr0 = a0;
285  vlib_thread_registration_t **tr1 = a1;
286 
287  return ((i32) ((*tr0)->no_data_structure_clone)
288  - ((i32) ((*tr1)->no_data_structure_clone)));
289 }
290 
291 static uword *
293 {
294  FILE *fp;
295  uword *r = 0;
296 
297  fp = fopen (filename, "r");
298 
299  if (fp != NULL)
300  {
301  u8 *buffer = 0;
302  vec_validate (buffer, 256 - 1);
303  if (fgets ((char *) buffer, 256, fp))
304  {
305  unformat_input_t in;
306  unformat_init_string (&in, (char *) buffer,
307  strlen ((char *) buffer));
308  if (unformat (&in, "%U", unformat_bitmap_list, &r) != 1)
309  clib_warning ("unformat_bitmap_list failed");
310  unformat_free (&in);
311  }
312  vec_free (buffer);
313  fclose (fp);
314  }
315  return r;
316 }
317 
318 
319 /* Called early in the init sequence */
320 
321 clib_error_t *
323 {
327  u32 n_vlib_mains = 1;
328  u32 first_index = 1;
329  u32 i;
330  uword *avail_cpu;
331 
332  /* get bitmaps of active cpu cores and sockets */
333  tm->cpu_core_bitmap =
334  clib_sysfs_list_to_bitmap ("/sys/devices/system/cpu/online");
335  tm->cpu_socket_bitmap =
336  clib_sysfs_list_to_bitmap ("/sys/devices/system/node/online");
337 
338  avail_cpu = clib_bitmap_dup (tm->cpu_core_bitmap);
339 
340  /* skip cores */
341  for (i = 0; i < tm->skip_cores; i++)
342  {
343  uword c = clib_bitmap_first_set (avail_cpu);
344  if (c == ~0)
345  return clib_error_return (0, "no available cpus to skip");
346 
347  avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
348  }
349 
350  /* grab cpu for main thread */
351  if (!tm->main_lcore)
352  {
353  tm->main_lcore = clib_bitmap_first_set (avail_cpu);
354  if (tm->main_lcore == (u8) ~ 0)
355  return clib_error_return (0, "no available cpus to be used for the"
356  " main thread");
357  }
358  else
359  {
360  if (clib_bitmap_get (avail_cpu, tm->main_lcore) == 0)
361  return clib_error_return (0, "cpu %u is not available to be used"
362  " for the main thread", tm->main_lcore);
363  }
364  avail_cpu = clib_bitmap_set (avail_cpu, tm->main_lcore, 0);
365 
366  /* assume that there is socket 0 only if there is no data from sysfs */
367  if (!tm->cpu_socket_bitmap)
368  tm->cpu_socket_bitmap = clib_bitmap_set (0, 0, 1);
369 
370  /* pin main thread to main_lcore */
372  {
374  }
375  else
376  {
377  cpu_set_t cpuset;
378  CPU_ZERO (&cpuset);
379  CPU_SET (tm->main_lcore, &cpuset);
380  pthread_setaffinity_np (pthread_self (), sizeof (cpu_set_t), &cpuset);
381  }
382 
383  /* as many threads as stacks... */
384  vec_validate_aligned (vlib_worker_threads, vec_len (vlib_thread_stacks) - 1,
386 
387  /* Preallocate thread 0 */
388  _vec_len (vlib_worker_threads) = 1;
392  w->lcore_id = tm->main_lcore;
393  w->lwp = syscall (SYS_gettid);
394  w->thread_id = pthread_self ();
395  tm->n_vlib_mains = 1;
396 
397  if (tm->sched_policy != ~0)
398  {
399  struct sched_param sched_param;
400  if (!sched_getparam (w->lwp, &sched_param))
401  {
402  if (tm->sched_priority != ~0)
403  sched_param.sched_priority = tm->sched_priority;
404  sched_setscheduler (w->lwp, tm->sched_policy, &sched_param);
405  }
406  }
407 
408  /* assign threads to cores and set n_vlib_mains */
409  tr = tm->next;
410 
411  while (tr)
412  {
413  vec_add1 (tm->registrations, tr);
414  tr = tr->next;
415  }
416 
418 
419  for (i = 0; i < vec_len (tm->registrations); i++)
420  {
421  int j;
422  tr = tm->registrations[i];
423  tr->first_index = first_index;
424  first_index += tr->count;
425  n_vlib_mains += (tr->no_data_structure_clone == 0) ? tr->count : 0;
426 
427  /* construct coremask */
428  if (tr->use_pthreads || !tr->count)
429  continue;
430 
431  if (tr->coremask)
432  {
433  uword c;
434  /* *INDENT-OFF* */
435  clib_bitmap_foreach (c, tr->coremask, ({
436  if (clib_bitmap_get(avail_cpu, c) == 0)
437  return clib_error_return (0, "cpu %u is not available to be used"
438  " for the '%s' thread",c, tr->name);
439 
440  avail_cpu = clib_bitmap_set(avail_cpu, c, 0);
441  }));
442 /* *INDENT-ON* */
443 
444  }
445  else
446  {
447  for (j = 0; j < tr->count; j++)
448  {
449  uword c = clib_bitmap_first_set (avail_cpu);
450  if (c == ~0)
451  return clib_error_return (0,
452  "no available cpus to be used for"
453  " the '%s' thread", tr->name);
454 
455  avail_cpu = clib_bitmap_set (avail_cpu, c, 0);
456  tr->coremask = clib_bitmap_set (tr->coremask, c, 1);
457  }
458  }
459  }
460 
461  clib_bitmap_free (avail_cpu);
462 
463  tm->n_vlib_mains = n_vlib_mains;
464 
465  vec_validate_aligned (vlib_worker_threads, first_index - 1,
467 
468  return 0;
469 }
470 
473 {
474  vlib_frame_queue_t *fq;
475 
476  fq = clib_mem_alloc_aligned (sizeof (*fq), CLIB_CACHE_LINE_BYTES);
477  memset (fq, 0, sizeof (*fq));
478  fq->nelts = nelts;
479  fq->vector_threshold = 128; // packets
481 
482  if (1)
483  {
484  if (((uword) & fq->tail) & (CLIB_CACHE_LINE_BYTES - 1))
485  fformat (stderr, "WARNING: fq->tail unaligned\n");
486  if (((uword) & fq->head) & (CLIB_CACHE_LINE_BYTES - 1))
487  fformat (stderr, "WARNING: fq->head unaligned\n");
488  if (((uword) fq->elts) & (CLIB_CACHE_LINE_BYTES - 1))
489  fformat (stderr, "WARNING: fq->elts unaligned\n");
490 
491  if (sizeof (fq->elts[0]) % CLIB_CACHE_LINE_BYTES)
492  fformat (stderr, "WARNING: fq->elts[0] size %d\n",
493  sizeof (fq->elts[0]));
494  if (nelts & (nelts - 1))
495  {
496  fformat (stderr, "FATAL: nelts MUST be a power of 2\n");
497  abort ();
498  }
499  }
500 
501  return (fq);
502 }
503 
504 void vl_msg_api_handler_no_free (void *) __attribute__ ((weak));
505 void
507 {
508 }
509 
510 /* Turned off, save as reference material... */
511 #if 0
512 static inline int
513 vlib_frame_queue_dequeue_internal (int thread_id,
514  vlib_main_t * vm, vlib_node_main_t * nm)
515 {
516  vlib_frame_queue_t *fq = vlib_frame_queues[thread_id];
518  vlib_frame_t *f;
521  u32 node_runtime_index;
522  int msg_type;
523  u64 before;
524  int processed = 0;
525 
526  ASSERT (vm == vlib_mains[thread_id]);
527 
528  while (1)
529  {
530  if (fq->head == fq->tail)
531  return processed;
532 
533  elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
534 
535  if (!elt->valid)
536  return processed;
537 
538  before = clib_cpu_time_now ();
539 
540  f = elt->frame;
541  node_runtime_index = elt->node_runtime_index;
542  msg_type = elt->msg_type;
543 
544  switch (msg_type)
545  {
546  case VLIB_FRAME_QUEUE_ELT_FREE_BUFFERS:
548  /* note fallthrough... */
549  case VLIB_FRAME_QUEUE_ELT_FREE_FRAME:
551  node_runtime_index);
552  vlib_frame_free (vm, r, f);
553  break;
555  vec_add2 (vm->node_main.pending_frames, p, 1);
557  p->node_runtime_index = elt->node_runtime_index;
558  p->frame_index = vlib_frame_index (vm, f);
560  fq->dequeue_vectors += (u64) f->n_vectors;
561  break;
562  case VLIB_FRAME_QUEUE_ELT_API_MSG:
564  break;
565  default:
566  clib_warning ("bogus frame queue message, type %d", msg_type);
567  break;
568  }
569  elt->valid = 0;
570  fq->dequeues++;
571  fq->dequeue_ticks += clib_cpu_time_now () - before;
573  fq->head++;
574  processed++;
575  }
576  ASSERT (0);
577  return processed;
578 }
579 
580 int
581 vlib_frame_queue_dequeue (int thread_id,
582  vlib_main_t * vm, vlib_node_main_t * nm)
583 {
584  return vlib_frame_queue_dequeue_internal (thread_id, vm, nm);
585 }
586 
587 int
588 vlib_frame_queue_enqueue (vlib_main_t * vm, u32 node_runtime_index,
589  u32 frame_queue_index, vlib_frame_t * frame,
591 {
592  vlib_frame_queue_t *fq = vlib_frame_queues[frame_queue_index];
594  u32 save_count;
595  u64 new_tail;
596  u64 before = clib_cpu_time_now ();
597 
598  ASSERT (fq);
599 
600  new_tail = __sync_add_and_fetch (&fq->tail, 1);
601 
602  /* Wait until a ring slot is available */
603  while (new_tail >= fq->head + fq->nelts)
604  {
605  f64 b4 = vlib_time_now_ticks (vm, before);
607  /* Bad idea. Dequeue -> enqueue -> dequeue -> trouble */
608  // vlib_frame_queue_dequeue (vm->thread_index, vm, nm);
609  }
610 
611  elt = fq->elts + (new_tail & (fq->nelts - 1));
612 
613  /* this would be very bad... */
614  while (elt->valid)
615  {
616  }
617 
618  /* Once we enqueue the frame, frame->n_vectors is owned elsewhere... */
619  save_count = frame->n_vectors;
620 
621  elt->frame = frame;
622  elt->node_runtime_index = node_runtime_index;
623  elt->msg_type = type;
625  elt->valid = 1;
626 
627  return save_count;
628 }
629 #endif /* 0 */
630 
631 /* To be called by vlib worker threads upon startup */
632 void
634 {
636 
637  /*
638  * Note: disabling signals in worker threads as follows
639  * prevents the api post-mortem dump scheme from working
640  * {
641  * sigset_t s;
642  * sigfillset (&s);
643  * pthread_sigmask (SIG_SETMASK, &s, 0);
644  * }
645  */
646 
648 
649  if (vec_len (tm->thread_prefix) && w->registration->short_name)
650  {
651  w->name = format (0, "%v_%s_%d%c", tm->thread_prefix,
652  w->registration->short_name, w->instance_id, '\0');
653  vlib_set_thread_name ((char *) w->name);
654  }
655 
656  if (!w->registration->use_pthreads)
657  {
658 
659  /* Initial barrier sync, for both worker and i/o threads */
660  clib_smp_atomic_add (vlib_worker_threads->workers_at_barrier, 1);
661 
662  while (*vlib_worker_threads->wait_at_barrier)
663  ;
664 
665  clib_smp_atomic_add (vlib_worker_threads->workers_at_barrier, -1);
666  }
667 }
668 
669 void *
671 {
672  void *rv;
673  vlib_worker_thread_t *w = arg;
674 
675  w->lwp = syscall (SYS_gettid);
676  w->thread_id = pthread_self ();
677 
678  __os_thread_index = w - vlib_worker_threads;
679 
680  rv = (void *) clib_calljmp
681  ((uword (*)(uword)) w->thread_function,
683  /* NOTREACHED, we hope */
684  return rv;
685 }
686 
687 static clib_error_t *
688 vlib_launch_thread_int (void *fp, vlib_worker_thread_t * w, unsigned lcore_id)
689 {
691  void *(*fp_arg) (void *) = fp;
692 
693  w->lcore_id = lcore_id;
695  return tm->cb.vlib_launch_thread_cb (fp, (void *) w, lcore_id);
696  else
697  {
698  pthread_t worker;
699  cpu_set_t cpuset;
700  CPU_ZERO (&cpuset);
701  CPU_SET (lcore_id, &cpuset);
702 
703  if (pthread_create (&worker, NULL /* attr */ , fp_arg, (void *) w))
704  return clib_error_return_unix (0, "pthread_create");
705 
706  if (pthread_setaffinity_np (worker, sizeof (cpu_set_t), &cpuset))
707  return clib_error_return_unix (0, "pthread_setaffinity_np");
708 
709  return 0;
710  }
711 }
712 
713 static clib_error_t *
715 {
716  int i, j;
718  vlib_main_t *vm_clone;
719  void *oldheap;
723  u32 n_vlib_mains = tm->n_vlib_mains;
724  u32 worker_thread_index;
725  u8 *main_heap = clib_mem_get_per_cpu_heap ();
726  mheap_t *main_heap_header = mheap_header (main_heap);
727 
728  vec_reset_length (vlib_worker_threads);
729 
730  /* Set up the main thread */
731  vec_add2_aligned (vlib_worker_threads, w, 1, CLIB_CACHE_LINE_BYTES);
732  w->elog_track.name = "main thread";
734 
735  if (vec_len (tm->thread_prefix))
736  {
737  w->name = format (0, "%v_main%c", tm->thread_prefix, '\0');
738  vlib_set_thread_name ((char *) w->name);
739  }
740 
741  /*
742  * Truth of the matter: we always use at least two
743  * threads. So, make the main heap thread-safe
744  * and make the event log thread-safe.
745  */
746  main_heap_header->flags |= MHEAP_FLAG_THREAD_SAFE;
747  vm->elog_main.lock =
749  vm->elog_main.lock[0] = 0;
750 
751  if (n_vlib_mains > 1)
752  {
753  /* Replace hand-crafted length-1 vector with a real vector */
754  vlib_mains = 0;
755 
758  _vec_len (vlib_mains) = 0;
760 
761  vlib_worker_threads->wait_at_barrier =
763  vlib_worker_threads->workers_at_barrier =
765 
766  vlib_worker_threads->node_reforks_required =
768 
769  /* Ask for an initial barrier sync */
770  *vlib_worker_threads->workers_at_barrier = 0;
771  *vlib_worker_threads->wait_at_barrier = 1;
772 
773  /* Without update or refork */
774  *vlib_worker_threads->node_reforks_required = 0;
776 
777  /* init timing */
778  vm->barrier_epoch = 0;
779  vm->barrier_no_close_before = 0;
780 
781  worker_thread_index = 1;
782 
783  for (i = 0; i < vec_len (tm->registrations); i++)
784  {
785  vlib_node_main_t *nm, *nm_clone;
786  vlib_buffer_main_t *bm_clone;
787  vlib_buffer_free_list_t *fl_clone, *fl_orig;
788  vlib_buffer_free_list_t *orig_freelist_pool;
789  int k;
790 
791  tr = tm->registrations[i];
792 
793  if (tr->count == 0)
794  continue;
795 
796  for (k = 0; k < tr->count; k++)
797  {
798  vlib_node_t *n;
799 
800  vec_add2 (vlib_worker_threads, w, 1);
801  if (tr->mheap_size)
802  w->thread_mheap =
803  mheap_alloc (0 /* use VM */ , tr->mheap_size);
804  else
805  w->thread_mheap = main_heap;
806 
807  w->thread_stack =
808  vlib_thread_stack_init (w - vlib_worker_threads);
809  w->thread_function = tr->function;
810  w->thread_function_arg = w;
811  w->instance_id = k;
812  w->registration = tr;
813 
814  w->elog_track.name =
815  (char *) format (0, "%s %d", tr->name, k + 1);
816  vec_add1 (w->elog_track.name, 0);
818 
819  if (tr->no_data_structure_clone)
820  continue;
821 
822  /* Fork vlib_global_main et al. Look for bugs here */
823  oldheap = clib_mem_set_heap (w->thread_mheap);
824 
825  vm_clone = clib_mem_alloc (sizeof (*vm_clone));
826  clib_memcpy (vm_clone, vlib_mains[0], sizeof (*vm_clone));
827 
828  vm_clone->thread_index = worker_thread_index;
829  vm_clone->heap_base = w->thread_mheap;
830  vm_clone->mbuf_alloc_list = 0;
831  vm_clone->init_functions_called =
832  hash_create (0, /* value bytes */ 0);
833  memset (&vm_clone->random_buffer, 0,
834  sizeof (vm_clone->random_buffer));
835 
836  nm = &vlib_mains[0]->node_main;
837  nm_clone = &vm_clone->node_main;
838  /* fork next frames array, preserving node runtime indices */
839  nm_clone->next_frames = vec_dup (nm->next_frames);
840  for (j = 0; j < vec_len (nm_clone->next_frames); j++)
841  {
842  vlib_next_frame_t *nf = &nm_clone->next_frames[j];
843  u32 save_node_runtime_index;
844  u32 save_flags;
845 
846  save_node_runtime_index = nf->node_runtime_index;
847  save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
849  nf->node_runtime_index = save_node_runtime_index;
850  nf->flags = save_flags;
851  }
852 
853  /* fork the frame dispatch queue */
854  nm_clone->pending_frames = 0;
855  vec_validate (nm_clone->pending_frames, 10); /* $$$$$?????? */
856  _vec_len (nm_clone->pending_frames) = 0;
857 
858  /* fork nodes */
859  nm_clone->nodes = 0;
860 
861  /* Allocate all nodes in single block for speed */
862  n = clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*n));
863 
864  for (j = 0; j < vec_len (nm->nodes); j++)
865  {
866  clib_memcpy (n, nm->nodes[j], sizeof (*n));
867  /* none of the copied nodes have enqueue rights given out */
869  memset (&n->stats_total, 0, sizeof (n->stats_total));
870  memset (&n->stats_last_clear, 0,
871  sizeof (n->stats_last_clear));
872  vec_add1 (nm_clone->nodes, n);
873  n++;
874  }
877  vec_foreach (rt,
879  {
880  vlib_node_t *n = vlib_get_node (vm, rt->node_index);
881  rt->thread_index = vm_clone->thread_index;
882  /* copy initial runtime_data from node */
883  if (n->runtime_data && n->runtime_data_bytes > 0)
886  n->runtime_data_bytes));
887  }
888 
892  {
893  vlib_node_t *n = vlib_get_node (vm, rt->node_index);
894  rt->thread_index = vm_clone->thread_index;
895  /* copy initial runtime_data from node */
896  if (n->runtime_data && n->runtime_data_bytes > 0)
899  n->runtime_data_bytes));
900  }
901 
902  nm_clone->processes = vec_dup (nm->processes);
903 
904  /* zap the (per worker) frame freelists, etc */
905  nm_clone->frame_sizes = 0;
906  nm_clone->frame_size_hash = hash_create (0, sizeof (uword));
907 
908  /* Packet trace buffers are guaranteed to be empty, nothing to do here */
909 
910  clib_mem_set_heap (oldheap);
912 
913  vm_clone->error_main.counters =
914  vec_dup (vlib_mains[0]->error_main.counters);
915  vm_clone->error_main.counters_last_clear =
916  vec_dup (vlib_mains[0]->error_main.counters_last_clear);
917 
918  /* Fork the vlib_buffer_main_t free lists, etc. */
919  bm_clone = vec_dup (vm_clone->buffer_main);
920  vm_clone->buffer_main = bm_clone;
921 
922  orig_freelist_pool = bm_clone->buffer_free_list_pool;
923  bm_clone->buffer_free_list_pool = 0;
924 
925  /* *INDENT-OFF* */
926  pool_foreach (fl_orig, orig_freelist_pool,
927  ({
929  fl_clone, CLIB_CACHE_LINE_BYTES);
930  ASSERT (fl_orig - orig_freelist_pool
931  == fl_clone - bm_clone->buffer_free_list_pool);
932 
933  fl_clone[0] = fl_orig[0];
934  fl_clone->buffers = 0;
935  fl_clone->n_alloc = 0;
936  }));
937 /* *INDENT-ON* */
938 
939  worker_thread_index++;
940  }
941  }
942  }
943  else
944  {
945  /* only have non-data-structure copy threads to create... */
946  for (i = 0; i < vec_len (tm->registrations); i++)
947  {
948  tr = tm->registrations[i];
949 
950  for (j = 0; j < tr->count; j++)
951  {
952  vec_add2 (vlib_worker_threads, w, 1);
953  if (tr->mheap_size)
954  w->thread_mheap =
955  mheap_alloc (0 /* use VM */ , tr->mheap_size);
956  else
957  w->thread_mheap = main_heap;
958  w->thread_stack =
959  vlib_thread_stack_init (w - vlib_worker_threads);
960  w->thread_function = tr->function;
961  w->thread_function_arg = w;
962  w->instance_id = j;
963  w->elog_track.name =
964  (char *) format (0, "%s %d", tr->name, j + 1);
965  w->registration = tr;
966  vec_add1 (w->elog_track.name, 0);
968  }
969  }
970  }
971 
972  worker_thread_index = 1;
973 
974  for (i = 0; i < vec_len (tm->registrations); i++)
975  {
976  clib_error_t *err;
977  int j;
978 
979  tr = tm->registrations[i];
980 
981  if (tr->use_pthreads || tm->use_pthreads)
982  {
983  for (j = 0; j < tr->count; j++)
984  {
985  w = vlib_worker_threads + worker_thread_index++;
987  w, 0);
988  if (err)
989  clib_error_report (err);
990  }
991  }
992  else
993  {
994  uword c;
995  /* *INDENT-OFF* */
996  clib_bitmap_foreach (c, tr->coremask, ({
997  w = vlib_worker_threads + worker_thread_index++;
998  err = vlib_launch_thread_int (vlib_worker_thread_bootstrap_fn,
999  w, c);
1000  if (err)
1001  clib_error_report (err);
1002  }));
1003  /* *INDENT-ON* */
1004  }
1005  }
1008  return 0;
1009 }
1010 
1012 
1013 
1014 static inline void
1016 {
1017  int i, j;
1018  vlib_main_t *vm;
1019  vlib_node_main_t *nm, *nm_clone;
1020  vlib_main_t *vm_clone;
1021  vlib_node_runtime_t *rt;
1022  never_inline void
1024  vlib_node_runtime_t * r,
1025  uword n_calls,
1026  uword n_vectors, uword n_clocks);
1027 
1028  ASSERT (vlib_get_thread_index () == 0);
1029 
1030  vm = vlib_mains[0];
1031  nm = &vm->node_main;
1032 
1033  ASSERT (*vlib_worker_threads->wait_at_barrier == 1);
1034 
1035  /*
1036  * Scrape all runtime stats, so we don't lose node runtime(s) with
1037  * pending counts, or throw away worker / io thread counts.
1038  */
1039  for (j = 0; j < vec_len (nm->nodes); j++)
1040  {
1041  vlib_node_t *n;
1042  n = nm->nodes[j];
1043  vlib_node_sync_stats (vm, n);
1044  }
1045 
1046  for (i = 1; i < vec_len (vlib_mains); i++)
1047  {
1048  vlib_node_t *n;
1049 
1050  vm_clone = vlib_mains[i];
1051  nm_clone = &vm_clone->node_main;
1052 
1053  for (j = 0; j < vec_len (nm_clone->nodes); j++)
1054  {
1055  n = nm_clone->nodes[j];
1056 
1057  rt = vlib_node_get_runtime (vm_clone, n->index);
1058  vlib_node_runtime_sync_stats (vm_clone, rt, 0, 0, 0);
1059  }
1060  }
1061 
1062  /* Per-worker clone rebuilds are now done on each thread */
1063 }
1064 
1065 
1066 void
1068 {
1069  vlib_main_t *vm, *vm_clone;
1070  vlib_node_main_t *nm, *nm_clone;
1071  vlib_node_t **old_nodes_clone;
1072  vlib_node_runtime_t *rt, *old_rt;
1073 
1074  vlib_node_t *new_n_clone;
1075 
1076  int j;
1077 
1078  vm = vlib_mains[0];
1079  nm = &vm->node_main;
1080  vm_clone = vlib_get_main ();
1081  nm_clone = &vm_clone->node_main;
1082 
1083  /* Re-clone error heap */
1084  u64 *old_counters = vm_clone->error_main.counters;
1085  u64 *old_counters_all_clear = vm_clone->error_main.counters_last_clear;
1086 
1087  clib_memcpy (&vm_clone->error_main, &vm->error_main,
1088  sizeof (vm->error_main));
1089  j = vec_len (vm->error_main.counters) - 1;
1090  vec_validate_aligned (old_counters, j, CLIB_CACHE_LINE_BYTES);
1091  vec_validate_aligned (old_counters_all_clear, j, CLIB_CACHE_LINE_BYTES);
1092  vm_clone->error_main.counters = old_counters;
1093  vm_clone->error_main.counters_last_clear = old_counters_all_clear;
1094 
1095  nm_clone = &vm_clone->node_main;
1096  vec_free (nm_clone->next_frames);
1097  nm_clone->next_frames = vec_dup (nm->next_frames);
1098 
1099  for (j = 0; j < vec_len (nm_clone->next_frames); j++)
1100  {
1101  vlib_next_frame_t *nf = &nm_clone->next_frames[j];
1102  u32 save_node_runtime_index;
1103  u32 save_flags;
1104 
1105  save_node_runtime_index = nf->node_runtime_index;
1106  save_flags = nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH;
1107  vlib_next_frame_init (nf);
1108  nf->node_runtime_index = save_node_runtime_index;
1109  nf->flags = save_flags;
1110  }
1111 
1112  old_nodes_clone = nm_clone->nodes;
1113  nm_clone->nodes = 0;
1114 
1115  /* re-fork nodes */
1116 
1117  /* Allocate all nodes in single block for speed */
1118  new_n_clone =
1119  clib_mem_alloc_no_fail (vec_len (nm->nodes) * sizeof (*new_n_clone));
1120  for (j = 0; j < vec_len (nm->nodes); j++)
1121  {
1122  vlib_node_t *old_n_clone;
1123  vlib_node_t *new_n;
1124 
1125  new_n = nm->nodes[j];
1126  old_n_clone = old_nodes_clone[j];
1127 
1128  clib_memcpy (new_n_clone, new_n, sizeof (*new_n));
1129  /* none of the copied nodes have enqueue rights given out */
1131 
1132  if (j >= vec_len (old_nodes_clone))
1133  {
1134  /* new node, set to zero */
1135  memset (&new_n_clone->stats_total, 0,
1136  sizeof (new_n_clone->stats_total));
1137  memset (&new_n_clone->stats_last_clear, 0,
1138  sizeof (new_n_clone->stats_last_clear));
1139  }
1140  else
1141  {
1142  /* Copy stats if the old data is valid */
1143  clib_memcpy (&new_n_clone->stats_total,
1144  &old_n_clone->stats_total,
1145  sizeof (new_n_clone->stats_total));
1146  clib_memcpy (&new_n_clone->stats_last_clear,
1147  &old_n_clone->stats_last_clear,
1148  sizeof (new_n_clone->stats_last_clear));
1149 
1150  /* keep previous node state */
1151  new_n_clone->state = old_n_clone->state;
1152  }
1153  vec_add1 (nm_clone->nodes, new_n_clone);
1154  new_n_clone++;
1155  }
1156  /* Free the old node clones */
1157  clib_mem_free (old_nodes_clone[0]);
1158 
1159  vec_free (old_nodes_clone);
1160 
1161 
1162  /* re-clone internal nodes */
1163  old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INTERNAL];
1166 
1168  {
1169  vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1170  rt->thread_index = vm_clone->thread_index;
1171  /* copy runtime_data, will be overwritten later for existing rt */
1172  if (n->runtime_data && n->runtime_data_bytes > 0)
1175  n->runtime_data_bytes));
1176  }
1177 
1178  for (j = 0; j < vec_len (old_rt); j++)
1179  {
1180  rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1181  rt->state = old_rt[j].state;
1182  clib_memcpy (rt->runtime_data, old_rt[j].runtime_data,
1184  }
1185 
1186  vec_free (old_rt);
1187 
1188  /* re-clone input nodes */
1189  old_rt = nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT];
1190  nm_clone->nodes_by_type[VLIB_NODE_TYPE_INPUT] =
1192 
1194  {
1195  vlib_node_t *n = vlib_get_node (vm, rt->node_index);
1196  rt->thread_index = vm_clone->thread_index;
1197  /* copy runtime_data, will be overwritten later for existing rt */
1198  if (n->runtime_data && n->runtime_data_bytes > 0)
1201  n->runtime_data_bytes));
1202  }
1203 
1204  for (j = 0; j < vec_len (old_rt); j++)
1205  {
1206  rt = vlib_node_get_runtime (vm_clone, old_rt[j].node_index);
1207  rt->state = old_rt[j].state;
1208  clib_memcpy (rt->runtime_data, old_rt[j].runtime_data,
1210  }
1211 
1212  vec_free (old_rt);
1213 
1214  nm_clone->processes = vec_dup (nm->processes);
1215 }
1216 
1217 void
1219 {
1220  /*
1221  * Make a note that we need to do a node runtime update
1222  * prior to releasing the barrier.
1223  */
1225 }
1226 
1227 u32
1228 unformat_sched_policy (unformat_input_t * input, va_list * args)
1229 {
1230  u32 *r = va_arg (*args, u32 *);
1231 
1232  if (0);
1233 #define _(v,f,s) else if (unformat (input, s)) *r = SCHED_POLICY_##f;
1235 #undef _
1236  else
1237  return 0;
1238  return 1;
1239 }
1240 
1241 static clib_error_t *
1243 {
1245  uword *p;
1247  u8 *name;
1248  u64 coremask;
1249  uword *bitmap;
1250  u32 count;
1251 
1253 
1254  tm->n_thread_stacks = 1; /* account for main thread */
1255  tm->sched_policy = ~0;
1256  tm->sched_priority = ~0;
1257 
1258  tr = tm->next;
1259 
1260  while (tr)
1261  {
1263  tr = tr->next;
1264  }
1265 
1266  while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1267  {
1268  if (unformat (input, "use-pthreads"))
1269  tm->use_pthreads = 1;
1270  else if (unformat (input, "thread-prefix %v", &tm->thread_prefix))
1271  ;
1272  else if (unformat (input, "main-core %u", &tm->main_lcore))
1273  ;
1274  else if (unformat (input, "skip-cores %u", &tm->skip_cores))
1275  ;
1276  else if (unformat (input, "coremask-%s %llx", &name, &coremask))
1277  {
1279  if (p == 0)
1280  return clib_error_return (0, "no such thread type '%s'", name);
1281 
1282  tr = (vlib_thread_registration_t *) p[0];
1283 
1284  if (tr->use_pthreads)
1285  return clib_error_return (0,
1286  "coremask cannot be set for '%s' threads",
1287  name);
1288 
1290  (tr->coremask, 0, coremask, BITS (coremask));
1292  }
1293  else if (unformat (input, "corelist-%s %U", &name, unformat_bitmap_list,
1294  &bitmap))
1295  {
1297  if (p == 0)
1298  return clib_error_return (0, "no such thread type '%s'", name);
1299 
1300  tr = (vlib_thread_registration_t *) p[0];
1301 
1302  if (tr->use_pthreads)
1303  return clib_error_return (0,
1304  "corelist cannot be set for '%s' threads",
1305  name);
1306 
1307  tr->coremask = bitmap;
1309  }
1310  else
1311  if (unformat
1312  (input, "scheduler-policy %U", unformat_sched_policy,
1313  &tm->sched_policy))
1314  ;
1315  else if (unformat (input, "scheduler-priority %u", &tm->sched_priority))
1316  ;
1317  else if (unformat (input, "%s %u", &name, &count))
1318  {
1320  if (p == 0)
1321  return clib_error_return (0, "no such thread type 3 '%s'", name);
1322 
1323  tr = (vlib_thread_registration_t *) p[0];
1324  if (tr->fixed_count)
1325  return clib_error_return
1326  (0, "number of %s threads not configurable", tr->name);
1327  tr->count = count;
1328  }
1329  else
1330  break;
1331  }
1332 
1333  if (tm->sched_priority != ~0)
1334  {
1335  if (tm->sched_policy == SCHED_FIFO || tm->sched_policy == SCHED_RR)
1336  {
1337  u32 prio_max = sched_get_priority_max (tm->sched_policy);
1338  u32 prio_min = sched_get_priority_min (tm->sched_policy);
1339  if (tm->sched_priority > prio_max)
1340  tm->sched_priority = prio_max;
1341  if (tm->sched_priority < prio_min)
1342  tm->sched_priority = prio_min;
1343  }
1344  else
1345  {
1346  return clib_error_return
1347  (0,
1348  "scheduling priority (%d) is not allowed for `normal` scheduling policy",
1349  tm->sched_priority);
1350  }
1351  }
1352  tr = tm->next;
1353 
1354  if (!tm->thread_prefix)
1355  tm->thread_prefix = format (0, "vpp");
1356 
1357  while (tr)
1358  {
1359  tm->n_thread_stacks += tr->count;
1360  tm->n_pthreads += tr->count * tr->use_pthreads;
1361  tm->n_threads += tr->count * (tr->use_pthreads == 0);
1362  tr = tr->next;
1363  }
1364 
1365  return 0;
1366 }
1367 
1369 
1370 #if !defined (__x86_64__) && !defined (__i386__) && !defined (__aarch64__) && !defined (__powerpc64__) && !defined(__arm__)
1371 void
1372 __sync_fetch_and_add_8 (void)
1373 {
1374  fformat (stderr, "%s called\n", __FUNCTION__);
1375  abort ();
1376 }
1377 
1378 void
1379 __sync_add_and_fetch_8 (void)
1380 {
1381  fformat (stderr, "%s called\n", __FUNCTION__);
1382  abort ();
1383 }
1384 #endif
1385 
1386 void vnet_main_fixup (vlib_fork_fixup_t which) __attribute__ ((weak));
1387 void
1389 {
1390 }
1391 
1392 void
1394 {
1395  vlib_main_t *vm = vlib_get_main ();
1396 
1397  if (vlib_mains == 0)
1398  return;
1399 
1400  ASSERT (vlib_get_thread_index () == 0);
1402 
1403  switch (which)
1404  {
1407  break;
1408 
1409  default:
1410  ASSERT (0);
1411  }
1413 }
1414 
1415  /*
1416  * Enforce minimum open time to minimize packet loss due to Rx overflow,
1417  * based on a test based heuristic that barrier should be open for at least
1418  * 3 time as long as it is closed (with an upper bound of 1ms because by that
1419  * point it is probably too late to make a difference)
1420  */
1421 
1422 #ifndef BARRIER_MINIMUM_OPEN_LIMIT
1423 #define BARRIER_MINIMUM_OPEN_LIMIT 0.001
1424 #endif
1425 
1426 #ifndef BARRIER_MINIMUM_OPEN_FACTOR
1427 #define BARRIER_MINIMUM_OPEN_FACTOR 3
1428 #endif
1429 
1430 void
1432 {
1433  f64 deadline;
1434  f64 now;
1435  f64 t_entry;
1436  f64 t_open;
1437  f64 t_closed;
1438  u32 count;
1439 
1440  if (vec_len (vlib_mains) < 2)
1441  return;
1442 
1443  ASSERT (vlib_get_thread_index () == 0);
1444 
1445  count = vec_len (vlib_mains) - 1;
1446 
1447  /* Record entry relative to last close */
1448  now = vlib_time_now (vm);
1449  t_entry = now - vm->barrier_epoch;
1450 
1451  /* Tolerate recursive calls */
1452  if (++vlib_worker_threads[0].recursion_level > 1)
1453  {
1454  barrier_trace_sync_rec (t_entry);
1455  return;
1456  }
1457 
1458  vlib_worker_threads[0].barrier_sync_count++;
1459 
1460  /* Enforce minimum barrier open time to minimize packet loss */
1462  while ((now = vlib_time_now (vm)) < vm->barrier_no_close_before)
1463  ;
1464 
1465  /* Record time of closure */
1466  t_open = now - vm->barrier_epoch;
1467  vm->barrier_epoch = now;
1468 
1469  deadline = now + BARRIER_SYNC_TIMEOUT;
1470 
1471  *vlib_worker_threads->wait_at_barrier = 1;
1472  while (*vlib_worker_threads->workers_at_barrier != count)
1473  {
1474  if ((now = vlib_time_now (vm)) > deadline)
1475  {
1476  fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1477  os_panic ();
1478  }
1479  }
1480 
1481  t_closed = now - vm->barrier_epoch;
1482 
1483  barrier_trace_sync (t_entry, t_open, t_closed);
1484 
1485 }
1486 
1487 void
1489 {
1490  f64 deadline;
1491  f64 now;
1492  f64 minimum_open;
1493  f64 t_entry;
1494  f64 t_closed_total;
1495  f64 t_update_main = 0.0;
1496  int refork_needed = 0;
1497 
1498  if (vec_len (vlib_mains) < 2)
1499  return;
1500 
1501  ASSERT (vlib_get_thread_index () == 0);
1502 
1503 
1504  now = vlib_time_now (vm);
1505  t_entry = now - vm->barrier_epoch;
1506 
1507  if (--vlib_worker_threads[0].recursion_level > 0)
1508  {
1509  barrier_trace_release_rec (t_entry);
1510  return;
1511  }
1512 
1513  /* Update (all) node runtimes before releasing the barrier, if needed */
1515  {
1516  /* Do stats elements on main thread */
1519 
1520  /* Do per thread rebuilds in parallel */
1521  refork_needed = 1;
1522  clib_smp_atomic_add (vlib_worker_threads->node_reforks_required,
1523  (vec_len (vlib_mains) - 1));
1524  now = vlib_time_now (vm);
1525  t_update_main = now - vm->barrier_epoch;
1526  }
1527 
1528  deadline = now + BARRIER_SYNC_TIMEOUT;
1529 
1530  *vlib_worker_threads->wait_at_barrier = 0;
1531 
1532  while (*vlib_worker_threads->workers_at_barrier > 0)
1533  {
1534  if ((now = vlib_time_now (vm)) > deadline)
1535  {
1536  fformat (stderr, "%s: worker thread deadlock\n", __FUNCTION__);
1537  os_panic ();
1538  }
1539  }
1540 
1541  /* Wait for reforks before continuing */
1542  if (refork_needed)
1543  {
1544  now = vlib_time_now (vm);
1545 
1546  deadline = now + BARRIER_SYNC_TIMEOUT;
1547 
1548  while (*vlib_worker_threads->node_reforks_required > 0)
1549  {
1550  if ((now = vlib_time_now (vm)) > deadline)
1551  {
1552  fformat (stderr, "%s: worker thread refork deadlock\n",
1553  __FUNCTION__);
1554  os_panic ();
1555  }
1556  }
1557  }
1558 
1559  t_closed_total = now - vm->barrier_epoch;
1560 
1561  minimum_open = t_closed_total * BARRIER_MINIMUM_OPEN_FACTOR;
1562 
1563  if (minimum_open > BARRIER_MINIMUM_OPEN_LIMIT)
1564  {
1565  minimum_open = BARRIER_MINIMUM_OPEN_LIMIT;
1566  }
1567 
1568  vm->barrier_no_close_before = now + minimum_open;
1569 
1570  /* Record barrier epoch (used to enforce minimum open time) */
1571  vm->barrier_epoch = now;
1572 
1573  barrier_trace_release (t_entry, t_closed_total, t_update_main);
1574 
1575 }
1576 
1577 /*
1578  * Check the frame queue to see if any frames are available.
1579  * If so, pull the packets off the frames and put them to
1580  * the handoff node.
1581  */
1582 int
1584 {
1585  u32 thread_id = vm->thread_index;
1586  vlib_frame_queue_t *fq = fqm->vlib_frame_queues[thread_id];
1588  u32 *from, *to;
1589  vlib_frame_t *f;
1590  int msg_type;
1591  int processed = 0;
1592  u32 n_left_to_node;
1593  u32 vectors = 0;
1594 
1595  ASSERT (fq);
1596  ASSERT (vm == vlib_mains[thread_id]);
1597 
1598  if (PREDICT_FALSE (fqm->node_index == ~0))
1599  return 0;
1600  /*
1601  * Gather trace data for frame queues
1602  */
1603  if (PREDICT_FALSE (fq->trace))
1604  {
1605  frame_queue_trace_t *fqt;
1607  u32 elix;
1608 
1609  fqt = &fqm->frame_queue_traces[thread_id];
1610 
1611  fqt->nelts = fq->nelts;
1612  fqt->head = fq->head;
1613  fqt->head_hint = fq->head_hint;
1614  fqt->tail = fq->tail;
1615  fqt->threshold = fq->vector_threshold;
1616  fqt->n_in_use = fqt->tail - fqt->head;
1617  if (fqt->n_in_use >= fqt->nelts)
1618  {
1619  // if beyond max then use max
1620  fqt->n_in_use = fqt->nelts - 1;
1621  }
1622 
1623  /* Record the number of elements in use in the histogram */
1624  fqh = &fqm->frame_queue_histogram[thread_id];
1625  fqh->count[fqt->n_in_use]++;
1626 
1627  /* Record a snapshot of the elements in use */
1628  for (elix = 0; elix < fqt->nelts; elix++)
1629  {
1630  elt = fq->elts + ((fq->head + 1 + elix) & (fq->nelts - 1));
1631  if (1 || elt->valid)
1632  {
1633  fqt->n_vectors[elix] = elt->n_vectors;
1634  }
1635  }
1636  fqt->written = 1;
1637  }
1638 
1639  while (1)
1640  {
1641  if (fq->head == fq->tail)
1642  {
1643  fq->head_hint = fq->head;
1644  return processed;
1645  }
1646 
1647  elt = fq->elts + ((fq->head + 1) & (fq->nelts - 1));
1648 
1649  if (!elt->valid)
1650  {
1651  fq->head_hint = fq->head;
1652  return processed;
1653  }
1654 
1655  from = elt->buffer_index;
1656  msg_type = elt->msg_type;
1657 
1659  ASSERT (elt->n_vectors <= VLIB_FRAME_SIZE);
1660 
1661  f = vlib_get_frame_to_node (vm, fqm->node_index);
1662 
1663  to = vlib_frame_vector_args (f);
1664 
1665  n_left_to_node = elt->n_vectors;
1666 
1667  while (n_left_to_node >= 4)
1668  {
1669  to[0] = from[0];
1670  to[1] = from[1];
1671  to[2] = from[2];
1672  to[3] = from[3];
1673  to += 4;
1674  from += 4;
1675  n_left_to_node -= 4;
1676  }
1677 
1678  while (n_left_to_node > 0)
1679  {
1680  to[0] = from[0];
1681  to++;
1682  from++;
1683  n_left_to_node--;
1684  }
1685 
1686  vectors += elt->n_vectors;
1687  f->n_vectors = elt->n_vectors;
1688  vlib_put_frame_to_node (vm, fqm->node_index, f);
1689 
1690  elt->valid = 0;
1691  elt->n_vectors = 0;
1692  elt->msg_type = 0xfefefefe;
1694  fq->head++;
1695  processed++;
1696 
1697  /*
1698  * Limit the number of packets pushed into the graph
1699  */
1700  if (vectors >= fq->vector_threshold)
1701  {
1702  fq->head_hint = fq->head;
1703  return processed;
1704  }
1705  }
1706  ASSERT (0);
1707  return processed;
1708 }
1709 
1710 void
1712 {
1715  vlib_main_t *vm = vlib_get_main ();
1716  clib_error_t *e;
1717 
1719 
1721  clib_time_init (&vm->clib_time);
1723 
1724  /* Wait until the dpdk init sequence is complete */
1725  while (tm->extern_thread_mgmt && tm->worker_thread_release == 0)
1727 
1729  (vm, vm->worker_init_function_registrations, 1 /* call_once */ );
1730  if (e)
1731  clib_error_report (e);
1732 
1733  vlib_worker_loop (vm);
1734 }
1735 
1736 /* *INDENT-OFF* */
1737 VLIB_REGISTER_THREAD (worker_thread_reg, static) = {
1738  .name = "workers",
1739  .short_name = "wk",
1740  .function = vlib_worker_thread_fn,
1741 };
1742 /* *INDENT-ON* */
1743 
1744 u32
1745 vlib_frame_queue_main_init (u32 node_index, u32 frame_queue_nelts)
1746 {
1749  vlib_frame_queue_t *fq;
1750  int i;
1751 
1752  if (frame_queue_nelts == 0)
1753  frame_queue_nelts = FRAME_QUEUE_NELTS;
1754 
1755  vec_add2 (tm->frame_queue_mains, fqm, 1);
1756 
1757  fqm->node_index = node_index;
1758 
1760  _vec_len (fqm->vlib_frame_queues) = 0;
1761  for (i = 0; i < tm->n_vlib_mains; i++)
1762  {
1763  fq = vlib_frame_queue_alloc (frame_queue_nelts);
1764  vec_add1 (fqm->vlib_frame_queues, fq);
1765  }
1766 
1767  return (fqm - tm->frame_queue_mains);
1768 }
1769 
1770 int
1772 {
1774 
1775  if (tm->extern_thread_mgmt)
1776  return -1;
1777 
1779  tm->extern_thread_mgmt = 1;
1780  return 0;
1781 }
1782 
1783 void
1785  args)
1786 {
1787  ASSERT (vlib_get_thread_index () == 0);
1789  args->type_opaque, args->data);
1790 }
1791 
1793 
1794 void
1795 vlib_rpc_call_main_thread (void *callback, u8 * args, u32 arg_size)
1796 {
1798  {
1799  void (*fp) (void *, u8 *, u32) = rpc_call_main_thread_cb_fn;
1800  (*fp) (callback, args, arg_size);
1801  }
1802  else
1803  clib_warning ("BUG: rpc_call_main_thread_cb_fn NULL!");
1804 }
1805 
1806 clib_error_t *
1808 {
1809  return 0;
1810 }
1811 
1813 
1814 /*
1815  * fd.io coding-style-patch-verification: ON
1816  *
1817  * Local Variables:
1818  * eval: (c-set-style "gnu")
1819  * End:
1820  */
_vlib_init_function_list_elt_t * worker_init_function_registrations
Definition: main.h:179
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:432
static void barrier_trace_release_rec(f64 t_entry)
Definition: threads.c:244
static void barrier_trace_sync(f64 t_entry, f64 t_open, f64 t_closed)
Definition: threads.c:234
u32 vl(void *p)
Definition: threads.c:30
vlib_main_t vlib_global_main
Definition: main.c:1650
never_inline void vlib_node_runtime_sync_stats(vlib_main_t *vm, vlib_node_runtime_t *r, uword n_calls, uword n_vectors, uword n_clocks)
Definition: main.c:540
sll srl srl sll sra u16x4 i
Definition: vector_sse2.h:337
clib_error_t *(* vlib_thread_set_lcore_cb)(u32 thread, u16 lcore)
Definition: threads.h:286
#define clib_min(x, y)
Definition: clib.h:332
vlib_process_t ** processes
Definition: node.h:681
static void vlib_buffer_free(vlib_main_t *vm, u32 *buffers, u32 n_buffers)
Free buffers Frees the entire buffer chain for each buffer.
Definition: buffer_funcs.h:317
u8 runtime_data[0]
Function dependent node-runtime data.
Definition: node.h:464
int vlib_frame_queue_enqueue(vlib_main_t *vm, u32 node_runtime_index, u32 frame_queue_index, vlib_frame_t *frame, vlib_frame_queue_msg_type_t type)
#define VLIB_MAIN_LOOP_ENTER_FUNCTION(x)
Definition: init.h:114
word elog_track_register(elog_main_t *em, elog_track_t *t)
register an event track
Definition: elog.c:198
void * mheap_alloc(void *memory, uword size)
Definition: mheap.c:947
#define NULL
Definition: clib.h:55
u32 index
Definition: node.h:237
static f64 vlib_time_now(vlib_main_t *vm)
Definition: main.h:221
#define vec_add2_aligned(V, P, N, A)
Add N elements to end of vector V, return pointer to new elements in P.
Definition: vec.h:569
clib_error_t * threads_init(vlib_main_t *vm)
Definition: threads.c:1807
void os_panic(void)
Definition: unix-misc.c:174
u32 vlib_frame_queue_main_init(u32 node_index, u32 frame_queue_nelts)
Definition: threads.c:1745
u32 thread_index
Definition: main.h:173
void * thread_function_arg
Definition: threads.h:114
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:518
static int sort_registrations_by_no_clone(void *a0, void *a1)
Definition: threads.c:282
static u64 clib_cpu_time_now(void)
Definition: time.h:73
frame_queue_trace_t * frame_queue_traces
Definition: threads.h:170
void vlib_process_signal_event_mt_helper(vlib_process_signal_event_mt_args_t *args)
Definition: threads.c:1784
elog_track_t elog_track
Definition: threads.h:116
#define VLIB_FRAME_NO_FREE_AFTER_DISPATCH
Definition: node.h:362
#define vec_add2(V, P, N)
Add N elements to end of vector V, return pointer to new elements in P.
Definition: vec.h:557
static mheap_t * mheap_header(u8 *v)
vlib_buffer_main_t * buffer_main
Definition: main.h:106
void vnet_main_fixup(vlib_fork_fixup_t which)
Definition: threads.c:1388
static uword * clib_bitmap_set(uword *ai, uword i, uword value)
Sets the ith bit of a bitmap to new_value Removes trailing zeros from the bitmap. ...
Definition: bitmap.h:167
#define hash_set_mem(h, key, value)
Definition: hash.h:274
u8 * format(u8 *s, const char *fmt,...)
Definition: format.c:419
clib_time_t clib_time
Definition: main.h:62
void vlib_worker_thread_fn(void *arg)
Definition: threads.c:1711
u32 unformat_sched_policy(unformat_input_t *input, va_list *args)
Definition: threads.c:1228
pthread_t thread[MAX_THREADS]
Definition: main.c:110
#define vec_validate_aligned(V, I, A)
Make sure vector is long enough for given index (no header, specified alignment)
Definition: vec.h:443
struct vlib_thread_registration_ * next
Definition: threads.h:47
#define MHEAP_FLAG_THREAD_SAFE
u32 buffer_index[VLIB_FRAME_SIZE]
Definition: threads.h:98
void * runtime_data
Definition: node.h:243
volatile u32 valid
Definition: threads.h:92
vlib_main_t ** vlib_mains
Definition: buffer.c:292
#define clib_bitmap_dup(v)
Duplicate a bitmap.
Definition: bitmap.h:87
#define vec_reset_length(v)
Reset vector length to zero NULL-pointer tolerant.
u8 state
Definition: node.h:265
u16 thread_index
thread this node runs on
Definition: node.h:462
#define vlib_worker_thread_barrier_sync(X)
Definition: threads.h:212
u64 * counters_last_clear
Definition: error.h:81
static void vlib_worker_thread_barrier_check(void)
Definition: threads.h:392
vlib_thread_registration_t * next
Definition: threads.h:292
#define vec_add1_aligned(V, E, A)
Add 1 element to end of vector (alignment specified).
Definition: vec.h:528
vlib_node_stats_t stats_last_clear
Definition: node.h:231
#define clib_smp_atomic_add(addr, increment)
Definition: smp.h:46
#define pool_foreach(VAR, POOL, BODY)
Iterate through pool.
Definition: pool.h:437
void vlib_worker_thread_node_runtime_update(void)
Definition: threads.c:1218
u64 count[FRAME_QUEUE_MAX_NELTS]
Definition: node.h:725
#define VLIB_INIT_FUNCTION(x)
Definition: init.h:111
vlib_frame_queue_msg_type_t
Definition: threads.h:84
vlib_node_t ** nodes
Definition: node.h:640
int i32
Definition: types.h:81
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
vlib_frame_t * vlib_get_frame_to_node(vlib_main_t *vm, u32 to_node_index)
Definition: main.c:182
#define clib_error_return(e, args...)
Definition: error.h:99
uword * lock
SMP lock, non-zero means locking required.
Definition: elog.h:172
uword * cpu_core_bitmap
Definition: threads.h:329
#define BARRIER_MINIMUM_OPEN_FACTOR
Definition: threads.c:1427
clib_error_t * vlib_call_init_exit_functions(vlib_main_t *vm, _vlib_init_function_list_elt_t *head, int call_once)
Definition: init.c:43
unsigned long u64
Definition: types.h:89
vlib_frame_queue_elt_t * elts
Definition: threads.h:159
vlib_node_runtime_t * nodes_by_type[VLIB_N_NODE_TYPE]
Definition: node.h:650
void vlib_set_thread_name(char *name)
Definition: threads.c:267
void vl_msg_api_handler_no_free(void *)
Definition: threads.c:506
#define hash_create_string(elts, value_bytes)
Definition: hash.h:652
void unformat_init_string(unformat_input_t *input, char *string, int string_len)
Definition: unformat.c:1023
vlib_fork_fixup_t
Definition: threads.h:236
#define BARRIER_SYNC_TIMEOUT
Definition: threads.h:204
#define VLIB_NODE_RUNTIME_DATA_SIZE
Definition: node.h:475
void * rpc_call_main_thread_cb_fn
Definition: threads.c:1792
VLIB_REGISTER_THREAD(worker_thread_reg, static)
int extern_thread_mgmt
Definition: threads.h:348
vlib_worker_thread_t * vlib_worker_threads
Definition: threads.c:35
#define clib_bitmap_foreach(i, ai, body)
Macro to iterate across set bits in a bitmap.
Definition: bitmap.h:361
u32 next_frame_index
Definition: node.h:403
vlib_node_stats_t stats_total
Definition: node.h:227
volatile u64 head
Definition: threads.h:146
u16 state
Input node state.
Definition: node.h:452
static void vlib_process_signal_event(vlib_main_t *vm, uword node_index, uword type_opaque, uword data)
Definition: node_funcs.h:950
static uword clib_bitmap_first_set(uword *ai)
Return the lowest numbered set bit in a bitmap.
Definition: bitmap.h:385
u8 * vlib_thread_stack_init(uword thread_index)
Definition: main.c:574
vlib_error_main_t error_main
Definition: main.h:138
static u32 vlib_frame_index(vlib_main_t *vm, vlib_frame_t *f)
Definition: node_funcs.h:245
vlib_thread_callbacks_t cb
Definition: threads.h:347
int vlib_thread_cb_register(struct vlib_main_t *vm, vlib_thread_callbacks_t *cb)
Definition: threads.c:1771
#define v
Definition: acl.c:323
struct _unformat_input_t unformat_input_t
char * name
Track name vector.
Definition: elog.h:115
#define clib_error_return_unix(e, args...)
Definition: error.h:102
void vlib_put_frame_to_node(vlib_main_t *vm, u32 to_node_index, vlib_frame_t *f)
Definition: main.c:191
#define vec_dup(V)
Return copy of vector (no header, no alignment)
Definition: vec.h:370
static void * clib_mem_get_per_cpu_heap(void)
Definition: mem.h:58
void vlib_frame_free(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_frame_t *f)
Definition: main.c:211
#define ELOG_DATA(em, f)
Definition: elog.h:481
static clib_error_t * vlib_launch_thread_int(void *fp, vlib_worker_thread_t *w, unsigned lcore_id)
Definition: threads.c:688
#define PREDICT_FALSE(x)
Definition: clib.h:97
void vlib_worker_thread_node_refork(void)
Definition: threads.c:1067
#define VLIB_FRAME_PENDING
Definition: node.h:373
#define VLIB_FRAME_SIZE
Definition: node.h:328
u32 node_index
Node index.
Definition: node.h:437
uword * init_functions_called
Definition: main.h:170
#define VLIB_FRAME_FREE_AFTER_DISPATCH
Definition: node.h:376
void clib_time_init(clib_time_t *c)
Definition: time.c:175
uword * frame_size_hash
Definition: node.h:696
vlib_thread_main_t vlib_thread_main
Definition: threads.c:36
word fformat(FILE *f, char *fmt,...)
Definition: format.c:453
void(* thread_function)(void *)
Definition: threads.h:113
static clib_error_t * cpu_config(vlib_main_t *vm, unformat_input_t *input)
Definition: threads.c:1242
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P (general version).
Definition: pool.h:188
i32 n_vectors[FRAME_QUEUE_MAX_NELTS]
Definition: node.h:720
u64 * counters
Definition: error.h:78
u32 owner_node_index
Definition: node.h:308
vlib_frame_queue_t * vlib_frame_queue_alloc(int nelts)
Definition: threads.c:472
volatile u64 tail
Definition: threads.h:138
#define clib_mem_alloc_no_fail(size)
Definition: mem.h:156
#define VLIB_EARLY_CONFIG_FUNCTION(x, n,...)
Definition: init.h:140
#define UNFORMAT_END_OF_INPUT
Definition: format.h:143
svmdb_client_t * c
u16 n_vectors
Definition: node.h:344
vlib_frame_queue_t ** vlib_frame_queues
Definition: threads.h:167
static_always_inline uword vlib_get_thread_index(void)
Definition: threads.h:221
vlib_main_t * vm
Definition: buffer.c:283
vec_header_t h
Definition: buffer.c:282
u32 node_runtime_index
Definition: node.h:397
vlib_pending_frame_t * pending_frames
Definition: node.h:666
vlib_thread_function_t * function
Definition: threads.h:52
int vlib_frame_queue_dequeue(vlib_main_t *vm, vlib_frame_queue_main_t *fqm)
Definition: threads.c:1583
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:336
void * heap_base
Definition: main.h:103
static void * clib_mem_set_heap(void *heap)
Definition: mem.h:226
#define clib_warning(format, args...)
Definition: error.h:59
static vlib_node_runtime_t * vlib_node_get_runtime(vlib_main_t *vm, u32 node_index)
Get node runtime by node index.
Definition: node_funcs.h:89
#define clib_memcpy(a, b, c)
Definition: string.h:69
elog_main_t elog_main
Definition: main.h:155
frame_queue_nelt_counter_t * frame_queue_histogram
Definition: threads.h:171
static uword * clib_bitmap_set_multiple(uword *bitmap, uword i, uword value, uword n_bits)
sets the ith through ith + n_bits bits in a bitmap
Definition: bitmap.h:275
static uword clib_bitmap_get(uword *ai, uword i)
Gets the ith bit value from a bitmap.
Definition: bitmap.h:197
#define ELOG_TYPE_DECLARE(f)
Definition: elog.h:439
static void vlib_next_frame_init(vlib_next_frame_t *nf)
Definition: node.h:386
void vlib_worker_thread_init(vlib_worker_thread_t *w)
Definition: threads.c:633
uword os_get_nthreads(void)
Definition: threads.c:255
static void * clib_mem_get_heap(void)
Definition: mem.h:220
volatile u32 * wait_at_barrier
Definition: threads.h:106
#define FRAME_QUEUE_NELTS
Definition: threads.c:27
#define never_inline
Definition: clib.h:81
#define hash_create(elts, value_bytes)
Definition: hash.h:658
#define ASSERT(truth)
unsigned int u32
Definition: types.h:88
static void barrier_trace_sync_rec(f64 t_entry)
Definition: threads.c:239
vlib_frame_queue_main_t * frame_queue_mains
Definition: threads.h:335
static u32 elog_id_for_msg_name(mc_main_t *m, char *msg_name)
Definition: mc.c:46
u16 flags
Definition: node.h:335
static void clib_mem_free(void *p)
Definition: mem.h:179
#define clib_error_report(e)
Definition: error.h:113
#define clib_bitmap_free(v)
Free a bitmap.
Definition: bitmap.h:92
void vlib_worker_thread_barrier_sync_int(vlib_main_t *vm)
Definition: threads.c:1431
size_t count
Definition: vapi.c:40
int need_vlib_worker_thread_node_runtime_update
Definition: main.h:202
uword * thread_registrations_by_name
Definition: threads.h:297
#define BARRIER_MINIMUM_OPEN_LIMIT
Definition: threads.c:1423
volatile u32 * node_reforks_required
Definition: threads.h:125
static void * clib_mem_alloc(uword size)
Definition: mem.h:112
static vlib_main_t * vlib_get_main(void)
Definition: global_funcs.h:23
u64 uword
Definition: types.h:112
void vlib_node_sync_stats(vlib_main_t *vm, vlib_node_t *n)
Definition: main.c:570
static uword clib_bitmap_count_set_bits(uword *ai)
Return the number of set bits in a bitmap.
Definition: bitmap.h:441
void ** mbuf_alloc_list
Definition: main.h:175
static void barrier_trace_release(f64 t_entry, f64 t_closed_total, f64 t_update_main)
Definition: threads.c:249
void vlib_worker_loop(vlib_main_t *vm)
Definition: main.c:1645
u32 elog_string(elog_main_t *em, char *fmt,...)
add a string to the event-log string table
Definition: elog.c:534
f64 barrier_no_close_before
Definition: main.h:211
static clib_error_t * start_workers(vlib_main_t *vm)
Definition: threads.c:714
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
double f64
Definition: types.h:142
void vlib_rpc_call_main_thread(void *callback, u8 *args, u32 arg_size)
Definition: threads.c:1795
unsigned char u8
Definition: types.h:56
#define VLIB_PENDING_FRAME_NO_NEXT_FRAME
Definition: node.h:406
DECLARE_CJ_GLOBAL_LOG
Definition: threads.c:25
vlib_node_main_t node_main
Definition: main.h:129
static uword unformat_bitmap_list(unformat_input_t *input, va_list *va)
unformat a list of bit ranges into a bitmap (eg "0-3,5-7,11" )
Definition: bitmap.h:693
vlib_buffer_free_list_t * buffer_free_list_pool
Definition: buffer.h:421
vlib_next_frame_t * next_frames
Definition: node.h:663
#define vec_sort_with_function(vec, f)
Sort a vector using the supplied element comparison function.
Definition: vec.h:956
static void unformat_free(unformat_input_t *i)
Definition: format.h:161
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:267
volatile u64 head_hint
Definition: threads.h:155
#define VLIB_THREAD_STACK_SIZE
Definition: threads.h:82
f64 barrier_epoch
Definition: main.h:208
vlib_frame_size_t * frame_sizes
Definition: node.h:699
clib_error_t *(* vlib_launch_thread_cb)(void *fp, vlib_worker_thread_t *w, unsigned lcore_id)
Definition: threads.h:284
#define hash_get_mem(h, key)
Definition: hash.h:268
static void worker_thread_node_runtime_update_internal(void)
Definition: threads.c:1015
static void * clib_mem_alloc_aligned(uword size, uword align)
Definition: mem.h:120
volatile u32 * workers_at_barrier
Definition: threads.h:107
uword clib_calljmp(uword(*func)(uword func_arg), uword func_arg, void *stack)
static uword * clib_sysfs_list_to_bitmap(char *filename)
Definition: threads.c:292
void vlib_worker_thread_barrier_release(vlib_main_t *vm)
Definition: threads.c:1488
#define VLIB_INVALID_NODE_INDEX
Definition: node.h:325
static vlib_thread_main_t * vlib_get_thread_main()
Definition: global_funcs.h:32
static f64 vlib_time_now_ticks(vlib_main_t *vm, u64 n)
Definition: main.h:227
static vlib_node_t * vlib_get_node(vlib_main_t *vm, u32 i)
Get vlib node by index.
Definition: node_funcs.h:59
#define vec_foreach(var, vec)
Vector iterator.
void * vlib_worker_thread_bootstrap_fn(void *arg)
Definition: threads.c:670
#define CLIB_MEMORY_BARRIER()
Definition: clib.h:101
u32 node_runtime_index
Definition: node.h:356
uword * cpu_socket_bitmap
Definition: threads.h:332
#define foreach_sched_policy
Definition: threads.h:267
vlib_thread_registration_t ** registrations
Definition: threads.h:295
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:67
u8 ** vlib_thread_stacks
Definition: main.c:557
pthread_t thread_id
Definition: threads.h:129
vlib_thread_registration_t * registration
Definition: threads.h:118
#define BITS(x)
Definition: clib.h:58
volatile u32 worker_thread_release
Definition: threads.h:338
void vlib_worker_thread_fork_fixup(vlib_fork_fixup_t which)
Definition: threads.c:1393
clib_random_buffer_t random_buffer
Definition: main.h:167
u8 runtime_data_bytes
Definition: node.h:268
uword unformat(unformat_input_t *i, const char *fmt,...)
Definition: unformat.c:972
static uword unformat_check_input(unformat_input_t *i)
Definition: format.h:169
clib_error_t * vlib_thread_init(vlib_main_t *vm)
Definition: threads.c:322