mirror of
https://github.com/KhronosGroup/glslang
synced 2024-11-09 20:10:06 +00:00
Non-functional: Very minor clean up.
This commit is contained in:
parent
acb9076a27
commit
64285c9e69
@ -2,5 +2,5 @@
|
||||
// For the version, it uses the latest git tag followed by the number of commits.
|
||||
// For the date, it uses the current date (when then script is run).
|
||||
|
||||
#define GLSLANG_REVISION "Overload400-PrecQual.1739"
|
||||
#define GLSLANG_REVISION "Overload400-PrecQual.1742"
|
||||
#define GLSLANG_DATE "05-Jan-2017"
|
||||
|
@ -2256,8 +2256,8 @@ bool TIntermediate::promoteAggregate(TIntermAggregate& node)
|
||||
case EOpDot:
|
||||
case EOpDst:
|
||||
case EOpFaceForward:
|
||||
// case EOpFindMSB: TODO: ??
|
||||
// case EOpFindLSB: TODO: ??
|
||||
// case EOpFindMSB: TODO:
|
||||
// case EOpFindLSB: TODO:
|
||||
case EOpFma:
|
||||
case EOpMod:
|
||||
case EOpFrexp:
|
||||
@ -2267,11 +2267,11 @@ bool TIntermediate::promoteAggregate(TIntermAggregate& node)
|
||||
case EOpMax:
|
||||
case EOpMin:
|
||||
case EOpModf:
|
||||
// case EOpGenMul: TODO: ??
|
||||
// case EOpGenMul: TODO:
|
||||
case EOpPow:
|
||||
case EOpReflect:
|
||||
case EOpRefract:
|
||||
// case EOpSinCos: TODO: ??
|
||||
// case EOpSinCos: TODO:
|
||||
case EOpSmoothStep:
|
||||
case EOpStep:
|
||||
break;
|
||||
|
@ -391,7 +391,7 @@ TIntermTyped* HlslParseContext::handleLvalue(const TSourceLoc& loc, const char*
|
||||
// OpSequence
|
||||
// coordtmp = load's param1
|
||||
// rhsTmp = OpImageLoad(object, coordTmp)
|
||||
// rhsTmp op = rhs
|
||||
// rhsTmp op= rhs
|
||||
// OpImageStore(object, coordTmp, rhsTmp)
|
||||
// rhsTmp
|
||||
//
|
||||
@ -1073,7 +1073,7 @@ void HlslParseContext::flatten(const TSourceLoc& loc, const TVariable& variable)
|
||||
// location in this linear sequence.
|
||||
//
|
||||
// If the tree was N-ary, that can be directly calculated. However, we are dealing with
|
||||
// arbitrary numbers - peraps a struct of 7 members containing an array of 3. Thus, we must
|
||||
// arbitrary numbers - perhaps a struct of 7 members containing an array of 3. Thus, we must
|
||||
// build a data structure to allow the sequence of bracket and dot operators on arrays and
|
||||
// structs to arrive at the proper member.
|
||||
//
|
||||
@ -5528,9 +5528,8 @@ TIntermTyped* HlslParseContext::convertInitializerList(const TSourceLoc& loc, co
|
||||
emulatedConstructorArguments = initList->getSequence()[0];
|
||||
else
|
||||
emulatedConstructorArguments = initList;
|
||||
TIntermTyped* constructor = addConstructor(loc, emulatedConstructorArguments, type);
|
||||
|
||||
return constructor;
|
||||
return addConstructor(loc, emulatedConstructorArguments, type);
|
||||
}
|
||||
|
||||
// Lengthen list to be long enough to cover any gap from the current list size
|
||||
|
Loading…
Reference in New Issue
Block a user