in_place_partition.c 2.7 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011 Université de Bordeaux 1
  4. *
  5. * StarPU is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * StarPU is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. #include <starpu.h>
  17. #include <starpu_opencl.h>
  18. #include "../helper.h"
  19. #include "scal.h"
  20. int main(int argc, char **argv)
  21. {
  22. unsigned *foo;
  23. starpu_data_handle_t handle;
  24. int ret;
  25. int n, i, size;
  26. ret = starpu_init(NULL);
  27. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  28. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  29. #ifdef STARPU_USE_OPENCL
  30. ret = starpu_opencl_load_opencl_from_file("tests/datawizard/scal_opencl.cl", &opencl_program, NULL);
  31. STARPU_CHECK_RETURN_VALUE(ret, "starpu_opencl_load_opencl_from_file");
  32. #endif
  33. n = starpu_worker_get_count();
  34. size = 10 * n;
  35. foo = (unsigned *) calloc(size, sizeof(*foo));
  36. for (i = 0; i < size; i++)
  37. foo[i] = i;
  38. starpu_vector_data_register(&handle, 0, (uintptr_t)foo, size, sizeof(*foo));
  39. /* Broadcast the data to force in-place partitioning */
  40. for (i = 0; i < n; i++)
  41. starpu_data_prefetch_on_node(handle, starpu_worker_get_memory_node(i), 0);
  42. struct starpu_data_filter f =
  43. {
  44. .filter_func = starpu_block_filter_func_vector,
  45. .nchildren = n > 1 ? n : 2,
  46. };
  47. starpu_data_partition(handle, &f);
  48. for (i = 0; i < f.nchildren; i++) {
  49. struct starpu_task *task = starpu_task_create();
  50. task->handles[0] = starpu_data_get_sub_data(handle, 1, i);
  51. task->cl = &scal_codelet;
  52. task->execute_on_a_specific_worker = 1;
  53. task->workerid = i;
  54. ret = starpu_task_submit(task);
  55. if (ret == -ENODEV) goto enodev;
  56. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  57. }
  58. ret = starpu_task_wait_for_all();
  59. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  60. starpu_data_unpartition(handle, 0);
  61. starpu_data_unregister(handle);
  62. starpu_shutdown();
  63. ret = EXIT_SUCCESS;
  64. for (i = 0; i < size; i++) {
  65. if (foo[i] != i*2) {
  66. FPRINTF(stderr,"value %d is %d instead of %d\n", i, foo[i], 2*i);
  67. ret = EXIT_FAILURE;
  68. }
  69. }
  70. return ret;
  71. enodev:
  72. starpu_data_unregister(handle);
  73. fprintf(stderr, "WARNING: No one can execute this task\n");
  74. /* yes, we do not perform the computation but we did detect that no one
  75. * could perform the kernel, so this is not an error from StarPU */
  76. starpu_shutdown();
  77. return STARPU_TEST_SKIPPED;
  78. }