Electrical Fire

Table of Contents

History

Jan 20, 1998 ElectricalFire cancelled due to a shift in strategic direction away from providing Java runtimes. Team disbanded.
Jan 13, 1998 Successfully compiled and executed javac under ElectricalFire. Currently passing 724 out of 808 JCK tests.
Dec 8, 1997 Deleted the LookupI primitive and replaced interface lookup and check system calls with inline code on the Primitives and Bytecode Mappings pages. Replaced the MonitorEnter and MonitorExit system calls with the MEnter and MExit primitives.
Nov 14, 1997 Monitors and Hash Codes subtree added.
Passing 103 out of 492 JCK java.lang test files on Win32.
Nov 6, 1997 Successfully compiled, executed, and passed the first of the JCK java.lang test files on Win32.
Nov 4, 1997 C/C++ Coding Style Guidelines added.
Nov 3, 1997 Debugging design documents added.
Oct 28, 1997 Runtime page added.
Oct 27, 1997 New testing schedule added. Development schedule updated.
Oct 27, 1997 Statically matched MonitorEnter calls with MonitorExit calls. Added the Sync primitive.
Sep 19, 1997 Reduced the number of primitives by half and simplified the remaining ones. Added tuple edges and special memory edge values to mark loads of constants. Added projections and the Debug primitive. The Primitives and Bytecode Mappings pages have undergone major revisions.
Aug 22, 1997 Deleted the MEnter and MExit primitives.
Aug 15, 1997 Added the list of optimizations and another page of code translation examples.
Aug 6, 1997 Successfully compiled and executed the Sieve function on a PA-RISC machine.
Jul 22, 1997 Successfully compiled and executed the Sieve function on a SPARC machine.
Completed the proof of the scheduling algorithm. Revised the constraints on control graphs to make the proof work.
Jul 21, 1997 Added the Control Scheduling page that describes an algorithm to order control nodes so as to minimize branches.
Revamped the Control Edge Details page -- added descriptions of cycles, loops, regular and irregular backward edges. Corrected errors in the discussion of exception edges. Added backward exception edges.
Changed the definition of aexc nodes so that they are the targets of backward edges instead of originating backward edges.
Added acatch nodes.
Added caveats to the primitive graph example 1.
Jul 3, 1997 Having added instruction patterns for additional x86 addressing modes, we now produce faster code than the Symantec JIT on the Sieve benchmark. Our code will get even better when we add some optimizations.
Jul 2, 1997 Third milestone: Successfully compiled and executed the Sieve function on a Pentium Pro machine. Benchmarks indicate that we're at 73% of the performance of code generated by the Symantec JIT, and we don't have any instruction patterns for complex x86 instructions and haven't done any optimizations yet.
Jun 13, 1997 We can now generate primitive graphs containing method calls and object operator new.
Jun 11, 1997 Second milestone (ahead of schedule): Successfully compiled and executed the Sieve function on a PowerPC Macintosh.
Jun 6, 1997 Added immediate versions of LdC. Added ChkCast and LimCast primitives for inline cast checking. Revamped system calls to improve cast checking and provided new bytecode translations for checkcast and instanceof. Changed several improper usages of "class" to "type".
Jun 3, 1997 Split the DivMod primitives into Div and Mod.
May 28, 1997 Significant revisions in the primitive graph format section. Added exception and return control edges and several new kinds of control nodes. Deleted exception data flow edges. Specified primitives for arguments, results, exception catching, and safety checks. Added null-checking memory loads and stores. Corrected obsolete parts of the spec dealing with if-nodes.
May 14, 1997 Added Physical Machine Model.
May 12, 1997 First milestone: Our code generates primitive graphs from Java class files containing simple functions.

Navigation

Home Previous One level up Next

By clicking on the single right or left arrows you can visit all pages in a linear sequence.