try { in.mark(limit); } catch (IOException ioe) { throw new RuntimeException(ioe.getMessage()); }
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/util/ReaderInputStream.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/ExecuteWatchdog.java
Method name: void mark(int) Method name: void timeoutOccured(Watchdog)
Number of AST nodes: 2 Number of AST nodes: 2
1
try {
1
try {
2
            in.mark(limit);
2
            
3
    // We must check if the process was not stopped
4
                // before being here
5
                process.exitValue();
3
        } catch (IOException ioe) {
6
            } catch (IllegalThreadStateException itse) {
4
            throw new RuntimeException(ioe.getMessage());
7
            
8
    // the process is not terminated, if this is really
9
                // a timeout and not a manual stop then kill it.
10
                if (watch) {
11
                    killedProcess = true;
12
                    process.destroy();
13
                }
5
        }
14
            }
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