[llvm] r269677 - [WebAssembly] Add a few optimization ideas to README.txt.

Dan Gohman via llvm-commits llvm-commits at lists.llvm.org
Mon May 16 11:51:03 PDT 2016


Author: djg
Date: Mon May 16 13:51:03 2016
New Revision: 269677

URL: http://llvm.org/viewvc/llvm-project?rev=269677&view=rev
Log:
[WebAssembly] Add a few optimization ideas to README.txt.

Modified:
    llvm/trunk/lib/Target/WebAssembly/README.txt

Modified: llvm/trunk/lib/Target/WebAssembly/README.txt
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Target/WebAssembly/README.txt?rev=269677&r1=269676&r2=269677&view=diff
==============================================================================
--- llvm/trunk/lib/Target/WebAssembly/README.txt (original)
+++ llvm/trunk/lib/Target/WebAssembly/README.txt Mon May 16 13:51:03 2016
@@ -113,3 +113,18 @@ particularly when duplicating code, to a
 the duplication.
 
 //===---------------------------------------------------------------------===//
+
+WebAssemblyRegStackify could use AliasAnalysis to reorder loads and stores more
+aggressively.
+
+//===---------------------------------------------------------------------===//
+
+WebAssemblyRegStackify is currently a greedy algorithm. This means that, for
+example, a binary operator will stackify with its user before its operands.
+However, if moving the binary operator to its user moves it to a place where
+its operands can't be moved to, it would be better to leave it in place, or
+perhaps move it up, so that it can stackify its operands. A binary operator
+has two operands and one result, so in such cases there could be a net win by
+prefering the operands.
+
+//===---------------------------------------------------------------------===//




More information about the llvm-commits mailing list