summaryrefslogtreecommitdiffstats
path: root/cpukit/score/src/rbtreenext.c (follow)
Commit message (Collapse)AuthorAgeFilesLines
* Update company nameSebastian Huber2023-05-201-1/+1
| | | | | The embedded brains GmbH & Co. KG is the legal successor of embedded brains GmbH.
* score: Add SPDX License IdentifierSebastian Huber2022-05-181-1/+3
| | | | | | Remove URL in copyright notice. Update #3053.
* score: Split up rbtreenext.cSebastian Huber2021-09-061-28/+20
| | | | | | | | | | Split up rbtreenext.c since only _RBTree_Minimum() is used by the operating system core services (thread queues and the EDF scheduler). Change license to BSD-2-Clause according to file history and re-licensing agreement. Update #3053.
* score: Canonicalize Doxygen @file commentsSebastian Huber2020-12-021-1/+3
| | | | | | Use common phrases for the file brief descriptions. Update #3706.
* Canonicalize config.h includeSebastian Huber2020-04-161-2/+2
| | | | | | | | Use the following variant which was already used by most source files: #ifdef HAVE_CONFIG_H #include "config.h" #endif
* doxygen: Rename Score* groups in RTEMSScore*Sebastian Huber2019-04-041-1/+1
| | | | Update #3706
* rbtree: Replace implementationSebastian Huber2015-09-031-33/+24
| | | | | Use the BSD <sys/tree.h> implementation since it is faster, more flexible and uses less storage. See https://github.com/sebhub/rb-bench.
* rbtree: FormatSebastian Huber2014-07-221-6/+7
|
* Change all references of rtems.com to rtems.org.Chris Johns2014-03-211-1/+1
|
* score/rbtree: Remove "unprotected" from APISebastian Huber2013-11-211-2/+2
|
* score/rbtree: Delete protected operationsSebastian Huber2013-11-211-15/+0
| | | | | The user of the red-black tree container must now ensure that at most one thread at once can access an instance.
* score: Create rbtree implementation headerSebastian Huber2013-07-231-1/+1
| | | | | | 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.
* rbtree: API changes. Remove rbtree control node from RBTree_Next.Gedare Bloom2012-05-081-8/+5
| | | | | | | | | | | | 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.
* rbtree: PR1995: API changeSebastian Huber2012-04-111-0/+80
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().