ligang/vpp
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Typos. A bunch of typos I've been collecting.

Browse Source 
Change-Id: I53ab8d17914e6563110354e4052109ac02bf8f3b
Signed-off-by: Paul Vinciguerra <pvinci@vinciconsulting.com>
This commit is contained in:
Paul Vinciguerra
2019-03-27 11:25:48 -07:00
committed by Neale Ranns
parent 64f7530fff
commit 8feeaff56f
92 changed files with 278 additions and 274 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/plugins/avf/device.c
+3 -3
View File
@@ -377,7 +377,7 @@ avf_send_to_pf (vlib_main_t * vm, avf_device_t * ad, virtchnl_ops_t op,
int n_retry = 5;
/* supppres interrupt in the next adminq receive slot
/* suppress interrupt in the next adminq receive slot
as we are going to wait for response
we only need interrupts when event is received */
d = &ad->arq[ad->arq_next_slot];
@@ -727,7 +727,7 @@ avf_request_queues (vlib_main_t * vm, avf_device_t * ad, u16 num_queue_pairs)
sizeof (virtchnl_vf_res_request_t));
/*
* if PF respondes, the request failed
* if PF responds, the request failed
* else PF initializes restart and avf_send_to_pf returns an error
*/
if (!error)
@@ -788,7 +788,7 @@ avf_device_init (vlib_main_t * vm, avf_main_t * am, avf_device_t * ad,
"(remote %d.%d)", ver.major, ver.minor);
/*
* OP_GET_VF_RESOUCES
* OP_GET_VF_RESOURCES
*/
if ((error = avf_op_get_vf_resources (vm, ad, &res)))
return error;
src/plugins/ct6/ct6_in2out.c
+1 -1
View File
@@ -123,7 +123,7 @@ ct6_create_or_recycle_session (ct6_main_t * cmp,
*createp += 1;
}
/* Sesison setup */
/* Session setup */
memset (s0, 0, sizeof (*s0));
clib_memcpy_fast (s0, kvpp, sizeof (ct6_session_key_t));
s0->thread_index = my_thread_index;
src/plugins/nat/nat.api
+1 -1
View File
@@ -963,7 +963,7 @@ manual_endian define nat44_lb_static_mapping_details {
/** \brief Delete NAT44 session
@param client_index - opaque cookie to identify the sender
@param context - sender context, to match reply w/ request
@param is_in - 1 if inside network addres and port pari, 0 if outside
@param is_in - 1 if inside network address and port pair, 0 if outside
@param ip_address - IPv4 address
@param protocol - IP protocol
@param port - port number
src/plugins/nat/nat.h
+3 -3
View File
@@ -947,7 +947,7 @@ int snat_add_interface_address (snat_main_t * sm, u32 sw_if_index, int is_del,
* @param port L4 port number
* @param proto L4 protocol
* @param vrf_id VRF ID
* @param is_in 1 = inside network addres and por pair, 0 = outside
* @param is_in 1 = inside network address and port pair, 0 = outside
*
* @return 0 on success, non-zero value otherwise
*/
@@ -961,7 +961,7 @@ int nat44_del_session (snat_main_t * sm, ip4_address_t * addr, u16 port,
* @param port L4 port number
* @param proto L4 protocol
* @param vrf_id VRF ID
* @param is_in 1 = inside network addres and por pair, 0 = outside
* @param is_in 1 = inside network address and port pair, 0 = outside
*
* @return 0 on success, non-zero value otherwise
*/
@@ -1042,7 +1042,7 @@ void nat_set_alloc_addr_and_port_default (void);
*
* @param addresses vector of outside addresses
* @param thread_index thread index
* @param k adddress, port and protocol
* @param k address, port and protocol
*/
void snat_free_outside_address_and_port (snat_address_t * addresses,
u32 thread_index,
src/plugins/nat/nat64_cli.c
+2 -1
View File
@@ -358,7 +358,8 @@ nat64_add_del_static_bib_command_fn (vlib_main_t *
goto done;
case VNET_API_ERROR_INVALID_VALUE:
error =
clib_error_return (0, "Outside addres %U and port %u already in use.",
clib_error_return (0,
"Outside address %U and port %u already in use.",
format_ip4_address, &out_addr, out_port);
goto done;
case VNET_API_ERROR_INVALID_VALUE_2:
src/plugins/unittest/bier_test.c
+2 -2
View File
@@ -811,7 +811,7 @@ bier_test_mpls_disp (void)
bti = bier_table_add_or_lock(&bt_0_0_0_256, 1600);
/*
* Add a BIER dispoition table
* Add a BIER disposition table
*/
const u32 bier_disp_tbl_id = 1;
index_t bdti1;
@@ -819,7 +819,7 @@ bier_test_mpls_disp (void)
bdti1 = bier_disp_table_add_or_lock(bier_disp_tbl_id);
/*
* add a bit-poistion in the table that resolves via
* add a bit-position in the table that resolves via
* DISP table, i.e. a for-us bit-position
*/
fib_route_path_t *paths_via_disp = NULL, path_via_disp = {
src/plugins/unittest/bihash_test.c
+1 -1
View File
@@ -181,7 +181,7 @@ test_bihash_threads (bihash_test_main_t * tm)
}
/*
* Callback to blow up spectacularly if anthing remains in the table
* Callback to blow up spectacularly if anything remains in the table
*/
static void
count_items (BVT (clib_bihash_kv) * kvp, void *notused)
src/tools/g2/events.c
+1 -1
View File
@@ -339,7 +339,7 @@ void add_clib_event(double delta, unsigned short track,
event_t *ep;
ep = add_ep++;
ep->time = (ulonglong) (delta * 1e9); /* time in intger nanoseconds */
ep->time = (ulonglong) (delta * 1e9); /* time in integer nanoseconds */
ep->pid = find_or_add_pid(track);
ep->code = event;
ep->datum = index;
src/vlib/buffer.c
+1 -1
View File
@@ -321,7 +321,7 @@ static struct
vlib_main_t **vlib_mains = &__bootstrap_vlib_main_vector.vm;
/* When dubugging validate that given buffers are either known allocated
/* When debugging validate that given buffers are either known allocated
or known free. */
void
vlib_buffer_validate_alloc_free (vlib_main_t * vm,
src/vlib/unix/cj.c
+3 -3
View File
@@ -19,7 +19,7 @@
/**
* @file
* Circular joournal diagnostic mechanism.
* Circular journal diagnostic mechanism.
*
* The @c cj thread-safe circular log buffer scheme is occasionally useful
* when chasing bugs. Calls to it should not be checked in.
@@ -106,7 +106,7 @@ cj_config (vlib_main_t * vm, unformat_input_t * input)
/*?
* Configure the circular journal diagnostic mechanism. This is only useful
* if you, the deveoper, have written code to make use of the circular
* if you, the developer, have written code to make use of the circular
* journal.
*
* @cfgcmd{records, &lt;number&gt;}
@@ -258,7 +258,7 @@ done:
/*?
* Enable, disable the collection of diagnostic data into a
* circular journal or dump the circular journal diagnostic data.
* This is only useful if you, the deveoper, have written code to make
* This is only useful if you, the developer, have written code to make
* use of the circular journal.
*
* When dumping the data it is formatted and sent to @c stderr of the
src/vlib/unix/cli.c
+2 -2
View File
@@ -581,7 +581,7 @@ unix_cli_del_pending_output (clib_file_t * uf,
* @param str The buffer in which to search for the value.
* @param len The depth into the buffer to search.
*
* @return The index of the first occurence of \c chr. If \c chr is not
* @return The index of the first occurrence of \c chr. If \c chr is not
* found then \c len instead.
*/
always_inline word
@@ -899,7 +899,7 @@ unix_cli_pager_redraw (unix_cli_file_t * cf, clib_file_t * uf)
*
* If instead @c line is @c NULL then @c len_or_index is taken to mean the
* index of an existing line in the pager buffer; this simply means that the
* input line does not need to be cloned since we alreayd have it. This is
* input line does not need to be cloned since we already have it. This is
* typical if we are reindexing the pager buffer.
*
* @param cf The CLI session whose pager we are adding to.
src/vnet/adj/adj.c
+4 -4
View File
@@ -213,7 +213,7 @@ adj_recursive_loop_detect (adj_index_t ai,
case IP_LOOKUP_NEXT_ICMP_ERROR:
case IP_LOOKUP_N_NEXT:
/*
* these adjcencey types are terminal graph nodes, so there's no
* these adjacency types are terminal graph nodes, so there's no
* possibility of a loop down here.
*/
break;
@@ -365,7 +365,7 @@ adj_child_remove (adj_index_t adj_index,
}
/*
* Context for the walk to update the cached feture flags.
* Context for the walk to update the cached feature flags.
*/
typedef struct adj_feature_update_t_
{
@@ -715,8 +715,8 @@ adj_cli_counters_set (vlib_main_t * vm,
}
/*?
* Enabe/disble per-adjacency counters. This is optional because it comes with
* a non-negligible performance cost.
* Enable/disable per-adjacency counters. This is optional because it comes
* with a non-negligible performance cost.
?*/
VLIB_CLI_COMMAND (adj_cli_counters_set_command, static) = {
.path = "adjacency counters",
src/vnet/adj/adj_bfd.c
+5 -5
View File
@@ -161,7 +161,7 @@ adj_bfd_notify (bfd_listen_event_e event,
{
/*
* lock the adj. add the delegate.
* Lockinging the adj prevents it being removed and thus maintains
* Locking the adj prevents it being removed and thus maintains
* the BFD derived states
*/
adj_lock(ai);
@@ -173,10 +173,10 @@ adj_bfd_notify (bfd_listen_event_e event,
/*
* it would be best here if we could ignore this create and just
* wait for the first update, but this is not posible because
* wait for the first update, but this is not possible because
* BFD sessions are created in the down state, and can remain this
* way without transitioning to another state if the peer is
* unresponxive. So we have to assuem down and wait for up.
* unresponsive. So we have to assume down and wait for up.
*/
abd->abd_state = ADJ_BFD_STATE_DOWN;
abd->abd_index = session->bs_idx;
@@ -188,7 +188,7 @@ adj_bfd_notify (bfd_listen_event_e event,
case BFD_LISTEN_EVENT_UPDATE:
/*
* state change up/dowm and
* state change up/down and
*/
abd = adj_bfd_from_base(adj_delegate_get(adj_get(ai), ADJ_DELEGATE_BFD));
@@ -213,7 +213,7 @@ adj_bfd_notify (bfd_listen_event_e event,
{
/*
* has an associated BFD tracking delegate
* remove the BFD tracking deletgate, update children, then
* remove the BFD tracking delegate, update children, then
* unlock the adj
*/
adj_delegate_remove(ai, ADJ_DELEGATE_BFD);
src/vnet/adj/adj_delegate.c
+1 -1
View File
@@ -23,7 +23,7 @@
static adj_delegate_vft_t *ad_vfts;
/**
* The value of the last dynamically allocated delegeate value
* The value of the last dynamically allocated delegate value
*/
static adj_delegate_type_t ad_max_id = ADJ_DELEGATE_LAST;
src/vnet/adj/adj_l2.c
+1 -1
View File
@@ -108,7 +108,7 @@ adj_l2_rewrite_inline (vlib_main_t * vm,
adj0[0].rewrite_header.max_l3_packet_bytes)))
{
/* Don't adjust the buffer for ttl issue; icmp-error node wants
* to see the IP headerr */
* to see the IP header */
p0->current_data -= rw_len0;
p0->current_length += rw_len0;
tx_sw_if_index0 = adj0[0].rewrite_header.sw_if_index;
src/vnet/adj/adj_mcast.c
+3 -3
View File
@@ -95,7 +95,7 @@ adj_mcast_add_or_lock (fib_protocol_t proto,
* adj_mcast_update_rewrite
*
* Update the adjacency's rewrite string. A NULL string implies the
* rewirte is reset (i.e. when ARP/ND etnry is gone).
* rewrite is reset (i.e. when ARP/ND entry is gone).
* NB: the adj being updated may be handling traffic in the DP.
*/
void
@@ -129,7 +129,7 @@ adj_mcast_update_rewrite (adj_index_t adj_index,
* adj_mcast_midchain_update_rewrite
*
* Update the adjacency's rewrite string. A NULL string implies the
* rewirte is reset (i.e. when ARP/ND etnry is gone).
* rewrite is reset (i.e. when ARP/ND entry is gone).
* NB: the adj being updated may be handling traffic in the DP.
*/
void
@@ -148,7 +148,7 @@ adj_mcast_midchain_update_rewrite (adj_index_t adj_index,
adj = adj_get(adj_index);
/*
* one time only update. since we don't support chainging the tunnel
* one time only update. since we don't support changing the tunnel
* src,dst, this is all we need.
*/
ASSERT(adj->lookup_next_index == IP_LOOKUP_NEXT_MCAST);
src/vnet/adj/adj_midchain.c
+4 -4
View File
@@ -502,7 +502,7 @@ adj_midchain_setup (adj_index_t adj_index,
* adj_nbr_midchain_update_rewrite
*
* Update the adjacency's rewrite string. A NULL string implies the
* rewrite is reset (i.e. when ARP/ND etnry is gone).
* rewrite is reset (i.e. when ARP/ND entry is gone).
* NB: the adj being updated may be handling traffic in the DP.
*/
void
@@ -519,7 +519,7 @@ adj_nbr_midchain_update_rewrite (adj_index_t adj_index,
adj = adj_get(adj_index);
/*
* one time only update. since we don't support chainging the tunnel
* one time only update. since we don't support changing the tunnel
* src,dst, this is all we need.
*/
ASSERT((adj->lookup_next_index == IP_LOOKUP_NEXT_ARP) ||
@@ -534,7 +534,7 @@ adj_nbr_midchain_update_rewrite (adj_index_t adj_index,
adj_midchain_setup(adj_index, fixup, fixup_data, flags);
/*
* update the rewirte with the workers paused.
* update the rewrite with the workers paused.
*/
adj_nbr_update_rewrite_internal(adj,
IP_LOOKUP_NEXT_MIDCHAIN,
@@ -685,7 +685,7 @@ adj_ndr_midchain_recursive_loop_detect (adj_index_t ai,
{
/*
* The entry this midchain links to is already in the set
* of visisted entries, this is a loop
* of visited entries, this is a loop
*/
adj->ia_flags |= ADJ_FLAG_MIDCHAIN_LOOPED;
return (1);
src/vnet/adj/adj_nbr.c
+8 -8
View File
@@ -291,7 +291,7 @@ adj_nbr_add_or_lock_w_rewrite (fib_protocol_t nh_proto,
* adj_nbr_update_rewrite
*
* Update the adjacency's rewrite string. A NULL string implies the
* rewirte is reset (i.e. when ARP/ND etnry is gone).
* rewrite is reset (i.e. when ARP/ND etnry is gone).
* NB: the adj being updated may be handling traffic in the DP.
*/
void
@@ -333,7 +333,7 @@ adj_nbr_update_rewrite (adj_index_t adj_index,
* adj_nbr_update_rewrite_internal
*
* Update the adjacency's rewrite string. A NULL string implies the
* rewirte is reset (i.e. when ARP/ND etnry is gone).
* rewrite is reset (i.e. when ARP/ND etnry is gone).
* NB: the adj being updated may be handling traffic in the DP.
*/
void
@@ -357,7 +357,7 @@ adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
{
/*
* The link type MPLS has no children in the control plane graph, it only
* has children in the data-palne graph. The backwalk is up the former.
* has children in the data-plane graph. The backwalk is up the former.
* So we need to walk from its IP cousin.
*/
walk_ai = adj_nbr_find(adj->ia_nh_proto,
@@ -394,7 +394,7 @@ adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
* lock the adjacencies that are affected by updates this walk will provoke.
* Since the aim of the walk is to update children to link to a different
* DPO, this adj will no longer be in use and its lock count will drop to 0.
* We don't want it to be deleted as part of this endevour.
* We don't want it to be deleted as part of this endeavour.
*/
adj_lock(adj_get_index(adj));
adj_lock(walk_ai);
@@ -407,7 +407,7 @@ adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
* ideally we would only want to suspend forwarding via this adj whilst we
* do this, but we do not have that level of granularity - it's suspend all
* worker threads or nothing.
* The other chioces are:
* The other choices are:
* - to mark the adj down and back walk so child load-balances drop this adj
* from the set.
* - update the next_node index of this adj to point to error-drop
@@ -418,7 +418,7 @@ adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
* node. So from the options above, updating the next_node of the adj to
* be drop will work, but it relies on each graph node v4/v6/mpls, rewrite/
* arp/midchain always be valid w.r.t. a mis-match of adj type and node type
* (i.e. a rewrite adj in the arp node). This is not enforcable. Getting it
* (i.e. a rewrite adj in the arp node). This is not enforceable. Getting it
* wrong will lead to hard to find bugs since its a race condition. So we
* choose the more reliable method of updating the children to use the drop,
* then switching adj's type, then updating the children again. Did I mention
@@ -440,7 +440,7 @@ adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
fib_node_back_walk_ctx_t bw_ctx = {
.fnbw_reason = FIB_NODE_BW_REASON_FLAG_ADJ_DOWN,
/*
* force this walk to be synchrous. if we don't and a node in the graph
* force this walk to be synchronous. if we don't and a node in the graph
* (a heavily shared path-list) chooses to back-ground the walk (make it
* async) then it will pause and we will do the adj update below, before
* all the children are updated. not good.
@@ -484,7 +484,7 @@ adj_nbr_update_rewrite_internal (ip_adjacency_t *adj,
next_node);
/*
* done with the rewirte update - let the workers loose.
* done with the rewrite update - let the workers loose.
*/
vlib_worker_thread_barrier_release(vm);
src/vnet/adj/adj_nsh.c
+1 -1
View File
@@ -106,7 +106,7 @@ adj_nsh_rewrite_inline (vlib_main_t * vm,
adj0[0].rewrite_header.max_l3_packet_bytes)))
{
/* Don't adjust the buffer for ttl issue; icmp-error node wants
* to see the IP headerr */
* to see the IP header */
p0->current_data -= rw_len0;
p0->current_length += rw_len0;
tx_sw_if_index0 = adj0[0].rewrite_header.sw_if_index;
src/vnet/bfd/bfd_api.c
+1 -1
View File
@@ -417,7 +417,7 @@ vl_api_bfd_udp_get_echo_source_t_handler (vl_api_bfd_udp_get_echo_source_t *
/*
* bfd_api_hookup
* Add vpe's API message handlers to the table.
* vlib has alread mapped shared memory and
* vlib has already mapped shared memory and
* added the client registration handlers.
* See .../vlib-api/vlibmemory/memclnt_vlib.c:memclnt_process()
*/
src/vnet/bier/bier_bit_string.c
+1 -1
View File
@@ -41,7 +41,7 @@ bier_bit_pos_is_valid (bier_bp_t bp, const bier_bit_string_t *bbs)
}
/*
* Validate a bit poistion
* Validate a bit position
*/
#define BIER_BIT_POS_IS_VALID(_bp, _str) \
{ \
src/vnet/bier/bier_disp_entry.c
+5 -5
View File
@@ -13,11 +13,11 @@
* limitations under the License.
*/
/**
* bier_dispositon : The BIER dispositon object
* bier_dispositon : The BIER disposition object
*
* A BIER dispositon object is present in the IP mcast output list
* and represents the dispositon of a BIER bitmask. After BIER header
* dispositon the packet is forward within the appropriate/specifid
* A BIER disposition object is present in the IP mcast output list
* and represents the disposition of a BIER bitmask. After BIER header
* disposition the packet is forward within the appropriate/specified
* BIER table
*/
@@ -315,7 +315,7 @@ bier_disp_entry_dpo_unlock (dpo_id_t *dpo)
static void
bier_disp_entry_dpo_mem_show (void)
{
fib_show_memory_usage("BIER dispositon",
fib_show_memory_usage("BIER disposition",
pool_elts(bier_disp_entry_pool),
pool_len(bier_disp_entry_pool),
sizeof(bier_disp_entry_t));
src/vnet/bier/bier_fmask.c
+2 -2
View File
@@ -311,7 +311,7 @@ bier_fmask_link (index_t bfmi,
if (0 == bfm->bfm_bits.bfmb_refs[BIER_BP_TO_INDEX(bp)])
{
/*
* 0 -> 1 transistion - set the bit in the string
* 0 -> 1 transition - set the bit in the string
*/
bier_bit_string_set_bit(&bfm->bfm_bits.bfmb_input_reset_string, bp);
}
@@ -334,7 +334,7 @@ bier_fmask_unlink (index_t bfmi,
if (0 == bfm->bfm_bits.bfmb_refs[BIER_BP_TO_INDEX(bp)])
{
/*
* 1 -> 0 transistion - clear the bit in the string
* 1 -> 0 transition - clear the bit in the string
*/
bier_bit_string_clear_bit(&bfm->bfm_bits.bfmb_input_reset_string, bp);
}
src/vnet/bier/bier_fmask_db.c
+3 -3
View File
@@ -25,7 +25,7 @@
*
* The table's key is part of this DB key, since the fmasks therein build up
* their forwarding mask based on the routes that resolve through
* it, so cross polination would be bad.
* it, so cross pollination would be bad.
*/
typedef struct bier_fmask_db_t_ {
/**
@@ -143,9 +143,9 @@ bier_fmask_db_remove (const bier_fmask_id_t *fmid)
if (NULL == p) {
/*
* remove a non-exitant entry - oops
* remove a non-existent entry - oops
*/
ASSERT (!"remove non-existant fmask");
ASSERT (!"remove non-existent fmask");
} else {
hash_unset(bier_fmask_db.bfdb_hash, fmid);
}
src/vnet/bier/bier_imp.c
+1 -1
View File
@@ -17,7 +17,7 @@
*
* A BIER imposition object is present in the IP mcast output list
* and represents the imposition of a BIER bitmask. After BIER header
* imposition the packet is forward within the appropriate/specifid
* imposition the packet is forward within the appropriate/specified
* BIER table
*/
src/vnet/bier/bier_imp_node.c
+1 -1
View File
@@ -144,7 +144,7 @@ bier_imp_dpo_inline (vlib_main_t * vm,
/*
* use TTL 64 for the post enacp MPLS label/BIFT-ID
* this we be decremeted in bier_output node.
* this we be decremented in bier_output node.
*/
vnet_buffer(b0)->mpls.ttl = 65;
src/vnet/bier/bier_input.c
+1 -1
View File
@@ -107,7 +107,7 @@ bier_input (vlib_main_t * vm,
bier_hdr_ntoh(bh0);
/*
* In the MPLS decap node we squirelled away the
* In the MPLS decap node we squirrelled away the
* index for the BIER table as the tx adjacency
*/
bt_index0 = vnet_buffer(b0)->ip.adj_index[VLIB_TX];
src/vnet/bier/bier_lookup.c
+1 -1
View File
@@ -22,7 +22,7 @@
#include <vnet/bier/bier_fmask.h>
/**
* Struct maintining the per-worker thread data for BIER lookups
* Struct maintaining the per-worker thread data for BIER lookups
*/
typedef struct bier_lookup_main_t_
{
src/vnet/bier/bier_output.c
+3 -3
View File
@@ -26,7 +26,7 @@ static char * bier_output_error_strings[] = {
};
/*
* Keep these values sematically the same as BIER output
* Keep these values semantically the same as BIER output
*/
#define foreach_bier_output_next \
_(DROP, "bier-drop")
@@ -52,7 +52,7 @@ vlib_node_registration_t bier_output_node;
extern vlib_combined_counter_main_t bier_fmask_counters;
/**
* @brief Packet trace recoed for a BIER output
* @brief Packet trace record for a BIER output
*/
typedef struct bier_output_trace_t_
{
@@ -109,7 +109,7 @@ bier_output (vlib_main_t * vm,
bier_bit_string_init_from_hdr(bh0, &bbs);
/*
* In the BIER Lookup node we squirelled away the
* In the BIER Lookup node we squirrelled away the
* BIER fmask index as the adj index
*/
bfmi0 = vnet_buffer (b0)->ip.adj_index[VLIB_TX];
src/vnet/bier/bier_table.c
+2 -2
View File
@@ -251,7 +251,7 @@ bier_table_mk_lfib (bier_table_t *bt)
FIB_SOURCE_BIER);
/*
* stack the entry on the forwarding chain prodcued by the
* stack the entry on the forwarding chain produced by the
* path-list via the ECMP tables.
*/
fib_path_list_contribute_forwarding(bt->bt_pl,
@@ -309,7 +309,7 @@ bier_table_mk_ecmp (index_t bti)
}
/*
* no oppotunity to share, this the resolving ECMP tables are unique
* no opportunity to share, this the resolving ECMP tables are unique
* to this table.
* no need to be a child of the path list, we can do nothing with any
* notifications it would generate [not that it will].

Some files were not shown because too many files have changed in this diff Show More