57192a1fdc
stfld
18 years ago
86ca89b055
callvirt
18 years ago
6e4b542709
ldfld
18 years ago
40e1edd7d9
Fixed all bugs that prevented the decompiler from running.
The output of decompilation is saved in file output.cs
Unsupported expressions are handled a bit more gracefully -
for example: IL__callvirt(set_AutoSize(), (IL__ldfld(titleLabel, @this )), 1);
this is will eventually become this.titleLabel.AutoSize = 1;
18 years ago
bc89f0a071
Target of decompilation is now AboutDialog in the Reversi game.
18 years ago
42451cbd9d
Added a Reversi game from http://www.codeproject.com/KB/game/reversi.aspx
18 years ago
48c25a5821
Progress Report - Draft 1
18 years ago
3aa8cc498c
Initial GUI options loaded loaded from class
18 years ago
598dcfd92c
Bugfix in SimplifyTypeReferences - calling it for second time corrupted some type names
18 years ago
af14439362
Terminating all optimizations with exceptions
18 years ago
27d8b0107d
Include blocks jumping outside the parent not as being conditionals
18 years ago
a95748dc66
More GUI options
18 years ago
27d70d6897
Reduce "String.Concat(a, b)" to "a + b"
18 years ago
35f06e0a4b
Label is not reference counted object anymore, it is just a string. During transform we in two passes - find all live labels - remove all dead ones (the rest).
18 years ago
9aff0b724d
Simplify the transform code by using extension methods.
18 years ago
479918e7bc
Remove MyBlockStatement.
18 years ago
ea50b09c0d
NRefactory: Add NodeCollection.AddRange method
18 years ago
07a2cb2a84
NRefactory: Set parent of child when it is added to collection
18 years ago
932cf1a232
NRefactory: INode.Children type changed from List<T> to more general IList<T>
18 years ago
e42166ca85
Add NRefactory source code
18 years ago
34c8127a9b
Restore loop initializer
18 years ago
5b48611b69
Replace variable name for integers with "i", "j", "k", etc...
18 years ago
08528a768a
Reduce 'if' statements in loops.
18 years ago
5b8b80cc72
Restore loop iterator - move assignment from the end of loop.
18 years ago
af00ad101a
Restore for loop condition. It is a simple pattern match.
18 years ago
075c5bebdb
Remove empty 'else body' of 'if' statement.
18 years ago
d086b446e8
Remove flowing redundant jumps at the end of Ast blocks:
- Continue at the very end of loop
- Empty Return at the very end of method
- Goto at the very end of 'if' body, if the goto jumps right after the whole 'if' statement
18 years ago
6ebd05c0fe
Simplify type names. For example replace "System.Console.WriteLine" with "Console.WriteLine" because we have a "using System;" statement. Replace "Int32" with "int", etc...
18 years ago
8643290a4c
Remove redundant 'goto' statements in form:
goto labelX;
labelX: command();
18 years ago
ecad71d802
Added custom Ast classes for Goto and Label statements that track the reference count of a label.
Added an Ast transform to remove dead labels. (first Ast transform in program, I expect many more to come. Some stuff should be rewritten to use these explicit transforms)
18 years ago
45bedc8d1d
Try to reconstruct if statements. The following logic is used: Depending on the value of the condition, the control flow will branch to one of two locations - let's call then 'true entry' and 'false entry'. Nodes reachable *only* from the 'true entry' are assumed to be the 'true' body of the if statement. Similarly, nodes reachable only from the 'false entry' are the 'false' body. Nodes reachable from both 'true entry' and 'false entry' and not part of the if statement and are placed after it.
18 years ago
356c0b0d2f
Completely rewritten the Node tree structure. It became increasingly difficult to maintain the node links (Predecessors, Successors) consistent during transformations. So rather then keeping them consistent I have implemented an algorithm that can calculate the Predecessors or Successors for any given node. There are a few caches on the way so that the calculation does not calculate everything again every time. Affected caches are automatically flushed when a tree structure changes. This is implemented using 'collection with events'.
18 years ago
7bf471eec3
Some set operations that will be need for 'if' simplification
18 years ago
dda481d0fe
Maintain node links at all levels, not just at the top one.
18 years ago
ff56995219
Reduce some 'goto's in loops to 'break' and 'continue'.
Do not output 'goto' for simple fall-through to next node.
18 years ago
7df6c364c6
Non-conditional branch does not have 'fall-through' node as successor.
Add explicit 'goto' statement after each basic black.
More GUI debugging options.
18 years ago
b310187433
GUI debugging controls
18 years ago
693bb16488
Generate the initial graph.
Output the graph as nested blocks.
18 years ago
0bff44d922
Create class for each node type
18 years ago
faff1bf5a9
Working on graph reduction algorithm. (Graph creation and presentation is still missing)
18 years ago
aba6b0950c
Split method body to basic blocks
18 years ago
a43af72f9e
Bugfix - keep return if it is labelled.
18 years ago
22494bde37
Define local variables when value is first assigned to them
18 years ago
82d3debe87
Do not output the very last return statement
18 years ago
9eb2441490
Test on the compiler optimized version of quicksort
18 years ago
29b95cd28c
Remove some parenthesis
18 years ago
acdac3ecf5
Join consecutive expression together if possible
18 years ago
37d40932d9
Convert ByteCodeCollection to new data representation: StackExpressionCollection;
Modify the generating code to use this data representation
18 years ago
ed413b7ec3
Move stack analysis to the ByteCode class
18 years ago
b7486c3221
Move StackBehaviour code to separate file
18 years ago
David Srbecký