in_place_partition.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596
  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. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  28. #ifdef STARPU_USE_OPENCL
  29. ret = starpu_opencl_load_opencl_from_file("tests/datawizard/scal_opencl.cl", &opencl_program, NULL);
  30. STARPU_CHECK_RETURN_VALUE(ret, "starpu_opencl_load_opencl_from_file");
  31. #endif
  32. n = starpu_worker_get_count();
  33. size = 10 * n;
  34. foo = calloc(size, sizeof(*foo));
  35. for (i = 0; i < size; i++)
  36. foo[i] = i;
  37. starpu_vector_data_register(&handle, 0, (uintptr_t)foo, size, sizeof(*foo));
  38. /* Broadcast the data to force in-place partitioning */
  39. for (i = 0; i < n; i++)
  40. starpu_data_prefetch_on_node(handle, starpu_worker_get_memory_node(i), 0);
  41. struct starpu_data_filter f =
  42. {
  43. .filter_func = starpu_block_filter_func_vector,
  44. .nchildren = n > 1 ? n : 2,
  45. };
  46. starpu_data_partition(handle, &f);
  47. for (i = 0; i < n; i++) {
  48. struct starpu_task *task = starpu_task_create();
  49. task->handles[0] = starpu_data_get_sub_data(handle, 1, i);
  50. task->cl = &scal_codelet;
  51. task->execute_on_a_specific_worker = 1;
  52. task->workerid = i;
  53. ret = starpu_task_submit(task);
  54. if (ret == -ENODEV) goto enodev;
  55. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  56. }
  57. ret = starpu_task_wait_for_all();
  58. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  59. starpu_data_unpartition(handle, 0);
  60. starpu_data_unregister(handle);
  61. starpu_shutdown();
  62. ret = EXIT_SUCCESS;
  63. for (i = 0; i < size; i++) {
  64. if (foo[i] != i*2) {
  65. FPRINTF(stderr,"value %d is %d instead of %d\n", i, foo[i], 2*i);
  66. ret = EXIT_FAILURE;
  67. }
  68. }
  69. return ret;
  70. enodev:
  71. starpu_data_unregister(handle);
  72. fprintf(stderr, "WARNING: No one can execute this task\n");
  73. /* yes, we do not perform the computation but we did detect that no one
  74. * could perform the kernel, so this is not an error from StarPU */
  75. starpu_shutdown();
  76. return STARPU_TEST_SKIPPED;
  77. }