list_insert

	status.i4.v = list_insert(preceding_node.s.r, new_node.s.r)

	This routine inserts a new node into a linked list after a
	specified node.

	preceding_node	(list_link_t *) pointer to the node that will precede
			the new node (i.e. preceding_node->next will point to
			"new_node")
	new_node	(list_link_t *) pointer to the new node

	This function returns ACNET status values as follows:

	OK			success

	This function requires the following include files:

	cbslib_h, acnet_errors_h

	Related functions:

	list_init, LIST_INSERT_HEAD, LIST_INSERT_TAIL, list_delete,
	list_remove, list_find, list_for_each, LIST_IS_EMPTY, CAST_LLINK_TO

	C/C++ usage:

	int	status;
	list_link_t	*preceding_node;
	list_link_t	*new_node;

	status = list_insert(preceding_node,new_node);