| Age | Commit message (Expand) | Author |
|---|
| 2017-07-12 | Fixed the computation of dominators for the loops detection. | Cyrille Bagard |
| 2017-05-10 | Rewritten the whole bitfield management. | Cyrille Bagard |
| 2017-04-13 | Simplified the way links between instructions are handled. | Cyrille Bagard |
| 2017-03-23 | Restricted an instruction iterator to a given memory range if requested. | Cyrille Bagard |
| 2016-12-31 | Updated all copyrights. | Cyrille Bagard |
| 2016-12-15 | Defined proper accesses to instructions loaded by a processor. | Cyrille Bagard |
| 2016-11-03 | Replaced all the remaining occurrences of 'OpenIDA' by 'Chrysalide'. | Cyrille Bagard |
| 2016-10-28 | Optimized access to instruction sources and destinations. | Cyrille Bagard |
| 2016-10-28 | Cleaned the structure for instructions a little bit. | Cyrille Bagard |
| 2016-10-15 | Avoided many infinite loops when computing ranks in Dalvik basic blocks. | Cyrille Bagard |
| 2016-10-09 | Defined a new and simpler way to produce graphical view of basic blocks. | Cyrille Bagard |
| 2016-05-28 | Built the basic blocks list simply at loading. | Cyrille Bagard |
| 2016-04-20 | Protected all concurrent accesses to sources and destinations of instructions. | Cyrille Bagard |
| 2016-04-02 | Handled all routines disassembling processing in one place. | Cyrille Bagard |
| 2016-03-26 | Extracted the logic of code nodes for better processing. | Cyrille Bagard |
