declare_deps_after_submission.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2011 Université de Bordeaux 1
  4. * Copyright (C) 2010, 2011, 2012 Centre National de la Recherche Scientifique
  5. *
  6. * StarPU is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU Lesser General Public License as published by
  8. * the Free Software Foundation; either version 2.1 of the License, or (at
  9. * your option) any later version.
  10. *
  11. * StarPU is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  14. *
  15. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  16. */
  17. #include <pthread.h>
  18. #include <stdio.h>
  19. #include <unistd.h>
  20. #include <starpu.h>
  21. #include "../helper.h"
  22. #define NLOOPS 128
  23. static void dummy_func(void *descr[] __attribute__ ((unused)), void *arg __attribute__ ((unused)))
  24. {
  25. }
  26. static struct starpu_codelet dummy_codelet =
  27. {
  28. .where = STARPU_CPU|STARPU_CUDA,
  29. .cpu_funcs = {dummy_func, NULL},
  30. .cuda_funcs = {dummy_func, NULL},
  31. .model = NULL,
  32. .nbuffers = 0
  33. };
  34. static struct starpu_task *create_dummy_task(void)
  35. {
  36. struct starpu_task *task = starpu_task_create();
  37. task->cl = &dummy_codelet;
  38. task->cl_arg = NULL;
  39. return task;
  40. }
  41. int main(int argc, char **argv)
  42. {
  43. int ret;
  44. unsigned loop;
  45. ret = starpu_init(NULL);
  46. if (ret == -ENODEV) return STARPU_TEST_SKIPPED;
  47. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  48. struct starpu_task *taskA, *taskB;
  49. for (loop = 0; loop < NLOOPS; loop++)
  50. {
  51. taskA = create_dummy_task();
  52. taskB = create_dummy_task();
  53. /* By default, dynamically allocated tasks are destroyed at
  54. * termination, we cannot declare a dependency on something
  55. * that does not exist anymore. */
  56. taskA->destroy = 0;
  57. taskA->detach = 0;
  58. /* we wait for the tasks explicitly */
  59. taskB->detach = 0;
  60. ret = starpu_task_submit(taskA);
  61. if (ret == -ENODEV)
  62. return STARPU_TEST_SKIPPED;
  63. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  64. starpu_task_declare_deps_array(taskB, 1, &taskA);
  65. ret = starpu_task_submit(taskB);
  66. if (ret == -ENODEV)
  67. return STARPU_TEST_SKIPPED;
  68. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  69. ret = starpu_task_wait(taskB);
  70. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  71. ret = starpu_task_wait(taskA);
  72. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  73. starpu_task_destroy(taskA);
  74. }
  75. ret = starpu_task_wait_for_all();
  76. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_wait_for_all");
  77. starpu_shutdown();
  78. return EXIT_SUCCESS;
  79. }