-
Notifications
You must be signed in to change notification settings - Fork 408
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Add code action for uncaught exception.
Signed-off-by: Yaohai Zheng <[email protected]>
- Loading branch information
Showing
28 changed files
with
8,275 additions
and
45 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
255 changes: 255 additions & 0 deletions
255
...eclipse.jdt.ls.core/src/org/eclipse/jdt/ls/core/internal/corext/dom/CodeScopeBuilder.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,255 @@ | ||
| /******************************************************************************* | ||
| * Copyright (c) 2000, 2011 IBM Corporation and others. | ||
| * All rights reserved. This program and the accompanying materials | ||
| * are made available under the terms of the Eclipse Public License v1.0 | ||
| * which accompanies this distribution, and is available at | ||
| * http://www.eclipse.org/legal/epl-v10.html | ||
| * | ||
| * Originally copied from org.eclipse.jdt.internal.corext.dom.CodeScopeBuilder | ||
| * | ||
| * Contributors: | ||
| * IBM Corporation - initial API and implementation | ||
| *******************************************************************************/ | ||
| package org.eclipse.jdt.ls.core.internal.corext.dom; | ||
|
|
||
| import java.util.ArrayList; | ||
| import java.util.Iterator; | ||
| import java.util.List; | ||
|
|
||
| import org.eclipse.jdt.core.dom.ASTNode; | ||
| import org.eclipse.jdt.core.dom.ASTVisitor; | ||
| import org.eclipse.jdt.core.dom.Block; | ||
| import org.eclipse.jdt.core.dom.BodyDeclaration; | ||
| import org.eclipse.jdt.core.dom.CatchClause; | ||
| import org.eclipse.jdt.core.dom.Expression; | ||
| import org.eclipse.jdt.core.dom.ForStatement; | ||
| import org.eclipse.jdt.core.dom.IBinding; | ||
| import org.eclipse.jdt.core.dom.MethodInvocation; | ||
| import org.eclipse.jdt.core.dom.QualifiedName; | ||
| import org.eclipse.jdt.core.dom.SimpleName; | ||
| import org.eclipse.jdt.core.dom.TypeDeclarationStatement; | ||
|
|
||
| public class CodeScopeBuilder extends ASTVisitor { | ||
|
|
||
| public static class Scope { | ||
| private Scope fParent; | ||
| private int fStart; | ||
| private int fLength; | ||
| private List<String> fNames; | ||
| private List<Scope> fChildren; | ||
| private int fCursorOffset; | ||
|
|
||
| Scope(Scope parent, int start, int length) { | ||
| fParent = parent; | ||
| fStart = start; | ||
| fLength = length; | ||
| if (fParent != null) { | ||
| fParent.addChild(this); | ||
| } | ||
| } | ||
|
|
||
| public void setCursor(int offset) { | ||
| fCursorOffset = offset; | ||
| } | ||
|
|
||
| private void addChild(Scope child) { | ||
| if (fChildren == null) { | ||
| fChildren = new ArrayList<>(2); | ||
| } | ||
| fChildren.add(child); | ||
| } | ||
|
|
||
| private void addName(String name) { | ||
| if (fNames == null) { | ||
| fNames = new ArrayList<>(2); | ||
| } | ||
| fNames.add(name); | ||
| } | ||
|
|
||
| public Scope findScope(int start, int length) { | ||
| if (fStart <= start && start + length <= fStart + fLength) { | ||
| if (fChildren == null) { | ||
| return this; | ||
| } | ||
| for (Iterator<Scope> iter = fChildren.iterator(); iter.hasNext();) { | ||
| Scope scope = iter.next().findScope(start, length); | ||
| if (scope != null) { | ||
| return scope; | ||
| } | ||
| } | ||
| return this; | ||
| } | ||
| return null; | ||
| } | ||
|
|
||
| public String createName(String candidate, boolean add) { | ||
| int i = 1; | ||
| String result = candidate; | ||
| while (isInUse(result)) { | ||
| result = candidate + i++; | ||
| } | ||
| if (add) { | ||
| addName(result); | ||
| } | ||
| return result; | ||
| } | ||
|
|
||
| public boolean isInUse(String name) { | ||
| if (internalIsInUse(name)) { | ||
| return true; | ||
| } | ||
| if (fChildren != null) { | ||
| for (Iterator<Scope> iter = fChildren.iterator(); iter.hasNext();) { | ||
| Scope child = iter.next(); | ||
| if (fCursorOffset < child.fStart && child.isInUseDown(name)) { | ||
| return true; | ||
| } | ||
| } | ||
| } | ||
| return false; | ||
| } | ||
|
|
||
| private boolean internalIsInUse(String name) { | ||
| if (fNames != null && fNames.contains(name)) { | ||
| return true; | ||
| } | ||
| if (fParent != null) { | ||
| return fParent.internalIsInUse(name); | ||
| } | ||
| return false; | ||
|
|
||
| } | ||
|
|
||
| private boolean isInUseDown(String name) { | ||
| if (fNames != null && fNames.contains(name)) { | ||
| return true; | ||
| } | ||
| if (fChildren == null) { | ||
| return false; | ||
| } | ||
| for (Iterator<Scope> iter = fChildren.iterator(); iter.hasNext();) { | ||
| Scope scope = iter.next(); | ||
| if (scope.isInUseDown(name)) { | ||
| return true; | ||
| } | ||
| } | ||
| return false; | ||
| } | ||
| } | ||
|
|
||
| private IBinding fIgnoreBinding; | ||
| private Selection fIgnoreRange; | ||
| private Scope fScope; | ||
| private List<Scope> fScopes; | ||
|
|
||
| public static Scope perform(BodyDeclaration node, IBinding ignore) { | ||
| CodeScopeBuilder collector = new CodeScopeBuilder(node, ignore); | ||
| node.accept(collector); | ||
| return collector.fScope; | ||
| } | ||
|
|
||
| public static Scope perform(BodyDeclaration node, Selection ignore) { | ||
| CodeScopeBuilder collector = new CodeScopeBuilder(node, ignore); | ||
| node.accept(collector); | ||
| return collector.fScope; | ||
| } | ||
|
|
||
| private CodeScopeBuilder(ASTNode node, IBinding ignore) { | ||
| fScope = new Scope(null, node.getStartPosition(), node.getLength()); | ||
| fScopes = new ArrayList<>(); | ||
| fIgnoreBinding = ignore; | ||
| } | ||
|
|
||
| private CodeScopeBuilder(ASTNode node, Selection ignore) { | ||
| fScope = new Scope(null, node.getStartPosition(), node.getLength()); | ||
| fScopes = new ArrayList<>(); | ||
| fIgnoreRange = ignore; | ||
| } | ||
|
|
||
| @Override | ||
| public boolean visit(CatchClause node) { | ||
| // open a new scope for the exception declaration. | ||
| fScopes.add(fScope); | ||
| fScope = new Scope(fScope, node.getStartPosition(), node.getLength()); | ||
| return true; | ||
| } | ||
|
|
||
| @Override | ||
| public void endVisit(CatchClause node) { | ||
| fScope = fScopes.remove(fScopes.size() - 1); | ||
| } | ||
|
|
||
| @Override | ||
| public boolean visit(SimpleName node) { | ||
| if (fIgnoreBinding != null && Bindings.equals(fIgnoreBinding, node.resolveBinding())) { | ||
| return false; | ||
| } | ||
| if (fIgnoreRange != null && fIgnoreRange.covers(node)) { | ||
| return false; | ||
| } | ||
| fScope.addName(node.getIdentifier()); | ||
| return false; | ||
| } | ||
|
|
||
| @Override | ||
| public boolean visit(QualifiedName node) { | ||
| // only consider the left most identifier. | ||
| node.getQualifier().accept(this); | ||
| return false; | ||
| } | ||
|
|
||
| @Override | ||
| public boolean visit(MethodInvocation node) { | ||
| Expression receiver = node.getExpression(); | ||
| if (receiver == null) { | ||
| SimpleName name = node.getName(); | ||
| if (fIgnoreBinding == null || !Bindings.equals(fIgnoreBinding, name.resolveBinding())) { | ||
| node.getName().accept(this); | ||
| } | ||
| } else { | ||
| receiver.accept(this); | ||
| } | ||
| accept(node.arguments()); | ||
| return false; | ||
| } | ||
|
|
||
| @Override | ||
| public boolean visit(TypeDeclarationStatement node) { | ||
| fScope.addName(node.getDeclaration().getName().getIdentifier()); | ||
| return false; | ||
| } | ||
|
|
||
| @Override | ||
| public boolean visit(Block node) { | ||
| fScopes.add(fScope); | ||
| fScope = new Scope(fScope, node.getStartPosition(), node.getLength()); | ||
| return true; | ||
| } | ||
|
|
||
| @Override | ||
| public void endVisit(Block node) { | ||
| fScope = fScopes.remove(fScopes.size() - 1); | ||
| } | ||
|
|
||
| @Override | ||
| public boolean visit(ForStatement node) { | ||
| fScopes.add(fScope); | ||
| fScope = new Scope(fScope, node.getStartPosition(), node.getLength()); | ||
| return true; | ||
| } | ||
|
|
||
| @Override | ||
| public void endVisit(ForStatement node) { | ||
| fScope = fScopes.remove(fScopes.size() - 1); | ||
| } | ||
|
|
||
| private void accept(List<Expression> list) { | ||
| int size; | ||
| if (list == null || (size = list.size()) == 0) { | ||
| return; | ||
| } | ||
| for (int i = 0; i < size; i++) { | ||
| list.get(i).accept(this); | ||
| } | ||
| } | ||
| } |
Oops, something went wrong.