v2.4.4 audit sources

Change-Id: I9315a7408817db51edf084fb4d27fbb492785084
Signed-off-by: Ashlee Young <ashlee@wildernessvoice.com>

1 files changed, 69 insertions, 0 deletions

diff --git a/framework/src/audit/src/test/ilist_test.c b/framework/src/audit/src/test/ilist_test.c
new file mode 100644
index 00000000..85787126
--- /dev/null
+++ b/framework/src/audit/src/test/ilist_test.c
@@ -0,0 +1,69 @@
+#include <stdio.h>
+#include "ausearch-int.h"
+
+int main(void)
+{
+	int i = 0;
+	ilist e;
+	int_node *node;
+
+	ilist_create(&e);
+
+	// This first test checks to see if list is 
+	// created in a numeric order
+	ilist_add_if_uniq(&e, 6, 0);
+	ilist_add_if_uniq(&e, 5, 0);
+	ilist_add_if_uniq(&e, 7, 0);
+	ilist_add_if_uniq(&e, 1, 0);
+	ilist_add_if_uniq(&e, 8, 0);
+	ilist_add_if_uniq(&e, 2, 0);
+	ilist_add_if_uniq(&e, 9, 0);
+	ilist_add_if_uniq(&e, 0, 0);
+	ilist_add_if_uniq(&e, 4, 0);
+	ilist_add_if_uniq(&e, 3, 0);
+
+	ilist_first(&e);
+	do {
+		node = ilist_get_cur(&e);
+		if (i != node->num) {
+			printf("Test failed - i:%d != num:%d\n", i, node->num);
+			return 1;
+		}
+		i++;
+	} while ((node = ilist_next(&e)));
+
+	ilist_clear(&e);
+	puts("starting sort test");
+
+	// Now test to see if the sort function works
+	// Fill the list exactly backwards
+	ilist_add_if_uniq(&e, 3, 0);
+	ilist_add_if_uniq(&e, 3, 0);
+	ilist_add_if_uniq(&e, 4, 0);
+	ilist_add_if_uniq(&e, 3, 0);
+	ilist_add_if_uniq(&e, 4, 0);
+	ilist_add_if_uniq(&e, 2, 0);
+	ilist_add_if_uniq(&e, 4, 0);
+	ilist_add_if_uniq(&e, 2, 0);
+	ilist_add_if_uniq(&e, 4, 0); 
+	ilist_add_if_uniq(&e, 1, 0);
+
+	ilist_sort_by_hits(&e);
+
+	i = 0;
+	ilist_first(&e);
+	do {
+		node = ilist_get_cur(&e);
+		if (node->hits != (4-i)) {
+			printf("Sort test failed - i:%d != ihits:%d\n", i, node->hits);
+			return 1;
+		}
+		i++;
+	} while ((node = ilist_next(&e)));
+	
+	ilist_clear(&e);
+
+	printf("ilist tests passed\n");
+	return 0;
+}
+