| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
|
| |
This helps to reduce code size in statically linked applications.
Submitted by: Sebastian Huber <sebastian.huber@embedded-brains.de>
MFC after: 2 weeks
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* Add RB_FOREACH_FROM() which continues traversal *at*
the y-node provided. There is no pre-increment.
* Nuke RB_FOREACH_SAFE as it was buggy; it would omit the final node.
* Replace RB_FOREACH_SAFE() with a working implementation
derived from RB_FOREACH_FROM().
The key observation is that we now only check the loop-control
variable, but still cache the next member pointer.
* Add RB_FOREACH_REVERSE_FROM() which continues backwards
traversal *at* the y-node provided. There is no pre-increment.
Typically this is used to back out of allocations made
whilst walking an RB-tree.
* Add RB_FOREACH_REVERSE_SAFE() which performs insertion and
deletion safe backwards traversal.
|
|
|
|
|
| |
specifying a temporary tree node pointer. It may be used in a
similar way to the *_SAFE() macros in <sys/queue.h>.
|
| |
|
|
|
|
| |
Submitted by: Andriy Gapon <avg@icyb.net.ua>
|
|
|
|
| |
Approved by: markm (mentor)
|
|
|
|
|
|
|
| |
for which there may not be an exact match.
Reviewed by: glebius, julian
Approved by: markm (mentor)
|
|
|
|
|
| |
of nothing. This prevents the compiler from complaining about empty
if statements when compiled with higher WARN levels.
|
| |
|
| |
|
| |
|
| |
|
|
Obtained from: OpenBSD
|