while (scanning) { try { scanLock.wait(); } catch (InterruptedException e) { continue; } }
if (running[i] != null && !running[i].isFinished()) { //System.out.println("Thread " + i + " is still alive "); // still running - wait for it try { semaphore.wait(); } catch (InterruptedException ie) { // who would interrupt me at a time like this? } continue outer2; }
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/Parallel.java
Method name: void scan() Method name: void spinThreads()
Number of AST nodes: 3 Number of AST nodes: 4
1
while (scanning) {
1
if (running[i] != null && !running[i].isFinished()) {
2
                        //System.out.println("Thread " + i + " is still alive ");
3
                        // still running - wait for it
2
                    try {
4
                        try {
3
                        scanLock.wait();
5
                            semaphore.wait();
4
                    } catch (InterruptedException e) {
6
                        } catch (InterruptedException ie) {
5
                        continue;
7
                        
6
                    }
8
    // who would interrupt me at a time like this?
9
                        }
10
                        continue outer2;
7
                }
11
                    }
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