My question is, "how can you (or the compiler) possibly optimize code when you have no clue how long instructions will take to execute?" I realize some of these are continuation lines; so I combine the times and treat them as one; but I look over the code and can see no consistent relationship between the complexity of the statement and the number of clock cycles! This is maddening.
I know why line 144 takes so long. It has a MAX and a MIN in it which are two branches. I'm not that stupid.
Am I interpreting this correctly? That the numbers in the right column (Cloc) means the average number of clock cycles required to perform this instruction? or is it not this specific? I mentioned in another message I've seen a C statement if(z>Z)then take 1784 clocks!
Message Edited by email@example.com on 06-15-200607:50 AM
Message Edited by firstname.lastname@example.org on 06-15-200607:52 AM