diff options
author | H. Peter Anvin (Intel) <hpa@zytor.com> | 2020-07-08 08:56:03 -0700 |
---|---|---|
committer | H. Peter Anvin (Intel) <hpa@zytor.com> | 2020-07-08 09:01:34 -0700 |
commit | c341ad7300afa3f71db5cd9813bbeebf32f9195b (patch) | |
tree | 2782b25d1c02108abba12904369a34d1f75357d6 /test/br3392667.asm | |
parent | f293842b8a5e85506d0e67e20cbe5b62b60e6e61 (diff) | |
download | nasm-c341ad7300afa3f71db5cd9813bbeebf32f9195b.tar.gz |
rbtree: implement rb_first(), rb_last() operations
Add operations to get the first and last entry in the tree,
respectively. Searching for 0 or ~UINT64_C(0) is not sufficient in the
presence of duplicated keys, and is more inefficient anyway.
rb_first() followed by rb_next() until NULL, or equivalently rb_last()
followed by rb_prev() until NULL, can be used to walk the tree in key
order (ascending or descending), including all duplicate key
entries.
Since this is a *threaded* tree now, this walk can safely free entires
as it goes along, as long as the whole tree is destroyed; once any one
entry has been freed, the tree is no longer valid for anything other
than proceeding with the same tree walk.
Signed-off-by: H. Peter Anvin (Intel) <hpa@zytor.com>
Diffstat (limited to 'test/br3392667.asm')
0 files changed, 0 insertions, 0 deletions