shaba/lvm2
1
0
Fork 0
mirror of git://sourceware.org/git/lvm2.git synced 2025-01-03 05:18:29 +03:00
Code Releases Activity
19,575 Commits 425 Branches 667 Tags 54 MiB
1ddc36b5b6
Commit Graph

19 Commits

Author SHA1 Message Date
Zdenek Kabelac
88681f05f1 radix_tree: api change 
Instead of using 'key state & key end' uint8_t* switch to use
void* key, & size_t keylen.  This allows easier adaptation with
lvm code base with way too much casting with every use of function.

Also correctly mark const buffers to avoid compiled warnings and
casting.

Adapt the only bcache user ATM for API change.

Adapt unit test to match changed API.
 2024-06-03 15:30:05 +02:00
Zdenek Kabelac
a13dfcbc77 cov: check for function result 2021-09-21 21:03:47 +02:00
Zdenek Kabelac
1b52451996 cov: mask some warning about leakage 
Mask false-positive leak report.
 2021-09-20 14:26:09 +02:00
Zdenek Kabelac
9721f3e0ff cov: test for fixture being NULL pointer 
Explicit check for teoretical NULL pointer passed as fixture.
 2021-09-20 14:26:09 +02:00
Joe Thornber
ba6d8a3195 [unit-test/radix-tree] Add a huge test case 
Derived from the logs that dct gave me.
 2018-09-20 14:38:34 +01:00
Joe Thornber
8b05f1f230 radix-tree: Fix bug in remove_prefix() 
Accidental decrement of the nr entries when a n256 didn't have the
entry in the first place.
 2018-08-20 15:23:40 +01:00
Zdenek Kabelac
c728d88e11 build: include configure.h 
It's important to consistenly include  configure.h as the 1st. header.
It containts #defines influencing behavior of other included header
files.
 2018-06-22 23:11:44 +02:00
Joe Thornber
40c1f7889f radix-tree: More debugging of remove 
There's now a pretty printer called radix_tree_dump()

n4, n16, and n48 weren't UNSETting the last entry after
sliding values down.
 2018-06-21 09:49:43 +01:00
Joe Thornber
c8cfbfa605 radix_tree: add new test case 
Check that value destructors are called by radix_tree_destroy()
 2018-06-21 09:49:25 +01:00
Joe Thornber
20b9746c5d radix-tree: FIx various bugs to do with removal 
Add radix_tree_is_well_formed() which does some sanity checking
of the tree.

Call the above a lot in the unit tests.

Fix revealed bugs.
 2018-06-21 09:49:08 +01:00
Joe Thornber
06c789eda1 radix-tree: fix some bugs in remove_prefix and iterate 
These weren't working if the prefix key was part of a prefix_chain.
 2018-05-30 14:21:27 +01:00
Joe Thornber
1924426ad1 radix-tree: radix_tree_iterate() 2018-05-29 17:58:58 +01:00
Joe Thornber
c2a8bbed3b radix-tree: radix_tree_remove_prefix() 2018-05-29 13:25:59 +01:00
Joe Thornber
0181c77e3f Merge branch '2018-05-29-radix-tree-iterate' into 2018-05-23-radix-tree-remove 2018-05-29 11:04:32 +01:00
Joe Thornber
033df741e2 data-struct/radix-tree: pass the value dtr into create. 
Rather than having to pass it into every method that removes items.
 2018-05-29 11:03:10 +01:00
Joe Thornber
6cd798f556 radix_tree_t: knock out some debug 2018-05-23 12:54:02 +01:00
Joe Thornber
b7fd8ac8eb radix_tree: add remove method 2018-05-23 12:48:06 +01:00
Joe Thornber
413488edc6 radix-tree: fix a function decl 2018-05-11 11:40:47 +01:00
Joe Thornber
576dd1fc41 radix-tree: First drop of radix tree. 
An implementation of an adaptive radix tree.  Has the following nice
properties:

  - At least as fast as the hash table
  - Uses less memory
  - You don't need to give an expected size when you create
  - It scales nicely (ie. no large reallocations like the hash table).
  - You can iterate the keys in lexicographical order.

Only insert and lookup are implemented so far.  Plus there's a lot
more performance to come.
 2018-05-11 06:10:01 +01:00