How many times slower is the processor performing the transition to an arbitrary instruction compared to the usual transition to the next instruction?
As far as I know, when writing programs (both in high and low level languages), you should try to avoid both conditional and unconditional transitions (goto and if .. then ..). So, how many times faster two sequential instructions will be executed
mov AX,$5435; mov LX, AX;
in comparison with
m1: ... cmp bx, n; jne m1;
(Do not judge for errors, if any, with the assembler is almost not familiar).
The fact is that I am writing a program on delphi, consisting of 2 cycles with more than 1000 interactions each. In fact, these two cycles could be merged into one, but the code is very cumbersome, and I wrote it a long time ago (I’ll have to figure it out), and then the interactions would be 2 times less. Therefore, I asked this question to make sure that my code is rewritten.