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/buffer.h>
18 #include <vnet/bier/bier_fmask.h>
19 #include <vnet/bier/bier_hdr_inlines.h>
20 #include <vlib/vlib.h>
22 static char * bier_output_error_strings[] = {
23 #define bier_error(n,s) s,
24 #include <vnet/bier/bier_output_error.def>
29 * Keep these values semantically the same as BIER output
31 #define foreach_bier_output_next \
35 #define _(s,n) BIER_OUTPUT_NEXT_##s,
36 foreach_bier_output_next
42 #define bier_error(n,s) BIER_OUTPUT_ERROR_##n,
43 #include <vnet/bier/bier_output_error.def>
46 } bier_output_error_t;
51 vlib_node_registration_t bier_output_node;
52 extern vlib_combined_counter_main_t bier_fmask_counters;
55 * @brief Packet trace record for a BIER output
57 typedef struct bier_output_trace_t_
61 mpls_label_t bfm_label;
62 } bier_output_trace_t;
65 bier_output (vlib_main_t * vm,
66 vlib_node_runtime_t * node,
67 vlib_frame_t * from_frame)
69 vlib_combined_counter_main_t *cm = &bier_fmask_counters;
70 u32 n_left_from, next_index, * from, * to_next;
73 thread_index = vm->thread_index;
74 from = vlib_frame_vector_args (from_frame);
75 n_left_from = from_frame->n_vectors;
78 * objection your honour! speculation!
80 next_index = node->cached_next_index;
82 while (n_left_from > 0)
86 vlib_get_next_frame (vm, node, next_index,
87 to_next, n_left_to_next);
89 while (n_left_from > 0 && n_left_to_next > 0)
91 bier_output_next_t next0;
92 bier_bit_string_t bbs;
107 b0 = vlib_get_buffer (vm, bi0);
108 bh0 = vlib_buffer_get_current (b0);
109 bier_bit_string_init_from_hdr(bh0, &bbs);
112 * In the BIER Lookup node we squirrelled away the
113 * BIER fmask index as the adj index
115 bfmi0 = vnet_buffer (b0)->ip.adj_index[VLIB_TX];
116 bfm0 = bier_fmask_get(bfmi0);
118 vlib_increment_combined_counter(
119 cm, thread_index, bfmi0, 1,
120 vlib_buffer_length_in_chain (vm, b0));
123 * perform the logical AND of the packet's mask with
124 * that of the fmask objects, to reset the bits that
125 * are only on the shortest path the the fmask NH.
127 bier_bit_string_logical_and_string(
128 &bfm0->bfm_bits.bfmb_input_reset_string,
132 * this is the last time we touch the BIER header
133 * so flip to network order
138 * paint the BIER peer's label
140 if (!(bfm0->bfm_flags & BIER_FMASK_FLAG_DISP))
143 * since a BIFT value and a MPLS label are formated the
144 * same, this painting works OK.
146 vlib_buffer_advance(b0, -(word)sizeof(mpls_label_t));
147 h0 = vlib_buffer_get_current(b0);
149 h0[0] = bfm0->bfm_label;
151 ((char*)h0)[3]= vnet_buffer(b0)->mpls.ttl - 1;
155 * setup next graph node
157 next0 = bfm0->bfm_dpo.dpoi_next_node;
158 vnet_buffer(b0)->ip.adj_index[VLIB_TX] = bfm0->bfm_dpo.dpoi_index;
160 if (PREDICT_FALSE(b0->flags & VLIB_BUFFER_IS_TRACED))
162 bier_output_trace_t *tr;
164 tr = vlib_add_trace (vm, node, b0, sizeof (*tr));
165 tr->next_index = next0;
166 tr->bfm_index = bfmi0;
167 tr->bfm_label = bfm0->bfm_label;
170 vlib_validate_buffer_enqueue_x1 (vm, node, next_index,
171 to_next, n_left_to_next,
175 vlib_put_next_frame (vm, node, next_index, n_left_to_next);
178 vlib_node_increment_counter (vm, bier_output_node.index,
179 BIER_OUTPUT_ERROR_NONE,
180 from_frame->n_vectors);
181 return (from_frame->n_vectors);
185 format_bier_output_trace (u8 * s, va_list * args)
187 CLIB_UNUSED (vlib_main_t * vm) = va_arg (*args, vlib_main_t *);
188 CLIB_UNUSED (vlib_node_t * node) = va_arg (*args, vlib_node_t *);
189 bier_output_trace_t * t = va_arg (*args, bier_output_trace_t *);
191 s = format (s, " next [%d], BFM index %d label:%x",
192 t->next_index, t->bfm_index, t->bfm_label);
196 VLIB_REGISTER_NODE (bier_output_node) = {
197 .function = bier_output,
198 .name = "bier-output",
199 /* Takes a vector of packets. */
200 .vector_size = sizeof (u32),
202 .n_errors = BIER_OUTPUT_N_ERROR,
203 .error_strings = bier_output_error_strings,
205 .n_next_nodes = BIER_OUTPUT_N_NEXT,
207 [BIER_OUTPUT_NEXT_DROP] = "bier-drop",
210 .format_trace = format_bier_output_trace,