gh-mirror/mikepaul-LuaJIT
1
0
Fork 0
mirror of https://github.com/LuaJIT/LuaJIT.git synced 2025-02-07 23:24:09 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update changelog.

Browse Source
This commit is contained in:
Mike Pall 2010-03-15 17:20:08 +01:00
parent c4727220e8
commit e57390f734
2 changed files with 19 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
doc/changes.html
View File

@ -51,6 +51,24 @@ Please check the
<a href="http://luajit.org/changes.html"><span class="ext">&raquo;</span>&nbsp;Online Change History</a> <a href="http://luajit.org/changes.html"><span class="ext">&raquo;</span>&nbsp;Online Change History</a>
to see whether newer versions are available. to see whether newer versions are available.
</p> </p>
<div class="major" style="background: #d0d0d0;">
<h2 id="snap">Development Snapshot</h2>
<ul>
<li>Correctness and completeness:
<ul>
<li>Fix folding of ordered comparisons with same references.</li>
<li>Fix snapshot restores for multi-result bytecodes.</li>
<li>Fix potential hang when recording bytecode with nested closures.</li>
<li>Fix recording of getmetatable(), tonumber() and bad argument types.</li>
<li>Fix SLOAD fusion across returns to lower frames.</li>
</ul></li>
<li>Structural and performance enhancements:
<ul>
<li>Add array bounds check elimination. -Oabc is enabled by default.</li>
</ul></li>
</div>
<div class="major" style="background: #ffd0d0;"> <div class="major" style="background: #ffd0d0;">
<h2 id="LuaJIT-2.0.0-beta3">LuaJIT 2.0.0-beta3 &mdash; 2010-03-07</h2> <h2 id="LuaJIT-2.0.0-beta3">LuaJIT 2.0.0-beta3 &mdash; 2010-03-07</h2>
<ul> <ul>

2
doc/status.html
View File

@ -186,7 +186,7 @@ overriding goal for a low-footprint, low-overhead JIT compiler.
</li> </li>
<li> <li>
More <b>optimizations</b> will be added in parallel to the last step on More <b>optimizations</b> will be added in parallel to the last step on
an as-needed basis. Array-bounds-check (ABC) removal, sinking of stores an as-needed basis. Sinking of stores
to aggregates and sinking of allocations are high on the list. Faster to aggregates and sinking of allocations are high on the list. Faster
handling of NEWREF and better alias analysis are desirable, too. More handling of NEWREF and better alias analysis are desirable, too. More
complex optimizations with less pay-off, such as value-range-propagation complex optimizations with less pay-off, such as value-range-propagation