pimhwang
/
ILSpy
mirror of https://github.com/icsharpcode/ILSpy.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
Browse Source

Move Decompiler/doc to top level.

pull/1/head^2
Daniel Grunwald 15 years ago
parent
e2f910a4aa
commit
1498c250ab
32 changed files with 4990 additions and 4990 deletions
Whitespace
Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL
Split View
Diff Options
Show Stats Download Patch File Download Diff File
  1. 0
      doc/Dissertation/Dissertation.pdf
  2. 6154
      doc/Dissertation/Dissertation.tex
  3. 380
      doc/Dissertation/Evolution/01_Disassemble.cs
  4. 734
      doc/Dissertation/Evolution/01b_Disassemble_StackStates.cs
  5. 380
      doc/Dissertation/Evolution/02_Peephole_decompilation.cs
  6. 406
      doc/Dissertation/Evolution/03_Dataflow.cs
  7. 756
      doc/Dissertation/Evolution/03_Dataflow_Comments.cs
  8. 96
      doc/Dissertation/Evolution/04_Inline_expressions.cs
  9. 156
      doc/Dissertation/Evolution/05_Find_basic_blocks.cs
  10. 174
      doc/Dissertation/Evolution/06_Find_loops.cs
  11. 244
      doc/Dissertation/Evolution/07_Find_conditionals.cs
  12. 138
      doc/Dissertation/Evolution/08_Remove_dead_jumps.cs
  13. 102
      doc/Dissertation/Evolution/09_Reduce_loops.cs
  14. 88
      doc/Dissertation/Evolution/10_Short_type_names.cs
  15. 84
      doc/Dissertation/Evolution/QuickSort_original.cs
  16. 0
      doc/Dissertation/ProgressReport.pdf
  17. 0
      doc/Dissertation/ProgressReport.tex
  18. 0
      doc/Dissertation/Proposal.tex
  19. 0
      doc/Dissertation/figs/10_Short_type_names_2.cs
  20. 0
      doc/Dissertation/figs/IfThen.png
  21. 0
      doc/Dissertation/figs/IfThenElse.png
  22. 0
      doc/Dissertation/figs/IfThenElseRechablility.png
  23. 0
      doc/Dissertation/figs/IfThenElseReduction.png
  24. 0
      doc/Dissertation/figs/Ireducible.png
  25. 0
      doc/Dissertation/figs/Loop.png
  26. 0
      doc/Dissertation/figs/NestedLoops.png
  27. 0
      doc/Dissertation/figs/NestedLoops2.png
  28. 0
      doc/Dissertation/figs/QuickSortMain.png
  29. 88
      doc/Dissertation/figs/QuickSort_original.cs
  30. 0
      doc/Dissertation/figs/T1T2.png
  31. 0
      doc/Dissertation/figs/figs.svg
  32. 0
      doc/Dissertation/figs/shortcircuit.png

0
Decompiler/doc/Dissertation/Dissertation.pdf → doc/Dissertation/Dissertation.pdf
Unescape View File

6154
Decompiler/doc/Dissertation/Dissertation.tex → doc/Dissertation/Dissertation.tex
View File

File diff suppressed because it is too large Load Diff

380
Decompiler/doc/Dissertation/Evolution/01_Disassemble.cs → doc/Dissertation/Evolution/01_Disassemble.cs
Unescape View File

@ -1,190 +1,190 @@ @@ -1,190 +1,190 @@
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
IL_00: nop # Pop0->Push0
IL_01: ldarg args # Pop0->Push1
IL_02: ldlen # Popref->Pushi
IL_03: conv.i4 # Pop1->Pushi
IL_04: newarr System.Int32# Popi->Pushref
IL_09: stloc V_0 # Pop1->Push0
IL_0A: ldc.i4 0 # Pop0->Pushi
IL_0B: stloc V_1 # Pop1->Push0
IL_0C: br IL_1F # Pop0->Push0 Flow=Branch
IL_0E: nop # Pop0->Push0
IL_0F: ldloc V_0 # Pop0->Push1
IL_10: ldloc V_1 # Pop0->Push1
IL_11: ldarg args # Pop0->Push1
IL_12: ldloc V_1 # Pop0->Push1
IL_13: ldelem.ref # Popref_popi->Pushref
IL_14: call Parse() # Varpop->Varpush Flow=Call
IL_19: stelem.i4 # Popref_popi_popi->Push0
IL_1A: nop # Pop0->Push0
IL_1B: ldloc V_1 # Pop0->Push1
IL_1C: ldc.i4 1 # Pop0->Pushi
IL_1D: add.ovf # Pop1_pop1->Push1
IL_1E: stloc V_1 # Pop1->Push0
IL_1F: ldloc V_1 # Pop0->Push1
IL_20: ldloc V_0 # Pop0->Push1
IL_21: ldlen # Popref->Pushi
IL_22: conv.i4 # Pop1->Pushi
IL_23: clt # Pop1_pop1->Pushi
IL_25: stloc V_2 # Pop1->Push0
IL_26: ldloc V_2 # Pop0->Push1
IL_27: brtrue IL_0E # Popi->Push0 Flow=Cond_Branch
IL_29: ldloc V_0 # Pop0->Push1
IL_2A: ldc.i4 0 # Pop0->Pushi
IL_2B: ldloc V_0 # Pop0->Push1
IL_2C: ldlen # Popref->Pushi
IL_2D: conv.i4 # Pop1->Pushi
IL_2E: ldc.i4 1 # Pop0->Pushi
IL_2F: sub.ovf # Pop1_pop1->Push1
IL_30: call QuickSort() # Varpop->Varpush Flow=Call
IL_35: nop # Pop0->Push0
IL_36: ldc.i4 0 # Pop0->Pushi
IL_37: stloc V_1 # Pop1->Push0
IL_38: br IL_5C # Pop0->Push0 Flow=Branch
IL_3A: nop # Pop0->Push0
IL_3B: ldloc V_0 # Pop0->Push1
IL_3C: ldloc V_1 # Pop0->Push1
IL_3D: ldelema System.Int32# Popref_popi->Pushi
IL_42: call ToString() # Varpop->Varpush Flow=Call
IL_47: ldstr \" \" # Pop0->Pushref
IL_4C: call Concat() # Varpop->Varpush Flow=Call
IL_51: call Write() # Varpop->Varpush Flow=Call
IL_56: nop # Pop0->Push0
IL_57: nop # Pop0->Push0
IL_58: ldloc V_1 # Pop0->Push1
IL_59: ldc.i4 1 # Pop0->Pushi
IL_5A: add.ovf # Pop1_pop1->Push1
IL_5B: stloc V_1 # Pop1->Push0
IL_5C: ldloc V_1 # Pop0->Push1
IL_5D: ldloc V_0 # Pop0->Push1
IL_5E: ldlen # Popref->Pushi
IL_5F: conv.i4 # Pop1->Pushi
IL_60: clt # Pop1_pop1->Pushi
IL_62: stloc V_2 # Pop1->Push0
IL_63: ldloc V_2 # Pop0->Push1
IL_64: brtrue IL_3A # Popi->Push0 Flow=Cond_Branch
IL_66: ret # Varpop->Push0 Flow=Return
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
IL_00: nop # Pop0->Push0
IL_01: ldarg right # Pop0->Push1
IL_02: ldarg left # Pop0->Push1
IL_03: cgt # Pop1_pop1->Pushi
IL_05: ldc.i4 0 # Pop0->Pushi
IL_06: ceq # Pop1_pop1->Pushi
IL_08: stloc V_2 # Pop1->Push0
IL_09: ldloc V_2 # Pop0->Push1
IL_0A: brtrue IL_34 # Popi->Push0 Flow=Cond_Branch
IL_0C: nop # Pop0->Push0
IL_0D: ldarg left # Pop0->Push1
IL_0E: ldarg right # Pop0->Push1
IL_0F: add.ovf # Pop1_pop1->Push1
IL_10: ldc.i4 2 # Pop0->Pushi
IL_11: div # Pop1_pop1->Push1
IL_12: stloc V_0 # Pop1->Push0
IL_13: ldarg array # Pop0->Push1
IL_14: ldarg left # Pop0->Push1
IL_15: ldarg right # Pop0->Push1
IL_16: ldloc V_0 # Pop0->Push1
IL_17: call Partition() # Varpop->Varpush Flow=Call
IL_1C: stloc V_1 # Pop1->Push0
IL_1D: ldarg array # Pop0->Push1
IL_1E: ldarg left # Pop0->Push1
IL_1F: ldloc V_1 # Pop0->Push1
IL_20: ldc.i4 1 # Pop0->Pushi
IL_21: sub.ovf # Pop1_pop1->Push1
IL_22: call QuickSort() # Varpop->Varpush Flow=Call
IL_27: nop # Pop0->Push0
IL_28: ldarg array # Pop0->Push1
IL_29: ldloc V_1 # Pop0->Push1
IL_2A: ldc.i4 1 # Pop0->Pushi
IL_2B: add.ovf # Pop1_pop1->Push1
IL_2C: ldarg right # Pop0->Push1
IL_2D: call QuickSort() # Varpop->Varpush Flow=Call
IL_32: nop # Pop0->Push0
IL_33: nop # Pop0->Push0
IL_34: ret # Varpop->Push0 Flow=Return
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
IL_00: nop # Pop0->Push0
IL_01: ldarg array # Pop0->Push1
IL_02: ldarg pivotIndex # Pop0->Push1
IL_03: ldelem.i4 # Popref_popi->Pushi
IL_04: stloc V_0 # Pop1->Push0
IL_05: ldarg array # Pop0->Push1
IL_06: ldarg pivotIndex # Pop0->Push1
IL_07: ldarg right # Pop0->Push1
IL_08: call Swap() # Varpop->Varpush Flow=Call
IL_0D: nop # Pop0->Push0
IL_0E: ldarg left # Pop0->Push1
IL_0F: stloc V_1 # Pop1->Push0
IL_10: ldarg left # Pop0->Push1
IL_11: stloc V_2 # Pop1->Push0
IL_12: br IL_35 # Pop0->Push0 Flow=Branch
IL_14: nop # Pop0->Push0
IL_15: ldarg array # Pop0->Push1
IL_16: ldloc V_2 # Pop0->Push1
IL_17: ldelem.i4 # Popref_popi->Pushi
IL_18: ldloc V_0 # Pop0->Push1
IL_19: cgt # Pop1_pop1->Pushi
IL_1B: stloc V_4 # Pop1->Push0
IL_1D: ldloc V_4 # Pop0->Push1
IL_1F: brtrue IL_30 # Popi->Push0 Flow=Cond_Branch
IL_21: nop # Pop0->Push0
IL_22: ldarg array # Pop0->Push1
IL_23: ldloc V_1 # Pop0->Push1
IL_24: ldloc V_2 # Pop0->Push1
IL_25: call Swap() # Varpop->Varpush Flow=Call
IL_2A: nop # Pop0->Push0
IL_2B: ldloc V_1 # Pop0->Push1
IL_2C: ldc.i4 1 # Pop0->Pushi
IL_2D: add.ovf # Pop1_pop1->Push1
IL_2E: stloc V_1 # Pop1->Push0
IL_2F: nop # Pop0->Push0
IL_30: nop # Pop0->Push0
IL_31: ldloc V_2 # Pop0->Push1
IL_32: ldc.i4 1 # Pop0->Pushi
IL_33: add.ovf # Pop1_pop1->Push1
IL_34: stloc V_2 # Pop1->Push0
IL_35: ldloc V_2 # Pop0->Push1
IL_36: ldarg right # Pop0->Push1
IL_37: clt # Pop1_pop1->Pushi
IL_39: stloc V_4 # Pop1->Push0
IL_3B: ldloc V_4 # Pop0->Push1
IL_3D: brtrue IL_14 # Popi->Push0 Flow=Cond_Branch
IL_3F: ldarg array # Pop0->Push1
IL_40: ldarg right # Pop0->Push1
IL_41: ldloc V_1 # Pop0->Push1
IL_42: call Swap() # Varpop->Varpush Flow=Call
IL_47: nop # Pop0->Push0
IL_48: ldloc V_1 # Pop0->Push1
IL_49: stloc V_3 # Pop1->Push0
IL_4A: br IL_4C # Pop0->Push0 Flow=Branch
IL_4C: ldloc V_3 # Pop0->Push1
IL_4D: ret # Varpop->Push0 Flow=Return
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
IL_00: nop # Pop0->Push0
IL_01: ldarg array # Pop0->Push1
IL_02: ldarg index1 # Pop0->Push1
IL_03: ldelem.i4 # Popref_popi->Pushi
IL_04: stloc V_0 # Pop1->Push0
IL_05: ldarg array # Pop0->Push1
IL_06: ldarg index1 # Pop0->Push1
IL_07: ldarg array # Pop0->Push1
IL_08: ldarg index2 # Pop0->Push1
IL_09: ldelem.i4 # Popref_popi->Pushi
IL_0A: stelem.i4 # Popref_popi_popi->Push0
IL_0B: ldarg array # Pop0->Push1
IL_0C: ldarg index2 # Pop0->Push1
IL_0D: ldloc V_0 # Pop0->Push1
IL_0E: stelem.i4 # Popref_popi_popi->Push0
IL_0F: ret # Varpop->Push0 Flow=Return
}
}
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
IL_00: nop # Pop0->Push0
IL_01: ldarg args # Pop0->Push1
IL_02: ldlen # Popref->Pushi
IL_03: conv.i4 # Pop1->Pushi
IL_04: newarr System.Int32# Popi->Pushref
IL_09: stloc V_0 # Pop1->Push0
IL_0A: ldc.i4 0 # Pop0->Pushi
IL_0B: stloc V_1 # Pop1->Push0
IL_0C: br IL_1F # Pop0->Push0 Flow=Branch
IL_0E: nop # Pop0->Push0
IL_0F: ldloc V_0 # Pop0->Push1
IL_10: ldloc V_1 # Pop0->Push1
IL_11: ldarg args # Pop0->Push1
IL_12: ldloc V_1 # Pop0->Push1
IL_13: ldelem.ref # Popref_popi->Pushref
IL_14: call Parse() # Varpop->Varpush Flow=Call
IL_19: stelem.i4 # Popref_popi_popi->Push0
IL_1A: nop # Pop0->Push0
IL_1B: ldloc V_1 # Pop0->Push1
IL_1C: ldc.i4 1 # Pop0->Pushi
IL_1D: add.ovf # Pop1_pop1->Push1
IL_1E: stloc V_1 # Pop1->Push0
IL_1F: ldloc V_1 # Pop0->Push1
IL_20: ldloc V_0 # Pop0->Push1
IL_21: ldlen # Popref->Pushi
IL_22: conv.i4 # Pop1->Pushi
IL_23: clt # Pop1_pop1->Pushi
IL_25: stloc V_2 # Pop1->Push0
IL_26: ldloc V_2 # Pop0->Push1
IL_27: brtrue IL_0E # Popi->Push0 Flow=Cond_Branch
IL_29: ldloc V_0 # Pop0->Push1
IL_2A: ldc.i4 0 # Pop0->Pushi
IL_2B: ldloc V_0 # Pop0->Push1
IL_2C: ldlen # Popref->Pushi
IL_2D: conv.i4 # Pop1->Pushi
IL_2E: ldc.i4 1 # Pop0->Pushi
IL_2F: sub.ovf # Pop1_pop1->Push1
IL_30: call QuickSort() # Varpop->Varpush Flow=Call
IL_35: nop # Pop0->Push0
IL_36: ldc.i4 0 # Pop0->Pushi
IL_37: stloc V_1 # Pop1->Push0
IL_38: br IL_5C # Pop0->Push0 Flow=Branch
IL_3A: nop # Pop0->Push0
IL_3B: ldloc V_0 # Pop0->Push1
IL_3C: ldloc V_1 # Pop0->Push1
IL_3D: ldelema System.Int32# Popref_popi->Pushi
IL_42: call ToString() # Varpop->Varpush Flow=Call
IL_47: ldstr \" \" # Pop0->Pushref
IL_4C: call Concat() # Varpop->Varpush Flow=Call
IL_51: call Write() # Varpop->Varpush Flow=Call
IL_56: nop # Pop0->Push0
IL_57: nop # Pop0->Push0
IL_58: ldloc V_1 # Pop0->Push1
IL_59: ldc.i4 1 # Pop0->Pushi
IL_5A: add.ovf # Pop1_pop1->Push1
IL_5B: stloc V_1 # Pop1->Push0
IL_5C: ldloc V_1 # Pop0->Push1
IL_5D: ldloc V_0 # Pop0->Push1
IL_5E: ldlen # Popref->Pushi
IL_5F: conv.i4 # Pop1->Pushi
IL_60: clt # Pop1_pop1->Pushi
IL_62: stloc V_2 # Pop1->Push0
IL_63: ldloc V_2 # Pop0->Push1
IL_64: brtrue IL_3A # Popi->Push0 Flow=Cond_Branch
IL_66: ret # Varpop->Push0 Flow=Return
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
IL_00: nop # Pop0->Push0
IL_01: ldarg right # Pop0->Push1
IL_02: ldarg left # Pop0->Push1
IL_03: cgt # Pop1_pop1->Pushi
IL_05: ldc.i4 0 # Pop0->Pushi
IL_06: ceq # Pop1_pop1->Pushi
IL_08: stloc V_2 # Pop1->Push0
IL_09: ldloc V_2 # Pop0->Push1
IL_0A: brtrue IL_34 # Popi->Push0 Flow=Cond_Branch
IL_0C: nop # Pop0->Push0
IL_0D: ldarg left # Pop0->Push1
IL_0E: ldarg right # Pop0->Push1
IL_0F: add.ovf # Pop1_pop1->Push1
IL_10: ldc.i4 2 # Pop0->Pushi
IL_11: div # Pop1_pop1->Push1
IL_12: stloc V_0 # Pop1->Push0
IL_13: ldarg array # Pop0->Push1
IL_14: ldarg left # Pop0->Push1
IL_15: ldarg right # Pop0->Push1
IL_16: ldloc V_0 # Pop0->Push1
IL_17: call Partition() # Varpop->Varpush Flow=Call
IL_1C: stloc V_1 # Pop1->Push0
IL_1D: ldarg array # Pop0->Push1
IL_1E: ldarg left # Pop0->Push1
IL_1F: ldloc V_1 # Pop0->Push1
IL_20: ldc.i4 1 # Pop0->Pushi
IL_21: sub.ovf # Pop1_pop1->Push1
IL_22: call QuickSort() # Varpop->Varpush Flow=Call
IL_27: nop # Pop0->Push0
IL_28: ldarg array # Pop0->Push1
IL_29: ldloc V_1 # Pop0->Push1
IL_2A: ldc.i4 1 # Pop0->Pushi
IL_2B: add.ovf # Pop1_pop1->Push1
IL_2C: ldarg right # Pop0->Push1
IL_2D: call QuickSort() # Varpop->Varpush Flow=Call
IL_32: nop # Pop0->Push0
IL_33: nop # Pop0->Push0
IL_34: ret # Varpop->Push0 Flow=Return
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
IL_00: nop # Pop0->Push0
IL_01: ldarg array # Pop0->Push1
IL_02: ldarg pivotIndex # Pop0->Push1
IL_03: ldelem.i4 # Popref_popi->Pushi
IL_04: stloc V_0 # Pop1->Push0
IL_05: ldarg array # Pop0->Push1
IL_06: ldarg pivotIndex # Pop0->Push1
IL_07: ldarg right # Pop0->Push1
IL_08: call Swap() # Varpop->Varpush Flow=Call
IL_0D: nop # Pop0->Push0
IL_0E: ldarg left # Pop0->Push1
IL_0F: stloc V_1 # Pop1->Push0
IL_10: ldarg left # Pop0->Push1
IL_11: stloc V_2 # Pop1->Push0
IL_12: br IL_35 # Pop0->Push0 Flow=Branch
IL_14: nop # Pop0->Push0
IL_15: ldarg array # Pop0->Push1
IL_16: ldloc V_2 # Pop0->Push1
IL_17: ldelem.i4 # Popref_popi->Pushi
IL_18: ldloc V_0 # Pop0->Push1
IL_19: cgt # Pop1_pop1->Pushi
IL_1B: stloc V_4 # Pop1->Push0
IL_1D: ldloc V_4 # Pop0->Push1
IL_1F: brtrue IL_30 # Popi->Push0 Flow=Cond_Branch
IL_21: nop # Pop0->Push0
IL_22: ldarg array # Pop0->Push1
IL_23: ldloc V_1 # Pop0->Push1
IL_24: ldloc V_2 # Pop0->Push1
IL_25: call Swap() # Varpop->Varpush Flow=Call
IL_2A: nop # Pop0->Push0
IL_2B: ldloc V_1 # Pop0->Push1
IL_2C: ldc.i4 1 # Pop0->Pushi
IL_2D: add.ovf # Pop1_pop1->Push1
IL_2E: stloc V_1 # Pop1->Push0
IL_2F: nop # Pop0->Push0
IL_30: nop # Pop0->Push0
IL_31: ldloc V_2 # Pop0->Push1
IL_32: ldc.i4 1 # Pop0->Pushi
IL_33: add.ovf # Pop1_pop1->Push1
IL_34: stloc V_2 # Pop1->Push0
IL_35: ldloc V_2 # Pop0->Push1
IL_36: ldarg right # Pop0->Push1
IL_37: clt # Pop1_pop1->Pushi
IL_39: stloc V_4 # Pop1->Push0
IL_3B: ldloc V_4 # Pop0->Push1
IL_3D: brtrue IL_14 # Popi->Push0 Flow=Cond_Branch
IL_3F: ldarg array # Pop0->Push1
IL_40: ldarg right # Pop0->Push1
IL_41: ldloc V_1 # Pop0->Push1
IL_42: call Swap() # Varpop->Varpush Flow=Call
IL_47: nop # Pop0->Push0
IL_48: ldloc V_1 # Pop0->Push1
IL_49: stloc V_3 # Pop1->Push0
IL_4A: br IL_4C # Pop0->Push0 Flow=Branch
IL_4C: ldloc V_3 # Pop0->Push1
IL_4D: ret # Varpop->Push0 Flow=Return
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
IL_00: nop # Pop0->Push0
IL_01: ldarg array # Pop0->Push1
IL_02: ldarg index1 # Pop0->Push1
IL_03: ldelem.i4 # Popref_popi->Pushi
IL_04: stloc V_0 # Pop1->Push0
IL_05: ldarg array # Pop0->Push1
IL_06: ldarg index1 # Pop0->Push1
IL_07: ldarg array # Pop0->Push1
IL_08: ldarg index2 # Pop0->Push1
IL_09: ldelem.i4 # Popref_popi->Pushi
IL_0A: stelem.i4 # Popref_popi_popi->Push0
IL_0B: ldarg array # Pop0->Push1
IL_0C: ldarg index2 # Pop0->Push1
IL_0D: ldloc V_0 # Pop0->Push1
IL_0E: stelem.i4 # Popref_popi_popi->Push0
IL_0F: ret # Varpop->Push0 Flow=Return
}
}

734
Decompiler/doc/Dissertation/Evolution/01b_Disassemble_StackStates.cs → doc/Dissertation/Evolution/01b_Disassemble_StackStates.cs
Unescape View File

@ -1,368 +1,368 @@ @@ -1,368 +1,368 @@
namespace
{
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
IL_00: nop # Pop0->Push0
// Stack: {}
IL_01: ldarg args # Pop0->Push1
// Stack: {IL_01}
IL_02: ldlen # Popref->Pushi
// Stack: {IL_02}
IL_03: conv.i4 # Pop1->Pushi
// Stack: {IL_03}
IL_04: newarr System.Int32 # Popi->Pushref
// Stack: {IL_04}
IL_09: stloc V_0 # Pop1->Push0
// Stack: {}
IL_0A: ldc.i4 0 # Pop0->Pushi
// Stack: {IL_0A}
IL_0B: stloc V_1 # Pop1->Push0
// Stack: {}
IL_0C: br IL_1F # Pop0->Push0 Flow=Branch
// Stack: {}
IL_0E: nop # Pop0->Push0
// Stack: {}
IL_0F: ldloc V_0 # Pop0->Push1
// Stack: {IL_0F}
IL_10: ldloc V_1 # Pop0->Push1
// Stack: {IL_0F, IL_10}
IL_11: ldarg args # Pop0->Push1
// Stack: {IL_0F, IL_10, IL_11}
IL_12: ldloc V_1 # Pop0->Push1
// Stack: {IL_0F, IL_10, IL_11, IL_12}
IL_13: ldelem.ref # Popref_popi->Pushref
// Stack: {IL_0F, IL_10, IL_13}
IL_14: call Parse() # Varpop->Varpush Flow=Call
// Stack: {IL_0F, IL_10, IL_14}
IL_19: stelem.i4 # Popref_popi_popi->Push0
// Stack: {}
IL_1A: nop # Pop0->Push0
// Stack: {}
IL_1B: ldloc V_1 # Pop0->Push1
// Stack: {IL_1B}
IL_1C: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_1B, IL_1C}
IL_1D: add.ovf # Pop1_pop1->Push1
// Stack: {IL_1D}
IL_1E: stloc V_1 # Pop1->Push0
// Stack: {}
IL_1F: ldloc V_1 # Pop0->Push1
// Stack: {IL_1F}
IL_20: ldloc V_0 # Pop0->Push1
// Stack: {IL_1F, IL_20}
IL_21: ldlen # Popref->Pushi
// Stack: {IL_1F, IL_21}
IL_22: conv.i4 # Pop1->Pushi
// Stack: {IL_1F, IL_22}
IL_23: clt # Pop1_pop1->Pushi
// Stack: {IL_23}
IL_25: stloc V_2 # Pop1->Push0
// Stack: {}
IL_26: ldloc V_2 # Pop0->Push1
// Stack: {IL_26}
IL_27: brtrue IL_0E # Popi->Push0 Flow=Cond_Branch
// Stack: {}
IL_29: ldloc V_0 # Pop0->Push1
// Stack: {IL_29}
IL_2A: ldc.i4 0 # Pop0->Pushi
// Stack: {IL_29, IL_2A}
IL_2B: ldloc V_0 # Pop0->Push1
// Stack: {IL_29, IL_2A, IL_2B}
IL_2C: ldlen # Popref->Pushi
// Stack: {IL_29, IL_2A, IL_2C}
IL_2D: conv.i4 # Pop1->Pushi
// Stack: {IL_29, IL_2A, IL_2D}
IL_2E: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_29, IL_2A, IL_2D, IL_2E}
IL_2F: sub.ovf # Pop1_pop1->Push1
// Stack: {IL_29, IL_2A, IL_2F}
IL_30: call QuickSort() # Varpop->Varpush Flow=Call
// Stack: {}
IL_35: nop # Pop0->Push0
// Stack: {}
IL_36: ldc.i4 0 # Pop0->Pushi
// Stack: {IL_36}
IL_37: stloc V_1 # Pop1->Push0
// Stack: {}
IL_38: br IL_5C # Pop0->Push0 Flow=Branch
// Stack: {}
IL_3A: nop # Pop0->Push0
// Stack: {}
IL_3B: ldloc V_0 # Pop0->Push1
// Stack: {IL_3B}
IL_3C: ldloc V_1 # Pop0->Push1
// Stack: {IL_3B, IL_3C}
IL_3D: ldelema System.Int32 # Popref_popi->Pushi
// Stack: {IL_3D}
IL_42: call ToString() # Varpop->Varpush Flow=Call
// Stack: {IL_42}
IL_47: ldstr \" \" # Pop0->Pushref
// Stack: {IL_42, IL_47}
IL_4C: call Concat() # Varpop->Varpush Flow=Call
// Stack: {IL_4C}
IL_51: call Write() # Varpop->Varpush Flow=Call
// Stack: {}
IL_56: nop # Pop0->Push0
// Stack: {}
IL_57: nop # Pop0->Push0
// Stack: {}
IL_58: ldloc V_1 # Pop0->Push1
// Stack: {IL_58}
IL_59: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_58, IL_59}
IL_5A: add.ovf # Pop1_pop1->Push1
// Stack: {IL_5A}
IL_5B: stloc V_1 # Pop1->Push0
// Stack: {}
IL_5C: ldloc V_1 # Pop0->Push1
// Stack: {IL_5C}
IL_5D: ldloc V_0 # Pop0->Push1
// Stack: {IL_5C, IL_5D}
IL_5E: ldlen # Popref->Pushi
// Stack: {IL_5C, IL_5E}
IL_5F: conv.i4 # Pop1->Pushi
// Stack: {IL_5C, IL_5F}
IL_60: clt # Pop1_pop1->Pushi
// Stack: {IL_60}
IL_62: stloc V_2 # Pop1->Push0
// Stack: {}
IL_63: ldloc V_2 # Pop0->Push1
// Stack: {IL_63}
IL_64: brtrue IL_3A # Popi->Push0 Flow=Cond_Branch
// Stack: {}
IL_66: ret # Varpop->Push0 Flow=Return
// Stack: {}
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
IL_00: nop # Pop0->Push0
// Stack: {}
IL_01: ldarg right # Pop0->Push1
// Stack: {IL_01}
IL_02: ldarg left # Pop0->Push1
// Stack: {IL_01, IL_02}
IL_03: cgt # Pop1_pop1->Pushi
// Stack: {IL_03}
IL_05: ldc.i4 0 # Pop0->Pushi
// Stack: {IL_03, IL_05}
IL_06: ceq # Pop1_pop1->Pushi
// Stack: {IL_06}
IL_08: stloc V_2 # Pop1->Push0
// Stack: {}
IL_09: ldloc V_2 # Pop0->Push1
// Stack: {IL_09}
IL_0A: brtrue IL_34 # Popi->Push0 Flow=Cond_Branch
// Stack: {}
IL_0C: nop # Pop0->Push0
// Stack: {}
IL_0D: ldarg left # Pop0->Push1
// Stack: {IL_0D}
IL_0E: ldarg right # Pop0->Push1
// Stack: {IL_0D, IL_0E}
IL_0F: add.ovf # Pop1_pop1->Push1
// Stack: {IL_0F}
IL_10: ldc.i4 2 # Pop0->Pushi
// Stack: {IL_0F, IL_10}
IL_11: div # Pop1_pop1->Push1
// Stack: {IL_11}
IL_12: stloc V_0 # Pop1->Push0
// Stack: {}
IL_13: ldarg array # Pop0->Push1
// Stack: {IL_13}
IL_14: ldarg left # Pop0->Push1
// Stack: {IL_13, IL_14}
IL_15: ldarg right # Pop0->Push1
// Stack: {IL_13, IL_14, IL_15}
IL_16: ldloc V_0 # Pop0->Push1
// Stack: {IL_13, IL_14, IL_15, IL_16}
IL_17: call Partition() # Varpop->Varpush Flow=Call
// Stack: {IL_17}
IL_1C: stloc V_1 # Pop1->Push0
// Stack: {}
IL_1D: ldarg array # Pop0->Push1
// Stack: {IL_1D}
IL_1E: ldarg left # Pop0->Push1
// Stack: {IL_1D, IL_1E}
IL_1F: ldloc V_1 # Pop0->Push1
// Stack: {IL_1D, IL_1E, IL_1F}
IL_20: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_1D, IL_1E, IL_1F, IL_20}
IL_21: sub.ovf # Pop1_pop1->Push1
// Stack: {IL_1D, IL_1E, IL_21}
IL_22: call QuickSort() # Varpop->Varpush Flow=Call
// Stack: {}
IL_27: nop # Pop0->Push0
// Stack: {}
IL_28: ldarg array # Pop0->Push1
// Stack: {IL_28}
IL_29: ldloc V_1 # Pop0->Push1
// Stack: {IL_28, IL_29}
IL_2A: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_28, IL_29, IL_2A}
IL_2B: add.ovf # Pop1_pop1->Push1
// Stack: {IL_28, IL_2B}
IL_2C: ldarg right # Pop0->Push1
// Stack: {IL_28, IL_2B, IL_2C}
IL_2D: call QuickSort() # Varpop->Varpush Flow=Call
// Stack: {}
IL_32: nop # Pop0->Push0
// Stack: {}
IL_33: nop # Pop0->Push0
// Stack: {}
IL_34: ret # Varpop->Push0 Flow=Return
// Stack: {}
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
IL_00: nop # Pop0->Push0
// Stack: {}
IL_01: ldarg array # Pop0->Push1
// Stack: {IL_01}
IL_02: ldarg pivotIndex # Pop0->Push1
// Stack: {IL_01, IL_02}
IL_03: ldelem.i4 # Popref_popi->Pushi
// Stack: {IL_03}
IL_04: stloc V_0 # Pop1->Push0
// Stack: {}
IL_05: ldarg array # Pop0->Push1
// Stack: {IL_05}
IL_06: ldarg pivotIndex # Pop0->Push1
// Stack: {IL_05, IL_06}
IL_07: ldarg right # Pop0->Push1
// Stack: {IL_05, IL_06, IL_07}
IL_08: call Swap() # Varpop->Varpush Flow=Call
// Stack: {}
IL_0D: nop # Pop0->Push0
// Stack: {}
IL_0E: ldarg left # Pop0->Push1
// Stack: {IL_0E}
IL_0F: stloc V_1 # Pop1->Push0
// Stack: {}
IL_10: ldarg left # Pop0->Push1
// Stack: {IL_10}
IL_11: stloc V_2 # Pop1->Push0
// Stack: {}
IL_12: br IL_35 # Pop0->Push0 Flow=Branch
// Stack: {}
IL_14: nop # Pop0->Push0
// Stack: {}
IL_15: ldarg array # Pop0->Push1
// Stack: {IL_15}
IL_16: ldloc V_2 # Pop0->Push1
// Stack: {IL_15, IL_16}
IL_17: ldelem.i4 # Popref_popi->Pushi
// Stack: {IL_17}
IL_18: ldloc V_0 # Pop0->Push1
// Stack: {IL_17, IL_18}
IL_19: cgt # Pop1_pop1->Pushi
// Stack: {IL_19}
IL_1B: stloc V_4 # Pop1->Push0
// Stack: {}
IL_1D: ldloc V_4 # Pop0->Push1
// Stack: {IL_1D}
IL_1F: brtrue IL_30 # Popi->Push0 Flow=Cond_Branch
// Stack: {}
IL_21: nop # Pop0->Push0
// Stack: {}
IL_22: ldarg array # Pop0->Push1
// Stack: {IL_22}
IL_23: ldloc V_1 # Pop0->Push1
// Stack: {IL_22, IL_23}
IL_24: ldloc V_2 # Pop0->Push1
// Stack: {IL_22, IL_23, IL_24}
IL_25: call Swap() # Varpop->Varpush Flow=Call
// Stack: {}
IL_2A: nop # Pop0->Push0
// Stack: {}
IL_2B: ldloc V_1 # Pop0->Push1
// Stack: {IL_2B}
IL_2C: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_2B, IL_2C}
IL_2D: add.ovf # Pop1_pop1->Push1
// Stack: {IL_2D}
IL_2E: stloc V_1 # Pop1->Push0
// Stack: {}
IL_2F: nop # Pop0->Push0
// Stack: {}
IL_30: nop # Pop0->Push0
// Stack: {}
IL_31: ldloc V_2 # Pop0->Push1
// Stack: {IL_31}
IL_32: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_31, IL_32}
IL_33: add.ovf # Pop1_pop1->Push1
// Stack: {IL_33}
IL_34: stloc V_2 # Pop1->Push0
// Stack: {}
IL_35: ldloc V_2 # Pop0->Push1
// Stack: {IL_35}
IL_36: ldarg right # Pop0->Push1
// Stack: {IL_35, IL_36}
IL_37: clt # Pop1_pop1->Pushi
// Stack: {IL_37}
IL_39: stloc V_4 # Pop1->Push0
// Stack: {}
IL_3B: ldloc V_4 # Pop0->Push1
// Stack: {IL_3B}
IL_3D: brtrue IL_14 # Popi->Push0 Flow=Cond_Branch
// Stack: {}
IL_3F: ldarg array # Pop0->Push1
// Stack: {IL_3F}
IL_40: ldarg right # Pop0->Push1
// Stack: {IL_3F, IL_40}
IL_41: ldloc V_1 # Pop0->Push1
// Stack: {IL_3F, IL_40, IL_41}
IL_42: call Swap() # Varpop->Varpush Flow=Call
// Stack: {}
IL_47: nop # Pop0->Push0
// Stack: {}
IL_48: ldloc V_1 # Pop0->Push1
// Stack: {IL_48}
IL_49: stloc V_3 # Pop1->Push0
// Stack: {}
IL_4A: br IL_4C # Pop0->Push0 Flow=Branch
// Stack: {}
IL_4C: ldloc V_3 # Pop0->Push1
// Stack: {IL_4C}
IL_4D: ret # Varpop->Push0 Flow=Return
// Stack: {}
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
IL_00: nop # Pop0->Push0
// Stack: {}
IL_01: ldarg array # Pop0->Push1
// Stack: {IL_01}
IL_02: ldarg index1 # Pop0->Push1
// Stack: {IL_01, IL_02}
IL_03: ldelem.i4 # Popref_popi->Pushi
// Stack: {IL_03}
IL_04: stloc V_0 # Pop1->Push0
// Stack: {}
IL_05: ldarg array # Pop0->Push1
// Stack: {IL_05}
IL_06: ldarg index1 # Pop0->Push1
// Stack: {IL_05, IL_06}
IL_07: ldarg array # Pop0->Push1
// Stack: {IL_05, IL_06, IL_07}
IL_08: ldarg index2 # Pop0->Push1
// Stack: {IL_05, IL_06, IL_07, IL_08}
IL_09: ldelem.i4 # Popref_popi->Pushi
// Stack: {IL_05, IL_06, IL_09}
IL_0A: stelem.i4 # Popref_popi_popi->Push0
// Stack: {}
IL_0B: ldarg array # Pop0->Push1
// Stack: {IL_0B}
IL_0C: ldarg index2 # Pop0->Push1
// Stack: {IL_0B, IL_0C}
IL_0D: ldloc V_0 # Pop0->Push1
// Stack: {IL_0B, IL_0C, IL_0D}
IL_0E: stelem.i4 # Popref_popi_popi->Push0
// Stack: {}
IL_0F: ret # Varpop->Push0 Flow=Return
// Stack: {}
}
}
namespace
{
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
IL_00: nop # Pop0->Push0
// Stack: {}
IL_01: ldarg args # Pop0->Push1
// Stack: {IL_01}
IL_02: ldlen # Popref->Pushi
// Stack: {IL_02}
IL_03: conv.i4 # Pop1->Pushi
// Stack: {IL_03}
IL_04: newarr System.Int32 # Popi->Pushref
// Stack: {IL_04}
IL_09: stloc V_0 # Pop1->Push0
// Stack: {}
IL_0A: ldc.i4 0 # Pop0->Pushi
// Stack: {IL_0A}
IL_0B: stloc V_1 # Pop1->Push0
// Stack: {}
IL_0C: br IL_1F # Pop0->Push0 Flow=Branch
// Stack: {}
IL_0E: nop # Pop0->Push0
// Stack: {}
IL_0F: ldloc V_0 # Pop0->Push1
// Stack: {IL_0F}
IL_10: ldloc V_1 # Pop0->Push1
// Stack: {IL_0F, IL_10}
IL_11: ldarg args # Pop0->Push1
// Stack: {IL_0F, IL_10, IL_11}
IL_12: ldloc V_1 # Pop0->Push1
// Stack: {IL_0F, IL_10, IL_11, IL_12}
IL_13: ldelem.ref # Popref_popi->Pushref
// Stack: {IL_0F, IL_10, IL_13}
IL_14: call Parse() # Varpop->Varpush Flow=Call
// Stack: {IL_0F, IL_10, IL_14}
IL_19: stelem.i4 # Popref_popi_popi->Push0
// Stack: {}
IL_1A: nop # Pop0->Push0
// Stack: {}
IL_1B: ldloc V_1 # Pop0->Push1
// Stack: {IL_1B}
IL_1C: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_1B, IL_1C}
IL_1D: add.ovf # Pop1_pop1->Push1
// Stack: {IL_1D}
IL_1E: stloc V_1 # Pop1->Push0
// Stack: {}
IL_1F: ldloc V_1 # Pop0->Push1
// Stack: {IL_1F}
IL_20: ldloc V_0 # Pop0->Push1
// Stack: {IL_1F, IL_20}
IL_21: ldlen # Popref->Pushi
// Stack: {IL_1F, IL_21}
IL_22: conv.i4 # Pop1->Pushi
// Stack: {IL_1F, IL_22}
IL_23: clt # Pop1_pop1->Pushi
// Stack: {IL_23}
IL_25: stloc V_2 # Pop1->Push0
// Stack: {}
IL_26: ldloc V_2 # Pop0->Push1
// Stack: {IL_26}
IL_27: brtrue IL_0E # Popi->Push0 Flow=Cond_Branch
// Stack: {}
IL_29: ldloc V_0 # Pop0->Push1
// Stack: {IL_29}
IL_2A: ldc.i4 0 # Pop0->Pushi
// Stack: {IL_29, IL_2A}
IL_2B: ldloc V_0 # Pop0->Push1
// Stack: {IL_29, IL_2A, IL_2B}
IL_2C: ldlen # Popref->Pushi
// Stack: {IL_29, IL_2A, IL_2C}
IL_2D: conv.i4 # Pop1->Pushi
// Stack: {IL_29, IL_2A, IL_2D}
IL_2E: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_29, IL_2A, IL_2D, IL_2E}
IL_2F: sub.ovf # Pop1_pop1->Push1
// Stack: {IL_29, IL_2A, IL_2F}
IL_30: call QuickSort() # Varpop->Varpush Flow=Call
// Stack: {}
IL_35: nop # Pop0->Push0
// Stack: {}
IL_36: ldc.i4 0 # Pop0->Pushi
// Stack: {IL_36}
IL_37: stloc V_1 # Pop1->Push0
// Stack: {}
IL_38: br IL_5C # Pop0->Push0 Flow=Branch
// Stack: {}
IL_3A: nop # Pop0->Push0
// Stack: {}
IL_3B: ldloc V_0 # Pop0->Push1
// Stack: {IL_3B}
IL_3C: ldloc V_1 # Pop0->Push1
// Stack: {IL_3B, IL_3C}
IL_3D: ldelema System.Int32 # Popref_popi->Pushi
// Stack: {IL_3D}
IL_42: call ToString() # Varpop->Varpush Flow=Call
// Stack: {IL_42}
IL_47: ldstr \" \" # Pop0->Pushref
// Stack: {IL_42, IL_47}
IL_4C: call Concat() # Varpop->Varpush Flow=Call
// Stack: {IL_4C}
IL_51: call Write() # Varpop->Varpush Flow=Call
// Stack: {}
IL_56: nop # Pop0->Push0
// Stack: {}
IL_57: nop # Pop0->Push0
// Stack: {}
IL_58: ldloc V_1 # Pop0->Push1
// Stack: {IL_58}
IL_59: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_58, IL_59}
IL_5A: add.ovf # Pop1_pop1->Push1
// Stack: {IL_5A}
IL_5B: stloc V_1 # Pop1->Push0
// Stack: {}
IL_5C: ldloc V_1 # Pop0->Push1
// Stack: {IL_5C}
IL_5D: ldloc V_0 # Pop0->Push1
// Stack: {IL_5C, IL_5D}
IL_5E: ldlen # Popref->Pushi
// Stack: {IL_5C, IL_5E}
IL_5F: conv.i4 # Pop1->Pushi
// Stack: {IL_5C, IL_5F}
IL_60: clt # Pop1_pop1->Pushi
// Stack: {IL_60}
IL_62: stloc V_2 # Pop1->Push0
// Stack: {}
IL_63: ldloc V_2 # Pop0->Push1
// Stack: {IL_63}
IL_64: brtrue IL_3A # Popi->Push0 Flow=Cond_Branch
// Stack: {}
IL_66: ret # Varpop->Push0 Flow=Return
// Stack: {}
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
IL_00: nop # Pop0->Push0
// Stack: {}
IL_01: ldarg right # Pop0->Push1
// Stack: {IL_01}
IL_02: ldarg left # Pop0->Push1
// Stack: {IL_01, IL_02}
IL_03: cgt # Pop1_pop1->Pushi
// Stack: {IL_03}
IL_05: ldc.i4 0 # Pop0->Pushi
// Stack: {IL_03, IL_05}
IL_06: ceq # Pop1_pop1->Pushi
// Stack: {IL_06}
IL_08: stloc V_2 # Pop1->Push0
// Stack: {}
IL_09: ldloc V_2 # Pop0->Push1
// Stack: {IL_09}
IL_0A: brtrue IL_34 # Popi->Push0 Flow=Cond_Branch
// Stack: {}
IL_0C: nop # Pop0->Push0
// Stack: {}
IL_0D: ldarg left # Pop0->Push1
// Stack: {IL_0D}
IL_0E: ldarg right # Pop0->Push1
// Stack: {IL_0D, IL_0E}
IL_0F: add.ovf # Pop1_pop1->Push1
// Stack: {IL_0F}
IL_10: ldc.i4 2 # Pop0->Pushi
// Stack: {IL_0F, IL_10}
IL_11: div # Pop1_pop1->Push1
// Stack: {IL_11}
IL_12: stloc V_0 # Pop1->Push0
// Stack: {}
IL_13: ldarg array # Pop0->Push1
// Stack: {IL_13}
IL_14: ldarg left # Pop0->Push1
// Stack: {IL_13, IL_14}
IL_15: ldarg right # Pop0->Push1
// Stack: {IL_13, IL_14, IL_15}
IL_16: ldloc V_0 # Pop0->Push1
// Stack: {IL_13, IL_14, IL_15, IL_16}
IL_17: call Partition() # Varpop->Varpush Flow=Call
// Stack: {IL_17}
IL_1C: stloc V_1 # Pop1->Push0
// Stack: {}
IL_1D: ldarg array # Pop0->Push1
// Stack: {IL_1D}
IL_1E: ldarg left # Pop0->Push1
// Stack: {IL_1D, IL_1E}
IL_1F: ldloc V_1 # Pop0->Push1
// Stack: {IL_1D, IL_1E, IL_1F}
IL_20: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_1D, IL_1E, IL_1F, IL_20}
IL_21: sub.ovf # Pop1_pop1->Push1
// Stack: {IL_1D, IL_1E, IL_21}
IL_22: call QuickSort() # Varpop->Varpush Flow=Call
// Stack: {}
IL_27: nop # Pop0->Push0
// Stack: {}
IL_28: ldarg array # Pop0->Push1
// Stack: {IL_28}
IL_29: ldloc V_1 # Pop0->Push1
// Stack: {IL_28, IL_29}
IL_2A: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_28, IL_29, IL_2A}
IL_2B: add.ovf # Pop1_pop1->Push1
// Stack: {IL_28, IL_2B}
IL_2C: ldarg right # Pop0->Push1
// Stack: {IL_28, IL_2B, IL_2C}
IL_2D: call QuickSort() # Varpop->Varpush Flow=Call
// Stack: {}
IL_32: nop # Pop0->Push0
// Stack: {}
IL_33: nop # Pop0->Push0
// Stack: {}
IL_34: ret # Varpop->Push0 Flow=Return
// Stack: {}
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
IL_00: nop # Pop0->Push0
// Stack: {}
IL_01: ldarg array # Pop0->Push1
// Stack: {IL_01}
IL_02: ldarg pivotIndex # Pop0->Push1
// Stack: {IL_01, IL_02}
IL_03: ldelem.i4 # Popref_popi->Pushi
// Stack: {IL_03}
IL_04: stloc V_0 # Pop1->Push0
// Stack: {}
IL_05: ldarg array # Pop0->Push1
// Stack: {IL_05}
IL_06: ldarg pivotIndex # Pop0->Push1
// Stack: {IL_05, IL_06}
IL_07: ldarg right # Pop0->Push1
// Stack: {IL_05, IL_06, IL_07}
IL_08: call Swap() # Varpop->Varpush Flow=Call
// Stack: {}
IL_0D: nop # Pop0->Push0
// Stack: {}
IL_0E: ldarg left # Pop0->Push1
// Stack: {IL_0E}
IL_0F: stloc V_1 # Pop1->Push0
// Stack: {}
IL_10: ldarg left # Pop0->Push1
// Stack: {IL_10}
IL_11: stloc V_2 # Pop1->Push0
// Stack: {}
IL_12: br IL_35 # Pop0->Push0 Flow=Branch
// Stack: {}
IL_14: nop # Pop0->Push0
// Stack: {}
IL_15: ldarg array # Pop0->Push1
// Stack: {IL_15}
IL_16: ldloc V_2 # Pop0->Push1
// Stack: {IL_15, IL_16}
IL_17: ldelem.i4 # Popref_popi->Pushi
// Stack: {IL_17}
IL_18: ldloc V_0 # Pop0->Push1
// Stack: {IL_17, IL_18}
IL_19: cgt # Pop1_pop1->Pushi
// Stack: {IL_19}
IL_1B: stloc V_4 # Pop1->Push0
// Stack: {}
IL_1D: ldloc V_4 # Pop0->Push1
// Stack: {IL_1D}
IL_1F: brtrue IL_30 # Popi->Push0 Flow=Cond_Branch
// Stack: {}
IL_21: nop # Pop0->Push0
// Stack: {}
IL_22: ldarg array # Pop0->Push1
// Stack: {IL_22}
IL_23: ldloc V_1 # Pop0->Push1
// Stack: {IL_22, IL_23}
IL_24: ldloc V_2 # Pop0->Push1
// Stack: {IL_22, IL_23, IL_24}
IL_25: call Swap() # Varpop->Varpush Flow=Call
// Stack: {}
IL_2A: nop # Pop0->Push0
// Stack: {}
IL_2B: ldloc V_1 # Pop0->Push1
// Stack: {IL_2B}
IL_2C: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_2B, IL_2C}
IL_2D: add.ovf # Pop1_pop1->Push1
// Stack: {IL_2D}
IL_2E: stloc V_1 # Pop1->Push0
// Stack: {}
IL_2F: nop # Pop0->Push0
// Stack: {}
IL_30: nop # Pop0->Push0
// Stack: {}
IL_31: ldloc V_2 # Pop0->Push1
// Stack: {IL_31}
IL_32: ldc.i4 1 # Pop0->Pushi
// Stack: {IL_31, IL_32}
IL_33: add.ovf # Pop1_pop1->Push1
// Stack: {IL_33}
IL_34: stloc V_2 # Pop1->Push0
// Stack: {}
IL_35: ldloc V_2 # Pop0->Push1
// Stack: {IL_35}
IL_36: ldarg right # Pop0->Push1
// Stack: {IL_35, IL_36}
IL_37: clt # Pop1_pop1->Pushi
// Stack: {IL_37}
IL_39: stloc V_4 # Pop1->Push0
// Stack: {}
IL_3B: ldloc V_4 # Pop0->Push1
// Stack: {IL_3B}
IL_3D: brtrue IL_14 # Popi->Push0 Flow=Cond_Branch
// Stack: {}
IL_3F: ldarg array # Pop0->Push1
// Stack: {IL_3F}
IL_40: ldarg right # Pop0->Push1
// Stack: {IL_3F, IL_40}
IL_41: ldloc V_1 # Pop0->Push1
// Stack: {IL_3F, IL_40, IL_41}
IL_42: call Swap() # Varpop->Varpush Flow=Call
// Stack: {}
IL_47: nop # Pop0->Push0
// Stack: {}
IL_48: ldloc V_1 # Pop0->Push1
// Stack: {IL_48}
IL_49: stloc V_3 # Pop1->Push0
// Stack: {}
IL_4A: br IL_4C # Pop0->Push0 Flow=Branch
// Stack: {}
IL_4C: ldloc V_3 # Pop0->Push1
// Stack: {IL_4C}
IL_4D: ret # Varpop->Push0 Flow=Return
// Stack: {}
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
IL_00: nop # Pop0->Push0
// Stack: {}
IL_01: ldarg array # Pop0->Push1
// Stack: {IL_01}
IL_02: ldarg index1 # Pop0->Push1
// Stack: {IL_01, IL_02}
IL_03: ldelem.i4 # Popref_popi->Pushi
// Stack: {IL_03}
IL_04: stloc V_0 # Pop1->Push0
// Stack: {}
IL_05: ldarg array # Pop0->Push1
// Stack: {IL_05}
IL_06: ldarg index1 # Pop0->Push1
// Stack: {IL_05, IL_06}
IL_07: ldarg array # Pop0->Push1
// Stack: {IL_05, IL_06, IL_07}
IL_08: ldarg index2 # Pop0->Push1
// Stack: {IL_05, IL_06, IL_07, IL_08}
IL_09: ldelem.i4 # Popref_popi->Pushi
// Stack: {IL_05, IL_06, IL_09}
IL_0A: stelem.i4 # Popref_popi_popi->Push0
// Stack: {}
IL_0B: ldarg array # Pop0->Push1
// Stack: {IL_0B}
IL_0C: ldarg index2 # Pop0->Push1
// Stack: {IL_0B, IL_0C}
IL_0D: ldloc V_0 # Pop0->Push1
// Stack: {IL_0B, IL_0C, IL_0D}
IL_0E: stelem.i4 # Popref_popi_popi->Push0
// Stack: {}
IL_0F: ret # Varpop->Push0 Flow=Return
// Stack: {}
}
}
}

380
Decompiler/doc/Dissertation/Evolution/02_Peephole_decompilation.cs → doc/Dissertation/Evolution/02_Peephole_decompilation.cs
Unescape View File

@ -1,190 +1,190 @@ @@ -1,190 +1,190 @@
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
IL_00: // No-op
IL_01: System.String[] expr01 = args;
IL_02: int expr02 = arg1.Length;
IL_03: int expr03 = (Int32)arg1;
IL_04: object expr04 = new int[arg1];
IL_09: V_0 = arg1;
IL_0A: short expr0A = 0;
IL_0B: V_1 = arg1;
IL_0C: goto IL_1F;
IL_0E: // No-op
IL_0F: System.Int32[] expr0F = V_0;
IL_10: int expr10 = V_1;
IL_11: System.String[] expr11 = args;
IL_12: int expr12 = V_1;
IL_13: object expr13 = arg1[arg2];
IL_14: int expr14 = System.Int32.Parse(arg0);
IL_19: arg1[arg2] = arg3;
IL_1A: // No-op
IL_1B: int expr1B = V_1;
IL_1C: short expr1C = 1;
IL_1D: int expr1D = arg1 + arg2;
IL_1E: V_1 = arg1;
IL_1F: int expr1F = V_1;
IL_20: System.Int32[] expr20 = V_0;
IL_21: int expr21 = arg1.Length;
IL_22: int expr22 = (Int32)arg1;
IL_23: bool expr23 = arg1 < arg2;
IL_25: V_2 = arg1;
IL_26: bool expr26 = V_2;
IL_27: if (arg1) goto IL_0E;
IL_29: System.Int32[] expr29 = V_0;
IL_2A: short expr2A = 0;
IL_2B: System.Int32[] expr2B = V_0;
IL_2C: int expr2C = arg1.Length;
IL_2D: int expr2D = (Int32)arg1;
IL_2E: short expr2E = 1;
IL_2F: int expr2F = arg1 - arg2;
IL_30: QuickSortProgram.QuickSort(arg0, arg1, arg2);
IL_35: // No-op
IL_36: short expr36 = 0;
IL_37: V_1 = arg1;
IL_38: goto IL_5C;
IL_3A: // No-op
IL_3B: System.Int32[] expr3B = V_0;
IL_3C: int expr3C = V_1;
IL_3D: object expr3D = arg1[arg2];
IL_42: string expr42 = arg1.ToString();
IL_47: string expr47 = " ";
IL_4C: string expr4C = System.String.Concat(arg0, arg1);
IL_51: System.Console.Write(arg0);
IL_56: // No-op
IL_57: // No-op
IL_58: int expr58 = V_1;
IL_59: short expr59 = 1;
IL_5A: int expr5A = arg1 + arg2;
IL_5B: V_1 = arg1;
IL_5C: int expr5C = V_1;
IL_5D: System.Int32[] expr5D = V_0;
IL_5E: int expr5E = arg1.Length;
IL_5F: int expr5F = (Int32)arg1;
IL_60: bool expr60 = arg1 < arg2;
IL_62: V_2 = arg1;
IL_63: bool expr63 = V_2;
IL_64: if (arg1) goto IL_3A;
IL_66: return;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
IL_00: // No-op
IL_01: int expr01 = right;
IL_02: int expr02 = left;
IL_03: bool expr03 = arg1 > arg2;
IL_05: short expr05 = 0;
IL_06: bool expr06 = arg1 == arg2;
IL_08: V_2 = arg1;
IL_09: bool expr09 = V_2;
IL_0A: if (arg1) goto IL_34;
IL_0C: // No-op
IL_0D: int expr0D = left;
IL_0E: int expr0E = right;
IL_0F: int expr0F = arg1 + arg2;
IL_10: short expr10 = 2;
IL_11: int expr11 = arg1 / arg2;
IL_12: V_0 = arg1;
IL_13: System.Int32[] expr13 = array;
IL_14: int expr14 = left;
IL_15: int expr15 = right;
IL_16: int expr16 = V_0;
IL_17: int expr17 = QuickSortProgram.Partition(arg0, arg1, arg2, arg3);
IL_1C: V_1 = arg1;
IL_1D: System.Int32[] expr1D = array;
IL_1E: int expr1E = left;
IL_1F: int expr1F = V_1;
IL_20: short expr20 = 1;
IL_21: int expr21 = arg1 - arg2;
IL_22: QuickSortProgram.QuickSort(arg0, arg1, arg2);
IL_27: // No-op
IL_28: System.Int32[] expr28 = array;
IL_29: int expr29 = V_1;
IL_2A: short expr2A = 1;
IL_2B: int expr2B = arg1 + arg2;
IL_2C: int expr2C = right;
IL_2D: QuickSortProgram.QuickSort(arg0, arg1, arg2);
IL_32: // No-op
IL_33: // No-op
IL_34: return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
IL_00: // No-op
IL_01: System.Int32[] expr01 = array;
IL_02: int expr02 = pivotIndex;
IL_03: int expr03 = arg1[arg2];
IL_04: V_0 = arg1;
IL_05: System.Int32[] expr05 = array;
IL_06: int expr06 = pivotIndex;
IL_07: int expr07 = right;
IL_08: QuickSortProgram.Swap(arg0, arg1, arg2);
IL_0D: // No-op
IL_0E: int expr0E = left;
IL_0F: V_1 = arg1;
IL_10: int expr10 = left;
IL_11: V_2 = arg1;
IL_12: goto IL_35;
IL_14: // No-op
IL_15: System.Int32[] expr15 = array;
IL_16: int expr16 = V_2;
IL_17: int expr17 = arg1[arg2];
IL_18: int expr18 = V_0;
IL_19: bool expr19 = arg1 > arg2;
IL_1B: V_4 = arg1;
IL_1D: bool expr1D = V_4;
IL_1F: if (arg1) goto IL_30;
IL_21: // No-op
IL_22: System.Int32[] expr22 = array;
IL_23: int expr23 = V_1;
IL_24: int expr24 = V_2;
IL_25: QuickSortProgram.Swap(arg0, arg1, arg2);
IL_2A: // No-op
IL_2B: int expr2B = V_1;
IL_2C: short expr2C = 1;
IL_2D: int expr2D = arg1 + arg2;
IL_2E: V_1 = arg1;
IL_2F: // No-op
IL_30: // No-op
IL_31: int expr31 = V_2;
IL_32: short expr32 = 1;
IL_33: int expr33 = arg1 + arg2;
IL_34: V_2 = arg1;
IL_35: int expr35 = V_2;
IL_36: int expr36 = right;
IL_37: bool expr37 = arg1 < arg2;
IL_39: V_4 = arg1;
IL_3B: bool expr3B = V_4;
IL_3D: if (arg1) goto IL_14;
IL_3F: System.Int32[] expr3F = array;
IL_40: int expr40 = right;
IL_41: int expr41 = V_1;
IL_42: QuickSortProgram.Swap(arg0, arg1, arg2);
IL_47: // No-op
IL_48: int expr48 = V_1;
IL_49: V_3 = arg1;
IL_4A: goto IL_4C;
IL_4C: int expr4C = V_3;
IL_4D: return arg1;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
IL_00: // No-op
IL_01: System.Int32[] expr01 = array;
IL_02: int expr02 = index1;
IL_03: int expr03 = arg1[arg2];
IL_04: V_0 = arg1;
IL_05: System.Int32[] expr05 = array;
IL_06: int expr06 = index1;
IL_07: System.Int32[] expr07 = array;
IL_08: int expr08 = index2;
IL_09: int expr09 = arg1[arg2];
IL_0A: arg1[arg2] = arg3;
IL_0B: System.Int32[] expr0B = array;
IL_0C: int expr0C = index2;
IL_0D: int expr0D = V_0;
IL_0E: arg1[arg2] = arg3;
IL_0F: return;
}
}
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
IL_00: // No-op
IL_01: System.String[] expr01 = args;
IL_02: int expr02 = arg1.Length;
IL_03: int expr03 = (Int32)arg1;
IL_04: object expr04 = new int[arg1];
IL_09: V_0 = arg1;
IL_0A: short expr0A = 0;
IL_0B: V_1 = arg1;
IL_0C: goto IL_1F;
IL_0E: // No-op
IL_0F: System.Int32[] expr0F = V_0;
IL_10: int expr10 = V_1;
IL_11: System.String[] expr11 = args;
IL_12: int expr12 = V_1;
IL_13: object expr13 = arg1[arg2];
IL_14: int expr14 = System.Int32.Parse(arg0);
IL_19: arg1[arg2] = arg3;
IL_1A: // No-op
IL_1B: int expr1B = V_1;
IL_1C: short expr1C = 1;
IL_1D: int expr1D = arg1 + arg2;
IL_1E: V_1 = arg1;
IL_1F: int expr1F = V_1;
IL_20: System.Int32[] expr20 = V_0;
IL_21: int expr21 = arg1.Length;
IL_22: int expr22 = (Int32)arg1;
IL_23: bool expr23 = arg1 < arg2;
IL_25: V_2 = arg1;
IL_26: bool expr26 = V_2;
IL_27: if (arg1) goto IL_0E;
IL_29: System.Int32[] expr29 = V_0;
IL_2A: short expr2A = 0;
IL_2B: System.Int32[] expr2B = V_0;
IL_2C: int expr2C = arg1.Length;
IL_2D: int expr2D = (Int32)arg1;
IL_2E: short expr2E = 1;
IL_2F: int expr2F = arg1 - arg2;
IL_30: QuickSortProgram.QuickSort(arg0, arg1, arg2);
IL_35: // No-op
IL_36: short expr36 = 0;
IL_37: V_1 = arg1;
IL_38: goto IL_5C;
IL_3A: // No-op
IL_3B: System.Int32[] expr3B = V_0;
IL_3C: int expr3C = V_1;
IL_3D: object expr3D = arg1[arg2];
IL_42: string expr42 = arg1.ToString();
IL_47: string expr47 = " ";
IL_4C: string expr4C = System.String.Concat(arg0, arg1);
IL_51: System.Console.Write(arg0);
IL_56: // No-op
IL_57: // No-op
IL_58: int expr58 = V_1;
IL_59: short expr59 = 1;
IL_5A: int expr5A = arg1 + arg2;
IL_5B: V_1 = arg1;
IL_5C: int expr5C = V_1;
IL_5D: System.Int32[] expr5D = V_0;
IL_5E: int expr5E = arg1.Length;
IL_5F: int expr5F = (Int32)arg1;
IL_60: bool expr60 = arg1 < arg2;
IL_62: V_2 = arg1;
IL_63: bool expr63 = V_2;
IL_64: if (arg1) goto IL_3A;
IL_66: return;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
IL_00: // No-op
IL_01: int expr01 = right;
IL_02: int expr02 = left;
IL_03: bool expr03 = arg1 > arg2;
IL_05: short expr05 = 0;
IL_06: bool expr06 = arg1 == arg2;
IL_08: V_2 = arg1;
IL_09: bool expr09 = V_2;
IL_0A: if (arg1) goto IL_34;
IL_0C: // No-op
IL_0D: int expr0D = left;
IL_0E: int expr0E = right;
IL_0F: int expr0F = arg1 + arg2;
IL_10: short expr10 = 2;
IL_11: int expr11 = arg1 / arg2;
IL_12: V_0 = arg1;
IL_13: System.Int32[] expr13 = array;
IL_14: int expr14 = left;
IL_15: int expr15 = right;
IL_16: int expr16 = V_0;
IL_17: int expr17 = QuickSortProgram.Partition(arg0, arg1, arg2, arg3);
IL_1C: V_1 = arg1;
IL_1D: System.Int32[] expr1D = array;
IL_1E: int expr1E = left;
IL_1F: int expr1F = V_1;
IL_20: short expr20 = 1;
IL_21: int expr21 = arg1 - arg2;
IL_22: QuickSortProgram.QuickSort(arg0, arg1, arg2);
IL_27: // No-op
IL_28: System.Int32[] expr28 = array;
IL_29: int expr29 = V_1;
IL_2A: short expr2A = 1;
IL_2B: int expr2B = arg1 + arg2;
IL_2C: int expr2C = right;
IL_2D: QuickSortProgram.QuickSort(arg0, arg1, arg2);
IL_32: // No-op
IL_33: // No-op
IL_34: return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
IL_00: // No-op
IL_01: System.Int32[] expr01 = array;
IL_02: int expr02 = pivotIndex;
IL_03: int expr03 = arg1[arg2];
IL_04: V_0 = arg1;
IL_05: System.Int32[] expr05 = array;
IL_06: int expr06 = pivotIndex;
IL_07: int expr07 = right;
IL_08: QuickSortProgram.Swap(arg0, arg1, arg2);
IL_0D: // No-op
IL_0E: int expr0E = left;
IL_0F: V_1 = arg1;
IL_10: int expr10 = left;
IL_11: V_2 = arg1;
IL_12: goto IL_35;
IL_14: // No-op
IL_15: System.Int32[] expr15 = array;
IL_16: int expr16 = V_2;
IL_17: int expr17 = arg1[arg2];
IL_18: int expr18 = V_0;
IL_19: bool expr19 = arg1 > arg2;
IL_1B: V_4 = arg1;
IL_1D: bool expr1D = V_4;
IL_1F: if (arg1) goto IL_30;
IL_21: // No-op
IL_22: System.Int32[] expr22 = array;
IL_23: int expr23 = V_1;
IL_24: int expr24 = V_2;
IL_25: QuickSortProgram.Swap(arg0, arg1, arg2);
IL_2A: // No-op
IL_2B: int expr2B = V_1;
IL_2C: short expr2C = 1;
IL_2D: int expr2D = arg1 + arg2;
IL_2E: V_1 = arg1;
IL_2F: // No-op
IL_30: // No-op
IL_31: int expr31 = V_2;
IL_32: short expr32 = 1;
IL_33: int expr33 = arg1 + arg2;
IL_34: V_2 = arg1;
IL_35: int expr35 = V_2;
IL_36: int expr36 = right;
IL_37: bool expr37 = arg1 < arg2;
IL_39: V_4 = arg1;
IL_3B: bool expr3B = V_4;
IL_3D: if (arg1) goto IL_14;
IL_3F: System.Int32[] expr3F = array;
IL_40: int expr40 = right;
IL_41: int expr41 = V_1;
IL_42: QuickSortProgram.Swap(arg0, arg1, arg2);
IL_47: // No-op
IL_48: int expr48 = V_1;
IL_49: V_3 = arg1;
IL_4A: goto IL_4C;
IL_4C: int expr4C = V_3;
IL_4D: return arg1;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
IL_00: // No-op
IL_01: System.Int32[] expr01 = array;
IL_02: int expr02 = index1;
IL_03: int expr03 = arg1[arg2];
IL_04: V_0 = arg1;
IL_05: System.Int32[] expr05 = array;
IL_06: int expr06 = index1;
IL_07: System.Int32[] expr07 = array;
IL_08: int expr08 = index2;
IL_09: int expr09 = arg1[arg2];
IL_0A: arg1[arg2] = arg3;
IL_0B: System.Int32[] expr0B = array;
IL_0C: int expr0C = index2;
IL_0D: int expr0D = V_0;
IL_0E: arg1[arg2] = arg3;
IL_0F: return;
}
}

406
Decompiler/doc/Dissertation/Evolution/03_Dataflow.cs → doc/Dissertation/Evolution/03_Dataflow.cs
Unescape View File

@ -1,203 +1,203 @@ @@ -1,203 +1,203 @@
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
System.Int32[] V_0;
int V_1;
bool V_2;
// No-op
System.String[] expr01 = args;
int expr02 = expr01.Length;
int expr03 = (Int32)expr02;
System.Int32[] expr04 = new int[expr03];
V_0 = expr04;
int expr0A = 0;
V_1 = expr0A;
goto IL_1F;
IL_0E: // No-op
System.Int32[] expr0F = V_0;
int expr10 = V_1;
System.String[] expr11 = args;
int expr12 = V_1;
string expr13 = expr11[expr12];
int expr14 = System.Int32.Parse(expr13);
expr0F[expr10] = expr14;
// No-op
int expr1B = V_1;
int expr1C = 1;
int expr1D = expr1B + expr1C;
V_1 = expr1D;
IL_1F: int expr1F = V_1;
System.Int32[] expr20 = V_0;
int expr21 = expr20.Length;
int expr22 = (Int32)expr21;
bool expr23 = expr1F < expr22;
V_2 = expr23;
bool expr26 = V_2;
if (expr26) goto IL_0E;
System.Int32[] expr29 = V_0;
int expr2A = 0;
System.Int32[] expr2B = V_0;
int expr2C = expr2B.Length;
int expr2D = (Int32)expr2C;
int expr2E = 1;
int expr2F = expr2D - expr2E;
QuickSortProgram.QuickSort(expr29, expr2A, expr2F);
// No-op
int expr36 = 0;
V_1 = expr36;
goto IL_5C;
IL_3A: // No-op
System.Int32[] expr3B = V_0;
int expr3C = V_1;
object expr3D = expr3B[expr3C];
string expr42 = expr3D.ToString();
string expr47 = " ";
string expr4C = System.String.Concat(expr42, expr47);
System.Console.Write(expr4C);
// No-op
// No-op
int expr58 = V_1;
int expr59 = 1;
int expr5A = expr58 + expr59;
V_1 = expr5A;
IL_5C: int expr5C = V_1;
System.Int32[] expr5D = V_0;
int expr5E = expr5D.Length;
int expr5F = (Int32)expr5E;
bool expr60 = expr5C < expr5F;
V_2 = expr60;
bool expr63 = V_2;
if (expr63) goto IL_3A;
return;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
int V_0;
int V_1;
bool V_2;
// No-op
int expr01 = right;
int expr02 = left;
bool expr03 = expr01 > expr02;
int expr05 = 0;
bool expr06 = expr03 == (expr05 != 0);
V_2 = expr06;
bool expr09 = V_2;
if (expr09) goto IL_34;
// No-op
int expr0D = left;
int expr0E = right;
int expr0F = expr0D + expr0E;
int expr10 = 2;
int expr11 = expr0F / expr10;
V_0 = expr11;
System.Int32[] expr13 = array;
int expr14 = left;
int expr15 = right;
int expr16 = V_0;
int expr17 = QuickSortProgram.Partition(expr13, expr14, expr15, expr16);
V_1 = expr17;
System.Int32[] expr1D = array;
int expr1E = left;
int expr1F = V_1;
int expr20 = 1;
int expr21 = expr1F - expr20;
QuickSortProgram.QuickSort(expr1D, expr1E, expr21);
// No-op
System.Int32[] expr28 = array;
int expr29 = V_1;
int expr2A = 1;
int expr2B = expr29 + expr2A;
int expr2C = right;
QuickSortProgram.QuickSort(expr28, expr2B, expr2C);
// No-op
// No-op
IL_34: return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
int V_0;
int V_1;
int V_2;
int V_3;
bool V_4;
// No-op
System.Int32[] expr01 = array;
int expr02 = pivotIndex;
int expr03 = expr01[expr02];
V_0 = expr03;
System.Int32[] expr05 = array;
int expr06 = pivotIndex;
int expr07 = right;
QuickSortProgram.Swap(expr05, expr06, expr07);
// No-op
int expr0E = left;
V_1 = expr0E;
int expr10 = left;
V_2 = expr10;
goto IL_35;
IL_14: // No-op
System.Int32[] expr15 = array;
int expr16 = V_2;
int expr17 = expr15[expr16];
int expr18 = V_0;
bool expr19 = expr17 > expr18;
V_4 = expr19;
bool expr1D = V_4;
if (expr1D) goto IL_30;
// No-op
System.Int32[] expr22 = array;
int expr23 = V_1;
int expr24 = V_2;
QuickSortProgram.Swap(expr22, expr23, expr24);
// No-op
int expr2B = V_1;
int expr2C = 1;
int expr2D = expr2B + expr2C;
V_1 = expr2D;
// No-op
IL_30: // No-op
int expr31 = V_2;
int expr32 = 1;
int expr33 = expr31 + expr32;
V_2 = expr33;
IL_35: int expr35 = V_2;
int expr36 = right;
bool expr37 = expr35 < expr36;
V_4 = expr37;
bool expr3B = V_4;
if (expr3B) goto IL_14;
System.Int32[] expr3F = array;
int expr40 = right;
int expr41 = V_1;
QuickSortProgram.Swap(expr3F, expr40, expr41);
// No-op
int expr48 = V_1;
V_3 = expr48;
goto IL_4C;
IL_4C: int expr4C = V_3;
return expr4C;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
int V_0;
// No-op
System.Int32[] expr01 = array;
int expr02 = index1;
int expr03 = expr01[expr02];
V_0 = expr03;
System.Int32[] expr05 = array;
int expr06 = index1;
System.Int32[] expr07 = array;
int expr08 = index2;
int expr09 = expr07[expr08];
expr05[expr06] = expr09;
System.Int32[] expr0B = array;
int expr0C = index2;
int expr0D = V_0;
expr0B[expr0C] = expr0D;
return;
}
}
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
System.Int32[] V_0;
int V_1;
bool V_2;
// No-op
System.String[] expr01 = args;
int expr02 = expr01.Length;
int expr03 = (Int32)expr02;
System.Int32[] expr04 = new int[expr03];
V_0 = expr04;
int expr0A = 0;
V_1 = expr0A;
goto IL_1F;
IL_0E: // No-op
System.Int32[] expr0F = V_0;
int expr10 = V_1;
System.String[] expr11 = args;
int expr12 = V_1;
string expr13 = expr11[expr12];
int expr14 = System.Int32.Parse(expr13);
expr0F[expr10] = expr14;
// No-op
int expr1B = V_1;
int expr1C = 1;
int expr1D = expr1B + expr1C;
V_1 = expr1D;
IL_1F: int expr1F = V_1;
System.Int32[] expr20 = V_0;
int expr21 = expr20.Length;
int expr22 = (Int32)expr21;
bool expr23 = expr1F < expr22;
V_2 = expr23;
bool expr26 = V_2;
if (expr26) goto IL_0E;
System.Int32[] expr29 = V_0;
int expr2A = 0;
System.Int32[] expr2B = V_0;
int expr2C = expr2B.Length;
int expr2D = (Int32)expr2C;
int expr2E = 1;
int expr2F = expr2D - expr2E;
QuickSortProgram.QuickSort(expr29, expr2A, expr2F);
// No-op
int expr36 = 0;
V_1 = expr36;
goto IL_5C;
IL_3A: // No-op
System.Int32[] expr3B = V_0;
int expr3C = V_1;
object expr3D = expr3B[expr3C];
string expr42 = expr3D.ToString();
string expr47 = " ";
string expr4C = System.String.Concat(expr42, expr47);
System.Console.Write(expr4C);
// No-op
// No-op
int expr58 = V_1;
int expr59 = 1;
int expr5A = expr58 + expr59;
V_1 = expr5A;
IL_5C: int expr5C = V_1;
System.Int32[] expr5D = V_0;
int expr5E = expr5D.Length;
int expr5F = (Int32)expr5E;
bool expr60 = expr5C < expr5F;
V_2 = expr60;
bool expr63 = V_2;
if (expr63) goto IL_3A;
return;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
int V_0;
int V_1;
bool V_2;
// No-op
int expr01 = right;
int expr02 = left;
bool expr03 = expr01 > expr02;
int expr05 = 0;
bool expr06 = expr03 == (expr05 != 0);
V_2 = expr06;
bool expr09 = V_2;
if (expr09) goto IL_34;
// No-op
int expr0D = left;
int expr0E = right;
int expr0F = expr0D + expr0E;
int expr10 = 2;
int expr11 = expr0F / expr10;
V_0 = expr11;
System.Int32[] expr13 = array;
int expr14 = left;
int expr15 = right;
int expr16 = V_0;
int expr17 = QuickSortProgram.Partition(expr13, expr14, expr15, expr16);
V_1 = expr17;
System.Int32[] expr1D = array;
int expr1E = left;
int expr1F = V_1;
int expr20 = 1;
int expr21 = expr1F - expr20;
QuickSortProgram.QuickSort(expr1D, expr1E, expr21);
// No-op
System.Int32[] expr28 = array;
int expr29 = V_1;
int expr2A = 1;
int expr2B = expr29 + expr2A;
int expr2C = right;
QuickSortProgram.QuickSort(expr28, expr2B, expr2C);
// No-op
// No-op
IL_34: return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
int V_0;
int V_1;
int V_2;
int V_3;
bool V_4;
// No-op
System.Int32[] expr01 = array;
int expr02 = pivotIndex;
int expr03 = expr01[expr02];
V_0 = expr03;
System.Int32[] expr05 = array;
int expr06 = pivotIndex;
int expr07 = right;
QuickSortProgram.Swap(expr05, expr06, expr07);
// No-op
int expr0E = left;
V_1 = expr0E;
int expr10 = left;
V_2 = expr10;
goto IL_35;
IL_14: // No-op
System.Int32[] expr15 = array;
int expr16 = V_2;
int expr17 = expr15[expr16];
int expr18 = V_0;
bool expr19 = expr17 > expr18;
V_4 = expr19;
bool expr1D = V_4;
if (expr1D) goto IL_30;
// No-op
System.Int32[] expr22 = array;
int expr23 = V_1;
int expr24 = V_2;
QuickSortProgram.Swap(expr22, expr23, expr24);
// No-op
int expr2B = V_1;
int expr2C = 1;
int expr2D = expr2B + expr2C;
V_1 = expr2D;
// No-op
IL_30: // No-op
int expr31 = V_2;
int expr32 = 1;
int expr33 = expr31 + expr32;
V_2 = expr33;
IL_35: int expr35 = V_2;
int expr36 = right;
bool expr37 = expr35 < expr36;
V_4 = expr37;
bool expr3B = V_4;
if (expr3B) goto IL_14;
System.Int32[] expr3F = array;
int expr40 = right;
int expr41 = V_1;
QuickSortProgram.Swap(expr3F, expr40, expr41);
// No-op
int expr48 = V_1;
V_3 = expr48;
goto IL_4C;
IL_4C: int expr4C = V_3;
return expr4C;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
int V_0;
// No-op
System.Int32[] expr01 = array;
int expr02 = index1;
int expr03 = expr01[expr02];
V_0 = expr03;
System.Int32[] expr05 = array;
int expr06 = index1;
System.Int32[] expr07 = array;
int expr08 = index2;
int expr09 = expr07[expr08];
expr05[expr06] = expr09;
System.Int32[] expr0B = array;
int expr0C = index2;
int expr0D = V_0;
expr0B[expr0C] = expr0D;
return;
}
}

756
Decompiler/doc/Dissertation/Evolution/03_Dataflow_Comments.cs → doc/Dissertation/Evolution/03_Dataflow_Comments.cs
Unescape View File

@ -1,378 +1,378 @@ @@ -1,378 +1,378 @@
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
System.Int32[] V_0;
int V_1;
bool V_2;
// No-op
// Stack: {}
System.String[] expr01 = args;
// Stack: {expr01}
int expr02 = expr01.Length;
// Stack: {expr02}
int expr03 = (Int32)expr02;
// Stack: {expr03}
System.Int32[] expr04 = new int[expr03];
// Stack: {expr04}
V_0 = expr04;
// Stack: {}
int expr0A = 0;
// Stack: {expr0A}
V_1 = expr0A;
// Stack: {}
goto IL_1F;
// Stack: {}
IL_0E: // No-op
// Stack: {}
System.Int32[] expr0F = V_0;
// Stack: {expr0F}
int expr10 = V_1;
// Stack: {expr0F, expr10}
System.String[] expr11 = args;
// Stack: {expr0F, expr10, expr11}
int expr12 = V_1;
// Stack: {expr0F, expr10, expr11, expr12}
string expr13 = expr11[expr12];
// Stack: {expr0F, expr10, expr13}
int expr14 = System.Int32.Parse(expr13);
// Stack: {expr0F, expr10, expr14}
expr0F[expr10] = expr14;
// Stack: {}
// No-op
// Stack: {}
int expr1B = V_1;
// Stack: {expr1B}
int expr1C = 1;
// Stack: {expr1B, expr1C}
int expr1D = expr1B + expr1C;
// Stack: {expr1D}
V_1 = expr1D;
// Stack: {}
IL_1F: int expr1F = V_1;
// Stack: {expr1F}
System.Int32[] expr20 = V_0;
// Stack: {expr1F, expr20}
int expr21 = expr20.Length;
// Stack: {expr1F, expr21}
int expr22 = (Int32)expr21;
// Stack: {expr1F, expr22}
bool expr23 = expr1F < expr22;
// Stack: {expr23}
V_2 = expr23;
// Stack: {}
bool expr26 = V_2;
// Stack: {expr26}
if (expr26) goto IL_0E;
// Stack: {}
System.Int32[] expr29 = V_0;
// Stack: {expr29}
int expr2A = 0;
// Stack: {expr29, expr2A}
System.Int32[] expr2B = V_0;
// Stack: {expr29, expr2A, expr2B}
int expr2C = expr2B.Length;
// Stack: {expr29, expr2A, expr2C}
int expr2D = (Int32)expr2C;
// Stack: {expr29, expr2A, expr2D}
int expr2E = 1;
// Stack: {expr29, expr2A, expr2D, expr2E}
int expr2F = expr2D - expr2E;
// Stack: {expr29, expr2A, expr2F}
QuickSortProgram.QuickSort(expr29, expr2A, expr2F);
// Stack: {}
// No-op
// Stack: {}
int expr36 = 0;
// Stack: {expr36}
V_1 = expr36;
// Stack: {}
goto IL_5C;
// Stack: {}
IL_3A: // No-op
// Stack: {}
System.Int32[] expr3B = V_0;
// Stack: {expr3B}
int expr3C = V_1;
// Stack: {expr3B, expr3C}
object expr3D = expr3B[expr3C];
// Stack: {expr3D}
string expr42 = expr3D.ToString();
// Stack: {expr42}
string expr47 = " ";
// Stack: {expr42, expr47}
string expr4C = System.String.Concat(expr42, expr47);
// Stack: {expr4C}
System.Console.Write(expr4C);
// Stack: {}
// No-op
// Stack: {}
// No-op
// Stack: {}
int expr58 = V_1;
// Stack: {expr58}
int expr59 = 1;
// Stack: {expr58, expr59}
int expr5A = expr58 + expr59;
// Stack: {expr5A}
V_1 = expr5A;
// Stack: {}
IL_5C: int expr5C = V_1;
// Stack: {expr5C}
System.Int32[] expr5D = V_0;
// Stack: {expr5C, expr5D}
int expr5E = expr5D.Length;
// Stack: {expr5C, expr5E}
int expr5F = (Int32)expr5E;
// Stack: {expr5C, expr5F}
bool expr60 = expr5C < expr5F;
// Stack: {expr60}
V_2 = expr60;
// Stack: {}
bool expr63 = V_2;
// Stack: {expr63}
if (expr63) goto IL_3A;
// Stack: {}
return;
// Stack: {}
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
int V_0;
int V_1;
bool V_2;
// No-op
// Stack: {}
int expr01 = right;
// Stack: {expr01}
int expr02 = left;
// Stack: {expr01, expr02}
bool expr03 = expr01 > expr02;
// Stack: {expr03}
int expr05 = 0;
// Stack: {expr03, expr05}
bool expr06 = expr03 == (expr05 != 0);
// Stack: {expr06}
V_2 = expr06;
// Stack: {}
bool expr09 = V_2;
// Stack: {expr09}
if (expr09) goto IL_34;
// Stack: {}
// No-op
// Stack: {}
int expr0D = left;
// Stack: {expr0D}
int expr0E = right;
// Stack: {expr0D, expr0E}
int expr0F = expr0D + expr0E;
// Stack: {expr0F}
int expr10 = 2;
// Stack: {expr0F, expr10}
int expr11 = expr0F / expr10;
// Stack: {expr11}
V_0 = expr11;
// Stack: {}
System.Int32[] expr13 = array;
// Stack: {expr13}
int expr14 = left;
// Stack: {expr13, expr14}
int expr15 = right;
// Stack: {expr13, expr14, expr15}
int expr16 = V_0;
// Stack: {expr13, expr14, expr15, expr16}
int expr17 = QuickSortProgram.Partition(expr13, expr14, expr15, expr16);
// Stack: {expr17}
V_1 = expr17;
// Stack: {}
System.Int32[] expr1D = array;
// Stack: {expr1D}
int expr1E = left;
// Stack: {expr1D, expr1E}
int expr1F = V_1;
// Stack: {expr1D, expr1E, expr1F}
int expr20 = 1;
// Stack: {expr1D, expr1E, expr1F, expr20}
int expr21 = expr1F - expr20;
// Stack: {expr1D, expr1E, expr21}
QuickSortProgram.QuickSort(expr1D, expr1E, expr21);
// Stack: {}
// No-op
// Stack: {}
System.Int32[] expr28 = array;
// Stack: {expr28}
int expr29 = V_1;
// Stack: {expr28, expr29}
int expr2A = 1;
// Stack: {expr28, expr29, expr2A}
int expr2B = expr29 + expr2A;
// Stack: {expr28, expr2B}
int expr2C = right;
// Stack: {expr28, expr2B, expr2C}
QuickSortProgram.QuickSort(expr28, expr2B, expr2C);
// Stack: {}
// No-op
// Stack: {}
// No-op
// Stack: {}
IL_34: return;
// Stack: {}
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
int V_0;
int V_1;
int V_2;
int V_3;
bool V_4;
// No-op
// Stack: {}
System.Int32[] expr01 = array;
// Stack: {expr01}
int expr02 = pivotIndex;
// Stack: {expr01, expr02}
int expr03 = expr01[expr02];
// Stack: {expr03}
V_0 = expr03;
// Stack: {}
System.Int32[] expr05 = array;
// Stack: {expr05}
int expr06 = pivotIndex;
// Stack: {expr05, expr06}
int expr07 = right;
// Stack: {expr05, expr06, expr07}
QuickSortProgram.Swap(expr05, expr06, expr07);
// Stack: {}
// No-op
// Stack: {}
int expr0E = left;
// Stack: {expr0E}
V_1 = expr0E;
// Stack: {}
int expr10 = left;
// Stack: {expr10}
V_2 = expr10;
// Stack: {}
goto IL_35;
// Stack: {}
IL_14: // No-op
// Stack: {}
System.Int32[] expr15 = array;
// Stack: {expr15}
int expr16 = V_2;
// Stack: {expr15, expr16}
int expr17 = expr15[expr16];
// Stack: {expr17}
int expr18 = V_0;
// Stack: {expr17, expr18}
bool expr19 = expr17 > expr18;
// Stack: {expr19}
V_4 = expr19;
// Stack: {}
bool expr1D = V_4;
// Stack: {expr1D}
if (expr1D) goto IL_30;
// Stack: {}
// No-op
// Stack: {}
System.Int32[] expr22 = array;
// Stack: {expr22}
int expr23 = V_1;
// Stack: {expr22, expr23}
int expr24 = V_2;
// Stack: {expr22, expr23, expr24}
QuickSortProgram.Swap(expr22, expr23, expr24);
// Stack: {}
// No-op
// Stack: {}
int expr2B = V_1;
// Stack: {expr2B}
int expr2C = 1;
// Stack: {expr2B, expr2C}
int expr2D = expr2B + expr2C;
// Stack: {expr2D}
V_1 = expr2D;
// Stack: {}
// No-op
// Stack: {}
IL_30: // No-op
// Stack: {}
int expr31 = V_2;
// Stack: {expr31}
int expr32 = 1;
// Stack: {expr31, expr32}
int expr33 = expr31 + expr32;
// Stack: {expr33}
V_2 = expr33;
// Stack: {}
IL_35: int expr35 = V_2;
// Stack: {expr35}
int expr36 = right;
// Stack: {expr35, expr36}
bool expr37 = expr35 < expr36;
// Stack: {expr37}
V_4 = expr37;
// Stack: {}
bool expr3B = V_4;
// Stack: {expr3B}
if (expr3B) goto IL_14;
// Stack: {}
System.Int32[] expr3F = array;
// Stack: {expr3F}
int expr40 = right;
// Stack: {expr3F, expr40}
int expr41 = V_1;
// Stack: {expr3F, expr40, expr41}
QuickSortProgram.Swap(expr3F, expr40, expr41);
// Stack: {}
// No-op
// Stack: {}
int expr48 = V_1;
// Stack: {expr48}
V_3 = expr48;
// Stack: {}
goto IL_4C;
// Stack: {}
IL_4C: int expr4C = V_3;
// Stack: {expr4C}
return expr4C;
// Stack: {}
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
int V_0;
// No-op
// Stack: {}
System.Int32[] expr01 = array;
// Stack: {expr01}
int expr02 = index1;
// Stack: {expr01, expr02}
int expr03 = expr01[expr02];
// Stack: {expr03}
V_0 = expr03;
// Stack: {}
System.Int32[] expr05 = array;
// Stack: {expr05}
int expr06 = index1;
// Stack: {expr05, expr06}
System.Int32[] expr07 = array;
// Stack: {expr05, expr06, expr07}
int expr08 = index2;
// Stack: {expr05, expr06, expr07, expr08}
int expr09 = expr07[expr08];
// Stack: {expr05, expr06, expr09}
expr05[expr06] = expr09;
// Stack: {}
System.Int32[] expr0B = array;
// Stack: {expr0B}
int expr0C = index2;
// Stack: {expr0B, expr0C}
int expr0D = V_0;
// Stack: {expr0B, expr0C, expr0D}
expr0B[expr0C] = expr0D;
// Stack: {}
return;
// Stack: {}
}
}
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
System.Int32[] V_0;
int V_1;
bool V_2;
// No-op
// Stack: {}
System.String[] expr01 = args;
// Stack: {expr01}
int expr02 = expr01.Length;
// Stack: {expr02}
int expr03 = (Int32)expr02;
// Stack: {expr03}
System.Int32[] expr04 = new int[expr03];
// Stack: {expr04}
V_0 = expr04;
// Stack: {}
int expr0A = 0;
// Stack: {expr0A}
V_1 = expr0A;
// Stack: {}
goto IL_1F;
// Stack: {}
IL_0E: // No-op
// Stack: {}
System.Int32[] expr0F = V_0;
// Stack: {expr0F}
int expr10 = V_1;
// Stack: {expr0F, expr10}
System.String[] expr11 = args;
// Stack: {expr0F, expr10, expr11}
int expr12 = V_1;
// Stack: {expr0F, expr10, expr11, expr12}
string expr13 = expr11[expr12];
// Stack: {expr0F, expr10, expr13}
int expr14 = System.Int32.Parse(expr13);
// Stack: {expr0F, expr10, expr14}
expr0F[expr10] = expr14;
// Stack: {}
// No-op
// Stack: {}
int expr1B = V_1;
// Stack: {expr1B}
int expr1C = 1;
// Stack: {expr1B, expr1C}
int expr1D = expr1B + expr1C;
// Stack: {expr1D}
V_1 = expr1D;
// Stack: {}
IL_1F: int expr1F = V_1;
// Stack: {expr1F}
System.Int32[] expr20 = V_0;
// Stack: {expr1F, expr20}
int expr21 = expr20.Length;
// Stack: {expr1F, expr21}
int expr22 = (Int32)expr21;
// Stack: {expr1F, expr22}
bool expr23 = expr1F < expr22;
// Stack: {expr23}
V_2 = expr23;
// Stack: {}
bool expr26 = V_2;
// Stack: {expr26}
if (expr26) goto IL_0E;
// Stack: {}
System.Int32[] expr29 = V_0;
// Stack: {expr29}
int expr2A = 0;
// Stack: {expr29, expr2A}
System.Int32[] expr2B = V_0;
// Stack: {expr29, expr2A, expr2B}
int expr2C = expr2B.Length;
// Stack: {expr29, expr2A, expr2C}
int expr2D = (Int32)expr2C;
// Stack: {expr29, expr2A, expr2D}
int expr2E = 1;
// Stack: {expr29, expr2A, expr2D, expr2E}
int expr2F = expr2D - expr2E;
// Stack: {expr29, expr2A, expr2F}
QuickSortProgram.QuickSort(expr29, expr2A, expr2F);
// Stack: {}
// No-op
// Stack: {}
int expr36 = 0;
// Stack: {expr36}
V_1 = expr36;
// Stack: {}
goto IL_5C;
// Stack: {}
IL_3A: // No-op
// Stack: {}
System.Int32[] expr3B = V_0;
// Stack: {expr3B}
int expr3C = V_1;
// Stack: {expr3B, expr3C}
object expr3D = expr3B[expr3C];
// Stack: {expr3D}
string expr42 = expr3D.ToString();
// Stack: {expr42}
string expr47 = " ";
// Stack: {expr42, expr47}
string expr4C = System.String.Concat(expr42, expr47);
// Stack: {expr4C}
System.Console.Write(expr4C);
// Stack: {}
// No-op
// Stack: {}
// No-op
// Stack: {}
int expr58 = V_1;
// Stack: {expr58}
int expr59 = 1;
// Stack: {expr58, expr59}
int expr5A = expr58 + expr59;
// Stack: {expr5A}
V_1 = expr5A;
// Stack: {}
IL_5C: int expr5C = V_1;
// Stack: {expr5C}
System.Int32[] expr5D = V_0;
// Stack: {expr5C, expr5D}
int expr5E = expr5D.Length;
// Stack: {expr5C, expr5E}
int expr5F = (Int32)expr5E;
// Stack: {expr5C, expr5F}
bool expr60 = expr5C < expr5F;
// Stack: {expr60}
V_2 = expr60;
// Stack: {}
bool expr63 = V_2;
// Stack: {expr63}
if (expr63) goto IL_3A;
// Stack: {}
return;
// Stack: {}
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
int V_0;
int V_1;
bool V_2;
// No-op
// Stack: {}
int expr01 = right;
// Stack: {expr01}
int expr02 = left;
// Stack: {expr01, expr02}
bool expr03 = expr01 > expr02;
// Stack: {expr03}
int expr05 = 0;
// Stack: {expr03, expr05}
bool expr06 = expr03 == (expr05 != 0);
// Stack: {expr06}
V_2 = expr06;
// Stack: {}
bool expr09 = V_2;
// Stack: {expr09}
if (expr09) goto IL_34;
// Stack: {}
// No-op
// Stack: {}
int expr0D = left;
// Stack: {expr0D}
int expr0E = right;
// Stack: {expr0D, expr0E}
int expr0F = expr0D + expr0E;
// Stack: {expr0F}
int expr10 = 2;
// Stack: {expr0F, expr10}
int expr11 = expr0F / expr10;
// Stack: {expr11}
V_0 = expr11;
// Stack: {}
System.Int32[] expr13 = array;
// Stack: {expr13}
int expr14 = left;
// Stack: {expr13, expr14}
int expr15 = right;
// Stack: {expr13, expr14, expr15}
int expr16 = V_0;
// Stack: {expr13, expr14, expr15, expr16}
int expr17 = QuickSortProgram.Partition(expr13, expr14, expr15, expr16);
// Stack: {expr17}
V_1 = expr17;
// Stack: {}
System.Int32[] expr1D = array;
// Stack: {expr1D}
int expr1E = left;
// Stack: {expr1D, expr1E}
int expr1F = V_1;
// Stack: {expr1D, expr1E, expr1F}
int expr20 = 1;
// Stack: {expr1D, expr1E, expr1F, expr20}
int expr21 = expr1F - expr20;
// Stack: {expr1D, expr1E, expr21}
QuickSortProgram.QuickSort(expr1D, expr1E, expr21);
// Stack: {}
// No-op
// Stack: {}
System.Int32[] expr28 = array;
// Stack: {expr28}
int expr29 = V_1;
// Stack: {expr28, expr29}
int expr2A = 1;
// Stack: {expr28, expr29, expr2A}
int expr2B = expr29 + expr2A;
// Stack: {expr28, expr2B}
int expr2C = right;
// Stack: {expr28, expr2B, expr2C}
QuickSortProgram.QuickSort(expr28, expr2B, expr2C);
// Stack: {}
// No-op
// Stack: {}
// No-op
// Stack: {}
IL_34: return;
// Stack: {}
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
int V_0;
int V_1;
int V_2;
int V_3;
bool V_4;
// No-op
// Stack: {}
System.Int32[] expr01 = array;
// Stack: {expr01}
int expr02 = pivotIndex;
// Stack: {expr01, expr02}
int expr03 = expr01[expr02];
// Stack: {expr03}
V_0 = expr03;
// Stack: {}
System.Int32[] expr05 = array;
// Stack: {expr05}
int expr06 = pivotIndex;
// Stack: {expr05, expr06}
int expr07 = right;
// Stack: {expr05, expr06, expr07}
QuickSortProgram.Swap(expr05, expr06, expr07);
// Stack: {}
// No-op
// Stack: {}
int expr0E = left;
// Stack: {expr0E}
V_1 = expr0E;
// Stack: {}
int expr10 = left;
// Stack: {expr10}
V_2 = expr10;
// Stack: {}
goto IL_35;
// Stack: {}
IL_14: // No-op
// Stack: {}
System.Int32[] expr15 = array;
// Stack: {expr15}
int expr16 = V_2;
// Stack: {expr15, expr16}
int expr17 = expr15[expr16];
// Stack: {expr17}
int expr18 = V_0;
// Stack: {expr17, expr18}
bool expr19 = expr17 > expr18;
// Stack: {expr19}
V_4 = expr19;
// Stack: {}
bool expr1D = V_4;
// Stack: {expr1D}
if (expr1D) goto IL_30;
// Stack: {}
// No-op
// Stack: {}
System.Int32[] expr22 = array;
// Stack: {expr22}
int expr23 = V_1;
// Stack: {expr22, expr23}
int expr24 = V_2;
// Stack: {expr22, expr23, expr24}
QuickSortProgram.Swap(expr22, expr23, expr24);
// Stack: {}
// No-op
// Stack: {}
int expr2B = V_1;
// Stack: {expr2B}
int expr2C = 1;
// Stack: {expr2B, expr2C}
int expr2D = expr2B + expr2C;
// Stack: {expr2D}
V_1 = expr2D;
// Stack: {}
// No-op
// Stack: {}
IL_30: // No-op
// Stack: {}
int expr31 = V_2;
// Stack: {expr31}
int expr32 = 1;
// Stack: {expr31, expr32}
int expr33 = expr31 + expr32;
// Stack: {expr33}
V_2 = expr33;
// Stack: {}
IL_35: int expr35 = V_2;
// Stack: {expr35}
int expr36 = right;
// Stack: {expr35, expr36}
bool expr37 = expr35 < expr36;
// Stack: {expr37}
V_4 = expr37;
// Stack: {}
bool expr3B = V_4;
// Stack: {expr3B}
if (expr3B) goto IL_14;
// Stack: {}
System.Int32[] expr3F = array;
// Stack: {expr3F}
int expr40 = right;
// Stack: {expr3F, expr40}
int expr41 = V_1;
// Stack: {expr3F, expr40, expr41}
QuickSortProgram.Swap(expr3F, expr40, expr41);
// Stack: {}
// No-op
// Stack: {}
int expr48 = V_1;
// Stack: {expr48}
V_3 = expr48;
// Stack: {}
goto IL_4C;
// Stack: {}
IL_4C: int expr4C = V_3;
// Stack: {expr4C}
return expr4C;
// Stack: {}
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
int V_0;
// No-op
// Stack: {}
System.Int32[] expr01 = array;
// Stack: {expr01}
int expr02 = index1;
// Stack: {expr01, expr02}
int expr03 = expr01[expr02];
// Stack: {expr03}
V_0 = expr03;
// Stack: {}
System.Int32[] expr05 = array;
// Stack: {expr05}
int expr06 = index1;
// Stack: {expr05, expr06}
System.Int32[] expr07 = array;
// Stack: {expr05, expr06, expr07}
int expr08 = index2;
// Stack: {expr05, expr06, expr07, expr08}
int expr09 = expr07[expr08];
// Stack: {expr05, expr06, expr09}
expr05[expr06] = expr09;
// Stack: {}
System.Int32[] expr0B = array;
// Stack: {expr0B}
int expr0C = index2;
// Stack: {expr0B, expr0C}
int expr0D = V_0;
// Stack: {expr0B, expr0C, expr0D}
expr0B[expr0C] = expr0D;
// Stack: {}
return;
// Stack: {}
}
}

96
Decompiler/doc/Dissertation/Evolution/04_Inline_expressions.cs → doc/Dissertation/Evolution/04_Inline_expressions.cs
Unescape View File

@ -1,49 +1,49 @@ @@ -1,49 +1,49 @@
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
System.Int32[] V_0 = new int[((Int32)args.Length)];
int V_1 = 0;
goto IL_1C;
IL_0D: V_0[V_1] = System.Int32.Parse(args[V_1]);
V_1 = (V_1 + 1);
IL_1C: if (V_1 < ((Int32)V_0.Length)) goto IL_0D;
QuickSortProgram.QuickSort(V_0, 0, (((Int32)V_0.Length) - 1));
int V_2 = 0;
goto IL_51;
IL_32: System.Console.Write(System.String.Concat((V_0[V_2]).ToString(), " "));
V_2 = (V_2 + 1);
IL_51: if (V_2 < ((Int32)V_0.Length)) goto IL_32;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
if (right <= left) goto IL_28;
int V_0 = ((left + right) / 2);
int V_1 = QuickSortProgram.Partition(array, left, right, V_0);
QuickSortProgram.QuickSort(array, left, (V_1 - 1));
QuickSortProgram.QuickSort(array, (V_1 + 1), right);
IL_28: return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
int V_0 = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int V_1 = left;
int V_2 = left;
goto IL_28;
IL_12: if (array[V_2] > V_0) goto IL_24;
QuickSortProgram.Swap(array, V_1, V_2);
V_1 = (V_1 + 1);
IL_24: V_2 = (V_2 + 1);
IL_28: if (V_2 < right) goto IL_12;
QuickSortProgram.Swap(array, right, V_1);
return V_1;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
int V_0 = array[index1];
array[index1] = array[index2];
array[index2] = V_0;
}
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
System.Int32[] V_0 = new int[((Int32)args.Length)];
int V_1 = 0;
goto IL_1C;
IL_0D: V_0[V_1] = System.Int32.Parse(args[V_1]);
V_1 = (V_1 + 1);
IL_1C: if (V_1 < ((Int32)V_0.Length)) goto IL_0D;
QuickSortProgram.QuickSort(V_0, 0, (((Int32)V_0.Length) - 1));
int V_2 = 0;
goto IL_51;
IL_32: System.Console.Write(System.String.Concat((V_0[V_2]).ToString(), " "));
V_2 = (V_2 + 1);
IL_51: if (V_2 < ((Int32)V_0.Length)) goto IL_32;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
if (right <= left) goto IL_28;
int V_0 = ((left + right) / 2);
int V_1 = QuickSortProgram.Partition(array, left, right, V_0);
QuickSortProgram.QuickSort(array, left, (V_1 - 1));
QuickSortProgram.QuickSort(array, (V_1 + 1), right);
IL_28: return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
int V_0 = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int V_1 = left;
int V_2 = left;
goto IL_28;
IL_12: if (array[V_2] > V_0) goto IL_24;
QuickSortProgram.Swap(array, V_1, V_2);
V_1 = (V_1 + 1);
IL_24: V_2 = (V_2 + 1);
IL_28: if (V_2 < right) goto IL_12;
QuickSortProgram.Swap(array, right, V_1);
return V_1;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
int V_0 = array[index1];
array[index1] = array[index2];
array[index2] = V_0;
}
}

156
Decompiler/doc/Dissertation/Evolution/05_Find_basic_blocks.cs → doc/Dissertation/Evolution/05_Find_basic_blocks.cs
Unescape View File

@ -1,78 +1,78 @@ @@ -1,78 +1,78 @@
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
BasicBlock_1:
System.Int32[] V_0 = new int[((int)args.Length)];
int i = 0;
goto BasicBlock_3;
BasicBlock_2:
V_0[i] = System.Int32.Parse(args[i]);
i = (i + 1);
goto BasicBlock_3;
BasicBlock_3:
if (i < ((int)V_0.Length)) goto BasicBlock_2;
goto BasicBlock_4;
BasicBlock_4:
QuickSortProgram.QuickSort(V_0, 0, (((int)V_0.Length) - 1));
int j = 0;
goto BasicBlock_6;
BasicBlock_5:
System.Console.Write(System.String.Concat((V_0[j]).ToString(), " "));
j = (j + 1);
goto BasicBlock_6;
BasicBlock_6:
if (j < ((int)V_0.Length)) goto BasicBlock_5;
goto BasicBlock_7;
BasicBlock_7:
return;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
BasicBlock_9:
if (right <= left) goto BasicBlock_11;
goto BasicBlock_10;
BasicBlock_10:
int i = ((left + right) / 2);
int j = QuickSortProgram.Partition(array, left, right, i);
QuickSortProgram.QuickSort(array, left, (j - 1));
QuickSortProgram.QuickSort(array, (j + 1), right);
goto BasicBlock_11;
BasicBlock_11:
return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
BasicBlock_13:
int i = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int j = left;
int k = left;
goto BasicBlock_17;
BasicBlock_14:
if (array[k] > i) goto BasicBlock_16;
goto BasicBlock_15;
BasicBlock_15:
QuickSortProgram.Swap(array, j, k);
j = (j + 1);
goto BasicBlock_16;
BasicBlock_16:
k = (k + 1);
goto BasicBlock_17;
BasicBlock_17:
if (k < right) goto BasicBlock_14;
goto BasicBlock_18;
BasicBlock_18:
QuickSortProgram.Swap(array, right, j);
return j;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
BasicBlock_20:
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
return;
}
}
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
BasicBlock_1:
System.Int32[] V_0 = new int[((int)args.Length)];
int i = 0;
goto BasicBlock_3;
BasicBlock_2:
V_0[i] = System.Int32.Parse(args[i]);
i = (i + 1);
goto BasicBlock_3;
BasicBlock_3:
if (i < ((int)V_0.Length)) goto BasicBlock_2;
goto BasicBlock_4;
BasicBlock_4:
QuickSortProgram.QuickSort(V_0, 0, (((int)V_0.Length) - 1));
int j = 0;
goto BasicBlock_6;
BasicBlock_5:
System.Console.Write(System.String.Concat((V_0[j]).ToString(), " "));
j = (j + 1);
goto BasicBlock_6;
BasicBlock_6:
if (j < ((int)V_0.Length)) goto BasicBlock_5;
goto BasicBlock_7;
BasicBlock_7:
return;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
BasicBlock_9:
if (right <= left) goto BasicBlock_11;
goto BasicBlock_10;
BasicBlock_10:
int i = ((left + right) / 2);
int j = QuickSortProgram.Partition(array, left, right, i);
QuickSortProgram.QuickSort(array, left, (j - 1));
QuickSortProgram.QuickSort(array, (j + 1), right);
goto BasicBlock_11;
BasicBlock_11:
return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
BasicBlock_13:
int i = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int j = left;
int k = left;
goto BasicBlock_17;
BasicBlock_14:
if (array[k] > i) goto BasicBlock_16;
goto BasicBlock_15;
BasicBlock_15:
QuickSortProgram.Swap(array, j, k);
j = (j + 1);
goto BasicBlock_16;
BasicBlock_16:
k = (k + 1);
goto BasicBlock_17;
BasicBlock_17:
if (k < right) goto BasicBlock_14;
goto BasicBlock_18;
BasicBlock_18:
QuickSortProgram.Swap(array, right, j);
return j;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
BasicBlock_20:
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
return;
}
}

174
Decompiler/doc/Dissertation/Evolution/06_Find_loops.cs → doc/Dissertation/Evolution/06_Find_loops.cs
Unescape View File

@ -1,87 +1,87 @@ @@ -1,87 +1,87 @@
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
BasicBlock_1:
System.Int32[] V_0 = new int[((int)args.Length)];
int i = 0;
goto Loop_8;
Loop_8:
for (;;) {
BasicBlock_3:
if (i < ((int)V_0.Length)) goto BasicBlock_2;
break;
BasicBlock_2:
V_0[i] = System.Int32.Parse(args[i]);
i = (i + 1);
continue;
}
BasicBlock_4:
QuickSortProgram.QuickSort(V_0, 0, (((int)V_0.Length) - 1));
int j = 0;
goto Loop_11;
Loop_11:
for (;;) {
BasicBlock_6:
if (j < ((int)V_0.Length)) goto BasicBlock_5;
break;
BasicBlock_5:
System.Console.Write(System.String.Concat((V_0[j]).ToString(), " "));
j = (j + 1);
continue;
}
BasicBlock_7:
return;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
BasicBlock_15:
if (right <= left) goto BasicBlock_17;
goto BasicBlock_16;
BasicBlock_16:
int i = ((left + right) / 2);
int j = QuickSortProgram.Partition(array, left, right, i);
QuickSortProgram.QuickSort(array, left, (j - 1));
QuickSortProgram.QuickSort(array, (j + 1), right);
goto BasicBlock_17;
BasicBlock_17:
return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
BasicBlock_21:
int i = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int j = left;
int k = left;
goto Loop_29;
Loop_29:
for (;;) {
BasicBlock_25:
if (k < right) goto BasicBlock_22;
break;
BasicBlock_22:
if (array[k] > i) goto BasicBlock_24;
goto BasicBlock_23;
BasicBlock_23:
QuickSortProgram.Swap(array, j, k);
j = (j + 1);
goto BasicBlock_24;
BasicBlock_24:
k = (k + 1);
continue;
}
BasicBlock_26:
QuickSortProgram.Swap(array, right, j);
return j;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
BasicBlock_33:
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
return;
}
}
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
BasicBlock_1:
System.Int32[] V_0 = new int[((int)args.Length)];
int i = 0;
goto Loop_8;
Loop_8:
for (;;) {
BasicBlock_3:
if (i < ((int)V_0.Length)) goto BasicBlock_2;
break;
BasicBlock_2:
V_0[i] = System.Int32.Parse(args[i]);
i = (i + 1);
continue;
}
BasicBlock_4:
QuickSortProgram.QuickSort(V_0, 0, (((int)V_0.Length) - 1));
int j = 0;
goto Loop_11;
Loop_11:
for (;;) {
BasicBlock_6:
if (j < ((int)V_0.Length)) goto BasicBlock_5;
break;
BasicBlock_5:
System.Console.Write(System.String.Concat((V_0[j]).ToString(), " "));
j = (j + 1);
continue;
}
BasicBlock_7:
return;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
BasicBlock_15:
if (right <= left) goto BasicBlock_17;
goto BasicBlock_16;
BasicBlock_16:
int i = ((left + right) / 2);
int j = QuickSortProgram.Partition(array, left, right, i);
QuickSortProgram.QuickSort(array, left, (j - 1));
QuickSortProgram.QuickSort(array, (j + 1), right);
goto BasicBlock_17;
BasicBlock_17:
return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
BasicBlock_21:
int i = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int j = left;
int k = left;
goto Loop_29;
Loop_29:
for (;;) {
BasicBlock_25:
if (k < right) goto BasicBlock_22;
break;
BasicBlock_22:
if (array[k] > i) goto BasicBlock_24;
goto BasicBlock_23;
BasicBlock_23:
QuickSortProgram.Swap(array, j, k);
j = (j + 1);
goto BasicBlock_24;
BasicBlock_24:
k = (k + 1);
continue;
}
BasicBlock_26:
QuickSortProgram.Swap(array, right, j);
return j;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
BasicBlock_33:
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
return;
}
}

244
Decompiler/doc/Dissertation/Evolution/07_Find_conditionals.cs → doc/Dissertation/Evolution/07_Find_conditionals.cs
Unescape View File

@ -1,122 +1,122 @@ @@ -1,122 +1,122 @@
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
BasicBlock_1:
System.Int32[] V_0 = new int[((int)args.Length)];
int i = 0;
goto Loop_8;
Loop_8:
for (;;) {
ConditionalNode_16:
BasicBlock_3:
if (!(i < ((int)V_0.Length))) {
break;
Block_14:
}
else {
goto BasicBlock_2;
Block_15:
}
BasicBlock_2:
V_0[i] = System.Int32.Parse(args[i]);
i = (i + 1);
continue;
}
BasicBlock_4:
QuickSortProgram.QuickSort(V_0, 0, (((int)V_0.Length) - 1));
int j = 0;
goto Loop_11;
Loop_11:
for (;;) {
ConditionalNode_19:
BasicBlock_6:
if (!(j < ((int)V_0.Length))) {
break;
Block_17:
}
else {
goto BasicBlock_5;
Block_18:
}
BasicBlock_5:
System.Console.Write(System.String.Concat((V_0[j]).ToString(), " "));
j = (j + 1);
continue;
}
BasicBlock_7:
return;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
ConditionalNode_28:
BasicBlock_21:
if (!(right <= left)) {
goto Block_26;
Block_26:
BasicBlock_22:
int i = ((left + right) / 2);
int j = QuickSortProgram.Partition(array, left, right, i);
QuickSortProgram.QuickSort(array, left, (j - 1));
QuickSortProgram.QuickSort(array, (j + 1), right);
goto BasicBlock_23;
}
else {
goto BasicBlock_23;
Block_27:
}
BasicBlock_23:
return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
BasicBlock_30:
int i = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int j = left;
int k = left;
goto Loop_38;
Loop_38:
for (;;) {
ConditionalNode_43:
BasicBlock_34:
if (!(k < right)) {
break;
Block_41:
}
else {
goto ConditionalNode_46;
Block_42:
}
ConditionalNode_46:
BasicBlock_31:
if (!(array[k] > i)) {
goto Block_44;
Block_44:
BasicBlock_32:
QuickSortProgram.Swap(array, j, k);
j = (j + 1);
goto BasicBlock_33;
}
else {
goto BasicBlock_33;
Block_45:
}
BasicBlock_33:
k = (k + 1);
continue;
}
BasicBlock_35:
QuickSortProgram.Swap(array, right, j);
return j;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
BasicBlock_48:
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
return;
}
}
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
BasicBlock_1:
System.Int32[] V_0 = new int[((int)args.Length)];
int i = 0;
goto Loop_8;
Loop_8:
for (;;) {
ConditionalNode_16:
BasicBlock_3:
if (!(i < ((int)V_0.Length))) {
break;
Block_14:
}
else {
goto BasicBlock_2;
Block_15:
}
BasicBlock_2:
V_0[i] = System.Int32.Parse(args[i]);
i = (i + 1);
continue;
}
BasicBlock_4:
QuickSortProgram.QuickSort(V_0, 0, (((int)V_0.Length) - 1));
int j = 0;
goto Loop_11;
Loop_11:
for (;;) {
ConditionalNode_19:
BasicBlock_6:
if (!(j < ((int)V_0.Length))) {
break;
Block_17:
}
else {
goto BasicBlock_5;
Block_18:
}
BasicBlock_5:
System.Console.Write(System.String.Concat((V_0[j]).ToString(), " "));
j = (j + 1);
continue;
}
BasicBlock_7:
return;
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
ConditionalNode_28:
BasicBlock_21:
if (!(right <= left)) {
goto Block_26;
Block_26:
BasicBlock_22:
int i = ((left + right) / 2);
int j = QuickSortProgram.Partition(array, left, right, i);
QuickSortProgram.QuickSort(array, left, (j - 1));
QuickSortProgram.QuickSort(array, (j + 1), right);
goto BasicBlock_23;
}
else {
goto BasicBlock_23;
Block_27:
}
BasicBlock_23:
return;
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
BasicBlock_30:
int i = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int j = left;
int k = left;
goto Loop_38;
Loop_38:
for (;;) {
ConditionalNode_43:
BasicBlock_34:
if (!(k < right)) {
break;
Block_41:
}
else {
goto ConditionalNode_46;
Block_42:
}
ConditionalNode_46:
BasicBlock_31:
if (!(array[k] > i)) {
goto Block_44;
Block_44:
BasicBlock_32:
QuickSortProgram.Swap(array, j, k);
j = (j + 1);
goto BasicBlock_33;
}
else {
goto BasicBlock_33;
Block_45:
}
BasicBlock_33:
k = (k + 1);
continue;
}
BasicBlock_35:
QuickSortProgram.Swap(array, right, j);
return j;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
BasicBlock_48:
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
return;
}
}

138
Decompiler/doc/Dissertation/Evolution/08_Remove_dead_jumps.cs → doc/Dissertation/Evolution/08_Remove_dead_jumps.cs
Unescape View File

@ -1,69 +1,69 @@ @@ -1,69 +1,69 @@
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
System.Int32[] V_0 = new int[((int)args.Length)];
int i = 0;
for (;;) {
if (!(i < ((int)V_0.Length))) {
break;
}
else {
}
V_0[i] = System.Int32.Parse(args[i]);
i = (i + 1);
}
QuickSortProgram.QuickSort(V_0, 0, (((int)V_0.Length) - 1));
int j = 0;
for (;;) {
if (!(j < ((int)V_0.Length))) {
break;
}
else {
}
System.Console.Write(System.String.Concat((V_0[j]).ToString(), " "));
j = (j + 1);
}
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
if (!(right <= left)) {
int i = ((left + right) / 2);
int j = QuickSortProgram.Partition(array, left, right, i);
QuickSortProgram.QuickSort(array, left, (j - 1));
QuickSortProgram.QuickSort(array, (j + 1), right);
}
else {
}
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
int i = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int j = left;
int k = left;
for (;;) {
if (!(k < right)) {
break;
}
else {
}
if (!(array[k] > i)) {
QuickSortProgram.Swap(array, j, k);
j = (j + 1);
}
else {
}
k = (k + 1);
}
QuickSortProgram.Swap(array, right, j);
return j;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
}
}
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
System.Int32[] V_0 = new int[((int)args.Length)];
int i = 0;
for (;;) {
if (!(i < ((int)V_0.Length))) {
break;
}
else {
}
V_0[i] = System.Int32.Parse(args[i]);
i = (i + 1);
}
QuickSortProgram.QuickSort(V_0, 0, (((int)V_0.Length) - 1));
int j = 0;
for (;;) {
if (!(j < ((int)V_0.Length))) {
break;
}
else {
}
System.Console.Write(System.String.Concat((V_0[j]).ToString(), " "));
j = (j + 1);
}
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
if (!(right <= left)) {
int i = ((left + right) / 2);
int j = QuickSortProgram.Partition(array, left, right, i);
QuickSortProgram.QuickSort(array, left, (j - 1));
QuickSortProgram.QuickSort(array, (j + 1), right);
}
else {
}
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
int i = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int j = left;
int k = left;
for (;;) {
if (!(k < right)) {
break;
}
else {
}
if (!(array[k] > i)) {
QuickSortProgram.Swap(array, j, k);
j = (j + 1);
}
else {
}
k = (k + 1);
}
QuickSortProgram.Swap(array, right, j);
return j;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
}
}

102
Decompiler/doc/Dissertation/Evolution/09_Reduce_loops.cs → doc/Dissertation/Evolution/09_Reduce_loops.cs
Unescape View File

@ -1,51 +1,51 @@ @@ -1,51 +1,51 @@
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
System.Int32[] V_0 = new int[((int)args.Length)];
for (int i = 0; (i < ((int)V_0.Length)); i = (i + 1)) {
V_0[i] = System.Int32.Parse(args[i]);
}
QuickSortProgram.QuickSort(V_0, 0, (((int)V_0.Length) - 1));
for (int j = 0; (j < ((int)V_0.Length)); j = (j + 1)) {
System.Console.Write(System.String.Concat((V_0[j]).ToString(), " "));
}
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
if (!(right <= left)) {
int i = ((left + right) / 2);
int j = QuickSortProgram.Partition(array, left, right, i);
QuickSortProgram.QuickSort(array, left, (j - 1));
QuickSortProgram.QuickSort(array, (j + 1), right);
}
else {
}
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
int i = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int j = left;
for (int k = left; (k < right); k = (k + 1)) {
if (!(array[k] > i)) {
QuickSortProgram.Swap(array, j, k);
j = (j + 1);
}
else {
}
}
QuickSortProgram.Swap(array, right, j);
return j;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
}
}
using System;
abstract class QuickSortProgram
{
public static void Main(System.String[] args)
{
System.Int32[] V_0 = new int[((int)args.Length)];
for (int i = 0; (i < ((int)V_0.Length)); i = (i + 1)) {
V_0[i] = System.Int32.Parse(args[i]);
}
QuickSortProgram.QuickSort(V_0, 0, (((int)V_0.Length) - 1));
for (int j = 0; (j < ((int)V_0.Length)); j = (j + 1)) {
System.Console.Write(System.String.Concat((V_0[j]).ToString(), " "));
}
}
public static void QuickSort(System.Int32[] array, int left, int right)
{
if (!(right <= left)) {
int i = ((left + right) / 2);
int j = QuickSortProgram.Partition(array, left, right, i);
QuickSortProgram.QuickSort(array, left, (j - 1));
QuickSortProgram.QuickSort(array, (j + 1), right);
}
else {
}
}
private static int Partition(System.Int32[] array, int left, int right, int pivotIndex)
{
int i = array[pivotIndex];
QuickSortProgram.Swap(array, pivotIndex, right);
int j = left;
for (int k = left; (k < right); k = (k + 1)) {
if (!(array[k] > i)) {
QuickSortProgram.Swap(array, j, k);
j = (j + 1);
}
else {
}
}
QuickSortProgram.Swap(array, right, j);
return j;
}
private static void Swap(System.Int32[] array, int index1, int index2)
{
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
}
}

88
Decompiler/doc/Dissertation/Evolution/10_Short_type_names.cs → doc/Dissertation/Evolution/10_Short_type_names.cs
Unescape View File

@ -1,44 +1,44 @@ @@ -1,44 +1,44 @@
using System;
abstract class QuickSortProgram
{
public static void Main(string[] args)
{
int[] V_0 = new int[((int)args.Length)];
for (int i = 0; (i < ((int)V_0.Length)); i = (i + 1)) {
V_0[i] = Int32.Parse(args[i]);
}
QuickSort(V_0, 0, (((int)V_0.Length) - 1));
for (int j = 0; (j < ((int)V_0.Length)); j = (j + 1)) {
Console.Write((V_0[j]).ToString() + " ");
}
}
public static void QuickSort(int[] array, int left, int right)
{
if (!(right <= left)) {
int i = ((left + right) / 2);
int j = Partition(array, left, right, i);
QuickSort(array, left, (j - 1));
QuickSort(array, (j + 1), right);
}
}
private static int Partition(int[] array, int left, int right, int pivotIndex)
{
int i = array[pivotIndex];
Swap(array, pivotIndex, right);
int j = left;
for (int k = left; (k < right); k = (k + 1)) {
if (!(array[k] > i)) {
Swap(array, j, k);
j = (j + 1);
}
}
Swap(array, right, j);
return j;
}
private static void Swap(int[] array, int index1, int index2)
{
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
}
}
using System;
abstract class QuickSortProgram
{
public static void Main(string[] args)
{
int[] V_0 = new int[((int)args.Length)];
for (int i = 0; (i < ((int)V_0.Length)); i = (i + 1)) {
V_0[i] = Int32.Parse(args[i]);
}
QuickSort(V_0, 0, (((int)V_0.Length) - 1));
for (int j = 0; (j < ((int)V_0.Length)); j = (j + 1)) {
Console.Write((V_0[j]).ToString() + " ");
}
}
public static void QuickSort(int[] array, int left, int right)
{
if (!(right <= left)) {
int i = ((left + right) / 2);
int j = Partition(array, left, right, i);
QuickSort(array, left, (j - 1));
QuickSort(array, (j + 1), right);
}
}
private static int Partition(int[] array, int left, int right, int pivotIndex)
{
int i = array[pivotIndex];
Swap(array, pivotIndex, right);
int j = left;
for (int k = left; (k < right); k = (k + 1)) {
if (!(array[k] > i)) {
Swap(array, j, k);
j = (j + 1);
}
}
Swap(array, right, j);
return j;
}
private static void Swap(int[] array, int index1, int index2)
{
int i = array[index1];
array[index1] = array[index2];
array[index2] = i;
}
}

84
Decompiler/doc/Dissertation/Evolution/QuickSort_original.cs → doc/Dissertation/Evolution/QuickSort_original.cs
Unescape View File

@ -1,43 +1,43 @@ @@ -1,43 +1,43 @@
static class QuickSortProgram
{
public static void Main(string[] args)
{
int[] intArray = new int[args.Length];
for (int i = 0; i < intArray.Length; i++) {
intArray[i] = int.Parse(args[i]);
}
QuickSort(intArray, 0, intArray.Length - 1);
for (int i = 0; i < intArray.Length; i++) {
System.Console.Write(intArray[i].ToString() + " ");
}
}
public static void QuickSort(int[] array, int left, int right)
{
if (right > left) {
int pivotIndex = (left + right) / 2;
int pivotNew = Partition(array, left, right, pivotIndex);
QuickSort(array, left, pivotNew - 1);
QuickSort(array, pivotNew + 1, right);
}
}
static int Partition(int[] array, int left, int right, int pivotIndex)
{
int pivotValue = array[pivotIndex];
Swap(array, pivotIndex, right);
int storeIndex = left;
for(int i = left; i < right; i++) {
if (array[i] <= pivotValue) {
Swap(array, storeIndex, i);
storeIndex = storeIndex + 1;
}
}
Swap(array, right, storeIndex);
return storeIndex;
}
static void Swap(int[] array, int index1, int index2)
{
int tmp = array[index1];
array[index1] = array[index2];
array[index2] = tmp;
}
static class QuickSortProgram
{
public static void Main(string[] args)
{
int[] intArray = new int[args.Length];
for (int i = 0; i < intArray.Length; i++) {
intArray[i] = int.Parse(args[i]);
}
QuickSort(intArray, 0, intArray.Length - 1);
for (int i = 0; i < intArray.Length; i++) {
System.Console.Write(intArray[i].ToString() + " ");
}
}
public static void QuickSort(int[] array, int left, int right)
{
if (right > left) {
int pivotIndex = (left + right) / 2;
int pivotNew = Partition(array, left, right, pivotIndex);
QuickSort(array, left, pivotNew - 1);
QuickSort(array, pivotNew + 1, right);
}
}
static int Partition(int[] array, int left, int right, int pivotIndex)
{
int pivotValue = array[pivotIndex];
Swap(array, pivotIndex, right);
int storeIndex = left;
for(int i = left; i < right; i++) {
if (array[i] <= pivotValue) {
Swap(array, storeIndex, i);
storeIndex = storeIndex + 1;
}
}
Swap(array, right, storeIndex);
return storeIndex;
}
static void Swap(int[] array, int index1, int index2)
{
int tmp = array[index1];
array[index1] = array[index2];
array[index2] = tmp;
}
}

0
Decompiler/doc/Dissertation/ProgressReport.pdf → doc/Dissertation/ProgressReport.pdf
Unescape View File

0
Decompiler/doc/Dissertation/ProgressReport.tex → doc/Dissertation/ProgressReport.tex
Unescape View File

0
Decompiler/doc/Dissertation/Proposal.tex → doc/Dissertation/Proposal.tex
Unescape View File

0
Decompiler/doc/Dissertation/figs/10_Short_type_names_2.cs → doc/Dissertation/figs/10_Short_type_names_2.cs
Unescape View File

0
Decompiler/doc/Dissertation/figs/IfThen.png → doc/Dissertation/figs/IfThen.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 13 KiB

After

Width:  |  Height:  |  Size: 13 KiB

0
Decompiler/doc/Dissertation/figs/IfThenElse.png → doc/Dissertation/figs/IfThenElse.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 18 KiB

After

Width:  |  Height:  |  Size: 18 KiB

0
Decompiler/doc/Dissertation/figs/IfThenElseRechablility.png → doc/Dissertation/figs/IfThenElseRechablility.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 55 KiB

After

Width:  |  Height:  |  Size: 55 KiB

0
Decompiler/doc/Dissertation/figs/IfThenElseReduction.png → doc/Dissertation/figs/IfThenElseReduction.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 46 KiB

After

Width:  |  Height:  |  Size: 46 KiB

0
Decompiler/doc/Dissertation/figs/Ireducible.png → doc/Dissertation/figs/Ireducible.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 13 KiB

After

Width:  |  Height:  |  Size: 13 KiB

0
Decompiler/doc/Dissertation/figs/Loop.png → doc/Dissertation/figs/Loop.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 11 KiB

After

Width:  |  Height:  |  Size: 11 KiB

0
Decompiler/doc/Dissertation/figs/NestedLoops.png → doc/Dissertation/figs/NestedLoops.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 89 KiB

After

Width:  |  Height:  |  Size: 89 KiB

0
Decompiler/doc/Dissertation/figs/NestedLoops2.png → doc/Dissertation/figs/NestedLoops2.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 98 KiB

After

Width:  |  Height:  |  Size: 98 KiB

0
Decompiler/doc/Dissertation/figs/QuickSortMain.png → doc/Dissertation/figs/QuickSortMain.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 23 KiB

After

Width:  |  Height:  |  Size: 23 KiB

88
Decompiler/doc/Dissertation/figs/QuickSort_original.cs → doc/Dissertation/figs/QuickSort_original.cs
Unescape View File

@ -1,44 +1,44 @@ @@ -1,44 +1,44 @@
using System;
static class QuickSortProgram
{
public static void Main(string[] args)
{
int[] intArray = new int[args.Length];
for (int i = 0; i < intArray.Length; i++) {
intArray[i] = int.Parse(args[i]);
}
QuickSort(intArray, 0, intArray.Length - 1);
for (int i = 0; i < intArray.Length; i++) {
Console.Write(intArray[i].ToString() + " ");
}
}
public static void QuickSort(int[] array, int left, int right)
{
if (right > left) {
int pivotIndex = (left + right) / 2;
int pivotNew = Partition(array, left, right, pivotIndex);
QuickSort(array, left, pivotNew - 1);
QuickSort(array, pivotNew + 1, right);
}
}
static int Partition(int[] array, int left, int right, int pivotIndex)
{
int pivotValue = array[pivotIndex];
Swap(array, pivotIndex, right);
int storeIndex = left;
for(int i = left; i < right; i++) {
if (array[i] <= pivotValue) {
Swap(array, storeIndex, i);
storeIndex = storeIndex + 1;
}
}
Swap(array, right, storeIndex);
return storeIndex;
}
static void Swap(int[] array, int index1, int index2)
{
int tmp = array[index1];
array[index1] = array[index2];
array[index2] = tmp;
}
}
using System;
static class QuickSortProgram
{
public static void Main(string[] args)
{
int[] intArray = new int[args.Length];
for (int i = 0; i < intArray.Length; i++) {
intArray[i] = int.Parse(args[i]);
}
QuickSort(intArray, 0, intArray.Length - 1);
for (int i = 0; i < intArray.Length; i++) {
Console.Write(intArray[i].ToString() + " ");
}
}
public static void QuickSort(int[] array, int left, int right)
{
if (right > left) {
int pivotIndex = (left + right) / 2;
int pivotNew = Partition(array, left, right, pivotIndex);
QuickSort(array, left, pivotNew - 1);
QuickSort(array, pivotNew + 1, right);
}
}
static int Partition(int[] array, int left, int right, int pivotIndex)
{
int pivotValue = array[pivotIndex];
Swap(array, pivotIndex, right);
int storeIndex = left;
for(int i = left; i < right; i++) {
if (array[i] <= pivotValue) {
Swap(array, storeIndex, i);
storeIndex = storeIndex + 1;
}
}
Swap(array, right, storeIndex);
return storeIndex;
}
static void Swap(int[] array, int index1, int index2)
{
int tmp = array[index1];
array[index1] = array[index2];
array[index2] = tmp;
}
}

0
Decompiler/doc/Dissertation/figs/T1T2.png → doc/Dissertation/figs/T1T2.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 41 KiB

After

Width:  |  Height:  |  Size: 41 KiB

0
Decompiler/doc/Dissertation/figs/figs.svg → doc/Dissertation/figs/figs.svg
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 152 KiB

After

Width:  |  Height:  |  Size: 152 KiB

0
Decompiler/doc/Dissertation/figs/shortcircuit.png → doc/Dissertation/figs/shortcircuit.png
Unescape View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 66 KiB

After

Width:  |  Height:  |  Size: 66 KiB

Write Preview
Loading…
Cancel
Save