summaryrefslogtreecommitdiffstats
path: root/testsuites (follow)
Commit message (Collapse)AuthorAgeFilesLines
* smptests/smpcache01: Test the SMP cache managerDaniel Cederman2014-08-226-0/+342
| | | | Invokes SMP cache management routines under different scenarios.
* score: PR2179: Fix initially locked PI mutexSebastian Huber2014-08-202-0/+39
|
* sptests/sprbtree01: Add random ops test caseSebastian Huber2014-08-082-1/+832
|
* rbtree: Simplify insert and extractSebastian Huber2014-08-071-10/+4
| | | | | | | Simplify _RBTree_Insert() and _RBTree_Extract(). Remove more superfluous NULL pointer checks. Change _RBTree_Is_root() to use only the node. Add parent parameter to _RBTree_Sibling(). Delete _RBTree_Grandparent() and _RBTree_Parent_sibling().
* rbtree: Simplify _RBTree_Rotate()Sebastian Huber2014-08-071-1/+0
| | | | Add and use _RBTree_Direction().
* sptests/sprbtree01: Check tree layoutSebastian Huber2014-08-051-0/+620
|
* sptests/sprbtree01: Reduce stack usageSebastian Huber2014-08-051-1/+2
|
* rbtree: Add and use RBTree_Compare_resultSebastian Huber2014-08-052-18/+1
|
* Add and use RTEMS_CONTAINER_OF()Sebastian Huber2014-08-051-22/+22
|
* rbtree: Rename find header in find controlSebastian Huber2014-07-292-8/+3
| | | | Simplify _RBTree_Find_control(). Avoid superfluous NULL pointer checks.
* rbtree: Simplify off-tree handlingSebastian Huber2014-07-291-4/+4
| | | | | | | Only use the parent pointer, since this pointer is never NULL for nodes which are part of a tree. Rename functions from *_off_rbtree() to *_off_tree().
* rbtree: Update maximum node in LIFO orderSebastian Huber2014-07-262-9/+107
| | | | | | The test sptests/sp35 showed a NULL pointer access due to an invalid maximum node field (e.g. a tree with one element and NULL as the maximum node).
* Add _TOD_Adjust to SCORE TOD Handler.Joel Sherrill2014-07-232-4/+18
| | | | | | | | This lays the proper structure for doing future work on time adjustment algorithms. Any TOD adjustments should be requested at the API level and performed at the SCORE level. Additionally updated a test.
* rbtree: Do not set node off-tree in extractSebastian Huber2014-07-221-4/+5
|
* rbtree: Remove superfluous NULL pointer checksSebastian Huber2014-07-221-3/+0
|
* rbtree: Reduce RBTree_Control sizeSebastian Huber2014-07-151-43/+65
| | | | | | | | | | | | Remove compare function and is unique indicator from the control structure. Rename RBTree_Compare_function to RBTree_Compare. Rename rtems_rbtree_compare_function to rtems_rbtree_compare. Provide C++ compatible initializers. Add compare function and is unique indicator to _RBTree_Find(), _RBTree_Insert(), rtems_rbtree_find() and rtems_rbtree_insert(). Remove _RBTree_Is_unique() and rtems_rbtree_is_unique(). Remove compare function and is unique indicator from _RBTree_Initialize_empty() and rtems_rbtree_initialize_empty().
* sp59: Fix typosJoel Sherrill2014-07-142-3/+3
|
* Enhance Semaphore Blocking and Readying Time Test CasesJoel Sherrill2014-07-1421-171/+477
| | | | | | | | | | | | | | | | tm02 and tm03 were modified to be reused for multiple configurations of RTEMS Classic API Semaphores. This added tm31-36. The messages for tm02 and tm03 were modified to indicate the semaphore attributes. tm31 - tm36 were added. This resulted in the following cases: tm02 - rtems_semaphore_obtain: Counting/FIFO not available caller blocks tm03 - rtems_semaphore_release: Counting/FIFO task readied preempts caller tm31 - rtems_semaphore_obtain: Counting/priority not available caller blocks tm32 - rtems_semaphore_release: Counting/priority task readied preempts caller tm33 - rtems_semaphore_obtain: Binary/FIFO not available caller blocks tm34 - rtems_semaphore_release: Binary/FIFO task readied preempts caller tm35 - rtems_semaphore_obtain: Binary/priority not available caller blocks tm36 - rtems_semaphore_release: Binary/priority task readied preempts caller
* capture01: Add include of assert.h.Jennifer Averett2014-07-141-0/+1
|
* smpschedsem01: new test.Jennifer Averett2014-07-116-0/+134
| | | | | This test verifies priority is inherited from a high priority semaphore by a lower priority task.
* smpschedaffinity05: Add test for worst case migration for affintiy scheduler.Jennifer Averett2014-07-116-0/+295
| | | | | | This test uses a combination of priority and affinity to cause the tasks running on all 4 cores to change due to one task priority change.
* smpschedaffinity04: New test.Jennifer Averett2014-07-116-0/+229
| | | | | This test walks a secondary high prority task across all the cores.
* smpschedaffinity03: New test.Jennifer Averett2014-07-116-0/+142
| | | | This task walks the affinity of self across all the cores.
* smpschedaffinity02: New test.Jennifer Averett2014-07-116-0/+283
| | | | | This test checks setting the affinity of a secondary task on a two core system.
* smpschedaffinity01: New test.Jennifer Averett2014-07-116-0/+220
| | | | This test verifies that affinity is honored when set prior to task start.
* capture01: New non-interactive test for capture engine.Jennifer Averett2014-07-118-0/+621
|
* score: Fix scheduler helping implementationSebastian Huber2014-07-102-241/+255
| | | | | Do not extract the idle threads from the ready set so that there is always a thread available for comparison.
* termios: Add rtems_termios_set_best_baud()Sebastian Huber2014-07-092-1/+58
|
* termios: PR1279: Use first open statusSebastian Huber2014-07-091-0/+50
|
* termios: PR1279: Use set attributes statusSebastian Huber2014-07-091-0/+63
|
* termios: PR2153: New low-level device APISebastian Huber2014-07-092-1/+101
| | | | | | | | | | | | | | | | | Add a new low-level device API to Termios that passes the TTY structure to the low-level device functions. This greatly simplifies the low-level device drivers since they are no longer forced to derive their private data from the minor number. It makes it possible to use the TTY low-level lock in the device driver low-level functions which is necessary for proper SMP support. For example to set the attributes it is often necessary to perform a read-modify-write operation on a control register used also by interrupt routines. A compatibility layer is provided to support device drivers using the old callback functions so it is not necessary to modify existing device drivers.
* smptests/smpmrsp01: Add and update test casesSebastian Huber2014-07-092-185/+720
|
* score: Need for help indicator for scheduler opsSebastian Huber2014-07-081-16/+387
| | | | | | | | | | | | | Return a thread in need for help for the following scheduler operations - unblock, - change priority, and - yield. A thread in need for help is a thread that encounters a scheduler state change from scheduled to ready or a thread that cannot be scheduled in an unblock operation. Such a thread can ask threads which depend on resources owned by this thread for help.
* score: Rename *_Node_get() to *_Thread_get_node()Sebastian Huber2014-07-081-1/+1
| | | | | | This emphasizes that the scheduler node of a thread is returned and this is not a function working with scheduler nodes like the other *_Node_*() functions.
* sptests/spcontext01: Avoid NULL pointer accessSebastian Huber2014-07-011-1/+15
|
* smptests/smpfatal08: Support RTEMS_PARAVIRTSebastian Huber2014-06-301-1/+2
|
* smptests/smpmigration02: PR2183: Add test caseSebastian Huber2014-06-241-11/+138
|
* score: Fix thread deletion on SMPSebastian Huber2014-06-232-13/+193
| | | | | | Close the thread object in _Thread_Make_zombie() so that all blocking operations that use _Thread_Get() in the corresponding release directive can find a terminating thread and can complete the operation.
* score: Collect scheduler related fields in TCBSebastian Huber2014-06-231-2/+3
| | | | | Add Thread_Scheduler_control to collect scheduler related fields of the TCB.
* smptests/smpwakeafter01: New testSebastian Huber2014-06-186-0/+230
|
* smptests: Avoid use of uninitialized dataSebastian Huber2014-06-132-0/+4
|
* smptests/smpscheduler03: Test all SMP schedulersSebastian Huber2014-06-122-4/+135
|
* samples/pppd: Fix extra drivers initializerSebastian Huber2014-06-111-1/+1
|
* smptest/smpfatal03: Update due to API changesSebastian Huber2014-06-101-1/+1
|
* sptests/spsem03: New testSebastian Huber2014-06-036-0/+194
|
* rhealstone: Produce proper begin/end messagesSebastian Huber2014-06-036-12/+25
|
* smptests/smpthreadlife01: Fix for debug enabledChristian Mauderer2014-06-031-4/+4
|
* smptests/smpmrsp01: Fix scheduler idsChristian Mauderer2014-06-031-1/+9
|
* score: Use Resource Handler for MrsP semaphoresSebastian Huber2014-06-031-0/+288
| | | | | This enables proper resource dependency tracking and as a side-effect deadlock detection.
* score: Add Resource HandlerSebastian Huber2014-06-036-0/+445
| | | | | | | | | | A resource is something that has at most one owner at a time and may have multiple rivals in case an owner is present. The owner and rivals are impersonated via resource nodes. A resource is represented via the resource control structure. The resource controls and nodes are organized as trees. It is possible to detect deadlocks via such a resource tree. The _Resource_Iterate() function can be used to iterate through such a resource tree starting at a top node.
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-23 22:42:25 +0000