Stories
Slash Boxes
Comments

SoylentNews is people

SoylentNews is powered by your submissions, so send in your scoop. Only 14 submissions in the queue.
posted by martyb on Monday November 02 2015, @04:31AM   Printer-friendly
from the next-up:-jump-jiving dept.

The "jump threading" compiler optimization (aka -fthread-jump) turns conditional into unconditional branches on certain paths at the expense of code size. For hardware with branch prediction, speculative execution, and prefetching, this can greatly improve performance. However, there is no scientific publication or documentation at all. The Wikipedia article is very short and incomplete.

The linked article has an illustrated treatment of common code structures and how these optimizations work.


Original Submission

 
This discussion has been archived. No new comments can be posted.
Display Options Threshold/Breakthrough Mark All as Read Mark All as Unread
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
  • (Score: 2) by ledow on Monday November 02 2015, @01:23PM

    by ledow (5567) on Monday November 02 2015, @01:23PM (#257471) Homepage

    Topic yes.

    Treatment of it, no.

    I actually didn't find the explanation all that clear and I'm not a stranger to the way modern processors operate.

    The point of it also was clear - why would you need or want to do this? It didn't seems covered particularly well.

    I'd like more of this, but... literally.. more of this. The article was quite bare, I felt.

    Starting Score:    1  point
    Karma-Bonus Modifier   +1  

    Total Score:   2  
  • (Score: 3, Touché) by Phoenix666 on Monday November 02 2015, @04:04PM

    by Phoenix666 (552) on Monday November 02 2015, @04:04PM (#257542) Journal

    If you have better sources, please submit them. Many of us would like to see them. I don't see much like this.

    --
    Washington DC delenda est.