This is the mail archive of the gcc-bugs@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

[Bug middle-end/70773] Profiled sudoku solver slower due to lack of sdiv/udiv


https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70773

--- Comment #9 from PeteVine <tulipawn at gmail dot com> ---
It seems the LPATHBench exhibits the same issue.

https://raw.githubusercontent.com/logicchains/LPATHBench/master/c_fast.c

compiled the following way:

gcc -falign-functions=32 -std=gnu99 -O2 -mcpu=cortex-a5 -fomit-frame-pointer
-mfpu=neon -ftree-vectorize -ffast-math c_fast.c -o c_fast 

is faster than a profiled version. (10 runs avg. shows about 4% slowdown)

Once again division is present in the profiled assembly:

bl      __aeabi_idiv

Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]