my_list->first_node = NULL;
my_list->last_node = NULL;
my_list->cur_node = NULL;
my_list->currently_size = 0;
my_list->max_size = 0;
my_list->free_data_function = NULL;
my_list->first_node = NULL;
my_list->last_node = NULL;
my_list->cur_node = NULL;
my_list->currently_size = 0;
my_list->max_size = 0;
my_list->free_data_function = NULL;
/* If we have a last node, set the next to new node */
if(list->last_node)
{
list->last_node->next = newnode;
}
/* If we have a last node, set the next to new node */
if(list->last_node)
{
list->last_node->next = newnode;
}
/* newnode become last node */
list->last_node = newnode;
/* Increment list size */
list->currently_size++;
/* newnode become last node */
list->last_node = newnode;
/* Increment list size */
list->currently_size++;
/* if currently_size higher than the maximum size, remove the
* oldest node (first one)
*/
/* if currently_size higher than the maximum size, remove the
* oldest node (first one)
*/