list: Rename all functions in list.h with ovs_ prefix.

[cascardo/ovs.git] / tests / test-list.c

diff --git a/tests/test-list.c b/tests/test-list.c
index 162ae9a..d413f30 100644 (file)
--- a/tests/test-list.c
+++ b/tests/test-list.c
@@ -39,10 +39,10 @@ make_list(struct ovs_list *list, struct element elements[],
 {
     size_t i;
 
-    list_init(list);
+    ovs_list_init(list);
     for (i = 0; i < n; i++) {
         elements[i].value = i;
-        list_push_back(list, &elements[i].node);
+        ovs_list_push_back(list, &elements[i].node);
         values[i] = i;
     }
 }
@@ -73,10 +73,10 @@ check_list(struct ovs_list *list, const int values[], size_t n)
     assert(&e->node == list);
     assert(i == n);
 
-    assert(list_is_empty(list) == !n);
-    assert(list_is_singleton(list) == (n == 1));
-    assert(list_is_short(list) == (n < 2));
-    assert(list_size(list) == n);
+    assert(ovs_list_is_empty(list) == !n);
+    assert(ovs_list_is_singleton(list) == (n == 1));
+    assert(ovs_list_is_short(list) == (n < 2));
+    assert(ovs_list_size(list) == n);
 }
 
 #if 0
@@ -137,7 +137,7 @@ test_list_for_each_safe(void)
             LIST_FOR_EACH_SAFE (e, next, node, &list) {
                 assert(i < n);
                 if (pattern & (1ul << i)) {
-                    list_remove(&e->node);
+                    ovs_list_remove(&e->node);
                     n_remaining--;
                     memmove(&values[values_idx], &values[values_idx + 1],
                             sizeof *values * (n_remaining - values_idx));