Skip to content

V
V8
Switch branch/tag
  1. 15 Apr, 2011 1 commit
  3. 07 Apr, 2011 1 commit
  5. 27 Mar, 2011 2 commits
  7. 24 Mar, 2011 1 commit
  9. 23 Mar, 2011 1 commit
  11. 22 Mar, 2011 1 commit
  13. 18 Mar, 2011 3 commits
  15. 17 Feb, 2011 1 commit
  17. 11 Feb, 2011 1 commit
  19. 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
  21. 25 Jan, 2011 2 commits
  23. 20 Jan, 2011 1 commit
  25. 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
  27. 11 Jan, 2011 1 commit
  29. 07 Jan, 2011 1 commit
  31. 05 Jan, 2011 1 commit
  33. 04 Jan, 2011 1 commit
  35. 22 Dec, 2010 1 commit
  37. 20 Dec, 2010 1 commit
  39. 17 Dec, 2010 1 commit
  41. 14 Dec, 2010 1 commit
  43. 10 Dec, 2010 1 commit
  45. 07 Dec, 2010 4 commits
  47. 24 Nov, 2010 1 commit
  49. 23 Nov, 2010 1 commit
  51. 22 Nov, 2010 1 commit
  53. 17 Nov, 2010 2 commits
  55. 08 Nov, 2010 2 commits
  57. 05 Nov, 2010 1 commit
  59. 20 Oct, 2010 1 commit
  61. 07 Oct, 2010 1 commit