tasks_cpp-fragmented.cc 2.49 KB
Newer Older
Marcus Winter committed
1
/*
Marcus Winter committed
2
 * Copyright (c) 2014-2016, Siemens AG. All rights reserved.
Marcus Winter committed
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice,
 * this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

27 28
#include <iostream>

29
#include <embb/tasks/tasks.h>
30 31 32 33

#include "mtapi/mtapi_check_status-snippet.h"

static
34
#include "tasks/tasks_cpp_action_signature-snippet.h"
35
  /* get the node instance */
36
#include "tasks/tasks_cpp_get_node-snippet.h"
37 38 39
  /* calculate */
#include "mtapi/mtapi_terminating_condition-snippet.h"
    /* first recursive call spawned as task (x = fib(n - 1);) */
40
#include "tasks/tasks_cpp_calc_task-snippet.h"
41
    /* second recursive call can be called directly (y = fib(n - 2);) */
42
#include "tasks/tasks_cpp_calc_direct-snippet.h"
43
    /* wait for completion */
44
#include "tasks/tasks_cpp_wait_task-snippet.h"
45 46 47 48 49 50
    /* add the two preceeding numbers */
#include "mtapi/mtapi_write_back-snippet.h"

static
int fibonacci(int n) {
  /* get the node instance, the node is initialized automatically */
51
  embb::tasks::Node& node = embb::tasks::Node::GetInstance();
52
  /* start calculation */
53
#include "tasks/tasks_cpp_start_task-snippet.h"
54 55 56 57 58 59 60
  /* wait for task completion */
  mtapi_status_t status = task.Wait(MTAPI_INFINITE);
  MTAPI_CHECK_STATUS(status);

  return result;
}

61
void RunTasks() {
62 63 64
  int result = fibonacci(6);
  std::cout << "result: " << result << std::endl;
}