Function list_AddNodeFirst

src/list.cpp:197–236

-------------------------------------------------------------------------------*/

node_t* list_AddNodeFirst(list_t* list)
{
	if ( !list )
	{
		return nullptr;
	}

	node_t* node;

	// allocate memory for node
	if ( (node = (node_t*) malloc(sizeof(node_t))) == NULL )
	{
		printlog( "failed to allocate memory for new node!\n" );
		exit(1);
	}

	// initialize data pointers to NULL
	node->element = NULL;
	node->deconstructor = NULL;
	node->size = 0;
	node->prev = NULL;

	// integrate it into the list
	node->list = list;
	if ( list->first != NULL )
	{
		// there are prior nodes in the list
		node->next = list->first;
		list->first->prev = node;
	}
	else
	{
		// inserting into an empty list
		node->next = NULL;
		list->last = node;
	}
	list->first = node;

	return node;
}

/*-------------------------------------------------------------------------------