diff --git a/readme.txt b/readme.txt
index 471f823de..058e397ee 100644
--- a/readme.txt
+++ b/readme.txt
@@ -74,6 +74,7 @@
*****************************************************************************
*** Next ***
+- NEW: Simplified test XML schema.
- NEW: Simplified interface between ports and RT/NIL.
- NEW: Removed duplicated files for ARM ports: chtypes.h.
- NEW: Removed duplicated files for all ports: chcore_timer.h.
diff --git a/release_note_next.txt b/release_note_next.txt
index 8b7ee6b24..2a9715e90 100644
--- a/release_note_next.txt
+++ b/release_note_next.txt
@@ -24,6 +24,7 @@ integrated in our structure: WolfSSL, FatFS and lwIP.
- Updated CMSIS headers for STM32F7, G0, G4, H7, L0, L4, L4+.
- Mail Queues test implementation in CMSIS RTOS wrapper.
- Added latency measurement test application.
+- Simplified test XML schema.
*** What's new in RT/NIL ports ***
diff --git a/test/crypto/configuration.xml b/test/crypto/configuration.xml
index a06e67e98..e54f79770 100644
--- a/test/crypto/configuration.xml
+++ b/test/crypto/configuration.xml
@@ -1,19 +1,12 @@
-
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
-
+
-
-
+
-
-
+
+
-
-
+
+
-
-
+
-
-
+
+
-
-
+
+
-
-
+
-
-
+
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
-
+
-
-
+
-
-
+
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
-
-
+
+
+
-
-
+
-
-
+
-
-
+
-
-
-
-
+
+
+
-
-
+
-
-
+
-
-
-
-
+
+
+
-
-
+
-
-
+
-
-
-
-
+
+
+
-
-
-
-
+
+
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
-
-
+
+
+
+
+
+
+
+
+
+
+ Prints the version string.
+
+
+
+
+
+
-
-
-
-
-
+
+
-
-
-
+
+
-
-
-
-
-
-
+
+
+
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
-
-
-
+
+
+
+
+ Testing the mailbox size.
+
+
+
+
+
+
+
+
+
+
+ Resetting the mailbox, conditions are checked, no
+ errors expected. The mailbox is then returned in
+ active state.
+
+
+
+
+
+
-
-
-
-
- Filling the mailbox using chMBPostI() and chMBPostAheadI() once, no errors expected.
-
-
-
-
-
-
+
+
+
+ Filling the mailbox using chMBPostI() and
+ chMBPostAheadI() once, no errors expected.
+
+
+
+
+
+
-
-
-
-
- Testing intermediate conditions. Data pointers must be aligned, semaphore counters are checked.
-
-
-
-
-
-
+
+
+
+ Testing intermediate conditions. Data pointers
+ must be aligned, semaphore counters are checked.
+
+
+
+
+
+
+
-
-
-
-
- Emptying the mailbox using chMBFetchI(), no errors expected.
-
-
-
-
-
-
+
+
+
+ Emptying the mailbox using chMBFetchI(), no
+ errors expected.
+
+
+
+
+
+
test_emit_token(msg2);
}
test_assert_sequence("ABCD", "wrong get sequence");]]>
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
+
+
+ Filling the mailbox.
+
+
+
+
+
+
-
-
-
-
- Testing chMBPostTimeout(), chMBPostI(), chMBPostAheadTimeout() and chMBPostAheadI() timeout.
-
-
-
-
-
-
+
+
+
+ Testing chMBPostTimeout(), chMBPostI(),
+ chMBPostAheadTimeout() and chMBPostAheadI() timeout.
+
+
+
+
+
+
+
-
-
-
-
- Resetting the mailbox. The mailbox is then returned in active state.
-
-
-
-
-
-
+
+
+
+ Resetting the mailbox. The mailbox is then
+ returned in active state.
+
+
+
+
+
+
-
-
-
-
- Testing chMBFetchTimeout() and chMBFetchI() timeout.
-
-
-
-
-
-
+
+
+
+ Testing chMBFetchTimeout() and chMBFetchI()
+ timeout.
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+ Pipes normal API, non-blocking tests.
+
+
+ The pipe functionality is tested by loading and
+ emptying it, all conditions are tested.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Resetting pipe.
+
+
+
+
+
+
-
-
-
-
- Writing data, must fail.
-
-
-
-
-
-
+
+
+
+ Writing data, must fail.
+
+
+
+
+
+
-
-
-
-
- Reading data, must fail.
-
-
-
-
-
-
+
+
+
+ Reading data, must fail.
+
+
+
+
+
+
-
-
-
-
- Reactivating pipe.
-
-
-
-
-
-
+
+
+
+ Reactivating pipe.
+
+
+
+
+
+
-
-
-
-
- Filling whole pipe.
-
-
-
-
-
-
+
+
+
+ Filling whole pipe.
+
+
+
+
+
+
-
-
-
-
- Emptying pipe.
-
-
-
-
-
-
+
+
+
+ Emptying pipe.
+
+
+
+
+
+
-
-
-
-
- Small write.
-
-
-
-
-
-
+
+
+
+ Small write.
+
+
+
+
+
+
-
-
-
-
- Filling remaining space.
-
-
-
-
-
-
+
+
+
+ Filling remaining space.
+
+
+
+
+
+
-
-
-
-
- Small Read.
-
-
-
-
-
-
+
+
+
+ Small Read.
+
+
+
+
+
+
-
-
-
-
- Reading remaining data.
-
-
-
-
-
-
+
+
+
+ Reading remaining data.
+
+
+
+
+
+
-
-
-
-
- Small Write.
-
-
-
-
-
-
+
+
+
+ Small Write.
+
+
+
+
+
+
-
-
-
-
- Small Read.
-
-
-
-
-
-
+
+
+
+ Small Read.
+
+
+
+
+
+
-
-
-
-
- Write wrapping buffer boundary.
-
-
-
-
-
-
+
+
+
+ Write wrapping buffer boundary.
+
+
+
+
+
+
-
-
-
-
- Read wrapping buffer boundary.
-
-
-
-
-
-
+
+
+
+ Read wrapping buffer boundary.
+
+
+
+
+
+
-
-
-
-
-
-
- Pipe timeouts.
-
-
- The pipe API is tested for timeouts.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Reading while pipe is empty.
-
-
-
-
-
-
+
+
+
+
+
+ Pipe timeouts.
+
+
+ The pipe API is tested for timeouts.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Reading while pipe is empty.
+
+
+
+
+
+
-
-
-
-
- Writing a string larger than pipe buffer.
-
-
-
-
-
-
+
+
+
+ Writing a string larger than pipe buffer.
+
+
+
+
+
+
-
-
-
-
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
+
+ Cache initialization.
+
+
+ A cache object is initialized, some initial
+ conditions are checked.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Cache initialization.
+
+
+
+
+
+
-
-
-
-
- Getting and releasing objects without initialization.
-
-
-
-
-
-
+
+
+
+ Getting and releasing objects without
+ initialization.
+
+
+
+
+
+
-
-
-
-
- Getting and releasing objects with synchronous initialization.
-
-
-
-
-
-
+
+
+
+ Getting and releasing objects with synchronous
+ initialization.
+
+
+
+
+
+
-
-
-
-
- Getting and releasing objects with asynchronous initialization.
-
-
-
-
-
-
+
+
+
+ Getting and releasing objects with asynchronous
+ initialization.
+
+
+
+
+
+
-
-
-
-
- Checking cached objects.
-
-
-
-
-
-
+
+
+
+ Checking cached objects.
+
+
+
+
+
+
-
-
-
-
- Checking non-cached objects.
-
-
-
-
-
-
+
+
+
+ Checking non-cached objects.
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
+
+
+
+ Loading and emptying a memory pool.
+
+
+ The memory pool functionality is tested by loading
+ and emptying it, all conditions are tested.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Adding the objects to the pool using
+ chPoolLoadArray().
+
+
+
+
+
+
+
+
+
+
+ Emptying the pool using chPoolAlloc().
+
+
+
+
+
+
-
-
-
-
- Now must be empty.
-
-
-
-
-
-
-
-
-
-
- Adding the objects to the pool using chPoolFree().
-
-
-
-
-
-
+
+
+
+ Now must be empty.
+
+
+
+
+
+
+
+
+
+
+ Adding the objects to the pool using
+ chPoolFree().
+
+
+
+
+
+
-
-
-
-
- Emptying the pool using chPoolAlloc() again.
-
-
-
-
-
-
+
+
+
+ Emptying the pool using chPoolAlloc() again.
+
+
+
+
+
+
+
-
-
-
-
- Now must be empty again.
-
-
-
-
-
-
-
-
-
-
- Covering the case where a provider is unable to return more memory.
-
-
-
-
-
-
+
+
+
+ Now must be empty again.
+
+
+
+
+
+
+
+
+
+
+ Covering the case where a provider is unable to
+ return more memory.
+
+
+
+
+
+
-
-
-
-
-
-
- Loading and emptying a guarded memory pool without waiting.
-
-
- The memory pool functionality is tested by loading and emptying it, all conditions are tested.
-
-
- CH_CFG_USE_SEMAPHORES
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Adding the objects to the pool using chGuardedPoolLoadArray().
-
-
-
-
-
-
-
-
-
-
- Emptying the pool using chGuardedPoolAllocTimeout().
-
-
-
-
-
-
+
+
+
+
+
+ Loading and emptying a guarded memory pool without waiting.
+
+
+ The memory pool functionality is tested by loading
+ and emptying it, all conditions are tested.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Adding the objects to the pool using
+ chGuardedPoolLoadArray().
+
+
+
+
+
+
+
+
+
+
+ Emptying the pool using
+ chGuardedPoolAllocTimeout().
+
+
+
+
+
+
-
-
-
-
- Now must be empty.
-
-
-
-
-
-
-
-
-
-
- Adding the objects to the pool using chGuardedPoolFree().
-
-
-
-
-
-
+
+
+
+ Now must be empty.
+
+
+
+
+
+
+
+
+
+
+ Adding the objects to the pool using
+ chGuardedPoolFree().
+
+
+
+
+
+
-
-
-
-
- Emptying the pool using chGuardedPoolAllocTimeout() again.
-
-
-
-
-
-
+
+
+
+ Emptying the pool using
+ chGuardedPoolAllocTimeout() again.
+
+
+
+
+
+
-
-
-
-
- Now must be empty again.
-
-
-
-
-
-
-
-
-
-
-
-
- Guarded Memory Pools timeout.
-
-
- The timeout features for the Guarded Memory Pools is tested.
-
-
- CH_CFG_USE_SEMAPHORES
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Trying to allocate with 100mS timeout, must fail because the pool is empty.
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
-
-
-
-
+
+
+
+
+
-
-
-
+
+
-
-
-
+
+ = ALLOC_SIZE, "unexpected heap state");
test_assert(total_size == largest_size, "unexpected heap state");]]>
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
+
+
+ Single block allocation using chHeapAlloc() then
+ the block is freed using chHeapFree(), must not fail.
+
+
+
+
+
+
+
-
-
-
-
- Testing allocation failure.
-
-
-
-
-
-
+
+
+
+ Testing allocation failure.
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+ element.refs == 2, "references mismatch");
chFactoryReleaseObject(rop1);
test_assert(rop->element.refs == 1, "references mismatch");]]>
-
-
-
-
-
-
+
+
+
+
+
-
-
-
+
+
+
+
+
+
+
+ Retrieving a dynamic buffer by name, must not
+ exist.
+
+
+
+
+
+
-
-
-
-
- Creating a dynamic buffer it must not exists, must succeed.
-
-
-
-
-
-
+
+
+
+ Creating a dynamic buffer it must not exists,
+ must succeed.
+
+
+
+
+
+
-
-
-
-
- Creating a dynamic buffer with the same name, must fail.
-
-
-
-
-
-
+
+
+
+ Creating a dynamic buffer with the same name,
+ must fail.
+
+
+
+
+
+
-
-
-
-
- Retrieving the dynamic buffer by name, must exist, then increasing the reference counter, finally releasing both references.
-
-
-
-
-
-
+
+
+
+ Retrieving the dynamic buffer by name, must
+ exist, then increasing the reference counter, finally
+ releasing both references.
+
+
+
+
+
+ element.refs == 2, "references mismatch");
chFactoryReleaseBuffer(dbp1);
test_assert(dbp->element.refs == 1, "references mismatch");]]>
-
-
-
-
- Releasing the first reference to the dynamic buffer, must not trigger an assertion.
-
-
-
-
-
-
-
-
-
-
- Retrieving the dynamic buffer by name again, must not exist.
-
-
-
-
-
-
+
+
+
+ Releasing the first reference to the dynamic
+ buffer, must not trigger an assertion.
+
+
+
+
+
+
+
+
+
+
+ Retrieving the dynamic buffer by name again, must
+ not exist.
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+
+
+
+
+ Retrieving a dynamic semaphore by name, must not
+ exist.
+
+
+
+
+
+
-
-
-
-
- Creating a dynamic semaphore it must not exists, must succeed.
-
-
-
-
-
-
+
+
+
+ Creating a dynamic semaphore it must not exists,
+ must succeed.
+
+
+
+
+
+
-
-
-
-
- Creating a dynamic semaphore with the same name, must fail.
-
-
-
-
-
-
+
+
+
+ Creating a dynamic semaphore with the same name,
+ must fail.
+
+
+
+
+
+
-
-
-
-
- Retrieving the dynamic semaphore by name, must exist, then increasing the reference counter, finally releasing both references.
-
-
-
-
-
-
+
+
+
+ Retrieving the dynamic semaphore by name, must
+ exist, then increasing the reference counter, finally
+ releasing both references.
+
+
+
+
+
+ element.refs == 2, "references mismatch");
chFactoryReleaseSemaphore(dsp1);
test_assert(dsp->element.refs == 1, "references mismatch");]]>
-
-
-
-
- Releasing the first reference to the dynamic semaphore must not trigger an assertion.
-
-
-
-
-
-
-
-
-
-
- Retrieving the dynamic semaphore by name again, must not exist.
-
-
-
-
-
-
+
+
+
+ Releasing the first reference to the dynamic
+ semaphore must not trigger an assertion.
+
+
+
+
+
+
+
+
+
+
+ Retrieving the dynamic semaphore by name again,
+ must not exist.
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+
+
+
+
+ Retrieving a dynamic mailbox by name, must not
+ exist.
+
+
+
+
+
+
-
-
-
-
- Creating a dynamic mailbox it must not exists, must succeed.
-
-
-
-
-
-
+
+
+
+ Creating a dynamic mailbox it must not exists,
+ must succeed.
+
+
+
+
+
+
-
-
-
-
- Creating a dynamic mailbox with the same name, must fail.
-
-
-
-
-
-
+
+
+
+ Creating a dynamic mailbox with the same name,
+ must fail.
+
+
+
+
+
+
-
-
-
-
- Retrieving the dynamic mailbox by name, must exist, then increasing the reference counter, finally releasing both references.
-
-
-
-
-
-
+
+
+
+ Retrieving the dynamic mailbox by name, must
+ exist, then increasing the reference counter, finally
+ releasing both references.
+
+
+
+
+
+ element.refs == 2, "references mismatch");
chFactoryReleaseMailbox(dmp1);
test_assert(dmp->element.refs == 1, "references mismatch");]]>
-
-
-
-
- Releasing the first reference to the dynamic mailbox must not trigger an assertion.
-
-
-
-
-
-
-
-
-
-
- Retrieving the dynamic mailbox by name again, must not exist.
-
-
-
-
-
-
+
+
+
+ Releasing the first reference to the dynamic
+ mailbox must not trigger an assertion.
+
+
+
+
+
+
+
+
+
+
+ Retrieving the dynamic mailbox by name again,
+ must not exist.
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+
+
+
+
+ Retrieving a dynamic objects FIFO by name, must
+ not exist.
+
+
+
+
+
+
-
-
-
-
- Creating a dynamic objects FIFO it must not exists, must succeed.
-
-
-
-
-
-
+
+
+
+ Creating a dynamic objects FIFO it must not
+ exists, must succeed.
+
+
+
+
+
+
-
-
-
-
- Creating a dynamic objects FIFO with the same name, must fail.
-
-
-
-
-
-
+
+
+
+ Creating a dynamic objects FIFO with the same
+ name, must fail.
+
+
+
+
+
+
-
-
-
-
- Retrieving the dynamic objects FIFO by name, must exist, then increasing the reference counter, finally releasing both references.
-
-
-
-
-
-
+
+
+
+ Retrieving the dynamic objects FIFO by name, must
+ exist, then increasing the reference counter, finally
+ releasing both references.
+
+
+
+
+
+ element.refs == 2, "references mismatch");
chFactoryReleaseObjectsFIFO(dofp1);
test_assert(dofp->element.refs == 1, "references mismatch");]]>
-
-
-
-
- Releasing the first reference to the dynamic objects FIFO must not trigger an assertion.
-
-
-
-
-
-
-
-
-
-
- Retrieving the dynamic objects FIFO by name again, must not exist.
-
-
-
-
-
-
+
+
+
+ Releasing the first reference to the dynamic
+ objects FIFO must not trigger an assertion.
+
+
+
+
+
+
+
+
+
+
+ Retrieving the dynamic objects FIFO by name
+ again, must not exist.
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+
+
+
+
+ Retrieving a dynamic pipe by name, must not
+ exist.
+
+
+
+
+
+
-
-
-
-
- Creating a dynamic pipe it must not exists, must succeed.
-
-
-
-
-
-
+
+
+
+ Creating a dynamic pipe it must not exists, must
+ succeed.
+
+
+
+
+
+
-
-
-
-
- Creating a dynamic pipe with the same name, must fail.
-
-
-
-
-
-
+
+
+
+ Creating a dynamic pipe with the same name, must
+ fail.
+
+
+
+
+
+
-
-
-
-
- Retrieving the dynamic pipe by name, must exist, then increasing the reference counter, finally releasing both references.
-
-
-
-
-
-
+
+
+
+ Retrieving the dynamic pipe by name, must exist,
+ then increasing the reference counter, finally
+ releasing both references.
+
+
+
+
+
+ element.refs == 2, "references mismatch");
chFactoryReleasePipe(dpp1);
test_assert(dpp->element.refs == 1, "references mismatch");]]>
-
-
-
-
- Releasing the first reference to the dynamic pipe must not trigger an assertion.
-
-
-
-
-
-
-
-
-
-
- Retrieving the dynamic pipe by name again, must not exist.
-
-
-
-
-
-
+
+
+
+ Releasing the first reference to the dynamic pipe
+ must not trigger an assertion.
+
+
+
+
+
+
+
+
+
+
+ Retrieving the dynamic pipe by name again, must
+ not exist.
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+ Prints the version string.
+
+
+
+
+
+
-
-
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
+
+ System integrity functionality.
+
+
+ The system self-test functionality is invoked in
+ order to make an initial system state assessment and for
+ coverage.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Testing Ready List integrity.
+
+
+
+
+
+
-
-
-
-
- Testing Virtual Timers List integrity.
-
-
-
-
-
-
+
+
+
+ Testing Virtual Timers List integrity.
+
+
+
+
+
+
-
-
-
-
- Testing Registry List integrity.
-
-
-
-
-
-
+
+
+
+ Testing Registry List integrity.
+
+
+
+
+
+
-
-
-
-
- Testing Port-defined integrity.
-
-
-
-
-
-
+
+
+
+ Testing Port-defined integrity.
+
+
+
+
+
+
-
-
-
-
-
-
- Critical zones functionality.
-
-
- The critical zones API is invoked for coverage.
-
-
-
-
-
-
-
-
-
-
-
-
-
+
-
+
+
+
+
+ Testing chSysGetStatusAndLockX() and
+ chSysRestoreStatusX(), non reentrant case.
+
+
+
+
+
+
-
-
-
-
- Testing chSysGetStatusAndLockX() and chSysRestoreStatusX(), reentrant case.
-
-
-
-
-
-
+
+
+
+ Testing chSysGetStatusAndLockX() and
+ chSysRestoreStatusX(), reentrant case.
+
+
+
+
+
+
-
-
-
-
- Testing chSysUnconditionalLock().
-
-
-
-
-
-
+
+
+
+ Testing chSysUnconditionalLock().
+
+
+
+
+
+
-
-
-
-
- Testing chSysUnconditionalUnlock().
-
-
-
-
-
-
+
+
+
+ Testing chSysUnconditionalUnlock().
+
+
+
+
+
+
-
-
-
-
- Testing from ISR context using a virtual timer.
-
-
-
-
-
-
+
+
+
+ Testing from ISR context using a virtual timer.
+
+
+
+
+
+
+
-
-
-
-
-
+
+
-
-
-
+
+
+
+
+
+
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
+
+
+
+
+
+
-
-
-
+
+
+
+ Thread Sleep functionality.
+
+
+ The functionality of @p chThdSleep() and derivatives
+ is tested.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ The current system time is read then a sleep is
+ performed for 100 system ticks and on exit the system
+ time is verified again.
+
+
+
+
+
+
-
-
-
-
- The current system time is read then a sleep is performed for 100000 microseconds and on exit the system time is verified again.
-
-
-
-
-
-
+
+
+
+ The current system time is read then a sleep is
+ performed for 100000 microseconds and on exit the
+ system time is verified again.
+
+
+
+
+
+
-
-
-
-
- The current system time is read then a sleep is performed for 100 milliseconds and on exit the system time is verified again.
-
-
-
-
-
-
+
+
+
+ The current system time is read then a sleep is
+ performed for 100 milliseconds and on exit the system
+ time is verified again.
+
+
+
+
+
+
-
-
-
-
- The current system time is read then a sleep is performed for 1 second and on exit the system time is verified again.
-
-
-
-
-
-
+
+
+
+ The current system time is read then a sleep is
+ performed for 1 second and on exit the system time is
+ verified again.
+
+
+
+
+
+
-
-
-
-
- Function chThdSleepUntil() is tested with a timeline of "now" + 100 ticks.
-
-
-
-
-
-
+
+
+
+ Function chThdSleepUntil() is tested with a
+ timeline of "now" + 100 ticks.
+
+
+
+
+
+
-
-
-
-
-
-
- Ready List functionality, threads priority order.
-
-
- Five threads, are enqueued in the ready list and atomically executed. The test expects the threads to perform their operations in correct priority order regardless of the initial order.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Creating 5 threads with increasing priority, execution sequence is tested.
-
-
-
-
-
-
+
+
+
+
+
+ Ready List functionality, threads priority order.
+
+
+
+ Five threads, are enqueued in the ready list and
+ atomically executed. The test expects the threads to
+ perform their operations in correct priority order
+ regardless of the initial order.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Creating 5 threads with increasing priority,
+ execution sequence is tested.
+
+
+
+
+
+
-
-
-
-
- Creating 5 threads with decreasing priority, execution sequence is tested.
-
-
-
-
-
-
+
+
+
+ Creating 5 threads with decreasing priority,
+ execution sequence is tested.
+
+
+
+
+
+
-
-
-
-
- Creating 5 threads with pseudo-random priority, execution sequence is tested.
-
-
-
-
-
-
+
+
+
+ Creating 5 threads with pseudo-random priority,
+ execution sequence is tested.
+
+
+
+
+
+
-
-
-
-
-
-
- Priority change test.
-
-
- A series of priority changes are performed on the current thread in order to verify that the priority change happens as expected.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Thread priority is increased by one then a check is performed.
-
-
-
-
-
-
+
+
+
+
+
+ Priority change test.
+
+
+ A series of priority changes are performed on the
+ current thread in order to verify that the priority change
+ happens as expected.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Thread priority is increased by one then a check
+ is performed.
+
+
+
+
+
+
-
-
-
-
- Thread priority is returned to the previous value then a check is performed.
-
-
-
-
-
-
+
+
+
+ Thread priority is returned to the previous value
+ then a check is performed.
+
+
+
+
+
+
-
-
-
-
-
-
- Priority change test with Priority Inheritance.
-
-
- A series of priority changes are performed on the current thread in order to verify that the priority change happens as expected.
-
-
- CH_CFG_USE_MUTEXES
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Simulating a priority boost situation (prio > realprio).
-
-
-
-
-
-
+
+
+
+
+
+ Priority change test with Priority Inheritance.
+
+
+
+ A series of priority changes are performed on the
+ current thread in order to verify that the priority change
+ happens as expected.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Simulating a priority boost situation (prio >
+ realprio).
+
+
+
+
+
+ hdr.pqueue.prio += 2;
test_assert(chThdGetPriorityX() == prio + 2, "unexpected priority level");]]>
-
-
-
-
- Raising thread priority above original priority but below the boosted level.
-
-
-
-
-
-
+
+
+
+ Raising thread priority above original priority
+ but below the boosted level.
+
+
+
+
+
+ hdr.pqueue.prio == prio + 2, "unexpected priority level");
test_assert(chThdGetSelfX()->realprio == prio + 1, "unexpected returned real priority level");]]>
-
-
-
-
- Raising thread priority above the boosted level.
-
-
-
-
-
-
+
+
+
+ Raising thread priority above the boosted level.
+
+
+
+
+
+
+ hdr.pqueue.prio == prio + 3, "unexpected priority level");
test_assert(chThdGetSelfX()->realprio == prio + 3, "unexpected real priority level");]]>
-
-
-
-
- Restoring original conditions.
-
-
-
-
-
-
+
+
+
+ Restoring original conditions.
+
+
+
+
+
+ hdr.pqueue.prio = prio;
chThdGetSelfX()->realprio = prio;
chSysUnlock();]]>
-
-
-
-
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
+
+ Semaphore primitives, no state change.
+
+
+ Wait, Signal and Reset primitives are tested. The
+ testing thread does not trigger a state change.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ The function chSemWait() is invoked, after return
+ the counter and the returned message are tested.
+
+
+
+
+
+
+
-
-
-
-
- The function chSemSignal() is invoked, after return the counter is tested.
-
-
-
-
-
-
+
+
+
+ The function chSemSignal() is invoked, after
+ return the counter is tested.
+
+
+
+
+
+
-
-
-
-
- The function chSemReset() is invoked, after return the counter is tested.
-
-
-
-
-
-
+
+
+
+ The function chSemReset() is invoked, after
+ return the counter is tested.
+
+
+
+
+
+
-
-
-
-
-
-
- Semaphore enqueuing test.
-
-
- Five threads with randomized priorities are enqueued to a semaphore then awakened one at time. The test expects that the threads reach their goal in FIFO order or priority order depending on the @p CH_CFG_USE_SEMAPHORES_PRIORITY configuration setting.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Five threads are created with mixed priority levels (not increasing nor decreasing). Threads enqueue on a semaphore initialized to zero.
-
-
-
-
-
-
+
+
+
+
+
+ Semaphore enqueuing test.
+
+
+ Five threads with randomized priorities are enqueued
+ to a semaphore then awakened one at time. The test expects
+ that the threads reach their goal in FIFO order or
+ priority order depending on the @p
+ CH_CFG_USE_SEMAPHORES_PRIORITY configuration setting.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Five threads are created with mixed priority
+ levels (not increasing nor decreasing). Threads
+ enqueue on a semaphore initialized to zero.
+
+
+
+
+
+
-
-
-
-
- The semaphore is signaled 5 times. The thread activation sequence is tested.
-
-
-
-
-
-
+
+
+
+ The semaphore is signaled 5 times. The thread
+ activation sequence is tested.
+
+
+
+
+
+
-
-
-
-
-
-
- Semaphore timeout test.
-
-
- The three possible semaphore waiting modes (do not wait, wait with timeout, wait without timeout) are explored. The test expects that the semaphore wait function returns the correct value in each of the above scenario and that the semaphore structure status is correct after each operation.
-
-
-
-
-
-
-
-
-
-
-
-
-
+
-
+
+
+
+
+ Testing special case TIME_IMMEDIATE.
+
+
+
+
+
+
-
-
-
-
- Testing non-timeout condition.
-
-
-
-
-
-
+
+
+
+ Testing non-timeout condition.
+
+
+
+
+
+
-
-
-
-
- Testing timeout condition.
-
-
-
-
-
-
+
+
+
+ Testing timeout condition.
+
+
+
+
+
+
-
-
-
-
-
-
-
-
+
+
+
+
+
-
-
-
-
-
-
+
+
+
+
+
-
-
-
+
+
-
-
-
+
+
+
+
+ Creating a binary semaphore in "taken" state, the
+ state is checked.
+
+
+
+
+
+
-
-
-
-
- Resetting the binary semaphore in "taken" state, the state must not change.
-
-
-
-
-
-
+
+
+
+ Resetting the binary semaphore in "taken" state,
+ the state must not change.
+
+
+
+
+
+
-
-
-
-
- Starting a signaler thread at a lower priority.
-
-
-
-
-
-
+
+
+
+ Starting a signaler thread at a lower priority.
+
+
+
+
+
+
+
-
-
-
-
- Waiting for the binary semaphore to be signaled, the semaphore is expected to be taken.
-
-
-
-
-
-
+
+
+
+ Waiting for the binary semaphore to be signaled,
+ the semaphore is expected to be taken.
+
+
+
+
+
+
-
-
-
-
- Signaling the binary semaphore, checking the binary semaphore state to be "not taken" and the underlying counter semaphore counter to be one.
-
-
-
-
-
-
+
+
+
+ Signaling the binary semaphore, checking the
+ binary semaphore state to be "not taken" and the
+ underlying counter semaphore counter to be one.
+
+
+
+
+
+
+
-
-
-
-
- Signaling the binary semaphore again, the internal state must not change from "not taken".
-
-
-
-
-
-
+
+
+
+ Signaling the binary semaphore again, the
+ internal state must not change from "not taken".
+
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+ Priority enqueuing test.
+
+
+ Five threads, with increasing priority, are enqueued
+ on a locked mutex then the mutex is unlocked. The test
+ expects the threads to perform their operations in
+ increasing priority order regardless of the initial order.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Getting the initial priority.
+
+
+
+
+
+
+
+
+
+
+ Locking the mutex.
+
+
+
+
+
+
+
+
+
+
+ Five threads are created that try to lock and
+ unlock the mutex then terminate. The threads are
+ created in ascending priority order.
+
+
+
+
+
+
-
-
-
-
- Unlocking the mutex, the threads will wakeup in priority order because the mutext queue is an ordered one.
-
-
-
-
-
-
+
+
+
+ Unlocking the mutex, the threads will wakeup in
+ priority order because the mutext queue is an ordered
+ one.
+
+
+
+
+
+
-
-
-
-
-
-
- Priority inheritance, simple case.
-
-
- Three threads are involved in the classic priority inversion scenario, a medium priority thread tries to starve an high priority thread by blocking a low priority thread into a mutex lock zone. The test expects the threads to reach their goal in increasing priority order by rearranging their priorities in order to avoid the priority inversion trap.
-
-
- CH_DBG_THREADS_PROFILING
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Getting the system time for test duration measurement.
-
-
-
-
-
-
-
-
-
-
- The three contenders threads are created and let run atomically, the goals sequence is tested, the threads must complete in priority order.
-
-
-
-
-
-
+
+
+
+
+
+ Priority inheritance, simple case.
+
+
+ Three threads are involved in the classic priority
+ inversion scenario, a medium priority thread tries to
+ starve an high priority thread by blocking a low priority
+ thread into a mutex lock zone. The test expects the
+ threads to reach their goal in increasing priority order
+ by rearranging their priorities in order to avoid the
+ priority inversion trap.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Getting the system time for test duration
+ measurement.
+
+
+
+
+
+
+
+
+
+
+ The three contenders threads are created and let
+ run atomically, the goals sequence is tested, the
+ threads must complete in priority order.
+
+
+
+
+
+
-
-
-
-
- Testing that all threads completed within the specified time windows (100mS...100mS+ALLOWED_DELAY).
-
-
-
-
-
-
+
+
+
+ Testing that all threads completed within the
+ specified time windows (100mS...100mS+ALLOWED_DELAY).
+
+
+
+
+
+
+
-
-
-
-
-
-
- Priority inheritance, complex case.
-
-
- Five threads are involved in the complex priority inversion scenario, the priority inheritance algorithm is tested for depths greater than one. The test expects the threads to perform their operations in increasing priority order by rearranging their priorities in order to avoid the priority inversion trap.
-
-
- CH_DBG_THREADS_PROFILING
-
-
-
-
+
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+ Getting the system time for test duration
+ measurement.
+
+
+
+
+
+
+
+
+
+
+ The five contenders threads are created and let
+ run atomically, the goals sequence is tested, the
+ threads must complete in priority order.
+
+
+
+
+
+
-
-
-
-
- Testing that all threads completed within the specified time windows (110mS...110mS+ALLOWED_DELAY).
-
-
-
-
-
-
+
+
+
+ Testing that all threads completed within the
+ specified time windows (110mS...110mS+ALLOWED_DELAY).
+
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+ Getting current thread priority P(0) and
+ assigning to the threads A and B priorities +1 and +2.
+
+
+
+
+
+
+
-
-
-
-
- Spawning threads A and B at priorities P(A) and P(B).
-
-
-
-
-
-
+
+
+
+ Spawning threads A and B at priorities P(A) and
+ P(B).
+
+
+
+
+
+
-
-
-
-
- Locking the mutex M1 before thread A has a chance to lock it. The priority must not change because A has not yet reached chMtxLock(M1). the mutex is not locked.
-
-
-
-
-
-
+
+
+
+ Locking the mutex M1 before thread A has a chance
+ to lock it. The priority must not change because A has
+ not yet reached chMtxLock(M1). the mutex is not
+ locked.
+
+
+
+
+
+
-
-
-
-
- Waiting 100mS, this makes thread A reach chMtxLock(M1) and get the mutex. This must boost the priority of the current thread at the same level of thread A.
-
-
-
-
-
-
+
+
+
+ Waiting 100mS, this makes thread A reach
+ chMtxLock(M1) and get the mutex. This must boost the
+ priority of the current thread at the same level of
+ thread A.
+
+
+
+
+
+
-
-
-
-
- Locking the mutex M2 before thread B has a chance to lock it. The priority must not change because B has not yet reached chMtxLock(M2). the mutex is not locked.
-
-
-
-
-
-
+
+
+
+ Locking the mutex M2 before thread B has a chance
+ to lock it. The priority must not change because B has
+ not yet reached chMtxLock(M2). the mutex is not
+ locked.
+
+
+
+
+
+
-
-
-
-
- Waiting 100mS, this makes thread B reach chMtxLock(M2) and get the mutex. This must boost the priority of the current thread at the same level of thread B.
-
-
-
-
-
-
+
+
+
+ Waiting 100mS, this makes thread B reach
+ chMtxLock(M2) and get the mutex. This must boost the
+ priority of the current thread at the same level of
+ thread B.
+
+
+
+
+
+
-
-
-
-
- Unlocking M2, the priority should fall back to P(A).
-
-
-
-
-
-
+
+
+
+ Unlocking M2, the priority should fall back to
+ P(A).
+
+
+
+
+
+
-
-
-
-
- Unlocking M1, the priority should fall back to P(0).
-
-
-
-
-
-
+
+
+
+ Unlocking M1, the priority should fall back to
+ P(0).
+
+
+
+
+
+
-
-
-
-
-
-
-
-
+
+
+
+
+ Getting current thread priority for later checks.
+
+
+
+
+
+
+
+
+
+
+
+ Locking the mutex first time, it must be possible
+ because it is not owned.
+
+
+
+
+
+
-
-
-
-
- Locking the mutex second time, it must fail because it is already owned.
-
-
-
-
-
-
+
+
+
+ Locking the mutex second time, it must fail
+ because it is already owned.
+
+
+
+
+
+
-
-
-
-
- Unlocking the mutex then it must not be owned anymore and the queue must be empty.
-
-
-
-
-
-
+
+
+
+ Unlocking the mutex then it must not be owned
+ anymore and the queue must be empty.
+
+
+
+
+
+
-
-
-
-
- Testing that priority has not changed after operations.
-
-
-
-
-
-
-
-
-
-
- Testing chMtxUnlockAll() behavior.
-
-
-
-
-
-
+
+
+
+ Testing that priority has not changed after
+ operations.
+
+
+
+
+
+
+
+
+
+
+ Testing chMtxUnlockAll() behavior.
+
+
+
+
+
+
-
-
-
-
- Testing that priority has not changed after operations.
-
-
-
-
-
-
-
-
-
-
+
+
+
-
-
-
-
+
+
+
+
+ Getting current thread priority for later checks.
+
+
+
+
+
+
+
+
+
+
+
+ Locking the mutex first time, it must be possible
+ because it is not owned.
+
+
+
+
+
+
-
-
-
-
- Locking the mutex second time, it must be possible because it is recursive.
-
-
-
-
-
-
+
+
+
+ Locking the mutex second time, it must be
+ possible because it is recursive.
+
+
+
+
+
+
-
-
-
-
- Unlocking the mutex then it must be still owned because recursivity.
-
-
-
-
-
-
+
+
+
+ Unlocking the mutex then it must be still owned
+ because recursivity.
+
+
+
+
+
+
-
-
-
-
- Unlocking the mutex then it must not be owned anymore and the queue must be empty.
-
-
-
-
-
-
+
+
+
+ Unlocking the mutex then it must not be owned
+ anymore and the queue must be empty.
+
+
+
+
+
+
-
-
-
-
- Testing that priority has not changed after operations.
-
-
-
-
-
-
-
-
-
-
- Testing consecutive chMtxTryLock()/chMtxTryLockS() calls and a final chMtxUnlockAllS().
-
-
-
-
-
-
+
+
+
+ Testing that priority has not changed after
+ operations.
+
+
+
+
+
+
+
+
+
+
+ Testing consecutive
+ chMtxTryLock()/chMtxTryLockS() calls and a final
+ chMtxUnlockAllS().
+
+
+
+
+
+
-
-
-
-
- Testing consecutive chMtxLock()/chMtxLockS() calls and a final chMtxUnlockAll().
-
-
-
-
-
-
+
+
+
+ Testing consecutive chMtxLock()/chMtxLockS()
+ calls and a final chMtxUnlockAll().
+
+
+
+
+
+
-
-
-
-
- Testing that priority has not changed after operations.
-
-
-
-
-
-
-
-
-
-
+
+
+
-
+
+
+
+
+
+
+
+
+
+
+ Starting the five threads with increasing
+ priority, the threads will queue on the condition
+ variable.
+
+
+
+
+
+
-
-
-
-
- Atomically signaling the condition variable five times then waiting for the threads to terminate in priority order, the order is tested.
-
-
-
-
-
-
+
+
+
+ Atomically signaling the condition variable five
+ times then waiting for the threads to terminate in
+ priority order, the order is tested.
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+ Starting the five threads with increasing
+ priority, the threads will queue on the condition
+ variable.
+
+
+
+
+
+
-
-
-
-
- Broarcasting on the condition variable then waiting for the threads to terminate in priority order, the order is tested.
-
-
-
-
-
-
+
+
+
+ Broarcasting on the condition variable then
+ waiting for the threads to terminate in priority
+ order, the order is tested.
+
+
+
+
+
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+ Reading current base priority.
+
+
+
+
+
+
+
+
+
+
+ Thread A is created at priority P(+1), it locks
+ M2, locks M1 and goes to wait on C1.
+
+
+
+
+
+
+
+
+
+
+ Thread C is created at priority P(+2), it
+ enqueues on M1 and boosts TA priority at P(+2).
+
+
+
+
+
+
+
+
+
+
+
+ Thread B is created at priority P(+3), it
+ enqueues on M2 and boosts TA priority at P(+3).
+
+
+
+
+
+
+
+
+
+
+
+ Signaling C1: TA wakes up, unlocks M1 and
+ priority goes to P(+2). TB locks M1, unlocks M1 and
+ completes. TA unlocks M2 and priority goes to P(+1).
+ TC waits on C1. TA completes.
+
+
+
+
+
+
+
+
+
+
+ Signaling C1: TC wakes up, unlocks M1 and
+ completes.
+
+
+
+
+
+
+
+
+
+
+ Checking the order of operations.
+
+
+
+
+
+
-
-
-
-
-
+
+
-
-
-
+
+
-
-
-
-
-
-
+
+
+
+ Events registration.
+
+
+ Two event listeners are registered on an event source
+ and then unregistered in the same order.<br>
+ The test expects that the even source has listeners after
+ the registrations and after the first unregistration,
+ then, after the second unegistration, the test expects no
+ more listeners.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ An Event Source is initialized.
+
+
+
+
+
+
+
+
+
+
+ Two Event Listeners are registered on the Event
+ Source, the Event Source is tested to have listeners.
+
+
+
+
+
+
+
-
-
-
-
- An Event Listener is unregistered, the Event Source must still have listeners.
-
-
-
-
-
-
+
+
+
+ An Event Listener is unregistered, the Event
+ Source must still have listeners.
+
+
+
+
+
+
-
-
-
-
- An Event Listener is unregistered, the Event Source must not have listeners.
-
-
-
-
-
-
+
+
+
+ An Event Listener is unregistered, the Event
+ Source must not have listeners.
+
+
+
+
+
+
-
-
-
-
-
-
- Event Flags dispatching.
-
-
- The test dispatches three event flags and verifies that the associated event handlers are invoked in LSb-first order.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Three evenf flag bits are raised then chEvtDispatch() is invoked, the sequence of handlers calls is tested.
-
-
-
-
-
-
+
+
+
+
+
+ Event Flags dispatching.
+
+
+ The test dispatches three event flags and verifies
+ that the associated event handlers are invoked in
+ LSb-first order.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Three evenf flag bits are raised then
+ chEvtDispatch() is invoked, the sequence of handlers
+ calls is tested.
+
+
+
+
+
+
-
-
-
-
-
-
- Events Flags wait using chEvtWaitOne().
-
-
- Functionality of chEvtWaitOne() is tested under various scenarios.
-
-
-
-
-
-
-
-
-
-
-
-
-
+
-
-
-
-
+
+
+
+
+ Setting three event flags.
+
+
+
+
+
+
+
+
+
+
+ Calling chEvtWaitOne() three times, each time a
+ single flag must be returned in order of priority.
+
+
+
+
+
+
+
-
-
-
-
- Getting current time and starting a signaler thread, the thread will set an event flag after 50mS.
-
-
-
-
-
-
+
+
+
+ Getting current time and starting a signaler
+ thread, the thread will set an event flag after 50mS.
+
+
+
+
+
+
+
-
-
-
-
- Calling chEvtWaitOne() then verifying that the event has been received after 50mS and that the event flags mask has been emptied.
-
-
-
-
-
-
+
+
+
+ Calling chEvtWaitOne() then verifying that the
+ event has been received after 50mS and that the event
+ flags mask has been emptied.
+
+
+
+
+
+
-
-
-
-
-
-
-
-
+
+
+
+
+ Setting two, non contiguous, event flags.
+
+
+
+
+
+
+
+
+
+
+ Calling chEvtWaitAny() one time, the two flags
+ must be returned.
+
+
+
+
+
+
-
-
-
-
- Getting current time and starting a signaler thread, the thread will set an event flag after 50mS.
-
-
-
-
-
-
+
+
+
+ Getting current time and starting a signaler
+ thread, the thread will set an event flag after 50mS.
+
+
+
+
+
+
+
-
-
-
-
- Calling chEvtWaitAny() then verifying that the event has been received after 50mS and that the event flags mask has been emptied.
-
-
-
-
-
-
+
+
+
+ Calling chEvtWaitAny() then verifying that the
+ event has been received after 50mS and that the event
+ flags mask has been emptied.
+
+
+
+
+
+
-
-
-
-
-
-
-
-
+
+
+
+
+ Setting two, non contiguous, event flags.
+
+
+
+
+
+
+
+
+
+
+ Calling chEvtWaitAll() one time, the two flags
+ must be returned.
+
+
+
+
+
+
-
-
-
-
- Setting one event flag.
-
-
-
-
-
-
-
-
-
-
- Getting current time and starting a signaler thread, the thread will set another event flag after 50mS.
-
-
-
-
-
-
+
+
+
+ Setting one event flag.
+
+
+
+
+
+
+
+
+
+
+ Getting current time and starting a signaler
+ thread, the thread will set another event flag after
+ 50mS.
+
+
+
+
+
+
-
-
-
-
- Calling chEvtWaitAll() then verifying that both event flags have been received after 50mS and that the event flags mask has been emptied.
-
-
-
-
-
-
+
+
+
+ Calling chEvtWaitAll() then verifying that both
+ event flags have been received after 50mS and that the
+ event flags mask has been emptied.
+
+
+
+
+
+
-
-
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
+
+
+ Registering on two event sources associating them
+ with flags 1 and 4.
+
+
+
+
+
+
-
-
-
-
- Getting current time and starting a broadcaster thread, the thread broadcast the first Event Source immediately and the other after 50mS.
-
-
-
-
-
-
+
+
+
+ Getting current time and starting a broadcaster
+ thread, the thread broadcast the first Event Source
+ immediately and the other after 50mS.
+
+
+
+
+
+
-
-
-
-
- Calling chEvtWaitAll() then verifying that both event flags have been received after 50mS and that the event flags mask has been emptied.
-
-
-
-
-
-
+
+
+
+ Calling chEvtWaitAll() then verifying that both
+ event flags have been received after 50mS and that the
+ event flags mask has been emptied.
+
+
+
+
+
+
-
-
-
-
- Unregistering from the Event Sources.
-
-
-
-
-
-
+
+
+
+ Unregistering from the Event Sources.
+
+
+
+
+
+
-
-
-
-
-
-
-
-
+
+
+
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+ > 1U) + 1U,
"dyn3",
prio-3, dyn_thread1, "C");
test_assert(threads[2] == NULL, "thread creation not failed");]]>
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
+
+
+ Adding four working areas to the pool.
+
+
+
+
+
+
-
-
-
-
- Getting base priority for threads.
-
-
-
-
-
-
-
-
-
-
- Creating the five threads.
-
-
-
-
-
-
+
+
+
+ Getting base priority for threads.
+
+
+
+
+
+
+
+
+
+
+ Creating the five threads.
+
+
+
+
+
+
-
-
-
-
- Testing that only the fifth thread creation failed.
-
-
-
-
-
-
+
+
+
+ Testing that only the fifth thread creation
+ failed.
+
+
+
+
+
+
-
-
-
-
- Letting them run, free the memory then checking the execution sequence.
-
-
-
-
-
-
+
+
+
+ Letting them run, free the memory then checking
+ the execution sequence.
+
+
+
+
+
+
-
-
-
-
- Testing that the pool contains four elements again.
-
-
-
-
-
-
+
+
+
+ Testing that the pool contains four elements
+ again.
+
+
+
+
+
+
-
-
-
-
-
-
-
-
+
+
+
+ Messages performance #1.
+
+
+ A message server thread is created with a lower
+ priority than the client thread, the messages throughput
+ per second is measured and the result printed on the
+ output log.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ The messenger thread is started at a lower
+ priority than the current thread.
+
+
+
+
+
+
+
+
+
+
+ The number of messages exchanged is counted in a
+ one second time window.
+
+
+
+
+
+
-
-
-
-
- Score is printed.
-
-
-
-
-
-
+
+
+
+ Score is printed.
+
+
+
+
+
+
-
-
-
-
-
-
- Messages performance #2.
-
-
- A message server thread is created with an higher priority than the client thread, the messages throughput per second is measured and the result printed on the output log.
-
-
- CH_CFG_USE_MESSAGES
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- The messenger thread is started at an higher priority than the current thread.
-
-
-
-
-
-
-
-
-
-
- The number of messages exchanged is counted in a one second time window.
-
-
-
-
-
-
+
+
+
+
+
+ Messages performance #2.
+
+
+ A message server thread is created with an higher
+ priority than the client thread, the messages throughput
+ per second is measured and the result printed on the
+ output log.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ The messenger thread is started at an higher
+ priority than the current thread.
+
+
+
+
+
+
+
+
+
+
+ The number of messages exchanged is counted in a
+ one second time window.
+
+
+
+
+
+
-
-
-
-
- Score is printed.
-
-
-
-
-
-
+
+
+
+ Score is printed.
+
+
+
+
+
+
-
-
-
-
-
-
- Messages performance #3.
-
-
- A message server thread is created with an higher priority than the client thread, four lower priority threads crowd the ready list, the messages throughput per second is measured while the ready list and the result printed on the output log.
-
-
- CH_CFG_USE_MESSAGES
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- The messenger thread is started at an higher priority than the current thread.
-
-
-
-
-
-
-
-
-
-
- Four threads are started at a lower priority than the current thread.
-
-
-
-
-
-
+
+
+
+
+
+ Messages performance #3.
+
+
+ A message server thread is created with an higher
+ priority than the client thread, four lower priority
+ threads crowd the ready list, the messages throughput per
+ second is measured while the ready list and the result
+ printed on the output log.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ The messenger thread is started at an higher
+ priority than the current thread.
+
+
+
+
+
+
+
+
+
+
+ Four threads are started at a lower priority than
+ the current thread.
+
+
+
+
+
+
-
-
-
-
- The number of messages exchanged is counted in a one second time window.
-
-
-
-
-
-
+
+
+
+ The number of messages exchanged is counted in a
+ one second time window.
+
+
+
+
+
+
-
-
-
-
- Score is printed.
-
-
-
-
-
-
+
+
+
+ Score is printed.
+
+
+
+
+
+
-
-
-
-
-
-
- Context Switch performance.
-
-
- 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.<br>
-The Context Switch performance is calculated by measuring the number of iterations after a second of continuous operations.
-
-
-
-
-
-
-
-
-
-
-
-
-
+
-
+
+
+
+
+ Starting the target thread at an higher priority
+ level.
+
+
+
+
+
+
-
-
-
-
- Waking up the thread as fast as possible in a one second time window.
-
-
-
-
-
-
+
+
+
+ Waking up the thread as fast as possible in a one
+ second time window.
+
+
+
+
+
+
-
-
-
-
- Stopping the target thread.
-
-
-
-
-
-
+
+
+
+ Stopping the target thread.
+
+
+
+
+
+
-
-
-
-
- Score is printed.
-
-
-
-
-
-
+
+
+
+ Score is printed.
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+
+ A thread is created at a lower priority level and
+ its termination detected using @p chThdWait(). The
+ operation is repeated continuously in a one-second
+ time window.
+
+
+
+
+
+
-
-
-
-
- Score is printed.
-
-
-
-
-
-
+
+
+
+ Score is printed.
+
+
+
+
+
+
-
-
-
-
-
+
+
+
+
+ A thread is created at an higher priority level
+ and let terminate immediately. The operation is
+ repeated continuously in a one-second time window.
+
+
+
+
+
+
+
-
-
-
-
- Score is printed.
-
-
-
-
-
-
+
+
+
+ Score is printed.
+
+
+
+
+
+
-
-
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
+
+
+ Two timers are set then reset without waiting for
+ their counter to elapse. The operation is repeated
+ continuously in a one-second time window.
+
+
+
+
+
+
-
-
-
-
- The score is printed.
-
-
-
-
-
-
+
+
+
+ The score is printed.
+
+
+
+
+
+
-
-
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-
-
+
+
-
-