Original post by Dospro
Hi. I have a little problem, i made alinked list dinamycally, and now i want to free all the memory used.
I use this:

while(r_list!=NULL)	{		for(temp=r_list, temp2=r_list; temp!=NULL; temp=temp->next)		{			temp2=temp;		}		free(temp2);		temp2=NULL;	}

but it crashes here, do you know whats the problem?

Well the design of a linked list will have something done such as:

[Node1]->[Node2]->[Node3]->['\0']

So I don't know what your algorithm does really. If you are simply wanting to transverse a linked list and free memory, you will want to do something such as this:

while(r_list!=NULL){   temp = r_list->next;   free(r_list)   r_list = temp;}

And that's it [wink]

The process is that you start with the first node and store the next node. You then free the first node, then set that node's pointer to the stored next one. That way, the list get's advanced until the end. So here's a visual of it:

// Original: r_list = [Node1][Node1]->[Node2]->[Node3]->['\0']// temp = r_list->next;// r_list = [Node1][Node1]->[Node2]->[Node3]->['\0'][Temp]->[Node2]// free(r_list)// r_list = NULL[Node2]->[Node3]->['\0'][Temp]->[Node2]// r_list = temp;[Node2]->[Node3]->['\0']

Then the same thing is done again, effectively rremoving Node2, then Node3, then the loop is done when NULL is reached.