{\r
struct memory_reg *p_reg;\r
cl_list_item_t *p_item;\r
+ cl_list_item_t *p_item1;\r
ib_api_status_t status;\r
\r
IBSP_ENTER( IBSP_DBG_MEM );\r
* No need to remove from the list as we're about to free the\r
* registration.\r
*/\r
- for( p_item = cl_qlist_head( &p_reg->node_list );\r
- p_item != cl_qlist_end( &p_reg->node_list );\r
- p_item = cl_qlist_next( p_item ) )\r
+ for( p_item1 = cl_qlist_head( &p_reg->node_list );\r
+ p_item1 != cl_qlist_end( &p_reg->node_list );\r
+ p_item1 = cl_qlist_next( p_item1 ) )\r
{\r
struct memory_node *p_node =\r
- PARENT_STRUCT( p_item, struct memory_node, mr_item );\r
+ PARENT_STRUCT( p_item1, struct memory_node, mr_item );\r
\r
p_node->p_reg = NULL;\r
}\r