Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: optimizing loops question

Author: Reinhard Scharnagl

Date: 08:34:30 07/20/03

Go up one level in this thread


Hi Uri,

there is no branchless code in real life (in the CPU) -
branches only might be hidden in the source language.

You probably would not like following:

goto L_step;
do {
  ++i;
L_step:
  f(i);
} while (i < n);

Reinhard.



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.