/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#include <basegfx/utils/systemdependentdata.hxx>
#include <config_fuzzers.h>
#include <math.h>
namespace basegfx
{
SystemDependentDataManager::SystemDependentDataManager()
{
}
SystemDependentDataManager::~SystemDependentDataManager()
{
}
} // namespace basegfx
namespace basegfx
{
SystemDependentData::SystemDependentData(
SystemDependentDataManager& rSystemDependentDataManager,
SDD_Type aSystemDependentDataType)
: mrSystemDependentDataManager(rSystemDependentDataManager)
, maSystemDependentDataType(aSystemDependentDataType)
, mnCalculatedCycles(0)
{
}
SystemDependentData::~SystemDependentData()
{
}
sal_uInt32 SystemDependentData::calculateCombinedHoldCyclesInSeconds() const
{
#if ENABLE_FUZZERS
return 0;
#endif
if(0 == mnCalculatedCycles)
{
const sal_Int64 nBytes(estimateUsageInBytes());
// tdf#129845 as indicator for no need to buffer trivial data, stay at and
// return zero. As border, use 450 bytes. For polygons, this means to buffer
// starting with ca. 50 points (GDIPLUS uses 9 bytes per coordinate). For
// Bitmap data this means to more or less always buffer (as it was before).
// For the future, a more sophisticated differentiation may be added
if(nBytes > 450)
{
// HoldCyclesInSeconds
const sal_uInt32 nSeconds = 60;
// default is Seconds (minimal is one)
sal_uInt32 nResult(0 == nSeconds ? 1 : nSeconds);
if(0 != nBytes)
{
// use sqrt to get some curved shape. With a default of 60s we get
// a single second at 3600 byte. To get close to 10mb, multiply by
// a corresponding scaling factor
const double fScaleToMB(3600.0 / (1024.0 * 1024.0 * 10.0));
// also use a multiplier to move the start point higher
const double fMultiplierSeconds(10.0);
// calculate
nResult = static_cast<sal_uInt32>((fMultiplierSeconds * nSeconds) / sqrt(nBytes * fScaleToMB));
// minimal value is 1
if(nResult < 1)
{
nResult = 1;
}
// maximal value is nSeconds
if(nResult > nSeconds)
{
nResult = nSeconds;
}
}
// set locally (once, on-demand created, non-zero)
const_cast<SystemDependentData*>(this)->mnCalculatedCycles = nResult;
}
}
return mnCalculatedCycles;
}
sal_Int64 SystemDependentData::estimateUsageInBytes() const
{
// default implementation has no idea
return 0;
}
} // namespace basegfx
namespace basegfx
{
SystemDependentDataHolder::SystemDependentDataHolder()
{
}
SystemDependentDataHolder::~SystemDependentDataHolder()
{
for(const auto& candidate : maSystemDependentReferences)
{
basegfx::SystemDependentData_SharedPtr aData(candidate.second.lock());
if(aData)
{
aData->getSystemDependentDataManager().endUsage(aData);
}
}
}
void SystemDependentDataHolder::addOrReplaceSystemDependentData(basegfx::SystemDependentData_SharedPtr& rData)
{
auto result(maSystemDependentReferences.find(rData->getSystemDependentDataType()));
if(result != maSystemDependentReferences.end())
{
basegfx::SystemDependentData_SharedPtr aData(result->second.lock());
if(aData)
{
aData->getSystemDependentDataManager().endUsage(aData);
}
maSystemDependentReferences.erase(result);
result = maSystemDependentReferences.end();
}
maSystemDependentReferences[rData->getSystemDependentDataType()] = rData;
rData->getSystemDependentDataManager().startUsage(rData);
}
SystemDependentData_SharedPtr SystemDependentDataHolder::getSystemDependentData(SDD_Type aType) const
{
basegfx::SystemDependentData_SharedPtr aRetval;
auto result(maSystemDependentReferences.find(aType));
if(result != maSystemDependentReferences.end())
{
aRetval = result->second.lock();
if(aRetval)
{
aRetval->getSystemDependentDataManager().touchUsage(aRetval);
}
else
{
const_cast< SystemDependentDataHolder* >(this)->maSystemDependentReferences.erase(result);
}
}
return aRetval;
}
} // namespace basegfx
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
↑ V547 Expression '0 != nBytes' is always true.