In my program I end up shifting memory around a lot and doing that I have been using FOR loops to quickly index through the memory locations that need moved/copied. I could accomplish this same task with a number of rungs equal to the FOR loop cycles. The FOR is quick for me to write, but seems it slower to execute, but how much slower?
Another bit I was wondering about is wether it matters if I use MEMCOPY, COPY, MOVER, MOVE. So far I have been using COPY as it looks clean and I can move strings or values and single elements or ranges and takes into account the data type. Most of the time I copy from similar data blocks so I could use several MEMOPY commands instead. Also so long as I am not moving strings, then I can use MOVER or MOVE depending on if it is one element or a range. Is one method faster than another?
I also wonder about is using nested IF statements in a MATH blocks vs using several rungs to check my "if" logic. One is nice and compact, the other is more spread out and uses more program memory, but is one faster than the other to execute?
Some of these concerns arise from the amount of ethernet communications that I am driving from the BRX and it appears that as the scan time increases the longer it takes to execute some ethernet communications, so I want to keep my scan time as short as possible.