FD.io VPP  v18.07-34-g55fbdb9
Vector Packet Processing
node_funcs.h
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 /*
16  * node_funcs.h: processing nodes global functions/inlines
17  *
18  * Copyright (c) 2008 Eliot Dresselhaus
19  *
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:
27  *
28  * The above copyright notice and this permission notice shall be
29  * included in all copies or substantial portions of the Software.
30  *
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.
38  */
39 
40 /** \file
41  vlib node functions
42 */
43 
44 
45 #ifndef included_vlib_node_funcs_h
46 #define included_vlib_node_funcs_h
47 
48 #include <vppinfra/fifo.h>
50 
51 /** \brief Get vlib node by index.
52  @warning This function will ASSERT if @c i is out of range.
53  @param vm vlib_main_t pointer, varies by thread
54  @param i node index.
55  @return pointer to the requested vlib_node_t.
56 */
57 
60 {
61  return vec_elt (vm->node_main.nodes, i);
62 }
63 
64 /** \brief Get vlib node by graph arc (next) index.
65  @param vm vlib_main_t pointer, varies by thread
66  @param node_index index of original node
67  @param next_index graph arc index
68  @return pointer to the vlib_node_t at the end of the indicated arc
69 */
70 
72 vlib_get_next_node (vlib_main_t * vm, u32 node_index, u32 next_index)
73 {
74  vlib_node_main_t *nm = &vm->node_main;
75  vlib_node_t *n;
76 
77  n = vec_elt (nm->nodes, node_index);
78  ASSERT (next_index < vec_len (n->next_nodes));
79  return vlib_get_node (vm, n->next_nodes[next_index]);
80 }
81 
82 /** \brief Get node runtime by node index.
83  @param vm vlib_main_t pointer, varies by thread
84  @param node_index index of node
85  @return pointer to the indicated vlib_node_runtime_t
86 */
87 
90 {
91  vlib_node_main_t *nm = &vm->node_main;
92  vlib_node_t *n = vec_elt (nm->nodes, node_index);
93  vlib_process_t *p;
94  if (n->type != VLIB_NODE_TYPE_PROCESS)
95  return vec_elt_at_index (nm->nodes_by_type[n->type], n->runtime_index);
96  else
97  {
98  p = vec_elt (nm->processes, n->runtime_index);
99  return &p->node_runtime;
100  }
101 }
102 
103 /** \brief Get node runtime private data by node index.
104  @param vm vlib_main_t pointer, varies by thread
105  @param node_index index of the node
106  @return pointer to the indicated vlib_node_runtime_t private data
107 */
108 
109 always_inline void *
111 {
112  vlib_node_runtime_t *r = vlib_node_get_runtime (vm, node_index);
113  return r->runtime_data;
114 }
115 
116 /** \brief Set node runtime private data.
117  @param vm vlib_main_t pointer, varies by thread
118  @param node_index index of the node
119  @param runtime_data arbitrary runtime private data
120  @param n_runtime_data_bytes size of runtime private data
121 */
122 
123 always_inline void
125  void *runtime_data, u32 n_runtime_data_bytes)
126 {
127  vlib_node_t *n = vlib_get_node (vm, node_index);
128  vlib_node_runtime_t *r = vlib_node_get_runtime (vm, node_index);
129 
130  n->runtime_data_bytes = n_runtime_data_bytes;
131  vec_free (n->runtime_data);
132  vec_add (n->runtime_data, runtime_data, n_runtime_data_bytes);
133 
134  ASSERT (vec_len (n->runtime_data) <= sizeof (vlib_node_runtime_t) -
135  STRUCT_OFFSET_OF (vlib_node_runtime_t, runtime_data));
136 
137  if (vec_len (n->runtime_data) > 0)
139 }
140 
141 /** \brief Set node dispatch state.
142  @param vm vlib_main_t pointer, varies by thread
143  @param node_index index of the node
144  @param new_state new state for node, see vlib_node_state_t
145 */
146 always_inline void
148  vlib_node_state_t new_state)
149 {
150  vlib_node_main_t *nm = &vm->node_main;
151  vlib_node_t *n;
153 
154  n = vec_elt (nm->nodes, node_index);
155  if (n->type == VLIB_NODE_TYPE_PROCESS)
156  {
158  r = &p->node_runtime;
159 
160  /* When disabling make sure flags are cleared. */
164  }
165  else
167 
168  ASSERT (new_state < VLIB_N_NODE_STATE);
169 
170  if (n->type == VLIB_NODE_TYPE_INPUT)
171  {
173  nm->input_node_counts_by_state[n->state] -= 1;
174  nm->input_node_counts_by_state[new_state] += 1;
175  }
176 
177  n->state = new_state;
178  r->state = new_state;
179 }
180 
181 /** \brief Get node dispatch state.
182  @param vm vlib_main_t pointer, varies by thread
183  @param node_index index of the node
184  @return state for node, see vlib_node_state_t
185 */
188 {
189  vlib_node_main_t *nm = &vm->node_main;
190  vlib_node_t *n;
191  n = vec_elt (nm->nodes, node_index);
192  return n->state;
193 }
194 
195 always_inline void
197 {
198  vlib_node_main_t *nm = &vm->node_main;
199  vlib_node_t *n = vec_elt (nm->nodes, node_index);
204 }
205 
208 {
209  vlib_node_main_t *nm = &vm->node_main;
211  return vec_elt (nm->processes, node->runtime_index);
212 }
213 
214 /* Fetches frame with given handle. */
217 {
218  vlib_frame_t *f;
219  f = vm->heap_base + (frame_index * VLIB_FRAME_ALIGN);
220  return f;
221 }
222 
225 {
226  uword i;
227 
228  ASSERT (((uword) f & (VLIB_FRAME_ALIGN - 1)) == 0);
229 
230  i = ((u8 *) f - (u8 *) vm->heap_base);
231  ASSERT ((i / VLIB_FRAME_ALIGN) <= 0xFFFFFFFFULL);
232 
233  return i / VLIB_FRAME_ALIGN;
234 }
235 
237 vlib_get_frame (vlib_main_t * vm, uword frame_index)
238 {
239  vlib_frame_t *f = vlib_get_frame_no_check (vm, frame_index);
241  return f;
242 }
243 
246 {
248  ASSERT (vlib_get_frame (vm, i) == f);
249  return i;
250 }
251 
252 /* Byte alignment for vector arguments. */
253 #define VLIB_FRAME_VECTOR_ALIGN (1 << 4)
254 
257 {
258  return round_pow2 (sizeof (vlib_frame_t) + scalar_size,
260 }
261 
262 /** \brief Get pointer to frame vector data.
263  @param f vlib_frame_t pointer
264  @return pointer to first vector element in frame
265 */
266 always_inline void *
268 {
269  return (void *) f + vlib_frame_vector_byte_offset (f->scalar_size);
270 }
271 
272 /** \brief Get pointer to frame scalar data.
273 
274  @warning This is almost certainly not the function you wish to call.
275  See @ref vlib_frame_vector_args instead.
276 
277  @param f vlib_frame_t pointer
278 
279  @return arbitrary node scalar data
280 
281  @sa vlib_frame_vector_args
282 */
283 always_inline void *
285 {
286  return vlib_frame_vector_args (f) - f->scalar_size;
287 }
288 
291  vlib_node_runtime_t * n, u32 next_index)
292 {
293  vlib_node_main_t *nm = &vm->node_main;
294  vlib_next_frame_t *nf;
295 
296  ASSERT (next_index < n->n_next_nodes);
297  nf = vec_elt_at_index (nm->next_frames, n->next_frame_index + next_index);
298 
299  if (CLIB_DEBUG > 0)
300  {
301  vlib_node_t *node, *next;
302  node = vec_elt (nm->nodes, n->node_index);
303  next = vec_elt (nm->nodes, node->next_nodes[next_index]);
304  ASSERT (nf->node_runtime_index == next->runtime_index);
305  }
306 
307  return nf;
308 }
309 
310 /** \brief Get pointer to frame by (@c node_index, @c next_index).
311 
312  @warning This is not a function that you should call directly.
313  See @ref vlib_get_next_frame instead.
314 
315  @param vm vlib_main_t pointer, varies by thread
316  @param node_index index of the node
317  @param next_index graph arc index
318 
319  @return pointer to the requested vlib_next_frame_t
320 
321  @sa vlib_get_next_frame
322 */
323 
325 vlib_node_get_next_frame (vlib_main_t * vm, u32 node_index, u32 next_index)
326 {
327  vlib_node_main_t *nm = &vm->node_main;
328  vlib_node_t *n;
330 
331  n = vec_elt (nm->nodes, node_index);
333  return vlib_node_runtime_get_next_frame (vm, r, next_index);
334 }
335 
337  vlib_node_runtime_t * node,
338  u32 next_index,
339  u32 alloc_new_frame);
340 
341 #define vlib_get_next_frame_macro(vm,node,next_index,vectors,n_vectors_left,alloc_new_frame) \
342 do { \
343  vlib_frame_t * _f \
344  = vlib_get_next_frame_internal ((vm), (node), (next_index), \
345  (alloc_new_frame)); \
346  u32 _n = _f->n_vectors; \
347  (vectors) = vlib_frame_vector_args (_f) + _n * sizeof ((vectors)[0]); \
348  (n_vectors_left) = VLIB_FRAME_SIZE - _n; \
349 } while (0)
350 
351 
352 /** \brief Get pointer to next frame vector data by
353  (@c vlib_node_runtime_t, @c next_index).
354  Standard single/dual loop boilerplate element.
355  @attention This is a MACRO, with SIDE EFFECTS.
356 
357  @param vm vlib_main_t pointer, varies by thread
358  @param node current node vlib_node_runtime_t pointer
359  @param next_index requested graph arc index
360 
361  @return @c vectors -- pointer to next available vector slot
362  @return @c n_vectors_left -- number of vector slots available
363 */
364 #define vlib_get_next_frame(vm,node,next_index,vectors,n_vectors_left) \
365  vlib_get_next_frame_macro (vm, node, next_index, \
366  vectors, n_vectors_left, \
367  /* alloc new frame */ 0)
368 
369 #define vlib_get_new_next_frame(vm,node,next_index,vectors,n_vectors_left) \
370  vlib_get_next_frame_macro (vm, node, next_index, \
371  vectors, n_vectors_left, \
372  /* alloc new frame */ 1)
373 
374 /** \brief Release pointer to next frame vector data.
375  Standard single/dual loop boilerplate element.
376  @param vm vlib_main_t pointer, varies by thread
377  @param r current node vlib_node_runtime_t pointer
378  @param next_index graph arc index
379  @param n_packets_left number of slots still available in vector
380 */
381 void
384  u32 next_index, u32 n_packets_left);
385 
386 /* Combination get plus put. Returns vector argument just added. */
387 #define vlib_set_next_frame(vm,node,next_index,v) \
388 ({ \
389  uword _n_left; \
390  vlib_get_next_frame ((vm), (node), (next_index), (v), _n_left); \
391  ASSERT (_n_left > 0); \
392  vlib_put_next_frame ((vm), (node), (next_index), _n_left - 1); \
393  (v); \
394 })
395 
396 always_inline void
398  vlib_node_runtime_t * node,
399  u32 next_index, u32 buffer_index)
400 {
401  u32 *p;
402  p = vlib_set_next_frame (vm, node, next_index, p);
403  p[0] = buffer_index;
404 }
405 
406 vlib_frame_t *vlib_get_frame_to_node (vlib_main_t * vm, u32 to_node_index);
407 void vlib_put_frame_to_node (vlib_main_t * vm, u32 to_node_index,
408  vlib_frame_t * f);
409 
412 {
413  return vm->node_main.current_process_index != ~0;
414 }
415 
418 {
419  vlib_node_main_t *nm = &vm->node_main;
420  if (vlib_in_process_context (vm))
421  return vec_elt (nm->processes, nm->current_process_index);
422  return 0;
423 }
424 
427 {
429 }
430 
431 /** Returns TRUE if a process suspend time is less than 10us
432  @param dt - remaining poll time in seconds
433  @returns 1 if dt < 10e-6, 0 otherwise
434 */
437 {
438  return dt < 10e-6;
439 }
440 
441 /** Suspend a vlib cooperative multi-tasking thread for a period of time
442  @param vm - vlib_main_t *
443  @param dt - suspend interval in seconds
444  @returns VLIB_PROCESS_RESUME_LONGJMP_RESUME, routinely ignored
445 */
446 
449 {
450  uword r;
451  vlib_node_main_t *nm = &vm->node_main;
453 
456 
460  {
461  /* expiration time in 10us ticks */
462  p->resume_clock_interval = dt * 1e5;
464  }
465 
466  return r;
467 }
468 
469 always_inline void
471  uword is_one_time_event)
472 {
475  if (is_one_time_event)
477  clib_bitmap_andnoti (p->one_time_event_type_bitmap, t);
478 }
479 
480 always_inline void
482 {
485  vlib_process_free_event_type (p, t, /* is_one_time_event */ 1);
486 }
487 
488 always_inline void *
490  uword * return_event_type_opaque)
491 {
492  vlib_node_main_t *nm = &vm->node_main;
493  vlib_process_t *p;
495  uword t;
496  void *event_data_vector;
497 
498  p = vec_elt (nm->processes, nm->current_process_index);
499 
500  /* Find first type with events ready.
501  Return invalid type when there's nothing there. */
503  if (t == ~0)
504  return 0;
505 
507  clib_bitmap_andnoti (p->non_empty_event_type_bitmap, t);
508 
509  ASSERT (_vec_len (p->pending_event_data_by_type_index[t]) > 0);
510  event_data_vector = p->pending_event_data_by_type_index[t];
512 
513  et = pool_elt_at_index (p->event_type_pool, t);
514 
515  /* Return user's opaque value and possibly index. */
516  *return_event_type_opaque = et->opaque;
517 
519 
520  return event_data_vector;
521 }
522 
523 /* Return event data vector for later reuse. We reuse event data to avoid
524  repeatedly allocating event vectors in cases where we care about speed. */
525 always_inline void
526 vlib_process_put_event_data (vlib_main_t * vm, void *event_data)
527 {
528  vlib_node_main_t *nm = &vm->node_main;
529  vec_add1 (nm->recycled_event_data_vectors, event_data);
530 }
531 
532 /** Return the first event type which has occurred and a vector of per-event
533  data of that type, or a timeout indication
534 
535  @param vm - vlib_main_t pointer
536  @param data_vector - pointer to a (uword *) vector to receive event data
537  @returns either an event type and a vector of per-event instance data,
538  or ~0 to indicate a timeout.
539 */
540 
543 {
544  vlib_node_main_t *nm = &vm->node_main;
545  vlib_process_t *p;
547  uword r, t, l;
548 
549  p = vec_elt (nm->processes, nm->current_process_index);
550 
551  /* Find first type with events ready.
552  Return invalid type when there's nothing there. */
554  if (t == ~0)
555  return t;
556 
558  clib_bitmap_andnoti (p->non_empty_event_type_bitmap, t);
559 
560  l = _vec_len (p->pending_event_data_by_type_index[t]);
561  if (data_vector)
562  vec_add (*data_vector, p->pending_event_data_by_type_index[t], l);
563  _vec_len (p->pending_event_data_by_type_index[t]) = 0;
564 
565  et = pool_elt_at_index (p->event_type_pool, t);
566 
567  /* Return user's opaque value. */
568  r = et->opaque;
569 
571 
572  return r;
573 }
574 
577  uword ** data_vector)
578 {
579  uword l;
580 
582  clib_bitmap_andnoti (p->non_empty_event_type_bitmap, t);
583 
584  l = _vec_len (p->pending_event_data_by_type_index[t]);
585  if (data_vector)
586  vec_add (*data_vector, p->pending_event_data_by_type_index[t], l);
587  _vec_len (p->pending_event_data_by_type_index[t]) = 0;
588 
590 
591  return l;
592 }
593 
594 /* As above but query as specified type of event. Returns number of
595  events found. */
598  uword with_type_opaque)
599 {
600  vlib_node_main_t *nm = &vm->node_main;
601  vlib_process_t *p;
602  uword t, *h;
603 
604  p = vec_elt (nm->processes, nm->current_process_index);
605  h = hash_get (p->event_type_index_by_type_opaque, with_type_opaque);
606  if (!h)
607  /* This can happen when an event has not yet been
608  signaled with given opaque type. */
609  return 0;
610 
611  t = h[0];
613  return 0;
614 
615  return vlib_process_get_events_helper (p, t, data_vector);
616 }
617 
620 {
621  vlib_node_main_t *nm = &vm->node_main;
622  vlib_process_t *p;
623  uword r;
624 
625  p = vec_elt (nm->processes, nm->current_process_index);
627  {
629  r =
634  }
635 
636  return p->non_empty_event_type_bitmap;
637 }
638 
641  uword ** data_vector,
642  uword with_type_index)
643 {
644  vlib_node_main_t *nm = &vm->node_main;
645  vlib_process_t *p;
646  uword r;
647 
648  p = vec_elt (nm->processes, nm->current_process_index);
649  ASSERT (!pool_is_free_index (p->event_type_pool, with_type_index));
650  while (!clib_bitmap_get (p->non_empty_event_type_bitmap, with_type_index))
651  {
653  r =
658  }
659 
660  return vlib_process_get_events_helper (p, with_type_index, data_vector);
661 }
662 
665  uword ** data_vector,
666  uword with_type_opaque)
667 {
668  vlib_node_main_t *nm = &vm->node_main;
669  vlib_process_t *p;
670  uword r, *h;
671 
672  p = vec_elt (nm->processes, nm->current_process_index);
673  h = hash_get (p->event_type_index_by_type_opaque, with_type_opaque);
674  while (!h || !clib_bitmap_get (p->non_empty_event_type_bitmap, h[0]))
675  {
677  r =
682 
683  /* See if unknown event type has been signaled now. */
684  if (!h)
685  h = hash_get (p->event_type_index_by_type_opaque, with_type_opaque);
686  }
687 
688  return vlib_process_get_events_helper (p, h[0], data_vector);
689 }
690 
691 /** Suspend a cooperative multi-tasking thread
692  Waits for an event, or for the indicated number of seconds to elapse
693  @param vm - vlib_main_t pointer
694  @param dt - timeout, in seconds.
695  @returns the remaining time interval
696 */
697 
700 {
701  vlib_node_main_t *nm = &vm->node_main;
702  vlib_process_t *p;
703  f64 wakeup_time;
704  uword r;
705 
706  p = vec_elt (nm->processes, nm->current_process_index);
707 
710  return dt;
711 
712  wakeup_time = vlib_time_now (vm) + dt;
713 
714  /* Suspend waiting for both clock and event to occur. */
717 
720  {
721  p->resume_clock_interval = dt * 1e5;
723  }
724 
725  /* Return amount of time still left to sleep.
726  If <= 0 then we've been waken up by the clock (and not an event). */
727  return wakeup_time - vlib_time_now (vm);
728 }
729 
732 {
734  pool_get (p->event_type_pool, et);
735  et->opaque = with_type_opaque;
736  return et;
737 }
738 
741  uword with_type_opaque)
742 {
743  vlib_node_main_t *nm = &vm->node_main;
744  vlib_node_t *n = vlib_get_node (vm, node_index);
747  uword t;
748 
749  et = vlib_process_new_event_type (p, with_type_opaque);
750  t = et - p->event_type_pool;
752  clib_bitmap_ori (p->one_time_event_type_bitmap, t);
753  return t;
754 }
755 
756 always_inline void
758  uword t)
759 {
760  vlib_node_main_t *nm = &vm->node_main;
761  vlib_node_t *n = vlib_get_node (vm, node_index);
763 
765  vlib_process_free_event_type (p, t, /* is_one_time_event */ 1);
766 }
767 
768 always_inline void *
770  vlib_node_t * n,
771  vlib_process_t * p,
772  uword t,
773  uword n_data_elts, uword n_data_elt_bytes)
774 {
775  uword p_flags, add_to_pending, delete_from_wheel;
776  void *data_to_be_written_by_caller;
777 
779 
781 
783 
784  /* Resize data vector and return caller's data to be written. */
785  {
786  void *data_vec = p->pending_event_data_by_type_index[t];
787  uword l;
788 
789  if (!data_vec && vec_len (nm->recycled_event_data_vectors))
790  {
791  data_vec = vec_pop (nm->recycled_event_data_vectors);
792  _vec_len (data_vec) = 0;
793  }
794 
795  l = vec_len (data_vec);
796 
797  data_vec = _vec_resize (data_vec,
798  /* length_increment */ n_data_elts,
799  /* total size after increment */
800  (l + n_data_elts) * n_data_elt_bytes,
801  /* header_bytes */ 0, /* data_align */ 0);
802 
803  p->pending_event_data_by_type_index[t] = data_vec;
804  data_to_be_written_by_caller = data_vec + l * n_data_elt_bytes;
805  }
806 
808  clib_bitmap_ori (p->non_empty_event_type_bitmap, t);
809 
810  p_flags = p->flags;
811 
812  /* Event was already signalled? */
813  add_to_pending = (p_flags & VLIB_PROCESS_RESUME_PENDING) == 0;
814 
815  /* Process will resume when suspend time elapses? */
816  delete_from_wheel = 0;
818  {
819  /* Waiting for both event and clock? */
821  delete_from_wheel = 1;
822  else
823  /* Waiting only for clock. Event will be queue and may be
824  handled when timer expires. */
825  add_to_pending = 0;
826  }
827 
828  /* Never add current process to pending vector since current process is
829  already running. */
830  add_to_pending &= nm->current_process_index != n->runtime_index;
831 
832  if (add_to_pending)
833  {
835  p->flags = p_flags | VLIB_PROCESS_RESUME_PENDING;
837  if (delete_from_wheel)
838  TW (tw_timer_stop) ((TWT (tw_timer_wheel) *) nm->timing_wheel,
839  p->stop_timer_handle);
840  }
841 
842  return data_to_be_written_by_caller;
843 }
844 
845 always_inline void *
847  uword node_index,
848  uword type_opaque,
849  uword n_data_elts, uword n_data_elt_bytes)
850 {
851  vlib_node_main_t *nm = &vm->node_main;
852  vlib_node_t *n = vlib_get_node (vm, node_index);
854  uword *h, t;
855 
856  /* Must be in main thread */
857  ASSERT (vlib_get_thread_index () == 0);
858 
859  h = hash_get (p->event_type_index_by_type_opaque, type_opaque);
860  if (!h)
861  {
863  vlib_process_new_event_type (p, type_opaque);
864  t = et - p->event_type_pool;
865  hash_set (p->event_type_index_by_type_opaque, type_opaque, t);
866  }
867  else
868  t = h[0];
869 
870  return vlib_process_signal_event_helper (nm, n, p, t, n_data_elts,
871  n_data_elt_bytes);
872 }
873 
874 always_inline void *
876  f64 dt,
877  uword node_index,
878  uword type_opaque,
879  uword n_data_elts, uword n_data_elt_bytes)
880 {
881  vlib_node_main_t *nm = &vm->node_main;
882  vlib_node_t *n = vlib_get_node (vm, node_index);
884  uword *h, t;
885 
886  h = hash_get (p->event_type_index_by_type_opaque, type_opaque);
887  if (!h)
888  {
890  vlib_process_new_event_type (p, type_opaque);
891  t = et - p->event_type_pool;
892  hash_set (p->event_type_index_by_type_opaque, type_opaque, t);
893  }
894  else
895  t = h[0];
896 
898  return vlib_process_signal_event_helper (nm, n, p, t, n_data_elts,
899  n_data_elt_bytes);
900  else
901  {
903 
904  pool_get_aligned (nm->signal_timed_event_data_pool, te, sizeof (te[0]));
905 
906  te->n_data_elts = n_data_elts;
907  te->n_data_elt_bytes = n_data_elt_bytes;
908  te->n_data_bytes = n_data_elts * n_data_elt_bytes;
909 
910  /* Assert that structure fields are big enough. */
911  ASSERT (te->n_data_elts == n_data_elts);
912  ASSERT (te->n_data_elt_bytes == n_data_elt_bytes);
913  ASSERT (te->n_data_bytes == n_data_elts * n_data_elt_bytes);
914 
916  te->event_type_index = t;
917 
918  p->stop_timer_handle =
919  TW (tw_timer_start) ((TWT (tw_timer_wheel) *) nm->timing_wheel,
921  (te - nm->signal_timed_event_data_pool),
922  0 /* timer_id */ ,
923  (vlib_time_now (vm) + dt) * 1e5);
924 
925  /* Inline data big enough to hold event? */
926  if (te->n_data_bytes < sizeof (te->inline_event_data))
927  return te->inline_event_data;
928  else
929  {
930  te->event_data_as_vector = 0;
932  return te->event_data_as_vector;
933  }
934  }
935 }
936 
937 always_inline void *
939  uword node_index,
940  uword type_index,
941  uword n_data_elts,
942  uword n_data_elt_bytes)
943 {
944  vlib_node_main_t *nm = &vm->node_main;
945  vlib_node_t *n = vlib_get_node (vm, node_index);
947  return vlib_process_signal_event_helper (nm, n, p, type_index, n_data_elts,
948  n_data_elt_bytes);
949 }
950 
951 always_inline void
953  uword node_index, uword type_opaque, uword data)
954 {
955  uword *d = vlib_process_signal_event_data (vm, node_index, type_opaque,
956  1 /* elts */ , sizeof (uword));
957  d[0] = data;
958 }
959 
960 always_inline void
962  uword node_index,
963  uword type_opaque, void *data)
964 {
965  void **d = vlib_process_signal_event_data (vm, node_index, type_opaque,
966  1 /* elts */ , sizeof (data));
967  d[0] = data;
968 }
969 
970 /**
971  * Signal event to process from any thread.
972  *
973  * When in doubt, use this.
974  */
975 always_inline void
977  uword node_index, uword type_opaque, uword data)
978 {
979  if (vlib_get_thread_index () != 0)
980  {
982  .node_index = node_index,
983  .type_opaque = type_opaque,
984  .data = data,
985  };
987  (u8 *) & args, sizeof (args));
988  }
989  else
990  vlib_process_signal_event (vm, node_index, type_opaque, data);
991 }
992 
993 always_inline void
995  uword node_index,
996  uword type_index, uword data)
997 {
998  uword *d =
999  vlib_process_signal_one_time_event_data (vm, node_index, type_index,
1000  1 /* elts */ , sizeof (uword));
1001  d[0] = data;
1002 }
1003 
1004 always_inline void
1007 {
1009  /* data */ ~0);
1010  memset (p, ~0, sizeof (p[0]));
1011 }
1012 
1013 always_inline void
1016  ** wps)
1017 {
1020  vec_free (*wps);
1021 }
1022 
1023 always_inline void
1026  * p)
1027 {
1028  p->node_index = vlib_current_process (vm);
1029  p->one_time_event = vlib_process_create_one_time_event (vm, p->node_index, /* type opaque */
1030  ~0);
1032  /* don't care about data */ 0,
1033  p->one_time_event);
1034 }
1035 
1036 always_inline void
1039  ** wps)
1040 {
1042  vec_add2 (*wps, wp, 1);
1044 }
1045 
1048  vlib_node_runtime_t * node,
1049  uword n_vectors)
1050 {
1051  u32 i, d, vi0, vi1;
1052  u32 i0, i1;
1053 
1056  & (ARRAY_LEN (node->main_loop_vector_stats) - 1));
1057  i0 = i ^ 0;
1058  i1 = i ^ 1;
1060  -
1063  vi0 = node->main_loop_vector_stats[i0];
1064  vi1 = node->main_loop_vector_stats[i1];
1065  vi0 = d == 0 ? vi0 : 0;
1066  vi1 = d <= 1 ? vi1 : 0;
1067  vi0 += n_vectors;
1068  node->main_loop_vector_stats[i0] = vi0;
1069  node->main_loop_vector_stats[i1] = vi1;
1071  /* Return previous counter. */
1072  return node->main_loop_vector_stats[i1];
1073 }
1074 
1077 {
1078  vlib_node_runtime_t *rt = vlib_node_get_runtime (vm, node_index);
1079  u32 v;
1080 
1081  v = vlib_node_runtime_update_main_loop_vector_stats (vm, rt, /* n_vectors */
1082  0);
1083  return (f64) v / (1 << VLIB_LOG2_MAIN_LOOPS_PER_STATS_UPDATE);
1084 }
1085 
1088 {
1089  vlib_node_runtime_t *rt = vlib_node_get_runtime (vm, node_index);
1090  u32 v;
1091 
1092  v = vlib_node_runtime_update_main_loop_vector_stats (vm, rt, /* n_vectors */
1093  0);
1095 }
1096 
1097 void
1099 
1100 /* Return the edge index if present, ~0 otherwise */
1101 uword vlib_node_get_next (vlib_main_t * vm, uword node, uword next_node);
1102 
1103 /* Add next node to given node in given slot. */
1104 uword
1106  uword node, uword next_node, uword slot);
1107 
1108 /* As above but adds to end of node's next vector. */
1111 {
1112  return vlib_node_add_next_with_slot (vm, node, next_node, ~0);
1113 }
1114 
1115 /* Add next node to given node in given slot. */
1116 uword
1118  uword node, char *next_name, uword slot);
1119 
1120 /* As above but adds to end of node's next vector. */
1123 {
1124  return vlib_node_add_named_next_with_slot (vm, node, name, ~0);
1125 }
1126 
1127 /**
1128  * Get list of nodes
1129  */
1130 void
1131 vlib_node_get_nodes (vlib_main_t * vm, u32 max_threads, int include_stats,
1132  int barrier_sync, vlib_node_t **** node_dupsp,
1133  vlib_main_t *** stat_vmsp);
1134 
1135 /* Query node given name. */
1137 
1138 /* Rename a node. */
1139 void vlib_node_rename (vlib_main_t * vm, u32 node_index, char *fmt, ...);
1140 
1141 /* Register new packet processing node. Nodes can be registered
1142  dynamically via this call or statically via the VLIB_REGISTER_NODE
1143  macro. */
1145 
1146 /* Register all static nodes registered via VLIB_REGISTER_NODE. */
1148 
1149 /* Start a process. */
1150 void vlib_start_process (vlib_main_t * vm, uword process_index);
1151 
1152 /* Sync up runtime and main node stats. */
1154 
1155 /* Node graph initialization function. */
1157 
1164 /* Parse node name -> node index. */
1166 
1167 always_inline void
1169  u32 counter_index, u64 increment)
1170 {
1171  vlib_node_t *n = vlib_get_node (vm, node_index);
1172  vlib_error_main_t *em = &vm->error_main;
1173  u32 node_counter_base_index = n->error_heap_index;
1174  em->counters[node_counter_base_index + counter_index] += increment;
1175 }
1176 
1177 #endif /* included_vlib_node_funcs_h */
1178 
1179 /*
1180  * fd.io coding-style-patch-verification: ON
1181  *
1182  * Local Variables:
1183  * eval: (c-set-style "gnu")
1184  * End:
1185  */
u32 * next_nodes
Definition: node.h:324
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:437
static void vlib_node_set_runtime_data(vlib_main_t *vm, u32 node_index, void *runtime_data, u32 n_runtime_data_bytes)
Set node runtime private data.
Definition: node_funcs.h:124
u32 TW() tw_timer_start(TWT(tw_timer_wheel)*tw, u32 user_id, u32 timer_id, u64 interval)
Start a Tw Timer.
uword( unformat_function_t)(unformat_input_t *input, va_list *args)
Definition: format.h:232
static void vlib_process_free_event_type(vlib_process_t *p, uword t, uword is_one_time_event)
Definition: node_funcs.h:470
u32 error_heap_index
Definition: node.h:314
u32 next_frame_index
Start of next frames for this node.
Definition: node.h:470
#define hash_set(h, key, value)
Definition: hash.h:255
static void vlib_signal_one_time_waiting_process_vector(vlib_main_t *vm, vlib_one_time_waiting_process_t **wps)
Definition: node_funcs.h:1014
static vlib_next_frame_t * vlib_node_get_next_frame(vlib_main_t *vm, u32 node_index, u32 next_index)
Get pointer to frame by (node_index, next_index).
Definition: node_funcs.h:325
static void vlib_signal_one_time_waiting_process(vlib_main_t *vm, vlib_one_time_waiting_process_t *p)
Definition: node_funcs.h:1005
vlib_process_t ** processes
Definition: node.h:717
static f64 vlib_process_wait_for_event_or_clock(vlib_main_t *vm, f64 dt)
Suspend a cooperative multi-tasking thread Waits for an event, or for the indicated number of seconds...
Definition: node_funcs.h:699
format_function_t format_vlib_node_name
Definition: node_funcs.h:1159
static f64 vlib_node_vectors_per_main_loop_as_float(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:1076
vlib_node_runtime_t node_runtime
Definition: node.h:531
uword vlib_node_get_next(vlib_main_t *vm, uword node, uword next_node)
Definition: node.c:184
void vlib_put_frame_to_node(vlib_main_t *vm, u32 to_node_index, vlib_frame_t *f)
Definition: main.c:191
u8 runtime_data[0]
Function dependent node-runtime data.
Definition: node.h:500
static uword * vlib_process_wait_for_event(vlib_main_t *vm)
Definition: node_funcs.h:619
static void vlib_set_next_frame_buffer(vlib_main_t *vm, vlib_node_runtime_t *node, u32 next_index, u32 buffer_index)
Definition: node_funcs.h:397
static uword vlib_current_process(vlib_main_t *vm)
Definition: node_funcs.h:426
unsigned long u64
Definition: types.h:89
static void vlib_node_set_interrupt_pending(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:196
static uword vlib_node_add_named_next(vlib_main_t *vm, uword node, char *name)
Definition: node_funcs.h:1122
static f64 vlib_time_now(vlib_main_t *vm)
Definition: main.h:225
vlib_node_t * vlib_get_node_by_name(vlib_main_t *vm, u8 *name)
Definition: node.c:45
u32 main_loop_vector_stats[2]
Definition: node.h:484
void ** pending_event_data_by_type_index
Definition: node.h:562
u32 current_process_index
Definition: node.h:720
static_always_inline void clib_spinlock_unlock_if_init(clib_spinlock_t *p)
Definition: lock.h:98
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:523
#define vlib_set_next_frame(vm, node, next_index, v)
Definition: node_funcs.h:387
void vlib_process_signal_event_mt_helper(vlib_process_signal_event_mt_args_t *args)
Definition: threads.c:1817
#define vec_add2(V, P, N)
Add N elements to end of vector V, return pointer to new elements in P.
Definition: vec.h:562
int i
#define STRUCT_OFFSET_OF(t, f)
Definition: clib.h:62
void clib_longjmp(clib_longjmp_t *save, uword return_value)
format_function_t format_vlib_cpu_time
Definition: node_funcs.h:1162
u8 *( format_function_t)(u8 *s, va_list *args)
Definition: format.h:48
clib_spinlock_t pending_interrupt_lock
Definition: node.h:690
void * runtime_data
Definition: node.h:279
#define pool_get(P, E)
Allocate an object E from a pool P (unspecified alignment).
Definition: pool.h:228
uword clib_setjmp(clib_longjmp_t *save, uword return_value_not_taken)
static uword vlib_node_add_next(vlib_main_t *vm, uword node, uword next_node)
Definition: node_funcs.h:1110
unsigned char u8
Definition: types.h:56
#define vec_pop(V)
Returns last element of a vector and decrements its length.
Definition: vec.h:617
static uword vlib_process_suspend_time_is_zero(f64 dt)
Returns TRUE if a process suspend time is less than 10us.
Definition: node_funcs.h:436
static vlib_frame_t * vlib_get_frame_no_check(vlib_main_t *vm, uword frame_index)
Definition: node_funcs.h:216
static vlib_process_event_type_t * vlib_process_new_event_type(vlib_process_t *p, uword with_type_opaque)
Definition: node_funcs.h:731
double f64
Definition: types.h:142
u8 state
Definition: node.h:301
#define vec_add(V, E, N)
Add N elements to end of vector V (no header, unspecified alignment)
Definition: vec.h:600
u32 * pending_interrupt_node_runtime_indices
Definition: node.h:689
static uword vlib_process_suspend(vlib_main_t *vm, f64 dt)
Suspend a vlib cooperative multi-tasking thread for a period of time.
Definition: node_funcs.h:448
u32 main_loop_count_last_dispatch
Saved main loop counter of last dispatch of this node.
Definition: node.h:481
void vlib_node_rename(vlib_main_t *vm, u32 node_index, char *fmt,...)
Definition: node.c:102
void ** recycled_event_data_vectors
Definition: node.h:726
static uword vlib_process_get_events(vlib_main_t *vm, uword **data_vector)
Return the first event type which has occurred and a vector of per-event data of that type...
Definition: node_funcs.h:542
#define always_inline
Definition: clib.h:92
format_function_t format_vlib_node_and_next
Definition: node_funcs.h:1161
static uword clib_bitmap_is_zero(uword *ai)
predicate function; is an entire bitmap empty?
Definition: bitmap.h:57
static u32 counter_index(vlib_main_t *vm, vlib_error_t e)
vlib_node_t ** nodes
Definition: node.h:676
#define VLIB_LOG2_MAIN_LOOPS_PER_STATS_UPDATE
Definition: main.h:85
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
#define VLIB_FRAME_ALIGN
Definition: node.h:365
format_function_t format_vlib_next_node_name
Definition: node_funcs.h:1160
#define VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_CLOCK
Definition: node.h:545
#define vec_resize(V, N)
Resize a vector (no header, unspecified alignment) Add N elements to end of given vector V...
Definition: vec.h:240
void vlib_frame_free(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_frame_t *f)
Definition: main.c:211
unsigned int u32
Definition: types.h:88
static void vlib_process_delete_one_time_event(vlib_main_t *vm, uword node_index, uword t)
Definition: node_funcs.h:757
vlib_node_runtime_t * nodes_by_type[VLIB_N_NODE_TYPE]
Definition: node.h:686
static vlib_next_frame_t * vlib_node_runtime_get_next_frame(vlib_main_t *vm, vlib_node_runtime_t *n, u32 next_index)
Definition: node_funcs.h:290
static vlib_node_state_t vlib_node_get_state(vlib_main_t *vm, u32 node_index)
Get node dispatch state.
Definition: node_funcs.h:187
clib_error_t * vlib_node_main_init(vlib_main_t *vm)
Definition: node.c:629
#define hash_get(h, key)
Definition: hash.h:249
#define pool_elt_at_index(p, i)
Returns pointer to element at given index.
Definition: pool.h:464
static void * vlib_process_signal_event_helper(vlib_node_main_t *nm, vlib_node_t *n, vlib_process_t *p, uword t, uword n_data_elts, uword n_data_elt_bytes)
Definition: node_funcs.h:769
u16 state
Input node state.
Definition: node.h:488
u32 vlib_register_node(vlib_main_t *vm, vlib_node_registration_t *r)
Definition: node.c:518
static void vlib_process_signal_event(vlib_main_t *vm, uword node_index, uword type_opaque, uword data)
Definition: node_funcs.h:952
vlib_signal_timed_event_data_t * signal_timed_event_data_pool
Definition: node.h:707
static uword clib_bitmap_first_set(uword *ai)
Return the lowest numbered set bit in a bitmap.
Definition: bitmap.h:385
vlib_error_main_t error_main
Definition: main.h:141
static u32 vlib_frame_index(vlib_main_t *vm, vlib_frame_t *f)
Definition: node_funcs.h:245
#define VLIB_FRAME_IS_ALLOCATED
Definition: node.h:406
#define v
Definition: acl.c:491
static void vlib_process_maybe_free_event_type(vlib_process_t *p, uword t)
Definition: node_funcs.h:481
u8 inline_event_data[64-3 *sizeof(u32)-2 *sizeof(u16)]
Definition: node.h:641
#define TWT(a)
static void * vlib_process_signal_event_data(vlib_main_t *vm, uword node_index, uword type_opaque, uword n_data_elts, uword n_data_elt_bytes)
Definition: node_funcs.h:846
static void * vlib_node_get_runtime_data(vlib_main_t *vm, u32 node_index)
Get node runtime private data by node index.
Definition: node_funcs.h:110
static void vlib_process_signal_one_time_event(vlib_main_t *vm, uword node_index, uword type_index, uword data)
Definition: node_funcs.h:994
static vlib_frame_t * vlib_get_frame(vlib_main_t *vm, uword frame_index)
Definition: node_funcs.h:237
u32 node_index
Node index.
Definition: node.h:473
#define VLIB_PROCESS_RESUME_LONGJMP_RESUME
Definition: node.h:542
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1168
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P (general version).
Definition: pool.h:188
static uword vlib_process_get_events_with_type(vlib_main_t *vm, uword **data_vector, uword with_type_opaque)
Definition: node_funcs.h:597
static u32 vlib_frame_index_no_check(vlib_main_t *vm, vlib_frame_t *f)
Definition: node_funcs.h:224
#define VLIB_FRAME_VECTOR_ALIGN
Definition: node_funcs.h:253
u64 * counters
Definition: error.h:78
static u32 vlib_node_runtime_update_main_loop_vector_stats(vlib_main_t *vm, vlib_node_runtime_t *node, uword n_vectors)
Definition: node_funcs.h:1047
static void vlib_process_signal_event_pointer(vlib_main_t *vm, uword node_index, uword type_opaque, void *data)
Definition: node_funcs.h:961
static void * vlib_process_signal_event_at_time(vlib_main_t *vm, f64 dt, uword node_index, uword type_opaque, uword n_data_elts, uword n_data_elt_bytes)
Definition: node_funcs.h:875
u32 runtime_index
Definition: node.h:276
uword vlib_node_add_named_next_with_slot(vlib_main_t *vm, uword node, char *next_name, uword slot)
Definition: node.c:262
static_always_inline uword vlib_get_thread_index(void)
Definition: threads.h:221
static vlib_process_t * vlib_get_current_process(vlib_main_t *vm)
Definition: node_funcs.h:417
#define VLIB_PROCESS_RESUME_LONGJMP_SUSPEND
Definition: node.h:541
static uword vlib_process_wait_for_one_time_event(vlib_main_t *vm, uword **data_vector, uword with_type_index)
Definition: node_funcs.h:640
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:339
static void vlib_process_signal_event_mt(vlib_main_t *vm, uword node_index, uword type_opaque, uword data)
Signal event to process from any thread.
Definition: node_funcs.h:976
void * heap_base
Definition: main.h:104
#define VLIB_PROCESS_RESUME_PENDING
Definition: node.h:548
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:75
static uword vlib_process_create_one_time_event(vlib_main_t *vm, uword node_index, uword with_type_opaque)
Definition: node_funcs.h:740
void TW() tw_timer_stop(TWT(tw_timer_wheel)*tw, u32 handle)
Stop a tw timer.
uword vlib_node_add_next_with_slot(vlib_main_t *vm, uword node, uword next_node, uword slot)
Definition: node.c:205
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:271
static u32 vlib_frame_vector_byte_offset(u32 scalar_size)
Definition: node_funcs.h:256
#define ARRAY_LEN(x)
Definition: clib.h:59
static uword clib_bitmap_get(uword *ai, uword i)
Gets the ith bit value from a bitmap.
Definition: bitmap.h:197
static uword round_pow2(uword x, uword pow2)
Definition: clib.h:235
uword * one_time_event_type_bitmap
Definition: node.h:568
static u32 vlib_node_vectors_per_main_loop_as_integer(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:1087
void vlib_start_process(vlib_main_t *vm, uword process_index)
Definition: main.c:1346
#define pool_put_index(p, i)
Free pool element with given index.
Definition: pool.h:299
#define ASSERT(truth)
static uword vlib_process_get_events_helper(vlib_process_t *p, uword t, uword **data_vector)
Definition: node_funcs.h:576
u16 flags
Definition: node.h:371
static void * vlib_frame_args(vlib_frame_t *f)
Get pointer to frame scalar data.
Definition: node_funcs.h:284
static void vlib_node_set_state(vlib_main_t *vm, u32 node_index, vlib_node_state_t new_state)
Set node dispatch state.
Definition: node_funcs.h:147
vlib_frame_t * vlib_get_next_frame_internal(vlib_main_t *vm, vlib_node_runtime_t *node, u32 next_index, u32 alloc_new_frame)
Definition: main.c:356
static uword is_pow2(uword x)
Definition: clib.h:229
static void vlib_current_process_wait_for_one_time_event_vector(vlib_main_t *vm, vlib_one_time_waiting_process_t **wps)
Definition: node_funcs.h:1037
#define vec_elt(v, i)
Get vector value at index i.
struct _vlib_node_registration vlib_node_registration_t
void vlib_node_sync_stats(vlib_main_t *vm, vlib_node_t *n)
Definition: main.c:570
void vlib_put_next_frame(vlib_main_t *vm, vlib_node_runtime_t *r, u32 next_index, u32 n_packets_left)
Release pointer to next frame vector data.
Definition: main.c:454
static vlib_node_t * vlib_get_next_node(vlib_main_t *vm, u32 node_index, u32 next_index)
Get vlib node by graph arc (next) index.
Definition: node_funcs.h:72
static void * vlib_process_get_event_data(vlib_main_t *vm, uword *return_event_type_opaque)
Definition: node_funcs.h:489
vlib_process_event_type_t * event_type_pool
Definition: node.h:575
u32 * data_from_advancing_timing_wheel
Definition: node.h:710
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
void vlib_rpc_call_main_thread(void *callback, u8 *args, u32 arg_size)
Definition: threads.c:1828
u32 input_node_counts_by_state[VLIB_N_NODE_STATE]
Definition: node.h:729
vlib_node_main_t node_main
Definition: main.h:132
static uword vlib_process_wait_for_event_with_type(vlib_main_t *vm, uword **data_vector, uword with_type_opaque)
Definition: node_funcs.h:664
u64 uword
Definition: types.h:112
format_function_t format_vlib_time
Definition: node_funcs.h:1163
vlib_next_frame_t * next_frames
Definition: node.h:699
static u32 vlib_timing_wheel_data_set_timed_event(u32 i)
Definition: node.h:662
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:267
u32 stop_timer_handle
Definition: node.h:584
uword * event_type_index_by_type_opaque
Definition: node.h:572
unformat_function_t unformat_vlib_node
Definition: node_funcs.h:1165
u64 resume_clock_interval
Definition: node.h:581
u16 flags
Definition: node.h:544
static uword vlib_in_process_context(vlib_main_t *vm)
Definition: node_funcs.h:411
vlib_node_type_t type
Definition: node.h:270
static vlib_process_t * vlib_get_process_from_node(vlib_main_t *vm, vlib_node_t *node)
Definition: node_funcs.h:207
vlib_node_state_t
Definition: node.h:243
static void vlib_process_put_event_data(vlib_main_t *vm, void *event_data)
Definition: node_funcs.h:526
void vlib_register_all_static_nodes(vlib_main_t *vm)
Definition: node.c:538
static vlib_node_t * vlib_get_node(vlib_main_t *vm, u32 i)
Get vlib node by index.
Definition: node_funcs.h:59
#define VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_EVENT
Definition: node.h:546
#define vec_foreach(var, vec)
Vector iterator.
clib_longjmp_t return_longjmp
Definition: node.h:534
u32 node_runtime_index
Definition: node.h:392
u8 scalar_size
Definition: node.h:374
clib_longjmp_t resume_longjmp
Definition: node.h:540
#define TW(a)
static u32 vlib_timing_wheel_data_set_suspended_process(u32 i)
Definition: node.h:656
u32 main_loop_count
Definition: main.h:72
static_always_inline void clib_spinlock_lock_if_init(clib_spinlock_t *p)
Definition: lock.h:82
void * timing_wheel
Definition: node.h:705
vlib_frame_t * vlib_get_frame_to_node(vlib_main_t *vm, u32 to_node_index)
Definition: main.c:182
u8 runtime_data_bytes
Definition: node.h:304
format_function_t format_vlib_node_graph
Definition: node_funcs.h:1158
static void vlib_current_process_wait_for_one_time_event(vlib_main_t *vm, vlib_one_time_waiting_process_t *p)
Definition: node_funcs.h:1024
uword * non_empty_event_type_bitmap
Definition: node.h:565
static void * vlib_process_signal_one_time_event_data(vlib_main_t *vm, uword node_index, uword type_index, uword n_data_elts, uword n_data_elt_bytes)
Definition: node_funcs.h:938
#define VLIB_PROCESS_RETURN_LONGJMP_SUSPEND
Definition: node.h:537
void vlib_node_get_nodes(vlib_main_t *vm, u32 max_threads, int include_stats, int barrier_sync, vlib_node_t ****node_dupsp, vlib_main_t ***stat_vmsp)
Get list of nodes.
Definition: node.c:567