=20

IN: HL =3D pointer to a 9-byte parameter block (usually on the stack): (HL+0) ... (HL+2) =3D pointer of block to insert (HL+3) ... (HL+5) =3D pointer to previous block (HL+6) ... (HL+8) =3D pointer to next block OUT, if call successful: Fc =3D 0 OUT, if call failed: Fc =3D 1 A =3D error code: RC_BAD ($04), if pointer to block to insert =3D 0. Registers changed after return: ..BCDEHL/IXIY same AF....../.... different=20

Algorithm: Assuming inserting entry I between entries X and Y (for more = details, read Linked lists):

=20

*I =3D= X XOR Y *X =3D *X XOR Y XOR I *Y =3D *Y XOR X XOR I=20

If X and Y are zero then the link is cleared.

**GN_Xdl**~~, delete an entry from a linked list ~~**GN_Xnx**, index next entry i=
n linked list