summaryrefslogtreecommitdiffstats
path: root/src/vppinfra/hash.h
diff options
context:
space:
mode:
authorPaul Vinciguerra <pvinci@vinciconsulting.com>2018-09-24 05:25:00 -0700
committerFlorin Coras <florin.coras@gmail.com>2018-09-27 19:59:44 +0000
commitec11b13a21b2becc1d1bd746a04624d17b26583f (patch)
treef3b432a3713a8edd2041ff025157d7b0803be580 /src/vppinfra/hash.h
parent7d426535b4e98731193cc0265b83f2336dcdf5b3 (diff)
Trivial: Cleanup some typos.
This is a new commit for code under a different maintainer. Change-Id: I79fa403fec6a312238a9a4b18b35dbcafaa05439 Signed-off-by: Paul Vinciguerra <pvinci@vinciconsulting.com>
Diffstat (limited to 'src/vppinfra/hash.h')
-rw-r--r--src/vppinfra/hash.h16
1 files changed, 8 insertions, 8 deletions
diff --git a/src/vppinfra/hash.h b/src/vppinfra/hash.h
index de155e6ac1c..36a70066044 100644
--- a/src/vppinfra/hash.h
+++ b/src/vppinfra/hash.h
@@ -274,7 +274,7 @@ uword hash_bytes (void *v);
/* 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)
{
@@ -290,7 +290,7 @@ 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)
{
@@ -311,7 +311,7 @@ extern void *_hash_free (void *v);
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)
{
@@ -319,7 +319,7 @@ 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)
{
@@ -332,21 +332,21 @@ 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)
{
@@ -438,7 +438,7 @@ do { \
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; \