Thread: [C-mpi-commits] SF.net SVN: c-mpi:[19] test/adts
Status: Pre-Alpha
Brought to you by:
jmwozniak
Menu
▾
▴
c-mpi-commits
|
From: <jmw...@us...> - 2010-04-20 16:15:41
|
Revision: 19
http://c-mpi.svn.sourceforge.net/c-mpi/?rev=19&view=rev
Author: jmwozniak
Date: 2010-04-20 16:15:35 +0000 (Tue, 20 Apr 2010)
Log Message:
-----------
Better name.
Added Paths:
-----------
test/adts/test-dpkm_list.c
Removed Paths:
-------------
test/adts/test01.c
Copied: test/adts/test-dpkm_list.c (from rev 14, test/adts/test01.c)
===================================================================
--- test/adts/test-dpkm_list.c (rev 0)
+++ test/adts/test-dpkm_list.c 2010-04-20 16:15:35 UTC (rev 19)
@@ -0,0 +1,112 @@
+
+/**
+ * Test dpkm_list functionality.
+ * */
+
+#include <dpkm_list.h>
+
+int
+main(int argc, char* argv[])
+{
+ MPI_Init(&argc, &argv);
+ whoami();
+
+ struct dpkm_list* L = dpkm_list_create(4);
+
+ char s[1000];
+
+ int zero = 0;
+ // int one = 1;
+ int two = 2;
+ int three = 3;
+ int four = 4;
+ int five = 5;
+ int eight = 8;
+
+ struct dpkm_list_item* item;
+
+ item = dpkm_list_add(L, "two", &two, sizeof(int));
+ if (item)
+ printf("%s \n", item->key);
+ item = dpkm_list_add(L, "four", &four, sizeof(int));
+ if (item)
+ printf("%s \n", item->key);
+ item = dpkm_list_add(L, "three", &three, sizeof(int));
+ if (item)
+ printf("%s \n", item->key);
+ item = dpkm_list_add(L, "three", &three, sizeof(int));
+ if (item)
+ printf("%s \n", item->key);
+ item = dpkm_list_add(L, "four", &four, sizeof(int));
+ if (item)
+ printf("%s \n", item->key);
+ item = dpkm_list_add(L, "zero", &zero, sizeof(int));
+ if (item)
+ printf("%s \n", item->key);
+
+ fflush(stdout);
+
+ dpkm_list_printf("%i", L);
+ printf("size: %i \n", L->size);
+
+ dpkm_list_add(L, "five", &five, sizeof(int));
+ dpkm_list_excise(L, L->head);
+ dpkm_list_printf("%i", L);
+ printf("size: %i \n", L->size);
+
+ item = dpkm_list_add(L, "eight", &eight, sizeof(int));
+ if (item)
+ printf("%s \n", item->key);
+ dpkm_list_printf("%i", L);
+ printf("size: %i \n", L->size);
+
+ dpkm_list_tostring(s, 1000, "%i", L);
+ printf("From string: %s\n", s);
+
+ //dpkm_list_search(L, "five");
+ dpkm_list_printf("%i", L);
+ printf("size: %i \n", L->size);
+
+ item = dpkm_list_poll(L);
+ dpkm_list_printf("%i", L);
+ printf("size: %i \n", L->size);
+
+ item = dpkm_list_search(L, "zero");
+ dpkm_list_excise(L, item);
+ dpkm_list_printf("%i", L);
+
+ note("polling...");
+
+ while ((item = dpkm_list_poll(L)))
+ {
+ printf("got: %s \n", item->key);
+ dpkm_list_printf("%i", L);
+ }
+
+ dpkm_list_tostring(s, 1000, "%i", L);
+ printf("From string: %s\n", s);
+
+ /*
+ dpkm_list_printf("%i", L);
+ dpkm_list_poll(L);
+ dpkm_list_printf("%i", L);
+ dpkm_list_pop(L);
+ dpkm_list_printf("%i", L);
+ dpkm_list_add(L, &seven);
+ dpkm_list_add(L, &six);
+ dpkm_list_printf("%i", L);
+ */
+
+ // dpkm_list_clobber(L);
+ // dpkm_list_clear(L);
+ // printf("size(L): %i \n", L->size);
+
+ // dpkm_list_clear(K);
+ // printf("size(K): %i \n", K->size);
+
+ // dpkm_list_printf("%i", L);
+ MPI_Finalize();
+ return 0;
+}
+
+
Property changes on: test/adts/test-dpkm_list.c
___________________________________________________________________
Added: svn:mergeinfo
+
Deleted: test/adts/test01.c
===================================================================
--- test/adts/test01.c 2010-04-20 16:14:18 UTC (rev 18)
+++ test/adts/test01.c 2010-04-20 16:15:35 UTC (rev 19)
@@ -1,112 +0,0 @@
-
-/**
- * Test dpkm_list functionality.
- * */
-
-#include <dpkm_list.h>
-
-int
-main(int argc, char* argv[])
-{
- MPI_Init(&argc, &argv);
- whoami();
-
- struct dpkm_list* L = dpkm_list_create(4);
-
- char s[1000];
-
- int zero = 0;
- // int one = 1;
- int two = 2;
- int three = 3;
- int four = 4;
- int five = 5;
- int eight = 8;
-
- struct dpkm_list_item* item;
-
- item = dpkm_list_add(L, "two", &two, sizeof(int));
- if (item)
- printf("%s \n", item->key);
- item = dpkm_list_add(L, "four", &four, sizeof(int));
- if (item)
- printf("%s \n", item->key);
- item = dpkm_list_add(L, "three", &three, sizeof(int));
- if (item)
- printf("%s \n", item->key);
- item = dpkm_list_add(L, "three", &three, sizeof(int));
- if (item)
- printf("%s \n", item->key);
- item = dpkm_list_add(L, "four", &four, sizeof(int));
- if (item)
- printf("%s \n", item->key);
- item = dpkm_list_add(L, "zero", &zero, sizeof(int));
- if (item)
- printf("%s \n", item->key);
-
- fflush(stdout);
-
- dpkm_list_printf("%i", L);
- printf("size: %i \n", L->size);
-
- dpkm_list_add(L, "five", &five, sizeof(int));
- dpkm_list_excise(L, L->head);
- dpkm_list_printf("%i", L);
- printf("size: %i \n", L->size);
-
- item = dpkm_list_add(L, "eight", &eight, sizeof(int));
- if (item)
- printf("%s \n", item->key);
- dpkm_list_printf("%i", L);
- printf("size: %i \n", L->size);
-
- dpkm_list_tostring(s, 1000, "%i", L);
- printf("From string: %s\n", s);
-
- //dpkm_list_search(L, "five");
- dpkm_list_printf("%i", L);
- printf("size: %i \n", L->size);
-
- item = dpkm_list_poll(L);
- dpkm_list_printf("%i", L);
- printf("size: %i \n", L->size);
-
- item = dpkm_list_search(L, "zero");
- dpkm_list_excise(L, item);
- dpkm_list_printf("%i", L);
-
- note("polling...");
-
- while ((item = dpkm_list_poll(L)))
- {
- printf("got: %s \n", item->key);
- dpkm_list_printf("%i", L);
- }
-
- dpkm_list_tostring(s, 1000, "%i", L);
- printf("From string: %s\n", s);
-
- /*
- dpkm_list_printf("%i", L);
- dpkm_list_poll(L);
- dpkm_list_printf("%i", L);
- dpkm_list_pop(L);
- dpkm_list_printf("%i", L);
- dpkm_list_add(L, &seven);
- dpkm_list_add(L, &six);
- dpkm_list_printf("%i", L);
- */
-
- // dpkm_list_clobber(L);
- // dpkm_list_clear(L);
- // printf("size(L): %i \n", L->size);
-
- // dpkm_list_clear(K);
- // printf("size(K): %i \n", K->size);
-
- // dpkm_list_printf("%i", L);
- MPI_Finalize();
- return 0;
-}
-
-
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jmw...@us...> - 2010-04-20 16:19:07
|
Revision: 21
http://c-mpi.svn.sourceforge.net/c-mpi/?rev=21&view=rev
Author: jmwozniak
Date: 2010-04-20 16:19:00 +0000 (Tue, 20 Apr 2010)
Log Message:
-----------
Better name.
Added Paths:
-----------
test/adts/test-lru_table.c
Removed Paths:
-------------
test/adts/test02.c
Copied: test/adts/test-lru_table.c (from rev 20, test/adts/test02.c)
===================================================================
--- test/adts/test-lru_table.c (rev 0)
+++ test/adts/test-lru_table.c 2010-04-20 16:19:00 UTC (rev 21)
@@ -0,0 +1,181 @@
+
+/**
+ * Test lru_table functionality.
+ * */
+
+#include <lru_table.h>
+
+#ifdef DMALLOC
+#include "dmalloc.h"
+#endif
+
+int
+main(int argc, char* argv[])
+{
+ MPI_Init(&argc, &argv);
+ whoami();
+
+#ifdef DMALLOC
+ sprintf(dmalloc_logpath, "./dmalloc_%i.out", debug_rank);
+ printf("DMALLOC_PATH: %s \n", dmalloc_logpath);
+#endif
+
+ struct lru_table* table = lru_table_create(5, 4);
+
+ int* zero = malloc(sizeof(int));
+ int* one = malloc(sizeof(int));
+ int* two = malloc(sizeof(int));
+ int* three = malloc(sizeof(int));
+ int* four = malloc(sizeof(int));
+ int* five = malloc(sizeof(int));
+ int* eight = malloc(sizeof(int));
+
+ *zero = 0;
+ *one = 1;
+ *two = 2;
+ *three = 3;
+ *four = 4;
+ *five = 5;
+ *eight = 8;
+
+ struct keyvalue* kv;
+
+ kv = lru_table_add(table, heap("two"), (char*) two, sizeof(int));
+ lru_table_printf("%i", table);
+ if (kv)
+ printf("victim: %s \n", kv->key);
+
+ printf("\n");
+
+ kv = lru_table_add(table, heap("one"), (char*) one, sizeof(int));
+ lru_table_printf("%i", table);
+ if (kv)
+ printf("victim: %s \n", kv->key);
+
+ printf("\n");
+
+ struct keyvalue* result;
+
+ result = lru_table_search(table, "one");
+ if (result == NULL)
+ printf("one not found\n");
+ else
+ {
+ printf("data: %i\n", (int) *result->data);
+ free(result);
+ }
+
+ result = lru_table_search(table, "two");
+ if (result == NULL)
+ printf("two not found\n");
+ else
+ {
+ printf("data: %i\n", (int) *result->data);
+ free(result);
+ }
+
+ result = lru_table_search(table, "one");
+ if (result == NULL)
+ printf("one not found\n");
+ else
+ {
+ printf("data: %i\n", (int) *result->data);
+ free(result);
+ }
+
+ result = lru_table_search(table, "two");
+ if (result == NULL)
+ printf("two not found\n");
+ else
+ {
+ printf("data: %i\n", (int) *result->data);
+ free(result);
+ }
+
+ result = lru_table_search(table, "two");
+ if (result == NULL)
+ printf("two not found\n");
+ else
+ {
+ printf("data: %i\n", (int) *result->data);
+ free(result);
+ }
+
+ while ((result = lru_table_poll(table)))
+ {
+ printf("polled: %s %i\n", result->key, *result->data);
+ keyvalue_destroy(result);
+ }
+ lru_table_free(table);
+
+ /*
+ int* result = (int*) lru_table_search(table, "five");
+ printf("result: %i \n", *result);
+ lru_table_dump("%i", table);
+
+ result = (int*) lru_table_search(table, "twenty");
+ if (result == NULL)
+ printf("Got NULL \n");
+
+ result = (int*) lru_table_search(table, "five");
+ printf("result: %i \n", *result);
+ lru_table_dump("%i", table);
+
+ while ((kv = lru_table_poll(table)))
+ printf("polled: %s \n", kv->key);
+ */
+
+
+ /*
+
+ lru_table_add(table, "five", &five);
+ lru_table_excise(table, table->head);
+ lru_table_dump("%i", table);
+ printf("size: %i \n", table->size);
+
+ kv = lru_table_add(table, "eight", &eight);
+ if (kv)
+ printf("%s \n", kv->key);
+ lru_table_dump("%i", table);
+ printf("size: %i \n", table->size);
+
+ lru_table_touch(table, table->head->next);
+ lru_table_dump("%i", table);
+ printf("size: %i \n", table->size);
+
+ struct lru_table_item* item;
+ item = lru_table_poll(table);
+ lru_table_dump("%i", table);
+ printf("size: %i \n", table->size);
+
+ while ((item = lru_table_poll(table)))
+ lru_table_dump("%i", table);
+
+ */
+ /*
+ lru_table_dump("%i", table);
+ lru_table_poll(table);
+ lru_table_dump("%i", table);
+ lru_table_pop(table);
+ lru_table_dump("%i", table);
+ lru_table_add(table, &seven);
+ lru_table_add(table, &six);
+ lru_table_dump("%i", table);
+ */
+
+ // lru_table_clobber(table);
+ // lru_table_clear(table);
+ // printf("size(table): %i \n", table->size);
+
+ // lru_table_clear(K);
+ // printf("size(K): %i \n", K->size);
+
+ // lru_table_dump("%i", table);
+
+ // dmalloc_shutdown();
+
+ MPI_Finalize();
+ return 0;
+}
+
+
Property changes on: test/adts/test-lru_table.c
___________________________________________________________________
Added: svn:mergeinfo
+
Deleted: test/adts/test02.c
===================================================================
--- test/adts/test02.c 2010-04-20 16:18:15 UTC (rev 20)
+++ test/adts/test02.c 2010-04-20 16:19:00 UTC (rev 21)
@@ -1,181 +0,0 @@
-
-/**
- * Test lru_table functionality.
- * */
-
-#include <lru_table.h>
-
-#ifdef DMALLOC
-#include "dmalloc.h"
-#endif
-
-int
-main(int argc, char* argv[])
-{
- MPI_Init(&argc, &argv);
- whoami();
-
-#ifdef DMALLOC
- sprintf(dmalloc_logpath, "./dmalloc_%i.out", debug_rank);
- printf("DMALLOC_PATH: %s \n", dmalloc_logpath);
-#endif
-
- struct lru_table* table = lru_table_create(5, 4);
-
- int* zero = malloc(sizeof(int));
- int* one = malloc(sizeof(int));
- int* two = malloc(sizeof(int));
- int* three = malloc(sizeof(int));
- int* four = malloc(sizeof(int));
- int* five = malloc(sizeof(int));
- int* eight = malloc(sizeof(int));
-
- *zero = 0;
- *one = 1;
- *two = 2;
- *three = 3;
- *four = 4;
- *five = 5;
- *eight = 8;
-
- struct keyvalue* kv;
-
- kv = lru_table_add(table, heap("two"), (char*) two, sizeof(int));
- lru_table_printf("%i", table);
- if (kv)
- printf("victim: %s \n", kv->key);
-
- printf("\n");
-
- kv = lru_table_add(table, heap("one"), (char*) one, sizeof(int));
- lru_table_printf("%i", table);
- if (kv)
- printf("victim: %s \n", kv->key);
-
- printf("\n");
-
- struct keyvalue* result;
-
- result = lru_table_search(table, "one");
- if (result == NULL)
- printf("one not found\n");
- else
- {
- printf("data: %i\n", (int) *result->data);
- free(result);
- }
-
- result = lru_table_search(table, "two");
- if (result == NULL)
- printf("two not found\n");
- else
- {
- printf("data: %i\n", (int) *result->data);
- free(result);
- }
-
- result = lru_table_search(table, "one");
- if (result == NULL)
- printf("one not found\n");
- else
- {
- printf("data: %i\n", (int) *result->data);
- free(result);
- }
-
- result = lru_table_search(table, "two");
- if (result == NULL)
- printf("two not found\n");
- else
- {
- printf("data: %i\n", (int) *result->data);
- free(result);
- }
-
- result = lru_table_search(table, "two");
- if (result == NULL)
- printf("two not found\n");
- else
- {
- printf("data: %i\n", (int) *result->data);
- free(result);
- }
-
- while ((result = lru_table_poll(table)))
- {
- printf("polled: %s %i\n", result->key, *result->data);
- keyvalue_destroy(result);
- }
- lru_table_free(table);
-
- /*
- int* result = (int*) lru_table_search(table, "five");
- printf("result: %i \n", *result);
- lru_table_dump("%i", table);
-
- result = (int*) lru_table_search(table, "twenty");
- if (result == NULL)
- printf("Got NULL \n");
-
- result = (int*) lru_table_search(table, "five");
- printf("result: %i \n", *result);
- lru_table_dump("%i", table);
-
- while ((kv = lru_table_poll(table)))
- printf("polled: %s \n", kv->key);
- */
-
-
- /*
-
- lru_table_add(table, "five", &five);
- lru_table_excise(table, table->head);
- lru_table_dump("%i", table);
- printf("size: %i \n", table->size);
-
- kv = lru_table_add(table, "eight", &eight);
- if (kv)
- printf("%s \n", kv->key);
- lru_table_dump("%i", table);
- printf("size: %i \n", table->size);
-
- lru_table_touch(table, table->head->next);
- lru_table_dump("%i", table);
- printf("size: %i \n", table->size);
-
- struct lru_table_item* item;
- item = lru_table_poll(table);
- lru_table_dump("%i", table);
- printf("size: %i \n", table->size);
-
- while ((item = lru_table_poll(table)))
- lru_table_dump("%i", table);
-
- */
- /*
- lru_table_dump("%i", table);
- lru_table_poll(table);
- lru_table_dump("%i", table);
- lru_table_pop(table);
- lru_table_dump("%i", table);
- lru_table_add(table, &seven);
- lru_table_add(table, &six);
- lru_table_dump("%i", table);
- */
-
- // lru_table_clobber(table);
- // lru_table_clear(table);
- // printf("size(table): %i \n", table->size);
-
- // lru_table_clear(K);
- // printf("size(K): %i \n", K->size);
-
- // lru_table_dump("%i", table);
-
- // dmalloc_shutdown();
-
- MPI_Finalize();
- return 0;
-}
-
-
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jmw...@us...> - 2010-04-20 16:20:25
|
Revision: 22
http://c-mpi.svn.sourceforge.net/c-mpi/?rev=22&view=rev
Author: jmwozniak
Date: 2010-04-20 16:20:19 +0000 (Tue, 20 Apr 2010)
Log Message:
-----------
Better name.
Added Paths:
-----------
test/adts/test-inlist.c
Removed Paths:
-------------
test/adts/test04.c
Copied: test/adts/test-inlist.c (from rev 14, test/adts/test04.c)
===================================================================
--- test/adts/test-inlist.c (rev 0)
+++ test/adts/test-inlist.c 2010-04-20 16:20:19 UTC (rev 22)
@@ -0,0 +1,27 @@
+
+/**
+ * Test inlist functionality.
+ * */
+
+#include <inlist.h>
+
+int
+main(int argc, char* argv[])
+{
+ MPI_Init(&argc, &argv);
+ whoami();
+
+ char* s = malloc(30);
+ strcpy(s, " 1 4 2 ");
+
+ struct inlist* L = inlist_parse(s);
+
+ inlist_printf(L);
+
+ inlist_free(L);
+ free(s);
+
+ MPI_Finalize();
+
+ return 0;
+}
Property changes on: test/adts/test-inlist.c
___________________________________________________________________
Added: svn:mergeinfo
+
Deleted: test/adts/test04.c
===================================================================
--- test/adts/test04.c 2010-04-20 16:19:00 UTC (rev 21)
+++ test/adts/test04.c 2010-04-20 16:20:19 UTC (rev 22)
@@ -1,27 +0,0 @@
-
-/**
- * Test inlist functionality.
- * */
-
-#include <inlist.h>
-
-int
-main(int argc, char* argv[])
-{
- MPI_Init(&argc, &argv);
- whoami();
-
- char* s = malloc(30);
- strcpy(s, " 1 4 2 ");
-
- struct inlist* L = inlist_parse(s);
-
- inlist_printf(L);
-
- inlist_free(L);
- free(s);
-
- MPI_Finalize();
-
- return 0;
-}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jmw...@us...> - 2010-04-20 16:22:10
|
Revision: 23
http://c-mpi.svn.sourceforge.net/c-mpi/?rev=23&view=rev
Author: jmwozniak
Date: 2010-04-20 16:22:03 +0000 (Tue, 20 Apr 2010)
Log Message:
-----------
lru_table tests.
Added Paths:
-----------
test/adts/test-lru_table01.c
test/adts/test-lru_table02.c
Removed Paths:
-------------
test/adts/test-lru_table.c
test/adts/test05.c
Deleted: test/adts/test-lru_table.c
===================================================================
--- test/adts/test-lru_table.c 2010-04-20 16:20:19 UTC (rev 22)
+++ test/adts/test-lru_table.c 2010-04-20 16:22:03 UTC (rev 23)
@@ -1,181 +0,0 @@
-
-/**
- * Test lru_table functionality.
- * */
-
-#include <lru_table.h>
-
-#ifdef DMALLOC
-#include "dmalloc.h"
-#endif
-
-int
-main(int argc, char* argv[])
-{
- MPI_Init(&argc, &argv);
- whoami();
-
-#ifdef DMALLOC
- sprintf(dmalloc_logpath, "./dmalloc_%i.out", debug_rank);
- printf("DMALLOC_PATH: %s \n", dmalloc_logpath);
-#endif
-
- struct lru_table* table = lru_table_create(5, 4);
-
- int* zero = malloc(sizeof(int));
- int* one = malloc(sizeof(int));
- int* two = malloc(sizeof(int));
- int* three = malloc(sizeof(int));
- int* four = malloc(sizeof(int));
- int* five = malloc(sizeof(int));
- int* eight = malloc(sizeof(int));
-
- *zero = 0;
- *one = 1;
- *two = 2;
- *three = 3;
- *four = 4;
- *five = 5;
- *eight = 8;
-
- struct keyvalue* kv;
-
- kv = lru_table_add(table, heap("two"), (char*) two, sizeof(int));
- lru_table_printf("%i", table);
- if (kv)
- printf("victim: %s \n", kv->key);
-
- printf("\n");
-
- kv = lru_table_add(table, heap("one"), (char*) one, sizeof(int));
- lru_table_printf("%i", table);
- if (kv)
- printf("victim: %s \n", kv->key);
-
- printf("\n");
-
- struct keyvalue* result;
-
- result = lru_table_search(table, "one");
- if (result == NULL)
- printf("one not found\n");
- else
- {
- printf("data: %i\n", (int) *result->data);
- free(result);
- }
-
- result = lru_table_search(table, "two");
- if (result == NULL)
- printf("two not found\n");
- else
- {
- printf("data: %i\n", (int) *result->data);
- free(result);
- }
-
- result = lru_table_search(table, "one");
- if (result == NULL)
- printf("one not found\n");
- else
- {
- printf("data: %i\n", (int) *result->data);
- free(result);
- }
-
- result = lru_table_search(table, "two");
- if (result == NULL)
- printf("two not found\n");
- else
- {
- printf("data: %i\n", (int) *result->data);
- free(result);
- }
-
- result = lru_table_search(table, "two");
- if (result == NULL)
- printf("two not found\n");
- else
- {
- printf("data: %i\n", (int) *result->data);
- free(result);
- }
-
- while ((result = lru_table_poll(table)))
- {
- printf("polled: %s %i\n", result->key, *result->data);
- keyvalue_destroy(result);
- }
- lru_table_free(table);
-
- /*
- int* result = (int*) lru_table_search(table, "five");
- printf("result: %i \n", *result);
- lru_table_dump("%i", table);
-
- result = (int*) lru_table_search(table, "twenty");
- if (result == NULL)
- printf("Got NULL \n");
-
- result = (int*) lru_table_search(table, "five");
- printf("result: %i \n", *result);
- lru_table_dump("%i", table);
-
- while ((kv = lru_table_poll(table)))
- printf("polled: %s \n", kv->key);
- */
-
-
- /*
-
- lru_table_add(table, "five", &five);
- lru_table_excise(table, table->head);
- lru_table_dump("%i", table);
- printf("size: %i \n", table->size);
-
- kv = lru_table_add(table, "eight", &eight);
- if (kv)
- printf("%s \n", kv->key);
- lru_table_dump("%i", table);
- printf("size: %i \n", table->size);
-
- lru_table_touch(table, table->head->next);
- lru_table_dump("%i", table);
- printf("size: %i \n", table->size);
-
- struct lru_table_item* item;
- item = lru_table_poll(table);
- lru_table_dump("%i", table);
- printf("size: %i \n", table->size);
-
- while ((item = lru_table_poll(table)))
- lru_table_dump("%i", table);
-
- */
- /*
- lru_table_dump("%i", table);
- lru_table_poll(table);
- lru_table_dump("%i", table);
- lru_table_pop(table);
- lru_table_dump("%i", table);
- lru_table_add(table, &seven);
- lru_table_add(table, &six);
- lru_table_dump("%i", table);
- */
-
- // lru_table_clobber(table);
- // lru_table_clear(table);
- // printf("size(table): %i \n", table->size);
-
- // lru_table_clear(K);
- // printf("size(K): %i \n", K->size);
-
- // lru_table_dump("%i", table);
-
- // dmalloc_shutdown();
-
- MPI_Finalize();
- return 0;
-}
-
-
Copied: test/adts/test-lru_table01.c (from rev 21, test/adts/test-lru_table.c)
===================================================================
--- test/adts/test-lru_table01.c (rev 0)
+++ test/adts/test-lru_table01.c 2010-04-20 16:22:03 UTC (rev 23)
@@ -0,0 +1,181 @@
+
+/**
+ * Test lru_table functionality.
+ * */
+
+#include <lru_table.h>
+
+#ifdef DMALLOC
+#include "dmalloc.h"
+#endif
+
+int
+main(int argc, char* argv[])
+{
+ MPI_Init(&argc, &argv);
+ whoami();
+
+#ifdef DMALLOC
+ sprintf(dmalloc_logpath, "./dmalloc_%i.out", debug_rank);
+ printf("DMALLOC_PATH: %s \n", dmalloc_logpath);
+#endif
+
+ struct lru_table* table = lru_table_create(5, 4);
+
+ int* zero = malloc(sizeof(int));
+ int* one = malloc(sizeof(int));
+ int* two = malloc(sizeof(int));
+ int* three = malloc(sizeof(int));
+ int* four = malloc(sizeof(int));
+ int* five = malloc(sizeof(int));
+ int* eight = malloc(sizeof(int));
+
+ *zero = 0;
+ *one = 1;
+ *two = 2;
+ *three = 3;
+ *four = 4;
+ *five = 5;
+ *eight = 8;
+
+ struct keyvalue* kv;
+
+ kv = lru_table_add(table, heap("two"), (char*) two, sizeof(int));
+ lru_table_printf("%i", table);
+ if (kv)
+ printf("victim: %s \n", kv->key);
+
+ printf("\n");
+
+ kv = lru_table_add(table, heap("one"), (char*) one, sizeof(int));
+ lru_table_printf("%i", table);
+ if (kv)
+ printf("victim: %s \n", kv->key);
+
+ printf("\n");
+
+ struct keyvalue* result;
+
+ result = lru_table_search(table, "one");
+ if (result == NULL)
+ printf("one not found\n");
+ else
+ {
+ printf("data: %i\n", (int) *result->data);
+ free(result);
+ }
+
+ result = lru_table_search(table, "two");
+ if (result == NULL)
+ printf("two not found\n");
+ else
+ {
+ printf("data: %i\n", (int) *result->data);
+ free(result);
+ }
+
+ result = lru_table_search(table, "one");
+ if (result == NULL)
+ printf("one not found\n");
+ else
+ {
+ printf("data: %i\n", (int) *result->data);
+ free(result);
+ }
+
+ result = lru_table_search(table, "two");
+ if (result == NULL)
+ printf("two not found\n");
+ else
+ {
+ printf("data: %i\n", (int) *result->data);
+ free(result);
+ }
+
+ result = lru_table_search(table, "two");
+ if (result == NULL)
+ printf("two not found\n");
+ else
+ {
+ printf("data: %i\n", (int) *result->data);
+ free(result);
+ }
+
+ while ((result = lru_table_poll(table)))
+ {
+ printf("polled: %s %i\n", result->key, *result->data);
+ keyvalue_destroy(result);
+ }
+ lru_table_free(table);
+
+ /*
+ int* result = (int*) lru_table_search(table, "five");
+ printf("result: %i \n", *result);
+ lru_table_dump("%i", table);
+
+ result = (int*) lru_table_search(table, "twenty");
+ if (result == NULL)
+ printf("Got NULL \n");
+
+ result = (int*) lru_table_search(table, "five");
+ printf("result: %i \n", *result);
+ lru_table_dump("%i", table);
+
+ while ((kv = lru_table_poll(table)))
+ printf("polled: %s \n", kv->key);
+ */
+
+
+ /*
+
+ lru_table_add(table, "five", &five);
+ lru_table_excise(table, table->head);
+ lru_table_dump("%i", table);
+ printf("size: %i \n", table->size);
+
+ kv = lru_table_add(table, "eight", &eight);
+ if (kv)
+ printf("%s \n", kv->key);
+ lru_table_dump("%i", table);
+ printf("size: %i \n", table->size);
+
+ lru_table_touch(table, table->head->next);
+ lru_table_dump("%i", table);
+ printf("size: %i \n", table->size);
+
+ struct lru_table_item* item;
+ item = lru_table_poll(table);
+ lru_table_dump("%i", table);
+ printf("size: %i \n", table->size);
+
+ while ((item = lru_table_poll(table)))
+ lru_table_dump("%i", table);
+
+ */
+ /*
+ lru_table_dump("%i", table);
+ lru_table_poll(table);
+ lru_table_dump("%i", table);
+ lru_table_pop(table);
+ lru_table_dump("%i", table);
+ lru_table_add(table, &seven);
+ lru_table_add(table, &six);
+ lru_table_dump("%i", table);
+ */
+
+ // lru_table_clobber(table);
+ // lru_table_clear(table);
+ // printf("size(table): %i \n", table->size);
+
+ // lru_table_clear(K);
+ // printf("size(K): %i \n", K->size);
+
+ // lru_table_dump("%i", table);
+
+ // dmalloc_shutdown();
+
+ MPI_Finalize();
+ return 0;
+}
+
+
Copied: test/adts/test-lru_table02.c (from rev 14, test/adts/test05.c)
===================================================================
--- test/adts/test-lru_table02.c (rev 0)
+++ test/adts/test-lru_table02.c 2010-04-20 16:22:03 UTC (rev 23)
@@ -0,0 +1,42 @@
+
+/**
+ * Test lru_table functionality.
+ * */
+
+#include <lru_table.h>
+
+int
+main(int argc, char* argv[])
+{
+ MPI_Init(&argc, &argv);
+ whoami();
+
+#ifdef DMALLOC
+ printf("DMALLOC\n");
+ // sprintf(dmalloc_logpath, "%s", "./dmalloc.out");
+#endif
+
+ struct lru_table* table = lru_table_create(5, 4);
+ struct keyvalue* kv;
+
+ lru_table_printf("%s", table);
+ char* data1 = "data1";
+ char* data2 = "data2";
+ lru_table_add(table, "key1", strdup(data1), strlen(data1)+1);
+ lru_table_printf("%s", table);
+ lru_table_add(table, "key2", strdup(data2), strlen(data2)+1);
+ lru_table_printf("%s", table);
+
+ char* overwrite = "XJKLJKL";
+ lru_table_update(table, "key2", overwrite, 3, strlen(overwrite)+1);
+
+ lru_table_printf("%s", table);
+
+ while ((kv = lru_table_poll(table)))
+ printf("polled: %s %s\n", kv->key, (char*) kv->data);
+
+ lru_table_printf("%s", table);
+
+ MPI_Finalize();
+ return 0;
+}
Property changes on: test/adts/test-lru_table02.c
___________________________________________________________________
Added: svn:mergeinfo
+
Deleted: test/adts/test05.c
===================================================================
--- test/adts/test05.c 2010-04-20 16:20:19 UTC (rev 22)
+++ test/adts/test05.c 2010-04-20 16:22:03 UTC (rev 23)
@@ -1,42 +0,0 @@
-
-/**
- * Test lru_table functionality.
- * */
-
-#include <lru_table.h>
-
-int
-main(int argc, char* argv[])
-{
- MPI_Init(&argc, &argv);
- whoami();
-
-#ifdef DMALLOC
- printf("DMALLOC\n");
- // sprintf(dmalloc_logpath, "%s", "./dmalloc.out");
-#endif
-
- struct lru_table* table = lru_table_create(5, 4);
- struct keyvalue* kv;
-
- lru_table_printf("%s", table);
- char* data1 = "data1";
- char* data2 = "data2";
- lru_table_add(table, "key1", strdup(data1), strlen(data1)+1);
- lru_table_printf("%s", table);
- lru_table_add(table, "key2", strdup(data2), strlen(data2)+1);
- lru_table_printf("%s", table);
-
- char* overwrite = "XJKLJKL";
- lru_table_update(table, "key2", overwrite, 3, strlen(overwrite)+1);
-
- lru_table_printf("%s", table);
-
- while ((kv = lru_table_poll(table)))
- printf("polled: %s %s\n", kv->key, (char*) kv->data);
-
- lru_table_printf("%s", table);
-
- MPI_Finalize();
- return 0;
-}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jmw...@us...> - 2010-04-20 16:23:47
|
Revision: 24
http://c-mpi.svn.sourceforge.net/c-mpi/?rev=24&view=rev
Author: jmwozniak
Date: 2010-04-20 16:23:41 +0000 (Tue, 20 Apr 2010)
Log Message:
-----------
Better name.
Added Paths:
-----------
test/adts/test-list.c
Removed Paths:
-------------
test/adts/test06.c
Copied: test/adts/test-list.c (from rev 14, test/adts/test06.c)
===================================================================
--- test/adts/test-list.c (rev 0)
+++ test/adts/test-list.c 2010-04-20 16:23:41 UTC (rev 24)
@@ -0,0 +1,28 @@
+
+/**
+ * Test list functionality.
+ * */
+
+#include <list.h>
+
+int
+main(int argc, char* argv[])
+{
+ struct list* L;
+
+ MPI_Init(&argc, &argv);
+ whoami();
+
+ L = list_parse("jkl iop l");
+
+ list_printf("%s", L);
+ fflush(stdout);
+ list_destroy(L);
+
+ L = list_parse(" jkl iop l ");
+ list_printf("%s", L);
+ list_destroy(L);
+
+ MPI_Finalize();
+ return 0;
+}
Property changes on: test/adts/test-list.c
___________________________________________________________________
Added: svn:mergeinfo
+
Deleted: test/adts/test06.c
===================================================================
--- test/adts/test06.c 2010-04-20 16:22:03 UTC (rev 23)
+++ test/adts/test06.c 2010-04-20 16:23:41 UTC (rev 24)
@@ -1,28 +0,0 @@
-
-/**
- * Test list functionality.
- * */
-
-#include <list.h>
-
-int
-main(int argc, char* argv[])
-{
- struct list* L;
-
- MPI_Init(&argc, &argv);
- whoami();
-
- L = list_parse("jkl iop l");
-
- list_printf("%s", L);
- fflush(stdout);
- list_destroy(L);
-
- L = list_parse(" jkl iop l ");
- list_printf("%s", L);
- list_destroy(L);
-
- MPI_Finalize();
- return 0;
-}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
Thanks for helping keep SourceForge clean.
X