blob: 9c95382632e19d25a65ba5546ffac4a5bc3a89d1 [file] [log] [blame]
Geoff Lang5063f552014-07-23 16:27:31 -04001//
2// Copyright (c) 2014 The ANGLE Project Authors. All rights reserved.
3// Use of this source code is governed by a BSD-style license that can be
4// found in the LICENSE file.
5//
6
Jamie Madill74ba76c2015-02-09 10:31:23 -05007#include "common/MemoryBuffer.h"
Geoff Lang5063f552014-07-23 16:27:31 -04008
9#include <algorithm>
10#include <cstdlib>
11
Jamie Madill74ba76c2015-02-09 10:31:23 -050012#include "common/debug.h"
13
Jamie Madill9f9b1d22017-03-06 18:25:22 -050014namespace angle
Geoff Lang5063f552014-07-23 16:27:31 -040015{
16
Jamie Madill9f9b1d22017-03-06 18:25:22 -050017// MemoryBuffer implementation.
18MemoryBuffer::MemoryBuffer() : mSize(0), mData(nullptr)
Geoff Lang5063f552014-07-23 16:27:31 -040019{
20}
21
22MemoryBuffer::~MemoryBuffer()
23{
24 free(mData);
Jamie Madill9f9b1d22017-03-06 18:25:22 -050025 mData = nullptr;
Geoff Lang5063f552014-07-23 16:27:31 -040026}
27
28bool MemoryBuffer::resize(size_t size)
29{
30 if (size == 0)
31 {
Jamie Madillcc002392014-09-09 10:21:56 -040032 free(mData);
Jamie Madill9f9b1d22017-03-06 18:25:22 -050033 mData = nullptr;
Jamie Madillcc002392014-09-09 10:21:56 -040034 mSize = 0;
Bruce Dawson36e86232014-12-01 16:48:23 -050035 return true;
Geoff Lang5063f552014-07-23 16:27:31 -040036 }
Bruce Dawson36e86232014-12-01 16:48:23 -050037
38 if (size == mSize)
Geoff Lang5063f552014-07-23 16:27:31 -040039 {
Bruce Dawson36e86232014-12-01 16:48:23 -050040 return true;
Geoff Lang5063f552014-07-23 16:27:31 -040041 }
42
Bruce Dawson36e86232014-12-01 16:48:23 -050043 // Only reallocate if the size has changed.
44 uint8_t *newMemory = reinterpret_cast<uint8_t*>(malloc(sizeof(uint8_t) * size));
Jamie Madill9f9b1d22017-03-06 18:25:22 -050045 if (newMemory == nullptr)
Bruce Dawson36e86232014-12-01 16:48:23 -050046 {
47 return false;
48 }
49
50 if (mData)
51 {
52 // Copy the intersection of the old data and the new data
53 std::copy(mData, mData + std::min(mSize, size), newMemory);
54 free(mData);
55 }
56
57 mData = newMemory;
58 mSize = size;
59
Geoff Lang5063f552014-07-23 16:27:31 -040060 return true;
61}
62
63size_t MemoryBuffer::size() const
64{
65 return mSize;
66}
67
68const uint8_t *MemoryBuffer::data() const
69{
70 return mData;
71}
72
73uint8_t *MemoryBuffer::data()
74{
Jamie Madillee009b82014-09-19 13:17:51 -040075 ASSERT(mData);
Geoff Lang5063f552014-07-23 16:27:31 -040076 return mData;
77}
78
Jamie Madill9c9b40a2017-04-26 16:31:57 -040079void MemoryBuffer::fill(uint8_t datum)
80{
81 if (!empty())
82 {
83 std::fill(mData, mData + mSize, datum);
84 }
85}
86
Jamie Madill9f9b1d22017-03-06 18:25:22 -050087// ScratchBuffer implementation.
88
89ScratchBuffer::ScratchBuffer(uint32_t lifetime) : mLifetime(lifetime), mResetCounter(lifetime)
90{
Geoff Lang5063f552014-07-23 16:27:31 -040091}
Jamie Madill9f9b1d22017-03-06 18:25:22 -050092
93ScratchBuffer::~ScratchBuffer()
94{
95}
96
97bool ScratchBuffer::get(size_t requestedSize, MemoryBuffer **memoryBufferOut)
98{
99 if (mScratchMemory.size() == requestedSize)
100 {
101 mResetCounter = mLifetime;
102 *memoryBufferOut = &mScratchMemory;
103 return true;
104 }
105
106 if (mScratchMemory.size() > requestedSize)
107 {
108 tick();
109 }
110
111 if (mResetCounter == 0 || mScratchMemory.size() < requestedSize)
112 {
113 mScratchMemory.resize(0);
114 if (!mScratchMemory.resize(requestedSize))
115 {
116 return false;
117 }
118 mResetCounter = mLifetime;
119 }
120
121 ASSERT(mScratchMemory.size() >= requestedSize);
122
123 *memoryBufferOut = &mScratchMemory;
124 return true;
125}
126
127void ScratchBuffer::tick()
128{
129 if (mResetCounter > 0)
130 {
131 --mResetCounter;
132 }
133}
134
135void ScratchBuffer::clear()
136{
137 mResetCounter = mLifetime;
138 mScratchMemory.resize(0);
139}
140
141} // namespace angle