Skip to content

V
V8
Switch branch/tag
  1. 04 Jan, 2013 1 commit
  3. 18 Dec, 2012 1 commit
  5. 10 Dec, 2012 1 commit
  7. 05 Dec, 2012 1 commit
  9. 03 Dec, 2012 2 commits
  11. 30 Nov, 2012 2 commits
  13. 12 Jul, 2012 2 commits
  15. 11 Jun, 2012 1 commit
  17. 22 Feb, 2012 1 commit
  19. 21 Feb, 2012 1 commit
  21. 03 Feb, 2012 1 commit
  23. 10 Nov, 2011 1 commit
  25. 06 Jun, 2011 1 commit
  27. 06 May, 2011 1 commit
  29. 03 May, 2011 1 commit
  31. 18 Mar, 2011 3 commits
  33. 10 Mar, 2011 1 commit
  35. 23 Feb, 2011 1 commit
  37. 04 Feb, 2011 1 commit
    • fschneider@chromium.org's avatar
      Remove instruction summaries. · 17da434b
      fschneider@chromium.org authored 
      Instead of constructing a temporary container for all LOperands of each
instruction, the register works directly on the LIR instructions that
 provide an abstract interface for input/output/temp operands.

This saves allocation of zone memory and speeds up LIR construction,
but makes iterating over all uses in the register allocator slightly
more expensive because environment uses are stored in a linked list of
environments. We can fix this by using a flat representation of LOperands.


Review URL: http://codereview.chromium.org/6352006

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@6638 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
      17da434b
  39. 20 Jan, 2011 1 commit
  41. 19 Jan, 2011 1 commit
  43. 17 Jan, 2011 1 commit
    • kmillikin@chromium.org's avatar
      Change the algorithm and generated code for parallel moves on IA32. · 437914da
      kmillikin@chromium.org authored 
      Instead of spilling and then immediately restoring eax to resolve
memory to memory moves, the gap move resolver now tracks registers
that are known to be free and uses one if available.  If not it spills
but restores lazily when the spilled value is needed or at the end of
the algorithm.

Instead of using esi for resolving cycles and assuming it is free to
overwrite because it can be rematerialized, the gap move resolver now
resolves cycles using swaps, possibly using a free register as above.

The algorithm is also changed to be simpler: a recursive depth-first
traversal of the move dependence graph.  It uses a list of moves to be
performed (because it mutates the moves themselves), but does not use
any auxiliary structure other than the control stack.  It does not
build up a separate list of scheduled moves to be interpreted by the
code generate, but emits code on the fly.

Review URL: http://codereview.chromium.org/6263005

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@6344 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
      437914da
  45. 14 Jan, 2011 1 commit
  47. 10 Jan, 2011 1 commit
  49. 05 Jan, 2011 1 commit
    • sgjesse@chromium.org's avatar
      Optimize instanceof further · 7311e10f
      sgjesse@chromium.org authored 
      If the instance of is performed against what is beliwed to be a constant global function inline the instance of check and have the call to the instanceof stub in deferred code. The inlined check will be patched by the instanceof stub when called from deferred code. This is indicated by the lithium instruction LInstanceOfKnownGlobal.

To help the patching the delta from the return address to the patch site is placed just below the return address in the edi slot of the pushad/popad ares. This is safe because the edi register (which is pushed last) is a temporary for the lithium instruction.

As the instanceof stub can call other JavaScript an additional marking for saving all double registers have been added.

Also tweaked the instanceof stub to produce true/false objects instead of 0/1 for the case with deferred code.
Review URL: http://codereview.chromium.org/5990005

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@6173 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
      7311e10f
  51. 04 Jan, 2011 1 commit
  53. 03 Jan, 2011 1 commit
  55. 10 Dec, 2010 1 commit
  57. 07 Dec, 2010 3 commits