FD.io VPP  v19.04.3-1-gdfec10d13
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  vec_len (n->runtime_data));
140 }
141 
142 /** \brief Set node dispatch state.
143  @param vm vlib_main_t pointer, varies by thread
144  @param node_index index of the node
145  @param new_state new state for node, see vlib_node_state_t
146 */
147 always_inline void
149  vlib_node_state_t new_state)
150 {
151  vlib_node_main_t *nm = &vm->node_main;
152  vlib_node_t *n;
154 
155  n = vec_elt (nm->nodes, node_index);
156  if (n->type == VLIB_NODE_TYPE_PROCESS)
157  {
159  r = &p->node_runtime;
160 
161  /* When disabling make sure flags are cleared. */
165  }
166  else
168 
169  ASSERT (new_state < VLIB_N_NODE_STATE);
170 
171  if (n->type == VLIB_NODE_TYPE_INPUT)
172  {
174  nm->input_node_counts_by_state[n->state] -= 1;
175  nm->input_node_counts_by_state[new_state] += 1;
176  }
177 
178  n->state = new_state;
179  r->state = new_state;
180 }
181 
182 /** \brief Get node dispatch state.
183  @param vm vlib_main_t pointer, varies by thread
184  @param node_index index of the node
185  @return state for node, see vlib_node_state_t
186 */
189 {
190  vlib_node_main_t *nm = &vm->node_main;
191  vlib_node_t *n;
192  n = vec_elt (nm->nodes, node_index);
193  return n->state;
194 }
195 
196 always_inline void
198 {
199  vlib_node_main_t *nm = &vm->node_main;
200  vlib_node_t *n = vec_elt (nm->nodes, node_index);
205 }
206 
209 {
210  vlib_node_main_t *nm = &vm->node_main;
212  return vec_elt (nm->processes, node->runtime_index);
213 }
214 
215 /* Fetches frame with given handle. */
218 {
219  vlib_frame_t *f;
220  f = vm->heap_aligned_base + (frame_index * VLIB_FRAME_ALIGN);
221  return f;
222 }
223 
226 {
227  uword i;
228 
229  ASSERT (((uword) f & (VLIB_FRAME_ALIGN - 1)) == 0);
230 
231  i = ((u8 *) f - (u8 *) vm->heap_aligned_base);
232  ASSERT ((i / VLIB_FRAME_ALIGN) <= 0xFFFFFFFFULL);
233 
234  return i / VLIB_FRAME_ALIGN;
235 }
236 
238 vlib_get_frame (vlib_main_t * vm, uword frame_index)
239 {
240  vlib_frame_t *f = vlib_get_frame_no_check (vm, frame_index);
242  return f;
243 }
244 
245 always_inline void
247 {
249 }
250 
253 {
255  ASSERT (vlib_get_frame (vm, i) == f);
256  return i;
257 }
258 
259 /* Byte alignment for vector arguments. */
260 #define VLIB_FRAME_VECTOR_ALIGN (1 << 4)
261 
264 {
265  return round_pow2 (sizeof (vlib_frame_t) + scalar_size,
267 }
268 
269 /** \brief Get pointer to frame vector data.
270  @param f vlib_frame_t pointer
271  @return pointer to first vector element in frame
272 */
273 always_inline void *
275 {
276  return (void *) f + vlib_frame_vector_byte_offset (f->scalar_size);
277 }
278 
279 /** \brief Get pointer to frame scalar data.
280 
281  @param f vlib_frame_t pointer
282 
283  @return arbitrary node scalar data
284 
285  @sa vlib_frame_vector_args
286 */
287 always_inline void *
289 {
290  return vlib_frame_vector_args (f) - f->scalar_size;
291 }
292 
295  vlib_node_runtime_t * n, u32 next_index)
296 {
297  vlib_node_main_t *nm = &vm->node_main;
298  vlib_next_frame_t *nf;
299 
300  ASSERT (next_index < n->n_next_nodes);
301  nf = vec_elt_at_index (nm->next_frames, n->next_frame_index + next_index);
302 
303  if (CLIB_DEBUG > 0)
304  {
305  vlib_node_t *node, *next;
306  node = vec_elt (nm->nodes, n->node_index);
307  next = vec_elt (nm->nodes, node->next_nodes[next_index]);
308  ASSERT (nf->node_runtime_index == next->runtime_index);
309  }
310 
311  return nf;
312 }
313 
314 /** \brief Get pointer to frame by (@c node_index, @c next_index).
315 
316  @warning This is not a function that you should call directly.
317  See @ref vlib_get_next_frame instead.
318 
319  @param vm vlib_main_t pointer, varies by thread
320  @param node_index index of the node
321  @param next_index graph arc index
322 
323  @return pointer to the requested vlib_next_frame_t
324 
325  @sa vlib_get_next_frame
326 */
327 
329 vlib_node_get_next_frame (vlib_main_t * vm, u32 node_index, u32 next_index)
330 {
331  vlib_node_main_t *nm = &vm->node_main;
332  vlib_node_t *n;
334 
335  n = vec_elt (nm->nodes, node_index);
337  return vlib_node_runtime_get_next_frame (vm, r, next_index);
338 }
339 
341  vlib_node_runtime_t * node,
342  u32 next_index,
343  u32 alloc_new_frame);
344 
345 #define vlib_get_next_frame_macro(vm,node,next_index,vectors,n_vectors_left,alloc_new_frame) \
346 do { \
347  vlib_frame_t * _f \
348  = vlib_get_next_frame_internal ((vm), (node), (next_index), \
349  (alloc_new_frame)); \
350  u32 _n = _f->n_vectors; \
351  (vectors) = vlib_frame_vector_args (_f) + _n * sizeof ((vectors)[0]); \
352  (n_vectors_left) = VLIB_FRAME_SIZE - _n; \
353 } while (0)
354 
355 
356 /** \brief Get pointer to next frame vector data by
357  (@c vlib_node_runtime_t, @c next_index).
358  Standard single/dual loop boilerplate element.
359  @attention This is a MACRO, with SIDE EFFECTS.
360 
361  @param vm vlib_main_t pointer, varies by thread
362  @param node current node vlib_node_runtime_t pointer
363  @param next_index requested graph arc index
364 
365  @return @c vectors -- pointer to next available vector slot
366  @return @c n_vectors_left -- number of vector slots available
367 */
368 #define vlib_get_next_frame(vm,node,next_index,vectors,n_vectors_left) \
369  vlib_get_next_frame_macro (vm, node, next_index, \
370  vectors, n_vectors_left, \
371  /* alloc new frame */ 0)
372 
373 #define vlib_get_new_next_frame(vm,node,next_index,vectors,n_vectors_left) \
374  vlib_get_next_frame_macro (vm, node, next_index, \
375  vectors, n_vectors_left, \
376  /* alloc new frame */ 1)
377 
378 /** \brief Release pointer to next frame vector data.
379  Standard single/dual loop boilerplate element.
380  @param vm vlib_main_t pointer, varies by thread
381  @param r current node vlib_node_runtime_t pointer
382  @param next_index graph arc index
383  @param n_packets_left number of slots still available in vector
384 */
385 void
388  u32 next_index, u32 n_packets_left);
389 
390 /* Combination get plus put. Returns vector argument just added. */
391 #define vlib_set_next_frame(vm,node,next_index,v) \
392 ({ \
393  uword _n_left; \
394  vlib_get_next_frame ((vm), (node), (next_index), (v), _n_left); \
395  ASSERT (_n_left > 0); \
396  vlib_put_next_frame ((vm), (node), (next_index), _n_left - 1); \
397  (v); \
398 })
399 
400 always_inline void
402  vlib_node_runtime_t * node,
403  u32 next_index, u32 buffer_index)
404 {
405  u32 *p;
406  p = vlib_set_next_frame (vm, node, next_index, p);
407  p[0] = buffer_index;
408 }
409 
410 vlib_frame_t *vlib_get_frame_to_node (vlib_main_t * vm, u32 to_node_index);
411 void vlib_put_frame_to_node (vlib_main_t * vm, u32 to_node_index,
412  vlib_frame_t * f);
413 
416 {
417  return vm->node_main.current_process_index != ~0;
418 }
419 
422 {
423  vlib_node_main_t *nm = &vm->node_main;
424  if (vlib_in_process_context (vm))
425  return vec_elt (nm->processes, nm->current_process_index);
426  return 0;
427 }
428 
431 {
433 }
434 
435 /** Returns TRUE if a process suspend time is less than 10us
436  @param dt - remaining poll time in seconds
437  @returns 1 if dt < 10e-6, 0 otherwise
438 */
441 {
442  return dt < 10e-6;
443 }
444 
445 /** Suspend a vlib cooperative multi-tasking thread for a period of time
446  @param vm - vlib_main_t *
447  @param dt - suspend interval in seconds
448  @returns VLIB_PROCESS_RESUME_LONGJMP_RESUME, routinely ignored
449 */
450 
453 {
454  uword r;
455  vlib_node_main_t *nm = &vm->node_main;
457 
460 
464  {
465  /* expiration time in 10us ticks */
466  p->resume_clock_interval = dt * 1e5;
468  }
469 
470  return r;
471 }
472 
473 always_inline void
475  uword is_one_time_event)
476 {
479  if (is_one_time_event)
481  clib_bitmap_andnoti (p->one_time_event_type_bitmap, t);
482 }
483 
484 always_inline void
486 {
489  vlib_process_free_event_type (p, t, /* is_one_time_event */ 1);
490 }
491 
492 always_inline void *
494  uword * return_event_type_opaque)
495 {
496  vlib_node_main_t *nm = &vm->node_main;
497  vlib_process_t *p;
499  uword t;
500  void *event_data_vector;
501 
502  p = vec_elt (nm->processes, nm->current_process_index);
503 
504  /* Find first type with events ready.
505  Return invalid type when there's nothing there. */
507  if (t == ~0)
508  return 0;
509 
511  clib_bitmap_andnoti (p->non_empty_event_type_bitmap, t);
512 
513  ASSERT (_vec_len (p->pending_event_data_by_type_index[t]) > 0);
514  event_data_vector = p->pending_event_data_by_type_index[t];
516 
517  et = pool_elt_at_index (p->event_type_pool, t);
518 
519  /* Return user's opaque value and possibly index. */
520  *return_event_type_opaque = et->opaque;
521 
523 
524  return event_data_vector;
525 }
526 
527 /* Return event data vector for later reuse. We reuse event data to avoid
528  repeatedly allocating event vectors in cases where we care about speed. */
529 always_inline void
530 vlib_process_put_event_data (vlib_main_t * vm, void *event_data)
531 {
532  vlib_node_main_t *nm = &vm->node_main;
533  vec_add1 (nm->recycled_event_data_vectors, event_data);
534 }
535 
536 /** Return the first event type which has occurred and a vector of per-event
537  data of that type, or a timeout indication
538 
539  @param vm - vlib_main_t pointer
540  @param data_vector - pointer to a (uword *) vector to receive event data
541  @returns either an event type and a vector of per-event instance data,
542  or ~0 to indicate a timeout.
543 */
544 
547 {
548  vlib_node_main_t *nm = &vm->node_main;
549  vlib_process_t *p;
551  uword r, t, l;
552 
553  p = vec_elt (nm->processes, nm->current_process_index);
554 
555  /* Find first type with events ready.
556  Return invalid type when there's nothing there. */
558  if (t == ~0)
559  return t;
560 
562  clib_bitmap_andnoti (p->non_empty_event_type_bitmap, t);
563 
564  l = _vec_len (p->pending_event_data_by_type_index[t]);
565  if (data_vector)
566  vec_add (*data_vector, p->pending_event_data_by_type_index[t], l);
567  _vec_len (p->pending_event_data_by_type_index[t]) = 0;
568 
569  et = pool_elt_at_index (p->event_type_pool, t);
570 
571  /* Return user's opaque value. */
572  r = et->opaque;
573 
575 
576  return r;
577 }
578 
581  uword ** data_vector)
582 {
583  uword l;
584 
586  clib_bitmap_andnoti (p->non_empty_event_type_bitmap, t);
587 
588  l = _vec_len (p->pending_event_data_by_type_index[t]);
589  if (data_vector)
590  vec_add (*data_vector, p->pending_event_data_by_type_index[t], l);
591  _vec_len (p->pending_event_data_by_type_index[t]) = 0;
592 
594 
595  return l;
596 }
597 
598 /* As above but query as specified type of event. Returns number of
599  events found. */
602  uword with_type_opaque)
603 {
604  vlib_node_main_t *nm = &vm->node_main;
605  vlib_process_t *p;
606  uword t, *h;
607 
608  p = vec_elt (nm->processes, nm->current_process_index);
609  h = hash_get (p->event_type_index_by_type_opaque, with_type_opaque);
610  if (!h)
611  /* This can happen when an event has not yet been
612  signaled with given opaque type. */
613  return 0;
614 
615  t = h[0];
617  return 0;
618 
619  return vlib_process_get_events_helper (p, t, data_vector);
620 }
621 
624 {
625  vlib_node_main_t *nm = &vm->node_main;
626  vlib_process_t *p;
627  uword r;
628 
629  p = vec_elt (nm->processes, nm->current_process_index);
631  {
633  r =
638  }
639 
640  return p->non_empty_event_type_bitmap;
641 }
642 
645  uword ** data_vector,
646  uword with_type_index)
647 {
648  vlib_node_main_t *nm = &vm->node_main;
649  vlib_process_t *p;
650  uword r;
651 
652  p = vec_elt (nm->processes, nm->current_process_index);
653  ASSERT (!pool_is_free_index (p->event_type_pool, with_type_index));
654  while (!clib_bitmap_get (p->non_empty_event_type_bitmap, with_type_index))
655  {
657  r =
662  }
663 
664  return vlib_process_get_events_helper (p, with_type_index, data_vector);
665 }
666 
669  uword ** data_vector,
670  uword with_type_opaque)
671 {
672  vlib_node_main_t *nm = &vm->node_main;
673  vlib_process_t *p;
674  uword r, *h;
675 
676  p = vec_elt (nm->processes, nm->current_process_index);
677  h = hash_get (p->event_type_index_by_type_opaque, with_type_opaque);
678  while (!h || !clib_bitmap_get (p->non_empty_event_type_bitmap, h[0]))
679  {
681  r =
686 
687  /* See if unknown event type has been signaled now. */
688  if (!h)
689  h = hash_get (p->event_type_index_by_type_opaque, with_type_opaque);
690  }
691 
692  return vlib_process_get_events_helper (p, h[0], data_vector);
693 }
694 
695 /** Suspend a cooperative multi-tasking thread
696  Waits for an event, or for the indicated number of seconds to elapse
697  @param vm - vlib_main_t pointer
698  @param dt - timeout, in seconds.
699  @returns the remaining time interval
700 */
701 
704 {
705  vlib_node_main_t *nm = &vm->node_main;
706  vlib_process_t *p;
707  f64 wakeup_time;
708  uword r;
709 
710  p = vec_elt (nm->processes, nm->current_process_index);
711 
714  return dt;
715 
716  wakeup_time = vlib_time_now (vm) + dt;
717 
718  /* Suspend waiting for both clock and event to occur. */
721 
724  {
725  p->resume_clock_interval = dt * 1e5;
727  }
728 
729  /* Return amount of time still left to sleep.
730  If <= 0 then we've been waken up by the clock (and not an event). */
731  return wakeup_time - vlib_time_now (vm);
732 }
733 
736 {
738  pool_get (p->event_type_pool, et);
739  et->opaque = with_type_opaque;
740  return et;
741 }
742 
745  uword with_type_opaque)
746 {
747  vlib_node_main_t *nm = &vm->node_main;
748  vlib_node_t *n = vlib_get_node (vm, node_index);
751  uword t;
752 
753  et = vlib_process_new_event_type (p, with_type_opaque);
754  t = et - p->event_type_pool;
756  clib_bitmap_ori (p->one_time_event_type_bitmap, t);
757  return t;
758 }
759 
760 always_inline void
762  uword t)
763 {
764  vlib_node_main_t *nm = &vm->node_main;
765  vlib_node_t *n = vlib_get_node (vm, node_index);
767 
769  vlib_process_free_event_type (p, t, /* is_one_time_event */ 1);
770 }
771 
772 always_inline void *
774  vlib_node_t * n,
775  vlib_process_t * p,
776  uword t,
777  uword n_data_elts, uword n_data_elt_bytes)
778 {
779  uword p_flags, add_to_pending, delete_from_wheel;
780  void *data_to_be_written_by_caller;
781 
783 
785 
787 
788  /* Resize data vector and return caller's data to be written. */
789  {
790  void *data_vec = p->pending_event_data_by_type_index[t];
791  uword l;
792 
793  if (!data_vec && vec_len (nm->recycled_event_data_vectors))
794  {
795  data_vec = vec_pop (nm->recycled_event_data_vectors);
796  _vec_len (data_vec) = 0;
797  }
798 
799  l = vec_len (data_vec);
800 
801  data_vec = _vec_resize (data_vec,
802  /* length_increment */ n_data_elts,
803  /* total size after increment */
804  (l + n_data_elts) * n_data_elt_bytes,
805  /* header_bytes */ 0, /* data_align */ 0);
806 
807  p->pending_event_data_by_type_index[t] = data_vec;
808  data_to_be_written_by_caller = data_vec + l * n_data_elt_bytes;
809  }
810 
812  clib_bitmap_ori (p->non_empty_event_type_bitmap, t);
813 
814  p_flags = p->flags;
815 
816  /* Event was already signalled? */
817  add_to_pending = (p_flags & VLIB_PROCESS_RESUME_PENDING) == 0;
818 
819  /* Process will resume when suspend time elapses? */
820  delete_from_wheel = 0;
822  {
823  /* Waiting for both event and clock? */
825  {
827  ((TWT (tw_timer_wheel) *) nm->timing_wheel,
828  p->stop_timer_handle))
829  delete_from_wheel = 1;
830  else
831  /* timer just popped so process should already be on the list */
832  add_to_pending = 0;
833  }
834  else
835  /* Waiting only for clock. Event will be queue and may be
836  handled when timer expires. */
837  add_to_pending = 0;
838  }
839 
840  /* Never add current process to pending vector since current process is
841  already running. */
842  add_to_pending &= nm->current_process_index != n->runtime_index;
843 
844  if (add_to_pending)
845  {
847  p->flags = p_flags | VLIB_PROCESS_RESUME_PENDING;
849  if (delete_from_wheel)
850  TW (tw_timer_stop) ((TWT (tw_timer_wheel) *) nm->timing_wheel,
851  p->stop_timer_handle);
852  }
853 
854  return data_to_be_written_by_caller;
855 }
856 
857 always_inline void *
859  uword node_index,
860  uword type_opaque,
861  uword n_data_elts, uword n_data_elt_bytes)
862 {
863  vlib_node_main_t *nm = &vm->node_main;
864  vlib_node_t *n = vlib_get_node (vm, node_index);
866  uword *h, t;
867 
868  /* Must be in main thread */
869  ASSERT (vlib_get_thread_index () == 0);
870 
871  h = hash_get (p->event_type_index_by_type_opaque, type_opaque);
872  if (!h)
873  {
875  vlib_process_new_event_type (p, type_opaque);
876  t = et - p->event_type_pool;
877  hash_set (p->event_type_index_by_type_opaque, type_opaque, t);
878  }
879  else
880  t = h[0];
881 
882  return vlib_process_signal_event_helper (nm, n, p, t, n_data_elts,
883  n_data_elt_bytes);
884 }
885 
886 always_inline void *
888  f64 dt,
889  uword node_index,
890  uword type_opaque,
891  uword n_data_elts, uword n_data_elt_bytes)
892 {
893  vlib_node_main_t *nm = &vm->node_main;
894  vlib_node_t *n = vlib_get_node (vm, node_index);
896  uword *h, t;
897 
898  h = hash_get (p->event_type_index_by_type_opaque, type_opaque);
899  if (!h)
900  {
902  vlib_process_new_event_type (p, type_opaque);
903  t = et - p->event_type_pool;
904  hash_set (p->event_type_index_by_type_opaque, type_opaque, t);
905  }
906  else
907  t = h[0];
908 
910  return vlib_process_signal_event_helper (nm, n, p, t, n_data_elts,
911  n_data_elt_bytes);
912  else
913  {
915 
916  pool_get_aligned (nm->signal_timed_event_data_pool, te, sizeof (te[0]));
917 
918  te->n_data_elts = n_data_elts;
919  te->n_data_elt_bytes = n_data_elt_bytes;
920  te->n_data_bytes = n_data_elts * n_data_elt_bytes;
921 
922  /* Assert that structure fields are big enough. */
923  ASSERT (te->n_data_elts == n_data_elts);
924  ASSERT (te->n_data_elt_bytes == n_data_elt_bytes);
925  ASSERT (te->n_data_bytes == n_data_elts * n_data_elt_bytes);
926 
928  te->event_type_index = t;
929 
930  p->stop_timer_handle =
931  TW (tw_timer_start) ((TWT (tw_timer_wheel) *) nm->timing_wheel,
933  (te - nm->signal_timed_event_data_pool),
934  0 /* timer_id */ ,
935  (vlib_time_now (vm) + dt) * 1e5);
936 
937  /* Inline data big enough to hold event? */
938  if (te->n_data_bytes < sizeof (te->inline_event_data))
939  return te->inline_event_data;
940  else
941  {
942  te->event_data_as_vector = 0;
944  return te->event_data_as_vector;
945  }
946  }
947 }
948 
949 always_inline void *
951  uword node_index,
952  uword type_index,
953  uword n_data_elts,
954  uword n_data_elt_bytes)
955 {
956  vlib_node_main_t *nm = &vm->node_main;
957  vlib_node_t *n = vlib_get_node (vm, node_index);
959  return vlib_process_signal_event_helper (nm, n, p, type_index, n_data_elts,
960  n_data_elt_bytes);
961 }
962 
963 always_inline void
965  uword node_index, uword type_opaque, uword data)
966 {
967  uword *d = vlib_process_signal_event_data (vm, node_index, type_opaque,
968  1 /* elts */ , sizeof (uword));
969  d[0] = data;
970 }
971 
972 always_inline void
974  uword node_index,
975  uword type_opaque, void *data)
976 {
977  void **d = vlib_process_signal_event_data (vm, node_index, type_opaque,
978  1 /* elts */ , sizeof (data));
979  d[0] = data;
980 }
981 
982 /**
983  * Signal event to process from any thread.
984  *
985  * When in doubt, use this.
986  */
987 always_inline void
989  uword node_index, uword type_opaque, uword data)
990 {
991  if (vlib_get_thread_index () != 0)
992  {
994  .node_index = node_index,
995  .type_opaque = type_opaque,
996  .data = data,
997  };
999  (u8 *) & args, sizeof (args));
1000  }
1001  else
1002  vlib_process_signal_event (vm, node_index, type_opaque, data);
1003 }
1004 
1005 always_inline void
1007  uword node_index,
1008  uword type_index, uword data)
1009 {
1010  uword *d =
1011  vlib_process_signal_one_time_event_data (vm, node_index, type_index,
1012  1 /* elts */ , sizeof (uword));
1013  d[0] = data;
1014 }
1015 
1016 always_inline void
1019 {
1021  /* data */ ~0);
1022  clib_memset (p, ~0, sizeof (p[0]));
1023 }
1024 
1025 always_inline void
1028  ** wps)
1029 {
1032  vec_free (*wps);
1033 }
1034 
1035 always_inline void
1038  * p)
1039 {
1040  p->node_index = vlib_current_process (vm);
1041  p->one_time_event = vlib_process_create_one_time_event (vm, p->node_index, /* type opaque */
1042  ~0);
1044  /* don't care about data */ 0,
1045  p->one_time_event);
1046 }
1047 
1048 always_inline void
1051  ** wps)
1052 {
1054  vec_add2 (*wps, wp, 1);
1056 }
1057 
1060  vlib_node_runtime_t * node,
1061  uword n_vectors)
1062 {
1063  u32 i, d, vi0, vi1;
1064  u32 i0, i1;
1065 
1068  & (ARRAY_LEN (node->main_loop_vector_stats) - 1));
1069  i0 = i ^ 0;
1070  i1 = i ^ 1;
1072  -
1075  vi0 = node->main_loop_vector_stats[i0];
1076  vi1 = node->main_loop_vector_stats[i1];
1077  vi0 = d == 0 ? vi0 : 0;
1078  vi1 = d <= 1 ? vi1 : 0;
1079  vi0 += n_vectors;
1080  node->main_loop_vector_stats[i0] = vi0;
1081  node->main_loop_vector_stats[i1] = vi1;
1083  /* Return previous counter. */
1084  return node->main_loop_vector_stats[i1];
1085 }
1086 
1089 {
1090  vlib_node_runtime_t *rt = vlib_node_get_runtime (vm, node_index);
1091  u32 v;
1092 
1093  v = vlib_node_runtime_update_main_loop_vector_stats (vm, rt, /* n_vectors */
1094  0);
1095  return (f64) v / (1 << VLIB_LOG2_MAIN_LOOPS_PER_STATS_UPDATE);
1096 }
1097 
1100 {
1101  vlib_node_runtime_t *rt = vlib_node_get_runtime (vm, node_index);
1102  u32 v;
1103 
1104  v = vlib_node_runtime_update_main_loop_vector_stats (vm, rt, /* n_vectors */
1105  0);
1107 }
1108 
1109 void
1111 
1112 /* Return the edge index if present, ~0 otherwise */
1113 uword vlib_node_get_next (vlib_main_t * vm, uword node, uword next_node);
1114 
1115 /* Add next node to given node in given slot. */
1116 uword
1118  uword node, uword next_node, uword slot);
1119 
1120 /* As above but adds to end of node's next vector. */
1123 {
1124  return vlib_node_add_next_with_slot (vm, node, next_node, ~0);
1125 }
1126 
1127 /* Add next node to given node in given slot. */
1128 uword
1130  uword node, char *next_name, uword slot);
1131 
1132 /* As above but adds to end of node's next vector. */
1135 {
1136  return vlib_node_add_named_next_with_slot (vm, node, name, ~0);
1137 }
1138 
1139 /**
1140  * Get list of nodes
1141  */
1142 void
1143 vlib_node_get_nodes (vlib_main_t * vm, u32 max_threads, int include_stats,
1144  int barrier_sync, vlib_node_t **** node_dupsp,
1145  vlib_main_t *** stat_vmsp);
1146 
1147 /* Query node given name. */
1149 
1150 /* Rename a node. */
1151 void vlib_node_rename (vlib_main_t * vm, u32 node_index, char *fmt, ...);
1152 
1153 /* Register new packet processing node. Nodes can be registered
1154  dynamically via this call or statically via the VLIB_REGISTER_NODE
1155  macro. */
1157 
1158 /* Register all static nodes registered via VLIB_REGISTER_NODE. */
1160 
1161 /* Start a process. */
1162 void vlib_start_process (vlib_main_t * vm, uword process_index);
1163 
1164 /* Sync up runtime and main node stats. */
1166 
1167 /* Node graph initialization function. */
1169 
1176 /* Parse node name -> node index. */
1178 
1179 always_inline void
1181  u32 counter_index, u64 increment)
1182 {
1183  vlib_node_t *n = vlib_get_node (vm, node_index);
1184  vlib_error_main_t *em = &vm->error_main;
1185  u32 node_counter_base_index = n->error_heap_index;
1186  em->counters[node_counter_base_index + counter_index] += increment;
1187 }
1188 
1189 #endif /* included_vlib_node_funcs_h */
1190 
1191 /*
1192  * fd.io coding-style-patch-verification: ON
1193  *
1194  * Local Variables:
1195  * eval: (c-set-style "gnu")
1196  * End:
1197  */
u32 * next_nodes
Definition: node.h:333
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:439
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
static void vlib_process_free_event_type(vlib_process_t *p, uword t, uword is_one_time_event)
Definition: node_funcs.h:474
u32 error_heap_index
Definition: node.h:323
u32 next_frame_index
Start of next frames for this node.
Definition: node.h:492
#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:1026
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:329
static void vlib_signal_one_time_waiting_process(vlib_main_t *vm, vlib_one_time_waiting_process_t *p)
Definition: node_funcs.h:1017
vlib_process_t ** processes
Definition: node.h:739
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:703
format_function_t format_vlib_node_name
Definition: node_funcs.h:1171
static f64 vlib_node_vectors_per_main_loop_as_float(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:1088
vlib_node_runtime_t node_runtime
Definition: node.h:553
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:198
u8 runtime_data[0]
Function dependent node-runtime data.
Definition: node.h:522
static uword * vlib_process_wait_for_event(vlib_main_t *vm)
Definition: node_funcs.h:623
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:401
static uword vlib_current_process(vlib_main_t *vm)
Definition: node_funcs.h:430
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:197
#define clib_memcpy_fast(a, b, c)
Definition: string.h:81
static uword vlib_node_add_named_next(vlib_main_t *vm, uword node, char *name)
Definition: node_funcs.h:1134
clib_memset(h->entries, 0, sizeof(h->entries[0]) *entries)
static f64 vlib_time_now(vlib_main_t *vm)
Definition: main.h:255
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:506
void ** pending_event_data_by_type_index
Definition: node.h:584
u32 current_process_index
Definition: node.h:742
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:522
#define vlib_set_next_frame(vm, node, next_index, v)
Definition: node_funcs.h:391
void vlib_process_signal_event_mt_helper(vlib_process_signal_event_mt_args_t *args)
Definition: threads.c:1814
#define vec_add2(V, P, N)
Add N elements to end of vector V, return pointer to new elements in P.
Definition: vec.h:560
int i
#define STRUCT_OFFSET_OF(t, f)
Definition: clib.h:65
void clib_longjmp(clib_longjmp_t *save, uword return_value)
format_function_t format_vlib_cpu_time
Definition: node_funcs.h:1174
u8 data[128]
Definition: ipsec.api:248
clib_spinlock_t pending_interrupt_lock
Definition: node.h:712
void * runtime_data
Definition: node.h:285
#define pool_get(P, E)
Allocate an object E from a pool P (unspecified alignment).
Definition: pool.h:236
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:1122
unsigned char u8
Definition: types.h:56
#define vec_pop(V)
Returns last element of a vector and decrements its length.
Definition: vec.h:615
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:440
static vlib_frame_t * vlib_get_frame_no_check(vlib_main_t *vm, uword frame_index)
Definition: node_funcs.h:217
static vlib_process_event_type_t * vlib_process_new_event_type(vlib_process_t *p, uword with_type_opaque)
Definition: node_funcs.h:735
double f64
Definition: types.h:142
u8 state
Definition: node.h:307
#define vec_add(V, E, N)
Add N elements to end of vector V (no header, unspecified alignment)
Definition: vec.h:598
u8 *() format_function_t(u8 *s, va_list *args)
Definition: format.h:48
u32 * pending_interrupt_node_runtime_indices
Definition: node.h:711
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:452
u32 main_loop_count_last_dispatch
Saved main loop counter of last dispatch of this node.
Definition: node.h:503
void vlib_node_rename(vlib_main_t *vm, u32 node_index, char *fmt,...)
Definition: node.c:102
#define VLIB_FRAME_NO_APPEND
Definition: node.h:417
void ** recycled_event_data_vectors
Definition: node.h:748
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:546
#define always_inline
Definition: clib.h:98
format_function_t format_vlib_node_and_next
Definition: node_funcs.h:1173
static uword clib_bitmap_is_zero(uword *ai)
predicate function; is an entire bitmap empty?
Definition: bitmap.h:57
void * heap_aligned_base
Definition: main.h:123
vlib_node_t ** nodes
Definition: node.h:698
#define VLIB_LOG2_MAIN_LOOPS_PER_STATS_UPDATE
Definition: main.h:101
#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:377
format_function_t format_vlib_next_node_name
Definition: node_funcs.h:1172
#define VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_CLOCK
Definition: node.h:567
#define vec_resize(V, N)
Resize a vector (no header, unspecified alignment) Add N elements to end of given vector V...
Definition: vec.h:242
void vlib_frame_free(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_frame_t *f)
Definition: main.c:218
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:761
vlib_node_runtime_t * nodes_by_type[VLIB_N_NODE_TYPE]
Definition: node.h:708
int TW() tw_timer_handle_is_free(TWT(tw_timer_wheel) *tw, u32 handle)
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:294
static vlib_node_state_t vlib_node_get_state(vlib_main_t *vm, u32 node_index)
Get node dispatch state.
Definition: node_funcs.h:188
clib_error_t * vlib_node_main_init(vlib_main_t *vm)
Definition: node.c:631
#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:514
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:773
u16 state
Input node state.
Definition: node.h:510
u32 vlib_register_node(vlib_main_t *vm, vlib_node_registration_t *r)
Definition: node.c:520
static void vlib_process_signal_event(vlib_main_t *vm, uword node_index, uword type_opaque, uword data)
Definition: node_funcs.h:964
vlib_signal_timed_event_data_t * signal_timed_event_data_pool
Definition: node.h:729
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:158
static u32 vlib_frame_index(vlib_main_t *vm, vlib_frame_t *f)
Definition: node_funcs.h:252
u16 frame_flags
Definition: node.h:383
#define VLIB_FRAME_IS_ALLOCATED
Definition: node.h:424
static void vlib_process_maybe_free_event_type(vlib_process_t *p, uword t)
Definition: node_funcs.h:485
#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:858
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:1006
static vlib_frame_t * vlib_get_frame(vlib_main_t *vm, uword frame_index)
Definition: node_funcs.h:238
u32 node_index
Node index.
Definition: node.h:495
uword() unformat_function_t(unformat_input_t *input, va_list *args)
Definition: format.h:232
#define VLIB_PROCESS_RESUME_LONGJMP_RESUME
Definition: node.h:564
u8 name[64]
Definition: memclnt.api:152
static u32 counter_index(vlib_main_t *vm, vlib_error_t e)
Definition: drop.c:67
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1180
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P with alignment A.
Definition: pool.h:230
static uword vlib_process_get_events_with_type(vlib_main_t *vm, uword **data_vector, uword with_type_opaque)
Definition: node_funcs.h:601
static u32 vlib_frame_index_no_check(vlib_main_t *vm, vlib_frame_t *f)
Definition: node_funcs.h:225
#define VLIB_FRAME_VECTOR_ALIGN
Definition: node_funcs.h:260
u64 * counters
Definition: error.h:48
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:1059
static void vlib_process_signal_event_pointer(vlib_main_t *vm, uword node_index, uword type_opaque, void *data)
Definition: node_funcs.h:973
u8 inline_event_data[64 - 3 *sizeof(u32) - 2 *sizeof(u16)]
Definition: node.h:663
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:887
u32 runtime_index
Definition: node.h:282
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:212
static vlib_process_t * vlib_get_current_process(vlib_main_t *vm)
Definition: node_funcs.h:421
#define VLIB_PROCESS_RESUME_LONGJMP_SUSPEND
Definition: node.h:563
static uword vlib_process_wait_for_one_time_event(vlib_main_t *vm, uword **data_vector, uword with_type_index)
Definition: node_funcs.h:644
#define vec_free(V)
Free vector&#39;s memory (no header).
Definition: vec.h:341
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:988
#define VLIB_PROCESS_RESUME_PENDING
Definition: node.h:570
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
static uword vlib_process_create_one_time_event(vlib_main_t *vm, uword node_index, uword with_type_opaque)
Definition: node_funcs.h:744
uword vlib_node_add_next_with_slot(vlib_main_t *vm, uword node, uword next_node, uword slot)
Definition: node.c:205
static void * vlib_frame_scalar_args(vlib_frame_t *f)
Get pointer to frame scalar data.
Definition: node_funcs.h:288
#define pool_is_free_index(P, I)
Use free bitmap to query whether given index is free.
Definition: pool.h:283
static u32 vlib_frame_vector_byte_offset(u32 scalar_size)
Definition: node_funcs.h:263
#define ARRAY_LEN(x)
Definition: clib.h:62
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:241
uword * one_time_event_type_bitmap
Definition: node.h:590
static u32 vlib_node_vectors_per_main_loop_as_integer(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:1099
void vlib_start_process(vlib_main_t *vm, uword process_index)
Definition: main.c:1584
#define pool_put_index(p, i)
Free pool element with given index.
Definition: pool.h:311
#define ASSERT(truth)
static uword vlib_process_get_events_helper(vlib_process_t *p, uword t, uword **data_vector)
Definition: node_funcs.h:580
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:148
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:363
static uword is_pow2(uword x)
Definition: clib.h:235
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:1049
#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:593
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:465
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:493
vlib_process_event_type_t * event_type_pool
Definition: node.h:597
u32 * data_from_advancing_timing_wheel
Definition: node.h:732
#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:1825
u32 input_node_counts_by_state[VLIB_N_NODE_STATE]
Definition: node.h:751
vlib_node_main_t node_main
Definition: main.h:135
static uword vlib_process_wait_for_event_with_type(vlib_main_t *vm, uword **data_vector, uword with_type_opaque)
Definition: node_funcs.h:668
u64 uword
Definition: types.h:112
format_function_t format_vlib_time
Definition: node_funcs.h:1175
vlib_next_frame_t * next_frames
Definition: node.h:721
static u32 vlib_timing_wheel_data_set_timed_event(u32 i)
Definition: node.h:684
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:274
u32 stop_timer_handle
Definition: node.h:606
uword * event_type_index_by_type_opaque
Definition: node.h:594
unformat_function_t unformat_vlib_node
Definition: node_funcs.h:1177
u64 resume_clock_interval
Definition: node.h:603
u16 flags
Definition: node.h:566
static uword vlib_in_process_context(vlib_main_t *vm)
Definition: node_funcs.h:415
vlib_node_type_t type
Definition: node.h:276
static vlib_process_t * vlib_get_process_from_node(vlib_main_t *vm, vlib_node_t *node)
Definition: node_funcs.h:208
vlib_node_state_t
Definition: node.h:249
u32 TW() tw_timer_start(TWT(tw_timer_wheel) *tw, u32 user_id, u32 timer_id, u64 interval)
Start a Tw Timer.
static void vlib_process_put_event_data(vlib_main_t *vm, void *event_data)
Definition: node_funcs.h:530
void vlib_register_all_static_nodes(vlib_main_t *vm)
Definition: node.c:540
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:568
#define vec_foreach(var, vec)
Vector iterator.
clib_longjmp_t return_longjmp
Definition: node.h:556
u32 node_runtime_index
Definition: node.h:407
static void vlib_frame_no_append(vlib_frame_t *f)
Definition: node_funcs.h:246
u8 scalar_size
Definition: node.h:389
clib_longjmp_t resume_longjmp
Definition: node.h:562
#define TW(a)
static u32 vlib_timing_wheel_data_set_suspended_process(u32 i)
Definition: node.h:678
u32 main_loop_count
Definition: main.h:84
static_always_inline void clib_spinlock_lock_if_init(clib_spinlock_t *p)
Definition: lock.h:82
void * timing_wheel
Definition: node.h:727
vlib_frame_t * vlib_get_frame_to_node(vlib_main_t *vm, u32 to_node_index)
Definition: main.c:189
u8 runtime_data_bytes
Definition: node.h:310
void TW() tw_timer_stop(TWT(tw_timer_wheel) *tw, u32 handle)
Stop a tw timer.
format_function_t format_vlib_node_graph
Definition: node_funcs.h:1170
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:1036
uword * non_empty_event_type_bitmap
Definition: node.h:587
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:950
#define VLIB_PROCESS_RETURN_LONGJMP_SUSPEND
Definition: node.h:559
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:569