diff options
author | Joe Perches <joe@perches.com> | 2010-08-30 00:24:53 -0700 |
---|---|---|
committer | Jesse Gross <jesse@nicira.com> | 2010-08-30 13:23:08 -0700 |
commit | d295e8e97acae13552a5b220d3fbcff8201064a2 (patch) | |
tree | eb90646c3c927a62fd2f520eb5fcd602297b1a79 /tests/test-list.c | |
parent | 90a249dc93ccabd398b64092121b07e5af2d8c2d (diff) | |
download | openvswitch-d295e8e97acae13552a5b220d3fbcff8201064a2.tar.gz |
treewide: Remove trailing whitespace
Signed-off-by: Joe Perches <joe@perches.com>
Acked-by: Simon Horman <horms@verge.net.au>
Signed-off-by: Jesse Gross <jesse@nicira.com>
Diffstat (limited to 'tests/test-list.c')
-rw-r--r-- | tests/test-list.c | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/tests/test-list.c b/tests/test-list.c index 0aa0f8b2a..0efdbfce4 100644 --- a/tests/test-list.c +++ b/tests/test-list.c @@ -34,10 +34,10 @@ struct element { * elements in order into 'list'. */ static void make_list(struct list *list, struct element elements[], - int values[], size_t n) + int values[], size_t n) { size_t i; - + list_init(list); for (i = 0; i < n; i++) { elements[i].value = i; @@ -49,11 +49,11 @@ make_list(struct list *list, struct element elements[], /* Verifies that 'list' contains exactly the 'n' values in 'values', in the * specified order. */ static void -check_list(struct list *list, const int values[], size_t n) +check_list(struct list *list, const int values[], size_t n) { struct element *e; size_t i; - + i = 0; LIST_FOR_EACH (e, struct element, node, list) { assert(i < n); @@ -79,10 +79,10 @@ check_list(struct list *list, const int values[], size_t n) #if 0 /* Prints the values in 'list', plus 'name' as a title. */ static void -print_list(const char *name, struct list *list) +print_list(const char *name, struct list *list) { struct element *e; - + printf("%s:", name); LIST_FOR_EACH (e, struct element, node, list) { printf(" %d", e->value); @@ -93,7 +93,7 @@ print_list(const char *name, struct list *list) /* Tests basic list construction. */ static void -test_list_construction(void) +test_list_construction(void) { enum { MAX_ELEMS = 100 }; size_t n; @@ -102,7 +102,7 @@ test_list_construction(void) struct element elements[MAX_ELEMS]; int values[MAX_ELEMS]; struct list list; - + make_list(&list, elements, values, n); check_list(&list, values, n); } @@ -111,7 +111,7 @@ test_list_construction(void) /* Tests that LIST_FOR_EACH_SAFE properly allows for deletion of the current * element of a list. */ static void -test_list_for_each_safe(void) +test_list_for_each_safe(void) { enum { MAX_ELEMS = 10 }; size_t n; @@ -125,7 +125,7 @@ test_list_for_each_safe(void) struct element *e, *next; size_t values_idx, n_remaining; int i; - + make_list(&list, elements, values, n); i = 0; @@ -158,14 +158,14 @@ test_list_for_each_safe(void) } static void -run_test(void (*function)(void)) +run_test(void (*function)(void)) { function(); printf("."); } int -main(void) +main(void) { run_test(test_list_construction); run_test(test_list_for_each_safe); |