Repository: netty/netty
File: buffer/src/main/java/io/netty/buffer/AdaptivePoolingAllocator.java (Java)

Code before:
            if (localFreeList != null && Thread.currentThread() == ownerThread) {
                localFreeList.push(startIndex);
                int state = this.state;
                if (state != AVAILABLE) {
                    updateStateOnLocalReleaseSegment(state, localFreeList);
                }
            } else {
                boolean segmentReturned = externalFreeList.offer(startIndex);
                assert segmentReturned;
                // implicit StoreLoad barrier from MPSC offer()
                int state = this.state;
                if (state != AVAILABLE) {
                    handleStateOnExternalReleaseSegment(state);
                }
            }
        }

        private void handleStateOnExternalReleaseSegment(int localFreeListSize) {
            // localFreeListSize is the number of segments that were in the local free list when
            // markToDeallocate() was called. Check if all segments have been returned.
            int totalFreeSegments = localFreeListSize + externalFreeList.size();
            if (totalFreeSegments == segments) {
                if (STATE.compareAndSet(this, localFreeListSize, DEALLOCATED)) {
                    deallocate();
                }
            }
        }

        private void updateStateOnLocalReleaseSegment(int previousLocalSize, IntStack localFreeList) {
            // Update the state to reflect the new local free list size.
            int newLocalSize = localFreeList.size();
            if (!STATE.compareAndSet(this, previousLocalSize, newLocalSize)) {
                // State was concurrently changed by another external releaseSegment that deallocated.
                return;
            }
            // Check if all segments have been returned.
            int totalFreeSegments = newLocalSize + externalFreeList.size();
            if (totalFreeSegments == segments) {
                if (STATE.compareAndSet(this, newLocalSize, DEALLOCATED)) {
                    deallocate();
                }
            }
        }

        @Override
        void markToDeallocate() {
            IntStack localFreeList = this.localFreeList;
            int localSize = localFreeList != null ? localFreeList.size() : 0;
            STATE.set(this, localSize);
            // Check if all segments have already been returned.
            int totalFreeSegments = localSize + externalFreeList.size();

Review comment (suggestion):
```suggestion
            deallocateIfNeeded(ocalFreeListSize);
```

Code after:
                if (state != AVAILABLE) {
                    updateStateOnLocalReleaseSegment(state, localFreeList);
                }
            } else {
                boolean segmentReturned = externalFreeList.offer(startIndex);
                assert segmentReturned;
                // implicit StoreLoad barrier from MPSC offer()
                int state = this.state;
                if (state != AVAILABLE) {
                    deallocateIfNeeded(state);
                }
            }
        }

        private void updateStateOnLocalReleaseSegment(int previousLocalSize, IntStack localFreeList) {
            int newLocalSize = localFreeList.size();
            boolean alwaysTrue = STATE.compareAndSet(this, previousLocalSize, newLocalSize);
            assert alwaysTrue : "this shouldn't happen unless double release in the local free list";
            deallocateIfNeeded(newLocalSize);
        }

        private void deallocateIfNeeded(int localSize) {
            // Check if all segments have been returned.
            int totalFreeSegments = localSize + externalFreeList.size();
            if (totalFreeSegments == segments && STATE.compareAndSet(this, localSize, DEALLOCATED)) {
                deallocate();
            }
        }

        @Override
        void markToDeallocate() {
            IntStack localFreeList = this.localFreeList;
            int localSize = localFreeList != null ? localFreeList.size() : 0;
            STATE.set(this, localSize);
            deallocateIfNeeded(localSize);
        }
    }

    private static final class BuddyChunk extends Chunk implements IntConsumer {
        private static final int MIN_BUDDY_SIZE = 32768;
        private static final byte IS_CLAIMED = (byte) (1 << 7);
        private static final byte HAS_CLAIMED_CHILDREN = 1 << 6;
        private static final byte SHIFT_MASK = ~(IS_CLAIMED | HAS_CLAIMED_CHILDREN);
        private static final int PACK_OFFSET_MASK = 0xFFFF;
        private static final int PACK_SIZE_SHIFT = Integer.SIZE - Integer.numberOfLeadingZeros(PACK_OFFSET_MASK);

        private final MpscIntQueue freeList;
        // The bits of each buddy: [1: is claimed][1: has claimed children][30: MIN_BUDDY_SIZE shift to get size]
        private final byte[] buddies;
        private final int freeListCapacity;