summaryrefslogtreecommitdiffstats
path: root/src/vnet/bier/bier_disp_table.h
blob: c5b211001e2fe077688f4e9b7c7d5bd25ba0a894 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
/*
 * Copyright (c) 2016 Cisco and/or its affiliates.
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at:
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#ifndef __BIER_DISP_TABLE_H__
#define __BIER_DISP_TABLE_H__

#include <vnet/ip/ip.h>
#include <vnet/adj/adj.h>
#include <vnet/dpo/replicate_dpo.h>

#include <vnet/bier/bier_types.h>
#include <vnet/bier/bier_disp_entry.h>

/**
 * @brief
 *   A protocol Independent IP multicast FIB table
 */
typedef struct bier_disp_table_t_
{
    /**
     * Required for pool_get_aligned
     */
    CLIB_CACHE_LINE_ALIGN_MARK(cacheline0);

    /**
     * number of locks on the table
     */
    u16 bdt_locks;

    /**
     * Table ID (hash key) for this FIB.
     */
    u32 bdt_table_id;

    /**
     * The lookup DB based on sender BP. Value is the index of the
     * BIER disp object.
     */
    index_t bdt_db[BIER_BP_MAX];
} bier_disp_table_t;

/**
 * @brief
 *  Format the description/name of the table
 */
extern u8* format_bier_disp_table(u8* s, va_list *ap);

extern void bier_disp_table_entry_path_add(u32 table_id,
                                           bier_bp_t src,
                                           bier_hdr_proto_id_t payload_proto,
                                           const fib_route_path_t *rpath);

extern void bier_disp_table_entry_path_remove(u32 table_id,
                                              bier_bp_t src,
                                              bier_hdr_proto_id_t payload_proto,
                                              const fib_route_path_t *paths);

extern index_t bier_disp_table_find(u32 table_id);


extern index_t bier_disp_table_add_or_lock(u32 table_id);
extern void bier_disp_table_unlock_w_table_id(u32 table_id);

extern void bier_disp_table_unlock(index_t bdti);
extern void bier_disp_table_lock(index_t bdti);
extern void bier_disp_table_contribute_forwarding(index_t bdti,
                                                  dpo_id_t *dpo);

/**
 * Types and functions to walk all the entries in one BIER Table
 */
typedef void (*bier_disp_table_walk_fn_t)(const bier_disp_table_t *bdt,
                                          const bier_disp_entry_t *bde,
                                          u16 bp,
                                          void *ctx);
extern void bier_disp_table_walk(u32 table_id,
                                 bier_disp_table_walk_fn_t fn,
                                 void *ctx);

/**
 * @brief
 * Get a pointer to a FIB table
 */
extern bier_disp_table_t *bier_disp_table_pool;

static inline bier_disp_table_t *
bier_disp_table_get (index_t bdti)
{
    return (pool_elt_at_index(bier_disp_table_pool, bdti));
}

static inline index_t
bier_disp_table_lookup (index_t bdti,
                        bier_hdr_src_id_t src)
{
    bier_disp_table_t *bdt;

    bdt = bier_disp_table_get(bdti);

    return (bdt->bdt_db[src]);
}

#endif
an> = i_max_n_zero; n_zeros = 0; for (i = 0; i < ARRAY_LEN (a->as_u16); i++) { u32 is_zero = a->as_u16[i] == 0; if (is_zero && i_first_zero >= ARRAY_LEN (a->as_u16)) { i_first_zero = i; n_zeros = 0; } n_zeros += is_zero; if ((!is_zero && n_zeros > max_n_zeros) || (i + 1 >= ARRAY_LEN (a->as_u16) && n_zeros > max_n_zeros)) { i_max_n_zero = i_first_zero; max_n_zeros = n_zeros; i_first_zero = ARRAY_LEN (a->as_u16); n_zeros = 0; } } last_double_colon = 0; for (i = 0; i < ARRAY_LEN (a->as_u16); i++) { if (i == i_max_n_zero && max_n_zeros > 1) { s = format (s, "::"); i += max_n_zeros - 1; last_double_colon = 1; } else { s = format (s, "%s%x", (last_double_colon || i == 0) ? "" : ":", clib_net_to_host_u16 (a->as_u16[i])); last_double_colon = 0; } } return s; } static void vat_json_indent_print (vat_print_ctx_t * ctx) { int i; for (i = 0; i < ctx->indent * VAT_TAB_WIDTH; i++) { fformat (ctx->ofp, " "); } } static void vat_json_indent_line (vat_print_ctx_t * ctx, char *fmt, ...) { va_list va; vat_json_indent_print (ctx); va_start (va, fmt); va_fformat (ctx->ofp, fmt, &va); va_end (va); } static u8 is_num_only (vat_json_node_t * p) { vat_json_node_t *elem; vec_foreach (elem, p) { if (VAT_JSON_INT != elem->type && VAT_JSON_UINT != elem->type) { return 0; } } return 1; } static void vat_json_print_internal (vat_print_ctx_t * ctx, vat_json_node_t * node) { #define P(fmt,...) fformat(ctx->ofp, fmt, ##__VA_ARGS__) #define PL(fmt,...) fformat(ctx->ofp, fmt"\n", ##__VA_ARGS__) #define PPL(fmt,...) vat_json_indent_line(ctx, fmt"\n", ##__VA_ARGS__) #define PP(fmt,...) vat_json_indent_line(ctx, fmt, ##__VA_ARGS__) #define INCR (ctx->indent++) #define DECR (ctx->indent--) vat_json_pair_t *pair; u32 i, count; vat_json_node_t *elem; u8 num_only = 0; if (!node) { return; } switch (node->type) { case VAT_JSON_OBJECT: count = vec_len (node->pairs); if (count >= 1) { PL ("{"); INCR; for (i = 0; i < count; i++) { pair = &node->pairs[i]; PP ("\"%s\": ", pair->name); vat_json_print_internal (ctx, &pair->value); if (i < count - 1) { P (","); } PL (); } DECR; PP ("}"); } else { P ("{}"); } break; case VAT_JSON_ARRAY: num_only = is_num_only (node->array); count = vec_len (node->array); if (count >= 1) { if (num_only) P ("["); else PL ("[ "); INCR; for (i = 0; i < count; i++) { elem = &node->array[i]; if (!num_only) { vat_json_indent_print (ctx); } vat_json_print_internal (ctx, elem); if (i < count - 1) { if (num_only) { P (", "); } else { P (","); } } if (!num_only) PL (); } DECR; if (!num_only) PP ("]"); else P ("]"); } else { P ("[]"); } break; case VAT_JSON_INT: P ("%d", node->sint); break; case VAT_JSON_UINT: P ("%" PRIu64, node->uint); break; case VAT_JSON_REAL: P ("%f", node->real); break; case VAT_JSON_STRING: P ("\"%s\"", node->string); break; case VAT_JSON_IPV4: P ("\"%U\"", vat_json_format_ip4_address, &node->ip4); break; case VAT_JSON_IPV6: P ("\"%U\"", vat_json_format_ip6_address, &node->ip6); break; default: break; } #undef PPL #undef PP #undef PL #undef P } void vat_json_print (FILE * ofp, vat_json_node_t * node) { vat_print_ctx_t ctx; clib_memset (&ctx, 0, sizeof ctx); ctx.indent = 0; ctx.ofp = ofp; fformat (ofp, "\n"); vat_json_print_internal (&ctx, node); fformat (ofp, "\n"); } void vat_json_free (vat_json_node_t * node) { int i = 0; if (NULL == node) { return; } switch (node->type) { case VAT_JSON_OBJECT: for (i = 0; i < vec_len (node->pairs); i++) { vat_json_free (&node->pairs[i].value); } if (NULL != node->pairs) { vec_free (node->pairs); } break; case VAT_JSON_ARRAY: for (i = 0; i < vec_len (node->array); i++) { vat_json_free (&node->array[i]); } if (NULL != node->array) { vec_free (node->array); } break; case VAT_JSON_STRING: if (NULL != node->string) { vec_free (node->string); } break; default: break; } } /* * fd.io coding-style-patch-verification: ON * * Local Variables: * eval: (c-set-style "gnu") * End: */