diff options
| author | Hiroshi Yamauchi <yamauchi@google.com> | 2015-10-29 15:34:54 -0700 |
|---|---|---|
| committer | Hiroshi Yamauchi <yamauchi@google.com> | 2015-11-09 18:18:35 -0800 |
| commit | 86c3f4805a8656d52bff8fc3f48fc27daf1e6c67 (patch) | |
| tree | 7c8fdaf3637c1fefbb8926e4bbbabcca3e2661a6 /compiler/optimizing/code_generator_utils.cc | |
| parent | 78232f2482e71fef255796633da68bb769baa93a (diff) | |
Rosalloc fast path in assembly for x86_64.
Measurements (host, ms)
BinaryTrees: 324 -> 360 (+11%)
BinaryTrees with 64 MB alloc stack + 1 GB heap:
299 -> 275 (-8%)
MemAllocTest: 414 -> 368 (-11%)
Interestingly, BinaryTrees gets slower with default settings due to more
blocking (gc-for-alloc) collections. It seems because allocations are
faster, the allocation stack size and the heap size become the
bottleneck (note both an allocation stack overflow as well as heap
exhaustion cause gc-for-alloc collections). With a larger allocation
stack and heap where no blocking collections are observed, BinaryTrees
gets faster.
Bug: 9986565
Change-Id: I642b9fecd0a583cc133998c2f3932de815c4a757
Diffstat (limited to 'compiler/optimizing/code_generator_utils.cc')
0 files changed, 0 insertions, 0 deletions