blob: aead1f2125146875aa56ff212e1f358edab893ed [file] [log] [blame]
// Copyright 2024 The Pigweed Authors
//
// Licensed under the Apache License, Version 2.0 (the "License"); you may not
// use this file except in compliance with the License. You may obtain a copy of
// the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
// License for the specific language governing permissions and limitations under
// the License.
#pragma once
#include "pw_allocator/block_allocator_base.h"
namespace pw::allocator {
/// Block allocator that uses a "last-fit" allocation strategy.
///
/// In this strategy, the allocator handles an allocation request by starting at
/// the end of the range of blocks and looking for the last one which can
/// satisfy the request.
///
/// This strategy may result in slightly better fragmentation than the
/// corresponding "first-fit" strategy, since even with alignment it will result
/// in at most one unused fragment before the allocated block.
template <typename OffsetType = uintptr_t,
size_t kPoisonInterval = 0,
size_t kAlign = alignof(OffsetType)>
class LastFitBlockAllocator
: public BlockAllocator<OffsetType, kPoisonInterval, kAlign> {
public:
using Base = BlockAllocator<OffsetType, kPoisonInterval, kAlign>;
using BlockType = typename Base::BlockType;
constexpr LastFitBlockAllocator() : Base() {}
explicit LastFitBlockAllocator(ByteSpan region) : Base(region) {}
private:
/// @copydoc Allocator::Allocate
BlockType* ChooseBlock(Layout layout) override {
// Search backwards for the last block that can hold this allocation.
for (auto* block : Base::rblocks()) {
if (BlockType::AllocLast(block, layout.size(), layout.alignment()).ok()) {
return block;
}
}
return nullptr;
}
};
} // namespace pw::allocator