summaryrefslogtreecommitdiffstats
path: root/cpukit/sapi/src/rbheap.c (unfollow)
Commit message (Collapse)AuthorFilesLines
2020-12-02sapi: Canonicalize @defgroup and @file commentsSebastian Huber1-2/+5
Adjust group identifier and names to be in line with a common pattern. Use common phrases for the group and file brief descriptions. Update #3706.
2020-04-16Canonicalize config.h includeSebastian Huber1-2/+2
Use the following variant which was already used by most source files: #ifdef HAVE_CONFIG_H #include "config.h" #endif
2016-07-22score: Add debug support to chainsSebastian Huber1-0/+1
This helps to detect * double insert, append, prepend errors, and * get from empty chain errors.
2015-09-11rbheap: Fix rtems_rbheap_free()Sebastian Huber1-21/+16
Remove unused descriptor of merged free chunks from the free chain and add them to the spare descriptors. Close #2417.
2015-08-31rbheap: Avoid internal APISebastian Huber1-10/+11
2014-08-05rbtree: Add and use RBTree_Compare_resultSebastian Huber1-31/+39
2014-07-15rbtree: Reduce RBTree_Control sizeSebastian Huber1-4/+4
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().
2014-03-21Change all references of rtems.com to rtems.org.Chris Johns1-1/+1
2013-11-21score/rbtree: Remove "unprotected" from APISebastian Huber1-4/+4
2012-05-08rbtree: API changes. Remove rbtree control node from RBTree_Next.Gedare Bloom1-4/+3
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.
2012-04-18rbheap: API changes and documentationSebastian Huber1-94/+95
2012-04-11rbheap: New filesSebastian Huber1-0/+277
In the Red-Black Tree Heap the administration data structures are not contained in the managed memory area. This can be used for example in a task stack allocator which protects the task stacks from access by other tasks.