diff options
author | upstream source tree <ports@midipix.org> | 2015-03-15 20:14:05 -0400 |
---|---|---|
committer | upstream source tree <ports@midipix.org> | 2015-03-15 20:14:05 -0400 |
commit | 554fd8c5195424bdbcabf5de30fdc183aba391bd (patch) | |
tree | 976dc5ab7fddf506dadce60ae936f43f58787092 /gcc/testsuite/g++.dg/torture/pr36826.C | |
download | cbb-gcc-4.6.4-upstream.tar.bz2 cbb-gcc-4.6.4-upstream.tar.xz |
obtained gcc-4.6.4.tar.bz2 from upstream website;upstream
verified gcc-4.6.4.tar.bz2.sig;
imported gcc-4.6.4 source tree from verified upstream tarball.
downloading a git-generated archive based on the 'upstream' tag
should provide you with a source tree that is binary identical
to the one extracted from the above tarball.
if you have obtained the source via the command 'git clone',
however, do note that line-endings of files in your working
directory might differ from line-endings of the respective
files in the upstream repository.
Diffstat (limited to 'gcc/testsuite/g++.dg/torture/pr36826.C')
-rw-r--r-- | gcc/testsuite/g++.dg/torture/pr36826.C | 166 |
1 files changed, 166 insertions, 0 deletions
diff --git a/gcc/testsuite/g++.dg/torture/pr36826.C b/gcc/testsuite/g++.dg/torture/pr36826.C new file mode 100644 index 000000000..436220ba8 --- /dev/null +++ b/gcc/testsuite/g++.dg/torture/pr36826.C @@ -0,0 +1,166 @@ +template <class T> T CoinMax(register const T x1, register const T x2); +template <class T> T CoinMin(register const T x1, register const T x2); +class CoinIndexedVector; +class ClpModel { +protected: + double objectiveScale_; + double rhsScale_; + int numberRows_; + int numberColumns_; + double * rowActivity_; + double * columnActivity_; + double * dual_; + double * reducedCost_; + double* rowLower_; + double* rowUpper_; + double * rowObjective_; + double * columnLower_; + double * columnUpper_; + double * rowScale_; + double * columnScale_; + double * inverseRowScale_; + double * inverseColumnScale_; + int problemStatus_; + int secondaryStatus_; +}; +class ClpSimplex : public ClpModel { + void deleteRim(int getRidOfFactorizationData=2); + double upperOut_; + double dualTolerance_; + double primalTolerance_; + double * rowLowerWork_; + double * columnLowerWork_; + double * rowUpperWork_; + double * columnUpperWork_; + double * rowObjectiveWork_; + CoinIndexedVector * columnArray_[6]; + double * reducedCostWork_; + double * rowActivityWork_; + double * columnActivityWork_; + ClpSimplex * auxiliaryModel_; +}; +class CoinIndexedVector { +public: + void clear(); +}; +void ClpSimplex::deleteRim(int getRidOfFactorizationData) +{ + int numberRows=numberRows_; + int numberColumns=numberColumns_; + int i; + int numberPrimalScaled=0; + int numberPrimalUnscaled=0; + int numberDualScaled=0; + int numberDualUnscaled=0; + double scaleC = 1.0/objectiveScale_; + double scaleR = 1.0/rhsScale_; + if (!inverseColumnScale_) { + for (i=0; i<numberColumns; i++) + { + double scaleFactor = columnScale_[i]; + double valueScaled = columnActivityWork_[i]; + double lowerScaled = columnLowerWork_[i]; + double upperScaled = columnUpperWork_[i]; + if (lowerScaled>-1.0e20||upperScaled<1.0e20) { + if (valueScaled<lowerScaled-primalTolerance_|| valueScaled>upperScaled+primalTolerance_) + numberPrimalScaled++; + else + upperOut_ = CoinMax(upperOut_,CoinMin(valueScaled-lowerScaled,upperScaled-valueScaled)); + } + columnActivity_[i] = valueScaled*scaleFactor*scaleR; + double value = columnActivity_[i]; + if (value<columnLower_[i]-primalTolerance_) + numberPrimalUnscaled++; + else if (value>columnUpper_[i]+primalTolerance_) + numberPrimalUnscaled++; + double valueScaledDual = reducedCostWork_[i]; + if (valueScaled>columnLowerWork_[i]+primalTolerance_&&valueScaledDual>dualTolerance_) + numberDualScaled++; + if (valueScaled<columnUpperWork_[i]-primalTolerance_&&valueScaledDual<-dualTolerance_) + numberDualScaled++; + reducedCost_[i] = (valueScaledDual*scaleC)/scaleFactor; + double valueDual = reducedCost_[i]; + if (value>columnLower_[i]+primalTolerance_&&valueDual>dualTolerance_) + numberDualUnscaled++; + if (value<columnUpper_[i]-primalTolerance_&&valueDual<-dualTolerance_) + numberDualUnscaled++; + } + for (i=0; i<numberRows; i++) + { + double scaleFactor = rowScale_[i]; + double valueScaled = rowActivityWork_[i]; + double lowerScaled = rowLowerWork_[i]; + double upperScaled = rowUpperWork_[i]; + if (lowerScaled>-1.0e20||upperScaled<1.0e20) { if (valueScaled<lowerScaled-primalTolerance_|| valueScaled>upperScaled+primalTolerance_) numberPrimalScaled++; else upperOut_ = CoinMax(upperOut_,CoinMin(valueScaled-lowerScaled,upperScaled-valueScaled)); } + rowActivity_[i] = (valueScaled*scaleR)/scaleFactor; + double value = rowActivity_[i]; + if (value<rowLower_[i]-primalTolerance_) numberPrimalUnscaled++; + else if (value>rowUpper_[i]+primalTolerance_) numberPrimalUnscaled++; + double valueScaledDual = dual_[i]+rowObjectiveWork_[i]; + ; + if (valueScaled>rowLowerWork_[i]+primalTolerance_&&valueScaledDual>dualTolerance_) numberDualScaled++; + if (valueScaled<rowUpperWork_[i]-primalTolerance_&&valueScaledDual<-dualTolerance_) numberDualScaled++; + dual_[i] *= scaleFactor*scaleC; + double valueDual = dual_[i]; + if (rowObjective_) valueDual += rowObjective_[i]; + if (value>rowLower_[i]+primalTolerance_&&valueDual>dualTolerance_) numberDualUnscaled++; + if (value<rowUpper_[i]-primalTolerance_&&valueDual<-dualTolerance_) numberDualUnscaled++; + } + } + const double * inverseScale = inverseColumnScale_; + for (i=0; i<numberColumns; i++) + { + double scaleFactor = columnScale_[i]; + double valueScaled = columnActivityWork_[i]; + double lowerScaled = columnLowerWork_[i]; + double upperScaled = columnUpperWork_[i]; + if (lowerScaled>-1.0e20||upperScaled<1.0e20) { if (valueScaled<lowerScaled-primalTolerance_|| valueScaled>upperScaled+primalTolerance_) numberPrimalScaled++; else upperOut_ = CoinMax(upperOut_,CoinMin(valueScaled-lowerScaled,upperScaled-valueScaled)); } + columnActivity_[i] = valueScaled*scaleFactor*scaleR; + double value = columnActivity_[i]; + if (value<columnLower_[i]-primalTolerance_) numberPrimalUnscaled++; + else if (value>columnUpper_[i]+primalTolerance_) numberPrimalUnscaled++; + double valueScaledDual = reducedCostWork_[i]; + if (valueScaled>columnLowerWork_[i]+primalTolerance_&&valueScaledDual>dualTolerance_) numberDualScaled++; + if (valueScaled<columnUpperWork_[i]-primalTolerance_&&valueScaledDual<-dualTolerance_) numberDualScaled++; + reducedCost_[i] = (valueScaledDual*scaleC)*inverseScale[i]; + double valueDual = reducedCost_[i]; + if (value>columnLower_[i]+primalTolerance_&&valueDual>dualTolerance_) numberDualUnscaled++; + if (value<columnUpper_[i]-primalTolerance_&&valueDual<-dualTolerance_) numberDualUnscaled++; + } + inverseScale = inverseRowScale_; + for (i=0; i<numberRows; i++) + { + double scaleFactor = rowScale_[i]; + double valueScaled = rowActivityWork_[i]; + double lowerScaled = rowLowerWork_[i]; + double upperScaled = rowUpperWork_[i]; + if (lowerScaled>-1.0e20||upperScaled<1.0e20) { if (valueScaled<lowerScaled-primalTolerance_|| valueScaled>upperScaled+primalTolerance_) numberPrimalScaled++; else upperOut_ = CoinMax(upperOut_,CoinMin(valueScaled-lowerScaled,upperScaled-valueScaled)); } + rowActivity_[i] = (valueScaled*scaleR)*inverseScale[i]; + double value = rowActivity_[i]; + if (value<rowLower_[i]-primalTolerance_) numberPrimalUnscaled++; + else if (value>rowUpper_[i]+primalTolerance_) numberPrimalUnscaled++; + double valueScaledDual = dual_[i]+rowObjectiveWork_[i]; + ; + if (valueScaled>rowLowerWork_[i]+primalTolerance_&&valueScaledDual>dualTolerance_) numberDualScaled++; + if (valueScaled<rowUpperWork_[i]-primalTolerance_&&valueScaledDual<-dualTolerance_) numberDualScaled++; + dual_[i] *= scaleFactor*scaleC; + double valueDual = dual_[i]; + if (rowObjective_) valueDual += rowObjective_[i]; + if (value>rowLower_[i]+primalTolerance_&&valueDual>dualTolerance_) numberDualUnscaled++; + if (value<rowUpper_[i]-primalTolerance_&&valueDual<-dualTolerance_) numberDualUnscaled++; + } + if (numberPrimalUnscaled) { + if (numberDualUnscaled) + secondaryStatus_=4; + else + secondaryStatus_=2; + } + if (numberDualUnscaled) + secondaryStatus_=3; + int iRow,iColumn; + for (iRow=0; iRow<4; iRow++) + ; + for (iColumn=0; iColumn<2; iColumn++) + if (columnArray_[iColumn]) + columnArray_[iColumn]->clear(); +} |