FD.io VPP  v17.04.2-2-ga8f93f8
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 always_inline void
182 {
183  vlib_node_main_t *nm = &vm->node_main;
184  vlib_node_t *n = vec_elt (nm->nodes, node_index);
187 }
188 
191 {
192  vlib_node_main_t *nm = &vm->node_main;
194  return vec_elt (nm->processes, node->runtime_index);
195 }
196 
197 /* Fetches frame with given handle. */
200 {
201  vlib_frame_t *f;
202  u32 cpu_index = frame_index & VLIB_CPU_MASK;
203  u32 offset = frame_index & VLIB_OFFSET_MASK;
204  vm = vlib_mains[cpu_index];
205  f = vm->heap_base + offset;
206  return f;
207 }
208 
211 {
212  u32 i;
213 
214  ASSERT (((uword) f & VLIB_CPU_MASK) == 0);
215 
216  vm = vlib_mains[f->cpu_index];
217 
218  i = ((u8 *) f - (u8 *) vm->heap_base);
219  return i | f->cpu_index;
220 }
221 
223 vlib_get_frame (vlib_main_t * vm, uword frame_index)
224 {
225  vlib_frame_t *f = vlib_get_frame_no_check (vm, frame_index);
227  return f;
228 }
229 
232 {
234  ASSERT (vlib_get_frame (vm, i) == f);
235  return i;
236 }
237 
238 /* Byte alignment for vector arguments. */
239 #define VLIB_FRAME_VECTOR_ALIGN (1 << 4)
240 
243 {
244  return round_pow2 (sizeof (vlib_frame_t) + scalar_size,
246 }
247 
248 /** \brief Get pointer to frame vector data.
249  @param f vlib_frame_t pointer
250  @return pointer to first vector element in frame
251 */
252 always_inline void *
254 {
255  return (void *) f + vlib_frame_vector_byte_offset (f->scalar_size);
256 }
257 
258 /** \brief Get pointer to frame scalar data.
259 
260  @warning This is almost certainly not the function you wish to call.
261  See @ref vlib_frame_vector_args instead.
262 
263  @param f vlib_frame_t pointer
264 
265  @return arbitrary node scalar data
266 
267  @sa vlib_frame_vector_args
268 */
269 always_inline void *
271 {
272  return vlib_frame_vector_args (f) - f->scalar_size;
273 }
274 
277  vlib_node_runtime_t * n, u32 next_index)
278 {
279  vlib_node_main_t *nm = &vm->node_main;
280  vlib_next_frame_t *nf;
281 
282  ASSERT (next_index < n->n_next_nodes);
283  nf = vec_elt_at_index (nm->next_frames, n->next_frame_index + next_index);
284 
285  if (CLIB_DEBUG > 0)
286  {
287  vlib_node_t *node, *next;
288  node = vec_elt (nm->nodes, n->node_index);
289  next = vec_elt (nm->nodes, node->next_nodes[next_index]);
290  ASSERT (nf->node_runtime_index == next->runtime_index);
291  }
292 
293  return nf;
294 }
295 
296 /** \brief Get pointer to frame by (@c node_index, @c next_index).
297 
298  @warning This is not a function that you should call directly.
299  See @ref vlib_get_next_frame instead.
300 
301  @param vm vlib_main_t pointer, varies by thread
302  @param node_index index of the node
303  @param next_index graph arc index
304 
305  @return pointer to the requested vlib_next_frame_t
306 
307  @sa vlib_get_next_frame
308 */
309 
311 vlib_node_get_next_frame (vlib_main_t * vm, u32 node_index, u32 next_index)
312 {
313  vlib_node_main_t *nm = &vm->node_main;
314  vlib_node_t *n;
316 
317  n = vec_elt (nm->nodes, node_index);
319  return vlib_node_runtime_get_next_frame (vm, r, next_index);
320 }
321 
323  vlib_node_runtime_t * node,
324  u32 next_index,
325  u32 alloc_new_frame);
326 
327 #define vlib_get_next_frame_macro(vm,node,next_index,vectors,n_vectors_left,alloc_new_frame) \
328 do { \
329  vlib_frame_t * _f \
330  = vlib_get_next_frame_internal ((vm), (node), (next_index), \
331  (alloc_new_frame)); \
332  u32 _n = _f->n_vectors; \
333  (vectors) = vlib_frame_vector_args (_f) + _n * sizeof ((vectors)[0]); \
334  (n_vectors_left) = VLIB_FRAME_SIZE - _n; \
335 } while (0)
336 
337 
338 /** \brief Get pointer to next frame vector data by
339  (@c vlib_node_runtime_t, @c next_index).
340  Standard single/dual loop boilerplate element.
341  @attention This is a MACRO, with SIDE EFFECTS.
342 
343  @param vm vlib_main_t pointer, varies by thread
344  @param node current node vlib_node_runtime_t pointer
345  @param next_index requested graph arc index
346 
347  @return @c vectors -- pointer to next available vector slot
348  @return @c n_vectors_left -- number of vector slots available
349 */
350 #define vlib_get_next_frame(vm,node,next_index,vectors,n_vectors_left) \
351  vlib_get_next_frame_macro (vm, node, next_index, \
352  vectors, n_vectors_left, \
353  /* alloc new frame */ 0)
354 
355 #define vlib_get_new_next_frame(vm,node,next_index,vectors,n_vectors_left) \
356  vlib_get_next_frame_macro (vm, node, next_index, \
357  vectors, n_vectors_left, \
358  /* alloc new frame */ 1)
359 
360 /** \brief Release pointer to next frame vector data.
361  Standard single/dual loop boilerplate element.
362  @param vm vlib_main_t pointer, varies by thread
363  @param r current node vlib_node_runtime_t pointer
364  @param next_index graph arc index
365  @param n_packets_left number of slots still available in vector
366 */
367 void
370  u32 next_index, u32 n_packets_left);
371 
372 /* Combination get plus put. Returns vector argument just added. */
373 #define vlib_set_next_frame(vm,node,next_index,v) \
374 ({ \
375  uword _n_left; \
376  vlib_get_next_frame ((vm), (node), (next_index), (v), _n_left); \
377  ASSERT (_n_left > 0); \
378  vlib_put_next_frame ((vm), (node), (next_index), _n_left - 1); \
379  (v); \
380 })
381 
382 always_inline void
384  vlib_node_runtime_t * node,
385  u32 next_index, u32 buffer_index)
386 {
387  u32 *p;
388  p = vlib_set_next_frame (vm, node, next_index, p);
389  p[0] = buffer_index;
390 }
391 
392 vlib_frame_t *vlib_get_frame_to_node (vlib_main_t * vm, u32 to_node_index);
393 void vlib_put_frame_to_node (vlib_main_t * vm, u32 to_node_index,
394  vlib_frame_t * f);
395 
398 {
399  vlib_node_main_t *nm = &vm->node_main;
400  return vec_elt (nm->processes, nm->current_process_index);
401 }
402 
405 {
406  return vm->node_main.current_process_index != ~0;
407 }
408 
411 {
413 }
414 
415 /** Returns TRUE if a process suspend time is less than 1us
416  @param dt - remaining poll time in seconds
417  @returns 1 if dt < 1e-6, 0 otherwise
418 */
421 {
422  return dt < 1e-6;
423 }
424 
425 /** Suspend a vlib cooperative multi-tasking thread for a period of time
426  @param vm - vlib_main_t *
427  @param dt - suspend interval in seconds
428  @returns VLIB_PROCESS_RESUME_LONGJMP_RESUME, routinely ignored
429 */
430 
433 {
434  uword r;
435  vlib_node_main_t *nm = &vm->node_main;
437  u64 dt_cpu = dt * vm->clib_time.clocks_per_second;
438 
441 
445  {
446  p->resume_cpu_time = clib_cpu_time_now () + dt_cpu;
448  }
449 
450  return r;
451 }
452 
453 always_inline void
455  uword is_one_time_event)
456 {
459  if (is_one_time_event)
461  clib_bitmap_andnoti (p->one_time_event_type_bitmap, t);
462 }
463 
464 always_inline void
466 {
469  vlib_process_free_event_type (p, t, /* is_one_time_event */ 1);
470 }
471 
472 always_inline void *
474  uword * return_event_type_opaque)
475 {
476  vlib_node_main_t *nm = &vm->node_main;
477  vlib_process_t *p;
479  uword t;
480  void *event_data_vector;
481 
482  p = vec_elt (nm->processes, nm->current_process_index);
483 
484  /* Find first type with events ready.
485  Return invalid type when there's nothing there. */
487  if (t == ~0)
488  return 0;
489 
491  clib_bitmap_andnoti (p->non_empty_event_type_bitmap, t);
492 
493  ASSERT (_vec_len (p->pending_event_data_by_type_index[t]) > 0);
494  event_data_vector = p->pending_event_data_by_type_index[t];
496 
497  et = pool_elt_at_index (p->event_type_pool, t);
498 
499  /* Return user's opaque value and possibly index. */
500  *return_event_type_opaque = et->opaque;
501 
503 
504  return event_data_vector;
505 }
506 
507 /* Return event data vector for later reuse. We reuse event data to avoid
508  repeatedly allocating event vectors in cases where we care about speed. */
509 always_inline void
510 vlib_process_put_event_data (vlib_main_t * vm, void *event_data)
511 {
512  vlib_node_main_t *nm = &vm->node_main;
513  vec_add1 (nm->recycled_event_data_vectors, event_data);
514 }
515 
516 /** Return the first event type which has occurred and a vector of per-event
517  data of that type, or a timeout indication
518 
519  @param vm - vlib_main_t pointer
520  @param data_vector - pointer to a (uword *) vector to receive event data
521  @returns either an event type and a vector of per-event instance data,
522  or ~0 to indicate a timeout.
523 */
524 
527 {
528  vlib_node_main_t *nm = &vm->node_main;
529  vlib_process_t *p;
531  uword r, t, l;
532 
533  p = vec_elt (nm->processes, nm->current_process_index);
534 
535  /* Find first type with events ready.
536  Return invalid type when there's nothing there. */
538  if (t == ~0)
539  return t;
540 
542  clib_bitmap_andnoti (p->non_empty_event_type_bitmap, t);
543 
544  l = _vec_len (p->pending_event_data_by_type_index[t]);
545  if (data_vector)
546  vec_add (*data_vector, p->pending_event_data_by_type_index[t], l);
547  _vec_len (p->pending_event_data_by_type_index[t]) = 0;
548 
549  et = pool_elt_at_index (p->event_type_pool, t);
550 
551  /* Return user's opaque value. */
552  r = et->opaque;
553 
555 
556  return r;
557 }
558 
561  uword ** data_vector)
562 {
563  uword l;
564 
566  clib_bitmap_andnoti (p->non_empty_event_type_bitmap, t);
567 
568  l = _vec_len (p->pending_event_data_by_type_index[t]);
569  if (data_vector)
570  vec_add (*data_vector, p->pending_event_data_by_type_index[t], l);
571  _vec_len (p->pending_event_data_by_type_index[t]) = 0;
572 
574 
575  return l;
576 }
577 
578 /* As above but query as specified type of event. Returns number of
579  events found. */
582  uword with_type_opaque)
583 {
584  vlib_node_main_t *nm = &vm->node_main;
585  vlib_process_t *p;
586  uword t, *h;
587 
588  p = vec_elt (nm->processes, nm->current_process_index);
589  h = hash_get (p->event_type_index_by_type_opaque, with_type_opaque);
590  if (!h)
591  /* This can happen when an event has not yet been
592  signaled with given opaque type. */
593  return 0;
594 
595  t = h[0];
597  return 0;
598 
599  return vlib_process_get_events_helper (p, t, data_vector);
600 }
601 
604 {
605  vlib_node_main_t *nm = &vm->node_main;
606  vlib_process_t *p;
607  uword r;
608 
609  p = vec_elt (nm->processes, nm->current_process_index);
611  {
613  r =
618  }
619 
620  return p->non_empty_event_type_bitmap;
621 }
622 
625  uword ** data_vector,
626  uword with_type_index)
627 {
628  vlib_node_main_t *nm = &vm->node_main;
629  vlib_process_t *p;
630  uword r;
631 
632  p = vec_elt (nm->processes, nm->current_process_index);
633  ASSERT (!pool_is_free_index (p->event_type_pool, with_type_index));
634  while (!clib_bitmap_get (p->non_empty_event_type_bitmap, with_type_index))
635  {
637  r =
642  }
643 
644  return vlib_process_get_events_helper (p, with_type_index, data_vector);
645 }
646 
649  uword ** data_vector,
650  uword with_type_opaque)
651 {
652  vlib_node_main_t *nm = &vm->node_main;
653  vlib_process_t *p;
654  uword r, *h;
655 
656  p = vec_elt (nm->processes, nm->current_process_index);
657  h = hash_get (p->event_type_index_by_type_opaque, with_type_opaque);
658  while (!h || !clib_bitmap_get (p->non_empty_event_type_bitmap, h[0]))
659  {
661  r =
666 
667  /* See if unknown event type has been signaled now. */
668  if (!h)
669  h = hash_get (p->event_type_index_by_type_opaque, with_type_opaque);
670  }
671 
672  return vlib_process_get_events_helper (p, h[0], data_vector);
673 }
674 
675 /** Suspend a cooperative multi-tasking thread
676  Waits for an event, or for the indicated number of seconds to elapse
677  @param vm - vlib_main_t pointer
678  @param dt - timeout, in seconds.
679  @returns the remaining time interval
680 */
681 
684 {
685  vlib_node_main_t *nm = &vm->node_main;
686  vlib_process_t *p;
687  f64 wakeup_time;
688  uword r;
689 
690  p = vec_elt (nm->processes, nm->current_process_index);
691 
694  return dt;
695 
696  wakeup_time = vlib_time_now (vm) + dt;
697 
698  /* Suspend waiting for both clock and event to occur. */
701 
704  {
706  + (dt * vm->clib_time.clocks_per_second));
708  }
709 
710  /* Return amount of time still left to sleep.
711  If <= 0 then we've been waken up by the clock (and not an event). */
712  return wakeup_time - vlib_time_now (vm);
713 }
714 
717 {
719  pool_get (p->event_type_pool, et);
720  et->opaque = with_type_opaque;
721  return et;
722 }
723 
726  uword with_type_opaque)
727 {
728  vlib_node_main_t *nm = &vm->node_main;
729  vlib_node_t *n = vlib_get_node (vm, node_index);
732  uword t;
733 
734  et = vlib_process_new_event_type (p, with_type_opaque);
735  t = et - p->event_type_pool;
737  clib_bitmap_ori (p->one_time_event_type_bitmap, t);
738  return t;
739 }
740 
741 always_inline void
743  uword t)
744 {
745  vlib_node_main_t *nm = &vm->node_main;
746  vlib_node_t *n = vlib_get_node (vm, node_index);
748 
750  vlib_process_free_event_type (p, t, /* is_one_time_event */ 1);
751 }
752 
753 always_inline void *
755  vlib_node_t * n,
756  vlib_process_t * p,
757  uword t,
758  uword n_data_elts, uword n_data_elt_bytes)
759 {
760  uword p_flags, add_to_pending, delete_from_wheel;
761  void *data_to_be_written_by_caller;
762 
764 
766 
767  /* Resize data vector and return caller's data to be written. */
768  {
769  void *data_vec = p->pending_event_data_by_type_index[t];
770  uword l;
771 
772  if (!data_vec && vec_len (nm->recycled_event_data_vectors))
773  {
774  data_vec = vec_pop (nm->recycled_event_data_vectors);
775  _vec_len (data_vec) = 0;
776  }
777 
778  l = vec_len (data_vec);
779 
780  data_vec = _vec_resize (data_vec,
781  /* length_increment */ n_data_elts,
782  /* total size after increment */
783  (l + n_data_elts) * n_data_elt_bytes,
784  /* header_bytes */ 0, /* data_align */ 0);
785 
786  p->pending_event_data_by_type_index[t] = data_vec;
787  data_to_be_written_by_caller = data_vec + l * n_data_elt_bytes;
788  }
789 
791  clib_bitmap_ori (p->non_empty_event_type_bitmap, t);
792 
793  p_flags = p->flags;
794 
795  /* Event was already signalled? */
796  add_to_pending = (p_flags & VLIB_PROCESS_RESUME_PENDING) == 0;
797 
798  /* Process will resume when suspend time elapses? */
799  delete_from_wheel = 0;
801  {
802  /* Waiting for both event and clock? */
804  delete_from_wheel = 1;
805  else
806  /* Waiting only for clock. Event will be queue and may be
807  handled when timer expires. */
808  add_to_pending = 0;
809  }
810 
811  /* Never add current process to pending vector since current process is
812  already running. */
813  add_to_pending &= nm->current_process_index != n->runtime_index;
814 
815  if (add_to_pending)
816  {
818  p->flags = p_flags | VLIB_PROCESS_RESUME_PENDING;
820  if (delete_from_wheel)
822  }
823 
824  return data_to_be_written_by_caller;
825 }
826 
827 always_inline void *
829  uword node_index,
830  uword type_opaque,
831  uword n_data_elts, uword n_data_elt_bytes)
832 {
833  vlib_node_main_t *nm = &vm->node_main;
834  vlib_node_t *n = vlib_get_node (vm, node_index);
836  uword *h, t;
837 
838  h = hash_get (p->event_type_index_by_type_opaque, type_opaque);
839  if (!h)
840  {
842  vlib_process_new_event_type (p, type_opaque);
843  t = et - p->event_type_pool;
844  hash_set (p->event_type_index_by_type_opaque, type_opaque, t);
845  }
846  else
847  t = h[0];
848 
849  return vlib_process_signal_event_helper (nm, n, p, t, n_data_elts,
850  n_data_elt_bytes);
851 }
852 
853 always_inline void *
855  f64 dt,
856  uword node_index,
857  uword type_opaque,
858  uword n_data_elts, uword n_data_elt_bytes)
859 {
860  vlib_node_main_t *nm = &vm->node_main;
861  vlib_node_t *n = vlib_get_node (vm, node_index);
863  uword *h, t;
864 
865  h = hash_get (p->event_type_index_by_type_opaque, type_opaque);
866  if (!h)
867  {
869  vlib_process_new_event_type (p, type_opaque);
870  t = et - p->event_type_pool;
871  hash_set (p->event_type_index_by_type_opaque, type_opaque, t);
872  }
873  else
874  t = h[0];
875 
877  return vlib_process_signal_event_helper (nm, n, p, t, n_data_elts,
878  n_data_elt_bytes);
879  else
880  {
882  u64 dt_cpu = dt * vm->clib_time.clocks_per_second;
883 
884  pool_get_aligned (nm->signal_timed_event_data_pool, te, sizeof (te[0]));
885 
886  te->n_data_elts = n_data_elts;
887  te->n_data_elt_bytes = n_data_elt_bytes;
888  te->n_data_bytes = n_data_elts * n_data_elt_bytes;
889 
890  /* Assert that structure fields are big enough. */
891  ASSERT (te->n_data_elts == n_data_elts);
892  ASSERT (te->n_data_elt_bytes == n_data_elt_bytes);
893  ASSERT (te->n_data_bytes == n_data_elts * n_data_elt_bytes);
894 
896  te->event_type_index = t;
897 
900  nm->
901  signal_timed_event_data_pool));
902 
903  /* Inline data big enough to hold event? */
904  if (te->n_data_bytes < sizeof (te->inline_event_data))
905  return te->inline_event_data;
906  else
907  {
908  te->event_data_as_vector = 0;
910  return te->event_data_as_vector;
911  }
912  }
913 }
914 
915 always_inline void *
917  uword node_index,
918  uword type_index,
919  uword n_data_elts,
920  uword n_data_elt_bytes)
921 {
922  vlib_node_main_t *nm = &vm->node_main;
923  vlib_node_t *n = vlib_get_node (vm, node_index);
925  return vlib_process_signal_event_helper (nm, n, p, type_index, n_data_elts,
926  n_data_elt_bytes);
927 }
928 
929 always_inline void
931  uword node_index, uword type_opaque, uword data)
932 {
933  uword *d = vlib_process_signal_event_data (vm, node_index, type_opaque,
934  1 /* elts */ , sizeof (uword));
935  d[0] = data;
936 }
937 
938 always_inline void
940  uword node_index,
941  uword type_opaque, void *data)
942 {
943  void **d = vlib_process_signal_event_data (vm, node_index, type_opaque,
944  1 /* elts */ , sizeof (data));
945  d[0] = data;
946 }
947 
948 always_inline void
950  uword node_index,
951  uword type_index, uword data)
952 {
953  uword *d =
954  vlib_process_signal_one_time_event_data (vm, node_index, type_index,
955  1 /* elts */ , sizeof (uword));
956  d[0] = data;
957 }
958 
959 always_inline void
962 {
964  /* data */ ~0);
965  memset (p, ~0, sizeof (p[0]));
966 }
967 
968 always_inline void
971  ** wps)
972 {
975  vec_free (*wps);
976 }
977 
978 always_inline void
981  * p)
982 {
984  p->one_time_event = vlib_process_create_one_time_event (vm, p->node_index, /* type opaque */
985  ~0);
987  /* don't care about data */ 0,
988  p->one_time_event);
989 }
990 
991 always_inline void
994  ** wps)
995 {
997  vec_add2 (*wps, wp, 1);
999 }
1000 
1003  vlib_node_runtime_t * node,
1004  uword n_vectors)
1005 {
1006  u32 i, d, vi0, vi1;
1007  u32 i0, i1;
1008 
1011  & (ARRAY_LEN (node->main_loop_vector_stats) - 1));
1012  i0 = i ^ 0;
1013  i1 = i ^ 1;
1015  -
1018  vi0 = node->main_loop_vector_stats[i0];
1019  vi1 = node->main_loop_vector_stats[i1];
1020  vi0 = d == 0 ? vi0 : 0;
1021  vi1 = d <= 1 ? vi1 : 0;
1022  vi0 += n_vectors;
1023  node->main_loop_vector_stats[i0] = vi0;
1024  node->main_loop_vector_stats[i1] = vi1;
1026  /* Return previous counter. */
1027  return node->main_loop_vector_stats[i1];
1028 }
1029 
1032 {
1033  vlib_node_runtime_t *rt = vlib_node_get_runtime (vm, node_index);
1034  u32 v;
1035 
1036  v = vlib_node_runtime_update_main_loop_vector_stats (vm, rt, /* n_vectors */
1037  0);
1038  return (f64) v / (1 << VLIB_LOG2_MAIN_LOOPS_PER_STATS_UPDATE);
1039 }
1040 
1043 {
1044  vlib_node_runtime_t *rt = vlib_node_get_runtime (vm, node_index);
1045  u32 v;
1046 
1047  v = vlib_node_runtime_update_main_loop_vector_stats (vm, rt, /* n_vectors */
1048  0);
1050 }
1051 
1052 void
1054 
1055 /* Return the edge index if present, ~0 otherwise */
1056 uword vlib_node_get_next (vlib_main_t * vm, uword node, uword next_node);
1057 
1058 /* Add next node to given node in given slot. */
1059 uword
1061  uword node, uword next_node, uword slot);
1062 
1063 /* As above but adds to end of node's next vector. */
1066 {
1067  return vlib_node_add_next_with_slot (vm, node, next_node, ~0);
1068 }
1069 
1070 /* Add next node to given node in given slot. */
1071 uword
1073  uword node, char *next_name, uword slot);
1074 
1075 /* As above but adds to end of node's next vector. */
1078 {
1079  return vlib_node_add_named_next_with_slot (vm, node, name, ~0);
1080 }
1081 
1082 /* Query node given name. */
1084 
1085 /* Rename a node. */
1086 void vlib_node_rename (vlib_main_t * vm, u32 node_index, char *fmt, ...);
1087 
1088 /* Register new packet processing node. Nodes can be registered
1089  dynamically via this call or statically via the VLIB_REGISTER_NODE
1090  macro. */
1092 
1093 /* Register all static nodes registered via VLIB_REGISTER_NODE. */
1095 
1096 /* Start a process. */
1097 void vlib_start_process (vlib_main_t * vm, uword process_index);
1098 
1099 /* Sync up runtime and main node stats. */
1101 
1102 /* Node graph initialization function. */
1104 
1111 /* Parse node name -> node index. */
1113 
1114 always_inline void
1116  u32 counter_index, u64 increment)
1117 {
1118  vlib_node_t *n = vlib_get_node (vm, node_index);
1119  vlib_error_main_t *em = &vm->error_main;
1120  u32 node_counter_base_index = n->error_heap_index;
1121  em->counters[node_counter_base_index + counter_index] += increment;
1122 }
1123 
1124 #endif /* included_vlib_node_funcs_h */
1125 
1126 /*
1127  * fd.io coding-style-patch-verification: ON
1128  *
1129  * Local Variables:
1130  * eval: (c-set-style "gnu")
1131  * End:
1132  */
u32 * next_nodes
Definition: node.h:288
#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:454
#define VLIB_OFFSET_MASK
Definition: threads.h:63
u32 error_heap_index
Definition: node.h:278
u32 next_frame_index
Start of next frames for this node.
Definition: node.h:433
#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:969
sll srl srl sll sra u16x4 i
Definition: vector_sse2.h:343
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:311
static void vlib_signal_one_time_waiting_process(vlib_main_t *vm, vlib_one_time_waiting_process_t *p)
Definition: node_funcs.h:960
vlib_process_t ** processes
Definition: node.h:673
#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:683
format_function_t format_vlib_node_name
Definition: node_funcs.h:1106
static f64 vlib_node_vectors_per_main_loop_as_float(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:1031
vlib_node_runtime_t node_runtime
Definition: node.h:494
uword vlib_node_get_next(vlib_main_t *vm, uword node, uword next_node)
Definition: node.c:155
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:463
static uword * vlib_process_wait_for_event(vlib_main_t *vm)
Definition: node_funcs.h:603
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:383
static uword vlib_current_process(vlib_main_t *vm)
Definition: node_funcs.h:410
#define VLIB_FRAME_IS_ALLOCATED
Definition: node.h:373
static void vlib_node_set_interrupt_pending(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:181
static u32 vlib_timing_wheel_data_set_timed_event(u32 i)
Definition: node.h:619
static uword vlib_node_add_named_next(vlib_main_t *vm, uword node, char *name)
Definition: node_funcs.h:1077
static f64 vlib_time_now(vlib_main_t *vm)
Definition: main.h:185
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:447
void ** pending_event_data_by_type_index
Definition: node.h:525
u32 current_process_index
Definition: node.h:676
#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:373
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:1109
clib_time_t clib_time
Definition: main.h:62
u8 *( format_function_t)(u8 *s, va_list *args)
Definition: format.h:48
void * runtime_data
Definition: node.h:243
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)
vlib_main_t ** vlib_mains
Definition: buffer.c:285
static uword vlib_node_add_next(vlib_main_t *vm, uword node, uword next_node)
Definition: node_funcs.h:1065
vlib_node_state_t
Definition: node.h:207
#define VLIB_PROCESS_RESUME_PENDING
Definition: node.h:511
#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:420
static vlib_frame_t * vlib_get_frame_no_check(vlib_main_t *vm, uword frame_index)
Definition: node_funcs.h:199
static vlib_process_event_type_t * vlib_process_new_event_type(vlib_process_t *p, uword with_type_opaque)
Definition: node_funcs.h:716
u8 state
Definition: node.h:265
#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:646
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:432
u32 main_loop_count_last_dispatch
Saved main loop counter of last dispatch of this node.
Definition: node.h:444
void vlib_node_rename(vlib_main_t *vm, u32 node_index, char *fmt,...)
Definition: node.c:76
void ** recycled_event_data_vectors
Definition: node.h:682
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:526
#define always_inline
Definition: clib.h:84
format_function_t format_vlib_node_and_next
Definition: node_funcs.h:1108
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:633
#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:1107
#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:742
vlib_node_runtime_t * nodes_by_type[VLIB_N_NODE_TYPE]
Definition: node.h:643
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:276
clib_error_t * vlib_node_main_init(vlib_main_t *vm)
Definition: node.c:518
#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:754
u16 state
Input node state.
Definition: node.h:451
u32 vlib_register_node(vlib_main_t *vm, vlib_node_registration_t *r)
Definition: node.c:469
static void vlib_process_signal_event(vlib_main_t *vm, uword node_index, uword type_opaque, uword data)
Definition: node_funcs.h:930
vlib_signal_timed_event_data_t * signal_timed_event_data_pool
Definition: node.h:663
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:231
#define v
Definition: acl.c:246
static void vlib_process_maybe_free_event_type(vlib_process_t *p, uword t)
Definition: node_funcs.h:465
u8 inline_event_data[64-3 *sizeof(u32)-2 *sizeof(u16)]
Definition: node.h:598
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:828
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:949
#define VLIB_PROCESS_RESUME_LONGJMP_SUSPEND
Definition: node.h:504
static u32 vlib_timing_wheel_data_set_suspended_process(u32 i)
Definition: node.h:613
static vlib_frame_t * vlib_get_frame(vlib_main_t *vm, uword frame_index)
Definition: node_funcs.h:223
u32 node_index
Node index.
Definition: node.h:436
#define VLIB_PROCESS_RETURN_LONGJMP_SUSPEND
Definition: node.h:500
static void vlib_node_increment_counter(vlib_main_t *vm, u32 node_index, u32 counter_index, u64 increment)
Definition: node_funcs.h:1115
#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:661
static uword vlib_process_get_events_with_type(vlib_main_t *vm, uword **data_vector, uword with_type_opaque)
Definition: node_funcs.h:581
static u32 vlib_frame_index_no_check(vlib_main_t *vm, vlib_frame_t *f)
Definition: node_funcs.h:210
#define VLIB_FRAME_VECTOR_ALIGN
Definition: node_funcs.h:239
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:1002
static void vlib_process_signal_event_pointer(vlib_main_t *vm, uword node_index, uword type_opaque, void *data)
Definition: node_funcs.h:939
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:854
u32 runtime_index
Definition: node.h:240
uword vlib_node_add_named_next_with_slot(vlib_main_t *vm, uword node, char *next_name, uword slot)
Definition: node.c:233
static vlib_process_t * vlib_get_current_process(vlib_main_t *vm)
Definition: node_funcs.h:397
vec_header_t h
Definition: buffer.c:275
static uword vlib_process_wait_for_one_time_event(vlib_main_t *vm, uword **data_vector, uword with_type_index)
Definition: node_funcs.h:624
#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:725
uword vlib_node_add_next_with_slot(vlib_main_t *vm, uword node, uword next_node, uword slot)
Definition: node.c:176
#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:242
#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:531
static u32 vlib_node_vectors_per_main_loop_as_integer(vlib_main_t *vm, u32 node_index)
Definition: node_funcs.h:1042
#define VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_EVENT
Definition: node.h:509
void vlib_start_process(vlib_main_t *vm, uword process_index)
Definition: main.c:1332
#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:560
unsigned int u32
Definition: types.h:88
u16 flags
Definition: node.h:335
u16 cpu_index
Definition: node.h:347
#define VLIB_PROCESS_RESUME_LONGJMP_RESUME
Definition: node.h:505
static void * vlib_frame_args(vlib_frame_t *f)
Get pointer to frame scalar data.
Definition: node_funcs.h:270
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:992
#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:473
vlib_process_event_type_t * event_type_pool
Definition: node.h:538
u32 * data_from_advancing_timing_wheel
Definition: node.h:666
#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:685
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:648
format_function_t format_vlib_time
Definition: node_funcs.h:1110
vlib_next_frame_t * next_frames
Definition: node.h:655
static void * vlib_frame_vector_args(vlib_frame_t *f)
Get pointer to frame vector data.
Definition: node_funcs.h:253
uword * event_type_index_by_type_opaque
Definition: node.h:535
#define VLIB_PROCESS_IS_SUSPENDED_WAITING_FOR_CLOCK
Definition: node.h:508
unformat_function_t unformat_vlib_node
Definition: node_funcs.h:1112
struct clib_bihash_value offset
template key/value backing page structure
u16 flags
Definition: node.h:507
static uword vlib_in_process_context(vlib_main_t *vm)
Definition: node_funcs.h:404
vlib_node_type_t type
Definition: node.h:234
static vlib_process_t * vlib_get_process_from_node(vlib_main_t *vm, vlib_node_t *node)
Definition: node_funcs.h:190
static void vlib_process_put_event_data(vlib_main_t *vm, void *event_data)
Definition: node_funcs.h:510
void vlib_register_all_static_nodes(vlib_main_t *vm)
Definition: node.c:489
u64 resume_cpu_time
Definition: node.h:541
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:497
u32 node_runtime_index
Definition: node.h:359
u8 scalar_size
Definition: node.h:338
clib_longjmp_t resume_longjmp
Definition: node.h:503
u32 main_loop_count
Definition: main.h:71
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:268
format_function_t format_vlib_node_graph
Definition: node_funcs.h:1105
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:979
uword * non_empty_event_type_bitmap
Definition: node.h:528
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:916