42S local label caching
|
11-15-2019, 05:42 PM
(This post was last modified: 11-16-2019 12:33 PM by Sylvain Cote.)
Post: #11
|
|||
|
|||
RE: 42S local label caching
Hello Joe,
Local Label Searches (Users Manual P.148 & 149) Searches for local labels occur only within the current program. To find a local label, the calculator first searches sequentially downward through the current program, starting at the location of the program pointer. If the specified label is not found before reaching the end of the program, the calculator continues the search from the beginning of the program. A local label search can consume a significant amount of time, depending on the length of the current program and the distance to the label. To minimize searching time, the calculator remembers the distance from the GTO or XEQ instruction to the specified local label. This eliminates the searching time for subsequent executions of that same GTO or XEQ instruction. The distance to the label is stored internally as part of the GTO or XEQ instruction. If this distance is greater than 4,096 bytes in either direction (128 bytes for short form labels; LnL 00 through LBL 14), the calculator cannot store the distance and a search must take place for each execution or the instruction. (11-14-2019 10:54 PM)Joe Horn Wrote: Even global labels and ENDs are the same internally. There are the same one-and two-byte LBLs, RCLs and STOs..."Are you sure ? For the HP-41
Sylvain |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 3 Guest(s)