| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| scalar_analysis.h | 47 SENode* CreateNegation(SENode* operand);
51 SENode* CreateSubtraction(SENode* operand_1, SENode* operand_2);
56 SENode* CreateAddNode(SENode* operand_1, SENode* operand_2);
59 SENode* CreateMultiplyNode(SENode* operand_1, SENode* operand_2)
[all...] |
| scalar_analysis_simplification.cpp | 81 SENode* node_to_simplify)
87 SENode* Simplify();
95 void GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child,
103 bool AccumulatorsFromMultiply(SENode* multiply, bool negation);
111 SENode* SimplifyRecurrentAddExpression(SERecurrentNode* node);
116 SENode* SimplifyPolynomial();
129 SENode* FoldRecurrentAddExpressions(SENode*);
135 SENode* EliminateZeroCoefficientRecurrents(SENode* node)
[all...] |
| scalar_analysis_nodes.h | 39 // contains a vector of pointers to its children and each subclass of SENode
43 class SENode {
55 using ChildContainerType = std::vector<SENode*>;
57 explicit SENode(ScalarEvolutionAnalysis* parent_analysis)
62 virtual ~SENode() {}
64 virtual inline void AddChild(SENode* child) {
72 auto find_first_less_than = [child](const SENode* node) {
87 // Dump the SENode and its immediate children, if |recurse| is true then it
93 bool operator==(const SENode& other) const;
96 bool operator!=(const SENode& other) const
[all...] |
| loop_dependence.h | 200 DependenceLine(SENode* a, SENode* b, SENode* c, const Loop* loop)
208 SENode* GetA() const { return a_; }
209 SENode* GetB() const { return b_; }
210 SENode* GetC() const { return c_; }
213 SENode* a_;
214 SENode* b_;
215 SENode* c_;
220 DependenceDistance(SENode* distance, const Loop* loop
[all...] |
| scalar_analysis.cpp | 49 uint32_t SENode::NumberOfNodes = 0;
58 SENode* ScalarEvolutionAnalysis::CreateNegation(SENode* operand) {
62 if (operand->GetType() == SENode::Constant) {
65 std::unique_ptr<SENode> negation_node{new SENegative(this)};
70 SENode* ScalarEvolutionAnalysis::CreateConstant(int64_t integer) {
72 std::unique_ptr<SENode>(new SEConstantNode(this, integer)));
75 SENode* ScalarEvolutionAnalysis::CreateRecurrentExpression(
76 const Loop* loop, SENode* offset, SENode* coefficient)
[all...] |
| loop_dependence_helpers.cpp | 33 const std::pair<SENode*, SENode*>& subscript_pair) {
39 const std::pair<SENode*, SENode*>& subscript_pair) {
45 const std::pair<SENode*, SENode*>& subscript_pair) {
50 SENode* LoopDependenceAnalysis::GetLowerBound(const Loop* loop) {
82 SENode* LoopDependenceAnalysis::GetUpperBound(const Loop* loop) {
93 SENode* upper_bound = scalar_evolution_.SimplifyExpression(
103 SENode* upper_bound
[all...] |
| loop_dependence.cpp | 31 using SubscriptPair = std::pair<SENode*, SENode*>;
73 bool IsInCorrectFormForGCDTest(SENode* node) {
90 std::vector<SERecurrentNode*> GetAllTopLevelRecurrences(SENode* node) {
108 std::vector<SEConstantNode*> GetAllTopLevelConstants(SENode* node) {
277 SENode* source_node = scalar_evolution_.SimplifyExpression(
279 SENode* destination_node = scalar_evolution_.SimplifyExpression(
302 if (source_node->GetType() == SENode::CanNotCompute ||
303 destination_node->GetType() == SENode::CanNotCompute) {
359 SENode* source_node = scalar_evolution_.SimplifyExpression
[all...] |
| loop_fusion.cpp | 308 SENode* induction_node_0 = scalar_analysis->SimplifyExpression(
314 SENode* induction_step_0 =
320 SENode* induction_node_1 = scalar_analysis->SimplifyExpression(
326 SENode* induction_step_1 =
|
| loop_peeling.cpp | 840 if (lhs->GetType() == SENode::CanNotCompute) {
848 if (rhs->GetType() == SENode::CanNotCompute) {
[all...] |
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| scalar_analysis.h | 47 SENode* CreateNegation(SENode* operand);
51 SENode* CreateSubtraction(SENode* operand_1, SENode* operand_2);
56 SENode* CreateAddNode(SENode* operand_1, SENode* operand_2);
59 SENode* CreateMultiplyNode(SENode* operand_1, SENode* operand_2)
[all...] |
| scalar_analysis_simplification.cpp | 81 SENode* node_to_simplify)
87 SENode* Simplify();
95 void GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child,
103 bool AccumulatorsFromMultiply(SENode* multiply, bool negation);
111 SENode* SimplifyRecurrentAddExpression(SERecurrentNode* node);
116 SENode* SimplifyPolynomial();
129 SENode* FoldRecurrentAddExpressions(SENode*);
135 SENode* EliminateZeroCoefficientRecurrents(SENode* node)
[all...] |
| scalar_analysis_nodes.h | 39 // contains a vector of pointers to its children and each subclass of SENode
43 class SENode {
55 using ChildContainerType = std::vector<SENode*>;
57 explicit SENode(ScalarEvolutionAnalysis* parent_analysis)
62 virtual ~SENode() {}
64 virtual inline void AddChild(SENode* child) {
72 auto find_first_less_than = [child](const SENode* node) {
87 // Dump the SENode and its immediate children, if |recurse| is true then it
93 bool operator==(const SENode& other) const;
96 bool operator!=(const SENode& other) const
[all...] |
| loop_dependence.h | 200 DependenceLine(SENode* a, SENode* b, SENode* c, const Loop* loop)
208 SENode* GetA() const { return a_; }
209 SENode* GetB() const { return b_; }
210 SENode* GetC() const { return c_; }
213 SENode* a_;
214 SENode* b_;
215 SENode* c_;
220 DependenceDistance(SENode* distance, const Loop* loop
[all...] |
| scalar_analysis.cpp | 49 uint32_t SENode::NumberOfNodes = 0;
58 SENode* ScalarEvolutionAnalysis::CreateNegation(SENode* operand) {
62 if (operand->GetType() == SENode::Constant) {
65 std::unique_ptr<SENode> negation_node{new SENegative(this)};
70 SENode* ScalarEvolutionAnalysis::CreateConstant(int64_t integer) {
72 std::unique_ptr<SENode>(new SEConstantNode(this, integer)));
75 SENode* ScalarEvolutionAnalysis::CreateRecurrentExpression(
76 const Loop* loop, SENode* offset, SENode* coefficient)
[all...] |
| loop_dependence_helpers.cpp | 33 const std::pair<SENode*, SENode*>& subscript_pair) {
39 const std::pair<SENode*, SENode*>& subscript_pair) {
45 const std::pair<SENode*, SENode*>& subscript_pair) {
50 SENode* LoopDependenceAnalysis::GetLowerBound(const Loop* loop) {
82 SENode* LoopDependenceAnalysis::GetUpperBound(const Loop* loop) {
93 SENode* upper_bound = scalar_evolution_.SimplifyExpression(
103 SENode* upper_bound
[all...] |
| loop_dependence.cpp | 31 using SubscriptPair = std::pair<SENode*, SENode*>;
73 bool IsInCorrectFormForGCDTest(SENode* node) {
90 std::vector<SERecurrentNode*> GetAllTopLevelRecurrences(SENode* node) {
108 std::vector<SEConstantNode*> GetAllTopLevelConstants(SENode* node) {
277 SENode* source_node = scalar_evolution_.SimplifyExpression(
279 SENode* destination_node = scalar_evolution_.SimplifyExpression(
302 if (source_node->GetType() == SENode::CanNotCompute ||
303 destination_node->GetType() == SENode::CanNotCompute) {
359 SENode* source_node = scalar_evolution_.SimplifyExpression
[all...] |
| loop_fusion.cpp | 308 SENode* induction_node_0 = scalar_analysis->SimplifyExpression(
314 SENode* induction_step_0 =
320 SENode* induction_node_1 = scalar_analysis->SimplifyExpression(
326 SENode* induction_step_1 =
|
| loop_peeling.cpp | 840 if (lhs->GetType() == SENode::CanNotCompute) {
848 if (rhs->GetType() == SENode::CanNotCompute) {
[all...] |
| /external/deqp-deps/SPIRV-Tools/test/opt/ |
| scalar_analysis.cpp | 128 const SENode* node = analysis.AnalyzeInstruction(child);
133 EXPECT_EQ(node->GetType(), SENode::Add);
135 const SENode* child_1 = node->GetChild(0);
136 EXPECT_TRUE(child_1->GetType() == SENode::Constant ||
137 child_1->GetType() == SENode::RecurrentAddExpr);
139 const SENode* child_2 = node->GetChild(1);
140 EXPECT_TRUE(child_2->GetType() == SENode::Constant ||
141 child_2->GetType() == SENode::RecurrentAddExpr);
143 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node))
[all...] |
| /external/swiftshader/third_party/SPIRV-Tools/test/opt/ |
| scalar_analysis.cpp | 128 const SENode* node = analysis.AnalyzeInstruction(child);
133 EXPECT_EQ(node->GetType(), SENode::Add);
135 const SENode* child_1 = node->GetChild(0);
136 EXPECT_TRUE(child_1->GetType() == SENode::Constant ||
137 child_1->GetType() == SENode::RecurrentAddExpr);
139 const SENode* child_2 = node->GetChild(1);
140 EXPECT_TRUE(child_2->GetType() == SENode::Constant ||
141 child_2->GetType() == SENode::RecurrentAddExpr);
143 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node))
[all...] |
| /external/deqp-deps/SPIRV-Tools/test/opt/loop_optimizations/ |
| dependence_analysis_helpers.cpp | [all...] |
| /external/swiftshader/third_party/SPIRV-Tools/test/opt/loop_optimizations/ |
| dependence_analysis_helpers.cpp | [all...] |
