X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=tests%2Flibpspp%2Fhmapx-test.c;h=c93a2cd1b1ea2bb16555d298131faf47d3c85cc3;hb=3f494db4629e03e7977b739ea8c034da30332ae7;hp=fc08ca6161040a89d1c54574cb6f6ec2866886fb;hpb=a1efcf97ca2f75f4be6a0389ff2372c03ed2d4e1;p=pspp diff --git a/tests/libpspp/hmapx-test.c b/tests/libpspp/hmapx-test.c index fc08ca6161..c93a2cd1b1 100644 --- a/tests/libpspp/hmapx-test.c +++ b/tests/libpspp/hmapx-test.c @@ -1,5 +1,5 @@ /* PSPP - a program for statistical analysis. - Copyright (C) 2007, 2008 Free Software Foundation, Inc. + Copyright (C) 2007, 2008, 2009, 2010 Free Software Foundation, Inc. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -38,9 +38,6 @@ #include -/* Currently running test. */ -static const char *test_name; - /* If OK is not true, prints a message about failure on the current source file and the given LINE and terminates. */ static void @@ -48,8 +45,7 @@ check_func (bool ok, int line) { if (!ok) { - printf ("Check failed in %s test at %s, line %d\n", - test_name, __FILE__, line); + fprintf (stderr, "%s:%d: check failed\n", __FILE__, line); abort (); } } @@ -262,6 +258,7 @@ check_hmapx (struct hmapx *hmapx, const int data[], size_t cnt, size_t i, j; int *order; + check (hmapx_is_empty (hmapx) == (cnt == 0)); check (hmapx_count (hmapx) == cnt); check (cnt <= hmapx_capacity (hmapx)); @@ -934,6 +931,44 @@ test_swap_random_hash (void) test_swap (128, random_hash); } +/* Inserts elements into an HMAPX in ascending order, then clears the hash + table using hmapx_clear(). */ +static void +test_clear (void) +{ + const int max_elems = 128; + struct element *elements; + struct hmapx_node **nodes; + int *values; + struct hmapx hmapx; + int cnt; + + elements = xnmalloc (max_elems, sizeof *elements); + nodes = xnmalloc (max_elems, sizeof *nodes); + values = xnmalloc (max_elems, sizeof *values); + + hmapx_init (&hmapx); + for (cnt = 0; cnt <= max_elems; cnt++) + { + int i; + + for (i = 0; i < cnt; i++) + { + values[i] = elements[i].data = i; + nodes[i] = hmapx_insert (&hmapx, &elements[i], + random_hash (elements[i].data)); + check_hmapx (&hmapx, values, i + 1, random_hash); + } + hmapx_clear (&hmapx); + check_hmapx (&hmapx, NULL, 0, random_hash); + } + hmapx_destroy (&hmapx); + + free (elements); + free (nodes); + free (values); +} + static void test_destroy_null (void) { @@ -954,81 +989,189 @@ test_shrink_empty (void) /* Main program. */ -/* Runs TEST_FUNCTION and prints a message about NAME. */ -static void -run_test (void (*test_function) (void), const char *name) -{ - test_name = name; - putchar ('.'); - fflush (stdout); - test_function (); -} +struct test + { + const char *name; + const char *description; + void (*function) (void); + }; + +static const struct test tests[] = + { + { + "insert-any-remove-any-random-hash", + "insert any order, delete any order (random hash)", + test_insert_any_remove_any_random_hash + }, + { + "insert-any-remove-any-identity-hash", + "insert any order, delete any order (identity hash)", + test_insert_any_remove_any_identity_hash + }, + { + "insert-any-remove-any-constant-hash", + "insert any order, delete any order (constant hash)", + test_insert_any_remove_any_constant_hash + }, + { + "insert-any-remove-same-random-hash", + "insert any order, delete same order (random hash)", + test_insert_any_remove_same_random_hash + }, + { + "insert-any-remove-same-identity-hash", + "insert any order, delete same order (identity hash)", + test_insert_any_remove_same_identity_hash + }, + { + "insert-any-remove-same-constant-hash", + "insert any order, delete same order (constant hash)", + test_insert_any_remove_same_constant_hash + }, + { + "insert-any-remove-reverse-random-hash", + "insert any order, delete reverse order (random hash)", + test_insert_any_remove_reverse_random_hash + }, + { + "insert-any-remove-reverse-identity-hash", + "insert any order, delete reverse order (identity hash)", + test_insert_any_remove_reverse_identity_hash + }, + { + "insert-any-remove-reverse-constant-hash", + "insert any order, delete reverse order (constant hash)", + test_insert_any_remove_reverse_constant_hash + }, + { + "random-sequence-random-hash", + "insert and delete in random sequence (random hash)", + test_random_sequence_random_hash + }, + { + "random-sequence-identity-hash", + "insert and delete in random sequence (identity hash)", + test_random_sequence_identity_hash + }, + { + "random-sequence-constant-hash", + "insert and delete in random sequence (constant hash)", + test_random_sequence_constant_hash + }, + { + "insert-ordered-random-hash", + "insert in ascending order (random hash)", + test_insert_ordered_random_hash + }, + { + "insert-ordered-identity-hash", + "insert in ascending order (identity hash)", + test_insert_ordered_identity_hash + }, + { + "insert-ordered-constant-hash", + "insert in ascending order (constant hash)", + test_insert_ordered_constant_hash + }, + { + "moved-random-hash", + "move elements around in memory (random hash)", + test_moved_random_hash + }, + { + "moved-identity-hash", + "move elements around in memory (identity hash)", + test_moved_identity_hash + }, + { + "moved-constant-hash", + "move elements around in memory (constant hash)", + test_moved_constant_hash + }, + { + "changed-random-hash", + "change key data in nodes (random hash)", + test_changed_random_hash + }, + { + "changed-identity-hash", + "change key data in nodes (identity hash)", + test_changed_identity_hash + }, + { + "changed-constant-hash", + "change key data in nodes (constant hash)", + test_changed_constant_hash + }, + { + "change-random-hash", + "change and move key data in nodes (random hash)", + test_change_random_hash + }, + { + "change-identity-hash", + "change and move key data in nodes (identity hash)", + test_change_identity_hash + }, + { + "change-constant-hash", + "change and move key data in nodes (constant hash)", + test_change_constant_hash + }, + { + "swap-random-hash", + "test swapping tables", + test_swap_random_hash + }, + { + "clear", + "test clearing hash table", + test_clear + }, + { + "destroy-null", + "test destroying null table", + test_destroy_null + }, + { + "shrink-empty", + "test shrinking an empty table", + test_shrink_empty + }, + }; + +enum { N_TESTS = sizeof tests / sizeof *tests }; int -main (void) +main (int argc, char *argv[]) { - run_test (test_insert_any_remove_any_random_hash, - "insert any order, delete any order (random hash)"); - run_test (test_insert_any_remove_any_identity_hash, - "insert any order, delete any order (identity hash)"); - run_test (test_insert_any_remove_any_constant_hash, - "insert any order, delete any order (constant hash)"); - - run_test (test_insert_any_remove_same_random_hash, - "insert any order, delete same order (random hash)"); - run_test (test_insert_any_remove_same_identity_hash, - "insert any order, delete same order (identity hash)"); - run_test (test_insert_any_remove_same_constant_hash, - "insert any order, delete same order (constant hash)"); - - run_test (test_insert_any_remove_reverse_random_hash, - "insert any order, delete reverse order (random hash)"); - run_test (test_insert_any_remove_reverse_identity_hash, - "insert any order, delete reverse order (identity hash)"); - run_test (test_insert_any_remove_reverse_constant_hash, - "insert any order, delete reverse order (constant hash)"); - - run_test (test_random_sequence_random_hash, - "insert and delete in random sequence (random hash)"); - run_test (test_random_sequence_identity_hash, - "insert and delete in random sequence (identity hash)"); - run_test (test_random_sequence_constant_hash, - "insert and delete in random sequence (constant hash)"); - - run_test (test_insert_ordered_random_hash, - "insert in ascending order (random hash)"); - run_test (test_insert_ordered_identity_hash, - "insert in ascending order (identity hash)"); - run_test (test_insert_ordered_constant_hash, - "insert in ascending order (constant hash)"); - - run_test (test_moved_random_hash, - "move elements around in memory (random hash)"); - run_test (test_moved_identity_hash, - "move elements around in memory (identity hash)"); - run_test (test_moved_constant_hash, - "move elements around in memory (constant hash)"); - - run_test (test_changed_random_hash, - "change key data in nodes (random hash)"); - run_test (test_changed_identity_hash, - "change key data in nodes (identity hash)"); - run_test (test_changed_constant_hash, - "change key data in nodes (constant hash)"); - - run_test (test_change_random_hash, - "change and move key data in nodes (random hash)"); - run_test (test_change_identity_hash, - "change and move key data in nodes (identity hash)"); - run_test (test_change_constant_hash, - "change and move key data in nodes (constant hash)"); - - run_test (test_swap_random_hash, "test swapping tables"); - - run_test (test_destroy_null, "test destroying null table"); - run_test (test_shrink_empty, "test shrinking an empty table"); - - putchar ('\n'); - - return 0; + int i; + + if (argc != 2) + { + fprintf (stderr, "exactly one argument required; use --help for help\n"); + return EXIT_FAILURE; + } + else if (!strcmp (argv[1], "--help")) + { + printf ("%s: test hash map of pointers\n" + "usage: %s TEST-NAME\n" + "where TEST-NAME is one of the following:\n", + argv[0], argv[0]); + for (i = 0; i < N_TESTS; i++) + printf (" %s\n %s\n", tests[i].name, tests[i].description); + return 0; + } + else + { + for (i = 0; i < N_TESTS; i++) + if (!strcmp (argv[1], tests[i].name)) + { + tests[i].function (); + return 0; + } + + fprintf (stderr, "unknown test %s; use --help for help\n", argv[1]); + return EXIT_FAILURE; + } }