From a6b4a3b07cb83f13dc83cbf2f0832f80b3dc2d5c Mon Sep 17 00:00:00 2001 From: Sebastian Huber Date: Thu, 9 Dec 2021 16:05:09 +0100 Subject: validation: Test semaphore operations The test source code is generated from specification items by the "./spec2modules.py" script contained in the git://git.rtems.org/rtems-central.git Git repository. Please read the "How-To" section in the "Software Requirements Engineering" chapter of the RTEMS Software Engineering manual to get more information about the process. Update #3716. --- testsuites/validation/tr-sem-seize-try.c | 323 +++++++++++++++++ testsuites/validation/tr-sem-seize-try.h | 97 +++++ testsuites/validation/tr-sem-seize-wait.c | 398 +++++++++++++++++++++ testsuites/validation/tr-sem-seize-wait.h | 103 ++++++ testsuites/validation/tr-sem-surrender.c | 570 ++++++++++++++++++++++++++++++ testsuites/validation/tr-sem-surrender.h | 118 +++++++ 6 files changed, 1609 insertions(+) create mode 100644 testsuites/validation/tr-sem-seize-try.c create mode 100644 testsuites/validation/tr-sem-seize-try.h create mode 100644 testsuites/validation/tr-sem-seize-wait.c create mode 100644 testsuites/validation/tr-sem-seize-wait.h create mode 100644 testsuites/validation/tr-sem-surrender.c create mode 100644 testsuites/validation/tr-sem-surrender.h (limited to 'testsuites/validation') diff --git a/testsuites/validation/tr-sem-seize-try.c b/testsuites/validation/tr-sem-seize-try.c new file mode 100644 index 0000000000..e723230288 --- /dev/null +++ b/testsuites/validation/tr-sem-seize-try.c @@ -0,0 +1,323 @@ +/* SPDX-License-Identifier: BSD-2-Clause */ + +/** + * @file + * + * @ingroup RTEMSTestCaseScoreSemReqSeizeTry + */ + +/* + * Copyright (C) 2021 embedded brains GmbH (http://www.embedded-brains.de) + * + * 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 OWNER 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. + */ + +/* + * This file is part of the RTEMS quality process and was automatically + * generated. If you find something that needs to be fixed or + * worded better please post a report or patch to an RTEMS mailing list + * or raise a bug report: + * + * https://www.rtems.org/bugs.html + * + * For information on updating and regenerating please refer to the How-To + * section in the Software Requirements Engineering chapter of the + * RTEMS Software Engineering manual. The manual is provided as a part of + * a release. For development sources please refer to the online + * documentation at: + * + * https://docs.rtems.org + */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "tr-sem-seize-try.h" + +#include + +/** + * @defgroup RTEMSTestCaseScoreSemReqSeizeTry spec:/score/sem/req/seize-try + * + * @ingroup RTEMSTestSuiteTestsuitesValidationNoClock0 + * + * @{ + */ + +typedef struct { + uint8_t Skip : 1; + uint8_t Pre_Count_NA : 1; + uint8_t Post_Status : 2; + uint8_t Post_Count : 2; +} ScoreSemReqSeizeTry_Entry; + +/** + * @brief Test context for spec:/score/sem/req/seize-try test case. + */ +typedef struct { + /** + * @brief This member specifies the semaphore count before the directive + * call. + */ + uint32_t count_before; + + /** + * @brief This member contains the return status of the directive call. + */ + Status_Control status; + + /** + * @brief This member contains the semaphore count after the directive call. + */ + uint32_t count_after; + + /** + * @brief This member contains a copy of the corresponding + * ScoreSemReqSeizeTry_Run() parameter. + */ + TQSemContext *tq_ctx; + + struct { + /** + * @brief This member defines the pre-condition states for the next action. + */ + size_t pcs[ 1 ]; + + /** + * @brief If this member is true, then the test action loop is executed. + */ + bool in_action_loop; + + /** + * @brief This member contains the next transition map index. + */ + size_t index; + + /** + * @brief This member contains the current transition map entry. + */ + ScoreSemReqSeizeTry_Entry entry; + + /** + * @brief If this member is true, then the current transition variant + * should be skipped. + */ + bool skip; + } Map; +} ScoreSemReqSeizeTry_Context; + +static ScoreSemReqSeizeTry_Context + ScoreSemReqSeizeTry_Instance; + +static const char * const ScoreSemReqSeizeTry_PreDesc_Count[] = { + "Zero", + "Positive", + "NA" +}; + +static const char * const * const ScoreSemReqSeizeTry_PreDesc[] = { + ScoreSemReqSeizeTry_PreDesc_Count, + NULL +}; + +typedef ScoreSemReqSeizeTry_Context Context; + +static Status_Control Status( const Context *ctx, Status_Control status ) +{ + return TQConvertStatus( &ctx->tq_ctx->base, status ); +} + +static void ScoreSemReqSeizeTry_Pre_Count_Prepare( + ScoreSemReqSeizeTry_Context *ctx, + ScoreSemReqSeizeTry_Pre_Count state +) +{ + switch ( state ) { + case ScoreSemReqSeizeTry_Pre_Count_Zero: { + /* + * While the count of the semaphore is zero. + */ + ctx->count_before = 0; + break; + } + + case ScoreSemReqSeizeTry_Pre_Count_Positive: { + /* + * While the count of the semaphore is greater than zero. + */ + ctx->count_before = 1; + break; + } + + case ScoreSemReqSeizeTry_Pre_Count_NA: + break; + } +} + +static void ScoreSemReqSeizeTry_Post_Status_Check( + ScoreSemReqSeizeTry_Context *ctx, + ScoreSemReqSeizeTry_Post_Status state +) +{ + switch ( state ) { + case ScoreSemReqSeizeTry_Post_Status_Ok: { + /* + * The return status of the directive call shall be derived from + * STATUS_SUCCESSFUL. + */ + T_eq_int( ctx->status, Status( ctx, STATUS_SUCCESSFUL ) ); + break; + } + + case ScoreSemReqSeizeTry_Post_Status_Unsat: { + /* + * The return status of the directive call shall be derived from + * STATUS_UNSATISFIED. + */ + T_eq_int( ctx->status, Status( ctx, STATUS_UNSATISFIED ) ); + break; + } + + case ScoreSemReqSeizeTry_Post_Status_NA: + break; + } +} + +static void ScoreSemReqSeizeTry_Post_Count_Check( + ScoreSemReqSeizeTry_Context *ctx, + ScoreSemReqSeizeTry_Post_Count state +) +{ + switch ( state ) { + case ScoreSemReqSeizeTry_Post_Count_Nop: { + /* + * The count of the semaphore shall not be modified. + */ + T_eq_u32( ctx->count_after, ctx->count_before ); + break; + } + + case ScoreSemReqSeizeTry_Post_Count_MinusOne: { + /* + * The count of the semaphore shall be decremented by one. + */ + T_eq_u32( ctx->count_after, ctx->count_before - 1 ); + break; + } + + case ScoreSemReqSeizeTry_Post_Count_NA: + break; + } +} + +static void ScoreSemReqSeizeTry_Action( ScoreSemReqSeizeTry_Context *ctx ) +{ + TQSemSetCount( ctx->tq_ctx, ctx->count_before ); + ctx->status = TQEnqueue( &ctx->tq_ctx->base, TQ_NO_WAIT ); + ctx->count_after = TQSemGetCount( ctx->tq_ctx ); +} + +static const ScoreSemReqSeizeTry_Entry +ScoreSemReqSeizeTry_Entries[] = { + { 0, 0, ScoreSemReqSeizeTry_Post_Status_Unsat, + ScoreSemReqSeizeTry_Post_Count_Nop }, + { 0, 0, ScoreSemReqSeizeTry_Post_Status_Ok, + ScoreSemReqSeizeTry_Post_Count_MinusOne } +}; + +static const uint8_t +ScoreSemReqSeizeTry_Map[] = { + 0, 1 +}; + +static size_t ScoreSemReqSeizeTry_Scope( void *arg, char *buf, size_t n ) +{ + ScoreSemReqSeizeTry_Context *ctx; + + ctx = arg; + + if ( ctx->Map.in_action_loop ) { + return T_get_scope( ScoreSemReqSeizeTry_PreDesc, buf, n, ctx->Map.pcs ); + } + + return 0; +} + +static T_fixture ScoreSemReqSeizeTry_Fixture = { + .setup = NULL, + .stop = NULL, + .teardown = NULL, + .scope = ScoreSemReqSeizeTry_Scope, + .initial_context = &ScoreSemReqSeizeTry_Instance +}; + +static inline ScoreSemReqSeizeTry_Entry ScoreSemReqSeizeTry_PopEntry( + ScoreSemReqSeizeTry_Context *ctx +) +{ + size_t index; + + index = ctx->Map.index; + ctx->Map.index = index + 1; + return ScoreSemReqSeizeTry_Entries[ + ScoreSemReqSeizeTry_Map[ index ] + ]; +} + +static void ScoreSemReqSeizeTry_TestVariant( ScoreSemReqSeizeTry_Context *ctx ) +{ + ScoreSemReqSeizeTry_Pre_Count_Prepare( ctx, ctx->Map.pcs[ 0 ] ); + ScoreSemReqSeizeTry_Action( ctx ); + ScoreSemReqSeizeTry_Post_Status_Check( ctx, ctx->Map.entry.Post_Status ); + ScoreSemReqSeizeTry_Post_Count_Check( ctx, ctx->Map.entry.Post_Count ); +} + +static T_fixture_node ScoreSemReqSeizeTry_Node; + +void ScoreSemReqSeizeTry_Run( TQSemContext *tq_ctx ) +{ + ScoreSemReqSeizeTry_Context *ctx; + + ctx = &ScoreSemReqSeizeTry_Instance; + ctx->tq_ctx = tq_ctx; + + ctx = T_push_fixture( + &ScoreSemReqSeizeTry_Node, + &ScoreSemReqSeizeTry_Fixture + ); + ctx->Map.in_action_loop = true; + ctx->Map.index = 0; + + for ( + ctx->Map.pcs[ 0 ] = ScoreSemReqSeizeTry_Pre_Count_Zero; + ctx->Map.pcs[ 0 ] < ScoreSemReqSeizeTry_Pre_Count_NA; + ++ctx->Map.pcs[ 0 ] + ) { + ctx->Map.entry = ScoreSemReqSeizeTry_PopEntry( ctx ); + ScoreSemReqSeizeTry_TestVariant( ctx ); + } + + T_pop_fixture(); +} + +/** @} */ diff --git a/testsuites/validation/tr-sem-seize-try.h b/testsuites/validation/tr-sem-seize-try.h new file mode 100644 index 0000000000..155bf59cf8 --- /dev/null +++ b/testsuites/validation/tr-sem-seize-try.h @@ -0,0 +1,97 @@ +/* SPDX-License-Identifier: BSD-2-Clause */ + +/** + * @file + * + * @ingroup RTEMSTestCaseScoreSemReqSeizeTry + */ + +/* + * Copyright (C) 2021 embedded brains GmbH (http://www.embedded-brains.de) + * + * 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 OWNER 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. + */ + +/* + * This file is part of the RTEMS quality process and was automatically + * generated. If you find something that needs to be fixed or + * worded better please post a report or patch to an RTEMS mailing list + * or raise a bug report: + * + * https://www.rtems.org/bugs.html + * + * For information on updating and regenerating please refer to the How-To + * section in the Software Requirements Engineering chapter of the + * RTEMS Software Engineering manual. The manual is provided as a part of + * a release. For development sources please refer to the online + * documentation at: + * + * https://docs.rtems.org + */ + +#ifndef _TR_SEM_SEIZE_TRY_H +#define _TR_SEM_SEIZE_TRY_H + +#include "tx-thread-queue.h" + +#ifdef __cplusplus +extern "C" { +#endif + +/** + * @addtogroup RTEMSTestCaseScoreSemReqSeizeTry + * + * @{ + */ + +typedef enum { + ScoreSemReqSeizeTry_Pre_Count_Zero, + ScoreSemReqSeizeTry_Pre_Count_Positive, + ScoreSemReqSeizeTry_Pre_Count_NA +} ScoreSemReqSeizeTry_Pre_Count; + +typedef enum { + ScoreSemReqSeizeTry_Post_Status_Ok, + ScoreSemReqSeizeTry_Post_Status_Unsat, + ScoreSemReqSeizeTry_Post_Status_NA +} ScoreSemReqSeizeTry_Post_Status; + +typedef enum { + ScoreSemReqSeizeTry_Post_Count_Nop, + ScoreSemReqSeizeTry_Post_Count_MinusOne, + ScoreSemReqSeizeTry_Post_Count_NA +} ScoreSemReqSeizeTry_Post_Count; + +/** + * @brief Runs the parameterized test case. + * + * @param[in,out] tq_ctx is the thread queue context. + */ +void ScoreSemReqSeizeTry_Run( TQSemContext *tq_ctx ); + +/** @} */ + +#ifdef __cplusplus +} +#endif + +#endif /* _TR_SEM_SEIZE_TRY_H */ diff --git a/testsuites/validation/tr-sem-seize-wait.c b/testsuites/validation/tr-sem-seize-wait.c new file mode 100644 index 0000000000..b4c4266103 --- /dev/null +++ b/testsuites/validation/tr-sem-seize-wait.c @@ -0,0 +1,398 @@ +/* SPDX-License-Identifier: BSD-2-Clause */ + +/** + * @file + * + * @ingroup RTEMSTestCaseScoreSemReqSeizeWait + */ + +/* + * Copyright (C) 2021 embedded brains GmbH (http://www.embedded-brains.de) + * + * 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 OWNER 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. + */ + +/* + * This file is part of the RTEMS quality process and was automatically + * generated. If you find something that needs to be fixed or + * worded better please post a report or patch to an RTEMS mailing list + * or raise a bug report: + * + * https://www.rtems.org/bugs.html + * + * For information on updating and regenerating please refer to the How-To + * section in the Software Requirements Engineering chapter of the + * RTEMS Software Engineering manual. The manual is provided as a part of + * a release. For development sources please refer to the online + * documentation at: + * + * https://docs.rtems.org + */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include + +#include "tr-sem-seize-wait.h" +#include "tr-tq-enqueue-fifo.h" +#include "tr-tq-enqueue-priority.h" + +#include + +/** + * @defgroup RTEMSTestCaseScoreSemReqSeizeWait spec:/score/sem/req/seize-wait + * + * @ingroup RTEMSTestSuiteTestsuitesValidationNoClock0 + * + * @{ + */ + +typedef struct { + uint8_t Skip : 1; + uint8_t Pre_Count_NA : 1; + uint8_t Post_Status : 2; + uint8_t Post_Count : 2; + uint8_t Post_Timer : 2; +} ScoreSemReqSeizeWait_Entry; + +/** + * @brief Test context for spec:/score/sem/req/seize-wait test case. + */ +typedef struct { + /** + * @brief This member contains a copy of the corresponding + * ScoreSemReqSeizeWait_Run() parameter. + */ + TQSemContext *tq_ctx; + + struct { + /** + * @brief This member defines the pre-condition states for the next action. + */ + size_t pcs[ 1 ]; + + /** + * @brief If this member is true, then the test action loop is executed. + */ + bool in_action_loop; + + /** + * @brief This member contains the next transition map index. + */ + size_t index; + + /** + * @brief This member contains the current transition map entry. + */ + ScoreSemReqSeizeWait_Entry entry; + + /** + * @brief If this member is true, then the current transition variant + * should be skipped. + */ + bool skip; + } Map; +} ScoreSemReqSeizeWait_Context; + +static ScoreSemReqSeizeWait_Context + ScoreSemReqSeizeWait_Instance; + +static const char * const ScoreSemReqSeizeWait_PreDesc_Count[] = { + "Zero", + "Positive", + "NA" +}; + +static const char * const * const ScoreSemReqSeizeWait_PreDesc[] = { + ScoreSemReqSeizeWait_PreDesc_Count, + NULL +}; + +typedef ScoreSemReqSeizeWait_Context Context; + +static Status_Control Status( const Context *ctx, Status_Control status ) +{ + return TQConvertStatus( &ctx->tq_ctx->base, status ); +} + +static void GetProperties( TQContext *base, TQWorkerKind enqueued_worker ) +{ + TQSemContext *ctx; + T_thread_timer_state timer_state; + + ctx = (TQSemContext *) base; + T_eq_u32( + ctx->base.worker_tcb[ enqueued_worker ]->current_state, + STATES_WAITING_FOR_SEMAPHORE + ); + + timer_state = T_get_thread_timer_state( + ctx->base.worker_id[ enqueued_worker ] + ); + + if ( base->wait == TQ_WAIT_TIMED ) { + T_eq_int( timer_state, T_THREAD_TIMER_SCHEDULED ); + } else { + T_eq_int( timer_state, T_THREAD_TIMER_INACTIVE ); + } + + T_eq_u32( TQSemGetCount( ctx ), 0 ); +} + +static void ScoreSemReqSeizeWait_Pre_Count_Prepare( + ScoreSemReqSeizeWait_Context *ctx, + ScoreSemReqSeizeWait_Pre_Count state +) +{ + switch ( state ) { + case ScoreSemReqSeizeWait_Pre_Count_Zero: { + /* + * While the count of the semaphore is zero. + */ + /* Done by TQEnqueuePrepareDefault() */ + break; + } + + case ScoreSemReqSeizeWait_Pre_Count_Positive: { + /* + * While the count of the semaphore is greater than zero. + */ + TQSemSetCount( ctx->tq_ctx, 1 ); + break; + } + + case ScoreSemReqSeizeWait_Pre_Count_NA: + break; + } +} + +static void ScoreSemReqSeizeWait_Post_Status_Check( + ScoreSemReqSeizeWait_Context *ctx, + ScoreSemReqSeizeWait_Post_Status state +) +{ + Status_Control status; + + switch ( state ) { + case ScoreSemReqSeizeWait_Post_Status_Ok: { + /* + * The return status of the directive call shall be derived from + * STATUS_SUCCESSFUL. + */ + status = TQEnqueue( &ctx->tq_ctx->base, ctx->tq_ctx->base.wait ); + T_eq_int( status, Status( ctx, STATUS_SUCCESSFUL ) ); + break; + } + + case ScoreSemReqSeizeWait_Post_Status_Enqueued: { + /* + * Where the thread queue uses the FIFO discipline, the calling thread + * shall be enqueued in FIFO order. + * + * Where the thread queue uses the priority discipline, the calling + * thread shall be enqueued in priority order. + */ + switch ( ctx->tq_ctx->base.discipline ) { + case TQ_FIFO: + ScoreTqReqEnqueueFifo_Run( &ctx->tq_ctx->base ); + break; + case TQ_PRIORITY: + ScoreTqReqEnqueuePriority_Run( &ctx->tq_ctx->base ); + break; + default: + T_unreachable(); + break; + } + break; + } + + case ScoreSemReqSeizeWait_Post_Status_NA: + break; + } +} + +static void ScoreSemReqSeizeWait_Post_Count_Check( + ScoreSemReqSeizeWait_Context *ctx, + ScoreSemReqSeizeWait_Post_Count state +) +{ + switch ( state ) { + case ScoreSemReqSeizeWait_Post_Count_Nop: { + /* + * The count of the semaphore shall not be modified. + */ + /* Checked by GetProperties() */ + break; + } + + case ScoreSemReqSeizeWait_Post_Count_MinusOne: { + /* + * The count of the semaphore shall be decremented by one. + */ + T_eq_u32( TQSemGetCount( ctx->tq_ctx ), 0 ); + break; + } + + case ScoreSemReqSeizeWait_Post_Count_NA: + break; + } +} + +static void ScoreSemReqSeizeWait_Post_Timer_Check( + ScoreSemReqSeizeWait_Context *ctx, + ScoreSemReqSeizeWait_Post_Timer state +) +{ + switch ( state ) { + case ScoreSemReqSeizeWait_Post_Timer_Optional: { + /* + * Where the directive was called with a timeout in clock ticks, the + * thread timer of the calling task shall fire after the specified clock + * ticks. + * + * Where the directive was called without a timeout, the thread timer of + * the calling task shall be inactive. + */ + /* Checked by GetProperties() */ + break; + } + + case ScoreSemReqSeizeWait_Post_Timer_No: { + /* + * The thread timer of the calling task shall be inactive. + */ + T_eq_int( + T_get_thread_timer_state( RTEMS_SELF ), + T_THREAD_TIMER_INACTIVE + ); + break; + } + + case ScoreSemReqSeizeWait_Post_Timer_NA: + break; + } +} + +static void ScoreSemReqSeizeWait_Prepare( ScoreSemReqSeizeWait_Context *ctx ) +{ + ctx->tq_ctx->base.enqueue_prepare = TQEnqueuePrepareDefault; + ctx->tq_ctx->base.enqueue_done = TQEnqueueDoneDefault; + ctx->tq_ctx->base.get_properties = GetProperties; +} + +static void ScoreSemReqSeizeWait_Action( ScoreSemReqSeizeWait_Context *ctx ) +{ + /* Action performed by Status post-condition */ +} + +static const ScoreSemReqSeizeWait_Entry +ScoreSemReqSeizeWait_Entries[] = { + { 0, 0, ScoreSemReqSeizeWait_Post_Status_Enqueued, + ScoreSemReqSeizeWait_Post_Count_Nop, + ScoreSemReqSeizeWait_Post_Timer_Optional }, + { 0, 0, ScoreSemReqSeizeWait_Post_Status_Ok, + ScoreSemReqSeizeWait_Post_Count_MinusOne, + ScoreSemReqSeizeWait_Post_Timer_No } +}; + +static const uint8_t +ScoreSemReqSeizeWait_Map[] = { + 0, 1 +}; + +static size_t ScoreSemReqSeizeWait_Scope( void *arg, char *buf, size_t n ) +{ + ScoreSemReqSeizeWait_Context *ctx; + + ctx = arg; + + if ( ctx->Map.in_action_loop ) { + return T_get_scope( ScoreSemReqSeizeWait_PreDesc, buf, n, ctx->Map.pcs ); + } + + return 0; +} + +static T_fixture ScoreSemReqSeizeWait_Fixture = { + .setup = NULL, + .stop = NULL, + .teardown = NULL, + .scope = ScoreSemReqSeizeWait_Scope, + .initial_context = &ScoreSemReqSeizeWait_Instance +}; + +static inline ScoreSemReqSeizeWait_Entry ScoreSemReqSeizeWait_PopEntry( + ScoreSemReqSeizeWait_Context *ctx +) +{ + size_t index; + + index = ctx->Map.index; + ctx->Map.index = index + 1; + return ScoreSemReqSeizeWait_Entries[ + ScoreSemReqSeizeWait_Map[ index ] + ]; +} + +static void ScoreSemReqSeizeWait_TestVariant( + ScoreSemReqSeizeWait_Context *ctx +) +{ + ScoreSemReqSeizeWait_Pre_Count_Prepare( ctx, ctx->Map.pcs[ 0 ] ); + ScoreSemReqSeizeWait_Action( ctx ); + ScoreSemReqSeizeWait_Post_Status_Check( ctx, ctx->Map.entry.Post_Status ); + ScoreSemReqSeizeWait_Post_Count_Check( ctx, ctx->Map.entry.Post_Count ); + ScoreSemReqSeizeWait_Post_Timer_Check( ctx, ctx->Map.entry.Post_Timer ); +} + +static T_fixture_node ScoreSemReqSeizeWait_Node; + +void ScoreSemReqSeizeWait_Run( TQSemContext *tq_ctx ) +{ + ScoreSemReqSeizeWait_Context *ctx; + + ctx = &ScoreSemReqSeizeWait_Instance; + ctx->tq_ctx = tq_ctx; + + ctx = T_push_fixture( + &ScoreSemReqSeizeWait_Node, + &ScoreSemReqSeizeWait_Fixture + ); + ctx->Map.in_action_loop = true; + ctx->Map.index = 0; + + for ( + ctx->Map.pcs[ 0 ] = ScoreSemReqSeizeWait_Pre_Count_Zero; + ctx->Map.pcs[ 0 ] < ScoreSemReqSeizeWait_Pre_Count_NA; + ++ctx->Map.pcs[ 0 ] + ) { + ctx->Map.entry = ScoreSemReqSeizeWait_PopEntry( ctx ); + ScoreSemReqSeizeWait_Prepare( ctx ); + ScoreSemReqSeizeWait_TestVariant( ctx ); + } + + T_pop_fixture(); +} + +/** @} */ diff --git a/testsuites/validation/tr-sem-seize-wait.h b/testsuites/validation/tr-sem-seize-wait.h new file mode 100644 index 0000000000..91d1790347 --- /dev/null +++ b/testsuites/validation/tr-sem-seize-wait.h @@ -0,0 +1,103 @@ +/* SPDX-License-Identifier: BSD-2-Clause */ + +/** + * @file + * + * @ingroup RTEMSTestCaseScoreSemReqSeizeWait + */ + +/* + * Copyright (C) 2021 embedded brains GmbH (http://www.embedded-brains.de) + * + * 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 OWNER 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. + */ + +/* + * This file is part of the RTEMS quality process and was automatically + * generated. If you find something that needs to be fixed or + * worded better please post a report or patch to an RTEMS mailing list + * or raise a bug report: + * + * https://www.rtems.org/bugs.html + * + * For information on updating and regenerating please refer to the How-To + * section in the Software Requirements Engineering chapter of the + * RTEMS Software Engineering manual. The manual is provided as a part of + * a release. For development sources please refer to the online + * documentation at: + * + * https://docs.rtems.org + */ + +#ifndef _TR_SEM_SEIZE_WAIT_H +#define _TR_SEM_SEIZE_WAIT_H + +#include "tx-thread-queue.h" + +#ifdef __cplusplus +extern "C" { +#endif + +/** + * @addtogroup RTEMSTestCaseScoreSemReqSeizeWait + * + * @{ + */ + +typedef enum { + ScoreSemReqSeizeWait_Pre_Count_Zero, + ScoreSemReqSeizeWait_Pre_Count_Positive, + ScoreSemReqSeizeWait_Pre_Count_NA +} ScoreSemReqSeizeWait_Pre_Count; + +typedef enum { + ScoreSemReqSeizeWait_Post_Status_Ok, + ScoreSemReqSeizeWait_Post_Status_Enqueued, + ScoreSemReqSeizeWait_Post_Status_NA +} ScoreSemReqSeizeWait_Post_Status; + +typedef enum { + ScoreSemReqSeizeWait_Post_Count_Nop, + ScoreSemReqSeizeWait_Post_Count_MinusOne, + ScoreSemReqSeizeWait_Post_Count_NA +} ScoreSemReqSeizeWait_Post_Count; + +typedef enum { + ScoreSemReqSeizeWait_Post_Timer_Optional, + ScoreSemReqSeizeWait_Post_Timer_No, + ScoreSemReqSeizeWait_Post_Timer_NA +} ScoreSemReqSeizeWait_Post_Timer; + +/** + * @brief Runs the parameterized test case. + * + * @param[in,out] tq_ctx is the semaphore thread queue context. + */ +void ScoreSemReqSeizeWait_Run( TQSemContext *tq_ctx ); + +/** @} */ + +#ifdef __cplusplus +} +#endif + +#endif /* _TR_SEM_SEIZE_WAIT_H */ diff --git a/testsuites/validation/tr-sem-surrender.c b/testsuites/validation/tr-sem-surrender.c new file mode 100644 index 0000000000..8226093dda --- /dev/null +++ b/testsuites/validation/tr-sem-surrender.c @@ -0,0 +1,570 @@ +/* SPDX-License-Identifier: BSD-2-Clause */ + +/** + * @file + * + * @ingroup RTEMSTestCaseScoreSemReqSurrender + */ + +/* + * Copyright (C) 2021 embedded brains GmbH (http://www.embedded-brains.de) + * + * 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 OWNER 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. + */ + +/* + * This file is part of the RTEMS quality process and was automatically + * generated. If you find something that needs to be fixed or + * worded better please post a report or patch to an RTEMS mailing list + * or raise a bug report: + * + * https://www.rtems.org/bugs.html + * + * For information on updating and regenerating please refer to the How-To + * section in the Software Requirements Engineering chapter of the + * RTEMS Software Engineering manual. The manual is provided as a part of + * a release. For development sources please refer to the online + * documentation at: + * + * https://docs.rtems.org + */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "tr-sem-surrender.h" +#include "tr-tq-surrender.h" + +#include + +/** + * @defgroup RTEMSTestCaseScoreSemReqSurrender spec:/score/sem/req/surrender + * + * @ingroup RTEMSTestSuiteTestsuitesValidationNoClock0 + * + * @{ + */ + +typedef struct { + uint16_t Skip : 1; + uint16_t Pre_Variant_NA : 1; + uint16_t Pre_Discipline_NA : 1; + uint16_t Pre_Count_NA : 1; + uint16_t Post_Status : 2; + uint16_t Post_Surrender : 2; + uint16_t Post_Count : 3; +} ScoreSemReqSurrender_Entry; + +/** + * @brief Test context for spec:/score/sem/req/surrender test case. + */ +typedef struct { + /** + * @brief This member specifies the semaphore count before the directive + * call. + */ + uint32_t count_before; + + /** + * @brief This member contains the return status of the directive call. + */ + Status_Control status; + + /** + * @brief This member contains the semaphore count after the directive call. + */ + uint32_t count_after; + + /** + * @brief If this member is true, then there shall be threads blocked on the + * semaphore. + */ + bool blocked; + + /** + * @brief This member contains a copy of the corresponding + * ScoreSemReqSurrender_Run() parameter. + */ + TQSemContext *tq_ctx; + + struct { + /** + * @brief This member defines the pre-condition states for the next action. + */ + size_t pcs[ 3 ]; + + /** + * @brief If this member is true, then the test action loop is executed. + */ + bool in_action_loop; + + /** + * @brief This member contains the next transition map index. + */ + size_t index; + + /** + * @brief This member contains the current transition map entry. + */ + ScoreSemReqSurrender_Entry entry; + + /** + * @brief If this member is true, then the current transition variant + * should be skipped. + */ + bool skip; + } Map; +} ScoreSemReqSurrender_Context; + +static ScoreSemReqSurrender_Context + ScoreSemReqSurrender_Instance; + +static const char * const ScoreSemReqSurrender_PreDesc_Variant[] = { + "Binary", + "Counting", + "NA" +}; + +static const char * const ScoreSemReqSurrender_PreDesc_Discipline[] = { + "FIFO", + "Priority", + "NA" +}; + +static const char * const ScoreSemReqSurrender_PreDesc_Count[] = { + "LessMax", + "Max", + "Blocked", + "NA" +}; + +static const char * const * const ScoreSemReqSurrender_PreDesc[] = { + ScoreSemReqSurrender_PreDesc_Variant, + ScoreSemReqSurrender_PreDesc_Discipline, + ScoreSemReqSurrender_PreDesc_Count, + NULL +}; + +typedef ScoreSemReqSurrender_Context Context; + +static Status_Control Status( const Context *ctx, Status_Control status ) +{ + return TQConvertStatus( &ctx->tq_ctx->base, status ); +} + +static void ScoreSemReqSurrender_Pre_Variant_Prepare( + ScoreSemReqSurrender_Context *ctx, + ScoreSemReqSurrender_Pre_Variant state +) +{ + switch ( state ) { + case ScoreSemReqSurrender_Pre_Variant_Binary: { + /* + * Where the semaphore is a binary semaphore. + */ + if ( ctx->tq_ctx->variant != TQ_SEM_BINARY ) { + ctx->Map.skip = true; + } + break; + } + + case ScoreSemReqSurrender_Pre_Variant_Counting: { + /* + * Where the semaphore is a counting semaphore. + */ + if ( ctx->tq_ctx->variant != TQ_SEM_COUNTING ) { + ctx->Map.skip = true; + } + break; + } + + case ScoreSemReqSurrender_Pre_Variant_NA: + break; + } +} + +static void ScoreSemReqSurrender_Pre_Discipline_Prepare( + ScoreSemReqSurrender_Context *ctx, + ScoreSemReqSurrender_Pre_Discipline state +) +{ + switch ( state ) { + case ScoreSemReqSurrender_Pre_Discipline_FIFO: { + /* + * Where the thread queue of the semaphore uses the FIFO discipline. + */ + if ( ctx->tq_ctx->base.discipline != TQ_FIFO ) { + ctx->Map.skip = true; + } + break; + } + + case ScoreSemReqSurrender_Pre_Discipline_Priority: { + /* + * Where the thread queue of the semaphore uses the priority discipline. + */ + if ( ctx->tq_ctx->base.discipline != TQ_PRIORITY ) { + ctx->Map.skip = true; + } + break; + } + + case ScoreSemReqSurrender_Pre_Discipline_NA: + break; + } +} + +static void ScoreSemReqSurrender_Pre_Count_Prepare( + ScoreSemReqSurrender_Context *ctx, + ScoreSemReqSurrender_Pre_Count state +) +{ + switch ( state ) { + case ScoreSemReqSurrender_Pre_Count_LessMax: { + /* + * While the count of the semaphore is less than the maximum count. + */ + ctx->blocked = false; + + if ( ctx->tq_ctx->variant == TQ_SEM_BINARY ) { + ctx->count_before = 0; + } else { + ctx->count_before = UINT32_MAX - 1; + } + break; + } + + case ScoreSemReqSurrender_Pre_Count_Max: { + /* + * While the count of the semaphore is equal to the maximum count. + */ + ctx->blocked = false; + + if ( ctx->tq_ctx->variant == TQ_SEM_BINARY ) { + ctx->count_before = 1; + } else { + ctx->count_before = UINT32_MAX; + } + break; + } + + case ScoreSemReqSurrender_Pre_Count_Blocked: { + /* + * While the semaphore has threads blocked on the semaphore. + */ + ctx->blocked = true; + ctx->count_before = 0; + break; + } + + case ScoreSemReqSurrender_Pre_Count_NA: + break; + } +} + +static void ScoreSemReqSurrender_Post_Status_Check( + ScoreSemReqSurrender_Context *ctx, + ScoreSemReqSurrender_Post_Status state +) +{ + switch ( state ) { + case ScoreSemReqSurrender_Post_Status_Ok: { + /* + * The return status of the directive call shall be derived from + * STATUS_SUCCESSFUL. + */ + T_eq_int( ctx->status, Status( ctx, STATUS_SUCCESSFUL ) ); + break; + } + + case ScoreSemReqSurrender_Post_Status_MaxCountExceeded: { + /* + * The return status of the directive call shall be derived from + * STATUS_MAXIMUM_COUNT_EXCEEDED. + */ + T_eq_int( ctx->status, Status( ctx, STATUS_MAXIMUM_COUNT_EXCEEDED ) ); + break; + } + + case ScoreSemReqSurrender_Post_Status_NA: + break; + } +} + +static void ScoreSemReqSurrender_Post_Surrender_Check( + ScoreSemReqSurrender_Context *ctx, + ScoreSemReqSurrender_Post_Surrender state +) +{ + switch ( state ) { + case ScoreSemReqSurrender_Post_Surrender_FIFO: { + /* + * The thread queue of the semaphore shall be surrendered in FIFO order. + */ + ScoreTqReqSurrender_Run( &ctx->tq_ctx->base ); + break; + } + + case ScoreSemReqSurrender_Post_Surrender_Priority: { + /* + * The thread queue of the semaphore shall be surrendered in priority + * order. + */ + ScoreTqReqSurrender_Run( &ctx->tq_ctx->base ); + break; + } + + case ScoreSemReqSurrender_Post_Surrender_NA: + break; + } +} + +static void ScoreSemReqSurrender_Post_Count_Check( + ScoreSemReqSurrender_Context *ctx, + ScoreSemReqSurrender_Post_Count state +) +{ + switch ( state ) { + case ScoreSemReqSurrender_Post_Count_Zero: { + /* + * The count of the semaphore shall be zero. + */ + T_eq_u32( ctx->count_after, 0 ); + break; + } + + case ScoreSemReqSurrender_Post_Count_One: { + /* + * The count of the semaphore shall be one. + */ + T_eq_u32( ctx->count_after, 1 ); + break; + } + + case ScoreSemReqSurrender_Post_Count_PlusOne: { + /* + * The count of the semaphore shall be incremented by one. + */ + T_eq_u32( ctx->count_after, ctx->count_before + 1 ); + break; + } + + case ScoreSemReqSurrender_Post_Count_Nop: { + /* + * The count of the semaphore shall not be modified. + */ + T_eq_u32( ctx->count_after, ctx->count_before ); + break; + } + + case ScoreSemReqSurrender_Post_Count_NA: + break; + } +} + +static void ScoreSemReqSurrender_Setup( ScoreSemReqSurrender_Context *ctx ) +{ + ctx->tq_ctx->base.wait = TQ_WAIT_FOREVER; + TQReset( &ctx->tq_ctx->base ); +} + +static void ScoreSemReqSurrender_Setup_Wrap( void *arg ) +{ + ScoreSemReqSurrender_Context *ctx; + + ctx = arg; + ctx->Map.in_action_loop = false; + ScoreSemReqSurrender_Setup( ctx ); +} + +static void ScoreSemReqSurrender_Action( ScoreSemReqSurrender_Context *ctx ) +{ + TQSemSetCount( ctx->tq_ctx, ctx->count_before ); + + if ( ctx->blocked ) { + TQSend( &ctx->tq_ctx->base, TQ_BLOCKER_A, TQ_EVENT_ENQUEUE ); + } + + ctx->status = TQSurrender( &ctx->tq_ctx->base ); + ctx->count_after = TQSemGetCount( ctx->tq_ctx ); + TQSemSetCount( ctx->tq_ctx, 1 ); +} + +static const ScoreSemReqSurrender_Entry +ScoreSemReqSurrender_Entries[] = { + { 0, 0, 0, 0, ScoreSemReqSurrender_Post_Status_Ok, + ScoreSemReqSurrender_Post_Surrender_NA, ScoreSemReqSurrender_Post_Count_One }, + { 0, 0, 0, 0, ScoreSemReqSurrender_Post_Status_Ok, + ScoreSemReqSurrender_Post_Surrender_FIFO, + ScoreSemReqSurrender_Post_Count_Zero }, + { 0, 0, 0, 0, ScoreSemReqSurrender_Post_Status_Ok, + ScoreSemReqSurrender_Post_Surrender_Priority, + ScoreSemReqSurrender_Post_Count_Zero }, + { 0, 0, 0, 0, ScoreSemReqSurrender_Post_Status_Ok, + ScoreSemReqSurrender_Post_Surrender_NA, + ScoreSemReqSurrender_Post_Count_PlusOne }, + { 0, 0, 0, 0, ScoreSemReqSurrender_Post_Status_MaxCountExceeded, + ScoreSemReqSurrender_Post_Surrender_NA, ScoreSemReqSurrender_Post_Count_Nop } +}; + +static const uint8_t +ScoreSemReqSurrender_Map[] = { + 0, 0, 1, 0, 0, 2, 3, 4, 1, 3, 4, 2 +}; + +static size_t ScoreSemReqSurrender_Scope( void *arg, char *buf, size_t n ) +{ + ScoreSemReqSurrender_Context *ctx; + + ctx = arg; + + if ( ctx->Map.in_action_loop ) { + return T_get_scope( ScoreSemReqSurrender_PreDesc, buf, n, ctx->Map.pcs ); + } + + return 0; +} + +static T_fixture ScoreSemReqSurrender_Fixture = { + .setup = ScoreSemReqSurrender_Setup_Wrap, + .stop = NULL, + .teardown = NULL, + .scope = ScoreSemReqSurrender_Scope, + .initial_context = &ScoreSemReqSurrender_Instance +}; + +static const uint8_t ScoreSemReqSurrender_Weights[] = { + 6, 3, 1 +}; + +static void ScoreSemReqSurrender_Skip( + ScoreSemReqSurrender_Context *ctx, + size_t index +) +{ + switch ( index + 1 ) { + case 1: + ctx->Map.pcs[ 1 ] = ScoreSemReqSurrender_Pre_Discipline_NA - 1; + /* Fall through */ + case 2: + ctx->Map.pcs[ 2 ] = ScoreSemReqSurrender_Pre_Count_NA - 1; + break; + } +} + +static inline ScoreSemReqSurrender_Entry ScoreSemReqSurrender_PopEntry( + ScoreSemReqSurrender_Context *ctx +) +{ + size_t index; + + if ( ctx->Map.skip ) { + size_t i; + + ctx->Map.skip = false; + index = 0; + + for ( i = 0; i < 3; ++i ) { + index += ScoreSemReqSurrender_Weights[ i ] * ctx->Map.pcs[ i ]; + } + } else { + index = ctx->Map.index; + } + + ctx->Map.index = index + 1; + + return ScoreSemReqSurrender_Entries[ + ScoreSemReqSurrender_Map[ index ] + ]; +} + +static void ScoreSemReqSurrender_TestVariant( + ScoreSemReqSurrender_Context *ctx +) +{ + ScoreSemReqSurrender_Pre_Variant_Prepare( ctx, ctx->Map.pcs[ 0 ] ); + + if ( ctx->Map.skip ) { + ScoreSemReqSurrender_Skip( ctx, 0 ); + return; + } + + ScoreSemReqSurrender_Pre_Discipline_Prepare( ctx, ctx->Map.pcs[ 1 ] ); + + if ( ctx->Map.skip ) { + ScoreSemReqSurrender_Skip( ctx, 1 ); + return; + } + + ScoreSemReqSurrender_Pre_Count_Prepare( ctx, ctx->Map.pcs[ 2 ] ); + ScoreSemReqSurrender_Action( ctx ); + ScoreSemReqSurrender_Post_Status_Check( ctx, ctx->Map.entry.Post_Status ); + ScoreSemReqSurrender_Post_Surrender_Check( + ctx, + ctx->Map.entry.Post_Surrender + ); + ScoreSemReqSurrender_Post_Count_Check( ctx, ctx->Map.entry.Post_Count ); +} + +static T_fixture_node ScoreSemReqSurrender_Node; + +void ScoreSemReqSurrender_Run( TQSemContext *tq_ctx ) +{ + ScoreSemReqSurrender_Context *ctx; + + ctx = &ScoreSemReqSurrender_Instance; + ctx->tq_ctx = tq_ctx; + + ctx = T_push_fixture( + &ScoreSemReqSurrender_Node, + &ScoreSemReqSurrender_Fixture + ); + ctx->Map.in_action_loop = true; + ctx->Map.index = 0; + ctx->Map.skip = false; + + for ( + ctx->Map.pcs[ 0 ] = ScoreSemReqSurrender_Pre_Variant_Binary; + ctx->Map.pcs[ 0 ] < ScoreSemReqSurrender_Pre_Variant_NA; + ++ctx->Map.pcs[ 0 ] + ) { + for ( + ctx->Map.pcs[ 1 ] = ScoreSemReqSurrender_Pre_Discipline_FIFO; + ctx->Map.pcs[ 1 ] < ScoreSemReqSurrender_Pre_Discipline_NA; + ++ctx->Map.pcs[ 1 ] + ) { + for ( + ctx->Map.pcs[ 2 ] = ScoreSemReqSurrender_Pre_Count_LessMax; + ctx->Map.pcs[ 2 ] < ScoreSemReqSurrender_Pre_Count_NA; + ++ctx->Map.pcs[ 2 ] + ) { + ctx->Map.entry = ScoreSemReqSurrender_PopEntry( ctx ); + ScoreSemReqSurrender_TestVariant( ctx ); + } + } + } + + T_pop_fixture(); +} + +/** @} */ diff --git a/testsuites/validation/tr-sem-surrender.h b/testsuites/validation/tr-sem-surrender.h new file mode 100644 index 0000000000..06ab4c20c1 --- /dev/null +++ b/testsuites/validation/tr-sem-surrender.h @@ -0,0 +1,118 @@ +/* SPDX-License-Identifier: BSD-2-Clause */ + +/** + * @file + * + * @ingroup RTEMSTestCaseScoreSemReqSurrender + */ + +/* + * Copyright (C) 2021 embedded brains GmbH (http://www.embedded-brains.de) + * + * 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 OWNER 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. + */ + +/* + * This file is part of the RTEMS quality process and was automatically + * generated. If you find something that needs to be fixed or + * worded better please post a report or patch to an RTEMS mailing list + * or raise a bug report: + * + * https://www.rtems.org/bugs.html + * + * For information on updating and regenerating please refer to the How-To + * section in the Software Requirements Engineering chapter of the + * RTEMS Software Engineering manual. The manual is provided as a part of + * a release. For development sources please refer to the online + * documentation at: + * + * https://docs.rtems.org + */ + +#ifndef _TR_SEM_SURRENDER_H +#define _TR_SEM_SURRENDER_H + +#include "tx-thread-queue.h" + +#ifdef __cplusplus +extern "C" { +#endif + +/** + * @addtogroup RTEMSTestCaseScoreSemReqSurrender + * + * @{ + */ + +typedef enum { + ScoreSemReqSurrender_Pre_Variant_Binary, + ScoreSemReqSurrender_Pre_Variant_Counting, + ScoreSemReqSurrender_Pre_Variant_NA +} ScoreSemReqSurrender_Pre_Variant; + +typedef enum { + ScoreSemReqSurrender_Pre_Discipline_FIFO, + ScoreSemReqSurrender_Pre_Discipline_Priority, + ScoreSemReqSurrender_Pre_Discipline_NA +} ScoreSemReqSurrender_Pre_Discipline; + +typedef enum { + ScoreSemReqSurrender_Pre_Count_LessMax, + ScoreSemReqSurrender_Pre_Count_Max, + ScoreSemReqSurrender_Pre_Count_Blocked, + ScoreSemReqSurrender_Pre_Count_NA +} ScoreSemReqSurrender_Pre_Count; + +typedef enum { + ScoreSemReqSurrender_Post_Status_Ok, + ScoreSemReqSurrender_Post_Status_MaxCountExceeded, + ScoreSemReqSurrender_Post_Status_NA +} ScoreSemReqSurrender_Post_Status; + +typedef enum { + ScoreSemReqSurrender_Post_Surrender_FIFO, + ScoreSemReqSurrender_Post_Surrender_Priority, + ScoreSemReqSurrender_Post_Surrender_NA +} ScoreSemReqSurrender_Post_Surrender; + +typedef enum { + ScoreSemReqSurrender_Post_Count_Zero, + ScoreSemReqSurrender_Post_Count_One, + ScoreSemReqSurrender_Post_Count_PlusOne, + ScoreSemReqSurrender_Post_Count_Nop, + ScoreSemReqSurrender_Post_Count_NA +} ScoreSemReqSurrender_Post_Count; + +/** + * @brief Runs the parameterized test case. + * + * @param[in,out] tq_ctx is the thread queue context. + */ +void ScoreSemReqSurrender_Run( TQSemContext *tq_ctx ); + +/** @} */ + +#ifdef __cplusplus +} +#endif + +#endif /* _TR_SEM_SURRENDER_H */ -- cgit v1.2.3