Home
last modified time | relevance | path

Searched refs:TParentNodeSet (Results 1 – 2 of 2) sorted by relevance

/external/chromium_org/third_party/angle/src/compiler/depgraph/
DDependencyGraphBuilder.h28 typedef std::set<TGraphParentNode*> TParentNodeSet; typedef
43 TParentNodeSet* getTopSet() const in getTopSet()
46 TParentNodeSet* topSet = nodeSets.top(); in getTopSet()
50 void pushSet() { nodeSets.push(new TParentNodeSet()); } in pushSet()
64 TParentNodeSet* oldTopSet = nodeSets.top(); in popSetIntoNext()
68 TParentNodeSet* newTopSet = nodeSets.top(); in popSetIntoNext()
94 typedef std::stack<TParentNodeSet*> TParentNodeSetStack;
164 void connectMultipleNodesToSingleNode(TParentNodeSet* nodes, TGraphNode* node) const;
DDependencyGraphBuilder.cpp53 if (TParentNodeSet* argumentNodes = mNodeSets.getTopSet()) { in visitFunctionCall()
134 if (TParentNodeSet* assignmentNodes = mNodeSets.getTopSet()) in visitAssignment()
153 if (TParentNodeSet* leftNodes = mNodeSets.getTopSet()) { in visitLogicalOp()
182 if (TParentNodeSet* conditionNodes = mNodeSets.getTopSet()) { in visitSelection()
203 if (TParentNodeSet* conditionNodes = mNodeSets.getTopSet()) { in visitLoop()
219 void TDependencyGraphBuilder::connectMultipleNodesToSingleNode(TParentNodeSet* nodes, in connectMultipleNodesToSingleNode()
222 for (TParentNodeSet::const_iterator iter = nodes->begin(); iter != nodes->end(); ++iter) in connectMultipleNodesToSingleNode()