| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 17 | 2 | 1 | 0.979 | iteration_statement |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 16 | 3411 | InclusionConstraintGraph/Graph.h |
| 2 | 17 | 3428 | InclusionConstraintGraph/Graph.h |
| ||||
// mark temporary nodes (except function results marked above)
do {
for (MapTrackingNumbersToNodes::Iterator iterator = m_temporaries_to_nodes.Begin(); iterator != m_temporaries_to_nodes.End(); ++iterator) {
Node *node = iterator.GetNode();
if (node->GetNodeNumber() == 0) {
ContinueIfIsNotInTranslationUnit(iterator);
#if !WRITE_BACK_CACHED_POINTED_TO_LOCATIONS
// mark transitive closure for temporary node
MarkTransitiveClosureOfNodes(node, number_of_nodes);
#else
// mark temporary node
node->SetNodeNumber((std::numeric_limits<unsigned long>::max)());
node->SetAuxiliaryBorder(Node::IsNotAuxiliaryBorder);
#endif
}
}
}
while ( 0);
|
| ||||
// mark indirect call nodes
do {
for (MapTrackingNumbersToNodes::Iterator iterator = m_indirect_calls_to_nodes.Begin(); iterator != m_indirect_calls_to_nodes.End(); ++iterator) {
// mark transitive closure for indirect call nodes
Node *node = iterator.GetNode();
if (node->GetNodeNumber() == 0) {
ContinueIfIsNotInTranslationUnit(iterator);
#if !WRITE_BACK_CACHED_POINTED_TO_LOCATIONS
// mark transitive closure for indirect call node
MarkTransitiveClosureOfNodes(node, number_of_nodes);
#else
// mark indirect call node
node->SetNodeNumber((std::numeric_limits<unsigned long>::max)());
node->SetAuxiliaryBorder(Node::IsNotAuxiliaryBorder);
#endif
}
}
}
while ( 0);
|
| |||
// mark indirect call nodes
// mark temporary nodes (except function results marked above)
do
{
for (MapTrackingNumbersToNodes::Iterator iterator = [[#variablea938c60]].Begin(); iterator != [[#variablea938c60]].End(); ++iterator)
{
// mark transitive closure for indirect call nodes
Node * node = iterator.GetNode();
if (node->GetNodeNumber() == 0)
{
ContinueIfIsNotInTranslationUnit(iterator);
#if !WRITE_BACK_CACHED_POINTED_TO_LOCATIONS
// mark transitive closure for indirect call node
// mark transitive closure for temporary node
MarkTransitiveClosureOfNodes(node, number_of_nodes);
#else
// mark indirect call node
// mark temporary node
node->SetNodeNumber((std::numeric_limits<unsigned long>::max)());
node->SetAuxiliaryBorder(Node::IsNotAuxiliaryBorder);
#endif
}
}
}
while (0);
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#a938c60]] | m_indirect_calls_to_nodes |
| 1 | 2 | [[#a938c60]] | m_temporaries_to_nodes |