On 1/10/23 01:34, Stefan Kanthak wrote:
"Thomas Koenig" wrote:
On 09.01.23 12:35, Stefan Kanthak wrote:
20 superfluous instructions of the total 102 instructions!
The proper place for bug reports is https://gcc.gnu.org/bugzilla/ .
OUCH: there's NO proper place for bugs at all!
Feel free t
On Mon, Jan 9, 2023 at 4:42 PM Stefan Kanthak wrote:
>
> "Thomas Koenig" wrote:
>
> > On 09.01.23 12:35, Stefan Kanthak wrote:
> >> 20 superfluous instructions of the total 102 instructions!
> >
> > The proper place for bug reports is https://gcc.gnu.org/bugzilla/ .
>
> OUCH: there's NO proper pl
"Thomas Koenig" wrote:
> On 09.01.23 12:35, Stefan Kanthak wrote:
>> 20 superfluous instructions of the total 102 instructions!
>
> The proper place for bug reports is https://gcc.gnu.org/bugzilla/ .
OUCH: there's NO proper place for bugs at all!
> Feel free to submit these cases there.
I fee
Hello,
On Sun, Dec 18 2022, Mohamed Atef wrote:
> Hello,
>I am interested in working in this project during my free time, is
> understanding this https://gcc.gnu.org/wiki/LinkTimeOptimization
> A good starting point
That section of the Wiki is very old. You may find bits there that are
still
"Paul Koning" wrote:
>> On Jan 9, 2023, at 10:20 AM, Stefan Kanthak wrote:
>>
>> "Paul Koning" wrote:
>>
On Jan 9, 2023, at 7:20 AM, Stefan Kanthak wrote:
Hi,
GCC (and other C compilers too) support the widening multiplication
of i386/AMD64 processors, but DON
> On Jan 9, 2023, at 10:20 AM, Stefan Kanthak wrote:
>
> "Paul Koning" wrote:
>
>>> On Jan 9, 2023, at 7:20 AM, Stefan Kanthak wrote:
>>>
>>> Hi,
>>>
>>> GCC (and other C compilers too) support the widening multiplication
>>> of i386/AMD64 processors, but DON'T support their narrowing div
"Paul Koning" wrote:
>> On Jan 9, 2023, at 7:20 AM, Stefan Kanthak wrote:
>>
>> Hi,
>>
>> GCC (and other C compilers too) support the widening multiplication
>> of i386/AMD64 processors, but DON'T support their narrowing division:
>
> I wonder if this changed in the recent past.
> I have a pat
> On Jan 9, 2023, at 7:20 AM, Stefan Kanthak wrote:
>
> Hi,
>
> GCC (and other C compilers too) support the widening multiplication
> of i386/AMD64 processors, but DON'T support their narrowing division:
I wonder if this changed in the recent past. I have a pattern for this type of
thing i
LIU Hao wrote:
>在 2023/1/9 20:20, Stefan Kanthak 写道:
>> Hi,
>>
>> GCC (and other C compilers too) support the widening multiplication
>> of i386/AMD64 processors, but DON'T support their narrowing division:
>>
>>
>
> QWORD-DWORD division would change the behavior of your program.
[...]
> If DIV wa
在 2023/1/9 20:20, Stefan Kanthak 写道:
Hi,
GCC (and other C compilers too) support the widening multiplication
of i386/AMD64 processors, but DON'T support their narrowing division:
QWORD-DWORD division would change the behavior of your program.
Given:
```
uint32_t xdiv(uint64_t x, uin
Hi,
GCC (and other C compilers too) support the widening multiplication
of i386/AMD64 processors, but DON'T support their narrowing division:
--- demo.c ---
unsigned long long product(unsigned long multiplicand,
unsigned long multiplier)
{
return (unsigned long long
在 2023/1/9 19:48, Thomas Koenig via Gcc 写道:
On 09.01.23 12:35, Stefan Kanthak wrote:
20 superfluous instructions of the total 102 instructions!
The proper place for bug reports is https://gcc.gnu.org/bugzilla/ .
Feel free to submit these cases there.
Created https://gcc.gnu.org/bugzilla/show
On 09.01.23 12:35, Stefan Kanthak wrote:
20 superfluous instructions of the total 102 instructions!
The proper place for bug reports is https://gcc.gnu.org/bugzilla/ .
Feel free to submit these cases there.
Hi,
compile the following routine for the i386 processor,
with optimisation:
--- double.c ---
// IEEE-754 binary64 double-precision floating point
// binary64 != ±0.0 -> 0
// binary64 == +0.0 -> +1
// binary64 == -0.0 -> -1
int plusminus0(unsigned long long binary64)
{
if (binary64 != -bi
Hi,
compile the following 128-bit GCD routine for the AMD64 processor
with full optimization:
--- gcdti3.c ---
// Stein's algorithm: greatest common divisor
__uint128_t __gcdti3(__uint128_t p, __uint128_t q)
{
unsignedr, s = 0;
__uint128_t t;
if (p == 0)
return q;
i
Hi,
compile the following 64-bit GCD routine for the i386 processor,
with full optimization and the preprocessor macro CTZ defined:
--- gcddi3.c ---
// Stein's algorithm: greatest common divisor
unsigned long long __gcddi3(unsigned long long p, unsigned long long q)
{
unsigned r, s
16 matches
Mail list logo
