How does one get the feedback-directed optimization (FDO) flags to work with FreeBASIC programs? The flags are: -fprofile-generate -fprofile-use The flag -fprofile-generate should be used first but it throws a bunch of errors: Program2.o:fake:(.text+0x15): undefined reference to `__gcov_indirect_cal...

deltarho[1859] wrote:@Provoni

'#Resource "'<filename.rc>"

@PaulSquires

The Build Listbox is misbehaving - it closes immediately on releasing the left mouse button. As a workaround, I am changing the default build to enable me to make a change.

Tyvm!

How does one add an icon to a program?

With FbEdit I include a .rc file but this does not seem to work with WinFBE?

Thank you PaulSquires for all your wonderful work!

deltarho[1859] wrote: Am I missing something?

Loop unrolling, higher optimization level?

I am currently comparing the two and the results are a bit odd. Using 64-bit and "-s gui -gen GCC -O max -Wc -march=native,-funroll-loops,-ffast-math" with a fully multi-threaded 40.000+ lines program on a dual CPU workstation with 40 threads: 8.1 is only faster than 5.2 when all or nearly...

Thank you for these tests deltarho[1859].

Provoni - simple change makes your rng more random Sub ShowBits32( p as any ptr, Newline As boolean = true) '' use ScreenRes w,h, 32 Dim As ulong I, AryFG(3), AryBG(3) var oldcol = color() AryFG(0) = RGB(200,200,200) AryFG(1) = RGB(255,0,0) AryFG(2) = RGB(0,255,0) AryFG(3) = RGB(0,96,255) AryBG(0) ...

A Natural Prime-Generating Recurrence: https://cs.uwaterloo.ca/journals/JIS/VOL11/Rowland/rowland21.pdf function gcd(byval a as longint,byval b as longint)as longint do while b<>0 var t=b b=a mod b a=t loop return a end function screenres 640,480,32 dim as longint p1,p2,i,j p1=7 for i=2 to 10000000 ...

Hey Lothar,

Thank you for the updates.

Is it possible to use/have a spacer line between menu items?

Prime numbers are emergent from a rule imposed on the natural numbers. I say that prime numbers come in different orders such that the lower orders are prime to the higher orders: Order 0 prime: 1 (is prime to order 1) Order 1 primes: 2, 3, 5, 7, 11, etc... (are prime to order 2) Order 2 primes: 4, ...

In the opening post replace dim as ulongint i,j with dim as ulongint i dim shared as ulongint j and the loop is no longer optimized out. Compiled with -gen gcc -Wc -O3 Interesting! Is that because it allows scenarios in which the compiler is not able to see/determine if the shared variable is used ...

Removing something because it has no obvious functionality is the most ridiculous type of "optimization" I've ever heard of And it especially attempts to determine the functionality in terms of the user (or the observer in quantum mechanics). But if you add a timer to time the loop it is ...

It is a good article but there are odd dogmatic remarks such as: But I get better performance with -funroll-loops -fomg-optimize! No, people only think they do because someone has convinced them that more flags are better. Aggressive flags will only hurt applications when used system-wide. Even the ...

Hey all, Consider the code down below. When compiling it with GCC -O3 the program finishes instantly. However, when you comment out the "print j", the program runs for a long time. That is because at O3 the compiler decided that the for loop serves no obvious function. Though it still migh...