blob: bc87e376d7766e8cf71db45fb4a17e8ea85192df (
plain) (
tree)
|
|
# SPDX-License-Identifier: BSD-2-Clause
# COPYRIGHT (c) 1989-2009.
# On-Line Applications Research Corporation (OAR).
#
# 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 describes the directives and concepts tested by this test set.
test set name: sp42
directives:
rtems_semaphore_create
rtems_semaphore_obtain
rtems_semaphore_release
rtems_semaphore_delete
rtems_task_create
rtems_task_delete
rtems_task_start
really exercising various Thread Queue capabilities:
_Thread_queue_Enqueue_FIFO
_Thread_queue_Enqueue_priority
_Thread_queue_Dequeue_FIFO
_Thread_queue_Dequeue_priority
concepts:
+ This test is very carefully constructed to exercise the data structure
used to implement the priority blocking chains in the Thread Queue. The
task priorities used force forward and reverse searches and use of the
2-n chains
+ This test also ensures that the dequeues are performed in the correct
order.
|
