/external/chromium_org/third_party/angle/src/compiler/translator/ |
RemoveTree.h | 7 void RemoveAllTreeNodes(TIntermNode*);
|
QualifierAlive.h | 7 bool QualifierWritten(TIntermNode* root, TQualifier);
|
UnfoldShortCircuitAST.h | 32 NodeUpdateEntry(TIntermNode *_parent, 33 TIntermNode *_original, 34 TIntermNode *_replacement) 39 TIntermNode *parent; 40 TIntermNode *original; 41 TIntermNode *replacement;
|
RemoveTree.cpp | 13 void RemoveAllTreeNodes(TIntermNode* root) 15 std::queue<TIntermNode*> nodeQueue; 21 TIntermNode *node = nodeQueue.front();
|
localintermediate.h | 31 TIntermTyped* addUnaryMath(TOperator op, TIntermNode* child, const TSourceLoc&); 32 TIntermAggregate* growAggregate(TIntermNode* left, TIntermNode* right, const TSourceLoc&); 33 TIntermAggregate* makeAggregate(TIntermNode* node, const TSourceLoc&); 34 TIntermAggregate* setAggregateOperator(TIntermNode*, TOperator, const TSourceLoc&); 35 TIntermNode* addSelection(TIntermTyped* cond, TIntermNodePair code, const TSourceLoc&); 40 bool parseConstTree(const TSourceLoc&, TIntermNode*, ConstantUnion*, TOperator, TType, bool singleConstantParam = false); 41 TIntermNode* addLoop(TLoopType, TIntermNode*, TIntermTyped*, TIntermTyped*, TIntermNode*, const TSourceLoc&) [all...] |
DetectDiscontinuity.h | 22 bool traverse(TIntermNode *node); 33 bool containsLoopDiscontinuity(TIntermNode *node); 39 bool traverse(TIntermNode *node); 48 bool containsGradientOperation(TIntermNode *node);
|
TranslatorESSL.h | 17 virtual void translate(TIntermNode* root);
|
TranslatorGLSL.h | 17 virtual void translate(TIntermNode* root);
|
RewriteElseBlocks.h | 30 TIntermNode *rewriteSelection(TIntermSelection *selection); 33 void RewriteElseBlocks(TIntermNode *node);
|
SearchSymbol.h | 22 void traverse(TIntermNode *node);
|
ShHandle.h | 89 bool detectCallDepth(TIntermNode* root, TInfoSink& infoSink, bool limitCallStackDepth); 91 bool validateOutputs(TIntermNode* root); 93 void rewriteCSSShader(TIntermNode* root); 96 bool validateLimitations(TIntermNode* root); 98 void collectVariables(TIntermNode* root); 100 virtual void translate(TIntermNode* root) = 0; 108 void initializeVaryingsWithoutStaticUse(TIntermNode* root); 113 void initializeGLPosition(TIntermNode* root); 115 bool enforceTimingRestrictions(TIntermNode* root, bool outputGraph); 117 bool enforceVertexShaderTimingRestrictions(TIntermNode* root) [all...] |
intermediate.h | 12 // TIntermNode. Each is a node in a tree. There is no preset branching factor; 219 class TIntermNode { 222 TIntermNode() { 228 virtual ~TIntermNode() { } 247 TIntermNode *original, TIntermNode *replacement) = 0; 251 virtual void enqueueChildren(std::queue<TIntermNode*> *nodeQueue) const = 0; 261 TIntermNode* node1; 262 TIntermNode* node2; 268 class TIntermTyped : public TIntermNode { [all...] |
ValidateLimitations.h | 42 bool validateOperation(TIntermOperator *node, TIntermNode *operand); 46 bool isConstExpr(TIntermNode *node); 47 bool isConstIndexExpr(TIntermNode *node);
|
DetectDiscontinuity.cpp | 17 bool DetectLoopDiscontinuity::traverse(TIntermNode *node) 71 bool containsLoopDiscontinuity(TIntermNode *node) 77 bool DetectGradientOperation::traverse(TIntermNode *node) 134 bool containsGradientOperation(TIntermNode *node)
|
FlagStd140Structs.h | 33 std::vector<TIntermTyped *> FlagStd140ValueStructs(TIntermNode *node);
|
SearchSymbol.cpp | 21 void SearchSymbol::traverse(TIntermNode *node)
|
UnfoldShortCircuit.h | 24 void traverse(TIntermNode *node);
|
NodeSearch.h | 27 static bool search(TIntermNode *node)
|
QualifierAlive.cpp | 33 bool QualifierWritten(TIntermNode* node, TQualifier qualifier)
|
TranslatorHLSL.cpp | 17 void TranslatorHLSL::translate(TIntermNode *root)
|
TranslatorGLSL.cpp | 12 static void writeVersion(ShShaderType type, TIntermNode* root, 28 void TranslatorGLSL::translate(TIntermNode* root) {
|
/external/chromium_org/third_party/angle/src/compiler/translator/timing/ |
RestrictVertexShaderTiming.h | 22 void enforceRestrictions(TIntermNode* root) { root->traverse(this); }
|
RestrictFragmentShaderTiming.h | 27 void beginError(const TIntermNode* node);
|
/external/chromium_org/third_party/angle/src/third_party/compiler/ |
ArrayBoundsClamper.h | 42 void MarkIndirectArrayBoundsForClamping(TIntermNode* root);
|
/external/chromium_org/third_party/angle/src/compiler/translator/depgraph/ |
DependencyGraphBuilder.cpp | 9 void TDependencyGraphBuilder::build(TIntermNode* node, TDependencyGraph* graph) 50 TIntermNode* intermArgument = *iter; 74 TIntermNode* intermChild = *iter; 178 if (TIntermNode* intermCondition = intermSelection->getCondition()) { 188 if (TIntermNode* intermTrueBlock = intermSelection->getTrueBlock()) 191 if (TIntermNode* intermFalseBlock = intermSelection->getFalseBlock()) 209 if (TIntermNode* intermBody = intermLoop->getBody())
|