David Crayford wrote: >We're doing some performance work on our assembler code and one of my >colleagues ran the following test which was surprising. Unconditional >branching can add significant overhead. I always believed that conditional >branches were expensive because the branch predictor needed to do more work >and unconditional branches were easy to predict. Does anybody have an >explanation for this. Our machine is z114. It appears that it's even worse on >a z13.
Hmmm, interesting, but I'm clueless about this one. Perhaps someone lurking on Assembler-L can help you out? Could you post your message there? Groete / Greetings Elardus Engelbrecht ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
