mirror of
https://github.com/opencv/opencv.git
synced 2024-11-27 12:40:05 +08:00
160 lines
5.5 KiB
C++
160 lines
5.5 KiB
C++
/*M///////////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
|
|
//
|
|
// By downloading, copying, installing or using the software you agree to this license.
|
|
// If you do not agree to this license, do not download, install,
|
|
// copy or use the software.
|
|
//
|
|
//
|
|
// License Agreement
|
|
// For Open Source Computer Vision Library
|
|
//
|
|
// Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
|
|
// Copyright (C) 2009, Willow Garage Inc., all rights reserved.
|
|
// Third party copyrights are property of their respective owners.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without modification,
|
|
// are permitted provided that the following conditions are met:
|
|
//
|
|
// * Redistribution's of source code must retain the above copyright notice,
|
|
// this list of conditions and the following disclaimer.
|
|
//
|
|
// * Redistribution's in binary form must reproduce the above copyright notice,
|
|
// this list of conditions and the following disclaimer in the documentation
|
|
// and/or other materials provided with the distribution.
|
|
//
|
|
// * The name of the copyright holders may not be used to endorse or promote products
|
|
// derived from this software without specific prior written permission.
|
|
//
|
|
// This software is provided by the copyright holders and contributors "as is" and
|
|
// any express or implied warranties, including, but not limited to, the implied
|
|
// warranties of merchantability and fitness for a particular purpose are disclaimed.
|
|
// In no event shall the Intel Corporation or contributors be liable for any direct,
|
|
// indirect, incidental, special, exemplary, or consequential damages
|
|
// (including, but not limited to, procurement of substitute goods or services;
|
|
// loss of use, data, or profits; or business interruption) however caused
|
|
// and on any theory of liability, whether in contract, strict liability,
|
|
// or tort (including negligence or otherwise) arising in any way out of
|
|
// the use of this software, even if advised of the possibility of such damage.
|
|
//
|
|
//M*/
|
|
|
|
#include "test_precomp.hpp"
|
|
|
|
TestCompact::TestCompact(std::string testName_, NCVTestSourceProvider<Ncv32u> &src_,
|
|
Ncv32u length_, Ncv32u badElem_, Ncv32u badElemPercentage_)
|
|
:
|
|
NCVTestProvider(testName_),
|
|
src(src_),
|
|
length(length_),
|
|
badElem(badElem_),
|
|
badElemPercentage(badElemPercentage_ > 100 ? 100 : badElemPercentage_)
|
|
{
|
|
}
|
|
|
|
|
|
bool TestCompact::toString(std::ofstream &strOut)
|
|
{
|
|
strOut << "length=" << length << std::endl;
|
|
strOut << "badElem=" << badElem << std::endl;
|
|
strOut << "badElemPercentage=" << badElemPercentage << std::endl;
|
|
return true;
|
|
}
|
|
|
|
|
|
bool TestCompact::init()
|
|
{
|
|
return true;
|
|
}
|
|
|
|
|
|
bool TestCompact::process()
|
|
{
|
|
NCVStatus ncvStat;
|
|
bool rcode = false;
|
|
|
|
NCVVectorAlloc<Ncv32u> h_vecSrc(*this->allocatorCPU.get(), this->length);
|
|
ncvAssertReturn(h_vecSrc.isMemAllocated(), false);
|
|
NCVVectorAlloc<Ncv32u> d_vecSrc(*this->allocatorGPU.get(), this->length);
|
|
ncvAssertReturn(d_vecSrc.isMemAllocated(), false);
|
|
|
|
NCVVectorAlloc<Ncv32u> h_vecDst(*this->allocatorCPU.get(), this->length);
|
|
ncvAssertReturn(h_vecDst.isMemAllocated(), false);
|
|
NCVVectorAlloc<Ncv32u> d_vecDst(*this->allocatorGPU.get(), this->length);
|
|
ncvAssertReturn(d_vecDst.isMemAllocated(), false);
|
|
NCVVectorAlloc<Ncv32u> h_vecDst_d(*this->allocatorCPU.get(), this->length);
|
|
ncvAssertReturn(h_vecDst_d.isMemAllocated(), false);
|
|
|
|
NCV_SET_SKIP_COND(this->allocatorGPU.get()->isCounting());
|
|
NCV_SKIP_COND_BEGIN
|
|
ncvAssertReturn(this->src.fill(h_vecSrc), false);
|
|
for (Ncv32u i=0; i<this->length; i++)
|
|
{
|
|
Ncv32u tmp = (h_vecSrc.ptr()[i]) & 0xFF;
|
|
tmp = tmp * 99 / 255;
|
|
if (tmp < this->badElemPercentage)
|
|
{
|
|
h_vecSrc.ptr()[i] = this->badElem;
|
|
}
|
|
}
|
|
NCV_SKIP_COND_END
|
|
|
|
NCVVectorAlloc<Ncv32u> h_dstLen(*this->allocatorCPU.get(), 1);
|
|
ncvAssertReturn(h_dstLen.isMemAllocated(), false);
|
|
Ncv32u bufSize;
|
|
ncvStat = nppsStCompactGetSize_32u(this->length, &bufSize, this->devProp);
|
|
ncvAssertReturn(NPPST_SUCCESS == ncvStat, false);
|
|
NCVVectorAlloc<Ncv8u> d_tmpBuf(*this->allocatorGPU.get(), bufSize);
|
|
ncvAssertReturn(d_tmpBuf.isMemAllocated(), false);
|
|
|
|
Ncv32u h_outElemNum_h = 0;
|
|
|
|
NCV_SKIP_COND_BEGIN
|
|
ncvStat = h_vecSrc.copySolid(d_vecSrc, 0);
|
|
ncvAssertReturn(ncvStat == NPPST_SUCCESS, false);
|
|
ncvStat = nppsStCompact_32u(d_vecSrc.ptr(), this->length,
|
|
d_vecDst.ptr(), h_dstLen.ptr(), this->badElem,
|
|
d_tmpBuf.ptr(), bufSize, this->devProp);
|
|
ncvAssertReturn(ncvStat == NPPST_SUCCESS, false);
|
|
ncvStat = d_vecDst.copySolid(h_vecDst_d, 0);
|
|
ncvAssertReturn(ncvStat == NPPST_SUCCESS, false);
|
|
|
|
ncvStat = nppsStCompact_32u_host(h_vecSrc.ptr(), this->length, h_vecDst.ptr(), &h_outElemNum_h, this->badElem);
|
|
ncvAssertReturn(ncvStat == NPPST_SUCCESS, false);
|
|
NCV_SKIP_COND_END
|
|
|
|
//bit-to-bit check
|
|
bool bLoopVirgin = true;
|
|
|
|
NCV_SKIP_COND_BEGIN
|
|
if (h_dstLen.ptr()[0] != h_outElemNum_h)
|
|
{
|
|
bLoopVirgin = false;
|
|
}
|
|
else
|
|
{
|
|
for (Ncv32u i=0; bLoopVirgin && i < h_outElemNum_h; i++)
|
|
{
|
|
if (h_vecDst.ptr()[i] != h_vecDst_d.ptr()[i])
|
|
{
|
|
bLoopVirgin = false;
|
|
}
|
|
}
|
|
}
|
|
NCV_SKIP_COND_END
|
|
|
|
if (bLoopVirgin)
|
|
{
|
|
rcode = true;
|
|
}
|
|
|
|
return rcode;
|
|
}
|
|
|
|
|
|
bool TestCompact::deinit()
|
|
{
|
|
return true;
|
|
}
|