blob: c88e3c1024153c0aee5e768bd6f208067b52a023 [file] [log] [blame]
Adam Lesinski6f6ceb72014-11-14 14:48:12 -08001/*
2 * Copyright (C) 2015 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
Adam Lesinski1ab598f2015-08-14 14:26:04 -070017#include "util/BigBuffer.h"
Adam Lesinski6f6ceb72014-11-14 14:48:12 -080018
19#include <algorithm>
20#include <memory>
21#include <vector>
22
23namespace aapt {
24
25void* BigBuffer::nextBlockImpl(size_t size) {
26 if (!mBlocks.empty()) {
27 Block& block = mBlocks.back();
28 if (block.mBlockSize - block.size >= size) {
29 void* outBuffer = block.buffer.get() + block.size;
30 block.size += size;
31 mSize += size;
32 return outBuffer;
33 }
34 }
35
36 const size_t actualSize = std::max(mBlockSize, size);
37
38 Block block = {};
39
40 // Zero-allocate the block's buffer.
41 block.buffer = std::unique_ptr<uint8_t[]>(new uint8_t[actualSize]());
42 assert(block.buffer);
43
44 block.size = size;
45 block.mBlockSize = actualSize;
46
47 mBlocks.push_back(std::move(block));
48 mSize += size;
49 return mBlocks.back().buffer.get();
50}
51
52} // namespace aapt