| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| scalar_analysis_simplification.cpp | 105 SERecurrentNode* UpdateCoefficient(SERecurrentNode* recurrent,
111 SENode* SimplifyRecurrentAddExpression(SERecurrentNode* node);
207 SERecurrentNode* recurrent_expr = nullptr;
287 SERecurrentNode* SENodeSimplifyImpl::UpdateCoefficient(
288 SERecurrentNode* recurrent, int64_t coefficient_update) const {
289 std::unique_ptr<SERecurrentNode> new_recurrent_node{new SERecurrentNode(
378 std::map<const Loop*, std::vector<std::pair<SERecurrentNode*, bool>>>
394 SERecurrentNode* rec = child->AsSERecurrentNode()
[all...] |
| scalar_analysis_nodes.h | 31 class SERecurrentNode;
117 std::vector<SERecurrentNode*> CollectRecurrentNodes() {
118 std::vector<SERecurrentNode*> recurrent_nodes{};
178 DeclareCastMethod(SERecurrentNode);
239 class SERecurrentNode : public SENode {
241 SERecurrentNode(ScalarEvolutionAnalysis* parent_analysis, const Loop* loop)
265 SERecurrentNode* AsSERecurrentNode() override { return this; }
266 const SERecurrentNode* AsSERecurrentNode() const override { return this; }
|
| loop_peeling.h | 302 SExpression GetValueAtFirstIteration(SERecurrentNode* rec) const;
304 SExpression GetValueAtIteration(SERecurrentNode* rec,
307 SExpression GetValueAtLastIteration(SERecurrentNode* rec) const;
314 SERecurrentNode* rhs) const;
|
| loop_dependence_helpers.cpp | 202 std::vector<SERecurrentNode*> source_nodes =
204 std::vector<SERecurrentNode*> destination_nodes =
320 const std::vector<SERecurrentNode*>& recurrent_nodes) {
338 std::vector<SERecurrentNode*> recurrent_nodes = node->CollectRecurrentNodes();
354 std::vector<SERecurrentNode*> source_nodes = source->CollectRecurrentNodes();
355 std::vector<SERecurrentNode*> destination_nodes =
397 SERecurrentNode* induction) {
429 std::vector<SERecurrentNode*> recurrent_nodes =
431 for (SERecurrentNode* recurrent_node : recurrent_nodes) {
439 std::vector<SERecurrentNode*> recurrent_nodes
[all...] |
| scalar_analysis.cpp | 90 std::unique_ptr<SERecurrentNode> phi_node{
91 new SERecurrentNode(this, loop_to_use)};
285 std::unique_ptr<SERecurrentNode> phi_node{
286 new SERecurrentNode(this, loop_to_use)};
379 if (const SERecurrentNode* rec = itr->AsSERecurrentNode()) {
401 SERecurrentNode* rec = itr->AsSERecurrentNode();
438 SERecurrentNode* recurrent = node->AsSERecurrentNode();
468 SERecurrentNode* ScalarEvolutionAnalysis::GetRecurrentTerm(SENode* node,
471 SERecurrentNode* rec = itr->AsSERecurrentNode();
503 const SERecurrentNode* this_as_recurrent = AsSERecurrentNode()
[all...] |
| loop_dependence.cpp | 71 // and contains only the following types of nodes: SERecurrentNode, SEAddNode
88 // If |node| is an SERecurrentNode then returns |node| or if |node| is an
89 // SEAddNode returns a vector of SERecurrentNode that are its children.
90 std::vector<SERecurrentNode*> GetAllTopLevelRecurrences(SENode* node) {
91 auto nodes = std::vector<SERecurrentNode*>{};
125 const std::vector<SERecurrentNode*>& nodes) {
137 int64_t CalculateConstantTerm(const std::vector<SERecurrentNode*>& recurrences,
153 const std::vector<SERecurrentNode*>& recurrences, int64_t running_gcd) {
154 for (SERecurrentNode* recurrence : recurrences) {
463 std::vector<SERecurrentNode*> source_recurrent_nodes
[all...] |
| loop_dependence.h | 354 const std::vector<SERecurrentNode*>& nodes);
493 bool WeakZeroSourceSIVTest(SENode* source, SERecurrentNode* destination,
501 bool WeakZeroDestinationSIVTest(SERecurrentNode* source, SENode* destination,
532 SENode* GetConstantTerm(const Loop* loop, SERecurrentNode* induction);
|
| loop_peeling.cpp | 655 if (const SERecurrentNode* iv =
[all...] |
| scalar_analysis.h | 118 SERecurrentNode* GetRecurrentTerm(SENode* node, const Loop* loop);
123 // SERecurrentNode objects. This enables analysing dependencies that will be
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| scalar_analysis_simplification.cpp | 105 SERecurrentNode* UpdateCoefficient(SERecurrentNode* recurrent,
111 SENode* SimplifyRecurrentAddExpression(SERecurrentNode* node);
207 SERecurrentNode* recurrent_expr = nullptr;
287 SERecurrentNode* SENodeSimplifyImpl::UpdateCoefficient(
288 SERecurrentNode* recurrent, int64_t coefficient_update) const {
289 std::unique_ptr<SERecurrentNode> new_recurrent_node{new SERecurrentNode(
378 std::map<const Loop*, std::vector<std::pair<SERecurrentNode*, bool>>>
394 SERecurrentNode* rec = child->AsSERecurrentNode()
[all...] |
| scalar_analysis_nodes.h | 31 class SERecurrentNode;
117 std::vector<SERecurrentNode*> CollectRecurrentNodes() {
118 std::vector<SERecurrentNode*> recurrent_nodes{};
178 DeclareCastMethod(SERecurrentNode);
239 class SERecurrentNode : public SENode {
241 SERecurrentNode(ScalarEvolutionAnalysis* parent_analysis, const Loop* loop)
265 SERecurrentNode* AsSERecurrentNode() override { return this; }
266 const SERecurrentNode* AsSERecurrentNode() const override { return this; }
|
| loop_peeling.h | 302 SExpression GetValueAtFirstIteration(SERecurrentNode* rec) const;
304 SExpression GetValueAtIteration(SERecurrentNode* rec,
307 SExpression GetValueAtLastIteration(SERecurrentNode* rec) const;
314 SERecurrentNode* rhs) const;
|
| loop_dependence_helpers.cpp | 202 std::vector<SERecurrentNode*> source_nodes =
204 std::vector<SERecurrentNode*> destination_nodes =
320 const std::vector<SERecurrentNode*>& recurrent_nodes) {
338 std::vector<SERecurrentNode*> recurrent_nodes = node->CollectRecurrentNodes();
354 std::vector<SERecurrentNode*> source_nodes = source->CollectRecurrentNodes();
355 std::vector<SERecurrentNode*> destination_nodes =
397 SERecurrentNode* induction) {
429 std::vector<SERecurrentNode*> recurrent_nodes =
431 for (SERecurrentNode* recurrent_node : recurrent_nodes) {
439 std::vector<SERecurrentNode*> recurrent_nodes
[all...] |
| scalar_analysis.cpp | 90 std::unique_ptr<SERecurrentNode> phi_node{
91 new SERecurrentNode(this, loop_to_use)};
285 std::unique_ptr<SERecurrentNode> phi_node{
286 new SERecurrentNode(this, loop_to_use)};
379 if (const SERecurrentNode* rec = itr->AsSERecurrentNode()) {
401 SERecurrentNode* rec = itr->AsSERecurrentNode();
438 SERecurrentNode* recurrent = node->AsSERecurrentNode();
468 SERecurrentNode* ScalarEvolutionAnalysis::GetRecurrentTerm(SENode* node,
471 SERecurrentNode* rec = itr->AsSERecurrentNode();
503 const SERecurrentNode* this_as_recurrent = AsSERecurrentNode()
[all...] |
| loop_dependence.cpp | 71 // and contains only the following types of nodes: SERecurrentNode, SEAddNode
88 // If |node| is an SERecurrentNode then returns |node| or if |node| is an
89 // SEAddNode returns a vector of SERecurrentNode that are its children.
90 std::vector<SERecurrentNode*> GetAllTopLevelRecurrences(SENode* node) {
91 auto nodes = std::vector<SERecurrentNode*>{};
125 const std::vector<SERecurrentNode*>& nodes) {
137 int64_t CalculateConstantTerm(const std::vector<SERecurrentNode*>& recurrences,
153 const std::vector<SERecurrentNode*>& recurrences, int64_t running_gcd) {
154 for (SERecurrentNode* recurrence : recurrences) {
463 std::vector<SERecurrentNode*> source_recurrent_nodes
[all...] |
| loop_dependence.h | 354 const std::vector<SERecurrentNode*>& nodes);
493 bool WeakZeroSourceSIVTest(SENode* source, SERecurrentNode* destination,
501 bool WeakZeroDestinationSIVTest(SERecurrentNode* source, SENode* destination,
532 SENode* GetConstantTerm(const Loop* loop, SERecurrentNode* induction);
|
| loop_peeling.cpp | 655 if (const SERecurrentNode* iv =
[all...] |
| scalar_analysis.h | 118 SERecurrentNode* GetRecurrentTerm(SENode* node, const Loop* loop);
123 // SERecurrentNode objects. This enables analysing dependencies that will be
|
| /external/deqp-deps/SPIRV-Tools/test/opt/ |
| scalar_analysis.cpp | 272 const SERecurrentNode* rec = simplified->AsSERecurrentNode();
911 SERecurrentNode* load_simplified =
[all...] |
| /external/swiftshader/third_party/SPIRV-Tools/test/opt/ |
| scalar_analysis.cpp | 272 const SERecurrentNode* rec = simplified->AsSERecurrentNode();
911 SERecurrentNode* load_simplified =
[all...] |
