insert_task_owner_data.c 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011 Centre National de la Recherche Scientifique
  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_mpi.h>
  17. #include <starpu_mpi_datatype.h>
  18. #include <math.h>
  19. void func_cpu(void *descr[], __attribute__ ((unused)) void *_args)
  20. {
  21. int *x0 = (int *)STARPU_VARIABLE_GET_PTR(descr[0]);
  22. int *x1 = (int *)STARPU_VARIABLE_GET_PTR(descr[1]);
  23. *x0 += 1;
  24. *x1 *= *x1;
  25. }
  26. starpu_codelet mycodelet = {
  27. .where = STARPU_CPU,
  28. .cpu_func = func_cpu,
  29. .nbuffers = 2
  30. };
  31. int main(int argc, char **argv)
  32. {
  33. int rank, size, err;
  34. int x[2];
  35. int i;
  36. starpu_data_handle data_handles[2];
  37. int values[2];
  38. starpu_init(NULL);
  39. starpu_mpi_initialize_extended(&rank, &size);
  40. if (rank > 1) {
  41. starpu_mpi_shutdown();
  42. starpu_shutdown();
  43. return 0;
  44. }
  45. if (rank == 0) {
  46. x[0] = 11;
  47. starpu_variable_data_register(&data_handles[0], 0, (uintptr_t)&x[0], sizeof(x[0]));
  48. starpu_data_set_rank(data_handles[0], 0);
  49. starpu_data_set_tag(data_handles[0], 0);
  50. starpu_variable_data_register(&data_handles[1], -1, (uintptr_t)NULL, sizeof(x[1]));
  51. starpu_data_set_rank(data_handles[1], 1);
  52. starpu_data_set_tag(data_handles[1],10);
  53. }
  54. else if (rank == 1) {
  55. x[1] = 12;
  56. starpu_variable_data_register(&data_handles[0], -1, (uintptr_t)NULL, sizeof(x[0]));
  57. starpu_data_set_rank(data_handles[0], 0);
  58. starpu_data_set_tag(data_handles[0], 0);
  59. starpu_variable_data_register(&data_handles[1], 0, (uintptr_t)&x[1], sizeof(x[1]));
  60. starpu_data_set_rank(data_handles[1], 1);
  61. starpu_data_set_tag(data_handles[1], 1);
  62. }
  63. err = starpu_mpi_insert_task(MPI_COMM_WORLD, &mycodelet,
  64. STARPU_RW, data_handles[0], STARPU_RW, data_handles[1],
  65. STARPU_EXECUTE_ON_DATA, data_handles[1],
  66. 0);
  67. assert(err == 0);
  68. starpu_task_wait_for_all();
  69. for(i=0 ; i<2 ; i++) {
  70. starpu_mpi_get_data_on_node(MPI_COMM_WORLD, data_handles[i], 0);
  71. starpu_data_acquire(data_handles[i], STARPU_R);
  72. values[i] = *((int *)starpu_mpi_handle_to_ptr(data_handles[i]));
  73. }
  74. assert(values[0] == 12 && values[1] == 144);
  75. fprintf(stderr, "[%d][local ptr] VALUES: %d %d\n", rank, values[0], values[1]);
  76. starpu_mpi_shutdown();
  77. starpu_shutdown();
  78. return 0;
  79. }