FD.io VPP  v17.07.01-10-g3be13f0
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>
49 
50 /** \brief Get vlib node by index.
51  @warning This function will ASSERT if @c i is out of range.
52  @param vm vlib_main_t pointer, varies by thread
53  @param i node index.
54  @return pointer to the requested vlib_node_t.
55 */
56 
59 {
60  return vec_elt (vm->node_main.nodes, i);
61 }
62 
63 /** \brief Get vlib node by graph arc (next) index.
64  @param vm vlib_main_t pointer, varies by thread
65  @param node_index index of original node
66  @param next_index graph arc index
67  @return pointer to the vlib_node_t at the end of the indicated arc
68 */
69 
71 vlib_get_next_node (vlib_main_t * vm, u32 node_index, u32 next_index)
72 {
73  vlib_node_main_t *nm = &vm->node_main;
74  vlib_node_t *n;
75 
76  n = vec_elt (nm->nodes, node_index);
77  ASSERT (next_index < vec_len (n->next_nodes));
78  return vlib_get_node (vm, n->next_nodes[next_index]);
79 }
80 
81 /** \brief Get node runtime by node index.
82  @param vm vlib_main_t pointer, varies by thread
83  @param node_index index of node
84  @return pointer to the indicated vlib_node_runtime_t
85 */
86 
89 {
90  vlib_node_main_t *nm = &vm->node_main;
91  vlib_node_t *n = vec_elt (nm->nodes, node_index);
92  vlib_process_t *p;
93  if (n->type != VLIB_NODE_TYPE_PROCESS)
94  return vec_elt_at_index (nm->nodes_by_type[n->type], n->runtime_index);
95  else
96  {
97  p = vec_elt (nm->processes, n->runtime_index);
98  return &p->node_runtime;
99  }
100 }
101 
102 /** \brief Get node runtime private data by node index.
103  @param vm vlib_main_t pointer, varies by thread
104  @param node_index index of the node
105  @return pointer to the indicated vlib_node_runtime_t private data
106 */
107 
108 always_inline void *
110 {
111  vlib_node_runtime_t *r = vlib_node_get_runtime (vm, node_index);
112  return r->runtime_data;
113 }
114 
115 /** \brief Set node runtime private data.
116  @param vm vlib_main_t pointer, varies by thread
117  @param node_index index of the node
118  @param runtime_data arbitrary runtime private data
119  @param n_runtime_data_bytes size of runtime private data
120 */
121 
122 always_inline void
124  void *runtime_data, u32 n_runtime_data_bytes)
125 {
126  vlib_node_t *n = vlib_get_node (vm, node_index);
127  vlib_node_runtime_t *r = vlib_node_get_runtime (vm, node_index);
128 
129  n->runtime_data_bytes = n_runtime_data_bytes;
130  vec_free (n->runtime_data);
131  vec_add (n->runtime_data, runtime_data, n_runtime_data_bytes);
132 
133  ASSERT (vec_len (n->runtime_data) <= sizeof (vlib_node_runtime_t) -
134  STRUCT_OFFSET_OF (vlib_node_runtime_t, runtime_data));
135 
136  if (vec_len (n->runtime_data) > 0)
138 }
139 
140 /** \brief Set node dispatch state.
141  @param vm vlib_main_t pointer, varies by thread
142  @param node_index index of the node
143  @param new_state new state for node, see vlib_node_state_t
144 */
145 always_inline void
147  vlib_node_state_t new_state)
148 {
149  vlib_node_main_t *nm = &vm->node_main;
150  vlib_node_t *n;
152 
153  n = vec_elt (nm->nodes, node_index);
154  if (n->type == VLIB_NODE_TYPE_PROCESS)
155  {
157  r = &p->node_runtime;
158 
159  /* When disabling make sure flags are cleared. */
163  }
164  else
166 
167  ASSERT (new_state < VLIB_N_NODE_STATE);
168 
169  if (n->type == VLIB_NODE_TYPE_INPUT)
170  {
172  nm->input_node_counts_by_state[n->state] -= 1;
173  nm->input_node_counts_by_state[new_state] += 1;
174  }
175 
176  n->state = new_state;
177  r->state = new_state;
178 }
179 
180 /** \brief Get node dispatch state.
181  @param vm vlib_main_t pointer, varies by thread
182  @param node_index index of the node
183  @return state for node, see vlib_node_state_t
184 */
187 {
188  vlib_node_main_t *nm = &vm->node_main;
189  vlib_node_t *n;
190  n = vec_elt (nm->nodes, node_index);
191  return n->state;
192 }
193 
194 always_inline void
196 {
197  vlib_node_main_t *nm = &vm->node_main;
198  vlib_node_t *n = vec_elt (nm->nodes, node_index);
203 }
204 
207 {
208  vlib_node_main_t *nm = &vm->node_main;
210  return vec_elt (nm->processes, node->runtime_index);
211 }
212 
213 /* Fetches frame with given handle. */
216 {
217  vlib_frame_t *f;
218  u32 thread_index = frame_index & VLIB_CPU_MASK;
219  u32 offset = frame_index & VLIB_OFFSET_MASK;
220  vm = vlib_mains[thread_index];
221  f = vm->heap_base + offset;
222  return f;
223 }
224 
227 {
228  u32 i;
229 
230  ASSERT (((uword) f & VLIB_CPU_MASK) == 0);
231 
232  vm = vlib_mains[f->thread_index];
233 
234  i = ((u8 *) f - (u8 *) vm->heap_base);
235  return i | f->thread_index;
236 }
237 
239 vlib_get_frame (vlib_main_t * vm, uword frame_index)
240 {
241  vlib_frame_t *f = vlib_get_frame_no_check (vm, frame_index);
243  return f;
244 }
245 
248 {
250  ASSERT (vlib_get_frame (vm, i) == f);
251  return i;
252 }
253 
254 /* Byte alignment for vector arguments. */
255 #define VLIB_FRAME_VECTOR_ALIGN (1 << 4)
256 
259 {
260  return round_pow2 (sizeof (vlib_frame_t) + scalar_size,
262 }
263 
264 /** \brief Get pointer to frame vector data.
265  @param f vlib_frame_t pointer
266  @return pointer to first vector element in frame
267 */
268 always_inline void *
270 {
271  return (void *) f + vlib_frame_vector_byte_offset (f->scalar_size);
272 }
273 
274 /** \brief Get pointer to frame scalar data.
275 
276  @warning This is almost certainly not the function you wish to call.
277  See @ref vlib_frame_vector_args instead.
278 
279  @param f vlib_frame_t pointer
280 
281  @return arbitrary node scalar data
282 
283  @sa vlib_frame_vector_args
284 */
285 always_inline void *
287 {
288  return vlib_frame_vector_args (f) - f->scalar_size;
289 }
290 
293  vlib_node_runtime_t * n, u32 next_index)
294 {
295  vlib_node_main_t *nm = &vm->node_main;
296  vlib_next_frame_t *nf;
297 
298  ASSERT (next_index < n->n_next_nodes);
299  nf = vec_elt_at_index (nm->next_frames, n->next_frame_index + next_index);
300 
301  if (CLIB_DEBUG > 0)
302  {
303  vlib_node_t *node, *next;
304  node = vec_elt (nm->nodes, n->node_index);
305  next = vec_elt (nm->nodes, node->next_nodes[next_index]);
306  ASSERT (nf->node_runtime_index == next->runtime_index);
307  }
308 
309  return nf;
310 }
311 
312 /** \brief Get pointer to frame by (@c node_index, @c next_index).
313 
314  @warning This is not a function that you should call directly.
315  See @ref vlib_get_next_frame instead.
316 
317  @param vm vlib_main_t pointer, varies by thread
318  @param node_index index of the node
319  @param next_index graph arc index
320 
321  @return pointer to the requested vlib_next_frame_t
322 
323  @sa vlib_get_next_frame
324 */
325 
327 vlib_node_get_next_frame (vlib_main_t * vm, u32 node_index, u32 next_index)
328 {
329  vlib_node_main_t *nm = &vm->node_main;
330  vlib_node_t *n;
332 
333  n = vec_elt (nm->nodes, node_index);
335  return vlib_node_runtime_get_next_frame (vm, r, next_index);
336 }
337 
339  vlib_node_runtime_t * node,
340  u32 next_index,
341  u32 alloc_new_frame);
342 
343 #define vlib_get_next_frame_macro(vm,node,next_index,vectors,n_vectors_left,alloc_new_frame) \
344 do { \
345  vlib_frame_t * _f \
346  = vlib_get_next_frame_internal ((vm), (node), (next_index), \
347  (alloc_new_frame)); \
348  u32 _n = _f->n_vectors; \
349  (vectors) = vlib_frame_vector_args (_f) + _n * sizeof ((vectors)[0]); \
350  (n_vectors_left) = VLIB_FRAME_SIZE - _n; \
351 } while (0)
352 
353 
354 /** \brief Get pointer to next frame vector data by
355  (@c vlib_node_runtime_t, @c next_index).
356  Standard single/dual loop boilerplate element.
357  @attention This is a MACRO, with SIDE EFFECTS.
358 
359  @param vm vlib_main_t pointer, varies by thread
360  @param node current node vlib_node_runtime_t pointer
361  @param next_index requested graph arc index
362 
363  @return @c vectors -- pointer to next available vector slot
364  @return @c n_vectors_left -- number of vector slots available
365 */
366 #define vlib_get_next_frame(vm,node,next_index,vectors,n_vectors_left) \
367  vlib_get_next_frame_macro (vm, node, next_index, \
368  vectors, n_vectors_left, \
369  /* alloc new frame */ 0)
370 
371 #define vlib_get_new_next_frame(vm,node,next_index,vectors,n_vectors_left) \
372  vlib_get_next_frame_macro (vm, node, next_index, \
373  vectors, n_vectors_left, \
374  /* alloc new frame */ 1)
375 
376 /** \brief Release pointer to next frame vector data.
377  Standard single/dual loop boilerplate element.
378  @param vm vlib_main_t pointer, varies by thread
379  @param r current node vlib_node_runtime_t pointer
380  @param next_index graph arc index
381  @param n_packets_left number of slots still available in vector
382 */
383 void
386  u32 next_index, u32 n_packets_left);
387 
388 /* Combination get plus put. Returns vector argument just added. */
389 #define vlib_set_next_frame(vm,node,next_index,v) \
390 ({ \
391  uword _n_left; \
392  vlib_get_next_frame ((vm), (node), (next_index), (v), _n_left); \
393  ASSERT (_n_left > 0); \
394  vlib_put_next_frame ((vm), (node), (next_index), _n_left - 1); \
395  (v); \
396 })
397 
398 always_inline void
400  vlib_node_runtime_t * node,
401  u32 next_index, u32 buffer_index)
402 {
403  u32 *p;
404  p = vlib_set_next_frame (vm, node, next_index, p);
405  p[0] = buffer_index;
406 }
407 
408 vlib_frame_t *vlib_get_frame_to_node (vlib_main_t * vm, u32 to_node_index);
409 void vlib_put_frame_to_node (vlib_main_t * vm, u32 to_node_index,
410  vlib_frame_t * f);
411 
414 {
415  vlib_node_main_t *nm = &vm->node_main;
416  return vec_elt (nm->processes, nm->current_process_index);
417 }
418 
421 {
422  return vm->node_main.current_process_index != ~0;
423 }
424 
427 {
429 }
430 
431 /** Returns TRUE if a process suspend time is less than 1us
432  @param dt - remaining poll time in seconds
433  @returns 1 if dt < 1e-6, 0 otherwise
434 */
437 {
438  return dt < 1e-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  u64 dt_cpu = dt * vm->clib_time.clocks_per_second;
454 
457 
461  {
462  p->resume_cpu_time = clib_cpu_time_now () + dt_cpu;
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  {
722  + (dt * vm->clib_time.clocks_per_second));
724  }
725 
726  /* Return amount of time still left to sleep.
727  If <= 0 then we've been waken up by the clock (and not an event). */
728  return wakeup_time - vlib_time_now (vm);
729 }
730 
733 {
735  pool_get (p->event_type_pool, et);
736  et->opaque = with_type_opaque;
737  return et;
738 }
739 
742  uword with_type_opaque)
743 {
744  vlib_node_main_t *nm = &vm->node_main;
745  vlib_node_t *n = vlib_get_node (vm, node_index);
748  uword t;
749 
750  et = vlib_process_new_event_type (p, with_type_opaque);
751  t = et - p->event_type_pool;
753  clib_bitmap_ori (p->one_time_event_type_bitmap, t);
754  return t;
755 }
756 
757 always_inline void
759  uword t)
760 {
761  vlib_node_main_t *nm = &vm->node_main;
762  vlib_node_t *n = vlib_get_node (vm, node_index);
764 
766  vlib_process_free_event_type (p, t, /* is_one_time_event */ 1);
767 }
768 
769 always_inline void *
771  vlib_node_t * n,
772  vlib_process_t * p,
773  uword t,
774  uword n_data_elts, uword n_data_elt_bytes)
775 {
776  uword p_flags, add_to_pending, delete_from_wheel;
777  void *data_to_be_written_by_caller;
778 
780 
782 
783  /* Resize data vector and return caller's data to be written. */
784  {
785  void *data_vec = p->pending_event_data_by_type_index[t];
786  uword l;
787 
788  if (!data_vec && vec_len (nm->recycled_event_data_vectors))
789  {
790  data_vec = vec_pop (nm->recycled_event_data_vectors);
791  _vec_len (data_vec) = 0;
792  }
793 
794  l = vec_len (data_vec);
795 
796  data_vec = _vec_resize (data_vec,
797  /* length_increment */ n_data_elts,
798  /* total size after increment */
799  (l + n_data_elts) * n_data_elt_bytes,
800  /* header_bytes */ 0, /* data_align */ 0);
801 
802  p->pending_event_data_by_type_index[t] = data_vec;
803  data_to_be_written_by_caller = data_vec + l * n_data_elt_bytes;
804  }
805 
807  clib_bitmap_ori (p->non_empty_event_type_bitmap, t);
808 
809  p_flags = p->flags;
810 
811  /* Event was already signalled? */
812  add_to_pending = (p_flags & VLIB_PROCESS_RESUME_PENDING) == 0;
813 
814  /* Process will resume when suspend time elapses? */
815  delete_from_wheel = 0;
817  {
818  /* Waiting for both event and clock? */
820  delete_from_wheel = 1;
821  else
822  /* Waiting only for clock. Event will be queue and may be
823  handled when timer expires. */
824  add_to_pending = 0;
825  }
826 
827  /* Never add current process to pending vector since current process is
828  already running. */
829  add_to_pending &= nm->current_process_index != n->runtime_index;
830 
831  if (add_to_pending)
832  {
834  p->flags = p_flags | VLIB_PROCESS_RESUME_PENDING;
836  if (delete_from_wheel)
838  }
839 
840  return data_to_be_written_by_caller;
841 }
842 
843 always_inline void *
845  uword node_index,
846  uword type_opaque,
847  uword n_data_elts, uword n_data_elt_bytes)
848 {
849  vlib_node_main_t *nm = &vm->node_main;
850  vlib_node_t *n = vlib_get_node (vm, node_index);
852  uword *h, t;
853 
854  h = hash_get (p->event_type_index_by_type_opaque, type_opaque);
855  if (!h)
856  {
858  vlib_process_new_event_type (p, type_opaque);
859  t = et - p->event_type_pool;
860  hash_set (p->event_type_index_by_type_opaque, type_opaque, t);
861  }
862  else
863  t = h[0];
864 
865  return vlib_process_signal_event_helper (nm, n, p, t, n_data_elts,
866  n_data_elt_bytes);
867 }
868 
869 always_inline void *
871  f64 dt,
872  uword node_index,
873  uword type_opaque,
874  uword n_data_elts, uword n_data_elt_bytes)
875 {
876  vlib_node_main_t *nm = &vm->node_main;
877  vlib_node_t *n = vlib_get_node (vm, node_index);
879  uword *h, t;
880 
881  h = hash_get (p->event_type_index_by_type_opaque, type_opaque);
882  if (!h)
883  {
885  vlib_process_new_event_type (p, type_opaque);
886  t = et - p->event_type_pool;
887  hash_set (p->event_type_index_by_type_opaque, type_opaque, t);
888  }
889  else
890  t = h[0];
891 
893  return vlib_process_signal_event_helper (nm, n, p, t, n_data_elts,
894  n_data_elt_bytes);
895  else
896  {
898  u64 dt_cpu = dt * vm->clib_time.clocks_per_second;
899 
900  pool_get_aligned (nm->signal_timed_event_data_pool, te, sizeof (te[0]));
901 
902  te->n_data_elts = n_data_elts;
903  te->n_data_elt_bytes = n_data_elt_bytes;
904  te->n_data_bytes = n_data_elts * n_data_elt_bytes;
905 
906  /* Assert that structure fields are big enough. */
907  ASSERT (te->n_data_elts == n_data_elts);
908  ASSERT (te->n_data_elt_bytes == n_data_elt_bytes);
909  ASSERT (te->n_data_bytes == n_data_elts * n_data_elt_bytes);
910 
912  te->event_type_index = t;
913 
916  nm->
917  signal_timed_event_data_pool));
918 
919  /* Inline data big enough to hold event? */
920  if (te->n_data_bytes < sizeof (te->inline_event_data))
921  return te->inline_event_data;
922  else
923  {
924  te->event_data_as_vector = 0;
926  return te->event_data_as_vector;
927  }
928  }
929 }
930 
931 always_inline void *
933  uword node_index,
934  uword type_index,
935  uword n_data_elts,
936  uword n_data_elt_bytes)
937 {
938  vlib_node_main_t *nm = &vm->node_main;
939  vlib_node_t *n = vlib_get_node (vm, node_index);
941  return vlib_process_signal_event_helper (nm, n, p, type_index, n_data_elts,
942  n_data_elt_bytes);
943 }
944 
945 always_inline void
947  uword node_index, uword type_opaque, uword data)
948 {
949  uword *d = vlib_process_signal_event_data (vm, node_index, type_opaque,
950  1 /* elts */ , sizeof (uword));
951  d[0] = data;
952 }
953 
954 always_inline void
956  uword node_index,
957  uword type_opaque, void *data)
958 {
959  void **d = vlib_process_signal_event_data (vm, node_index, type_opaque,
960  1 /* elts */ , sizeof (data));
961  d[0] = data;
962 }
963 
964 always_inline void
966  uword node_index,
967  uword type_index, uword data)
968 {
969  uword *d =
970  vlib_process_signal_one_time_event_data (vm, node_index, type_index,
971  1 /* elts */ , sizeof (uword));
972  d[0] = data;
973 }
974 
975 always_inline void
978 {
980  /* data */ ~0);
981  memset (p, ~0, sizeof (p[0]));
982 }
983 
984 always_inline void
987  ** wps)
988 {
991  vec_free (*wps);
992 }
993 
994 always_inline void
997  * p)
998 {
1000  p->one_time_event = vlib_process_create_one_time_event (vm, p->node_index, /* type opaque */
1001  ~0);
1003  /* don't care about data */ 0,
1004  p->one_time_event);
1005 }
1006 
1007 always_inline void
1010  ** wps)
1011 {
1013  vec_add2 (*wps, wp, 1);
1015 }
1016 
1019  vlib_node_runtime_t * node,
1020  uword n_vectors)
1021 {
1022  u32 i, d, vi0, vi1;
1023  u32 i0, i1;
1024 
1027  & (ARRAY_LEN (node->main_loop_vector_stats) - 1));
1028  i0 = i ^ 0;
1029  i1 = i ^ 1;
1031  -
1034  vi0 = node->main_loop_vector_stats[i0];
1035  vi1 = node->main_loop_vector_stats[i1];
1036  vi0 = d == 0 ? vi0 : 0;
1037  vi1 = d <= 1 ? vi1 : 0;
1038  vi0 += n_vectors;
1039  node->main_loop_vector_stats[i0] = vi0;
1040  node->main_loop_vector_stats[i1] = vi1;
1042  /* Return previous counter. */
1043  return node->main_loop_vector_stats[i1];
1044 }
1045 
1048 {
1049  vlib_node_runtime_t *rt = vlib_node_get_runtime (vm, node_index);
1050  u32 v;
1051 
1052  v = vlib_node_runtime_update_main_loop_vector_stats (vm, rt, /* n_vectors */
1053  0);
1054  return (f64) v / (1 << VLIB_LOG2_MAIN_LOOPS_PER_STATS_UPDATE);
1055 }
1056 
1059 {
1060  vlib_node_runtime_t *rt = vlib_node_get_runtime (vm, node_index);
1061  u32 v;
1062 
1063  v = vlib_node_runtime_update_main_loop_vector_stats (vm, rt, /* n_vectors */
1064  0);
1066 }
1067 
1068 void
1070 
1071 /* Return the edge index if present, ~0 otherwise */
1072 uword vlib_node_get_next (vlib_main_t * vm, uword node, uword next_node);
1073 
1074 /* Add next node to given node in given slot. */
1075 uword
1077  uword node, uword next_node, uword slot);
1078 
1079 /* As above but adds to end of node's next vector. */
1082 {
1083  return vlib_node_add_next_with_slot (vm, node, next_node, ~0);
1084 }
1085 
1086 /* Add next node to given node in given slot. */
1087 uword
1089  uword node, char *next_name, uword slot);
1090 
1091 /* As above but adds to end of node's next vector. */
1094 {
1095  return vlib_node_add_named_next_with_slot (vm, node, name, ~0);
1096 }
1097 
1098 /* Query node given name. */
1100 
1101 /* Rename a node. */
1102 void vlib_node_rename (vlib_main_t * vm, u32 node_index, char *fmt, ...);
1103 
1104 /* Register new packet processing node. Nodes can be registered
1105  dynamically via this call or statically via the VLIB_REGISTER_NODE
1106  macro. */
1108 
1109 /* Register all static nodes registered via VLIB_REGISTER_NODE. */
1111 
1112 /* Start a process. */
1113 void vlib_start_process (vlib_main_t * vm, uword process_index);
1114 
1115 /* Sync up runtime and main node stats. */
1117 
1118 /* Node graph initialization function. */
1120 
1127 /* Parse node name -> node index. */
1129 
1130 always_inline void
1132  u32 counter_index, u64 increment)
1133 {
1134  vlib_node_t *n = vlib_get_node (vm, node_index);
1135  vlib_error_main_t *em = &vm->error_main;
1136  u32 node_counter_base_index = n->error_heap_index;
1137  em->counters[node_counter_base_index + counter_index] += increment;
1138 }
1139 
1140 #endif /* included_vlib_node_funcs_h */
1141 
1142 /*
1143  * fd.io coding-style-patch-verification: ON
1144  *
1145  * Local Variables:
1146  * eval: (c-set-style "gnu")
1147  * End:
1148  */
u32 * next_nodes
Definition: node.h:289
#define vec_validate(V, I)
Make sure vector is long enough for given index (no header, unspecified alignment) ...
Definition: vec.h:436
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:123
uword( unformat_function_t)(unformat_input_t *input, va_list *args)
Definition: format.h:231
static void vlib_process_free_event_type(vlib_process_t *p, uword t, uword is_one_time_event)
Definition: node_funcs.h:470
#define VLIB_OFFSET_MASK
Definition: threads.h:63
u32 error_heap_index
Definition: node.h:279
u32 next_frame_index
Start of next frames for this node.
Definition: node.h:438
#define hash_set(h, key, value)
Definition: hash.h:254
static void vlib_signal_one_time_waiting_process_vector(vlib_main_t *vm, vlib_one_time_waiting_process_t **wps)
Definition: node_funcs.h:985
sll srl srl sll sra u16x4 i
Definition: vector_sse2.h:337
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:327
static void vlib_signal_one_time_waiting_process(vlib_main_t *vm, vlib_one_time_waiting_process_t *p)
Definition: node_funcs.h:976
vlib_process_t ** processes
Definition: node.h:679
#define VLIB_CPU_MASK
Definition: threads.h:62
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:1122
static f64 vlib_node_vectors_per_main_loop_as_float(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:1047
vlib_node_runtime_t node_runtime
Definition: node.h:499
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:196
u8 runtime_data[0]
Function dependent node-runtime data.
Definition: node.h:468
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:399
static uword vlib_current_process(vlib_main_t *vm)
Definition: node_funcs.h:426
#define VLIB_FRAME_IS_ALLOCATED
Definition: node.h:374
static void vlib_node_set_interrupt_pending(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:195
static u32 vlib_timing_wheel_data_set_timed_event(u32 i)
Definition: node.h:624
static uword vlib_node_add_named_next(vlib_main_t *vm, uword node, char *name)
Definition: node_funcs.h:1093
static f64 vlib_time_now(vlib_main_t *vm)
Definition: main.h:192
f64 clocks_per_second
Definition: time.h:53
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:452
void ** pending_event_data_by_type_index
Definition: node.h:530
u32 current_process_index
Definition: node.h:682
static_always_inline void clib_spinlock_unlock_if_init(clib_spinlock_t *p)
Definition: lock.h:83
u16 thread_index
Definition: node.h:348
#define vec_add1(V, E)
Add 1 element to end of vector (unspecified alignment).
Definition: vec.h:522
static u64 clib_cpu_time_now(void)
Definition: time.h:73
#define vlib_set_next_frame(vm, node, next_index, v)
Definition: node_funcs.h:389
struct _vlib_node_registration vlib_node_registration_t
#define vec_add2(V, P, N)
Add N elements to end of vector V, return pointer to new elements in P.
Definition: vec.h:561
#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:1125
clib_time_t clib_time
Definition: main.h:62
u8 *( format_function_t)(u8 *s, va_list *args)
Definition: format.h:48
clib_spinlock_t pending_interrupt_lock
Definition: node.h:652
void * runtime_data
Definition: node.h:244
void timing_wheel_insert(timing_wheel_t *w, u64 insert_cpu_time, u32 user_data)
Definition: timing_wheel.c:294
#define pool_get(P, E)
Allocate an object E from a pool P (unspecified alignment).
Definition: pool.h:200
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:1081
vlib_node_state_t
Definition: node.h:208
#define VLIB_PROCESS_RESUME_PENDING
Definition: node.h:516
#define vec_pop(V)
Returns last element of a vector and decrements its length.
Definition: vec.h:616
static uword vlib_process_suspend_time_is_zero(f64 dt)
Returns TRUE if a process suspend time is less than 1us.
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:215
static vlib_process_event_type_t * vlib_process_new_event_type(vlib_process_t *p, uword with_type_opaque)
Definition: node_funcs.h:732
u8 state
Definition: node.h:266
#define vec_add(V, E, N)
Add N elements to end of vector V (no header, unspecified alignment)
Definition: vec.h:599
u32 * pending_interrupt_node_runtime_indices
Definition: node.h:651
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:449
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:688
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:84
format_function_t format_vlib_node_and_next
Definition: node_funcs.h:1124
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:638
#define VLIB_LOG2_MAIN_LOOPS_PER_STATS_UPDATE
Definition: main.h:84
#define vec_elt_at_index(v, i)
Get vector value at index i checking that i is in bounds.
unsigned long u64
Definition: types.h:89
format_function_t format_vlib_next_node_name
Definition: node_funcs.h:1123
#define vec_resize(V, N)
Resize a vector (no header, unspecified alignment) Add N elements to end of given vector V...
Definition: vec.h:241
void vlib_frame_free(vlib_main_t *vm, vlib_node_runtime_t *r, vlib_frame_t *f)
Definition: main.c:216
static void vlib_process_delete_one_time_event(vlib_main_t *vm, uword node_index, uword t)
Definition: node_funcs.h:758
vlib_node_runtime_t * nodes_by_type[VLIB_N_NODE_TYPE]
Definition: node.h:648
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:292
static vlib_node_state_t vlib_node_get_state(vlib_main_t *vm, u32 node_index)
Get node dispatch state.
Definition: node_funcs.h:186
clib_error_t * vlib_node_main_init(vlib_main_t *vm)
Definition: node.c:547
#define hash_get(h, key)
Definition: hash.h:248
#define pool_elt_at_index(p, i)
Returns pointer to element at given index.
Definition: pool.h:397
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:770
u16 state
Input node state.
Definition: node.h:456
u32 vlib_register_node(vlib_main_t *vm, vlib_node_registration_t *r)
Definition: node.c:498
static void vlib_process_signal_event(vlib_main_t *vm, uword node_index, uword type_opaque, uword data)
Definition: node_funcs.h:946
vlib_signal_timed_event_data_t * signal_timed_event_data_pool
Definition: node.h:669
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:124
static u32 vlib_frame_index(vlib_main_t *vm, vlib_frame_t *f)
Definition: node_funcs.h:247
#define v
Definition: acl.c:320
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:603
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:844
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:109
static void vlib_process_signal_one_time_event(vlib_main_t *vm, uword node_index, uword type_index, uword data)
Definition: node_funcs.h:965
#define VLIB_PROCESS_RESUME_LONGJMP_SUSPEND
Definition: node.h:509
static u32 vlib_timing_wheel_data_set_suspended_process(u32 i)
Definition: node.h:618
static vlib_frame_t * vlib_get_frame(vlib_main_t *vm, uword frame_index)
Definition: node_funcs.h:239
u32 node_index
Node index.
Definition: node.h:441
#define VLIB_PROCESS_RETURN_LONGJMP_SUSPEND
Definition: node.h:505
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1131
#define pool_get_aligned(P, E, A)
Allocate an object E from a pool P (general version).
Definition: pool.h:169
timing_wheel_t timing_wheel
Definition: node.h:667
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:226
#define VLIB_FRAME_VECTOR_ALIGN
Definition: node_funcs.h:255
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:1018
static void vlib_process_signal_event_pointer(vlib_main_t *vm, uword node_index, uword type_opaque, void *data)
Definition: node_funcs.h:955
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:870
u32 runtime_index
Definition: node.h:241
uword vlib_node_add_named_next_with_slot(vlib_main_t *vm, uword node, char *next_name, uword slot)
Definition: node.c:262
static vlib_process_t * vlib_get_current_process(vlib_main_t *vm)
Definition: node_funcs.h:413
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:340
void * heap_base
Definition: main.h:101
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:88
#define clib_memcpy(a, b, c)
Definition: string.h:69
void timing_wheel_delete(timing_wheel_t *w, u32 user_data)
Definition: timing_wheel.c:331
static uword vlib_process_create_one_time_event(vlib_main_t *vm, uword node_index, uword with_type_opaque)
Definition: node_funcs.h:741
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:238
static u32 vlib_frame_vector_byte_offset(u32 scalar_size)
Definition: node_funcs.h:258
#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:278
uword * one_time_event_type_bitmap
Definition: node.h:536
static u32 vlib_node_vectors_per_main_loop_as_integer(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:1058
#define VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_EVENT
Definition: node.h:514
void vlib_start_process(vlib_main_t *vm, uword process_index)
Definition: main.c:1365
#define pool_put_index(p, i)
Free pool element with given index.
Definition: pool.h:255
#define ASSERT(truth)
static uword vlib_process_get_events_helper(vlib_process_t *p, uword t, uword **data_vector)
Definition: node_funcs.h:576
unsigned int u32
Definition: types.h:88
u16 flags
Definition: node.h:336
#define VLIB_PROCESS_RESUME_LONGJMP_RESUME
Definition: node.h:510
static void * vlib_frame_args(vlib_frame_t *f)
Get pointer to frame scalar data.
Definition: node_funcs.h:286
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:146
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:361
static uword is_pow2(uword x)
Definition: clib.h:272
u64 uword
Definition: types.h:112
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:1008
#define vec_elt(v, i)
Get vector value at index i.
template key/value backing page structure
Definition: bihash_doc.h:44
void vlib_node_sync_stats(vlib_main_t *vm, vlib_node_t *n)
Definition: main.c:575
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:459
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:71
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:543
u32 * data_from_advancing_timing_wheel
Definition: node.h:672
#define vec_len(v)
Number of elements in vector (rvalue-only, NULL tolerant)
double f64
Definition: types.h:142
u32 input_node_counts_by_state[VLIB_N_NODE_STATE]
Definition: node.h:691
unsigned char u8
Definition: types.h:56
vlib_node_main_t node_main
Definition: main.h:115
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
format_function_t format_vlib_time
Definition: node_funcs.h:1126
vlib_next_frame_t * next_frames
Definition: node.h:661
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:269
vlib_main_t ** vlib_mains
uword * event_type_index_by_type_opaque
Definition: node.h:540
#define VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_CLOCK
Definition: node.h:513
unformat_function_t unformat_vlib_node
Definition: node_funcs.h:1128
struct clib_bihash_value offset
template key/value backing page structure
u16 flags
Definition: node.h:512
static uword vlib_in_process_context(vlib_main_t *vm)
Definition: node_funcs.h:420
vlib_node_type_t type
Definition: node.h:235
static vlib_process_t * vlib_get_process_from_node(vlib_main_t *vm, vlib_node_t *node)
Definition: node_funcs.h:206
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:518
u64 resume_cpu_time
Definition: node.h:546
static vlib_node_t * vlib_get_node(vlib_main_t *vm, u32 i)
Get vlib node by index.
Definition: node_funcs.h:58
#define vec_foreach(var, vec)
Vector iterator.
clib_longjmp_t return_longjmp
Definition: node.h:502
u32 node_runtime_index
Definition: node.h:360
u8 scalar_size
Definition: node.h:339
clib_longjmp_t resume_longjmp
Definition: node.h:508
u32 main_loop_count
Definition: main.h:71
static_always_inline void clib_spinlock_lock_if_init(clib_spinlock_t *p)
Definition: lock.h:65
vlib_frame_t * vlib_get_frame_to_node(vlib_main_t *vm, u32 to_node_index)
Definition: main.c:187
u8 runtime_data_bytes
Definition: node.h:269
format_function_t format_vlib_node_graph
Definition: node_funcs.h:1121
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:995
uword * non_empty_event_type_bitmap
Definition: node.h:533
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:932