Searched refs:fArguments (Results 1 – 19 of 19) sorted by relevance
30 , fArguments(std::move(arguments)) {} in Constructor()34 if (fArguments.size() == 1 && fArguments[0]->fKind == Expression::kIntLiteral_Kind) { in constantPropagate()38 int64_t intValue = ((IntLiteral&) *fArguments[0]).fValue; in constantPropagate()45 int64_t intValue = ((IntLiteral&) *fArguments[0]).fValue; in constantPropagate()55 for (const auto& arg : fArguments) { in hasSideEffects()65 for (const auto& arg : fArguments) { in clone()74 for (size_t i = 0; i < fArguments.size(); i++) { in description()76 result += fArguments[i]->description(); in description()84 for (size_t i = 0; i < fArguments.size(); i++) { in isConstant()85 if (!fArguments[i]->isConstant()) { in isConstant()[all …]
24 , fArguments(std::move(arguments)) {} in FunctionCall()27 for (const auto& arg : fArguments) { in hasSideEffects()37 for (const auto& arg : fArguments) { in clone()47 for (size_t i = 0; i < fArguments.size(); i++) { in description()49 result += fArguments[i]->description(); in description()57 std::vector<std::unique_ptr<Expression>> fArguments; member
24 , fArguments(std::move(arguments)) {} in AppendStage()28 for (const auto& arg : fArguments) { in clone()38 for (const auto& a : fArguments) { in description()53 std::vector<std::unique_ptr<Expression>> fArguments; member62 , fArguments(std::move(arguments)) {} in AppendStage()
74 for (const auto& arg : c->fArguments) { in copy_constant()
492 SkASSERT(c.fArguments.size() == 1); in writeFunctionCall()493 if (c.fArguments[0]->fType != *fContext.fInt_Type) in writeFunctionCall()511 c.fArguments.size() == 2 && in writeFunctionCall()512 c.fArguments[1]->fKind == Expression::kPrefix_Kind) { in writeFunctionCall()513 const PrefixExpression& p = (PrefixExpression&) *c.fArguments[1]; in writeFunctionCall()516 this->writeExpression(*c.fArguments[0], kSequence_Precedence); in writeFunctionCall()534 SkASSERT(c.fArguments.size() == 1); in writeFunctionCall()535 this->writeDeterminantHack(*c.fArguments[0]); in writeFunctionCall()541 SkASSERT(c.fArguments.size() == 3); in writeFunctionCall()543 this->writeExpression(*c.fArguments[0], kSequence_Precedence); in writeFunctionCall()[all …]
674 if (c.fArguments.size() > 0) { in writeIntrinsicCall()675 const Type& type = c.fArguments[0]->fType; in writeIntrinsicCall()694 for (size_t i = 0; i < c.fArguments.size(); i++) { in writeIntrinsicCall()696 arguments.push_back(this->getLValue(*c.fArguments[i], out)->getPointer()); in writeIntrinsicCall()698 arguments.push_back(this->writeExpression(*c.fArguments[i], out)); in writeIntrinsicCall()714 for (size_t i = 0; i < c.fArguments.size(); i++) { in writeIntrinsicCall()716 arguments.push_back(this->getLValue(*c.fArguments[i], out)->getPointer()); in writeIntrinsicCall()718 arguments.push_back(this->writeExpression(*c.fArguments[i], out)); in writeIntrinsicCall()802 for (size_t i = 0; i < c.fArguments.size(); i++) { in writeSpecialIntrinsic()803 arguments.push_back(this->writeExpression(*c.fArguments[i], out)); in writeSpecialIntrinsic()[all …]
173 this->writeExpression(*c.fArguments[0], kSequence_Precedence); in writeIntrinsicCall()190 this->writeExpression(*c.fArguments[1], kSequence_Precedence); in writeIntrinsicCall()203 if (c.fFunction.fBuiltin && "atan" == c.fFunction.fName && 2 == c.fArguments.size()) { in writeFunctionCall()208 SkASSERT(c.fArguments.size() == 1); in writeFunctionCall()209 this->writeInverseHack(*c.fArguments[0]); in writeFunctionCall()238 for (size_t i = 0; i < c.fArguments.size(); ++i) { in writeFunctionCall()239 const Expression& arg = *c.fArguments[i]; in writeFunctionCall()269 this->writeExpression(*c.fArguments[0], kSequence_Precedence); in writeSpecialIntrinsic()271 this->writeExpression(*c.fArguments[0], kSequence_Precedence); in writeSpecialIntrinsic()274 this->writeExpression(*c.fArguments[1], kSequence_Precedence); in writeSpecialIntrinsic()[all …]
376 SkASSERT(c.fArguments.size() == 1 || c.fArguments.size() == 2); in writeFunctionCall()377 SkASSERT("fragmentProcessor" == c.fArguments[0]->fType.name()); in writeFunctionCall()382 if (c.fArguments[0]->fKind != Expression::kVariableReference_Kind) { in writeFunctionCall()383 fErrors.error(c.fArguments[0]->fOffset, in writeFunctionCall()387 if (c.fArguments.size() > 1) { in writeFunctionCall()389 SkASSERT("half4" == c.fArguments[1]->fType.name()); in writeFunctionCall()391 int index = getChildFPIndex((const VariableReference&) *c.fArguments[0]); in writeFunctionCall()401 if (c.fArguments.size() > 1) { in writeFunctionCall()402 SkASSERT(c.fArguments.size() == 2); in writeFunctionCall()406 addExtraEmitCodeLine(convertSKSLExpressionToCPP(*c.fArguments[1], inputName)); in writeFunctionCall()[all …]
224 for (const auto& a : fc.fArguments) { in compileFunctionCall()838 SkASSERT(a.fArguments.size() >= 1); in appendStage()839 SkASSERT(a.fArguments[0]->fType == *fCompiler.context().fSkRasterPipeline_Type); in appendStage()840 LLVMValueRef pipeline = this->compileExpression(builder, *a.fArguments[0]); in appendStage()844 SkASSERT(a.fArguments.size() == 2); in appendStage()845 SkASSERT(a.fArguments[1]->fKind == Expression::kFunctionReference_Kind); in appendStage()847 *((FunctionReference&) *a.fArguments[1]).fFunctions[0]; in appendStage()869 if (a.fArguments.size() == 2) { in appendStage()870 ctx = this->compileExpression(builder, *a.fArguments[1]); in appendStage()873 SkASSERT(a.fArguments.size() == 1); in appendStage()[all …]
81 SkASSERT(c.fArguments.size() == 1); in writeFunctionCall()82 SkASSERT(Expression::kVariableReference_Kind == c.fArguments[0]->fKind); in writeFunctionCall()90 if (decl.fVar == &((VariableReference&) *c.fArguments[0]).fVariable) { in writeFunctionCall()
236 SkASSERT(a.fArguments.size() == 1); in appendStage()237 StackIndex transpose = evaluate(*a.fArguments[0]).fInt; in appendStage()242 SkASSERT(a.fArguments.size() == 1); in appendStage()250 ((const FunctionReference&) *a.fArguments[0]).fFunctions[0]) { in appendStage()
206 for (auto& arg : c->fArguments) { in tryRemoveExpression()217 for (auto& arg : f->fArguments) { in tryRemoveExpression()279 for (auto& arg : c->fArguments) { in tryInsertExpression()344 for (auto& arg : c->fArguments) { in addExpression()353 for (auto& arg : c->fArguments) { in addExpression()
330 c.fArguments[i].get(), in addDefinitions()
2128 auto rawArguments = &((ASTCallSuffix&) *expression.fSuffix).fArguments; in convertSuffixExpression()
120 , fArguments(std::move(arguments)) {} in MultiArgumentConstructor()123 return fArguments; in arguments()127 return fArguments; in arguments()140 return {&fArguments.front(), fArguments.size()}; in argumentSpan()144 return {&fArguments.front(), fArguments.size()}; in argumentSpan()148 ExpressionArray fArguments;
28 , fArguments(std::move(arguments)) {} in FunctionCall()49 return fArguments; in arguments()53 return fArguments; in arguments()64 ExpressionArray fArguments; variable
28 , fArguments(std::move(arguments)) {} in ExternalFunctionCall()31 return fArguments; in arguments()35 return fArguments; in arguments()78 ExpressionArray fArguments; variable
22 , fArguments(std::move(arguments)) {} in ASTCallSuffix()27 for (size_t i = 0; i < fArguments.size(); ++i) { in description()30 result += fArguments[i]->description(); in description()36 std::vector<std::unique_ptr<ASTExpression>> fArguments; member
META-INF/ META-INF/MANIFEST.MF META-INF/services/ org/ ...