simplify encoding/decoding

Author: lukesandberg

turbopack/crates/turbo-tasks-backend/src/backend/lazy_tail.rs

@@ -191,16 +191,7 @@ impl LazyTail {
     /// `trailing_zeros` / `count_ones` but no built-in set-bit iterator;
     /// `bits &= bits - 1` is the canonical equivalent.
     #[inline]
-    fn sum_padded_sizes(mask: u32) -> usize {
-        Self::sum_padded_sizes_for_bits(mask)
-    }
-
-    /// Public alias of `sum_padded_sizes` so the macro-generated decode
-    /// path can preallocate exactly enough tail capacity for the
-    /// bitmap-prefixed wire format. The macro reads the wire bitmap, then
-    /// asks how many tail bytes the eventual payloads will occupy.
-    #[inline]
-    pub(crate) fn sum_padded_sizes_for_bits(mut mask: u32) -> usize {
+    fn sum_padded_sizes(mut mask: u32) -> usize {
         let mut offset = 0usize;
         while mask != 0 {
             let bit_idx = mask.trailing_zeros();

turbopack/crates/turbo-tasks-backend/src/backend/task_storage.rs

@@ -398,23 +398,6 @@ impl TaskStorage {
         target_total.min(max_total)
     }
 
-    /// Pre-grow the tail to fit `min_tail_bytes` total before a batch
-    /// of `lazy_insert`s — used by the macro-generated decode path to
-    /// avoid N reallocs as N payloads install. Wraps the private
-    /// `grow_to` (which has the same contract) with a stable
-    /// `pub(crate)` symbol so the macro doesn't have to depend on
-    /// private impl details.
-    ///
-    /// # Safety
-    /// Same as [`Self::grow_to`]: no outstanding `&mut TaskStorageInner`
-    /// reference may exist when this returns, because the realloc
-    /// relocates the buffer.
-    #[inline]
-    pub(crate) unsafe fn grow_to_for_decode(&mut self, min_tail_bytes: usize) {
-        // SAFETY: forwarded caller contract.
-        unsafe { self.grow_to(min_tail_bytes) }
-    }
-
     /// Grow the allocation so the tail has at least `min_tail_bytes`
     /// capacity. Uses `mi_good_size` to pre-round to the allocator bin.
     ///