Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 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 | * buffer_node.h: VLIB buffer handling node helper macros/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 | #ifndef included_vlib_buffer_node_h |
| 41 | #define included_vlib_buffer_node_h |
| 42 | |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 43 | /** \file |
Dave Barach | 9770e20 | 2016-07-06 10:29:27 -0400 | [diff] [blame] | 44 | vlib buffer/node functions |
| 45 | */ |
| 46 | |
| 47 | /** \brief Finish enqueueing two buffers forward in the graph. |
| 48 | Standard dual loop boilerplate element. This is a MACRO, |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 49 | with MULTIPLE SIDE EFFECTS. In the ideal case, |
Dave Barach | 9770e20 | 2016-07-06 10:29:27 -0400 | [diff] [blame] | 50 | <code>next_index == next0 == next1</code>, |
| 51 | which means that the speculative enqueue at the top of the dual loop |
| 52 | has correctly dealt with both packets. In that case, the macro does |
| 53 | nothing at all. |
| 54 | |
| 55 | @param vm vlib_main_t pointer, varies by thread |
| 56 | @param node current node vlib_node_runtime_t pointer |
| 57 | @param next_index speculated next index used for both packets |
| 58 | @param to_next speculated vector pointer used for both packets |
| 59 | @param n_left_to_next number of slots left in speculated vector |
| 60 | @param bi0 first buffer index |
| 61 | @param bi1 second buffer index |
| 62 | @param next0 actual next index to be used for the first packet |
| 63 | @param next1 actual next index to be used for the second packet |
| 64 | |
| 65 | @return @c next_index -- speculative next index to be used for future packets |
| 66 | @return @c to_next -- speculative frame to be used for future packets |
| 67 | @return @c n_left_to_next -- number of slots left in speculative frame |
| 68 | */ |
| 69 | |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 70 | #define vlib_validate_buffer_enqueue_x2(vm,node,next_index,to_next,n_left_to_next,bi0,bi1,next0,next1) \ |
| 71 | do { \ |
Dave Barach | c74b43c | 2020-04-09 17:24:07 -0400 | [diff] [blame] | 72 | ASSERT (bi0 != 0); \ |
| 73 | ASSERT (bi1 != 0); \ |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 74 | int enqueue_code = (next0 != next_index) + 2*(next1 != next_index); \ |
| 75 | \ |
| 76 | if (PREDICT_FALSE (enqueue_code != 0)) \ |
| 77 | { \ |
| 78 | switch (enqueue_code) \ |
| 79 | { \ |
| 80 | case 1: \ |
| 81 | /* A B A */ \ |
| 82 | to_next[-2] = bi1; \ |
| 83 | to_next -= 1; \ |
| 84 | n_left_to_next += 1; \ |
| 85 | vlib_set_next_frame_buffer (vm, node, next0, bi0); \ |
| 86 | break; \ |
| 87 | \ |
| 88 | case 2: \ |
| 89 | /* A A B */ \ |
| 90 | to_next -= 1; \ |
| 91 | n_left_to_next += 1; \ |
| 92 | vlib_set_next_frame_buffer (vm, node, next1, bi1); \ |
| 93 | break; \ |
| 94 | \ |
| 95 | case 3: \ |
| 96 | /* A B B or A B C */ \ |
| 97 | to_next -= 2; \ |
| 98 | n_left_to_next += 2; \ |
| 99 | vlib_set_next_frame_buffer (vm, node, next0, bi0); \ |
| 100 | vlib_set_next_frame_buffer (vm, node, next1, bi1); \ |
| 101 | if (next0 == next1) \ |
| 102 | { \ |
| 103 | vlib_put_next_frame (vm, node, next_index, \ |
| 104 | n_left_to_next); \ |
| 105 | next_index = next1; \ |
| 106 | vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next); \ |
| 107 | } \ |
| 108 | } \ |
| 109 | } \ |
| 110 | } while (0) |
| 111 | |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 112 | |
| 113 | /** \brief Finish enqueueing four buffers forward in the graph. |
| 114 | Standard quad loop boilerplate element. This is a MACRO, |
| 115 | with MULTIPLE SIDE EFFECTS. In the ideal case, |
| 116 | <code>next_index == next0 == next1 == next2 == next3</code>, |
| 117 | which means that the speculative enqueue at the top of the quad loop |
| 118 | has correctly dealt with all four packets. In that case, the macro does |
| 119 | nothing at all. |
| 120 | |
| 121 | @param vm vlib_main_t pointer, varies by thread |
| 122 | @param node current node vlib_node_runtime_t pointer |
| 123 | @param next_index speculated next index used for both packets |
| 124 | @param to_next speculated vector pointer used for both packets |
| 125 | @param n_left_to_next number of slots left in speculated vector |
| 126 | @param bi0 first buffer index |
| 127 | @param bi1 second buffer index |
| 128 | @param bi2 third buffer index |
| 129 | @param bi3 fourth buffer index |
| 130 | @param next0 actual next index to be used for the first packet |
| 131 | @param next1 actual next index to be used for the second packet |
| 132 | @param next2 actual next index to be used for the third packet |
| 133 | @param next3 actual next index to be used for the fourth packet |
| 134 | |
| 135 | @return @c next_index -- speculative next index to be used for future packets |
| 136 | @return @c to_next -- speculative frame to be used for future packets |
| 137 | @return @c n_left_to_next -- number of slots left in speculative frame |
| 138 | */ |
| 139 | |
| 140 | #define vlib_validate_buffer_enqueue_x4(vm,node,next_index,to_next,n_left_to_next,bi0,bi1,bi2,bi3,next0,next1,next2,next3) \ |
| 141 | do { \ |
Dave Barach | c74b43c | 2020-04-09 17:24:07 -0400 | [diff] [blame] | 142 | ASSERT (bi0 != 0); \ |
| 143 | ASSERT (bi1 != 0); \ |
| 144 | ASSERT (bi2 != 0); \ |
| 145 | ASSERT (bi3 != 0); \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 146 | /* After the fact: check the [speculative] enqueue to "next" */ \ |
Eyal Bari | 2e292c6 | 2017-12-04 13:57:45 +0200 | [diff] [blame] | 147 | u32 fix_speculation = (next_index ^ next0) | (next_index ^ next1) \ |
| 148 | | (next_index ^ next2) | (next_index ^ next3); \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 149 | if (PREDICT_FALSE(fix_speculation)) \ |
| 150 | { \ |
| 151 | /* rewind... */ \ |
| 152 | to_next -= 4; \ |
| 153 | n_left_to_next += 4; \ |
| 154 | \ |
Dave Barach | 6b9c6df | 2016-11-16 08:04:58 -0500 | [diff] [blame] | 155 | /* If bi0 belongs to "next", send it there */ \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 156 | if (next_index == next0) \ |
| 157 | { \ |
Dave Barach | 6b9c6df | 2016-11-16 08:04:58 -0500 | [diff] [blame] | 158 | to_next[0] = bi0; \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 159 | to_next++; \ |
| 160 | n_left_to_next --; \ |
| 161 | } \ |
| 162 | else /* send it where it needs to go */ \ |
Dave Barach | 6b9c6df | 2016-11-16 08:04:58 -0500 | [diff] [blame] | 163 | vlib_set_next_frame_buffer (vm, node, next0, bi0); \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 164 | \ |
| 165 | if (next_index == next1) \ |
| 166 | { \ |
Dave Barach | 6b9c6df | 2016-11-16 08:04:58 -0500 | [diff] [blame] | 167 | to_next[0] = bi1; \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 168 | to_next++; \ |
| 169 | n_left_to_next --; \ |
| 170 | } \ |
| 171 | else \ |
Dave Barach | 6b9c6df | 2016-11-16 08:04:58 -0500 | [diff] [blame] | 172 | vlib_set_next_frame_buffer (vm, node, next1, bi1); \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 173 | \ |
| 174 | if (next_index == next2) \ |
| 175 | { \ |
Dave Barach | 6b9c6df | 2016-11-16 08:04:58 -0500 | [diff] [blame] | 176 | to_next[0] = bi2; \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 177 | to_next++; \ |
| 178 | n_left_to_next --; \ |
| 179 | } \ |
| 180 | else \ |
Dave Barach | 6b9c6df | 2016-11-16 08:04:58 -0500 | [diff] [blame] | 181 | vlib_set_next_frame_buffer (vm, node, next2, bi2); \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 182 | \ |
| 183 | if (next_index == next3) \ |
| 184 | { \ |
Dave Barach | 6b9c6df | 2016-11-16 08:04:58 -0500 | [diff] [blame] | 185 | to_next[0] = bi3; \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 186 | to_next++; \ |
| 187 | n_left_to_next --; \ |
| 188 | } \ |
| 189 | else \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 190 | { \ |
Eyal Bari | 2e292c6 | 2017-12-04 13:57:45 +0200 | [diff] [blame] | 191 | vlib_set_next_frame_buffer (vm, node, next3, bi3); \ |
| 192 | \ |
| 193 | /* Change speculation: last 2 packets went to the same node*/ \ |
| 194 | if (next2 == next3) \ |
| 195 | { \ |
| 196 | vlib_put_next_frame (vm, node, next_index, n_left_to_next); \ |
| 197 | next_index = next3; \ |
| 198 | vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next); \ |
| 199 | } \ |
| 200 | } \ |
Dave Barach | 670909e | 2016-10-18 15:25:35 -0400 | [diff] [blame] | 201 | } \ |
| 202 | } while(0); |
| 203 | |
Dave Barach | 9770e20 | 2016-07-06 10:29:27 -0400 | [diff] [blame] | 204 | /** \brief Finish enqueueing one buffer forward in the graph. |
| 205 | Standard single loop boilerplate element. This is a MACRO, |
| 206 | with MULTIPLE SIDE EFFECTS. In the ideal case, |
| 207 | <code>next_index == next0</code>, |
| 208 | which means that the speculative enqueue at the top of the single loop |
| 209 | has correctly dealt with the packet in hand. In that case, the macro does |
| 210 | nothing at all. |
| 211 | |
| 212 | @param vm vlib_main_t pointer, varies by thread |
| 213 | @param node current node vlib_node_runtime_t pointer |
| 214 | @param next_index speculated next index used for both packets |
| 215 | @param to_next speculated vector pointer used for both packets |
| 216 | @param n_left_to_next number of slots left in speculated vector |
| 217 | @param bi0 first buffer index |
| 218 | @param next0 actual next index to be used for the first packet |
| 219 | |
| 220 | @return @c next_index -- speculative next index to be used for future packets |
| 221 | @return @c to_next -- speculative frame to be used for future packets |
| 222 | @return @c n_left_to_next -- number of slots left in speculative frame |
| 223 | */ |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 224 | #define vlib_validate_buffer_enqueue_x1(vm,node,next_index,to_next,n_left_to_next,bi0,next0) \ |
| 225 | do { \ |
Dave Barach | c74b43c | 2020-04-09 17:24:07 -0400 | [diff] [blame] | 226 | ASSERT (bi0 != 0); \ |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 227 | if (PREDICT_FALSE (next0 != next_index)) \ |
| 228 | { \ |
| 229 | vlib_put_next_frame (vm, node, next_index, n_left_to_next + 1); \ |
| 230 | next_index = next0; \ |
| 231 | vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next); \ |
| 232 | \ |
| 233 | to_next[0] = bi0; \ |
| 234 | to_next += 1; \ |
| 235 | n_left_to_next -= 1; \ |
| 236 | } \ |
| 237 | } while (0) |
| 238 | |
| 239 | always_inline uword |
| 240 | generic_buffer_node_inline (vlib_main_t * vm, |
| 241 | vlib_node_runtime_t * node, |
| 242 | vlib_frame_t * frame, |
| 243 | uword sizeof_trace, |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 244 | void *opaque1, |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 245 | uword opaque2, |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 246 | void (*two_buffers) (vlib_main_t * vm, |
| 247 | void *opaque1, |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 248 | uword opaque2, |
| 249 | vlib_buffer_t * b0, |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 250 | vlib_buffer_t * b1, |
| 251 | u32 * next0, u32 * next1), |
| 252 | void (*one_buffer) (vlib_main_t * vm, |
| 253 | void *opaque1, uword opaque2, |
| 254 | vlib_buffer_t * b0, |
| 255 | u32 * next0)) |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 256 | { |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 257 | u32 n_left_from, *from, *to_next; |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 258 | u32 next_index; |
| 259 | |
| 260 | from = vlib_frame_vector_args (frame); |
| 261 | n_left_from = frame->n_vectors; |
| 262 | next_index = node->cached_next_index; |
| 263 | |
| 264 | if (node->flags & VLIB_NODE_FLAG_TRACE) |
| 265 | vlib_trace_frame_buffers_only (vm, node, from, frame->n_vectors, |
| 266 | /* stride */ 1, sizeof_trace); |
| 267 | |
| 268 | while (n_left_from > 0) |
| 269 | { |
| 270 | u32 n_left_to_next; |
| 271 | |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 272 | vlib_get_next_frame (vm, node, next_index, to_next, n_left_to_next); |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 273 | |
| 274 | while (n_left_from >= 4 && n_left_to_next >= 2) |
| 275 | { |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 276 | vlib_buffer_t *p0, *p1; |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 277 | u32 pi0, next0; |
| 278 | u32 pi1, next1; |
| 279 | |
| 280 | /* Prefetch next iteration. */ |
| 281 | { |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 282 | vlib_buffer_t *p2, *p3; |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 283 | |
| 284 | p2 = vlib_get_buffer (vm, from[2]); |
| 285 | p3 = vlib_get_buffer (vm, from[3]); |
| 286 | |
| 287 | vlib_prefetch_buffer_header (p2, LOAD); |
| 288 | vlib_prefetch_buffer_header (p3, LOAD); |
| 289 | |
Damjan Marion | af7fb04 | 2021-07-15 11:54:41 +0200 | [diff] [blame] | 290 | clib_prefetch_load (p2->data); |
| 291 | clib_prefetch_load (p3->data); |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 292 | } |
| 293 | |
| 294 | pi0 = to_next[0] = from[0]; |
| 295 | pi1 = to_next[1] = from[1]; |
| 296 | from += 2; |
| 297 | to_next += 2; |
| 298 | n_left_from -= 2; |
| 299 | n_left_to_next -= 2; |
| 300 | |
| 301 | p0 = vlib_get_buffer (vm, pi0); |
| 302 | p1 = vlib_get_buffer (vm, pi1); |
| 303 | |
| 304 | two_buffers (vm, opaque1, opaque2, p0, p1, &next0, &next1); |
| 305 | |
| 306 | vlib_validate_buffer_enqueue_x2 (vm, node, next_index, |
| 307 | to_next, n_left_to_next, |
| 308 | pi0, pi1, next0, next1); |
| 309 | } |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 310 | |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 311 | while (n_left_from > 0 && n_left_to_next > 0) |
| 312 | { |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 313 | vlib_buffer_t *p0; |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 314 | u32 pi0, next0; |
| 315 | |
| 316 | pi0 = from[0]; |
| 317 | to_next[0] = pi0; |
| 318 | from += 1; |
| 319 | to_next += 1; |
| 320 | n_left_from -= 1; |
| 321 | n_left_to_next -= 1; |
| 322 | |
| 323 | p0 = vlib_get_buffer (vm, pi0); |
| 324 | |
| 325 | one_buffer (vm, opaque1, opaque2, p0, &next0); |
| 326 | |
| 327 | vlib_validate_buffer_enqueue_x1 (vm, node, next_index, |
| 328 | to_next, n_left_to_next, |
| 329 | pi0, next0); |
| 330 | } |
| 331 | |
| 332 | vlib_put_next_frame (vm, node, next_index, n_left_to_next); |
| 333 | } |
| 334 | |
| 335 | return frame->n_vectors; |
| 336 | } |
| 337 | |
Benoît Ganne | 10bb21f | 2021-09-08 16:26:52 +0200 | [diff] [blame^] | 338 | /* Minimum size for the 'buffers' and 'nexts' arrays to be used when calling |
| 339 | * vlib_buffer_enqueue_to_next(). |
| 340 | * Because of optimizations, vlib_buffer_enqueue_to_next() will access |
| 341 | * past 'count' elements in the 'buffers' and 'nexts' arrays, IOW it |
| 342 | * will overflow. |
| 343 | * Those overflow elements are ignored in the final result so they do not |
| 344 | * need to be properly initialized, however if the array is allocated right |
| 345 | * before the end of a page and the next page is not mapped, accessing the |
| 346 | * overflow elements will trigger a segfault. */ |
| 347 | #define VLIB_BUFFER_ENQUEUE_MIN_SIZE(n) round_pow2 ((n), 64) |
| 348 | |
Damjan Marion | 8c3f8a2 | 2018-05-17 21:12:13 +0200 | [diff] [blame] | 349 | static_always_inline void |
| 350 | vlib_buffer_enqueue_to_next (vlib_main_t * vm, vlib_node_runtime_t * node, |
| 351 | u32 * buffers, u16 * nexts, uword count) |
| 352 | { |
Damjan Marion | 1c22971 | 2021-04-21 12:55:15 +0200 | [diff] [blame] | 353 | vlib_buffer_enqueue_to_next_fn_t *fn; |
| 354 | fn = vlib_buffer_func_main.buffer_enqueue_to_next_fn; |
| 355 | (fn) (vm, node, buffers, nexts, count); |
Damjan Marion | 8c3f8a2 | 2018-05-17 21:12:13 +0200 | [diff] [blame] | 356 | } |
| 357 | |
Damjan Marion | 142eb85 | 2018-11-20 09:56:01 +0100 | [diff] [blame] | 358 | static_always_inline void |
Benoît Ganne | 10bb21f | 2021-09-08 16:26:52 +0200 | [diff] [blame^] | 359 | vlib_buffer_enqueue_to_next_vec (vlib_main_t *vm, vlib_node_runtime_t *node, |
| 360 | u32 **buffers, u16 **nexts, uword count) |
| 361 | { |
| 362 | const u32 bl = vec_len (*buffers), nl = vec_len (*nexts); |
| 363 | const u32 c = VLIB_BUFFER_ENQUEUE_MIN_SIZE (count); |
| 364 | ASSERT (bl >= count && nl >= count); |
| 365 | vec_validate (*buffers, c); |
| 366 | vec_validate (*nexts, c); |
| 367 | vlib_buffer_enqueue_to_next (vm, node, *buffers, *nexts, count); |
| 368 | vec_set_len (*buffers, bl); |
| 369 | vec_set_len (*nexts, nl); |
| 370 | } |
| 371 | |
| 372 | static_always_inline void |
Damjan Marion | 142eb85 | 2018-11-20 09:56:01 +0100 | [diff] [blame] | 373 | vlib_buffer_enqueue_to_single_next (vlib_main_t * vm, |
| 374 | vlib_node_runtime_t * node, u32 * buffers, |
| 375 | u16 next_index, u32 count) |
| 376 | { |
Damjan Marion | 1c22971 | 2021-04-21 12:55:15 +0200 | [diff] [blame] | 377 | vlib_buffer_enqueue_to_single_next_fn_t *fn; |
| 378 | fn = vlib_buffer_func_main.buffer_enqueue_to_single_next_fn; |
| 379 | (fn) (vm, node, buffers, next_index, count); |
Damjan Marion | 142eb85 | 2018-11-20 09:56:01 +0100 | [diff] [blame] | 380 | } |
| 381 | |
Damjan Marion | 78fd7e8 | 2018-07-20 18:47:05 +0200 | [diff] [blame] | 382 | static_always_inline u32 |
Damjan Marion | 9e7a0b4 | 2021-05-14 14:50:01 +0200 | [diff] [blame] | 383 | vlib_buffer_enqueue_to_thread (vlib_main_t *vm, vlib_node_runtime_t *node, |
| 384 | u32 frame_queue_index, u32 *buffer_indices, |
| 385 | u16 *thread_indices, u32 n_packets, |
| 386 | int drop_on_congestion) |
Damjan Marion | 4d56e05 | 2018-07-19 17:52:31 +0200 | [diff] [blame] | 387 | { |
Damjan Marion | 1c22971 | 2021-04-21 12:55:15 +0200 | [diff] [blame] | 388 | vlib_buffer_enqueue_to_thread_fn_t *fn; |
| 389 | fn = vlib_buffer_func_main.buffer_enqueue_to_thread_fn; |
Damjan Marion | 9e7a0b4 | 2021-05-14 14:50:01 +0200 | [diff] [blame] | 390 | return (fn) (vm, node, frame_queue_index, buffer_indices, thread_indices, |
Damjan Marion | 1c22971 | 2021-04-21 12:55:15 +0200 | [diff] [blame] | 391 | n_packets, drop_on_congestion); |
Damjan Marion | 4d56e05 | 2018-07-19 17:52:31 +0200 | [diff] [blame] | 392 | } |
| 393 | |
Ed Warnicke | cb9cada | 2015-12-08 15:45:58 -0700 | [diff] [blame] | 394 | #endif /* included_vlib_buffer_node_h */ |
Dave Barach | 9b8ffd9 | 2016-07-08 08:13:45 -0400 | [diff] [blame] | 395 | |
| 396 | /* |
| 397 | * fd.io coding-style-patch-verification: ON |
| 398 | * |
| 399 | * Local Variables: |
| 400 | * eval: (c-set-style "gnu") |
| 401 | * End: |
| 402 | */ |