| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
| |
Updates #3053.
|
|
|
|
| |
Update #3465.
|
|
|
|
| |
Update #3465.
|
|
|
|
|
| |
Update #3170.
Update #3199.
|
|
|
|
|
|
|
|
| |
The TEST_EXTERN is a used only by the system.h style tests and they use
CONFIGURE_INIT appropriately.
Update #3170.
Update #3199.
|
|
|
|
|
|
|
|
|
|
| |
- Remove the printf support leaving the direct printk support configured
with TESTS_USE_PRINTK and all other output goes via a buffered vsniprintf
call to printk.
- Control the test's single init for functions and global data with
TEST_INIT and not CONFIGURE_INIT. They are now separate.
Updates #3170.
|
| |
|
|
|
|
| |
Return if the inserted node is the new minimum node or not.
|
|
|
|
| |
This helps to detect double insert and extract errors.
|
|
|
|
|
| |
Use the BSD <sys/tree.h> implementation since it is faster, more
flexible and uses less storage. See https://github.com/sebhub/rb-bench.
|
|
|
|
|
| |
This function is hard to support in alternative implementations. It has
no internal use case.
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
| |
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().
|
|
|
|
| |
Add and use _RBTree_Direction().
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
Simplify _RBTree_Find_control(). Avoid superfluous NULL pointer checks.
|
|
|
|
|
|
|
| |
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().
|
|
|
|
|
|
| |
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).
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
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().
|
| |
|
| |
|
| |
|
|
|
|
|
| |
The user of the red-black tree container must now ensure that at most
one thread at once can access an instance.
|
|
|
|
|
|
| |
Move implementation specific parts of rbtree.h and rbtree.inl into new
header file rbtreeimpl.h. The rbtree.h contains now only the
application visible API.
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
| |
Script does what is expected and tries to do it as
smartly as possible.
+ remove occurrences of two blank comment lines
next to each other after Id string line removed.
+ remove entire comment blocks which only exited to
contain CVS Ids
+ If the processing left a blank line at the top of
a file, it was removed.
|
|
|
|
|
|
|
|
|
|
|
|
| |
The implementation of RBTree_Next was using an awkward construction to detect
and avoid accessing the false root of the red-black tree. To deal with the
false root, RBTree_Next was comparing node parents with the control node.
Instead the false root can be detected by checking if the grandparent of a
node exists; the grandparent of the tree's true root is NULL by definition
so the root of the tree is found while walking up the tree by checking for
the non-existence of a grandparent.
This change propagates into the predecessor/successor and iterate functions.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
New functions
o _RBTree_Next_unprotected(),
o _RBTree_Next(),
o _RBTree_Successor_unprotected(),
o _RBTree_Predecessor_unprotected(),
o rtems_rbtree_successor_unprotected(), and
o rtems_rbtree_predecessor_unprotected().
Change prototype of
o _RBTree_Successor(),
o _RBTree_Predecessor(),
o rtems_rbtree_successor(), and
o rtems_rbtree_predecessor().
|
|
|
|
|
| |
Change the meaning of the compare result to simplify comparison of
integer keys.
|
|
|
|
|
|
|
| |
The tests for the rtems_rbtree_predecessor/successor check for a
range of values for the target id of the predecessor/successor
when we know the exact expected value. This commit makes the
test more precise.
|
|
|
|
|
| |
* sp31/task1.c: Make Do_nothing static.
* sprbtree01/init.c: Make test_compare_function, rb_assert static.
|
|
|
|
|
|
|
|
|
|
|
| |
* sp75/init.c, spcbssched01/init.c, spcbssched01/task1.c
spcbssched02/init.c, spcbssched02/task_periodic.c,
spcbssched03/init.c, spcbssched03/tasks_aperiodic.c,
spcbssched03/tasks_periodic.c, spedfsched01/init.c,
spedfsched01/task1.c, spedfsched02/getall.c, spedfsched02/init.c,
spedfsched02/task1.c, spedfsched03/init.c,
spedfsched03/tasks_aperiodic.c, spedfsched03/tasks_periodic.c,
sprbtree01/init.c: Add HAVE_CONFIG_H.
|
|
|
|
|
|
|
| |
PR 1923/testing
* spcbssched02/spcbssched02.scn, spcbssched02/system.h,
spcbssched03/init.c, spcbssched03/system.h, spedfsched02/system.h,
spedfsched03/system.h, sprbtree01/init.c: Improve coverage.
|
|
|
|
|
|
|
| |
PR 1886/cpukit
* sprbtree01/init.c, sprbtree01/sprbtree01.scn: This patch enables
inserting duplicate keys into rbtree. It is possible to turn on this
feature when initializing the tree.
|
|
|
|
|
| |
PR 1883/testing
* sprbtree01/init.c: Attempt provide coverage on last two ranges.
|
|
|
|
|
| |
PR 1877/cpukit
* sprbtree01/init.c: Add comparison function for RBTrees.
|
|
|
|
|
| |
PR 1862/testing
* sprbtree01/init.c, sprbtree01/sprbtree01.scn: Improve test coverage.
|
|
|
|
|
|
| |
PR 1854/cpukit
* sprbtree01/init.c, sprbtree01/sprbtree01.scn: Add test of the
rtems_rbtree_extract() to improve test coverage.
|
|
PR 1641/cpukit
* Makefile.am, configure.ac: Create testcase for red black tree.
* sprbtree01/init.c, sprbtree01/Makefile.am, sprbtree01/sprbtree01.doc,
sprbtree01/sprbtree01.scn: New files.
|