Lines Matching refs:mOut
35 : TIntermTraverser(true, false, false), mOut(out), mIndentDepth(0) in TOutputTraverser()
60 TInfoSinkBase &mOut; member in sh::__anonebd5c43a0111::TOutputTraverser
88 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitSymbol()
92 mOut << "''"; in visitSymbol()
96 mOut << "'" << node->getName() << "' "; in visitSymbol()
98 mOut << "(symbol id " << node->uniqueId().get() << ") "; in visitSymbol()
99 mOut << "(" << node->getType() << ")"; in visitSymbol()
100 mOut << "\n"; in visitSymbol()
105 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitSwizzle()
106 mOut << "vector swizzle ("; in visitSwizzle()
107 node->writeOffsetsAsXYZW(&mOut); in visitSwizzle()
108 mOut << ")"; in visitSwizzle()
110 mOut << " (" << node->getType() << ")"; in visitSwizzle()
111 mOut << "\n"; in visitSwizzle()
117 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitBinary()
122 mOut << "comma"; in visitBinary()
125 mOut << "move second child to first child"; in visitBinary()
128 mOut << "initialize first child with second child"; in visitBinary()
131 mOut << "add second child into first child"; in visitBinary()
134 mOut << "subtract second child into first child"; in visitBinary()
137 mOut << "multiply second child into first child"; in visitBinary()
140 mOut << "matrix mult second child into first child"; in visitBinary()
143 mOut << "vector scale second child into first child"; in visitBinary()
146 mOut << "matrix scale second child into first child"; in visitBinary()
149 mOut << "matrix mult second child into first child"; in visitBinary()
152 mOut << "divide second child into first child"; in visitBinary()
155 mOut << "modulo second child into first child"; in visitBinary()
158 mOut << "bit-wise shift first child left by second child"; in visitBinary()
161 mOut << "bit-wise shift first child right by second child"; in visitBinary()
164 mOut << "bit-wise and second child into first child"; in visitBinary()
167 mOut << "bit-wise xor second child into first child"; in visitBinary()
170 mOut << "bit-wise or second child into first child"; in visitBinary()
174 mOut << "direct index"; in visitBinary()
177 mOut << "indirect index"; in visitBinary()
180 mOut << "direct index for structure"; in visitBinary()
183 mOut << "direct index for interface block"; in visitBinary()
187 mOut << "add"; in visitBinary()
190 mOut << "subtract"; in visitBinary()
193 mOut << "component-wise multiply"; in visitBinary()
196 mOut << "divide"; in visitBinary()
199 mOut << "modulo"; in visitBinary()
202 mOut << "bit-wise shift left"; in visitBinary()
205 mOut << "bit-wise shift right"; in visitBinary()
208 mOut << "bit-wise and"; in visitBinary()
211 mOut << "bit-wise xor"; in visitBinary()
214 mOut << "bit-wise or"; in visitBinary()
218 mOut << "Compare Equal"; in visitBinary()
221 mOut << "Compare Not Equal"; in visitBinary()
224 mOut << "Compare Less Than"; in visitBinary()
227 mOut << "Compare Greater Than"; in visitBinary()
230 mOut << "Compare Less Than or Equal"; in visitBinary()
233 mOut << "Compare Greater Than or Equal"; in visitBinary()
237 mOut << "vector-scale"; in visitBinary()
240 mOut << "vector-times-matrix"; in visitBinary()
243 mOut << "matrix-times-vector"; in visitBinary()
246 mOut << "matrix-scale"; in visitBinary()
249 mOut << "matrix-multiply"; in visitBinary()
253 mOut << "logical-or"; in visitBinary()
256 mOut << "logical-xor"; in visitBinary()
259 mOut << "logical-and"; in visitBinary()
262 mOut << "<unknown op>"; in visitBinary()
265 mOut << " (" << node->getType() << ")"; in visitBinary()
267 mOut << "\n"; in visitBinary()
279 OutputTreeText(mOut, intermConstantUnion, getCurrentIndentDepth() + 1); in visitBinary()
291 mOut << constantUnion->getIConst() << " (field '" << field->name() << "')"; in visitBinary()
293 mOut << "\n"; in visitBinary()
303 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitUnary()
312 mOut << "Negate value"; in visitUnary()
315 mOut << "Positive sign"; in visitUnary()
318 mOut << "negation"; in visitUnary()
321 mOut << "bit-wise not"; in visitUnary()
325 mOut << "Post-Increment"; in visitUnary()
328 mOut << "Post-Decrement"; in visitUnary()
331 mOut << "Pre-Increment"; in visitUnary()
334 mOut << "Pre-Decrement"; in visitUnary()
338 mOut << "Array length"; in visitUnary()
342 mOut << "component-wise not"; in visitUnary()
348 OutputFunction(mOut, "Call a built-in function", node->getFunction()); in visitUnary()
352 mOut << GetOperatorString(node->getOp()); in visitUnary()
357 mOut << " (" << node->getType() << ")"; in visitUnary()
359 mOut << "\n"; in visitUnary()
366 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitFunctionDefinition()
367 mOut << "Function Definition:\n"; in visitFunctionDefinition()
374 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitGlobalQualifierDeclaration()
377 mOut << "Precise Declaration:\n"; in visitGlobalQualifierDeclaration()
381 mOut << "Invariant Declaration:\n"; in visitGlobalQualifierDeclaration()
388 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitFunctionPrototype()
389 OutputFunction(mOut, "Function Prototype", node->getFunction()); in visitFunctionPrototype()
390 mOut << " (" << node->getType() << ")"; in visitFunctionPrototype()
391 mOut << "\n"; in visitFunctionPrototype()
396 OutputTreeText(mOut, node, getCurrentIndentDepth() + 1); in visitFunctionPrototype()
397 mOut << "parameter: " << param->name() << " (" << param->getType() << ")\n"; in visitFunctionPrototype()
403 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitAggregate()
409 mOut.prefix(SH_ERROR); in visitAggregate()
410 mOut << "node is still EOpNull!\n"; in visitAggregate()
419 OutputFunction(mOut, "Call a user-defined function", node->getFunction()); in visitAggregate()
422 OutputFunction(mOut, "Call an internal function with raw implementation", in visitAggregate()
428 mOut << "Construct"; in visitAggregate()
432 mOut << "component-wise equal"; in visitAggregate()
435 mOut << "component-wise not equal"; in visitAggregate()
438 mOut << "component-wise less than"; in visitAggregate()
441 mOut << "component-wise greater than"; in visitAggregate()
444 mOut << "component-wise less than or equal"; in visitAggregate()
447 mOut << "component-wise greater than or equal"; in visitAggregate()
451 mOut << "dot product"; in visitAggregate()
454 mOut << "cross product"; in visitAggregate()
457 mOut << "component-wise multiply"; in visitAggregate()
463 OutputFunction(mOut, "Call a built-in function", node->getFunction()); in visitAggregate()
467 mOut << GetOperatorString(node->getOp()); in visitAggregate()
472 mOut << " (" << node->getType() << ")"; in visitAggregate()
474 mOut << "\n"; in visitAggregate()
481 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitBlock()
482 mOut << "Code block\n"; in visitBlock()
489 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitDeclaration()
490 mOut << "Declaration\n"; in visitDeclaration()
497 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitTernary()
499 mOut << "Ternary selection"; in visitTernary()
500 mOut << " (" << node->getType() << ")\n"; in visitTernary()
504 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitTernary()
505 mOut << "Condition\n"; in visitTernary()
508 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitTernary()
511 mOut << "true case\n"; in visitTernary()
516 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitTernary()
517 mOut << "false case\n"; in visitTernary()
528 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitIfElse()
530 mOut << "If test\n"; in visitIfElse()
534 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitIfElse()
535 mOut << "Condition\n"; in visitIfElse()
538 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitIfElse()
541 mOut << "true case\n"; in visitIfElse()
546 mOut << "true case is null\n"; in visitIfElse()
551 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitIfElse()
552 mOut << "false case\n"; in visitIfElse()
563 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitSwitch()
565 mOut << "Switch\n"; in visitSwitch()
572 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitCase()
576 mOut << "Default\n"; in visitCase()
580 mOut << "Case\n"; in visitCase()
592 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitConstantUnion()
597 mOut << "true"; in visitConstantUnion()
599 mOut << "false"; in visitConstantUnion()
601 mOut << " (" in visitConstantUnion()
604 mOut << "\n"; in visitConstantUnion()
607 mOut << node->getConstantValue()[i].getFConst(); in visitConstantUnion()
608 mOut << " (const float)\n"; in visitConstantUnion()
611 mOut << node->getConstantValue()[i].getIConst(); in visitConstantUnion()
612 mOut << " (const int)\n"; in visitConstantUnion()
615 mOut << node->getConstantValue()[i].getUConst(); in visitConstantUnion()
616 mOut << " (const uint)\n"; in visitConstantUnion()
619 mOut << getYuvCscStandardEXTString( in visitConstantUnion()
621 mOut << " (const yuvCscStandardEXT)\n"; in visitConstantUnion()
624 mOut.prefix(SH_ERROR); in visitConstantUnion()
625 mOut << "Unknown constant\n"; in visitConstantUnion()
633 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitLoop()
635 mOut << "Loop with condition "; in visitLoop()
637 mOut << "not "; in visitLoop()
638 mOut << "tested first\n"; in visitLoop()
642 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitLoop()
645 mOut << "Loop Condition\n"; in visitLoop()
650 mOut << "No loop condition\n"; in visitLoop()
653 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitLoop()
656 mOut << "Loop Body\n"; in visitLoop()
661 mOut << "No loop body\n"; in visitLoop()
666 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitLoop()
667 mOut << "Loop Terminal Expression\n"; in visitLoop()
678 OutputTreeText(mOut, node, getCurrentIndentDepth()); in visitBranch()
683 mOut << "Branch: Kill"; in visitBranch()
686 mOut << "Branch: Break"; in visitBranch()
689 mOut << "Branch: Continue"; in visitBranch()
692 mOut << "Branch: Return"; in visitBranch()
695 mOut << "Branch: Unknown Branch"; in visitBranch()
701 mOut << " with expression\n"; in visitBranch()
708 mOut << "\n"; in visitBranch()