TI-66 double speed mod

[Didier Lachieze]

(07-08-2022 02:17 AM)pauln Wrote:  One problem with the linked list approach is that it needs 7 extra bits for each one of the 100 registers of the HP-65 (to point to the next step).

The program memory in the HP-65 is not a RAM (random access memory) where each element has his own address, it's just a long register containing all steps sequentially, so there is no address pointer and no individual register. You can view it as a window to a circulating ring of instructions. You view the current one, then the next one and so on but they don't have an address you can use to jump to it. Markers in this flow of instructions are inserted to identify beginning/end of memory, next step to execute/fill and return location from subroutine. All is controlled by hardware and the flow is only going forward to the next instruction.

More details from the May 1974 issue of the Hewlett-Packard Journal:

The memory itself contains no absolute addresses. Instead, it is a circulating shift register organized into six-bit words. One word is a marker that denotes the boundary between the beginning and the end of the memory. Another word is a pointer which denotes the last step executed in run mode, and the last step filled in program mode. As a program runs, this pointer is moved down through memory. Branching is accomplished by moving the pointer to the location of the destination label. User-defined function calls are implemented by leaving the main pointer at the call and activating a second pointer at the function location (see Fig. 3). When the return to the calling location occurs, the second pointer is deactivated and the first pointer reactivated.