list.traverse.c

analysis results

[ show all memory states | hide all memory states ] 

Thread1: 
/*traversing  the list to compute the sum of the data field*/

int traverse()
{
memory state
1 
	
	struct node * to shared p@List(H,F);
	
	int sum;
memory state
1 

	sum=0;
memory state
1 

	p=H;
memory state
1 

	while (p != NULL) {
(Iter_1)
1
(Iter_2)
1
(Iter_3)
1 

		sum=sum+p->data;

		p = p->next;
(Iter_1)
1
(Iter_2)
1
(Iter_3)
1111 
	}
(Iter_1)
1
(Iter_2)
1
(Iter_3)
1 

	retrun sum;
}



 

source

Thread1: 
/*traversing  the list to compute the sum of the data field*/

int traverse()
{
	struct node * to shared p@List(H,F);
	int sum;
	sum=0;
	p=H;
	while (p != NULL) {
		sum=sum+p->data;
		p = p->next;
	}
	retrun sum;
}