On 8 April 2013 11:59, Manu <turkeyman@gmail.com> wrote:
On 8 April 2013 19:41, Iain Buclaw <ibuclaw@ubuntu.com> wrote:
On 8 April 2013 10:06, Timon Gehr <timon.gehr@gmx.ch> wrote:
On 04/08/2013 10:29 AM, Iain Buclaw wrote:
On 6 April 2013 12:09, bearophile <bearophileHUGS@lycos.com
<mailto:bearophileHUGS@lycos.com>> wrote:

    I remember Walter saying two or more times that the semantics of D
    offers some optimization opportunities that probably are not yet
    used to try to reduce the run-time of D programs. Is Walter willing
    to write down a list of such opportunities? (Ideas from other
    persons are welcome). Maybe some LDC/GDC developer will make the
    GCC/LLVM back-ends use them. The implementation of those ideas will
    require some time, so later it's better to put the list in the D wiki.

    Bye,
    bearophile



This information could possibly be helpful.  Though given that most of
(gdc) codegen is on par with g++, there's probably not much on the list
that isn't already detected by the backend optimisation passes.


--
Iain Buclaw

*(p < e ? p++ : p) = (c & 0x0f) + '0';

Does GDC use the additional type information for optimization? Eg. if something is immutable, then aliasing issues do not have to be considered for it when reading and writing through multiple pointers repeatedly.

It uses some type information, eg:

const/immutable/wild  -> qualified const.
shared -> qualified volatile.
shared + const/wild -> qualified const/volatile.


Done nothing in regards to C 'restrict' optimisations.  However the D array .ptr type could also be considered 'restrict' also.

Yes, I was just about to bring up __restrict, there is probably good opportunity for that.
Why do you suppose .ptr is restrict? One problem with D's slicing is it's very hard to assume __restrict on basically any arrays.
I feel like 'scope' might imply a __restrict input... although the relationship is kinda backwards, so maybe not...


At least, many array operations, eg:  a[] += b[].  Require the arrays not to be overlapping, so could do some optimisations based around that knowledge.

 
How about pure? Is GDC able to factor pure function calls with the same arguments outside of loops, or eliminate consecutive calls? It's really tedious to do this by hand, and breaks code continuity. Particularly important in a language that supports properties, since they'll be accessed consecutively all the time.


Only builtins are pure in the sense of 'C'.  Even functions considered PUREstrong by the frontend may update an internal state, so the rules just don't apply.  Except for maybe global functions...   In any case, the only benefit you can reap from 'D pure' functions are that they are more likely to be const-folded / inlined.

 
What about immutable? You said it qualifies const, which in C++ is absolutely meaningless in terms of optimisation potential; just because something is const, the source of the pointer can certainly be non-const somewhere else, which means C++ can't possibly factor const loads outside of loops, and must respect consecutive dereferences of the same pointer.
immutable in D should certainly be able to be factored outside loops, so it is more meaningful than const, and actually has real optimisation potential. Can GCC actually express an immutable value?


Other than saying that the type is const-qualified, the decl is set read-only, which only means to the backend that 'this decl may not be the lhs of an assignment.'
 
I remember there was a problem a while back that I brought to you about GDC generating stack frames unnecessarily for leaf functions, is that resolved? I haven't checked in a while.


It probably is if you re referring to the thread I'm thinking of.

Does GDC have access to a GDC-specific __restrict attribute to tag stuff manually? I'm struggling to think where it can be automated...

Nope, but that can be added in using our new attribute syntax. :~)


Regards
--
Iain Buclaw

*(p < e ? p++ : p) = (c & 0x0f) + '0';