summaryrefslogtreecommitdiffstats
path: root/testsuites (follow)
Commit message (Collapse)AuthorAgeFilesLines
* pppd: Fix warningsSebastian Huber2014-09-301-3/+1
|
* sptests/spintrcritical22: New testSebastian Huber2014-09-196-0/+176
|
* smptests/smpload01: Report profiling only onceSebastian Huber2014-09-172-184/+0
| | | | Rely on test extension to report profiling.
* Use correct prototype of benchmark_timer_read()Joel Sherrill2014-09-1650-52/+50
| | | | | | | | | | | | | | This change starts with removing the effectively empty file timerdrv.h. The prototypes for benchmark_timer_XXX() were in btimer.h which was not universally used. Thus every use of timerdrv.h had to be changed to btimer.h. Then the prototypes for benchmark_timer_read() had to be adjusted to return benchmark_timer_t rather than int or uint32_t. I took this opportunity to also correct the file headers to separate the copyright from the file description comments which is needed to ensure the copyright isn't propagated into Doxygen output.
* sptests/sp07: Minimize thread dispatch latencySebastian Huber2014-09-1611-157/+71
| | | | | | Do not use sprintf() in thread dispatch critical sections to avoid corruption of profiling samples. Update test to reflect thread the life cycle changes.
* smptests/smpcache01: Remove invalidation of data cache lines from testDaniel Cederman2014-09-163-33/+33
| | | | | Invalidation of entire data cache might cause data written to the stack to get lost.
* sptests/spintrcritical_support: Optimize busy loopSebastian Huber2014-09-121-3/+4
|
* sptests/spintrcritical10: Avoid undefined memorySebastian Huber2014-09-121-0/+3
|
* tmtests/tmcontext01: Improve cache dirty functionSebastian Huber2014-09-111-14/+24
| | | | Increment by cache line size to allow more cycles per second.
* sptests/spfatal07: Fix end of test messageSebastian Huber2014-09-101-1/+1
|
* sptests/sp39: Convert to sptests/spintrcritical21Sebastian Huber2014-09-108-105/+83
| | | | | Use interrupt critical section test support. Do not print end of test message in case of failure.
* psxtests/psxonce01: Use test extensionSebastian Huber2014-09-101-0/+2
|
* tests: Rework interrupt critical testsSebastian Huber2014-09-1014-290/+504
| | | | | | | | | This avoids test durations of more than one hour on fast targets, since fast targets can count a lot during one clock tick period, so the minor loop iteration count was quite high. Estimate now the test body duration to iterate only through the interesting time window. Add and use interrupt_critical_section_test().
* Add -std=gnu++11 to CXXFLAGS if SMP is enabledSebastian Huber2014-09-081-1/+6
| | | | | This is necessary to use the <atomic> header file used for the atomic operations.
* tmtests/tmcontext01: Improve cache dirty functionSebastian Huber2014-09-081-4/+7
|
* sptests/spcontext01: Fix warningSebastian Huber2014-09-081-1/+1
|
* tmtests/tmcontext01: Plot a legendSebastian Huber2014-09-051-6/+20
|
* spcpuset01: Use %zd for size_t to eliminate warningJoel Sherrill2014-09-042-6/+6
|
* Misc psxtmtests: Use uint32_t not long for end_time to match printf() format ↵Joel Sherrill2014-09-0411-26/+27
| | | | expectations
* spfreechain01/init.c: Use %zd for size_t to eliminate warningJoel Sherrill2014-09-041-2/+2
|
* sp19: Eliminate warningsJoel Sherrill2014-09-042-39/+16
|
* raspberrypi: Use shared bspreset.cJoel Sherrill2014-09-041-33/+32
|
* samples/iostream: Produce proper begin/end messageSebastian Huber2014-09-012-4/+4
|
* smptests/smplock01: Update screen fileSebastian Huber2014-09-011-1/+1
|
* libtests/capture01: Fix test nameSebastian Huber2014-09-011-1/+1
|
* libtests/capture01: Force error if SMP enabledSebastian Huber2014-09-011-0/+5
| | | | | This prevents infinite test runs on SMP due to the recursive interrupt lock acquire.
* tests: Add documentationSebastian Huber2014-09-0112-17/+97
|
* smptests/smpfatal08: Fix link errorSebastian Huber2014-09-011-0/+7
|
* rtems: Add more clock tick functionsSebastian Huber2014-08-263-0/+64
| | | | | Add rtems_clock_tick_later(), rtems_clock_tick_later_usec() and rtems_clock_tick_before().
* sptests/spcache01: Make inline assembly conditional to account for OpenRISC ↵Hesham ALMatary2014-08-251-1/+5
| | | | l.nop instruction.
* 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.