in_place_partition.c 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106
  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 "../helper.h"
  18. #include "scal.h"
  19. int main(int argc, char **argv)
  20. {
  21. unsigned *foo;
  22. starpu_data_handle_t handle;
  23. int ret;
  24. int n, i, size;
  25. unsigned j;
  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. if (n == 1)
  35. {
  36. starpu_shutdown();
  37. return STARPU_TEST_SKIPPED;
  38. }
  39. size = 10 * n;
  40. foo = (unsigned *) calloc(size, sizeof(*foo));
  41. for (i = 0; i < size; i++)
  42. foo[i] = i;
  43. starpu_vector_data_register(&handle, 0, (uintptr_t)foo, size, sizeof(*foo));
  44. /* Broadcast the data to force in-place partitioning */
  45. for (i = 0; i < n; i++)
  46. starpu_data_prefetch_on_node(handle, starpu_worker_get_memory_node(i), 0);
  47. struct starpu_data_filter f =
  48. {
  49. .filter_func = starpu_block_filter_func_vector,
  50. .nchildren = n,
  51. };
  52. starpu_data_partition(handle, &f);
  53. for (j = 0; j < f.nchildren; j++)
  54. {
  55. struct starpu_task *task = starpu_task_create();
  56. task->handles[0] = starpu_data_get_sub_data(handle, 1, j);
  57. task->cl = &scal_codelet;
  58. task->execute_on_a_specific_worker = 1;
  59. task->workerid = j;
  60. ret = starpu_task_submit(task);
  61. if (ret == -ENODEV) goto enodev;
  62. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  63. }
  64. ret = starpu_task_wait_for_all();
  65. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  66. starpu_data_unpartition(handle, 0);
  67. starpu_data_unregister(handle);
  68. starpu_shutdown();
  69. ret = EXIT_SUCCESS;
  70. for (i = 0; i < size; i++)
  71. {
  72. if (foo[i] != i*2)
  73. {
  74. FPRINTF(stderr,"value %d is %u instead of %d\n", i, foo[i], 2*i);
  75. ret = EXIT_FAILURE;
  76. }
  77. }
  78. return ret;
  79. enodev:
  80. starpu_data_unregister(handle);
  81. fprintf(stderr, "WARNING: No one can execute this task\n");
  82. /* yes, we do not perform the computation but we did detect that no one
  83. * could perform the kernel, so this is not an error from StarPU */
  84. starpu_shutdown();
  85. return STARPU_TEST_SKIPPED;
  86. }