> The problem with C++ is in fold as we now have to disable the
> optimization
> which converted "a >= b ? b : a" to MIN_EXPR.
Which begs the question of why it doesn't happen when we get into
the tree optimizers and have lvalues there.
r~
On May 6, 2005, at 9:27 AM, chris jefferson wrote:
Michael Cieslinski wrote:
Consider the following short program:
#include
void Tst1(short* __restrict__ SrcP, short* __restrict__ MinP,
int Len)
{
for (int x=0; x
MinP[x] = SrcP[x]
}
void Tst2(short* __restr
Michael Cieslinski wrote:
Consider the following short program:
#include
void Tst1(short* __restrict__ SrcP, short* __restrict__ MinP, int Len)
{
for (int x=0; x
MinP[x] = SrcP[x]
}
void Tst2(short* __restrict__ SrcP, short* __restrict__ MinP, int Len)
"Michael Cieslinski" <[EMAIL PROTECTED]> writes:
| Consider the following short program:
|
| #include
|
| void Tst1(short* __restrict__ SrcP, short* __restrict__ MinP, int Len)
| {
| for (int x=0; xhttp://gcc.gnu.org/bugzilla/
for missed optimization.
-- Gaby
Consider the following short program:
#include
void Tst1(short* __restrict__ SrcP, short* __restrict__ MinP, int Len)
{
for (int x=0; x
