Re: HLA v1.68 is now available

From: Betov (betov_at_free.fr)
Date: 07/28/04

  • Next message: Alex McDonald: "Re: HLA v1.68 is now available"
    Date: 28 Jul 2004 09:04:24 GMT
    
    

    C <cc-news@hermes.mirlex.com> écrivait news:ZUANc.842$ld7.102@newsfe6-
    gui.ntli.net:

    > Randall Hyde wrote:
    >
    >
    >> Well, if you believe this then you're heading down the
    >> wrong path with displacement optimization just as you've
    >> headed down the wrong path with disassembly.
    >> Branch optimization has been proved to be an NP-Complete
    >> problem. As a result, no assembler is going to guarantee
    >> complete optimization of all the displacements. Therefore,
    >> they tend to use heuristics and iteration to get as good a
    >> job done as they can. If you think you can do it perfectly
    >> without trying all possibilities, you're wrong. If your
    >> heuristics don't involve multiple passes over the object
    >> code, then other assemblers will do a much better job
    >> of optimizing those branch displacements than you do.
    >> It's as simple as that.
    >>
    >> Unless, of course, you've managed to prove the
    >> open Computer Science question "does P=NP?"
    >
    > Luxasm optimises branches _without_ multiple passes over
    > the source code and complete optimisation is guaranteed,
    > how it achieves this I will leave you to guess for now :-P

    Glad to see that there are not only definitive
    idiots, around there. :)

    Good work. Betov.

    < http://betov.free.fr/RosAsm.html >


  • Next message: Alex McDonald: "Re: HLA v1.68 is now available"

    Relevant Pages

    • Re: HLA v1.68 is now available
      ... > Branch optimization has been proved to be an NP-Complete ... > of optimizing those branch displacements than you do. ... therefore a brute force method has been used.) ...
      (alt.lang.asm)
    • Re: Machine learning and classification
      ... than the choice of features to extract/recognize/quantify. ... than the aforementioned Rice U compiler optimization efforts). ... do features exist in source code that correlate ... genetic programming. ...
      (comp.ai)
    • Re: Optmization
      ... > Don't modify your source code ... > Learn how to use your compiler's optimization options ... worthwhile, whilst micro-optimisation, which Robert is talking about, ... Buying a better compiler for a hundred quid is probably ...
      (comp.lang.c)
    • Re: strlen(), K+1: clarification
      ... you fail to appreciate that code optimization does not simply ... mean shuffling the source code around. ... Please cite evidence that optimized C programs fail much more frequently ... In fact, string concatenation and strings ...
      (comp.programming)
    • Re: assembly code for release code?
      ... select the Assembly with source code? ... does turn on the option of Assembler ... Output impact the actual optimization in release mode? ...
      (microsoft.public.vc.language)