| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 31 | 2 | 2 | 0.980 | iteration_statement |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 31 | 3254 | InclusionConstraintGraph/Graph.h |
| 2 | 31 | 3286 | InclusionConstraintGraph/Graph.h |
| ||||
// mark named function nodes
do {
for (MapNamedEntitiesToNodes::Iterator iterator = m_named_functions_to_nodes.Begin(); iterator != m_named_functions_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 named function node
MarkTransitiveClosureOfNodes(node, number_of_nodes);
#else
// mark named function node
number_of_nodes++;
node->SetNodeNumber(number_of_nodes);
node->SetAuxiliaryBorder(Node::IsNotAuxiliaryBorder);
#endif
if (node->HasFunctionResult()) {
node = node->GetFunctionResult();
if (node->GetNodeNumber() == 0) {
#if !WRITE_BACK_CACHED_POINTED_TO_LOCATIONS
// mark transitive closure for named function node
MarkTransitiveClosureOfNodes(node, number_of_nodes);
#else
// mark named function node
number_of_nodes++;
node->SetNodeNumber(number_of_nodes);
node->SetAuxiliaryBorder(Node::IsNotAuxiliaryBorder);
#endif
}
}
}
}
}
while ( 0);
|
| ||||
// mark anonymous function nodes
do {
for (MapTrackingNumbersToNodes::Iterator iterator = m_anonymous_functions_to_nodes.Begin(); iterator != m_anonymous_functions_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 anonymous function node
MarkTransitiveClosureOfNodes(node, number_of_nodes);
#else
// mark anonymous function node
number_of_nodes++;
node->SetNodeNumber(number_of_nodes);
node->SetAuxiliaryBorder(Node::IsNotAuxiliaryBorder);
#endif
if (node->HasFunctionResult()) {
node = node->GetFunctionResult();
if (node->GetNodeNumber() == 0) {
#if !WRITE_BACK_CACHED_POINTED_TO_LOCATIONS
// mark transitive closure for named function node
MarkTransitiveClosureOfNodes(node, number_of_nodes);
#else
// mark named function node
number_of_nodes++;
node->SetNodeNumber(number_of_nodes);
node->SetAuxiliaryBorder(Node::IsNotAuxiliaryBorder);
#endif
}
}
}
}
}
while ( 0);
|
| |||
// mark anonymous function nodes
// mark named function nodes
do
{
for ([[#variablea894bc0]]::Iterator iterator = [[#variablea8947a0]].Begin(); iterator != [[#variablea8947a0]].End(); ++iterator)
{
Node * node = iterator.GetNode();
if (node->GetNodeNumber() == 0)
{
ContinueIfIsNotInTranslationUnit(iterator);
#if !WRITE_BACK_CACHED_POINTED_TO_LOCATIONS
// mark transitive closure for anonymous function node
// mark transitive closure for named function node
MarkTransitiveClosureOfNodes(node, number_of_nodes);
#else
// mark anonymous function node
// mark named function node
number_of_nodes++;
node->SetNodeNumber(number_of_nodes);
node->SetAuxiliaryBorder(Node::IsNotAuxiliaryBorder);
#endif
if (node->HasFunctionResult())
{
node = node->GetFunctionResult();
if (node->GetNodeNumber() == 0)
{
#if !WRITE_BACK_CACHED_POINTED_TO_LOCATIONS
// mark transitive closure for named function node
MarkTransitiveClosureOfNodes(node, number_of_nodes);
#else
// mark named function node
number_of_nodes++;
node->SetNodeNumber(number_of_nodes);
node->SetAuxiliaryBorder(Node::IsNotAuxiliaryBorder);
#endif
}
}
}
}
}
while (0);
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#a894bc0]] | MapTrackingNumbersToNodes |
| 1 | 2 | [[#a894bc0]] | MapNamedEntitiesToNodes |
| 2 | 1 | [[#a8947a0]] | m_anonymous_functions_to_nodes |
| 2 | 2 | [[#a8947a0]] | m_named_functions_to_nodes |