forked from amazingfate/loongoffice
aef7feb3e6
"Find explicit casts from signed to unsigned integer in comparison against unsigned integer, where the cast is presumably used to avoid warnings about signed vs. unsigned comparisons, and could thus be replaced with o3tl::make_unsigned for clairty." (compilerplugins/clang/unsignedcompare.cxx) o3tl::make_unsigned requires its argument to be non-negative, and there is a chance that some original code like static_cast<sal_uInt32>(n) >= c used the explicit cast to actually force a (potentially negative) value of sal_Int32 to be interpreted as an unsigned sal_uInt32, rather than using the cast to avoid a false "signed vs. unsigned comparison" warning in a case where n is known to be non-negative. It appears that restricting this plugin to non- equality comparisons (<, >, <=, >=) and excluding equality comparisons (==, !=) is a useful heuristic to avoid such false positives. The only remainging false positive I found was 0288c8ffecff4956a52b9147d441979941e8b87f "Rephrase cast from sal_Int32 to sal_uInt32". But which of course does not mean that there were no further false positivies that I missed. So this commit may accidentally introduce some false hits of the assert in o3tl::make_unsigned. At least, it passed a full (Linux ASan+UBSan --enable-dbgutil) `make check && make screenshot`. It is by design that o3tl::make_unsigned only accepts signed integer parameter types (and is not defined as a nop for unsigned ones), to avoid unnecessary uses which would in general be suspicious. But the STATIC_ARRAY_SELECT macro in include/oox/helper/helper.hxx is used with both signed and unsigned types, so needs a little oox::detail::make_unsigned helper function for now. (The ultimate fix being to get rid of the macro in the first place.) Change-Id: Ia4adc9f44c70ad1dfd608784cac39ee922c32175 Reviewed-on: https://gerrit.libreoffice.org/c/core/+/87556 Tested-by: Jenkins Reviewed-by: Stephan Bergmann <sbergman@redhat.com>
131 lines
3.9 KiB
C++
131 lines
3.9 KiB
C++
/* -*- 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/.
|
|
*
|
|
* This file incorporates work covered by the following license notice:
|
|
*
|
|
* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
* contributor license agreements. See the NOTICE file distributed
|
|
* with this work for additional information regarding copyright
|
|
* ownership. The ASF licenses this file to you under the Apache
|
|
* License, Version 2.0 (the "License"); you may not use this file
|
|
* except in compliance with the License. You may obtain a copy of
|
|
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
|
|
*/
|
|
|
|
#include <sal/config.h>
|
|
|
|
#include <o3tl/safeint.hxx>
|
|
|
|
#include <controller/SlsAnimationFunction.hxx>
|
|
|
|
namespace sd::slidesorter::controller {
|
|
|
|
//===== AnimationBezierFunction ===============================================
|
|
|
|
AnimationBezierFunction::AnimationBezierFunction (
|
|
const double nX1,
|
|
const double nY1)
|
|
: mnX1(nX1),
|
|
mnY1(nY1),
|
|
mnX2(1-nY1),
|
|
mnY2(1-nX1)
|
|
{
|
|
}
|
|
|
|
::basegfx::B2DPoint AnimationBezierFunction::operator() (const double nT)
|
|
{
|
|
return ::basegfx::B2DPoint(
|
|
EvaluateComponent(nT, mnX1, mnX2),
|
|
EvaluateComponent(nT, mnY1, mnY2));
|
|
}
|
|
|
|
double AnimationBezierFunction::EvaluateComponent (
|
|
const double nT,
|
|
const double nV1,
|
|
const double nV2)
|
|
{
|
|
const double nS (1-nT);
|
|
|
|
// While the control point values 1 and 2 are explicitly given the start
|
|
// and end values are implicitly given.
|
|
const double nV0 (0);
|
|
const double nV3 (1);
|
|
|
|
const double nV01 (nS*nV0 + nT*nV1);
|
|
const double nV12 (nS*nV1 + nT*nV2);
|
|
const double nV23 (nS*nV2 + nT*nV3);
|
|
|
|
const double nV012 (nS*nV01 + nT*nV12);
|
|
const double nV123 (nS*nV12 + nT*nV23);
|
|
|
|
const double nV0123 (nS*nV012 + nT*nV123);
|
|
|
|
return nV0123;
|
|
}
|
|
|
|
//===== AnimationParametricFunction ===========================================
|
|
|
|
AnimationParametricFunction::AnimationParametricFunction (const ParametricFunction& rFunction)
|
|
: maY()
|
|
{
|
|
const sal_Int32 nSampleCount (64);
|
|
|
|
// Sample the given parametric function.
|
|
::std::vector<basegfx::B2DPoint> aPoints;
|
|
aPoints.reserve(nSampleCount);
|
|
for (sal_Int32 nIndex=0; nIndex<nSampleCount; ++nIndex)
|
|
{
|
|
const double nT (nIndex/double(nSampleCount-1));
|
|
aPoints.emplace_back(rFunction(nT));
|
|
}
|
|
|
|
// Interpolate at evenly spaced points.
|
|
maY.clear();
|
|
maY.reserve(nSampleCount);
|
|
double nX0 (aPoints[0].getX());
|
|
double nY0 (aPoints[0].getY());
|
|
double nX1 (aPoints[1].getX());
|
|
double nY1 (aPoints[1].getY());
|
|
sal_Int32 nIndex (1);
|
|
for (sal_Int32 nIndex2=0; nIndex2<nSampleCount; ++nIndex2)
|
|
{
|
|
const double nX (nIndex2 / double(nSampleCount-1));
|
|
while (nX > nX1 && nIndex<nSampleCount)
|
|
{
|
|
nX0 = nX1;
|
|
nY0 = nY1;
|
|
nX1 = aPoints[nIndex].getX();
|
|
nY1 = aPoints[nIndex].getY();
|
|
++nIndex;
|
|
}
|
|
const double nU ((nX-nX1) / (nX0 - nX1));
|
|
const double nY (nY0*nU + nY1*(1-nU));
|
|
maY.push_back(nY);
|
|
}
|
|
}
|
|
|
|
double AnimationParametricFunction::operator() (const double nX)
|
|
{
|
|
const sal_Int32 nIndex0 (static_cast<sal_Int32>(nX * maY.size()));
|
|
const double nX0 (nIndex0 / double(maY.size()-1));
|
|
const sal_uInt32 nIndex1 (nIndex0 + 1);
|
|
const double nX1 (nIndex1 / double(maY.size()-1));
|
|
|
|
if (nIndex0<=0)
|
|
return maY[0];
|
|
else if (o3tl::make_unsigned(nIndex0)>=maY.size() || nIndex1>=maY.size())
|
|
return maY[maY.size()-1];
|
|
|
|
const double nU ((nX-nX1) / (nX0 - nX1));
|
|
return maY[nIndex0]*nU + maY[nIndex1]*(1-nU);
|
|
}
|
|
|
|
} // end of namespace ::sd::slidesorter::controller
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|