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 * node.h: VLIB processing nodes
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.
40 #ifndef included_vlib_node_h
41 #define included_vlib_node_h
43 #include <vppinfra/cpu.h>
44 #include <vppinfra/longjmp.h>
45 #include <vppinfra/lock.h>
46 #include <vlib/trace.h> /* for vlib_trace_filter_t */
48 /* Forward declaration. */
49 struct vlib_node_runtime_t;
52 /* Internal nodes (including output nodes) move data from node to
53 node (or out of the graph for output nodes). */
54 typedef uword (vlib_node_function_t) (struct vlib_main_t * vm,
55 struct vlib_node_runtime_t * node,
56 struct vlib_frame_t * frame);
60 VLIB_NODE_PROTO_HINT_NONE = 0,
61 VLIB_NODE_PROTO_HINT_ETHERNET,
62 VLIB_NODE_PROTO_HINT_IP4,
63 VLIB_NODE_PROTO_HINT_IP6,
64 VLIB_NODE_PROTO_HINT_TCP,
65 VLIB_NODE_PROTO_HINT_UDP,
66 VLIB_NODE_N_PROTO_HINTS,
67 } vlib_node_proto_hint_t;
71 /* An internal node on the call graph (could be output). */
72 VLIB_NODE_TYPE_INTERNAL,
74 /* Nodes which input data into the processing graph.
75 Input nodes are called for each iteration of main loop. */
78 /* Nodes to be called before all input nodes.
79 Used, for example, to clean out driver TX rings before
81 VLIB_NODE_TYPE_PRE_INPUT,
83 /* "Process" nodes which can be suspended and later resumed. */
84 VLIB_NODE_TYPE_PROCESS,
89 typedef struct _vlib_node_fn_registration
91 vlib_node_function_t *function;
92 clib_march_variant_type_t march_variant;
93 struct _vlib_node_fn_registration *next_registration;
94 } vlib_node_fn_registration_t;
96 typedef struct _vlib_node_registration
98 /* Vector processing function for this node. */
99 vlib_node_function_t *function;
101 /* Node function candidate registration with priority */
102 vlib_node_fn_registration_t *node_fn_registrations;
107 /* Name of sibling (if applicable). */
110 /* Node index filled in by registration. */
113 /* Type of this node. */
114 vlib_node_type_t type;
116 /* Error strings indexed by error code for this node. */
117 char **error_strings;
118 vl_counter_t *error_counters;
120 /* Buffer format/unformat for this node. */
121 format_function_t *format_buffer;
122 unformat_function_t *unformat_buffer;
124 /* Trace format/unformat for this node. */
125 format_function_t *format_trace;
126 unformat_function_t *unformat_trace;
128 /* Function to validate incoming frames. */
129 u8 *(*validate_frame) (struct vlib_main_t * vm,
130 struct vlib_node_runtime_t *,
131 struct vlib_frame_t * f);
133 /* Per-node runtime data. */
136 /* Process stack size. */
137 u16 process_log2_n_stack_bytes;
139 /* Number of bytes of per-node run time data. */
140 u8 runtime_data_bytes;
142 /* State for input nodes. */
148 /* protocol at b->data[b->current_data] upon entry to the dispatch fn */
151 /* Size of scalar and vector arguments in bytes. */
152 u16 scalar_size, vector_size;
154 /* Number of error codes used by this node. */
157 /* Number of next node names that follow. */
160 /* Constructor link-list, don't ask... */
161 struct _vlib_node_registration *next_registration;
163 /* Names of next nodes which this node feeds into. */
166 } vlib_node_registration_t;
168 #ifndef CLIB_MARCH_VARIANT
169 #define VLIB_REGISTER_NODE(x,...) \
170 __VA_ARGS__ vlib_node_registration_t x; \
171 static void __vlib_add_node_registration_##x (void) \
172 __attribute__((__constructor__)) ; \
173 static void __vlib_add_node_registration_##x (void) \
175 vlib_main_t * vm = vlib_get_main(); \
176 x.next_registration = vm->node_main.node_registrations; \
177 vm->node_main.node_registrations = &x; \
179 static void __vlib_rm_node_registration_##x (void) \
180 __attribute__((__destructor__)) ; \
181 static void __vlib_rm_node_registration_##x (void) \
183 vlib_main_t * vm = vlib_get_main(); \
184 VLIB_REMOVE_FROM_LINKED_LIST (vm->node_main.node_registrations, \
185 &x, next_registration); \
187 __VA_ARGS__ vlib_node_registration_t x
189 #define VLIB_REGISTER_NODE(x,...) \
190 STATIC_ASSERT (sizeof(# __VA_ARGS__) != 7,"node " #x " must not be declared as static"); \
191 static __clib_unused vlib_node_registration_t __clib_unused_##x
194 #ifndef CLIB_MARCH_VARIANT
195 #define CLIB_MARCH_VARIANT_STR "default"
197 #define _CLIB_MARCH_VARIANT_STR(s) __CLIB_MARCH_VARIANT_STR(s)
198 #define __CLIB_MARCH_VARIANT_STR(s) #s
199 #define CLIB_MARCH_VARIANT_STR _CLIB_MARCH_VARIANT_STR(CLIB_MARCH_VARIANT)
202 #define VLIB_NODE_FN(node) \
203 uword CLIB_MARCH_SFX (node##_fn) (); \
204 static vlib_node_fn_registration_t CLIB_MARCH_SFX ( \
205 node##_fn_registration) = { \
206 .function = &CLIB_MARCH_SFX (node##_fn), \
209 static void __clib_constructor CLIB_MARCH_SFX (node##_multiarch_register) ( \
212 extern vlib_node_registration_t node; \
213 vlib_node_fn_registration_t *r; \
214 r = &CLIB_MARCH_SFX (node##_fn_registration); \
215 r->march_variant = CLIB_MARCH_SFX (CLIB_MARCH_VARIANT_TYPE); \
216 r->next_registration = node.node_fn_registrations; \
217 node.node_fn_registrations = r; \
219 uword CLIB_CPU_OPTIMIZED CLIB_MARCH_SFX (node##_fn)
221 unformat_function_t unformat_vlib_node_variant;
225 /* Total calls, clock ticks and vector elements processed for this node. */
226 u64 calls, vectors, clocks, suspends;
231 #define foreach_vlib_node_state \
232 /* Input node is called each iteration of main loop. \
233 This is the default (zero). */ \
235 /* Input node is called when device signals an interrupt. */ \
237 /* Input node is never called. */ \
242 #define _(f) VLIB_NODE_STATE_##f,
243 foreach_vlib_node_state
248 typedef struct vlib_node_t
250 /* Vector processing function for this node. */
251 vlib_node_function_t *function;
256 /* Node name index in elog string table. */
257 u32 name_elog_string;
259 /* Total statistics for this node. */
260 vlib_node_stats_t stats_total;
262 /* Saved values as of last clear (or zero if never cleared).
263 Current values are always stats_total - stats_last_clear. */
264 vlib_node_stats_t stats_last_clear;
266 /* Type of this node. */
267 vlib_node_type_t type;
272 /* Index of corresponding node runtime. */
275 /* Runtime data for this node. */
281 /* Processing function keeps frame. Tells node dispatching code not
282 to free frame after dispatch is done. */
283 #define VLIB_NODE_FLAG_FRAME_NO_FREE_AFTER_DISPATCH (1 << 0)
285 /* Node counts as output/drop/punt node for stats purposes. */
286 #define VLIB_NODE_FLAG_IS_OUTPUT (1 << 1)
287 #define VLIB_NODE_FLAG_IS_DROP (1 << 2)
288 #define VLIB_NODE_FLAG_IS_PUNT (1 << 3)
289 #define VLIB_NODE_FLAG_IS_HANDOFF (1 << 4)
291 /* Set if current node runtime has traced vectors. */
292 #define VLIB_NODE_FLAG_TRACE (1 << 5)
294 #define VLIB_NODE_FLAG_SWITCH_FROM_INTERRUPT_TO_POLLING_MODE (1 << 6)
295 #define VLIB_NODE_FLAG_SWITCH_FROM_POLLING_TO_INTERRUPT_MODE (1 << 7)
296 #define VLIB_NODE_FLAG_TRACE_SUPPORTED (1 << 8)
298 /* State for input nodes. */
301 /* Number of bytes of run time data. */
302 u8 runtime_data_bytes;
304 /* protocol at b->data[b->current_data] upon entry to the dispatch fn */
307 /* Number of error codes used by this node. */
310 /* Size of scalar and vector arguments in bytes. */
311 u16 scalar_size, vector_size;
313 /* Handle/index in error heap for this node. */
314 u32 error_heap_handle;
315 u32 error_heap_index;
317 /* Counter structures indexed by counter code for this node. */
318 vl_counter_t *error_counters;
320 /* Vector of next node names.
321 Only used before next_nodes array is initialized. */
322 char **next_node_names;
324 /* Next node indices for this node. */
327 /* Name of node that we are sibling of. */
330 /* Bitmap of all of this node's siblings. */
331 uword *sibling_bitmap;
333 /* Total number of vectors sent to each next node. */
334 u64 *n_vectors_by_next_node;
336 /* Hash table mapping next node index into slot in
337 next_nodes vector. Quickly determines whether this node
338 is connected to given next node and, if so, with which slot. */
339 uword *next_slot_by_node;
341 /* Bitmap of node indices which feed this node. */
342 uword *prev_node_bitmap;
344 /* Node/next-index which own enqueue rights with to this node. */
345 u32 owner_node_index, owner_next_index;
347 /* Buffer format/unformat for this node. */
348 format_function_t *format_buffer;
349 unformat_function_t *unformat_buffer;
351 /* Trace buffer format/unformat for this node. */
352 format_function_t *format_trace;
354 /* Function to validate incoming frames. */
355 u8 *(*validate_frame) (struct vlib_main_t * vm,
356 struct vlib_node_runtime_t *,
357 struct vlib_frame_t * f);
358 /* for pretty-printing, not typically valid */
361 /* Node function candidate registration with priority */
362 vlib_node_fn_registration_t *node_fn_registrations;
365 #define VLIB_INVALID_NODE_INDEX ((u32) ~0)
367 /* Max number of vector elements to process at once per node. */
368 #define VLIB_FRAME_SIZE 256
369 #define VLIB_FRAME_ALIGN CLIB_CACHE_LINE_BYTES
371 /* Calling frame (think stack frame) for a node. */
372 typedef struct vlib_frame_t
377 /* User flags. Used for sending hints to the next node. */
380 /* Number of scalar bytes in arguments. */
383 /* Number of bytes per vector argument. */
386 /* Number of vector elements currently in frame. */
389 /* Scalar and vector arguments to next node. */
398 /* Node runtime for this next. */
399 u32 node_runtime_index;
401 /* Next frame flags. */
404 /* Reflects node frame-used flag for this next. */
405 #define VLIB_FRAME_NO_FREE_AFTER_DISPATCH \
406 VLIB_NODE_FLAG_FRAME_NO_FREE_AFTER_DISPATCH
408 /* Don't append this frame */
409 #define VLIB_FRAME_NO_APPEND (1 << 14)
411 /* This next frame owns enqueue to node
412 corresponding to node_runtime_index. */
413 #define VLIB_FRAME_OWNER (1 << 15)
415 /* Set when frame has been allocated for this next. */
416 #define VLIB_FRAME_IS_ALLOCATED VLIB_NODE_FLAG_IS_OUTPUT
418 /* Set when frame has been added to pending vector. */
419 #define VLIB_FRAME_PENDING VLIB_NODE_FLAG_IS_DROP
421 /* Set when frame is to be freed after dispatch. */
422 #define VLIB_FRAME_FREE_AFTER_DISPATCH VLIB_NODE_FLAG_IS_PUNT
424 /* Set when frame has traced packets. */
425 #define VLIB_FRAME_TRACE VLIB_NODE_FLAG_TRACE
427 /* Number of vectors enqueue to this next since last overflow. */
428 u32 vectors_since_last_overflow;
432 vlib_next_frame_init (vlib_next_frame_t * nf)
434 clib_memset (nf, 0, sizeof (nf[0]));
435 nf->node_runtime_index = ~0;
438 /* A frame pending dispatch by main loop. */
441 /* Node and runtime for this frame. */
442 u32 node_runtime_index;
444 /* Frame index (in the heap). */
447 /* Start of next frames for this node. */
448 u32 next_frame_index;
450 /* Special value for next_frame_index when there is no next frame. */
451 #define VLIB_PENDING_FRAME_NO_NEXT_FRAME ((u32) ~0)
452 } vlib_pending_frame_t;
454 typedef struct vlib_node_runtime_t
456 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0); /**< cacheline mark */
458 vlib_node_function_t *function; /**< Node function to call. */
460 vlib_error_t *errors; /**< Vector of errors for this node. */
462 u32 clocks_since_last_overflow; /**< Number of clock cycles. */
464 u32 max_clock; /**< Maximum clock cycle for an
467 u32 max_clock_n; /**< Number of vectors in the recorded
470 u32 calls_since_last_overflow; /**< Number of calls. */
472 u32 vectors_since_last_overflow; /**< Number of vector elements
473 processed by this node. */
475 u32 next_frame_index; /**< Start of next frames for this
478 u32 node_index; /**< Node index. */
480 u32 input_main_loops_per_call; /**< For input nodes: decremented
481 on each main loop interation until
482 it reaches zero and function is
483 called. Allows some input nodes to
484 be called more than others. */
486 u32 main_loop_count_last_dispatch; /**< Saved main loop counter of last
487 dispatch of this node. */
489 u32 main_loop_vector_stats[2];
491 u16 flags; /**< Copy of main node flags. */
493 u16 state; /**< Input node state. */
497 u16 cached_next_index; /**< Next frame index that vector
498 arguments were last enqueued to
499 last time this node ran. Set to
500 zero before first run of this
503 u16 thread_index; /**< thread this node runs on */
505 u8 runtime_data[0]; /**< Function dependent
506 node-runtime data. This data is
507 thread local, and it is not
508 cloned from main thread. It needs
509 to be initialized for each thread
510 before it is used unless
511 runtime_data template exists in
516 #define VLIB_NODE_RUNTIME_DATA_SIZE (sizeof (vlib_node_runtime_t) - STRUCT_OFFSET_OF (vlib_node_runtime_t, runtime_data))
520 /* Number of allocated frames for this scalar/vector size. */
523 /* Vector of free frames for this scalar/vector size. */
524 vlib_frame_t **free_frames;
529 /* Users opaque value for event type. */
531 } vlib_process_event_type_t;
535 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
536 /* Node runtime for this process. */
537 vlib_node_runtime_t node_runtime;
539 /* Where to longjmp when process is done. */
540 clib_longjmp_t return_longjmp;
542 #define VLIB_PROCESS_RETURN_LONGJMP_RETURN ((uword) ~0 - 0)
543 #define VLIB_PROCESS_RETURN_LONGJMP_SUSPEND ((uword) ~0 - 1)
545 /* Where to longjmp to resume node after suspend. */
546 clib_longjmp_t resume_longjmp;
547 #define VLIB_PROCESS_RESUME_LONGJMP_SUSPEND 0
548 #define VLIB_PROCESS_RESUME_LONGJMP_RESUME 1
551 #define VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_CLOCK (1 << 0)
552 #define VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_EVENT (1 << 1)
553 /* Set to indicate that this process has been added to resume vector. */
554 #define VLIB_PROCESS_RESUME_PENDING (1 << 2)
556 /* Process function is currently running. */
557 #define VLIB_PROCESS_IS_RUNNING (1 << 3)
559 /* Size of process stack. */
560 u16 log2_n_stack_bytes;
562 u32 suspended_process_frame_index;
564 /* Number of times this process was suspended. */
567 /* Vectors of pending event data indexed by event type index. */
568 void **pending_event_data_by_type_index;
570 /* Bitmap of event type-indices with non-empty vectors. */
571 uword *non_empty_event_type_bitmap;
573 /* Bitmap of event type-indices which are one time events. */
574 uword *one_time_event_type_bitmap;
576 /* Type is opaque pointer -- typically a pointer to an event handler
577 function. Hash table to map opaque to a type index. */
578 uword *event_type_index_by_type_opaque;
580 /* Pool of currently valid event types. */
581 vlib_process_event_type_t *event_type_pool;
584 * When suspending saves clock time (10us ticks) when process
587 u64 resume_clock_interval;
589 /* Handle from timer code, to cancel an unexpired timer */
590 u32 stop_timer_handle;
592 /* Default output function and its argument for any CLI outputs
593 within the process. */
594 vlib_cli_output_function_t *output_function;
595 uword output_function_arg;
598 #define VLIB_PROCESS_STACK_MAGIC (0xdead7ead)
607 } vlib_one_time_waiting_process_t;
613 u16 n_data_elt_bytes;
615 /* n_data_elts * n_data_elt_bytes */
618 /* Process node & event type to be used to signal event. */
619 u32 process_node_index;
621 u32 event_type_index;
625 u8 inline_event_data[64 - 3 * sizeof (u32) - 2 * sizeof (u16)];
627 /* Vector of event data used only when data does not fit inline. */
628 u8 *event_data_as_vector;
631 vlib_signal_timed_event_data_t;
634 vlib_timing_wheel_data_is_timed_event (u32 d)
640 vlib_timing_wheel_data_set_suspended_process (u32 i)
646 vlib_timing_wheel_data_set_timed_event (u32 i)
652 vlib_timing_wheel_data_get_index (u32 d)
659 clib_march_variant_type_t index;
663 } vlib_node_fn_variant_t;
670 /* Node index hashed by node name. */
674 #define VLIB_NODE_MAIN_RUNTIME_STARTED (1 << 0)
676 /* Nodes segregated by type for cache locality.
677 Does not apply to nodes of type VLIB_NODE_TYPE_INTERNAL. */
678 vlib_node_runtime_t *nodes_by_type[VLIB_N_NODE_TYPE];
680 /* Node runtime indices for input nodes with pending interrupts. */
682 volatile u32 *pending_interrupts;
684 /* Input nodes are switched from/to interrupt to/from polling mode
685 when average vector length goes above/below polling/interrupt
687 u32 polling_threshold_vector_length;
688 u32 interrupt_threshold_vector_length;
690 /* Vector of next frames. */
691 vlib_next_frame_t *next_frames;
693 /* Vector of internal node's frames waiting to be called. */
694 vlib_pending_frame_t *pending_frames;
696 /* Timing wheel for scheduling time-based node dispatch. */
699 vlib_signal_timed_event_data_t *signal_timed_event_data_pool;
701 /* Opaque data vector added via timing_wheel_advance. */
702 u32 *data_from_advancing_timing_wheel;
704 /* CPU time of next process to be ready on timing wheel. */
705 f64 time_next_process_ready;
707 /* Vector of process nodes.
708 One for each node of type VLIB_NODE_TYPE_PROCESS. */
709 vlib_process_t **processes;
711 /* Current running process or ~0 if no process running. */
712 u32 current_process_index;
714 /* Pool of pending process frames. */
715 vlib_pending_frame_t *suspended_process_frames;
717 /* Vector of event data vectors pending recycle. */
718 void **recycled_event_data_vectors;
720 /* Current counts of nodes in each state. */
721 u32 input_node_counts_by_state[VLIB_N_NODE_STATE];
723 /* Hash of (scalar_size,vector_size) to frame_sizes index. */
724 uword *frame_size_hash;
726 /* Per-size frame allocation information. */
727 vlib_frame_size_t *frame_sizes;
729 /* Time of last node runtime stats clear. */
730 f64 time_last_runtime_stats_clear;
732 /* Node registrations added by constructors */
733 vlib_node_registration_t *node_registrations;
735 /* Node index from error code */
738 /* Node Function Variants */
739 vlib_node_fn_variant_t *variants;
741 /* Node Function Default Variant Index */
742 u32 node_fn_default_march_variant;
744 /* Node Function march Variant by Suffix Hash */
745 uword *node_fn_march_variant_by_suffix;
748 typedef u16 vlib_error_t;
751 vlib_error_get_node (vlib_node_main_t * nm, vlib_error_t e)
753 return nm->node_by_error[e];
757 vlib_error_get_code (vlib_node_main_t * nm, vlib_error_t e)
759 u32 node_index = nm->node_by_error[e];
760 vlib_node_t *n = nm->nodes[node_index];
761 u32 error_code = e - n->error_heap_index;
765 #define FRAME_QUEUE_MAX_NELTS 64
768 CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
776 i32 n_vectors[FRAME_QUEUE_MAX_NELTS];
777 } frame_queue_trace_t;
781 u64 count[FRAME_QUEUE_MAX_NELTS];
782 } frame_queue_nelt_counter_t;
784 #endif /* included_vlib_node_h */
787 * fd.io coding-style-patch-verification: ON
790 * eval: (c-set-style "gnu")