Non Destructive, Non Buffered Direct Data Move Functions
Original Publication Date: 1980-Mar-01
Included in the Prior Art Database: 2005-Feb-13
It is sometimes desirable to shift cyclically data stored in a buffer e.g., a plurality of contiguous memory locations. In the figure, a buffer, which for purposes of generality begins at an address B and ends at an address L, contains K elements, where n is the number of locations in the buffer, viz., L-B+1. An instance where it would not be feasible to address the data by adjusting pointers or providing displacement addresses instead of moving the data is a MOVE field instruction where the first K-n elements represent the field which is to be moved so that the last element, e(K), is placed at the last address L without destroying the data in the new field. For a relatively large buffer, shifting the data is not feasible due to the amount of time required.