ResizeNearest.hpp:
/*
* Copyright (c) 2018, NVIDIA CORPORATION. All rights reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
#pragma once
#include <NvInfer.h>
#include "plugin.hpp"
#include "serialize.hpp"
#include <cassert>
namespace {
constexpr const char* RESIZE_PLUGIN_VERSION{"001"};
constexpr const char* RESIZE_PLUGIN_NAME{"ResizeNearest"};
}
class ResizeNearestPlugin final : public onnx2trt::PluginV2 {
int _ndims;
float _scale[nvinfer1::Dims::MAX_DIMS];
nvinfer1::Dims _output_dims;
protected:
void deserialize(void const* serialData, size_t serialLength) {
deserializeBase(serialData, serialLength);
deserialize_value(&serialData, &serialLength, &_ndims);
deserialize_value(&serialData, &serialLength, &_scale);
}
size_t getSerializationSize() const override {
return serialized_size(_ndims) + serialized_size(_scale) + getBaseSerializationSize();
}
void serialize(void *buffer) const override {
serializeBase(buffer);
serialize_value(&buffer, _ndims);
serialize_value(&buffer, _scale);
}
public:
ResizeNearestPlugin(std::vector<float> const& scale)
: _ndims(scale.size()) {
assert(scale.size() <= nvinfer1::Dims::MAX_DIMS);
std::copy(scale.begin(), scale.end(), _scale);
}
ResizeNearestPlugin(void const* serialData, size_t serialLength) {
this->deserialize(serialData, serialLength);
}
virtual const char* getPluginType() const override { return RESIZE_PLUGIN_NAME; }
virtual void destroy() override { delete this; }
virtual nvinfer1::IPluginV2* clone() const override { return new ResizeNearestPlugin{std::vector<float>(_scale, _scale + _ndims)}; }
virtual const char* getPluginVersion() const override { return RESIZE_PLUGIN_VERSION; }
virtual void setPluginNamespace(const char* pluginNamespace) override {}
virtual const char* getPluginNamespace() const override { return ""; }
virtual int getNbOutputs() const override { return 1; }
virtual nvinfer1::Dims getOutputDimensions(int index,
const nvinfer1::Dims *inputs, int nbInputDims) override;
virtual int initialize() override;
int enqueue(int batchSize,
const void *const *inputs, void **outputs,
void *workspace, cudaStream_t stream) override;
};
class ResizeNearestPluginCreator : public nvinfer1::IPluginCreator
{
public:
ResizeNearestPluginCreator() {}
~ResizeNearestPluginCreator() {}
const char* getPluginName() const { return RESIZE_PLUGIN_NAME; }
const char* getPluginVersion() const { return RESIZE_PLUGIN_VERSION; }
const nvinfer1::PluginFieldCollection* getFieldNames() { std::cerr<< "Function not implemented" << std::endl; return nullptr; }
nvinfer1::IPluginV2* createPlugin(const char* name, const nvinfer1::PluginFieldCollection* fc) { std::cerr<< "Function not implemented" << std::endl; return nullptr; }
nvinfer1::IPluginV2* deserializePlugin(const char* name, const void* serialData, size_t serialLength) { return new ResizeNearestPlugin{serialData, serialLength}; }
void setPluginNamespace(const char* libNamespace) { mNamespace = libNamespace; }
const char* getPluginNamespace() const { return mNamespace.c_str(); }
private:
std::string mNamespace;
};
REGISTER_TENSORRT_PLUGIN(ResizeNearestPluginCreator);
ResizeNearest.cu:
/*
* Copyright (c) 2018, NVIDIA CORPORATION. All rights reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
#include <cuda_fp16.h>
#include <cassert>
#include <algorithm>
#include "ResizeNearest.hpp"
// TODO: Move this to a common header
inline bool is_CHW(nvinfer1::Dims const& dims) {
return (dims.nbDims == 3 &&
dims.type[0] == nvinfer1::DimensionType::kCHANNEL &&
dims.type[1] == nvinfer1::DimensionType::kSPATIAL &&
dims.type[2] == nvinfer1::DimensionType::kSPATIAL);
}
nvinfer1::Dims ResizeNearestPlugin::getOutputDimensions(int index,
const nvinfer1::Dims *inputDims,
int nbInputs) {
assert(nbInputs == 1);
nvinfer1::Dims const& input = inputDims[0];
assert(is_CHW(input));
assert(_ndims == 2);
assert(index == 0);
nvinfer1::Dims output;
output.nbDims = input.nbDims;
int s = 0;
for( int d=0; d<input.nbDims; ++d ) {
output.type[d] = input.type[d];
if( input.type[d] == nvinfer1::DimensionType::kSPATIAL ) {
output.d[d] = int(input.d[d] * _scale[s++]);
} else {
output.d[d] = input.d[d];
}
}
return output;
}
int ResizeNearestPlugin::initialize() {
_output_dims = this->getOutputDimensions(0, &this->getInputDims(0), 1);
assert(is_CHW(this->getInputDims(0)));
assert(is_CHW(_output_dims));
assert(_ndims == 2);
return 0;
}
template <typename Data>
__global__
void resize_nearest_kernel_2d(int nbatch,
float2 scale,
int2 osize,
Data const* idata, int istride, int ibatchstride,
Data* odata, int ostride, int obatchstride) {
int x0 = threadIdx.x + blockIdx.x * blockDim.x;
int y0 = threadIdx.y + blockIdx.y * blockDim.y;
int z0 = blockIdx.z;
for( int batch=z0; batch<nbatch; batch+=gridDim.z ) {
for( int oy=y0; oy<osize.y; oy+=blockDim.y*gridDim.y ) {
for( int ox=x0; ox<osize.x; ox+=blockDim.x*gridDim.x ) {
int ix = int(ox / scale.x);
int iy = int(oy / scale.y);
odata[batch * obatchstride + oy * ostride + ox] =
idata[batch * ibatchstride + iy * istride + ix];
}
}
}
}
int ResizeNearestPlugin::enqueue(int batchSize,
const void *const *inputs, void **outputs,
void *workspace, cudaStream_t stream) {
auto const& input_dims = this->getInputDims(0);
int nchan = input_dims.d[0];
switch( _ndims ) {
case 2: {
float2 scale = {_scale[1], _scale[0]};
int2 osize = {_output_dims.d[2], _output_dims.d[1]};
int istride = input_dims.d[2];
int ostride = _output_dims.d[2];
int ibatchstride = input_dims.d[1] * istride;
int obatchstride = _output_dims.d[1] * ostride;
dim3 block(32, 16);
dim3 grid((osize.x - 1) / block.x + 1,
(osize.y - 1) / block.y + 1,
std::min(batchSize * nchan, 65535));
if (getDataType()==nvinfer1::DataType::kFLOAT) {
resize_nearest_kernel_2d<<<grid, block, 0, stream>>>
(batchSize * nchan, scale, osize,
static_cast<float const*>( inputs[0]), istride, ibatchstride,
static_cast<float* >(outputs[0]), ostride, obatchstride);
} else {
resize_nearest_kernel_2d<<<grid, block, 0, stream>>>
(batchSize * nchan, scale, osize,
static_cast<__half const*>( inputs[0]), istride, ibatchstride,
static_cast<__half* >(outputs[0]), ostride, obatchstride);
}
return cudaGetLastError() != cudaSuccess;
}
default: return -1;
}
}
关于onnx-tensorrt工程代码结构,其他博主都写的很详细了,在这里对他们表示感谢。
在cu代码中最核心的部分就是enqueue和resize_nearest_kernel_2d函数。
在阅读enqueue函数时,一直对block和grid的设置有疑问,后来发现工程给的两个.cu例子中block都是设为
dim3 block(32, 16)
这样设置是基于性能最优的原则.
剩下的gird就好理解了,在这里它是分配3维的grid空间
dim3 grid((osize.x - 1) / block.x + 1, // (输出尺寸x-1)/block.x + 1
(osize.y - 1) / block.y + 1, // (输出尺寸y-1)/block.y + 1
std::min(batchSize * nchan, 65535)); // min(batchSize*nchan, 65535)
看下图就更明显了,实际上上述步骤是在gpu上分配执行的线程数量
接下来就是核函数了,其实这个resize的实现非常简单,就是隔像素取值,这样做缩放没有任何插值操作,当然在某种程度上也是满足使用需求的.但是核函数中三个for循环为什么这样设置,一直不是很明白.要是有知道的朋友可以指导下,我搞清楚了也会补充在这里.