OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:TIntermNode
(Results
1 - 25
of
49
) sorted by null
1
2
/external/chromium_org/third_party/angle/src/compiler/
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;
localintermediate.h
33
TIntermTyped* addUnaryMath(TOperator op,
TIntermNode
* child, const TSourceLoc&, TSymbolTable&);
34
TIntermAggregate* growAggregate(
TIntermNode
* left,
TIntermNode
* right, const TSourceLoc&);
35
TIntermAggregate* makeAggregate(
TIntermNode
* node, const TSourceLoc&);
36
TIntermAggregate* setAggregateOperator(
TIntermNode
*, TOperator, const TSourceLoc&);
37
TIntermNode
* addSelection(TIntermTyped* cond, TIntermNodePair code, const TSourceLoc&);
42
bool parseConstTree(const TSourceLoc&,
TIntermNode
*, ConstantUnion*, TOperator, TSymbolTable&, TType, bool singleConstantParam = false);
43
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);
ShHandle.h
88
bool detectCallDepth(
TIntermNode
* root, TInfoSink& infoSink, bool limitCallStackDepth);
90
void rewriteCSSShader(
TIntermNode
* root);
93
bool validateLimitations(
TIntermNode
* root);
95
void collectVariables(
TIntermNode
* root);
97
void mapLongVariableNames(
TIntermNode
* root);
99
virtual void translate(
TIntermNode
* root) = 0;
104
bool enforceTimingRestrictions(
TIntermNode
* root, bool outputGraph);
106
bool enforceVertexShaderTimingRestrictions(
TIntermNode
* root);
111
bool limitExpressionComplexity(
TIntermNode
* root);
intermediate.h
12
//
TIntermNode
. Each is a node in a tree. There is no preset branching factor;
206
class
TIntermNode
{
209
TIntermNode
() {
215
virtual ~
TIntermNode
() { }
233
TIntermNode
*original,
TIntermNode
*replacement) = 0;
243
TIntermNode
* node1;
244
TIntermNode
* node2;
250
class TIntermTyped : public
TIntermNode
{
291
class TIntermLoop : public
TIntermNode
{
[
all
...]
SearchSymbol.h
22
void traverse(
TIntermNode
*node);
TranslatorGLSL.cpp
12
static void writeVersion(ShShaderType type,
TIntermNode
* root,
28
void TranslatorGLSL::translate(
TIntermNode
* root) {
DetectDiscontinuity.cpp
17
bool DetectLoopDiscontinuity::traverse(
TIntermNode
*node)
71
bool containsLoopDiscontinuity(
TIntermNode
*node)
77
bool DetectGradientOperation::traverse(
TIntermNode
*node)
134
bool containsGradientOperation(
TIntermNode
*node)
SearchSymbol.cpp
21
void SearchSymbol::traverse(
TIntermNode
*node)
TranslatorHLSL.cpp
17
void TranslatorHLSL::translate(
TIntermNode
*root)
TranslatorHLSL.h
21
virtual void translate(
TIntermNode
* root);
ForLoopUnroll.h
42
static void MarkForLoopsWithIntegerIndicesForUnrolling(
TIntermNode
* root);
UnfoldShortCircuit.h
24
void traverse(
TIntermNode
*node);
ValidateLimitations.h
46
bool validateOperation(TIntermOperator* node,
TIntermNode
* operand);
50
bool isConstExpr(
TIntermNode
* node);
51
bool isConstIndexExpr(
TIntermNode
* node);
NodeSearch.h
25
static bool search(
TIntermNode
*node)
QualifierAlive.cpp
33
bool QualifierWritten(
TIntermNode
* node, TQualifier qualifier)
Compiler.cpp
155
TIntermNode
* root = parseContext.treeRoot;
294
bool TCompiler::detectCallDepth(
TIntermNode
* root, TInfoSink& infoSink, bool limitCallStackDepth)
319
void TCompiler::rewriteCSSShader(
TIntermNode
* root)
325
bool TCompiler::validateLimitations(
TIntermNode
* root) {
331
bool TCompiler::enforceTimingRestrictions(
TIntermNode
* root, bool outputGraph)
357
bool TCompiler::limitExpressionComplexity(
TIntermNode
* root)
386
bool TCompiler::enforceVertexShaderTimingRestrictions(
TIntermNode
* root)
393
void TCompiler::collectVariables(
TIntermNode
* root)
405
void TCompiler::mapLongVariableNames(
TIntermNode
* root)
/external/chromium_org/third_party/angle/src/compiler/timing/
RestrictVertexShaderTiming.h
24
void enforceRestrictions(
TIntermNode
* root) { root->traverse(this); }
RestrictFragmentShaderTiming.h
29
void beginError(const
TIntermNode
* node);
/external/chromium_org/third_party/angle/src/third_party/compiler/
ArrayBoundsClamper.h
44
void MarkIndirectArrayBoundsForClamping(
TIntermNode
* root);
/external/chromium_org/third_party/angle/src/compiler/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())
Completed in 52 milliseconds
1
2