tidy

Author: Conor

src/batteries/geometric_stack.cxx

@@ -107,7 +107,7 @@ class geometric_stack {
     LF_ASSUME(push_bytes >= node_size);
     LF_ASSUME(push_bytes % node_size == 0);
 
-    // Optimized to just the subtrtaction because multiplication cancels the implicit division.
+    // Optimized to just the subtraction because multiplication cancels the implicit division.
     diff_int free_bytes = node_size * (m_hi - m_sp);
 
     if (push_bytes > free_bytes) [[unlikely]] {
@@ -148,7 +148,7 @@ class geometric_stack {
   }
 
   [[nodiscard]]
-  constexpr auto prepare_release() const noexcept -> release_t {
+  constexpr auto prepare_release() noexcept -> release_t {
 
     // Guard against null release
     if (m_ctrl != nullptr) {

src/batteries/slab_stack.cxx

@@ -138,7 +138,7 @@ class slab_stack {
   }
 
   [[nodiscard]]
-  constexpr auto prepare_release() const noexcept -> release_t {
+  constexpr auto prepare_release() noexcept -> release_t {
     // Guard against null ctrl (failed prior allocation in release()).
     if (m_ctrl != nullptr) {
       m_ctrl->sp_cache = m_sp;
@@ -165,6 +165,7 @@ class slab_stack {
 
   constexpr void acquire(checkpoint_t ckpt) noexcept {
     LF_ASSUME(empty());
+    LF_ASSUME(ckpt.m_ctrl != m_ctrl);
 
     if (ckpt.m_ctrl == nullptr) {
       return;