2 * Copyright (c) 2016 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:
7 * http://www.apache.org/licenses/LICENSE-2.0
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.
16 #include <vnet/bier/bier_disp_table.h>
17 #include <vnet/bier/bier_hdr_inlines.h>
20 * @brief A struct to hold tracing information for the MPLS label imposition
23 typedef struct bier_disp_lookup_trace_t_
26 * BIER source BP used in the lookup - host order
33 } bier_disp_lookup_trace_t;
36 * Next nodes from BIER disposition lookup
38 typedef enum bier_disp_lookup_next_t_
40 BIER_DISP_LOOKUP_NEXT_DROP,
41 BIER_DISP_LOOKUP_NEXT_DISPATCH,
42 } bier_disp_lookup_next_t;
43 #define BIER_DISP_LOOKUP_N_NEXT (BIER_DISP_LOOKUP_NEXT_DISPATCH+1)
46 bier_disp_lookup_inline (vlib_main_t * vm,
47 vlib_node_runtime_t * node,
48 vlib_frame_t * from_frame)
50 u32 n_left_from, next_index, * from, * to_next;
52 from = vlib_frame_vector_args (from_frame);
53 n_left_from = from_frame->n_vectors;
55 next_index = node->cached_next_index;
57 while (n_left_from > 0)
61 vlib_get_next_frame(vm, node, next_index, to_next, n_left_to_next);
63 while (n_left_from > 0 && n_left_to_next > 0)
65 const bier_hdr_t *hdr0;
66 bier_hdr_src_id_t src0;
78 b0 = vlib_get_buffer (vm, bi0);
80 bdti0 = vnet_buffer(b0)->ip.adj_index[VLIB_TX];
81 hdr0 = vlib_buffer_get_current(b0);
84 * lookup - source is in network order.
86 src0 = bier_hdr_get_src_id(hdr0);
87 next0 = BIER_DISP_LOOKUP_NEXT_DISPATCH;
89 bdei0 = bier_disp_table_lookup(bdti0, src0);
91 if (PREDICT_FALSE(INDEX_INVALID == bdei0))
94 * if a specific match misses, try the default
96 bdei0 = bier_disp_table_lookup(bdti0, 0);
98 if (PREDICT_FALSE(INDEX_INVALID == bdei0))
100 next0 = BIER_DISP_LOOKUP_NEXT_DROP;
104 vnet_buffer(b0)->ip.adj_index[VLIB_TX] = bdei0;
106 if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
108 bier_disp_lookup_trace_t *tr =
109 vlib_add_trace (vm, node, b0, sizeof (*tr));
110 tr->bp = clib_net_to_host_u16(bier_hdr_get_src_id(hdr0));
114 vlib_validate_buffer_enqueue_x1(vm, node, next_index, to_next,
115 n_left_to_next, bi0, next0);
117 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
119 return from_frame->n_vectors;
123 format_bier_disp_lookup_trace (u8 * s, va_list * args)
125 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
126 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
127 bier_disp_lookup_trace_t * t;
129 t = va_arg (*args, bier_disp_lookup_trace_t *);
130 s = format (s, "tbl:%d src:%d", t->bdti, t->bp);
136 bier_disp_lookup (vlib_main_t * vm,
137 vlib_node_runtime_t * node,
138 vlib_frame_t * frame)
140 return (bier_disp_lookup_inline(vm, node, frame));
143 VLIB_REGISTER_NODE (bier_disp_lookup_node) = {
144 .function = bier_disp_lookup,
145 .name = "bier-disp-lookup",
146 .vector_size = sizeof (u32),
148 .format_trace = format_bier_disp_lookup_trace,
149 .n_next_nodes = BIER_DISP_LOOKUP_N_NEXT,
151 [BIER_DISP_LOOKUP_NEXT_DROP] = "bier-drop",
152 [BIER_DISP_LOOKUP_NEXT_DISPATCH] = "bier-disp-dispatch",
155 VLIB_NODE_FUNCTION_MULTIARCH (bier_disp_lookup_node, bier_disp_lookup)