The Z88 incorporates useful system calls or for implementing linked list structures. These calls can be used to insert and delete members or fetch the next member. This is very valuable on the Z88, where the memory allocated to a process may be very highly fragmented. For setting up large symbol tables or other big data structures, linked lists (or binary trees) are the only realistic arrangement. For instance, PipeDream and Diary uses linked lists of text blocks to store the current pages.
...
Although a good understanding of how the linked lists works is helpful, the system calls do most of the hard work for you.
The calls provided are:
...
Delete an entry. You pass the extended pointer of the current and previous entry, and this routine updates the pointers and returns the extended pointer of the previous and next entries to the old current entry, now deleted.
...