14
I Use This!
Moderate Activity

Commits : Listings

Analyzed 1 day ago. based on code collected 1 day ago.
Jun 05, 2023 — Jun 05, 2024
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
GUI debugging controls More... over 16 years ago
Generate the initial graph. Output the graph as nested blocks. More... over 16 years ago
Create class for each node type More... over 16 years ago
Working on graph reduction algorithm. (Graph creation and presentation is still missing) More... over 16 years ago
Split method body to basic blocks More... over 16 years ago
Bugfix - keep return if it is labelled. More... over 16 years ago
Define local variables when value is first assigned to them More... over 16 years ago
Do not output the very last return statement More... over 16 years ago
Test on the compiler optimized version of quicksort More... over 16 years ago
Remove some parenthesis More... over 16 years ago
Join consecutive expression together if possible More... over 16 years ago
Convert ByteCodeCollection to new data representation: StackExpressionCollection; Modify the generating code to use this data representation More... over 16 years ago
Move stack analysis to the ByteCode class More... over 16 years ago
Move StackBehaviour code to separate file More... over 16 years ago
Moved typing code to ByteCode.GetType() More... over 16 years ago
Move code from Util class to - ByteCode.PopCount - ByteCode.PushCount More... over 16 years ago
Use custom data structure to store bytecode sequence More... over 16 years ago
Remove unnecessary labels More... over 16 years ago
Get type of elements obtained from array More... over 16 years ago
Get type for stack slots (partially implemented); Types are stored as Cecil TypeReferences More... over 16 years ago
Hack - convert int to bool on == operator More... over 16 years ago
Get type of new array More... over 16 years ago
Added "using System;"; Do not create namespace with empty name More... over 16 years ago
Output local variables More... over 16 years ago
Use stack analysis to figure out basic data flow - use actual inputs instead of the dummy ones More... over 16 years ago
Initial stack analysis implementation: Verify that the stack sizes are consistent - ie at a given location the stack size is statically known and constant. Keep track of instruction which pushed a given value on the stack. (Not handling the potential problem at control merge points - this problem does not occur in the quick sort algorithm) The state of the stack is outputted as a comment in the source code More... over 16 years ago
Started a type checking algorithm More... over 16 years ago
Assign the result of each instruction to a temporary local variable More... over 16 years ago
Ldelema; Instance method calls More... over 16 years ago
Implemented 'ret' instruction (function return) More... over 16 years ago