Add fletcher-32 checksum algorithm and test.

[bertos.git] / bertos / algo / reverse_test.c

diff --git a/bertos/algo/reverse_test.c b/bertos/algo/reverse_test.c
index 5377e1d2ede260824ca6e181ed43d4e6d585cc31..26de751380151cd10a02c317d4a834b14da25612 100644 (file)
--- a/bertos/algo/reverse_test.c
+++ b/bertos/algo/reverse_test.c
@@ -33,7 +33,6 @@
  *
  * \brief REVERSE macro test.
  *
- * \version $Id$
  * \author Francesco Sacchi <batt@develer.com>
  */
 
@@ -42,6 +41,12 @@
 #include <cfg/test.h>
 
 
+/* Silent compiler warning */
+int reverse_testSetup(void);
+int reverse_testRun(void);
+int reverse_testTearDown(void);
+
+
 int reverse_testSetup(void)
 {
        kdbg_init();
@@ -54,7 +59,7 @@ int reverse_testTearDown(void)
 }
 
 /**
- * Naice reverse implementation.
+ * Naive reverse implementation.
  */
 static uint8_t reverse(uint8_t b)
 {
@@ -73,8 +78,8 @@ int reverse_testRun(void)
 {
        for (int i = 0; i < 256; i++)
        {
-               kprintf("i [%02X], REVERSE(i) [%02X], reverse(i) [%02X]\n", i, REVERSE(i), reverse(i));
-               ASSERT(reverse(i) == REVERSE(i));
+               kprintf("i [%02X], REVERSE(i) [%02X], reverse(i) [%02X]\n", i, REVERSE_UINT8(i), reverse(i));
+               ASSERT(reverse(i) == REVERSE_UINT8(i));
        }
        return  0;
 }