CloneSet24


Previous CloneSetNext CloneSetBack to Main Report
Clone
Mass
Clones in
CloneSet
Parameter
Count
Clone
Similarity
Syntax Category
[Sequence Length]
17210.979iteration_statement
Clone AbstractionParameter Bindings
Clone Instance
(Click to see clone)
Line CountSource Line
Source File
1163411
InclusionConstraintGraph/Graph.h
2173428
InclusionConstraintGraph/Graph.h
Clone Instance
1
Line Count
16
Source Line
3411
Source File
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);


Clone Instance
2
Line Count
17
Source Line
3428
Source File
InclusionConstraintGraph/Graph.h

                        // 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);


Clone AbstractionParameter Count: 1Parameter Bindings

// 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 Bindings
Parameter
Index
Clone
Instance
Parameter
Name
Value
11[[#a938c60]]
m_indirect_calls_to_nodes 
12[[#a938c60]]
m_temporaries_to_nodes