Add wasm tacle-bench targets

targets/wasm-tacle/kernel/recursion/CMakeLists.txt

@@ -0,0 +1,25 @@
+# ~~~
+# SPDX-License-Identifier: MIT
+# SPDX-FileCopyrightText: 2026, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
+# ~~~
+
+cmake_minimum_required(VERSION 3.20)
+
+project(recursion)
+
+set(TACLEBENCH_ROOT_PATH "${CMAKE_CURRENT_LIST_DIR}/../../..")
+set(REPOSITORY_ROOT_PATH "${CMAKE_CURRENT_LIST_DIR}/../../../..")
+
+set(APP_TARGET_NAME "${CMAKE_PROJECT_NAME}")
+
+if(DEFINED TACLEBENCH_VARIANT AND "${TACLEBENCH_VARIANT}" STREQUAL "inline")
+    set(APP_SOURCE_FILE_PATH 
+        "generated/modified_sources/inline/recursion.c")
+else()
+    set(APP_SOURCE_FILE_PATH 
+        "generated/modified_sources/default/recursion.c")
+endif()
+
+include(${REPOSITORY_ROOT_PATH}/cmake/taclebench_wasm.cmake)
+
+

targets/wasm-tacle/kernel/recursion/ChangeLog.txt

@@ -0,0 +1,17 @@
+File: recursion.c
+Original provenience: Mälardalen benchmark suite, www.mrtc.....
+
+2017-04-18:
+- Annotated recursion_main as entry-point for timing analysis
+
+2015-10-12:
+- Remove comment on line 1
+- Added generic TACLeBench header to line 1
+- Renamed function fib to recursion_fib
+- Added forward decleration of functions
+- Added recursion_main, recursion_init, recursion_return function
+- create input value for recursion_fib function
+- Applied Code Style 
+- Added checksum in return function
+- Made input value volatile
+

targets/wasm-tacle/kernel/recursion/generated/default/recursion.wat

@@ -0,0 +1,80 @@
+(module $recursion.wasm
+  (type (;0;) (func))
+  (type (;1;) (func (param i32) (result i32)))
+  (type (;2;) (func (result i32)))
+  (func $__wasm_apply_data_relocs (type 0))
+  (func $recursion_fib (type 1) (param i32) (result i32)
+    (local i32)
+    i32.const 1
+    local.set 1
+    block  ;; label = @1
+      local.get 0
+      i32.const 2
+      i32.lt_u
+      br_if 0 (;@1;)
+      i32.const 0
+      local.set 1
+      loop  ;; label = @2
+        local.get 0
+        i32.const -1
+        i32.add
+        call $recursion_fib
+        local.get 1
+        i32.add
+        local.set 1
+        local.get 0
+        i32.const -2
+        i32.add
+        local.tee 0
+        i32.const 1
+        i32.gt_u
+        br_if 0 (;@2;)
+      end
+      local.get 1
+      i32.const 1
+      i32.add
+      local.set 1
+    end
+    local.get 1)
+  (func $recursion_main (type 0)
+    i32.const 0
+    i32.const 0
+    i32.load offset=1024
+    call $recursion_fib
+    i32.store offset=1028)
+  (func $__original_main (type 2) (result i32)
+    (local i32 i32)
+    global.get $__stack_pointer
+    i32.const 16
+    i32.sub
+    local.tee 0
+    global.set $__stack_pointer
+    local.get 0
+    i32.const 10
+    i32.store offset=12
+    i32.const 0
+    local.get 0
+    i32.load offset=12
+    i32.store offset=1024
+    call $recursion_main
+    i32.const 0
+    i32.load offset=1028
+    local.set 1
+    local.get 0
+    i32.const 16
+    i32.add
+    global.set $__stack_pointer
+    local.get 1
+    i32.const 89
+    i32.ne)
+  (table (;0;) 1 1 funcref)
+  (memory (;0;) 1)
+  (global $__stack_pointer (mut i32) (i32.const 5136))
+  (global (;1;) i32 (i32.const 1032))
+  (global (;2;) i32 (i32.const 5136))
+  (export "memory" (memory 0))
+  (export "__wasm_apply_data_relocs" (func $__wasm_apply_data_relocs))
+  (export "entrypoint" (func $recursion_main))
+  (export "main" (func $__original_main))
+  (export "__data_end" (global 1))
+  (export "__heap_base" (global 2)))

targets/wasm-tacle/kernel/recursion/generated/modified_sources/default/recursion.c

@@ -0,0 +1,71 @@
+/*
+  This program is part of the TACLeBench benchmark suite.
+  Version V 1.x
+
+  Name: recursion
+
+  Author: unknown
+
+  Function: recursion is a recursion program.
+    This program computes the Fibonacci number recursively.
+
+  Source: MRTC
+          http://www.mrtc.mdh.se/projects/wcet/wcet_bench/recursion/recursion.c
+
+  Changes: no major functional changes
+
+  License: May be used, modified, and re-distributed freely.
+
+*/
+
+/*
+   Global Variables
+*/
+
+int recursion_result;
+int recursion_input;
+
+/*
+  Forward declaration of functions
+*/
+int recursion_fib(int i);
+__attribute__((noinline)) __attribute__((export_name("entrypoint"))) void
+recursion_main(void);
+void recursion_init(void);
+int recursion_return(void);
+__attribute__((noinline)) __attribute__((export_name("main"))) int main(void);
+
+void
+recursion_init() {
+    int volatile temp_input = 10;
+    recursion_input = temp_input;
+}
+
+int
+recursion_fib(int i) {
+    if (i == 0)
+        return 1;
+    if (i == 1)
+        return 1;
+
+    return recursion_fib(i - 1) + recursion_fib(i - 2);
+}
+
+int
+recursion_return() {
+    return (recursion_result + (-89)) != 0;
+}
+
+__attribute__((noinline)) __attribute__((export_name("entrypoint"))) void
+recursion_main(void) {
+    _Pragma("marker recursivecall")
+        _Pragma("flowrestriction 1*fib <= 177*recursivecall") recursion_result =
+            recursion_fib(recursion_input);
+}
+
+__attribute__((noinline)) __attribute__((export_name("main"))) int
+main(void) {
+    recursion_init();
+    recursion_main();
+    return (recursion_return());
+}

targets/wasm-tacle/kernel/recursion/generated/modified_sources/inline/recursion.c

@@ -0,0 +1,79 @@
+/*
+  This program is part of the TACLeBench benchmark suite.
+  Version V 1.x
+
+  Name: recursion
+
+  Author: unknown
+
+  Function: recursion is a recursion program.
+    This program computes the Fibonacci number recursively.
+
+  Source: MRTC
+          http://www.mrtc.mdh.se/projects/wcet/wcet_bench/recursion/recursion.c
+
+  Changes: no major functional changes
+
+  License: May be used, modified, and re-distributed freely.
+
+*/
+
+/*
+   Global Variables
+*/
+
+
+
+
+int recursion_result;
+int recursion_input;
+
+/*
+  Forward declaration of functions
+*/
+__attribute__((always_inline)) static inline int recursion_fib(int i);
+__attribute__((noinline)) __attribute__((export_name("entrypoint")))
+__attribute__((noinline)) __attribute__((export_name("entrypoint"))) void
+recursion_main(void);
+__attribute__((always_inline)) static inline void recursion_init(void);
+__attribute__((always_inline)) static inline int recursion_return(void);
+__attribute__((noinline)) __attribute__((export_name("main")))
+__attribute__((noinline)) __attribute__((export_name("main"))) int
+main(void);
+
+__attribute__((always_inline)) static inline void
+recursion_init() {
+    int volatile temp_input = 10;
+    recursion_input = temp_input;
+}
+
+__attribute__((always_inline)) static inline int
+recursion_fib(int i) {
+    if (i == 0)
+        return 1;
+    if (i == 1)
+        return 1;
+
+    return recursion_fib(i - 1) + recursion_fib(i - 2);
+}
+
+__attribute__((always_inline)) static inline int
+recursion_return() {
+    return (recursion_result + (-89)) != 0;
+}
+
+__attribute__((noinline)) __attribute__((export_name("entrypoint")))
+__attribute__((noinline)) __attribute__((export_name("entrypoint"))) void
+recursion_main(void) {
+    _Pragma("marker recursivecall")
+        _Pragma("flowrestriction 1*fib <= 177*recursivecall") recursion_result =
+            recursion_fib(recursion_input);
+}
+
+__attribute__((noinline)) __attribute__((export_name("main")))
+__attribute__((noinline)) __attribute__((export_name("main"))) int
+main(void) {
+    recursion_init();
+    recursion_main();
+    return (recursion_return());
+}

targets/wasm-tacle/kernel/recursion/recursion.c

@@ -0,0 +1,72 @@
+/*
+  This program is part of the TACLeBench benchmark suite.
+  Version V 1.x
+
+  Name: recursion
+
+  Author: unknown
+
+  Function: recursion is a recursion program.
+    This program computes the Fibonacci number recursively.
+
+  Source: MRTC
+          http://www.mrtc.mdh.se/projects/wcet/wcet_bench/recursion/recursion.c
+
+  Changes: no major functional changes
+
+  License: May be used, modified, and re-distributed freely.
+
+*/
+
+
+/*
+   Global Variables
+*/
+int recursion_result;
+int recursion_input;
+
+/*
+  Forward declaration of functions
+*/
+int recursion_fib( int i );
+void recursion_main( void );
+void recursion_init( void );
+int recursion_return( void );
+int main ( void );
+
+
+void recursion_init()
+{
+  int volatile temp_input = 10;
+  recursion_input = temp_input;
+}
+
+
+int recursion_fib( int i )
+{
+  if ( i == 0 )
+    return 1;
+  if ( i == 1 )
+    return 1;
+
+  return recursion_fib( i - 1 ) + recursion_fib( i - 2 );
+}
+
+int recursion_return()
+{
+  return ( recursion_result  + ( -89 ) ) != 0;
+}
+
+void _Pragma( "entrypoint" ) recursion_main( void )
+{
+  _Pragma( "marker recursivecall" )
+  _Pragma( "flowrestriction 1*fib <= 177*recursivecall" )
+  recursion_result = recursion_fib( recursion_input );
+}
+
+int main( void )
+{
+  recursion_init();
+  recursion_main();
+  return ( recursion_return() );
+}