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.
16 * main.c: main vector processing loop
18 * Copyright (c) 2008 Eliot Dresselhaus
20 * Permission is hereby granted, free of charge, to any person obtaining
21 * a copy of this software and associated documentation files (the
22 * "Software"), to deal in the Software without restriction, including
23 * without limitation the rights to use, copy, modify, merge, publish,
24 * distribute, sublicense, and/or sell copies of the Software, and to
25 * permit persons to whom the Software is furnished to do so, subject to
26 * the following conditions:
28 * The above copyright notice and this permission notice shall be
29 * included in all copies or substantial portions of the Software.
31 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
32 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
33 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
34 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
35 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
36 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
37 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
41 #include <vppinfra/format.h>
42 #include <vlib/vlib.h>
43 #include <vlib/threads.h>
45 #include <vlib/unix/cj.h>
47 CJ_GLOBAL_LOG_PROTOTYPE;
49 /* Actually allocate a few extra slots of vector data to support
50 speculative vector enqueues which overflow vector data in next frame. */
51 #define VLIB_FRAME_SIZE_ALLOC (VLIB_FRAME_SIZE + 4)
56 vlib_frame_bytes (u32 n_scalar_bytes, u32 n_vector_bytes)
60 /* Make room for vlib_frame_t plus scalar arguments. */
61 n_bytes = vlib_frame_vector_byte_offset (n_scalar_bytes);
63 /* Make room for vector arguments.
64 Allocate a few extra slots of vector data to support
65 speculative vector enqueues which overflow vector data in next frame. */
66 #define VLIB_FRAME_SIZE_EXTRA 4
67 n_bytes += (VLIB_FRAME_SIZE + VLIB_FRAME_SIZE_EXTRA) * n_vector_bytes;
69 /* Magic number is first 32bit number after vector data.
70 Used to make sure that vector data is never overrun. */
71 #define VLIB_FRAME_MAGIC (0xabadc0ed)
72 n_bytes += sizeof (u32);
74 /* Pad to cache line. */
75 n_bytes = round_pow2 (n_bytes, CLIB_CACHE_LINE_BYTES);
81 vlib_frame_find_magic (vlib_frame_t * f, vlib_node_t * node)
85 p += vlib_frame_vector_byte_offset (node->scalar_size);
87 p += (VLIB_FRAME_SIZE + VLIB_FRAME_SIZE_EXTRA) * node->vector_size;
92 static vlib_frame_size_t *
93 get_frame_size_info (vlib_node_main_t * nm,
94 u32 n_scalar_bytes, u32 n_vector_bytes)
96 uword key = (n_scalar_bytes << 16) | n_vector_bytes;
99 p = hash_get (nm->frame_size_hash, key);
104 i = vec_len (nm->frame_sizes);
105 vec_validate (nm->frame_sizes, i);
106 hash_set (nm->frame_size_hash, key, i);
109 return vec_elt_at_index (nm->frame_sizes, i);
113 vlib_frame_alloc_to_node (vlib_main_t * vm, u32 to_node_index,
116 vlib_node_main_t *nm = &vm->node_main;
117 vlib_frame_size_t *fs;
118 vlib_node_t *to_node;
120 u32 fi, l, n, scalar_size, vector_size;
122 to_node = vlib_get_node (vm, to_node_index);
124 scalar_size = to_node->scalar_size;
125 vector_size = to_node->vector_size;
127 fs = get_frame_size_info (nm, scalar_size, vector_size);
128 n = vlib_frame_bytes (scalar_size, vector_size);
129 if ((l = vec_len (fs->free_frame_indices)) > 0)
131 /* Allocate from end of free list. */
132 fi = fs->free_frame_indices[l - 1];
133 f = vlib_get_frame_no_check (vm, fi);
134 _vec_len (fs->free_frame_indices) = l - 1;
138 f = clib_mem_alloc_aligned_no_fail (n, VLIB_FRAME_ALIGN);
139 f->cpu_index = vm->cpu_index;
140 fi = vlib_frame_index_no_check (vm, f);
143 /* Poison frame when debugging. */
146 u32 save_cpu_index = f->cpu_index;
150 f->cpu_index = save_cpu_index;
153 /* Insert magic number. */
157 magic = vlib_frame_find_magic (f, to_node);
158 *magic = VLIB_FRAME_MAGIC;
161 f->flags = VLIB_FRAME_IS_ALLOCATED | frame_flags;
163 f->scalar_size = scalar_size;
164 f->vector_size = vector_size;
166 fs->n_alloc_frames += 1;
171 /* Allocate a frame for from FROM_NODE to TO_NODE via TO_NEXT_INDEX.
172 Returns frame index. */
174 vlib_frame_alloc (vlib_main_t * vm, vlib_node_runtime_t * from_node_runtime,
177 vlib_node_t *from_node;
179 from_node = vlib_get_node (vm, from_node_runtime->node_index);
180 ASSERT (to_next_index < vec_len (from_node->next_nodes));
182 return vlib_frame_alloc_to_node (vm, from_node->next_nodes[to_next_index],
183 /* frame_flags */ 0);
187 vlib_get_frame_to_node (vlib_main_t * vm, u32 to_node_index)
189 u32 fi = vlib_frame_alloc_to_node (vm, to_node_index,
191 VLIB_FRAME_FREE_AFTER_DISPATCH);
192 return vlib_get_frame (vm, fi);
196 vlib_put_frame_to_node (vlib_main_t * vm, u32 to_node_index, vlib_frame_t * f)
198 vlib_pending_frame_t *p;
199 vlib_node_t *to_node;
201 if (f->n_vectors == 0)
204 to_node = vlib_get_node (vm, to_node_index);
206 vec_add2 (vm->node_main.pending_frames, p, 1);
208 f->flags |= VLIB_FRAME_PENDING;
209 p->frame_index = vlib_frame_index (vm, f);
210 p->node_runtime_index = to_node->runtime_index;
211 p->next_frame_index = VLIB_PENDING_FRAME_NO_NEXT_FRAME;
214 /* Free given frame. */
216 vlib_frame_free (vlib_main_t * vm, vlib_node_runtime_t * r, vlib_frame_t * f)
218 vlib_node_main_t *nm = &vm->node_main;
220 vlib_frame_size_t *fs;
223 ASSERT (f->flags & VLIB_FRAME_IS_ALLOCATED);
225 node = vlib_get_node (vm, r->node_index);
226 fs = get_frame_size_info (nm, node->scalar_size, node->vector_size);
228 frame_index = vlib_frame_index (vm, f);
230 ASSERT (f->flags & VLIB_FRAME_IS_ALLOCATED);
232 /* No next frames may point to freed frame. */
235 vlib_next_frame_t *nf;
236 vec_foreach (nf, vm->node_main.next_frames)
237 ASSERT (nf->frame_index != frame_index);
240 f->flags &= ~VLIB_FRAME_IS_ALLOCATED;
242 vec_add1 (fs->free_frame_indices, frame_index);
243 ASSERT (fs->n_alloc_frames > 0);
244 fs->n_alloc_frames -= 1;
247 static clib_error_t *
248 show_frame_stats (vlib_main_t * vm,
249 unformat_input_t * input, vlib_cli_command_t * cmd)
251 vlib_node_main_t *nm = &vm->node_main;
252 vlib_frame_size_t *fs;
254 vlib_cli_output (vm, "%=6s%=12s%=12s", "Size", "# Alloc", "# Free");
255 vec_foreach (fs, nm->frame_sizes)
257 u32 n_alloc = fs->n_alloc_frames;
258 u32 n_free = vec_len (fs->free_frame_indices);
260 if (n_alloc + n_free > 0)
261 vlib_cli_output (vm, "%=6d%=12d%=12d",
262 fs - nm->frame_sizes, n_alloc, n_free);
269 VLIB_CLI_COMMAND (show_frame_stats_cli, static) = {
270 .path = "show vlib frame-allocation",
271 .short_help = "Show node dispatch frame statistics",
272 .function = show_frame_stats,
276 /* Change ownership of enqueue rights to given next node. */
278 vlib_next_frame_change_ownership (vlib_main_t * vm,
279 vlib_node_runtime_t * node_runtime,
282 vlib_node_main_t *nm = &vm->node_main;
283 vlib_next_frame_t *next_frame;
284 vlib_node_t *node, *next_node;
286 node = vec_elt (nm->nodes, node_runtime->node_index);
288 /* Only internal & input nodes are allowed to call other nodes. */
289 ASSERT (node->type == VLIB_NODE_TYPE_INTERNAL
290 || node->type == VLIB_NODE_TYPE_INPUT
291 || node->type == VLIB_NODE_TYPE_PROCESS);
293 ASSERT (vec_len (node->next_nodes) == node_runtime->n_next_nodes);
296 vlib_node_runtime_get_next_frame (vm, node_runtime, next_index);
297 next_node = vec_elt (nm->nodes, node->next_nodes[next_index]);
299 if (next_node->owner_node_index != VLIB_INVALID_NODE_INDEX)
301 /* Get frame from previous owner. */
302 vlib_next_frame_t *owner_next_frame;
303 vlib_next_frame_t tmp;
306 vlib_node_get_next_frame (vm,
307 next_node->owner_node_index,
308 next_node->owner_next_index);
310 /* Swap target next frame with owner's. */
311 tmp = owner_next_frame[0];
312 owner_next_frame[0] = next_frame[0];
316 * If next_frame is already pending, we have to track down
317 * all pending frames and fix their next_frame_index fields.
319 if (next_frame->flags & VLIB_FRAME_PENDING)
321 vlib_pending_frame_t *p;
322 if (next_frame->frame_index != ~0)
324 vec_foreach (p, nm->pending_frames)
326 if (p->frame_index == next_frame->frame_index)
328 p->next_frame_index =
329 next_frame - vm->node_main.next_frames;
337 /* No previous owner. Take ownership. */
338 next_frame->flags |= VLIB_FRAME_OWNER;
341 /* Record new owner. */
342 next_node->owner_node_index = node->index;
343 next_node->owner_next_index = next_index;
345 /* Now we should be owner. */
346 ASSERT (next_frame->flags & VLIB_FRAME_OWNER);
349 /* Make sure that magic number is still there.
350 Otherwise, it is likely that caller has overrun frame arguments. */
352 validate_frame_magic (vlib_main_t * vm,
353 vlib_frame_t * f, vlib_node_t * n, uword next_index)
355 vlib_node_t *next_node = vlib_get_node (vm, n->next_nodes[next_index]);
356 u32 *magic = vlib_frame_find_magic (f, next_node);
357 ASSERT (VLIB_FRAME_MAGIC == magic[0]);
361 vlib_get_next_frame_internal (vlib_main_t * vm,
362 vlib_node_runtime_t * node,
363 u32 next_index, u32 allocate_new_next_frame)
366 vlib_next_frame_t *nf;
369 nf = vlib_node_runtime_get_next_frame (vm, node, next_index);
371 /* Make sure this next frame owns right to enqueue to destination frame. */
372 if (PREDICT_FALSE (!(nf->flags & VLIB_FRAME_OWNER)))
373 vlib_next_frame_change_ownership (vm, node, next_index);
375 /* ??? Don't need valid flag: can use frame_index == ~0 */
376 if (PREDICT_FALSE (!(nf->flags & VLIB_FRAME_IS_ALLOCATED)))
378 nf->frame_index = vlib_frame_alloc (vm, node, next_index);
379 nf->flags |= VLIB_FRAME_IS_ALLOCATED;
382 f = vlib_get_frame (vm, nf->frame_index);
384 /* Has frame been removed from pending vector (e.g. finished dispatching)?
385 If so we can reuse frame. */
386 if ((nf->flags & VLIB_FRAME_PENDING) && !(f->flags & VLIB_FRAME_PENDING))
388 nf->flags &= ~VLIB_FRAME_PENDING;
392 /* Allocate new frame if current one is already full. */
393 n_used = f->n_vectors;
394 if (n_used >= VLIB_FRAME_SIZE || (allocate_new_next_frame && n_used > 0))
396 /* Old frame may need to be freed after dispatch, since we'll have
397 two redundant frames from node -> next node. */
398 if (!(nf->flags & VLIB_FRAME_NO_FREE_AFTER_DISPATCH))
400 vlib_frame_t *f_old = vlib_get_frame (vm, nf->frame_index);
401 f_old->flags |= VLIB_FRAME_FREE_AFTER_DISPATCH;
404 /* Allocate new frame to replace full one. */
405 nf->frame_index = vlib_frame_alloc (vm, node, next_index);
406 f = vlib_get_frame (vm, nf->frame_index);
407 n_used = f->n_vectors;
410 /* Should have free vectors in frame now. */
411 ASSERT (n_used < VLIB_FRAME_SIZE);
415 validate_frame_magic (vm, f,
416 vlib_get_node (vm, node->node_index), next_index);
423 vlib_put_next_frame_validate (vlib_main_t * vm,
424 vlib_node_runtime_t * rt,
425 u32 next_index, u32 n_vectors_left)
427 vlib_node_main_t *nm = &vm->node_main;
428 vlib_next_frame_t *nf;
430 vlib_node_runtime_t *next_rt;
431 vlib_node_t *next_node;
432 u32 n_before, n_after;
434 nf = vlib_node_runtime_get_next_frame (vm, rt, next_index);
435 f = vlib_get_frame (vm, nf->frame_index);
437 ASSERT (n_vectors_left <= VLIB_FRAME_SIZE);
438 n_after = VLIB_FRAME_SIZE - n_vectors_left;
439 n_before = f->n_vectors;
441 ASSERT (n_after >= n_before);
443 next_rt = vec_elt_at_index (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
444 nf->node_runtime_index);
445 next_node = vlib_get_node (vm, next_rt->node_index);
446 if (n_after > 0 && next_node->validate_frame)
448 u8 *msg = next_node->validate_frame (vm, rt, f);
451 clib_warning ("%v", msg);
459 vlib_put_next_frame (vlib_main_t * vm,
460 vlib_node_runtime_t * r,
461 u32 next_index, u32 n_vectors_left)
463 vlib_node_main_t *nm = &vm->node_main;
464 vlib_next_frame_t *nf;
466 u32 n_vectors_in_frame;
468 if (DPDK == 0 && CLIB_DEBUG > 0)
469 vlib_put_next_frame_validate (vm, r, next_index, n_vectors_left);
471 nf = vlib_node_runtime_get_next_frame (vm, r, next_index);
472 f = vlib_get_frame (vm, nf->frame_index);
474 /* Make sure that magic number is still there. Otherwise, caller
475 has overrun frame meta data. */
478 vlib_node_t *node = vlib_get_node (vm, r->node_index);
479 validate_frame_magic (vm, f, node, next_index);
482 /* Convert # of vectors left -> number of vectors there. */
483 ASSERT (n_vectors_left <= VLIB_FRAME_SIZE);
484 n_vectors_in_frame = VLIB_FRAME_SIZE - n_vectors_left;
486 f->n_vectors = n_vectors_in_frame;
488 /* If vectors were added to frame, add to pending vector. */
489 if (PREDICT_TRUE (n_vectors_in_frame > 0))
491 vlib_pending_frame_t *p;
494 r->cached_next_index = next_index;
496 if (!(f->flags & VLIB_FRAME_PENDING))
498 __attribute__ ((unused)) vlib_node_t *node;
499 vlib_node_t *next_node;
500 vlib_node_runtime_t *next_runtime;
502 node = vlib_get_node (vm, r->node_index);
503 next_node = vlib_get_next_node (vm, r->node_index, next_index);
504 next_runtime = vlib_node_get_runtime (vm, next_node->index);
506 vec_add2 (nm->pending_frames, p, 1);
508 p->frame_index = nf->frame_index;
509 p->node_runtime_index = nf->node_runtime_index;
510 p->next_frame_index = nf - nm->next_frames;
511 nf->flags |= VLIB_FRAME_PENDING;
512 f->flags |= VLIB_FRAME_PENDING;
515 * If we're going to dispatch this frame on another thread,
516 * force allocation of a new frame. Otherwise, we create
517 * a dangling frame reference. Each thread has its own copy of
518 * the next_frames vector.
520 if (0 && r->cpu_index != next_runtime->cpu_index)
522 nf->frame_index = ~0;
523 nf->flags &= ~(VLIB_FRAME_PENDING | VLIB_FRAME_IS_ALLOCATED);
527 /* Copy trace flag from next_frame and from runtime. */
529 (nf->flags & VLIB_NODE_FLAG_TRACE) | (r->
530 flags & VLIB_NODE_FLAG_TRACE);
532 v0 = nf->vectors_since_last_overflow;
533 v1 = v0 + n_vectors_in_frame;
534 nf->vectors_since_last_overflow = v1;
535 if (PREDICT_FALSE (v1 < v0))
537 vlib_node_t *node = vlib_get_node (vm, r->node_index);
538 vec_elt (node->n_vectors_by_next_node, next_index) += v0;
543 /* Sync up runtime (32 bit counters) and main node stats (64 bit counters). */
545 vlib_node_runtime_sync_stats (vlib_main_t * vm,
546 vlib_node_runtime_t * r,
547 uword n_calls, uword n_vectors, uword n_clocks)
549 vlib_node_t *n = vlib_get_node (vm, r->node_index);
551 n->stats_total.calls += n_calls + r->calls_since_last_overflow;
552 n->stats_total.vectors += n_vectors + r->vectors_since_last_overflow;
553 n->stats_total.clocks += n_clocks + r->clocks_since_last_overflow;
554 n->stats_total.max_clock = r->max_clock;
555 n->stats_total.max_clock_n = r->max_clock_n;
557 r->calls_since_last_overflow = 0;
558 r->vectors_since_last_overflow = 0;
559 r->clocks_since_last_overflow = 0;
562 always_inline void __attribute__ ((unused))
563 vlib_process_sync_stats (vlib_main_t * vm,
565 uword n_calls, uword n_vectors, uword n_clocks)
567 vlib_node_runtime_t *rt = &p->node_runtime;
568 vlib_node_t *n = vlib_get_node (vm, rt->node_index);
569 vlib_node_runtime_sync_stats (vm, rt, n_calls, n_vectors, n_clocks);
570 n->stats_total.suspends += p->n_suspends;
575 vlib_node_sync_stats (vlib_main_t * vm, vlib_node_t * n)
577 vlib_node_runtime_t *rt;
579 if (n->type == VLIB_NODE_TYPE_PROCESS)
581 /* Nothing to do for PROCESS nodes except in main thread */
582 if (vm != &vlib_global_main)
585 vlib_process_t *p = vlib_get_process_from_node (vm, n);
586 n->stats_total.suspends += p->n_suspends;
588 rt = &p->node_runtime;
592 vec_elt_at_index (vm->node_main.nodes_by_type[n->type],
595 vlib_node_runtime_sync_stats (vm, rt, 0, 0, 0);
597 /* Sync up runtime next frame vector counters with main node structure. */
599 vlib_next_frame_t *nf;
601 for (i = 0; i < rt->n_next_nodes; i++)
603 nf = vlib_node_runtime_get_next_frame (vm, rt, i);
604 vec_elt (n->n_vectors_by_next_node, i) +=
605 nf->vectors_since_last_overflow;
606 nf->vectors_since_last_overflow = 0;
612 vlib_node_runtime_update_stats (vlib_main_t * vm,
613 vlib_node_runtime_t * node,
615 uword n_vectors, uword n_clocks)
617 u32 ca0, ca1, v0, v1, cl0, cl1, r;
619 cl0 = cl1 = node->clocks_since_last_overflow;
620 ca0 = ca1 = node->calls_since_last_overflow;
621 v0 = v1 = node->vectors_since_last_overflow;
625 cl1 = cl0 + n_clocks;
627 node->calls_since_last_overflow = ca1;
628 node->clocks_since_last_overflow = cl1;
629 node->vectors_since_last_overflow = v1;
630 node->max_clock_n = node->max_clock > n_clocks ?
631 node->max_clock_n : n_vectors;
632 node->max_clock = node->max_clock > n_clocks ? node->max_clock : n_clocks;
634 r = vlib_node_runtime_update_main_loop_vector_stats (vm, node, n_vectors);
636 if (PREDICT_FALSE (ca1 < ca0 || v1 < v0 || cl1 < cl0))
638 node->calls_since_last_overflow = ca0;
639 node->clocks_since_last_overflow = cl0;
640 node->vectors_since_last_overflow = v0;
641 vlib_node_runtime_sync_stats (vm, node, n_calls, n_vectors, n_clocks);
648 vlib_process_update_stats (vlib_main_t * vm,
650 uword n_calls, uword n_vectors, uword n_clocks)
652 vlib_node_runtime_update_stats (vm, &p->node_runtime,
653 n_calls, n_vectors, n_clocks);
656 static clib_error_t *
657 vlib_cli_elog_clear (vlib_main_t * vm,
658 unformat_input_t * input, vlib_cli_command_t * cmd)
660 elog_reset_buffer (&vm->elog_main);
665 VLIB_CLI_COMMAND (elog_clear_cli, static) = {
666 .path = "event-logger clear",
667 .short_help = "Clear the event log",
668 .function = vlib_cli_elog_clear,
673 static clib_error_t *
674 elog_save_buffer (vlib_main_t * vm,
675 unformat_input_t * input, vlib_cli_command_t * cmd)
677 elog_main_t *em = &vm->elog_main;
678 char *file, *chroot_file;
679 clib_error_t *error = 0;
681 if (!unformat (input, "%s", &file))
683 vlib_cli_output (vm, "expected file name, got `%U'",
684 format_unformat_error, input);
688 /* It's fairly hard to get "../oopsie" through unformat; just in case */
689 if (strstr (file, "..") || index (file, '/'))
691 vlib_cli_output (vm, "illegal characters in filename '%s'", file);
695 chroot_file = (char *) format (0, "/tmp/%s%c", file, 0);
699 vlib_cli_output (vm, "Saving %wd of %wd events to %s",
700 elog_n_events_in_buffer (em),
701 elog_buffer_capacity (em), chroot_file);
703 vlib_worker_thread_barrier_sync (vm);
704 error = elog_write_file (em, chroot_file);
705 vlib_worker_thread_barrier_release (vm);
706 vec_free (chroot_file);
711 VLIB_CLI_COMMAND (elog_save_cli, static) = {
712 .path = "event-logger save",
713 .short_help = "event-logger save <filename> (saves log in /tmp/<filename>)",
714 .function = elog_save_buffer,
718 static clib_error_t *
719 elog_stop (vlib_main_t * vm,
720 unformat_input_t * input, vlib_cli_command_t * cmd)
722 elog_main_t *em = &vm->elog_main;
724 em->n_total_events_disable_limit = em->n_total_events;
726 vlib_cli_output (vm, "Stopped the event logger...");
731 VLIB_CLI_COMMAND (elog_stop_cli, static) = {
732 .path = "event-logger stop",
733 .short_help = "Stop the event-logger",
734 .function = elog_stop,
738 static clib_error_t *
739 elog_restart (vlib_main_t * vm,
740 unformat_input_t * input, vlib_cli_command_t * cmd)
742 elog_main_t *em = &vm->elog_main;
744 em->n_total_events_disable_limit = ~0;
746 vlib_cli_output (vm, "Restarted the event logger...");
751 VLIB_CLI_COMMAND (elog_restart_cli, static) = {
752 .path = "event-logger restart",
753 .short_help = "Restart the event-logger",
754 .function = elog_restart,
758 static clib_error_t *
759 elog_resize (vlib_main_t * vm,
760 unformat_input_t * input, vlib_cli_command_t * cmd)
762 elog_main_t *em = &vm->elog_main;
765 /* Stop the parade */
766 elog_reset_buffer (&vm->elog_main);
768 if (unformat (input, "%d", &tmp))
770 elog_alloc (em, tmp);
771 em->n_total_events_disable_limit = ~0;
774 return clib_error_return (0, "Must specify how many events in the ring");
776 vlib_cli_output (vm, "Resized ring and restarted the event logger...");
781 VLIB_CLI_COMMAND (elog_resize_cli, static) = {
782 .path = "event-logger resize",
783 .short_help = "event-logger resize <nnn>",
784 .function = elog_resize,
788 #endif /* CLIB_UNIX */
791 elog_show_buffer_internal (vlib_main_t * vm, u32 n_events_to_show)
793 elog_main_t *em = &vm->elog_main;
794 elog_event_t *e, *es;
797 /* Show events in VLIB time since log clock starts after VLIB clock. */
798 dt = (em->init_time.cpu - vm->clib_time.init_cpu_time)
799 * vm->clib_time.seconds_per_clock;
801 es = elog_peek_events (em);
802 vlib_cli_output (vm, "%d of %d events in buffer, logger %s", vec_len (es),
804 em->n_total_events < em->n_total_events_disable_limit ?
805 "running" : "stopped");
808 vlib_cli_output (vm, "%18.9f: %U",
809 e->time + dt, format_elog_event, em, e);
811 if (n_events_to_show == 0)
818 static clib_error_t *
819 elog_show_buffer (vlib_main_t * vm,
820 unformat_input_t * input, vlib_cli_command_t * cmd)
822 u32 n_events_to_show;
823 clib_error_t *error = 0;
825 n_events_to_show = 250;
826 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
828 if (unformat (input, "%d", &n_events_to_show))
830 else if (unformat (input, "all"))
831 n_events_to_show = ~0;
833 return unformat_parse_error (input);
835 elog_show_buffer_internal (vm, n_events_to_show);
840 VLIB_CLI_COMMAND (elog_show_cli, static) = {
841 .path = "show event-logger",
842 .short_help = "Show event logger info",
843 .function = elog_show_buffer,
848 vlib_gdb_show_event_log (void)
850 elog_show_buffer_internal (vlib_get_main (), (u32) ~ 0);
854 vlib_elog_main_loop_event (vlib_main_t * vm,
856 u64 time, u32 n_vectors, u32 is_return)
858 vlib_main_t *evm = &vlib_global_main;
859 elog_main_t *em = &evm->elog_main;
861 if (VLIB_ELOG_MAIN_LOOP && n_vectors)
864 vec_elt_at_index (is_return
865 ? evm->node_return_elog_event_types
866 : evm->node_call_elog_event_types,
869 (vm->cpu_index ? &vlib_worker_threads[vm->cpu_index].
870 elog_track : &em->default_track),
871 /* data to log */ n_vectors);
875 vlib_dump_context_trace (vlib_main_t * vm, u32 bi)
877 vlib_node_main_t *vnm = &vm->node_main;
881 if (VLIB_BUFFER_TRACE_TRAJECTORY)
883 b = vlib_get_buffer (vm, bi);
886 fformat (stderr, "Context trace for bi %d b 0x%llx, visited %d\n",
889 if (n == 0 || n > 20)
891 fformat (stderr, "n is unreasonable\n");
896 for (i = 0; i < n; i++)
900 node_index = b->pre_data[i + 1];
902 if (node_index > vec_len (vnm->nodes))
904 fformat (stderr, "Skip bogus node index %d\n", node_index);
908 fformat (stderr, "%v (%d)\n", vnm->nodes[node_index]->name,
915 "in vlib/buffers.h, #define VLIB_BUFFER_TRACE_TRAJECTORY 1\n");
920 /* static_always_inline */ u64
921 dispatch_node (vlib_main_t * vm,
922 vlib_node_runtime_t * node,
923 vlib_node_type_t type,
924 vlib_node_state_t dispatch_state,
925 vlib_frame_t * frame, u64 last_time_stamp)
929 vlib_node_main_t *nm = &vm->node_main;
930 vlib_next_frame_t *nf;
934 vlib_node_t *n = vlib_get_node (vm, node->node_index);
935 ASSERT (n->type == type);
938 /* Only non-internal nodes may be disabled. */
939 if (type != VLIB_NODE_TYPE_INTERNAL && node->state != dispatch_state)
941 ASSERT (type != VLIB_NODE_TYPE_INTERNAL);
942 return last_time_stamp;
945 if ((type == VLIB_NODE_TYPE_PRE_INPUT || type == VLIB_NODE_TYPE_INPUT)
946 && dispatch_state != VLIB_NODE_STATE_INTERRUPT)
948 u32 c = node->input_main_loops_per_call;
949 /* Only call node when count reaches zero. */
952 node->input_main_loops_per_call = c - 1;
953 return last_time_stamp;
957 /* Speculatively prefetch next frames. */
958 if (node->n_next_nodes > 0)
960 nf = vec_elt_at_index (nm->next_frames, node->next_frame_index);
961 CLIB_PREFETCH (nf, 4 * sizeof (nf[0]), WRITE);
964 vm->cpu_time_last_node_dispatch = last_time_stamp;
966 if (1 /* || vm->cpu_index == node->cpu_index */ )
968 vlib_main_t *stat_vm;
970 stat_vm = /* vlib_mains ? vlib_mains[0] : */ vm;
972 vlib_elog_main_loop_event (vm, node->node_index,
974 frame ? frame->n_vectors : 0,
978 * Turn this on if you run into
979 * "bad monkey" contexts, and you want to know exactly
980 * which nodes they've visited... See ixge.c...
982 if (VLIB_BUFFER_TRACE_TRAJECTORY && frame)
987 from = vlib_frame_vector_args (frame);
988 for (i = 0; i < frame->n_vectors; i++)
990 vlib_buffer_t *b = vlib_get_buffer (vm, from[i]);
991 ASSERT (b->pre_data[0] < 32);
992 log_index = b->pre_data[0]++ + 1;
993 b->pre_data[log_index] = node->node_index;
995 n = node->function (vm, node, frame);
998 n = node->function (vm, node, frame);
1000 t = clib_cpu_time_now ();
1002 vlib_elog_main_loop_event (vm, node->node_index, t, n, /* is_after */
1005 vm->main_loop_vectors_processed += n;
1006 vm->main_loop_nodes_processed += n > 0;
1008 v = vlib_node_runtime_update_stats (stat_vm, node,
1011 /* n_clocks */ t - last_time_stamp);
1013 /* When in interrupt mode and vector rate crosses threshold switch to
1015 if ((DPDK == 0 && dispatch_state == VLIB_NODE_STATE_INTERRUPT)
1016 || (DPDK == 0 && dispatch_state == VLIB_NODE_STATE_POLLING
1018 & VLIB_NODE_FLAG_SWITCH_FROM_INTERRUPT_TO_POLLING_MODE)))
1020 ELOG_TYPE_DECLARE (e) =
1022 .function = (char *) __FUNCTION__,.format =
1023 "%s vector length %d, switching to %s",.format_args =
1024 "T4i4t4",.n_enum_strings = 2,.enum_strings =
1026 "interrupt", "polling",},};
1029 u32 node_name, vector_length, is_polling;
1032 if (dispatch_state == VLIB_NODE_STATE_INTERRUPT
1033 && v >= nm->polling_threshold_vector_length)
1035 vlib_node_t *n = vlib_get_node (vm, node->node_index);
1036 n->state = VLIB_NODE_STATE_POLLING;
1037 node->state = VLIB_NODE_STATE_POLLING;
1040 VLIB_NODE_FLAG_SWITCH_FROM_INTERRUPT_TO_POLLING_MODE));
1042 ~VLIB_NODE_FLAG_SWITCH_FROM_POLLING_TO_INTERRUPT_MODE;
1044 VLIB_NODE_FLAG_SWITCH_FROM_INTERRUPT_TO_POLLING_MODE;
1045 nm->input_node_counts_by_state[VLIB_NODE_STATE_INTERRUPT] -= 1;
1046 nm->input_node_counts_by_state[VLIB_NODE_STATE_POLLING] += 1;
1048 ed = ELOG_DATA (&vm->elog_main, e);
1049 ed->node_name = n->name_elog_string;
1050 ed->vector_length = v;
1053 else if (dispatch_state == VLIB_NODE_STATE_POLLING
1054 && v <= nm->interrupt_threshold_vector_length)
1056 vlib_node_t *n = vlib_get_node (vm, node->node_index);
1058 VLIB_NODE_FLAG_SWITCH_FROM_POLLING_TO_INTERRUPT_MODE)
1060 /* Switch to interrupt mode after dispatch in polling one more time.
1061 This allows driver to re-enable interrupts. */
1062 n->state = VLIB_NODE_STATE_INTERRUPT;
1063 node->state = VLIB_NODE_STATE_INTERRUPT;
1065 ~VLIB_NODE_FLAG_SWITCH_FROM_INTERRUPT_TO_POLLING_MODE;
1066 nm->input_node_counts_by_state[VLIB_NODE_STATE_POLLING] -=
1068 nm->input_node_counts_by_state[VLIB_NODE_STATE_INTERRUPT] +=
1075 VLIB_NODE_FLAG_SWITCH_FROM_POLLING_TO_INTERRUPT_MODE;
1076 ed = ELOG_DATA (&vm->elog_main, e);
1077 ed->node_name = n->name_elog_string;
1078 ed->vector_length = v;
1089 dispatch_pending_node (vlib_main_t * vm,
1090 vlib_pending_frame_t * p, u64 last_time_stamp)
1092 vlib_node_main_t *nm = &vm->node_main;
1094 vlib_next_frame_t *nf, nf_dummy;
1095 vlib_node_runtime_t *n;
1096 u32 restore_frame_index;
1098 n = vec_elt_at_index (nm->nodes_by_type[VLIB_NODE_TYPE_INTERNAL],
1099 p->node_runtime_index);
1101 f = vlib_get_frame (vm, p->frame_index);
1102 if (p->next_frame_index == VLIB_PENDING_FRAME_NO_NEXT_FRAME)
1104 /* No next frame: so use dummy on stack. */
1106 nf->flags = f->flags & VLIB_NODE_FLAG_TRACE;
1107 nf->frame_index = ~p->frame_index;
1110 nf = vec_elt_at_index (nm->next_frames, p->next_frame_index);
1112 ASSERT (f->flags & VLIB_FRAME_IS_ALLOCATED);
1114 /* Force allocation of new frame while current frame is being
1116 restore_frame_index = ~0;
1117 if (nf->frame_index == p->frame_index)
1119 nf->frame_index = ~0;
1120 nf->flags &= ~VLIB_FRAME_IS_ALLOCATED;
1121 if (!(n->flags & VLIB_NODE_FLAG_FRAME_NO_FREE_AFTER_DISPATCH))
1122 restore_frame_index = p->frame_index;
1125 /* Frame must be pending. */
1126 ASSERT (f->flags & VLIB_FRAME_PENDING);
1127 ASSERT (f->n_vectors > 0);
1129 /* Copy trace flag from next frame to node.
1130 Trace flag indicates that at least one vector in the dispatched
1132 n->flags &= ~VLIB_NODE_FLAG_TRACE;
1133 n->flags |= (nf->flags & VLIB_FRAME_TRACE) ? VLIB_NODE_FLAG_TRACE : 0;
1134 nf->flags &= ~VLIB_FRAME_TRACE;
1136 last_time_stamp = dispatch_node (vm, n,
1137 VLIB_NODE_TYPE_INTERNAL,
1138 VLIB_NODE_STATE_POLLING,
1139 f, last_time_stamp);
1141 f->flags &= ~VLIB_FRAME_PENDING;
1143 /* Frame is ready to be used again, so restore it. */
1144 if (restore_frame_index != ~0)
1146 /* we musn't restore a frame that is flagged to be freed. This shouldn't
1147 happen since frames to be freed post dispatch are those used
1148 when the to-node frame becomes full i.e. they form a sort of queue of
1149 frames to a single node. If we get here then the to-node frame and the
1150 pending frame *were* the same, and so we removed the to-node frame.
1151 Therefore this frame is no longer part of the queue for that node
1152 and hence it cannot be it's overspill.
1154 ASSERT (!(f->flags & VLIB_FRAME_FREE_AFTER_DISPATCH));
1156 /* p->next_frame_index can change during node dispatch if node
1157 function decides to change graph hook up. */
1158 nf = vec_elt_at_index (nm->next_frames, p->next_frame_index);
1159 nf->flags |= VLIB_FRAME_IS_ALLOCATED;
1161 if (~0 == nf->frame_index)
1163 /* no new frame has been assigned to this node, use the saved one */
1164 nf->frame_index = restore_frame_index;
1169 /* The node has gained a frame, implying packets from the current frame
1170 were re-queued to this same node. we don't need the saved one
1172 vlib_frame_free (vm, n, f);
1177 if (f->flags & VLIB_FRAME_FREE_AFTER_DISPATCH)
1179 ASSERT (!(n->flags & VLIB_NODE_FLAG_FRAME_NO_FREE_AFTER_DISPATCH));
1180 vlib_frame_free (vm, n, f);
1184 return last_time_stamp;
1188 vlib_process_stack_is_valid (vlib_process_t * p)
1190 return p->stack[0] == VLIB_PROCESS_STACK_MAGIC;
1196 vlib_process_t *process;
1197 vlib_frame_t *frame;
1198 } vlib_process_bootstrap_args_t;
1200 /* Called in process stack. */
1202 vlib_process_bootstrap (uword _a)
1204 vlib_process_bootstrap_args_t *a;
1206 vlib_node_runtime_t *node;
1211 a = uword_to_pointer (_a, vlib_process_bootstrap_args_t *);
1216 node = &p->node_runtime;
1218 n = node->function (vm, node, f);
1220 ASSERT (vlib_process_stack_is_valid (p));
1222 clib_longjmp (&p->return_longjmp, n);
1227 /* Called in main stack. */
1228 static_always_inline uword
1229 vlib_process_startup (vlib_main_t * vm, vlib_process_t * p, vlib_frame_t * f)
1231 vlib_process_bootstrap_args_t a;
1238 r = clib_setjmp (&p->return_longjmp, VLIB_PROCESS_RETURN_LONGJMP_RETURN);
1239 if (r == VLIB_PROCESS_RETURN_LONGJMP_RETURN)
1240 r = clib_calljmp (vlib_process_bootstrap, pointer_to_uword (&a),
1241 (void *) p->stack + (1 << p->log2_n_stack_bytes));
1246 static_always_inline uword
1247 vlib_process_resume (vlib_process_t * p)
1250 p->flags &= ~(VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_CLOCK
1251 | VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_EVENT
1252 | VLIB_PROCESS_RESUME_PENDING);
1253 r = clib_setjmp (&p->return_longjmp, VLIB_PROCESS_RETURN_LONGJMP_RETURN);
1254 if (r == VLIB_PROCESS_RETURN_LONGJMP_RETURN)
1255 clib_longjmp (&p->resume_longjmp, VLIB_PROCESS_RESUME_LONGJMP_RESUME);
1260 dispatch_process (vlib_main_t * vm,
1261 vlib_process_t * p, vlib_frame_t * f, u64 last_time_stamp)
1263 vlib_node_main_t *nm = &vm->node_main;
1264 vlib_node_runtime_t *node_runtime = &p->node_runtime;
1265 vlib_node_t *node = vlib_get_node (vm, node_runtime->node_index);
1267 uword n_vectors, is_suspend;
1269 if (node->state != VLIB_NODE_STATE_POLLING
1270 || (p->flags & (VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_CLOCK
1271 | VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_EVENT)))
1272 return last_time_stamp;
1274 p->flags |= VLIB_PROCESS_IS_RUNNING;
1276 t = last_time_stamp;
1277 vlib_elog_main_loop_event (vm, node_runtime->node_index, t,
1278 f ? f->n_vectors : 0, /* is_after */ 0);
1280 /* Save away current process for suspend. */
1281 nm->current_process_index = node->runtime_index;
1283 n_vectors = vlib_process_startup (vm, p, f);
1285 nm->current_process_index = ~0;
1287 ASSERT (n_vectors != VLIB_PROCESS_RETURN_LONGJMP_RETURN);
1288 is_suspend = n_vectors == VLIB_PROCESS_RETURN_LONGJMP_SUSPEND;
1291 vlib_pending_frame_t *pf;
1294 pool_get (nm->suspended_process_frames, pf);
1295 pf->node_runtime_index = node->runtime_index;
1296 pf->frame_index = f ? vlib_frame_index (vm, f) : ~0;
1297 pf->next_frame_index = ~0;
1300 p->suspended_process_frame_index = pf - nm->suspended_process_frames;
1302 if (p->flags & VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_CLOCK)
1303 timing_wheel_insert (&nm->timing_wheel, p->resume_cpu_time,
1304 vlib_timing_wheel_data_set_suspended_process
1305 (node->runtime_index));
1308 p->flags &= ~VLIB_PROCESS_IS_RUNNING;
1310 t = clib_cpu_time_now ();
1312 vlib_elog_main_loop_event (vm, node_runtime->node_index, t, is_suspend,
1315 vlib_process_update_stats (vm, p,
1316 /* n_calls */ !is_suspend,
1317 /* n_vectors */ n_vectors,
1318 /* n_clocks */ t - last_time_stamp);
1324 vlib_start_process (vlib_main_t * vm, uword process_index)
1326 vlib_node_main_t *nm = &vm->node_main;
1327 vlib_process_t *p = vec_elt (nm->processes, process_index);
1328 dispatch_process (vm, p, /* frame */ 0, /* cpu_time_now */ 0);
1332 dispatch_suspended_process (vlib_main_t * vm,
1333 uword process_index, u64 last_time_stamp)
1335 vlib_node_main_t *nm = &vm->node_main;
1336 vlib_node_runtime_t *node_runtime;
1340 vlib_pending_frame_t *pf;
1341 u64 t, n_vectors, is_suspend;
1343 t = last_time_stamp;
1345 p = vec_elt (nm->processes, process_index);
1346 if (PREDICT_FALSE (!(p->flags & VLIB_PROCESS_IS_RUNNING)))
1347 return last_time_stamp;
1349 ASSERT (p->flags & (VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_CLOCK
1350 | VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_EVENT));
1353 pool_elt_at_index (nm->suspended_process_frames,
1354 p->suspended_process_frame_index);
1356 node_runtime = &p->node_runtime;
1357 node = vlib_get_node (vm, node_runtime->node_index);
1358 f = pf->frame_index != ~0 ? vlib_get_frame (vm, pf->frame_index) : 0;
1360 vlib_elog_main_loop_event (vm, node_runtime->node_index, t,
1361 f ? f->n_vectors : 0, /* is_after */ 0);
1363 /* Save away current process for suspend. */
1364 nm->current_process_index = node->runtime_index;
1366 n_vectors = vlib_process_resume (p);
1367 t = clib_cpu_time_now ();
1369 nm->current_process_index = ~0;
1371 is_suspend = n_vectors == VLIB_PROCESS_RETURN_LONGJMP_SUSPEND;
1374 /* Suspend it again. */
1377 if (p->flags & VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_CLOCK)
1378 timing_wheel_insert (&nm->timing_wheel, p->resume_cpu_time,
1379 vlib_timing_wheel_data_set_suspended_process
1380 (node->runtime_index));
1384 p->flags &= ~VLIB_PROCESS_IS_RUNNING;
1385 p->suspended_process_frame_index = ~0;
1386 pool_put (nm->suspended_process_frames, pf);
1389 t = clib_cpu_time_now ();
1390 vlib_elog_main_loop_event (vm, node_runtime->node_index, t, !is_suspend,
1393 vlib_process_update_stats (vm, p,
1394 /* n_calls */ !is_suspend,
1395 /* n_vectors */ n_vectors,
1396 /* n_clocks */ t - last_time_stamp);
1402 vlib_main_loop (vlib_main_t * vm)
1404 vlib_node_main_t *nm = &vm->node_main;
1408 /* Initialize pending node vector. */
1409 vec_resize (nm->pending_frames, 32);
1410 _vec_len (nm->pending_frames) = 0;
1412 /* Mark time of main loop start. */
1413 cpu_time_now = vm->clib_time.last_cpu_time;
1414 vm->cpu_time_main_loop_start = cpu_time_now;
1416 /* Arrange for first level of timing wheel to cover times we care
1418 nm->timing_wheel.min_sched_time = 10e-6;
1419 nm->timing_wheel.max_sched_time = 10e-3;
1420 timing_wheel_init (&nm->timing_wheel,
1421 cpu_time_now, vm->clib_time.clocks_per_second);
1423 /* Pre-allocate expired nodes. */
1424 vec_alloc (nm->data_from_advancing_timing_wheel, 32);
1425 vec_alloc (nm->pending_interrupt_node_runtime_indices, 32);
1427 if (!nm->polling_threshold_vector_length)
1428 nm->polling_threshold_vector_length = 10;
1429 if (!nm->interrupt_threshold_vector_length)
1430 nm->interrupt_threshold_vector_length = 5;
1432 nm->current_process_index = ~0;
1434 /* Start all processes. */
1437 for (i = 0; i < vec_len (nm->processes); i++)
1439 dispatch_process (vm, nm->processes[i], /* frame */ 0, cpu_time_now);
1444 vlib_node_runtime_t *n;
1446 /* Process pre-input nodes. */
1447 vec_foreach (n, nm->nodes_by_type[VLIB_NODE_TYPE_PRE_INPUT])
1448 cpu_time_now = dispatch_node (vm, n,
1449 VLIB_NODE_TYPE_PRE_INPUT,
1450 VLIB_NODE_STATE_POLLING,
1454 /* Next process input nodes. */
1455 vec_foreach (n, nm->nodes_by_type[VLIB_NODE_TYPE_INPUT])
1456 cpu_time_now = dispatch_node (vm, n,
1457 VLIB_NODE_TYPE_INPUT,
1458 VLIB_NODE_STATE_POLLING,
1462 if (PREDICT_TRUE (vm->queue_signal_pending == 0))
1463 vm->queue_signal_callback (vm);
1465 /* Next handle interrupts. */
1467 uword l = _vec_len (nm->pending_interrupt_node_runtime_indices);
1471 _vec_len (nm->pending_interrupt_node_runtime_indices) = 0;
1472 for (i = 0; i < l; i++)
1474 n = vec_elt_at_index (nm->nodes_by_type[VLIB_NODE_TYPE_INPUT],
1476 pending_interrupt_node_runtime_indices
1479 dispatch_node (vm, n, VLIB_NODE_TYPE_INPUT,
1480 VLIB_NODE_STATE_INTERRUPT,
1487 /* Check if process nodes have expired from timing wheel. */
1488 nm->data_from_advancing_timing_wheel
1489 = timing_wheel_advance (&nm->timing_wheel, cpu_time_now,
1490 nm->data_from_advancing_timing_wheel,
1491 &nm->cpu_time_next_process_ready);
1493 ASSERT (nm->data_from_advancing_timing_wheel != 0);
1494 if (PREDICT_FALSE (_vec_len (nm->data_from_advancing_timing_wheel) > 0))
1498 processes_timing_wheel_data:
1499 for (i = 0; i < _vec_len (nm->data_from_advancing_timing_wheel);
1502 u32 d = nm->data_from_advancing_timing_wheel[i];
1503 u32 di = vlib_timing_wheel_data_get_index (d);
1505 if (vlib_timing_wheel_data_is_timed_event (d))
1507 vlib_signal_timed_event_data_t *te =
1508 pool_elt_at_index (nm->signal_timed_event_data_pool, di);
1509 vlib_node_t *n = vlib_get_node (vm, te->process_node_index);
1511 vec_elt (nm->processes, n->runtime_index);
1514 vlib_process_signal_event_helper (nm, n, p,
1515 te->event_type_index,
1517 te->n_data_elt_bytes);
1518 if (te->n_data_bytes < sizeof (te->inline_event_data))
1519 clib_memcpy (data, te->inline_event_data,
1523 clib_memcpy (data, te->event_data_as_vector,
1525 vec_free (te->event_data_as_vector);
1527 pool_put (nm->signal_timed_event_data_pool, te);
1531 cpu_time_now = clib_cpu_time_now ();
1533 dispatch_suspended_process (vm, di, cpu_time_now);
1538 _vec_len (nm->data_from_advancing_timing_wheel) = 0;
1541 /* Input nodes may have added work to the pending vector.
1542 Process pending vector until there is nothing left.
1543 All pending vectors will be processed from input -> output. */
1544 for (i = 0; i < _vec_len (nm->pending_frames); i++)
1545 cpu_time_now = dispatch_pending_node (vm, nm->pending_frames + i,
1547 /* Reset pending vector for next iteration. */
1548 _vec_len (nm->pending_frames) = 0;
1550 /* Pending internal nodes may resume processes. */
1551 if (_vec_len (nm->data_from_advancing_timing_wheel) > 0)
1552 goto processes_timing_wheel_data;
1554 vlib_increment_main_loop_counter (vm);
1556 /* Record time stamp in case there are no enabled nodes and above
1557 calls do not update time stamp. */
1558 cpu_time_now = clib_cpu_time_now ();
1562 vlib_main_t vlib_global_main;
1564 static clib_error_t *
1565 vlib_main_configure (vlib_main_t * vm, unformat_input_t * input)
1567 int turn_on_mem_trace = 0;
1569 while (unformat_check_input (input) != UNFORMAT_END_OF_INPUT)
1571 if (unformat (input, "memory-trace"))
1572 turn_on_mem_trace = 1;
1574 else if (unformat (input, "elog-events %d",
1575 &vm->elog_main.event_ring_size))
1578 return unformat_parse_error (input);
1581 unformat_free (input);
1583 /* Enable memory trace as early as possible. */
1584 if (turn_on_mem_trace)
1590 VLIB_EARLY_CONFIG_FUNCTION (vlib_main_configure, "vlib");
1593 dummy_queue_signal_callback (vlib_main_t * vm)
1597 /* Main function. */
1599 vlib_main (vlib_main_t * volatile vm, unformat_input_t * input)
1601 clib_error_t *volatile error;
1603 vm->queue_signal_callback = dummy_queue_signal_callback;
1605 clib_time_init (&vm->clib_time);
1607 /* Turn on event log. */
1608 if (!vm->elog_main.event_ring_size)
1609 vm->elog_main.event_ring_size = 128 << 10;
1610 elog_init (&vm->elog_main, vm->elog_main.event_ring_size);
1611 elog_enable_disable (&vm->elog_main, 1);
1617 vec_validate (vm->buffer_main, 0);
1619 if ((error = vlib_thread_init (vm)))
1621 clib_error_report (error);
1625 /* Register static nodes so that init functions may use them. */
1626 vlib_register_all_static_nodes (vm);
1628 /* Set seed for random number generator.
1629 Allow user to specify seed to make random sequence deterministic. */
1630 if (!unformat (input, "seed %wd", &vm->random_seed))
1631 vm->random_seed = clib_cpu_time_now ();
1632 clib_random_buffer_init (&vm->random_buffer, vm->random_seed);
1634 /* Initialize node graph. */
1635 if ((error = vlib_node_main_init (vm)))
1637 /* Arrange for graph hook up error to not be fatal when debugging. */
1639 clib_error_report (error);
1644 /* See unix/main.c; most likely already set up */
1645 if (vm->init_functions_called == 0)
1646 vm->init_functions_called = hash_create (0, /* value bytes */ 0);
1647 if ((error = vlib_call_all_init_functions (vm)))
1650 /* Create default buffer free list. */
1651 vlib_buffer_get_or_create_free_list (vm,
1652 VLIB_BUFFER_DEFAULT_FREE_LIST_BYTES,
1655 switch (clib_setjmp (&vm->main_loop_exit, VLIB_MAIN_LOOP_EXIT_NONE))
1657 case VLIB_MAIN_LOOP_EXIT_NONE:
1658 vm->main_loop_exit_set = 1;
1661 case VLIB_MAIN_LOOP_EXIT_CLI:
1665 error = vm->main_loop_error;
1669 if ((error = vlib_call_all_config_functions (vm, input, 0 /* is_early */ )))
1672 /* Call all main loop enter functions. */
1674 clib_error_t *sub_error;
1675 sub_error = vlib_call_all_main_loop_enter_functions (vm);
1677 clib_error_report (sub_error);
1680 vlib_main_loop (vm);
1683 /* Call all exit functions. */
1685 clib_error_t *sub_error;
1686 sub_error = vlib_call_all_main_loop_exit_functions (vm);
1688 clib_error_report (sub_error);
1692 clib_error_report (error);
1698 * fd.io coding-style-patch-verification: ON
1701 * eval: (c-set-style "gnu")