while (slowScanning) { try { slowScanLock.wait(); } catch (InterruptedException e) { // Empty } }
try { // We must check if the process was not stopped // before being here process.exitValue(); } catch (IllegalThreadStateException itse) { // the process is not terminated, if this is really // a timeout and not a manual stop then kill it. if (watch) { killedProcess = true; process.destroy(); } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/ExecuteWatchdog.java
Method name: void slowScan() Method name: void timeoutOccured(Watchdog)
Number of AST nodes: 3 Number of AST nodes: 2
1
while (slowScanning) {
2
                    try {
3
                        slowScanLock.wait();
4
        
1
try {
2
                // We must check if the process was not stopped
3
                // before being here
4
                process.exitValue();
5
            } catch (InterruptedException e) {
5
            } catch (IllegalThreadStateException itse) {
6
                        // Empty
6
                
7
                    }
8
    
7
// the process is not terminated, if this is really
8
                // a timeout and not a manual stop then kill it.
9
                if (watch) {
10
                    killedProcess = true;
11
                    process.destroy();
12
                }
9
            }
13
            }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes
Number of node comparisons1