| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 8 | 2 | 1 | 0.967 | iteration_statement |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 8 | 3644 | InclusionConstraintGraph/Graph.h |
| 2 | 8 | 3653 | InclusionConstraintGraph/Graph.h |
| ||||
// unmark temporary nodes (except function results)
do {
for (MapTrackingNumbersToNodes::Iterator iterator = m_temporaries_to_nodes.Begin(); iterator != m_temporaries_to_nodes.End(); ++iterator) {
Node *node = iterator.GetNode();
if (node->GetNodeNumber() == (std::numeric_limits<unsigned long>::max)()) {
node->SetNodeNumber(0);
}
}
}
while ( 0);
|
| ||||
// unmark indirect call nodes
do {
for (MapTrackingNumbersToNodes::Iterator iterator = m_indirect_calls_to_nodes.Begin(); iterator != m_indirect_calls_to_nodes.End(); ++iterator) {
Node *node = iterator.GetNode();
if (node->GetNodeNumber() == (std::numeric_limits<unsigned long>::max)()) {
node->SetNodeNumber(0);
}
}
}
while ( 0);
|
| |||
// unmark indirect call nodes
// unmark temporary nodes (except function results)
do
{
for (MapTrackingNumbersToNodes::Iterator iterator = [[#variablea9517a0]].Begin(); iterator != [[#variablea9517a0]].End(); ++iterator)
{
Node * node = iterator.GetNode();
if (node->GetNodeNumber() == (std::numeric_limits<unsigned long>::max)())
{
node->SetNodeNumber(0);
}
}
}
while (0);
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#a9517a0]] | m_indirect_calls_to_nodes |
| 1 | 2 | [[#a9517a0]] | m_temporaries_to_nodes |