1. 16 Oct, 2015 3 commits
  2. 15 Oct, 2015 2 commits
    • Subzero: Various fixes in preparation for x86-32 register aliasing. · 1fb030c6
      Jim Stichnoth authored
      1. Helper function sameVarOrReg() also needs to return true if the two physical registers alias or overlap.  Otherwise advanced phi lowering may pick an incorrect ordering.
      
      2. With -asm-verbose, redundant truncation assignments expressed as _mov instructions, like "mov cl, ecx", need to have their register use counts updated properly, so that the LIVEEND= annotations are correct.
      
      3. The register allocator should consider suitably typed aliases when choosing a register preference.
      
      4. When evicting a variable, the register allocator should decrement the use count of all aliases.
      
      5. When saving/restoring callee-save registers in the prolog/epilog, map each register to its "canonical" register (e.g. %bl --> %ebx) and make sure each canonical register is only considered once.
      
      6. Remove some unnecessary Variable::setMustHaveReg() calls.
      
      7. When assigning bool results as a constant 0 or 1, use an 8-bit constant instead of 32-bit so that only the 8-bit register gets assigned.
      
      BUG= none
      TEST= make check, plus spec2k -asm-verbose output is unchanged
      R=kschimpf@google.com
      
      Review URL: https://codereview.chromium.org/1405643003 .
    • Optimize 64-bit compares with zero · 5c87542a
      David Sehr authored
      Comparisons with zero can be done with no branches in most cases and with
      simpler sequences of operations.
      
      BUG=
      R=stichnot@chromium.org
      
      Review URL: https://codereview.chromium.org/1406593003 .
  3. 14 Oct, 2015 1 commit
  4. 13 Oct, 2015 2 commits
  5. 12 Oct, 2015 1 commit
    • Subzero: Consider all instruction variables for register preference. · 28b71be4
      Jim Stichnoth authored
      The original code only looked at top-level source operands in the defining instruction, with a TODO to instead consider all inner variables in the instruction.
      
      The primary reason is so that we end up with more instructions like
        mov eax, eax
      which are later elided as redundant assignments.
      
      A secondary reason is to foster more instructions like:
        mov ecx, [ecx]
      rather than
        mov eax, [ecx]
      where ecx's live range ends.  This hopefully keeps eax (in the latter case) free for longer and maybe allow some other variable to get a register.  By considering all instruction variables, we enable this.
      
      BUG= none
      R=jpp@chromium.org
      
      Review URL: https://codereview.chromium.org/1392383003 .
  6. 09 Oct, 2015 5 commits
  7. 08 Oct, 2015 2 commits
  8. 07 Oct, 2015 3 commits
    • Create local copy of Dart assembler code. · 3e53dc99
      Karl Schimpf authored
      Creates a local version of the Dart assembler code, before being
      merged into our code base. The goal of these files is to track code as
      it is moved from the Dart implementation into our code base.
      
      BUG= https://code.google.com/p/nativeclient/issues/detail?id=4334
      R=jpp@chromium.org, stichnot@chromium.org
      
      Review URL: https://codereview.chromium.org/1394613002 .
    • Make sure that all globals are internal, except for "start" functions. · 57d31ac7
      Karl Schimpf authored
      The existing code, when run on a fuzzed example, generates a runtime
      assertion. The reason for this is that the input defines "memmove" as
      an external global. However, the code generator can generate calls to
      "memmove" which assumes it is internal (see PNaCl ABI). As a result,
      the assertion that checks that global names are unique (for memmove)
      fails.
      
      This code fixes the problem by checking that global names are
      internal, unless they are one of the "start" functions,
      or the function is an intrinsic. To allow for
      non-PNaCl ABI input, a flag was added to allow functions to be
      external. However, in such cases the external can't be one of
      Subzero's runtime helper functions.
      
      BUG= https://code.google.com/p/nativeclient/issues/detail?id=4330
      R=jpp@chromium.org, stichnot@chromium.org
      
      Review URL: https://codereview.chromium.org/1387963002 .
    • Generate better two address code by using commutativity · 487bad02
      David Sehr authored
      For operations such as
          t0 = t1 + t2
      Subzero's pattern for arithmetic operations generates two address code that
      looks like
          movl ...t1..., %ecx
          addl ...t2..., %ecx // t0 is in %ecx
      
      When register pressure is high this sometimes becomes:
          movl ...t2..., SPILL
          movl ...t1..., %ecx
          addl SPILL, %ecx // t0 is in %ecx
      
      This CL takes advantage of cases where the use of t2 is the last one, so the
      register that held t2 before the operation can be reused.  The optimization
      simply swaps the (commutative) operation to
          t0 = t2 + t1
      which then generates code as
          movl ...t2..., %ecx
          addl ...t1..., %ecx // t0 is in %ecx
      
      This optimization is used for any commutative operation, which now includes
      Fadd and Fmul, which were erroneously marked as non-commutative.  See the
      rationale in IceInst.def for the IEEE wordings.
      
      BUG=
      R=jfb@chromium.org, stichnot@chromium.org
      
      Review URL: https://codereview.chromium.org/1371703003 .
  9. 06 Oct, 2015 2 commits
  10. 05 Oct, 2015 3 commits
    • Subzero: Improve lowering sequence for "a=b*b". · ebbb5912
      Jim Stichnoth authored
      Originally, the lowering sequence looked like:
        T = b
        T *= b
        a = T
      Now it looks like:
        T = b
        T *= T
        a = T
      
      If "b" gets a register and its live range ends after this instruction, then the new lowering sequence allows its register to be reused for "T".  This decreases register pressure, and removes an instruction (register move) from what could be a critical path.
      
      This optimization is actually applicable for most arithmetic operations whose source operands are identical, but mul/fmul are the only ones that seem at all likely in practice.
      
      BUG= none
      R=kschimpf@google.com
      
      Review URL: https://codereview.chromium.org/1377213004 .
    • Subzero: Fix nondeterministic behavior in constant pool creation. · b36757e1
      Jim Stichnoth authored
      This issue was discovered as the result of a spurious "make check-lit" failure in undef.ll.
      
      The problem is that constant pool label strings depend on the order the constants are created, and this order can be different with multithreaded translation.
      
      Even -filetype=obj is affected by this, because the label string is put into the ELF .o file.  This means that different runs of Subzero on the same input could potentially produce slightly different output.
      
      The solution is to base the label name on the actual value of the constant.  We do this by using the hex representation of the constant, rather than the sequence number of the constant within the pool.  This actually simplifies things a bit, as we no longer need to track the sequence number.
      
      In addition, for floating-point constant labels in asm-verbose mode, include a human-readable rendering of the value in the label name.
      
      BUG= none
      R=kschimpf@google.com
      
      Review URL: https://codereview.chromium.org/1386593004 .
    • Subzero: With -asm-verbose, make the predecessor list more compact. · 9a63babb
      Jim Stichnoth authored
      Instead of a comment like this:
      
        # preds=.Lfv_update_nonbon$split___114___115_0,.Lfv_update_nonbon$split___138___115_1
      
      remove some redundancy and make the comment like this:
      
        # preds=$split___114___115_0,$split___138___115_1
      
      This makes it slightly easier to read, and less likely to exceed 80 columns.
      
      BUG= none
      R=kschimpf@google.com
      
      Review URL: https://codereview.chromium.org/1380323003 .
  11. 02 Oct, 2015 3 commits
    • Change from ::stdout to stderr when reporting fatal error. · 4e6ea83a
      Karl Schimpf authored
      The pnacl linux x86_64 buildbot doesn't understand ::stdout (it uses
      a macro to define stdout). Fix by removing :: prefix. Also redirects
      the error messages to stderr instead of stdout.
      
      BUG=None
      R=stichnot@chromium.org
      
      Review URL: https://codereview.chromium.org/1383053002 .
    • Remove dependence on header file unistd.h. · 7e64eaaa
      Karl Schimpf authored
      Fixes bug in function reportFatalErrorThenExitSuccess by using fwrite
      instead of write (a unix posix include file not supported by MSC).
      
      BUG=None
      R=stichnot@chromium.org
      
      Review URL: https://codereview.chromium.org/1370323005 .
    • Subzero: Use register availability during lowering to improve the code. · 318f4cda
      Jim Stichnoth authored
      The problem is that given code like this:
      
        a = b + c
        d = a + e
        ...
        ... (use of a) ...
      
      Lowering may produce code like this, at least on x86:
      
        T1 = b
        T1 += c
        a = T1
        T2 = a
        T2 += e
        d = T2
        ...
        ... (use of a) ...
      
      If "a" has a long live range, it may not get a register, resulting in clumsy code in the middle of the sequence like "a=reg; reg=a".  Normally one might expect store forwarding to make the clumsy code fast, but it does presumably add an extra instruction-retirement cycle to the critical path in a pointer-chasing loop, and makes a big difference on some benchmarks.
      
      The simple fix here is, at the end of lowering "a=b+c", keep track of the final "a=T1" assignment.  Then, when lowering "d=a+e" and we look up "a", we can substitute "T1".  This slightly increases the live range of T1, but it does a great job of avoiding the redundant reload of the register from the stack location.
      
      A more general fix (in the future) might be to do live range splitting and let the register allocator handle it.
      
      BUG= https://code.google.com/p/nativeclient/issues/detail?id=4095
      R=kschimpf@google.com
      
      Review URL: https://codereview.chromium.org/1385433002 .
  12. 01 Oct, 2015 7 commits
    • Subzero. Adds I64 register pairs for ARM32. · ed2c06b2
      John Porto authored
      This is in preparation for llvm.nacl.atomic.* lowerings. atomic i64
      loads and stores require their operands to be consecutive registers
      starting at an even register that is not r14.
      
      BUG= https://code.google.com/p/nativeclient/issues/detail?id=4076
      R=kschimpf@google.com
      
      Review URL: https://codereview.chromium.org/1382063002 .
    • Subzero. Fixes a bug in the register allocator. · 7cb12682
      John Porto authored
      This bug was uncovered While implementing the llvm.nacl.atomic.cmpxchg
      lowering for i64 for ARM32. For reference, the lowering is
      
      retry:
          ldrexd     tmp_i, tmp_i+1 [addr]
          cmp        tmp_i+1, expected_i+1
          cmpeq      tmp_i, expected_i
          strexdeq   success, new_i, new_i+1, [addr]
          movne      expected_i+1, tmp_i+1
          movne      expected_i, tmp_i
          cmpeq      success, #0
          bne        retry
          mov        dest_i+1, tmp_i+1
          mov        dest_i, tmp_i
      
      The register allocator would allocate r4 to both success and new_i,
      which is clearly wrong (expected_i is alive thought the cmpxchg loop.)
      Adding a fake-use(new_i) after the loop caused the register allocator
      to fail due to the impossibility to allocate a register for an infinite
      weight register. The problem was being caused for not evicting live
      ranges that were assigned registers that alias the selected register.
      
      BUG=
      R=kschimpf@google.com, stichnot@chromium.org
      
      Review URL: https://codereview.chromium.org/1373823006 .
    • Subzero. Adds ldrex, strex, and dmb support (ARM32) · 16991847
      John Porto authored
      These instructions are used to load/store data atomically, and to
      notify the processor about a data memory barrier. They are used for
      implementing the llvm.nacl.atomic.* lowerings.
      
      BUG= https://code.google.com/p/nativeclient/issues/detail?id=4076
      R=stichnot@chromium.org
      
      Review URL: https://codereview.chromium.org/1378303003 .
    • Add include files so that IceCompilerServer.cpp can compile on MSC. · 166cbf4a
      Karl Schimpf authored
      A recent change to IceCompilerServer.cpp was added to allow fatal
      errors to return exit status zero. However, this code called ::write
      (a C function) that is not defined when compiling with MSC. This CL
      adds includes to fix this problem.
      
      BUG=None
      R=stichnot@chromium.org
      
      Review URL: https://codereview.chromium.org/1379613005 .
    • Subzero: Fix a bug in register allocator overlap computation. · 48e3ae5c
      Jim Stichnoth authored
      When the register allocator decides whether to allow the candidate's live range to overlap its preferred variable's live range (and share their register), it needs to consider whether any redefinitions in one variable occur within the live range of the other variable, in which case overlap should not be allowed.
      
      There was a bug in the API for iterating over the defining instructions for a variable, in which the earliest definition might be ignored in some cases.  This came from the fact that the first definition and latter definitions are split apart for translation speed reasons, and a particular API is needed for finding an unambiguous first definition, which is possible when all definitions are within a single block but not so possible when definitions cross block boundaries.  (This only happens for the simple phi lowering.)
      
      Since both semantics are needed, a separate API is added to support both.
      
      For spec2k, the asm output is identical to before, so this changes nothing.  When translating spec2k with "-O2 -phi-edge-split=0", there is a single minor difference in ammp that actually looks legit in both cases.
      
      However, when testing an upcoming CL, -phi-edge-split=0 triggered the bug, causing gcc and crafty to fail with incorrect output.
      
      This CL also fixes some minor issues, and adds dump output of the instruction definition list when available.
      
      BUG= none
      R=jpp@chromium.org
      
      Review URL: https://codereview.chromium.org/1381563004 .
    • Subzero: Add missing content to CfgLocalAllocator. · 91d1b80f
      Jim Stichnoth authored
      The std::list<> implementation used by g++ needs some extra stuff defined in the custom allocator.
      
      This can be smoke-tested with:
      
        make -f Makefile.standalone CXX=g++ LLVM_EXTRA_WARNINGS="-Wno-unknown-pragmas -Wno-unused-parameter -Wno-comment -Wno-enum-compare -Wno-strict-aliasing" STDLIB_FLAGS=
      
      until the link fails for unrelated reasons.
      
      BUG= https://code.google.com/p/nativeclient/issues/detail?id=4325
      R=kschimpf@google.com
      
      Review URL: https://codereview.chromium.org/1367403004 .
    • Subzero: Change -asm-verbose output to print more useful info. · 238b4c16
      Jim Stichnoth authored
      Frame offsets for variables are emitted using a symbolic name based on the variable's name.  This makes it a bit easier to digest the asm code.
      
      For example, if variable Foo gets an esp offset 24, asm like this:
        ... 24(%esp) ...
      will instead be emitted like this:
        lv$Foo = 24
        ...
        ... lv$Foo(%esp) ...
      
      Predecessor labels are printed for each basic block.
      
      Loop nest depth is printed for each basic block.  (Would be nice if we had loop header info as well.)
      
      BUG= none
      R=jpp@chromium.org
      
      Review URL: https://codereview.chromium.org/1377323002 .
  13. 30 Sep, 2015 2 commits
  14. 28 Sep, 2015 2 commits
  15. 26 Sep, 2015 1 commit
    • Subzero: Improve usability of liveness-related tools. · 230d4101
      Jim Stichnoth authored
      1. Rename all identifiers containing "nonkillable" to use the more understandable "redefined".
      
      2. Change inferTwoAddress() to be called inferRedefinition(), and to check *all* instruction source variables (instead of just the first source operand) against the Dest variable.  This eliminates the need for several instances of _set_dest_redefined().  The performance impact on translation time is something like 0.1%, which is dwarfed by the usability gain.
      
      3. Change a cryptic assert in (O2) live range construction to print detailed information on the liveness errors.
      
      4. Change a cryptic assert in (Om1) live range construction to do the same.
      
      BUG= none
      R=jpp@chromium.org
      
      Review URL: https://codereview.chromium.org/1368993004 .
  16. 25 Sep, 2015 1 commit