in_place_partition.c 2.7 KB

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