pimhwang
/
ILSpy
mirror of https://github.com/icsharpcode/ILSpy.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
283 Commits
54 Branches
94 Tags
91 MiB
Tree: aa50a0c3cb
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'aa50a0c3cb'
${ noResults }
Commit Graph

2 Commits (aa50a0c3cb845db7941fe2a4ac95f59acf4e1bac)

Author SHA1 Message Date
David Srbecký 9387dadfc8 Fixed conditional loops
16 years ago
Daniel Grunwald 949e7c2378 Move decompiler code into ICSharpCode.Decompiler; add very simple integration with ILSpy.
16 years ago
David Srbecký 36f29f72e5 Moved everything into top-level directory
16 years ago
David Srbecký eed0f0af6c Refactoring the data model
16 years ago
David Srbecký 459742f3ca Simplify short-circuit branches ("a && b" or "a || b").
16 years ago
David Srbecký cefcba99d1 When conditional does not have any common reachable nodes, create only 'true' body. 'False' body is then implicitly the code after the conditional.
16 years ago
David Srbecký af14439362 Terminating all optimizations with exceptions
16 years ago
David Srbecký 27d8b0107d Include blocks jumping outside the parent not as being conditionals
16 years ago
David Srbecký a95748dc66 More GUI options
16 years ago
David Srbecký 08528a768a Reduce 'if' statements in loops.
16 years ago
David Srbecký 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.
16 years ago
David Srbecký 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'.
16 years ago