This is a new commit for code under a different maintainer.
Change-Id: I79fa403fec6a312238a9a4b18b35dbcafaa05439
Signed-off-by: Paul Vinciguerra <pvinci@vinciconsulting.com>
vl_api_l2_macs_event_t_handler (vl_api_l2_macs_event_t * mp)
{
u32 n_macs = ntohl (mp->n_macs);
- errmsg ("L2MAC event recived with pid %d cl-idx %d for %d macs: \n",
+ errmsg ("L2MAC event received with pid %d cl-idx %d for %d macs: \n",
ntohl (mp->pid), mp->client_index, n_macs);
int i;
for (i = 0; i < n_macs; i++)
if (!address_set)
{
- errmsg ("IP addres not set");
+ errmsg ("IP address not set");
return -99;
}
_(one_add_del_l2_arp_entry, "[del] mac <mac> bd <bd> ip4 <ip4>") \
_(one_l2_arp_bd_get, "") \
_(one_l2_arp_entries_get, "bd <bridge-domain>") \
-_(one_stats_enable_disable, "enable|disalbe") \
+_(one_stats_enable_disable, "enable|disable") \
_(show_one_stats_enable_disable, "") \
_(one_eid_table_vni_dump, "") \
_(one_eid_table_map_dump, "l2|l3") \
ep = vl_msg_api_alloc (sizeof (*ep));
ep->_vl_msg_id = ntohs(VL_API_MEMCLNT_RX_THREAD_SUSPEND);
vl_msg_api_send_shmem(am->vl_input_queue, (u8 *)&ep);
- /* Wait for RX thread to tell us it has suspendend */
+ /* Wait for RX thread to tell us it has suspended */
pthread_cond_wait(&pm->suspend_cv, &pm->queue_lock);
rx_is_running = false;
}
/*
* vpe_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 .../open-repo/vlib/memclnt_vlib.c:memclnt_process()
*/
void
vlib_cli_output (struct vlib_main_t *vm, char *fmt, ...)
{
- clib_warning ("vlib_cli_output callled...");
+ clib_warning ("vlib_cli_output called...");
}
void
vlib_cli_output (struct vlib_main_t *vm, char *fmt, ...)
{
- clib_warning ("vlib_cli_output callled...");
+ clib_warning ("vlib_cli_output called...");
}
u8 *
void
vlib_cli_output (struct vlib_main_t *vm, char *fmt, ...)
{
- clib_warning ("BUG: vlib_cli_output callled...");
+ clib_warning ("BUG: vlib_cli_output called...");
}
#define foreach_api_msg \
* SR APIs: see .../src/vnet/srv6/{sr.api, sr_api.c}
* CLASSIFY APIs: see ... /src/vnet/classify/{classify.api, classify_api.c}
* FLOW APIs: see ... /src/vnet/flow/{flow.api, flow_api.c}
- * DHCP APIs: see ... /src/vnet/dhcp/{dhcpk.api, dhcp_api.c}
+ * DHCP APIs: see ... /src/vnet/dhcp/{dhcp.api, dhcp_api.c}
* COP APIs: see ... /src/vnet/cop/{cop.api, cop_api.c}
* POLICER APIs: see ... /src/vnet/policer/{policer.api, policer_api.c}
* STATS APIs: see .../src/vpp/stats/{stats.api, stats.c}
}
/*?
- * This commmand displays image version and command line arguments
+ * This command displays image version and command line arguments
*
* @cliexpar
* How to display the image version string:
# All groups allowed to access hugepages
vm.hugetlb_shm_group=0
-# Shared Memory Max must be greator or equal to the total size of hugepages.
+# Shared Memory Max must be greater or equal to the total size of hugepages.
# For 2MB pages, TotalHugepageSize = vm.nr_hugepages * 2 * 1024 * 1024
# If the existing kernel.shmmax setting (cat /sys/proc/kernel/shmmax)
# is greater than the calculated TotalHugepageSize then set this parameter
}
# dpdk {
- ## Change default settings for all intefaces
+ ## Change default settings for all interfaces
# dev default {
## Number of receive queues, enables RSS
## Default is 1
## uio_pci_generic or auto (default)
# uio-driver vfio-pci
- ## Disable mutli-segment buffers, improves performance but
+ ## Disable multi-segment buffers, improves performance but
## disables Jumbo MTU support
# no-multi-seg
u32 pid;
};
-/** \brief Want IP4 muilticast FIB Stats, register for continuous stats
+/** \brief Want IP4 multicast FIB Stats, register for continuous stats
@param client_index - opaque cookie to identify the sender
@param context - sender context, to match reply w/ request
@param enable_disable - 1 = enable stats, 0 = disable
};
/**
- * @brief Per-neighbour (i.e. per-adjacency) coutners
+ * @brief Per-neighbour (i.e. per-adjacency) counters
* @param count The size of the array of counters
* @param sw_if_index The interface the adjacency is on
* @param begin Flag to indicate this is the first set of stats for this
/** \brief Stat for one BIER neighbor object
@param tbl_id - The BIER Table ID the neighbour belongs to.
- @param path - The path describing the negihbor (this is the data
+ @param path - The path describing the neighbor (this is the data
given during a BIER route add)
@param packets - number of packets sent
@param bytes - number of bytes sent
```
#### Writer
-On the VPP side there is a single writer (controlled by a spinlock). When the writer starts it sets in_progress=1, continues with the update of the data-structues, and when done, bumps epoch++ and sets in_progress=0.
+On the VPP side there is a single writer (controlled by a spinlock). When the writer starts it sets in_progress=1, continues with the update of the data-structures, and when done, bumps epoch++ and sets in_progress=0.
#### Readers
If in_progress=1, there is no point continuing, so reader sits spinning on the in_progress flag until it is 0. Then it sets start_epoch = epoch and continues copying out the counter data it is interested in, while doing strict boundary checks on all offsets / pointers. When the reader is done, it checks if in_progress=1 or if epoch != start_epoch. If either of those are true is discards the data read.
#define CALL_MREMAP(addr, osz, nsz, mv) MFAIL
#endif /* HAVE_MMAP && HAVE_MREMAP */
-/* mstate bit set if continguous morecore disabled or failed */
+/* mstate bit set if contiguous morecore disabled or failed */
#define USE_NONCONTIGUOUS_BIT (4U)
/* mstate bit set if no expansion allowed */
http://www.usenix.org/events/lisa03/tech/robertson.html The footer
of an inuse chunk holds the xor of its mstate and a random seed,
that is checked upon calls to free() and realloc(). This is
- (probabalistically) unguessable from outside the program, but can be
+ (probabilistically) unguessable from outside the program, but can be
computed by any code successfully malloc'ing any chunk, so does not
itself provide protection against code that has already broken
security through some other means. Unlike Robertson et al, we
void dlfree(void* mem) {
/*
- Consolidate freed chunks with preceeding or succeeding bordering
+ Consolidate freed chunks with preceding or succeeding bordering
free chunks, if they exist, and then place in a bin. Intermixed
with special cases for top, dv, mmapped chunks, and usage errors.
*/
Wolfram Gloger (Gloger@lrz.uni-muenchen.de).
* Use last_remainder in more cases.
* Pack bins using idea from colin@nyx10.cs.du.edu
- * Use ordered bins instead of best-fit threshhold
+ * Use ordered bins instead of best-fit threshold
* Eliminate block-local decls to simplify tracing and debugging.
* Support another case of realloc via move into top
- * Fix error occuring when initial sbrk_base not word-aligned.
+ * Fix error occurring when initial sbrk_base not word-aligned.
* Rely on page size for units instead of SBRK_UNIT to
avoid surprises about sbrk alignment conventions.
* Add mallinfo, mallopt. Thanks to Raymond Nijssen
_ (68HC12, 53) /* Motorola M68HC12 */ \
_ (MMA, 54) /* Fujitsu MMA Multimedia Accel. */ \
_ (PCP, 55) /* Siemens PCP */ \
- _ (NCPU, 56) /* Sony nCPU embeeded RISC */ \
+ _ (NCPU, 56) /* Sony nCPU embedded RISC */ \
_ (NDR1, 57) /* Denso NDR1 microprocessor */ \
_ (STARCORE, 58) /* Motorola Start*Core processor */ \
_ (ME16, 59) /* Toyota ME16 processor */ \
/*
* Move the earlier set of events later, to avoid creating
- * events which preceed the Big Bang (aka have negative timestamps).
+ * events which precede the Big Bang (aka have negative timestamps).
*
* Not to any scale, we have something like the following picture:
*
/* Public macro to set (key, value) for pointer key */
#define hash_set_mem(h,key,value) hash_set3 (h, pointer_to_uword (key), (value), 0)
-/* Public inline funcion allocate and copy key to use in hash for pointer key */
+/* Public inline function allocate and copy key to use in hash for pointer key */
always_inline void
hash_set_mem_alloc (uword ** h, void *key, uword v)
{
/* Public macro to unset (key, value) for pointer key */
#define hash_unset_mem(h,key) ((h) = _hash_unset ((h), pointer_to_uword (key),0))
-/* Public inline funcion to unset pointer key and then free the key memory */
+/* Public inline function to unset pointer key and then free the key memory */
always_inline void
hash_unset_mem_free (uword ** h, void *key)
{
clib_error_t *hash_validate (void *v);
-/* Public inline funcion to get the number of value bytes for a hash table */
+/* Public inline function to get the number of value bytes for a hash table */
always_inline uword
hash_value_bytes (hash_t * h)
{
return (sizeof (p->value[0]) << h->log2_pair_size) - sizeof (p->key);
}
-/* Public inline funcion to get log2(size of a (key,value) pair) */
+/* Public inline function to get log2(size of a (key,value) pair) */
always_inline uword
hash_pair_log2_bytes (hash_t * h)
{
return log2_bytes;
}
-/* Public inline funcion to get size of a (key,value) pair */
+/* Public inline function to get size of a (key,value) pair */
always_inline uword
hash_pair_bytes (hash_t * h)
{
return (uword) 1 << hash_pair_log2_bytes (h);
}
-/* Public inline funcion to advance a pointer past one (key,value) pair */
+/* Public inline function to advance a pointer past one (key,value) pair */
always_inline void *
hash_forward1 (hash_t * h, void *v)
{
return (u8 *) v + hash_pair_bytes (h);
}
-/* Public inline funcion to advance a pointer past N (key,value) pairs */
+/* Public inline function to advance a pointer past N (key,value) pairs */
always_inline void *
hash_forward (hash_t * h, void *v, uword n)
{
calls body with each active hash pair
*/
-/* Iteratate over key/value pairs. */
+/* Iterate over key/value pairs. */
#define hash_foreach(key_var,value_var,h,body) \
do { \
hash_pair_t * _r; \
format_function_t *format_elt;
- /* Used for validattion/debugging. */
+ /* Used for validation/debugging. */
uword *used_elt_bitmap;
/* First and last element of doubly linked chain of elements. */
u32 flags;
/* Static heaps are made from external memory given to
- us by user and are not re-sizeable vectors. */
+ us by user and are not re-sizable vectors. */
#define HEAP_IS_STATIC (1)
} heap_header_t;
u64 file_size_in_bytes; /**< file size in bytes */
u32 record_size_in_bytes; /**< record size in bytes */
u32 application_id; /**< application identifier */
- u8 application_major_version; /**< applcation major version number */
- u8 application_minor_version; /**< applcation minor version number */
- u8 application_patch_version; /**< applcation patch version number */
+ u8 application_major_version; /**< application major version number */
+ u8 application_minor_version; /**< application minor version number */
+ u8 application_patch_version; /**< application patch version number */
u8 maplog_is_circular; /**< single, circular log */
} clib_maplog_init_args_t;
}
-#endif /* included_clib_mamcpy_avx2_h */
+#endif /* included_clib_memcpy_avx2_h */
/*
}
-#endif /* included_clib_mamcpy_avx512_h */
+#endif /* included_clib_memcpy_avx512_h */
/*
{
u32 heap_handle;
- /* Must conincide with vec_header. */
+ /* Must coincide with vec_header. */
vec_header_t vec;
} mhash_string_key_t;
void mheap_usage (void *v, clib_mem_usage_t * usage);
-/* Enable disable traceing. */
+/* Enable disable tracing. */
void mheap_trace (void *v, int enable);
/* Test routine. */
/* External panic function. */
void os_panic (void);
-/* External exit function analagous to unix exit. */
+/* External exit function analogous to unix exit. */
void os_exit (int code);
/* External function to print a line. */
/* tb_parent with v has either one or zero collisions. */
- /* add childb to the queue of reachable things */
+ /* add child b to the queue of reachable things */
if (tb_child)
tb_child->water_b = high_water;
pm->tabq[tail].b_q = tb_child ? tb_child - pm->tabb : ~0;
}
/**
- * @brief Remove all elemenets from a pool in a safe way
+ * @brief Remove all elements from a pool in a safe way
*
* @param VAR each element in the pool
* @param POOL The pool to flush
* of the first, last and middle elements). (Using this median instead of
* the first element is a big win). Then, the usual partitioning/swapping,
* followed by moving the discriminator into the right place. Then, figure
- * out the sizes of the two partions, do the smaller one recursively and the
+ * out the sizes of the two partitions, do the smaller one recursively and the
* larger one via a repeat of this code. Stopping when there are less than
* THRESH elements in a partition and cleaning up with an insertion sort (in
* our caller) is a huge win. All data swaps are done in-line, which is
/* A structure for both vector headers and vector elements might be useful to
- uncover potential alignement issues. */
+ uncover potential alignment issues. */
typedef struct
{
typedef struct
{
/* Time of this element in units cpu clock ticks relative to time
- base. 32 bits should be large enough for serveral kilo-seconds
+ base. 32 bits should be large enough for several kilo-seconds
to elapse before we have to re-set time base. */
u32 cpu_time_relative_to_base;
#endif
/* Parse delimited vector string. If string starts with { then string
- is delimited by balenced parenthesis. Other string is delimited by
+ is delimited by balanced parenthesis. Other string is delimited by
white space. {} were chosen since they are special to the shell. */
static uword
unformat_string (unformat_input_t * input,
/* These requests allow control to move from the simulated CPU to the
- real CPU, calling an arbitary function.
+ real CPU, calling an arbitrary function.
Note that the current ThreadId is inserted as the first argument.
So this call:
#define included_clib_vec_bootstrap_h
/** \file
- Vector bootsrap header file
+ Vector bootstrap header file
*/
/* Bootstrap include so that #include <vppinfra/mem.h> can include e.g.
/** \brief vector header structure
- Bookeeping header preceding vector elements in memory.
+ Bookkeeping header preceding vector elements in memory.
User header information may preceed standard vec header.
If you change u32 len -> u64 len, single vectors can
exceed 2**32 elements. Clib heaps are vectors. */
/*
* Macros to toggle off/on warnings
*
- * Start by silenging pragma warnings so that we can explicitely silence
+ * Start by silencing pragma warnings so that we can explicitly silence
* a warning introduced on some compiler version and not get a warning on older
* versions of that same compiler.
*
- * gcc corresponding warnign is "Wpargma"
- * clang corresponding warnign is "Wunknown-warning-option"
+ * gcc corresponding warning is "Wpargma"
+ * clang corresponding warning is "Wunknown-warning-option"
*
* For example, Wtautological-compare is introduced in gcc-6 and this would
* trigger a Wpargma warning on gcc-5.
Code Review / vpp.git / commitdiff