mirror of https://github.com/alibaba/MNN.git
65 lines
1.7 KiB
C++
65 lines
1.7 KiB
C++
//
|
|
// BufferPool.cpp
|
|
// MNN
|
|
//
|
|
// Created by MNN on 2019/02/28.
|
|
// Copyright © 2018, Alibaba Group Holding Limited
|
|
//
|
|
|
|
#include "backend/opencl/core/BufferPool.hpp"
|
|
namespace MNN {
|
|
namespace OpenCL {
|
|
cl::Buffer* BufferPool::alloc(size_t size, bool separate) {
|
|
if (!separate) {
|
|
auto iter = mFreeList.lower_bound(size);
|
|
if (iter != mFreeList.end()) {
|
|
auto buffer = iter->second->buffer.get();
|
|
mFreeList.erase(iter);
|
|
return buffer;
|
|
}
|
|
}
|
|
std::shared_ptr<Node> node(new Node);
|
|
cl_int ret = CL_SUCCESS;
|
|
mTotalSize += size;
|
|
node->size = size;
|
|
node->buffer.reset(new cl::Buffer(mContext, mFlag, size, NULL, &ret));
|
|
if (nullptr == node->buffer.get() || ret != CL_SUCCESS) {
|
|
MNN_ERROR("Alloc Buffer %lu error, code:%d \n", size, ret);
|
|
return nullptr;
|
|
}
|
|
mAllBuffer.insert(std::make_pair(node->buffer.get(), node));
|
|
|
|
return node->buffer.get();
|
|
}
|
|
|
|
void BufferPool::recycle(cl::Buffer* buffer, bool release) {
|
|
auto iter = mAllBuffer.find(buffer);
|
|
if (iter == mAllBuffer.end()) {
|
|
MNN_ERROR("Error for recycle buffer\n");
|
|
return;
|
|
}
|
|
if (release) {
|
|
mAllBuffer.erase(iter);
|
|
return;
|
|
}
|
|
mFreeList.insert(std::make_pair(iter->second->size, iter->second));
|
|
}
|
|
|
|
void BufferPool::clear() {
|
|
mFreeList.clear();
|
|
mAllBuffer.clear();
|
|
mTotalSize = 0;
|
|
}
|
|
|
|
void BufferPool::releaseFreeList() {
|
|
for(auto mf : mFreeList){
|
|
auto iter = mAllBuffer.find(mf.second->buffer.get());
|
|
if (iter != mAllBuffer.end()) {
|
|
mAllBuffer.erase(iter);
|
|
}
|
|
}
|
|
mFreeList.clear();
|
|
}
|
|
} // namespace OpenCL
|
|
} // namespace MNN
|