/* * Copyright (c) 2014-2015, Siemens AG. All rights reserved. * * 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. */ #include #include #include "mtapi/mtapi_check_status-snippet.h" static #include "tasks/tasks_cpp_action_signature-snippet.h" /* get the node instance */ #include "tasks/tasks_cpp_get_node-snippet.h" /* calculate */ #include "mtapi/mtapi_terminating_condition-snippet.h" /* first recursive call spawned as task (x = fib(n - 1);) */ #include "tasks/tasks_cpp_calc_task-snippet.h" /* second recursive call can be called directly (y = fib(n - 2);) */ #include "tasks/tasks_cpp_calc_direct-snippet.h" /* wait for completion */ #include "tasks/tasks_cpp_wait_task-snippet.h" /* 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 */ embb::tasks::Node& node = embb::tasks::Node::GetInstance(); /* start calculation */ #include "tasks/tasks_cpp_start_task-snippet.h" /* wait for task completion */ mtapi_status_t status = task.Wait(MTAPI_INFINITE); MTAPI_CHECK_STATUS(status); return result; } void RunMTAPI_CPP() { int result = fibonacci(6); std::cout << "result: " << result << std::endl; }