From 791f412ad66a36fb6dc530149024acb4bcbfaed6 Mon Sep 17 00:00:00 2001 From: gdisirio Date: Tue, 26 May 2009 13:08:40 +0000 Subject: [PATCH] git-svn-id: svn://svn.code.sf.net/p/chibios/svn/trunk@991 35acf78f-673a-0410-8e92-d51de3d6d3f4 --- test/testbmk.c | 20 ++++++++++---------- 1 file changed, 10 insertions(+), 10 deletions(-) diff --git a/test/testbmk.c b/test/testbmk.c index cb6ce9da7..7a99c37af 100644 --- a/test/testbmk.c +++ b/test/testbmk.c @@ -209,7 +209,7 @@ const struct testcase testbmk3 = { * A thread is created that just performs a @p chSchGoSleepS() into a loop, * the thread is awakened as fast is possible by the tester thread.
* The Context Switch performance is calculated by measuring the number of - * interactions after a second of continuous operations. + * iterations after a second of continuous operations. */ static char *bmk4_gettest(void) { @@ -272,8 +272,8 @@ const struct testcase testbmk4 = { *

Description

* Threads are continuously created and terminated into a loop. A full * @p chThdCreateStatic() / @p chThdExit() / @p chThdWait() cycle is performed - * in each interaction.
- * The performance is calculated by measuring the number of interactions after + * in each iteration.
+ * The performance is calculated by measuring the number of iterations after * a second of continuous operations. */ @@ -314,10 +314,10 @@ const struct testcase testbmk5 = { *

Description

* Threads are continuously created and terminated into a loop. A partial * @p chThdCreateStatic() / @p chThdExit() cycle is performed in each - * interaction, the @p chThdWait() is not necessary because the thread is + * iteration, the @p chThdWait() is not necessary because the thread is * created at an higher priority so there is no need to wait for it to * terminate.
- * The performance is calculated by measuring the number of interactions after + * The performance is calculated by measuring the number of iterations after * a second of continuous operations. */ @@ -359,7 +359,7 @@ const struct testcase testbmk6 = { * Five threads are created and atomically reschedulated by resetting the * semaphore where they are waiting on. The operation is performed into a * continuous loop.
- * The performance is calculated by measuring the number of interactions after + * The performance is calculated by measuring the number of iterations after * a second of continuous operations. */ @@ -423,7 +423,7 @@ const struct testcase testbmk7 = { *

Description

* Four bytes are written and then read from an @p InputQueue into a continuous * loop.
- * The performance is calculated by measuring the number of interactions after + * The performance is calculated by measuring the number of iterations after * a second of continuous operations. */ @@ -471,7 +471,7 @@ const struct testcase testbmk8 = { * *

Description

* A virtual timer is set and immediately reset into a continuous loop.
- * The performance is calculated by measuring the number of interactions after + * The performance is calculated by measuring the number of iterations after * a second of continuous operations. */ @@ -518,7 +518,7 @@ const struct testcase testbmk9 = { *

Description

* A counting semaphore is taken/released into a continuous loop, no Context * Switch happens because the counter is always non negative.
- * The performance is calculated by measuring the number of interactions after + * The performance is calculated by measuring the number of iterations after * a second of continuous operations. */ @@ -570,7 +570,7 @@ const struct testcase testbmk10 = { *

Description

* A mutex is locked/unlocked into a continuous loop, no Context Switch happens * because there are no other threads asking for the mutex.
- * The performance is calculated by measuring the number of interactions after + * The performance is calculated by measuring the number of iterations after * a second of continuous operations. */