我正在尝试在 C++ 中实现一个定点类,但我遇到了性能问题。我已将问题简化为浮点类型的简单包装器,但它仍然很慢。我的问题是 - 为什么编译器无法完全优化它?
“浮动”版本比“浮动”版本快 50%。为什么?!
(我使用 Visual C++ 2008,测试了所有可能的编译器选项,当然是发布配置)。
请看下面的代码:
#include <cstdio>
#include <cstdlib>
#include "Clock.h" // just for measuring time
#define real Float // Option 1
//#define real float // Option 2
struct Float
{
private:
float value;
public:
Float(float value) : value(value) {}
operator float() { return value; }
Float& operator=(const Float& rhs)
{
value = rhs.value;
return *this;
}
Float operator+ (const Float& rhs) const
{
return Float( value + rhs.value );
}
Float operator- (const Float& rhs) const
{
return Float( value - rhs.value );
}
Float operator* (const Float& rhs) const
{
return Float( value * rhs.value );
}
bool operator< (const Float& rhs) const
{
return value < rhs.value;
}
};
struct Point
{
Point() : x(0), y(0) {}
Point(real x, real y) : x(x), y(y) {}
real x;
real y;
};
int main()
{
// Generate data
const int N = 30000;
Point points[N];
for (int i = 0; i < N; ++i)
{
points[i].x = (real)(640.0f * rand() / RAND_MAX);
points[i].y = (real)(640.0f * rand() / RAND_MAX);
}
real limit( 20 * 20 );
// Check how many pairs of points are closer than 20
Clock clk;
int count = 0;
for (int i = 0; i < N; ++i)
{
for (int j = i + 1; j < N; ++j)
{
real dx = points[i].x - points[j].x;
real dy = points[i].y - points[j].y;
real d2 = dx * dx + dy * dy;
if ( d2 < limit )
{
count++;
}
}
}
double time = clk.time();
printf("%d\n", count);
printf("TIME: %lf\n", time);
return 0;
}