23906044628

Committed 02 Apr 2026 02:40PM UTC coverage: 64.553% (+0.08%) from 64.474%

Build # 23906044628

Build Type

Pull #632

github

Committed by

web-flow

Commit Message

Merge b2698daab into 3125b927b

Pull Request Pull Request #632: Separate can_be_applied and apply for GPUTilling during Loop Scheduling

Run Details

282 of 348 new or added lines in 16 files covered. (81.03%)

29 existing lines in 10 files now uncovered.

28998 of 44921 relevant lines covered (64.55%)

453.01 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

91.67

/opt/src/passes/offloading/gpu_loop_reordering_pass.cpp

#include "sdfg/passes/offloading/gpu_loop_reordering_pass.h"

#include "sdfg/transformations/offloading/gpu_loop_reordering.h"

namespace sdfg {
namespace passes {

GPULoopReorderingPass::GPULoopReorderingPass(const std::vector<structured_control_flow::Map*>& maps) : maps_(maps) {}

bool GPULoopReorderingPass::run_pass(builder::StructuredSDFGBuilder& builder, analysis::AnalysisManager& analysis_manager) {
    if (maps_.empty()) {
        return false;
    }

    // Phase 1: Collect applicable reorderings
    struct ReorderingCandidate {
        structured_control_flow::Map* map;
    };
    std::vector<ReorderingCandidate> candidates;

    for (auto* map : maps_) {
        transformations::GPULoopReordering reordering(*map);
        if (reordering.can_be_applied(builder, analysis_manager)) {
            candidates.push_back({map});
        }
    }

    if (candidates.empty()) {
        return false;
    }

    // Phase 2: Apply all reorderings
    for (auto& candidate : candidates) {
        transformations::GPULoopReordering reordering(*candidate.map);
        reordering.apply(builder, analysis_manager);
    }

    return true;
}

} // namespace passes
} // namespace sdfg

1	#include "sdfg/passes/offloading/gpu_loop_reordering_pass.h"
2
3	#include "sdfg/transformations/offloading/gpu_loop_reordering.h"
4
5	namespace sdfg {
6	namespace passes {
7
8	GPULoopReorderingPass::GPULoopReorderingPass(const std::vector<structured_control_flow::Map*>& maps) : maps_(maps) {}	3✔
9
10	bool GPULoopReorderingPass::run_pass(builder::StructuredSDFGBuilder& builder, analysis::AnalysisManager& analysis_manager) {	3✔
11	if (maps_.empty()) {	3✔
NEW 12	return false;	×
NEW 13	}	×
14
15	// Phase 1: Collect applicable reorderings
16	struct ReorderingCandidate {	3✔
17	structured_control_flow::Map* map;	3✔
18	};	3✔
19	std::vector<ReorderingCandidate> candidates;	3✔
20
21	for (auto* map : maps_) {	4✔
22	transformations::GPULoopReordering reordering(*map);	4✔
23	if (reordering.can_be_applied(builder, analysis_manager)) {	4✔
24	candidates.push_back({map});	2✔
25	}	2✔
26	}	4✔
27
28	if (candidates.empty()) {	3✔
29	return false;	1✔
30	}	1✔
31
32	// Phase 2: Apply all reorderings
33	for (auto& candidate : candidates) {	2✔
34	transformations::GPULoopReordering reordering(*candidate.map);	2✔
35	reordering.apply(builder, analysis_manager);	2✔
36	}	2✔
37
38	return true;	2✔
39	}	3✔
40
41	} // namespace passes
42	} // namespace sdfg

daisytuner / docc / 23906044628

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous