1. 21 Dec, 2016 2 commits
  2. 20 Dec, 2016 7 commits
  3. 19 Dec, 2016 7 commits
    • Build: Fix #633, add missing overrides. · 432576fd
      John Kessenich authored
    • Merge pull request #637 from KhronosGroup/token-paste · 0955b1cb
      John Kessenich authored
      PP: Implement token pasting for PP identifiers.
    • Merge pull request #624 from steve-lunarg/remapper-strip-removed · e6cbc5b1
      John Kessenich authored
      WIP: Remapper: remove debug info for IDs stripped in other passes
    • Merge pull request #635 from steve-lunarg/sample-fix-2 · 4ba444b6
      John Kessenich authored
      HLSL: allow "sample" in expressions.
    • Merge pull request #625 from jbeich/gcc6 · 059d46ee
      John Kessenich authored
      Unbreak build on FreeBSD with GCC/libstdc++ 6.2.0
    • PP: Implement token pasting for PP identifiers. · d485e0b7
      John Kessenich authored
      Implement token pasting as per the C++ specification, within the current
      style of the PP code.
      Non-identifiers (turning 12 ## 10 into the numeral 1210) is not yet covered;
      they should be a simple incremental change built on this one.
      Addresses issue #255.
    • HLSL: allow "sample" in expressions. · a64ed3eb
      steve-lunarg authored
      Unlike other qualifiers, HLSL allows "sample" to be either a qualifier keyword or an
      identifier (e.g, a variable or function name).
      
      A fix to allow this was made a while ago, but that fix was insufficient when 'sample'
      was used in an expression.  The problem was around the initial ambiguity between:
      
         sample float a; // "sample" is part of a fully specified type
      and
         sample.xyz;     // sample is a keyword in a dot expression
      
      Both start the same.  The "sample" was being accepted as a qualifier before enough
      further parsing was done to determine we were not a declaration after all.  This
      consumed the token, causing it to fail for its real purpose.
      
      Now, when accepting a fully specified type, the token is pushed back onto the stack if
      the thing is not a fully specified type.  This leaves it available for subsequent
      purposes.
      
      Changed the "hlsl.identifier.sample.frag" test to exercise this situation, distilled
      down from a production shaders.
  4. 17 Dec, 2016 1 commit
  5. 15 Dec, 2016 1 commit
  6. 14 Dec, 2016 3 commits
  7. 13 Dec, 2016 1 commit
    • Fix size_t to int cast warnings. · 3ec327c5
      Jamie Madill authored
      Several instances in Visual Studio 2015:
      
      warning C4267: 'initializing': conversion from 'size_t' to 'int', possible loss of data
  8. 12 Dec, 2016 2 commits
  9. 10 Dec, 2016 3 commits
  10. 09 Dec, 2016 2 commits
  11. 08 Dec, 2016 3 commits
  12. 07 Dec, 2016 2 commits
    • HLSL: Recursive composite flattening · a2b01a0d
      steve-lunarg authored
      This PR implements recursive type flattening.  For example, an array of structs of other structs
      can be flattened to individual member variables at the shader interface.
      
      This is sufficient for many purposes, e.g, uniforms containing opaque types, but is not sufficient
      for geometry shader arrayed inputs.  That will be handled separately with structure splitting,
       which is not implemented by this PR.  In the meantime, that case is detected and triggers an error.
      
      The recursive flattening extends the following three aspects of single-level flattening:
      
      - Flattening of structures to individual members with names such as "foo[0].samp[1]";
      
      - Turning constant references to the nested composite type into a reference to a particular
        flattened member.
      
      - Shadow copies between arrays of flattened members and the nested composite type.
      
      Previous single-level flattening only flattened at the shader interface, and that is unchanged by this PR.
      Internally, shadow copies are, such as if the type is passed to a function.
      
      Also, the reasons for flattening are unchanged.  Uniforms containing opaque types, and interface struct
      types are flattened.  (The latter will change with structure splitting).
      
      One existing test changes: hlsl.structin.vert, which did in fact contain a nested composite type to be
      flattened.
      
      Two new tests are added: hlsl.structarray.flatten.frag, and hlsl.structarray.flatten.geom (currently
      issues an error until type splitting is online).
      
      The process of arriving at the individual member from chained postfix expressions is more complex than
      it was with one level.  See large-ish comment above HlslParseContext::flatten() for details.
    • HLSL: opcode specific promotion rules for interlocked ops · 05f75142
      steve-lunarg authored
      PR #577 addresses most but not all of the intrinsic promotion problems.
      This PR resolves all known cases in the remainder.
      
      Interlocked ops need special promotion rules because at the time
      of function selection, the first argument has not been converted
      to a buffer object.  It's just an int or uint, but you don't want
      to convert THAT argument, because that implies converting the
      buffer object itself.  Rather, you can convert other arguments,
      but want to stay in the same "family" of functions.  E.g, if
      the first interlocked arg is a uint, use only the uint family,
      never the int family, you can convert the other args as you please.
      
      This PR allows making such opcode and arg specific choices by
      passing the op and arg to the convertible lambda.  The code in
      the new test "hlsl.promote.atomic.frag" would not compile without
      this change, but it must compile.
      
      Also, it provides better handling of downconversions (to "worse"
      types), which are permitted in HLSL.  The existing method of
      selecting upconversions is unchanged, but if that doesn't find
      any valid ones, then it will allow downconversions.  In effect
      this always uses an upconversion if there is one.
  13. 06 Dec, 2016 3 commits
  14. 05 Dec, 2016 2 commits
  15. 04 Dec, 2016 1 commit