Issue Details (XML | Word | Printable)

Key: RVM-573
Type: Improvement Improvement
Status: Open Open
Priority: Trivial Trivial
Assignee: Unassigned
Reporter: David Grove
Votes: 0
Watchers: 0
Operations

If you were logged in you would be able to see more operations.
RVM

Empirically evaluate cmp/branch vs. conditional traps for nullcheck/bounds check on PPC

Created: 07/Jul/08 07:59 AM   Updated: 07/Jul/08 07:59 AM
Component/s: Compiler: Baseline, Compiler: Optimizing, Instruction Architecture: PowerPC
Affects Version/s: None
Fix Version/s: 1000

Time Tracking:
Not Specified


 Description  « Hide
We have been told by PPC architecture experts that on at least some PPC implementations,
a cmp/branch forward to unconditional trap is likely to be
a better sequence for null checks on PPC (and possibly for array bounds
checks as well) because the hardware may do a better job of branch prediction than trap prediction.

Implement this alternative and empirically evaluate cmp/branch vs traps.

We use a cmp/branch sequence on IA32. Be sure to look at
OPT_FinalMIRExpansion on IA32 to see how to handle the GC maps.



 All   Comments   Work Log   Change History      Sort Order: Ascending order - Click to sort in descending order
There are no comments yet on this issue.