mirror of https://github.com/icsharpcode/ILSpy.git
Daniel Grunwald
14 years ago
26 changed files with 547 additions and 299 deletions
|
After Width: | Height: | Size: 569 B |
@ -0,0 +1,151 @@ |
|||||||
|
// Copyright (c) 2011 AlphaSierraPapa for the SharpDevelop Team
|
||||||
|
//
|
||||||
|
// Permission is hereby granted, free of charge, to any person obtaining a copy of this
|
||||||
|
// software and associated documentation files (the "Software"), to deal in the Software
|
||||||
|
// without restriction, including without limitation the rights to use, copy, modify, merge,
|
||||||
|
// publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons
|
||||||
|
// to whom the Software is furnished to do so, subject to the following conditions:
|
||||||
|
//
|
||||||
|
// The above copyright notice and this permission notice shall be included in all copies or
|
||||||
|
// substantial portions of the Software.
|
||||||
|
//
|
||||||
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
|
||||||
|
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
|
||||||
|
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE
|
||||||
|
// FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
||||||
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
||||||
|
// DEALINGS IN THE SOFTWARE.
|
||||||
|
|
||||||
|
using System; |
||||||
|
using System.Collections.Concurrent; |
||||||
|
using System.Collections.Generic; |
||||||
|
using System.Linq; |
||||||
|
using System.Threading; |
||||||
|
using ICSharpCode.TreeView; |
||||||
|
using Mono.Cecil; |
||||||
|
using Mono.Cecil.Cil; |
||||||
|
using ICSharpCode.Decompiler.Ast; |
||||||
|
|
||||||
|
namespace ICSharpCode.ILSpy.TreeNodes.Analyzer |
||||||
|
{ |
||||||
|
internal sealed class AnalyzedVirtualMethodUsedByTreeNode : AnalyzerTreeNode |
||||||
|
{ |
||||||
|
private readonly MethodDefinition analyzedMethod; |
||||||
|
private readonly ThreadingSupport threading; |
||||||
|
private ConcurrentDictionary<MethodDefinition, int> foundMethods; |
||||||
|
private MethodDefinition baseMethod; |
||||||
|
private List<TypeReference> possibleTypes; |
||||||
|
|
||||||
|
public AnalyzedVirtualMethodUsedByTreeNode(MethodDefinition analyzedMethod) |
||||||
|
{ |
||||||
|
if (analyzedMethod == null) |
||||||
|
throw new ArgumentNullException("analyzedMethod"); |
||||||
|
|
||||||
|
this.analyzedMethod = analyzedMethod; |
||||||
|
this.threading = new ThreadingSupport(); |
||||||
|
this.LazyLoading = true; |
||||||
|
} |
||||||
|
|
||||||
|
public override object Text |
||||||
|
{ |
||||||
|
get { return "Used By"; } |
||||||
|
} |
||||||
|
|
||||||
|
public override object Icon |
||||||
|
{ |
||||||
|
get { return Images.Search; } |
||||||
|
} |
||||||
|
|
||||||
|
protected override void LoadChildren() |
||||||
|
{ |
||||||
|
threading.LoadChildren(this, FetchChildren); |
||||||
|
} |
||||||
|
|
||||||
|
protected override void OnCollapsing() |
||||||
|
{ |
||||||
|
if (threading.IsRunning) { |
||||||
|
this.LazyLoading = true; |
||||||
|
threading.Cancel(); |
||||||
|
this.Children.Clear(); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
private IEnumerable<SharpTreeNode> FetchChildren(CancellationToken ct) |
||||||
|
{ |
||||||
|
InitializeAnalyzer(); |
||||||
|
|
||||||
|
var analyzer = new ScopedWhereUsedAnalyzer<SharpTreeNode>(analyzedMethod, FindReferencesInType); |
||||||
|
foreach (var child in analyzer.PerformAnalysis(ct)) { |
||||||
|
yield return child; |
||||||
|
} |
||||||
|
|
||||||
|
ReleaseAnalyzer(); |
||||||
|
} |
||||||
|
|
||||||
|
private void InitializeAnalyzer() |
||||||
|
{ |
||||||
|
foundMethods = new ConcurrentDictionary<MethodDefinition, int>(); |
||||||
|
|
||||||
|
var BaseMethods = TypesHierarchyHelpers.FindBaseMethods(analyzedMethod).ToArray(); |
||||||
|
if (BaseMethods.Length > 0) { |
||||||
|
baseMethod = BaseMethods[BaseMethods.Length - 1]; |
||||||
|
} |
||||||
|
|
||||||
|
possibleTypes = new List<TypeReference>(); |
||||||
|
|
||||||
|
TypeReference type = analyzedMethod.DeclaringType.BaseType; |
||||||
|
while (type !=null) |
||||||
|
{ |
||||||
|
possibleTypes.Add(type); |
||||||
|
type = type.Resolve().BaseType; |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
private void ReleaseAnalyzer() |
||||||
|
{ |
||||||
|
foundMethods = null; |
||||||
|
baseMethod = null; |
||||||
|
} |
||||||
|
|
||||||
|
private IEnumerable<SharpTreeNode> FindReferencesInType(TypeDefinition type) |
||||||
|
{ |
||||||
|
string name = analyzedMethod.Name; |
||||||
|
foreach (MethodDefinition method in type.Methods) { |
||||||
|
bool found = false; |
||||||
|
string prefix = string.Empty; |
||||||
|
if (!method.HasBody) |
||||||
|
continue; |
||||||
|
foreach (Instruction instr in method.Body.Instructions) { |
||||||
|
MethodReference mr = instr.Operand as MethodReference; |
||||||
|
if (mr != null && mr.Name == name) { |
||||||
|
// explicit call to the requested method
|
||||||
|
if (Helpers.IsReferencedBy(analyzedMethod.DeclaringType, mr.DeclaringType) && mr.Resolve() == analyzedMethod) { |
||||||
|
found = true; |
||||||
|
prefix = "(as base) "; |
||||||
|
break; |
||||||
|
} |
||||||
|
// virtual call to base method
|
||||||
|
if (instr.OpCode.Code == Code.Callvirt && Helpers.IsReferencedBy(baseMethod.DeclaringType, mr.DeclaringType) && mr.Resolve() == baseMethod) { |
||||||
|
found = true; |
||||||
|
break; |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
method.Body = null; |
||||||
|
|
||||||
|
if (found) { |
||||||
|
MethodDefinition codeLocation = this.Language.GetOriginalCodeLocation(method) as MethodDefinition; |
||||||
|
if (codeLocation != null && !HasAlreadyBeenFound(codeLocation)) { |
||||||
|
yield return new AnalyzedMethodTreeNode(codeLocation, prefix); |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
private bool HasAlreadyBeenFound(MethodDefinition method) |
||||||
|
{ |
||||||
|
return !foundMethods.TryAdd(method, 0); |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
Loading…
Reference in new issue