ocelot/ocelot/analysis/implementation/DivergenceGraph.cpp
int DivergenceGraph::insertEdge( const ir::PTXOperand* origin,
	const node_type &toNode, const bool createNewNodes ){
	if( createNewNodes ){
		insertSpecialSource(origin);
	} else if( _specials.find(origin) == _specials.end() ){
		return 1;
	}

	_specials[origin].insert(toNode);
	return 0;
}
/*!\brief Inserts a edge[arrow] between two nodes of the graph
	/ Can create nodes if they don't exist */
\brief Inserts a edge[arrow] between two nodes of the graph
Can create nodes if they don't exist
\ brief Inserts a edge [ arrow ] between two nodes of the graph Can create nodes if they don ' t exist
int DivergenceGraph::insertEdge( const ir::PTXOperand* origin,
	const node_type &toNode, const bool createNewNodes ){
	if( createNewNodes ){
		insertSpecialSource(origin);
	} else if( _specials.find(origin) == _specials.end() ){
		return 1;
	}
	_specials[origin].insert(toNode);
	return 0;
}
int DivergenceGraph :: insertEdge ( const ir :: PTXOperand * origin , const node_type & toNode , const bool createNewNodes ) { if ( createNewNodes ) { insertSpecialSource ( origin ) ; } else if ( _specials . find ( origin ) == _specials . end ( ) ) { return 1 ; } _specials [ origin ] . insert ( toNode ) ; return 0 ; }
\brief Inserts a edge[arrow] between two nodes of the graph
 Can create nodes if they don't exist
\ brief Inserts a edge [ arrow ] between two nodes of the graph Can create nodes if they don ' t exist