mpi/tests: add testcase which deals with dynamic handles

mpi/tests/Makefile.am

@@ -106,6 +106,7 @@ starpu_mpi_TESTS =				\
 	insert_task_owner_data			\
 	insert_task_node_choice			\
 	insert_task_count			\
+	insert_task_dyn_handles			\
 	multiple_send				\
 	mpi_scatter_gather			\
 	mpi_reduction				\
@@ -143,6 +144,7 @@ noinst_PROGRAMS =				\
 	insert_task_owner_data			\
 	insert_task_node_choice			\
 	insert_task_count			\
+	insert_task_dyn_handles			\
 	multiple_send				\
 	mpi_scatter_gather			\
 	mpi_reduction				\
@@ -208,6 +210,8 @@ insert_task_node_choice_LDADD =			\
 	../src/libstarpumpi-@STARPU_EFFECTIVE_VERSION@.la
 insert_task_count_LDADD =				\
 	../src/libstarpumpi-@STARPU_EFFECTIVE_VERSION@.la
+insert_task_dyn_handles_LDADD =				\
+	../src/libstarpumpi-@STARPU_EFFECTIVE_VERSION@.la
 multiple_send_LDADD =				\
 	../src/libstarpumpi-@STARPU_EFFECTIVE_VERSION@.la
 mpi_scatter_gather_LDADD =			\

mpi/tests/insert_task_dyn_handles.c

@@ -0,0 +1,141 @@
+/* StarPU --- Runtime system for heterogeneous multicore architectures.
+ *
+ * Copyright (C) 2011, 2012, 2013, 2014  Centre National de la Recherche Scientifique
+ *
+ * StarPU is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or (at
+ * your option) any later version.
+ *
+ * StarPU is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ *
+ * See the GNU Lesser General Public License in COPYING.LGPL for more details.
+ */
+
+#include <config.h>
+#include <starpu_mpi.h>
+#include <starpu_config.h>
+#include "helper.h"
+
+void func_cpu(void *descr[], void *_args)
+{
+	int num = starpu_task_get_current()->nbuffers;
+	int i;
+
+	for (i = 0; i < num; i++)
+	{
+		int *x = (int *)STARPU_VARIABLE_GET_PTR(descr[i]);
+
+		*x = *x + 1;
+	}
+}
+
+struct starpu_codelet codelet =
+{
+	.cpu_funcs = {func_cpu},
+	.cpu_funcs_name = {"func_cpu"},
+	.nbuffers = STARPU_VARIABLE_NBUFFERS,
+};
+
+int main(int argc, char **argv)
+{
+        int *x;
+        int i, ret, loop;
+	int rank;
+
+#ifdef STARPU_QUICK_CHECK
+	int nloops = 4;
+#else
+	int nloops = 16;
+#endif
+        starpu_data_handle_t *data_handles;
+	struct starpu_data_descr *descrs;
+
+	MPI_Init(&argc, &argv);
+	MPI_Comm_rank(MPI_COMM_WORLD, &rank);
+
+	ret = starpu_init(NULL);
+	STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
+	ret = starpu_mpi_init(NULL, NULL, 0);
+	STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init");
+
+	x = calloc(1, (STARPU_NMAXBUFS+15) * sizeof(int));
+	data_handles = malloc((STARPU_NMAXBUFS+15) * sizeof(starpu_data_handle_t));
+	descrs = malloc((STARPU_NMAXBUFS+15) * sizeof(struct starpu_data_descr));
+	for(i=0 ; i<STARPU_NMAXBUFS+15 ; i++)
+	{
+		starpu_variable_data_register(&data_handles[i], STARPU_MAIN_RAM, (uintptr_t)&x[i], sizeof(x[i]));
+		starpu_mpi_data_register(data_handles[i], i, 0);
+		descrs[i].handle = data_handles[i];
+		descrs[i].mode = STARPU_RW;
+	}
+
+	for (loop = 0; loop < nloops; loop++)
+	{
+		ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &codelet,
+					     STARPU_DATA_MODE_ARRAY, descrs, STARPU_NMAXBUFS-1,
+					     0);
+		if (ret == -ENODEV) goto enodev;
+		STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_task_insert");
+
+		ret = starpu_mpi_task_insert(MPI_COMM_WORLD, &codelet,
+					     STARPU_DATA_MODE_ARRAY, descrs, STARPU_NMAXBUFS+15,
+					     0);
+		if (ret == -ENODEV) goto enodev;
+		STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_task_insert");
+	}
+
+enodev:
+        for(i=0 ; i<STARPU_NMAXBUFS+15 ; i++)
+	{
+                starpu_data_unregister(data_handles[i]);
+        }
+
+	free(data_handles);
+	free(descrs);
+
+	if (ret == -ENODEV)
+	{
+		fprintf(stderr, "WARNING: No one can execute this task\n");
+		/* yes, we do not perform the computation but we did detect that no one
+		 * could perform the kernel, so this is not an error from StarPU */
+		free(x);
+		ret = STARPU_TEST_SKIPPED;
+	}
+	else if (rank == 0)
+	{
+		for(i=0 ; i<STARPU_NMAXBUFS-1 ; i++)
+		{
+			if (x[i] != nloops * 2)
+			{
+				FPRINTF_MPI("[end loop] value[%d] = %d != Expected value %d\n", i, x[i], nloops*2);
+				ret = 1;
+			}
+		}
+		for(i=STARPU_NMAXBUFS-1 ; i<STARPU_NMAXBUFS+15 ; i++)
+		{
+			if (x[i] != nloops)
+			{
+				FPRINTF_MPI("[end loop] value[%d] = %d != Expected value %d\n", i, x[i], nloops);
+				ret = 1;
+			}
+		}
+		if (ret == 0)
+		{
+			FPRINTF_MPI("[end of loop] all values are correct\n");
+		}
+		free(x);
+	}
+	else
+	{
+		FPRINTF_MPI("[end of loop] no computation on this node\n");
+		ret = 0;
+	}
+
+	starpu_mpi_shutdown();
+	starpu_shutdown();
+	MPI_Finalize();
+	return ret;
+}