insert_task_dyn_handles.c 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011, 2012, 2013, 2014 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 <config.h>
  17. #include <starpu.h>
  18. #include <starpu_config.h>
  19. #include "../helper.h"
  20. void func_cpu(void *descr[], void *_args)
  21. {
  22. int num = starpu_task_get_current()->nbuffers;
  23. int i;
  24. for (i = 0; i < num; i++)
  25. {
  26. int *x = (int *)STARPU_VARIABLE_GET_PTR(descr[i]);
  27. *x = *x + 1;
  28. }
  29. }
  30. struct starpu_codelet codelet =
  31. {
  32. .cpu_funcs = {func_cpu},
  33. .cpu_funcs_name = {"func_cpu"},
  34. .nbuffers = STARPU_VARIABLE_NBUFFERS,
  35. };
  36. int main(int argc, char **argv)
  37. {
  38. int *x;
  39. int i, ret, loop;
  40. #ifdef STARPU_QUICK_CHECK
  41. int nloops = 4;
  42. #else
  43. int nloops = 16;
  44. #endif
  45. starpu_data_handle_t *data_handles;
  46. struct starpu_data_descr *descrs;
  47. ret = starpu_init(NULL);
  48. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  49. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  50. x = calloc(1, (STARPU_NMAXBUFS+5) * sizeof(int));
  51. data_handles = malloc((STARPU_NMAXBUFS+5) * sizeof(starpu_data_handle_t));
  52. descrs = malloc((STARPU_NMAXBUFS+5) * sizeof(struct starpu_data_descr));
  53. for(i=0 ; i<STARPU_NMAXBUFS+5 ; i++)
  54. {
  55. starpu_variable_data_register(&data_handles[i], STARPU_MAIN_RAM, (uintptr_t)&x[i], sizeof(x[i]));
  56. descrs[i].handle = data_handles[i];
  57. descrs[i].mode = STARPU_RW;
  58. }
  59. for (loop = 0; loop < nloops; loop++)
  60. {
  61. ret = starpu_task_insert(&codelet,
  62. STARPU_DATA_MODE_ARRAY, descrs, STARPU_NMAXBUFS-1,
  63. 0);
  64. if (ret == -ENODEV) goto enodev;
  65. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_insert");
  66. ret = starpu_task_insert(&codelet,
  67. STARPU_DATA_MODE_ARRAY, descrs, STARPU_NMAXBUFS+5,
  68. 0);
  69. if (ret == -ENODEV) goto enodev;
  70. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_insert");
  71. }
  72. enodev:
  73. for(i=0 ; i<STARPU_NMAXBUFS+5 ; i++)
  74. {
  75. starpu_data_unregister(data_handles[i]);
  76. }
  77. starpu_shutdown();
  78. free(data_handles);
  79. free(descrs);
  80. if (ret == -ENODEV)
  81. {
  82. fprintf(stderr, "WARNING: No one can execute this task\n");
  83. /* yes, we do not perform the computation but we did detect that no one
  84. * could perform the kernel, so this is not an error from StarPU */
  85. free(x);
  86. return STARPU_TEST_SKIPPED;
  87. }
  88. else
  89. {
  90. for(i=0 ; i<STARPU_NMAXBUFS-1 ; i++)
  91. {
  92. if (x[i] != nloops * 2)
  93. {
  94. FPRINTF(stderr, "[end loop] value[%d] = %d != Expected value %d\n", i, x[i], nloops*2);
  95. ret = 1;
  96. }
  97. }
  98. for(i=STARPU_NMAXBUFS-1 ; i<STARPU_NMAXBUFS+5 ; i++)
  99. {
  100. if (x[i] != nloops)
  101. {
  102. FPRINTF(stderr, "[end loop] value[%d] = %d != Expected value %d\n", i, x[i], nloops);
  103. ret = 1;
  104. }
  105. }
  106. if (ret == 0)
  107. {
  108. FPRINTF(stderr, "[end of loop] all values are correct\n");
  109. }
  110. free(x);
  111. return ret;
  112. }
  113. }