summaryrefslogtreecommitdiff
path: root/utility/benchmarks/thread_metric/tm_basic_processing_test.c
diff options
context:
space:
mode:
authorFrédéric Desbiens <[email protected]>2026-03-06 19:27:49 +0100
committerGitHub <[email protected]>2026-03-06 19:27:49 +0100
commit3726d7906b4808bfec7855fc088e073199df9120 (patch)
tree8789bfd03d1d49e1967e80d04aa4ff606fda43eb /utility/benchmarks/thread_metric/tm_basic_processing_test.c
parent4b6e8100d932a3a67b34c6eb17f84f3bffb9e2ae (diff)
parentc3259a216026372e3833dd8996a68f77e8595fbd (diff)
Merge pull request #510 from eclipse-threadx/devv6.5.0.202601_rel
Merge changes ahead of the v6.5.0.202601 release
Diffstat (limited to 'utility/benchmarks/thread_metric/tm_basic_processing_test.c')
-rw-r--r--utility/benchmarks/thread_metric/tm_basic_processing_test.c53
1 files changed, 24 insertions, 29 deletions
diff --git a/utility/benchmarks/thread_metric/tm_basic_processing_test.c b/utility/benchmarks/thread_metric/tm_basic_processing_test.c
index 27f3e48e..f1c4fa22 100644
--- a/utility/benchmarks/thread_metric/tm_basic_processing_test.c
+++ b/utility/benchmarks/thread_metric/tm_basic_processing_test.c
@@ -1,16 +1,17 @@
/***************************************************************************
- * Copyright (c) 2024 Microsoft Corporation
- *
+ * Copyright (c) 2024 Microsoft Corporation
+ * Copyright (c) 2026-present Eclipse ThreadX contributors
+ *
* This program and the accompanying materials are made available under the
* terms of the MIT License which is available at
* https://opensource.org/licenses/MIT.
- *
+ *
* SPDX-License-Identifier: MIT
**************************************************************************/
/**************************************************************************/
/**************************************************************************/
-/** */
+/** */
/** Thread-Metric Component */
/** */
/** Basic Processing Test */
@@ -19,28 +20,22 @@
/**************************************************************************/
-/**************************************************************************/
-/* */
-/* FUNCTION RELEASE */
-/* */
-/* tm_basic_processing_test PORTABLE C */
-/* 6.1.7 */
-/* AUTHOR */
-/* */
-/* William E. Lamie, Microsoft Corporation */
-/* */
-/* DESCRIPTION */
-/* */
+/**************************************************************************/
+/* */
+/* FUNCTION RELEASE */
+/* */
+/* tm_basic_processing_test PORTABLE C */
+/* 6.1.7 */
+/* AUTHOR */
+/* */
+/* William E. Lamie, Microsoft Corporation */
+/* */
+/* DESCRIPTION */
+/* */
/* This file defines the basic test for determining board processing */
/* capabilities */
-/* */
-/* RELEASE HISTORY */
-/* */
-/* DATE NAME DESCRIPTION */
-/* */
-/* 10-15-2021 William E. Lamie Initial Version 6.1.7 */
-/* */
-/**************************************************************************/
+/* */
+/**************************************************************************/
#include "tm_api.h"
@@ -49,8 +44,8 @@
unsigned long tm_basic_processing_counter;
-/* Test array. We will just do a series of calculations on the
- test array to eat up processing bandwidth. The idea is that
+/* Test array. We will just do a series of calculations on the
+ test array to eat up processing bandwidth. The idea is that
all RTOSes should produce the same metric here if everything
else is equal, e.g. processor speed, memory speed, etc. */
@@ -92,7 +87,7 @@ void tm_basic_processing_initialize(void)
/* Resume thread 0. */
tm_thread_resume(0);
- /* Create the reporting thread. It will preempt the other
+ /* Create the reporting thread. It will preempt the other
threads and print out the test results. */
tm_thread_create(5, 2, tm_basic_processing_thread_report);
tm_thread_resume(5);
@@ -116,9 +111,9 @@ int i;
while(1)
{
- /* Loop through the basic processing array, add the previous
+ /* Loop through the basic processing array, add the previous
contents with the contents of the tm_basic_processing_counter
- and xor the result with the previous value... just to eat
+ and xor the result with the previous value... just to eat
up some time. */
for (i = 0; i < 1024; i++)
{