data flow: perfomance improvement
This commit is contained in:
@@ -33,23 +33,21 @@ void DataFlowAnalysisNode<DataType>::doStep()
|
||||
{
|
||||
if (in_cnt < next->out_cnt)
|
||||
{
|
||||
for (const auto& byOut : next->getOut())
|
||||
{
|
||||
bool inserted = addIn({ byOut });
|
||||
const auto& byOut = next->getOut();
|
||||
bool inserted = addIn( byOut);
|
||||
|
||||
if (inserted)
|
||||
{
|
||||
if (next->out_cnt > in_max_cnt)
|
||||
in_max_cnt = next->out_cnt;
|
||||
|
||||
inserted = forwardData({ byOut });
|
||||
inserted = forwardData(byOut);
|
||||
|
||||
if (inserted && next->out_cnt > out_max_cnt)
|
||||
out_max_cnt = next->out_cnt;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
uniq_change |= (out_cnt == CNT_NOTINIT);
|
||||
|
||||
|
||||
Reference in New Issue
Block a user