Age | Commit message (Collapse) | Author | Files | Lines | |
---|---|---|---|---|---|
2022-10-14 | Fix fallback configuration on older MacOS versions | David Robillard | 1 | -1/+1 | |
2022-10-14 | Fix zix_sem_timed_wait() interval calculation | David Robillard | 1 | -0/+9 | |
2022-10-09 | Fix off-by-one error in assertion | David Robillard | 1 | -1/+1 | |
2022-09-02 | Improve test coverage | David Robillard | 2 | -5/+6 | |
2022-09-02 | Improve zix_ring_mlock() return status | David Robillard | 1 | -11/+16 | |
2022-09-02 | Factor out POSIX-style return pattern | David Robillard | 2 | -7/+12 | |
2022-09-01 | Simplify thread and semaphore status codes | David Robillard | 2 | -4/+9 | |
2022-08-19 | Avoid mixing signed and unsigned integers | David Robillard | 6 | -9/+9 | |
2022-08-19 | Simplify errno handling | David Robillard | 2 | -15/+12 | |
2022-08-19 | Move sem implementation out of header | David Robillard | 3 | -0/+238 | |
This avoids having platform conditionals in public headers, which causes build problems for dependants. | |||||
2022-08-18 | Add return status to zix_ring_mlock() | David Robillard | 1 | -4/+5 | |
2022-08-18 | Fix semaphore error handling | David Robillard | 1 | -0/+4 | |
Note that existing code which uses zix_sem_try_wait() may still compile against this change, but be incorrect! | |||||
2022-08-18 | Factor out converting errno codes to ZixStatus | David Robillard | 1 | -0/+31 | |
2022-08-18 | Reduce zix_tree_insert() complexity | David Robillard | 1 | -12/+6 | |
2022-08-18 | Reduce variable scope and mutability | David Robillard | 1 | -7/+6 | |
2022-08-18 | Remove debug printing from tree | David Robillard | 2 | -62/+6 | |
2022-08-18 | Handle trees with no destroy callback more gracefully | David Robillard | 1 | -10/+11 | |
2022-08-18 | Make all ring parameters const | David Robillard | 1 | -18/+22 | |
2022-08-18 | Add transactional ring API | David Robillard | 1 | -5/+39 | |
2022-08-12 | Fix ring thread safety | David Robillard | 1 | -25/+53 | |
The previous code was "probably fine" in practice, but was both missing some necessary synchronization, and using unnecessarily heavyweight barriers on Windows. Since this code conveniently has a 1:1 relationship between barriers and atomic accesses anyway, rewrite things to use an "atomic" interface closer to standard C11 and C++11. Harden things in the process, so that the thread-safety guarantees are followed, and hopefully clearer to see in the code (1 synchronized read of "their" index, then maybe 1 synchronized write of "your" index). Windows/MSVC annoyingly does not provide a suitable C API for this, so just ignore the existence of Windows on ARM and use x86/x64 Windows intrinsics to prevent compiler reordering (which is all that's required on those architectures). Note that MSVC can make some reordering guarantees about volatile variables, but: * Only with a certain option, /volatile:ms, which Microsoft "strongly recommend" against using. It is disabled by default (and painfully slow if enabled) on ARM. * This guarantee does not prevent reordering of access to other memory (only the volatile variables themselves), which is required by a ring buffer. So, deal with that case by using explicit read and write barriers like before, but only in the atomic abstractions. In the process, switch to more lightweight barriers, which should marginally improve performance on Windows. When MSVC adds stdatomic.h support, most of the platform-specific gunk here can go away entirely. | |||||
2022-08-12 | Simplify ring writing code | David Robillard | 1 | -6/+8 | |
The compiler is surely smart enough to factor out these common expressions, but I find this easier to read this way anyway. | |||||
2022-08-12 | Use a consistent error handling style | David Robillard | 1 | -6/+5 | |
2022-08-12 | Simplify ring space calculations | David Robillard | 1 | -14/+2 | |
It isn't necessary to branch here to avoid underflow. Essentially, the way that unsigned binary integers work "automatically" does what this code was doing. Note that these expressions only work for a ring buffer that, like this one, has a power of 2 (real) size and a maximum capacity 1 less than that. | |||||
2022-07-13 | Suppress new warnings in clang and clang-tidy 14 | David Robillard | 1 | -0/+1 | |
2022-06-28 | Move zix_strerror to library | David Robillard | 1 | -0/+28 | |
2022-06-28 | Use uppercase integer literal suffixes | David Robillard | 6 | -113/+112 | |
I give in. | |||||
2022-06-28 | Simplify dep5 file by adding license headers where possible | David Robillard | 1 | -0/+3 | |
2022-06-28 | Clean up build configuration | David Robillard | 4 | -17/+43 | |
2022-02-02 | Avoid fallthrough annotation on older GCC versions | David Robillard | 1 | -1/+1 | |
2022-01-14 | Fix hash insertion tombstone replacement case | David Robillard | 1 | -0/+1 | |
2021-12-17 | Suppress new warnings in clang-tidy 13 | David Robillard | 1 | -1/+2 | |
2021-10-27 | Compile but fail at runtime if aligned allocation is not supported | David Robillard | 1 | -1/+1 | |
2021-10-27 | Remove unnecessary include | David Robillard | 1 | -1/+0 | |
2021-10-27 | Improve hash table performance slightly | David Robillard | 1 | -6/+9 | |
2021-10-27 | Fix zix_digest64() to consume all input | David Robillard | 1 | -5/+5 | |
This was a copy-paste bug since the loop in zix_digest32() worked differently. As a result only the first block was considered, making the digest nearly useless for larger values. The tests didn't (and unfortunately still don't) catch this because the 64-bit digest algorithm incorporates the size itself. Fix this by changing the loop to work the same way as zix_digest32(), so hopefully something like this doesn't happen again. | |||||
2021-09-16 | Add a simple bump pointer allocator | David Robillard | 1 | -0/+161 | |
2021-09-14 | Add aligned allocation interface and use it in ZixBTree | David Robillard | 4 | -9/+132 | |
2021-09-14 | Make ZixAllocator a single flat struct | David Robillard | 5 | -61/+60 | |
I can never decide between these two patterns for polymorphic objects in C, but this one seems more appropriate here since it's more conducive to inheritance. | |||||
2021-09-13 | Correctly handle hash table reallocation failures | David Robillard | 1 | -8/+25 | |
2021-09-11 | Fix zix_btree_lower_bound() | David Robillard | 1 | -7/+8 | |
This condition was converted to an assertion in an over-eager session of code simplification and coverage testing. It turns out this does happen. | |||||
2021-09-10 | Fix C11 build | David Robillard | 1 | -3/+6 | |
2021-09-10 | Adopt REUSE machine-readable licensing standard | David Robillard | 8 | -120/+16 | |
2021-09-10 | Remove branches from zix_bitset_set() and zix_bitset_reset() | David Robillard | 1 | -14/+10 | |
2021-09-10 | Add custom allocator support | David Robillard | 5 | -84/+182 | |
2021-09-10 | Add nullability annotations | David Robillard | 2 | -0/+52 | |
This allows clang to issue warnings at compile time when null is passed to a non-null parameter. For public entry points, also add assertions to catch such issues when the compiler does not support this. | |||||
2021-09-10 | Rewrite ZixHash as a flat table with open addressing | David Robillard | 1 | -145/+258 | |
2021-09-10 | Replace CRC32 digest with more modern and appropriate algorithms | David Robillard | 1 | -100/+172 | |
This makes the hassle of platform-specific code go away, and instead uses portable implementations of relatively standard modern hash algorithms. CRC32 is not great as a hash function anyway, though it is very fast when hardware accelerated. | |||||
2021-09-10 | Fix cast alignment warnings in SSE4.2 digest code | David Robillard | 1 | -5/+29 | |
2021-09-10 | Add a user handle to destroy callback | David Robillard | 2 | -21/+30 | |
2021-09-10 | Simplify BTree implementation | David Robillard | 1 | -253/+388 | |