| /external/skia/src/sksl/ast/ |
| SkSLASTCallSuffix.h | 22 , fArguments(std::move(arguments)) {}
27 for (size_t i = 0; i < fArguments.size(); ++i) {
30 result += fArguments[i]->description();
36 std::vector<std::unique_ptr<ASTExpression>> fArguments;
|
| /external/skqp/src/sksl/ast/ |
| SkSLASTCallSuffix.h | 22 , fArguments(std::move(arguments)) {}
27 for (size_t i = 0; i < fArguments.size(); ++i) {
30 result += fArguments[i]->description();
36 std::vector<std::unique_ptr<ASTExpression>> fArguments;
|
| /external/skia/src/sksl/ir/ |
| SkSLConstructor.h | 30 , fArguments(std::move(arguments)) {}
34 if (fArguments.size() == 1 && fArguments[0]->fKind == Expression::kIntLiteral_Kind) {
37 int64_t intValue = ((IntLiteral&) *fArguments[0]).fValue;
43 int64_t intValue = ((IntLiteral&) *fArguments[0]).fValue;
53 for (const auto& arg : fArguments) {
63 for (const auto& arg : fArguments) {
72 for (size_t i = 0; i < fArguments.size(); i++) {
74 result += fArguments[i]->description();
82 for (size_t i = 0; i < fArguments.size(); i++)
[all...] |
| SkSLFunctionCall.h | 24 , fArguments(std::move(arguments)) {}
27 for (const auto& arg : fArguments) {
37 for (const auto& arg : fArguments) {
47 for (size_t i = 0; i < fArguments.size(); i++) {
49 result += fArguments[i]->description();
57 std::vector<std::unique_ptr<Expression>> fArguments;
|
| SkSLAppendStage.h | 24 , fArguments(std::move(arguments)) {}
28 for (const auto& arg : fArguments) {
38 for (const auto& a : fArguments) {
53 std::vector<std::unique_ptr<Expression>> fArguments;
62 , fArguments(std::move(arguments)) {}
|
| SkSLVariableReference.cpp | 74 for (const auto& arg : c->fArguments) {
|
| /external/skqp/src/sksl/ir/ |
| SkSLConstructor.h | 30 , fArguments(std::move(arguments)) {}
34 if (fArguments.size() == 1 && fArguments[0]->fKind == Expression::kIntLiteral_Kind) {
38 int64_t intValue = ((IntLiteral&) *fArguments[0]).fValue;
45 int64_t intValue = ((IntLiteral&) *fArguments[0]).fValue;
55 for (const auto& arg : fArguments) {
65 for (const auto& arg : fArguments) {
74 for (size_t i = 0; i < fArguments.size(); i++) {
76 result += fArguments[i]->description();
84 for (size_t i = 0; i < fArguments.size(); i++)
[all...] |
| SkSLFunctionCall.h | 24 , fArguments(std::move(arguments)) {}
27 for (const auto& arg : fArguments) {
37 for (const auto& arg : fArguments) {
47 for (size_t i = 0; i < fArguments.size(); i++) {
49 result += fArguments[i]->description();
57 std::vector<std::unique_ptr<Expression>> fArguments;
|
| SkSLAppendStage.h | 24 , fArguments(std::move(arguments)) {}
28 for (const auto& arg : fArguments) {
38 for (const auto& a : fArguments) {
53 std::vector<std::unique_ptr<Expression>> fArguments;
62 , fArguments(std::move(arguments)) {}
|
| SkSLVariableReference.cpp | 74 for (const auto& arg : c->fArguments) {
|
| /external/skia/src/sksl/ |
| SkSLGLSLCodeGenerator.cpp | 488 SkASSERT(c.fArguments.size() == 1);
489 if (c.fArguments[0]->fType != *fContext.fInt_Type)
507 c.fArguments.size() == 2 &&
508 c.fArguments[1]->fKind == Expression::kPrefix_Kind) {
509 const PrefixExpression& p = (PrefixExpression&) *c.fArguments[1];
512 this->writeExpression(*c.fArguments[0], kSequence_Precedence);
538 SkASSERT(c.fArguments.size() == 1);
539 this->writeDeterminantHack(*c.fArguments[0]);
545 SkASSERT(c.fArguments.size() == 3);
547 this->writeExpression(*c.fArguments[0], kSequence_Precedence)
[all...] |
| SkSLSPIRVCodeGenerator.cpp | 680 if (c.fArguments.size() > 0) {
681 const Type& type = c.fArguments[0]->fType;
[all...] |
| SkSLMetalCodeGenerator.cpp | 175 this->writeExpression(*c.fArguments[0], kSequence_Precedence);
198 this->writeExpression(*c.fArguments[1], kSequence_Precedence);
211 if (c.fFunction.fBuiltin && "atan" == c.fFunction.fName && 2 == c.fArguments.size()) {
216 SkASSERT(c.fArguments.size() == 1);
217 this->writeInverseHack(*c.fArguments[0]);
247 for (size_t i = 0; i < c.fArguments.size(); ++i) {
248 const Expression& arg = *c.fArguments[i];
342 this->writeExpression(*c.fArguments[0], kSequence_Precedence);
344 this->writeExpression(*c.fArguments[0], kSequence_Precedence);
347 this->writeExpression(*c.fArguments[1], kSequence_Precedence)
[all...] |
| SkSLCPPCodeGenerator.cpp | 403 SkASSERT(c.fArguments.size() == 1 || c.fArguments.size() == 2);
404 SkASSERT("fragmentProcessor" == c.fArguments[0]->fType.name() ||
405 "fragmentProcessor?" == c.fArguments[0]->fType.name());
410 if (c.fArguments[0]->fKind != Expression::kVariableReference_Kind) {
411 fErrors.error(c.fArguments[0]->fOffset,
415 if (c.fArguments.size() > 1) {
417 SkASSERT("half4" == c.fArguments[1]->fType.name());
419 const Variable& child = ((const VariableReference&) *c.fArguments[0]).fVariable;
430 if (c.fArguments.size() > 1)
[all...] |
| SkSLPipelineStageCodeGenerator.cpp | 82 SkASSERT(c.fArguments.size() == 1);
83 SkASSERT(Expression::kVariableReference_Kind == c.fArguments[0]->fKind);
91 if (decl.fVar == &((VariableReference&) *c.fArguments[0]).fVariable) {
|
| SkSLJIT.cpp | 224 for (const auto& a : fc.fArguments) {
[all...] |
| SkSLInterpreter.cpp | 236 SkASSERT(a.fArguments.size() == 1);
237 StackIndex transpose = evaluate(*a.fArguments[0]).fInt;
242 SkASSERT(a.fArguments.size() == 1);
250 ((const FunctionReference&) *a.fArguments[0]).fFunctions[0]) {
|
| SkSLCFGGenerator.cpp | 206 for (auto& arg : c->fArguments) {
217 for (auto& arg : f->fArguments) {
279 for (auto& arg : c->fArguments) {
344 for (auto& arg : c->fArguments) {
353 for (auto& arg : c->fArguments) {
|
| /external/skqp/src/sksl/ |
| SkSLGLSLCodeGenerator.cpp | 492 SkASSERT(c.fArguments.size() == 1);
493 if (c.fArguments[0]->fType != *fContext.fInt_Type)
511 c.fArguments.size() == 2 &&
512 c.fArguments[1]->fKind == Expression::kPrefix_Kind) {
513 const PrefixExpression& p = (PrefixExpression&) *c.fArguments[1];
516 this->writeExpression(*c.fArguments[0], kSequence_Precedence);
534 SkASSERT(c.fArguments.size() == 1);
535 this->writeDeterminantHack(*c.fArguments[0]);
541 SkASSERT(c.fArguments.size() == 3);
543 this->writeExpression(*c.fArguments[0], kSequence_Precedence)
[all...] |
| SkSLSPIRVCodeGenerator.cpp | 674 if (c.fArguments.size() > 0) {
675 const Type& type = c.fArguments[0]->fType;
[all...] |
| SkSLMetalCodeGenerator.cpp | 173 this->writeExpression(*c.fArguments[0], kSequence_Precedence);
190 this->writeExpression(*c.fArguments[1], kSequence_Precedence);
203 if (c.fFunction.fBuiltin && "atan" == c.fFunction.fName && 2 == c.fArguments.size()) {
208 SkASSERT(c.fArguments.size() == 1);
209 this->writeInverseHack(*c.fArguments[0]);
238 for (size_t i = 0; i < c.fArguments.size(); ++i) {
239 const Expression& arg = *c.fArguments[i];
269 this->writeExpression(*c.fArguments[0], kSequence_Precedence);
271 this->writeExpression(*c.fArguments[0], kSequence_Precedence);
274 this->writeExpression(*c.fArguments[1], kSequence_Precedence)
[all...] |
| SkSLPipelineStageCodeGenerator.cpp | 81 SkASSERT(c.fArguments.size() == 1);
82 SkASSERT(Expression::kVariableReference_Kind == c.fArguments[0]->fKind);
90 if (decl.fVar == &((VariableReference&) *c.fArguments[0]).fVariable) {
|
| SkSLCPPCodeGenerator.cpp | 376 SkASSERT(c.fArguments.size() == 1 || c.fArguments.size() == 2);
377 SkASSERT("fragmentProcessor" == c.fArguments[0]->fType.name());
382 if (c.fArguments[0]->fKind != Expression::kVariableReference_Kind) {
383 fErrors.error(c.fArguments[0]->fOffset,
387 if (c.fArguments.size() > 1) {
389 SkASSERT("half4" == c.fArguments[1]->fType.name());
391 int index = getChildFPIndex((const VariableReference&) *c.fArguments[0]);
401 if (c.fArguments.size() > 1) {
402 SkASSERT(c.fArguments.size() == 2)
[all...] |
| SkSLJIT.cpp | 224 for (const auto& a : fc.fArguments) {
[all...] |
| SkSLInterpreter.cpp | 236 SkASSERT(a.fArguments.size() == 1);
237 StackIndex transpose = evaluate(*a.fArguments[0]).fInt;
242 SkASSERT(a.fArguments.size() == 1);
250 ((const FunctionReference&) *a.fArguments[0]).fFunctions[0]) {
|
