16779684622

Committed 06 Aug 2025 02:21PM UTC coverage: 64.3% (-1.0%) from 65.266%

Build # 16779684622

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #172 from daisytuner/opaque-pointers

Opaque pointers, typed memlets, untyped tasklet connectors

Run Details

330 of 462 new or added lines in 38 files covered. (71.43%)

382 existing lines in 30 files now uncovered.

8865 of 13787 relevant lines covered (64.3%)

116.73 hits per line

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

82.61

/src/types/utils.cpp

#include "sdfg/types/utils.h"

#include "sdfg/codegen/utils.h"
#include "sdfg/symbolic/symbolic.h"

#include "sdfg/codegen/language_extensions/c_language_extension.h"

namespace sdfg {
namespace types {

const types::IType&
infer_type_internal(const sdfg::Function& function, const types::IType& type, const data_flow::Subset& subset) {
    if (subset.empty()) {
        return type;
    }

    if (type.type_id() == TypeID::Scalar) {
        if (!subset.empty()) {
            throw InvalidSDFGException("Scalar type must have no subset");
        }

        return type;
    } else if (type.type_id() == TypeID::Array) {
        auto& array_type = static_cast<const types::Array&>(type);

        data_flow::Subset element_subset(subset.begin() + 1, subset.end());
        return infer_type_internal(function, array_type.element_type(), element_subset);
    } else if (type.type_id() == TypeID::Structure) {
        auto& structure_type = static_cast<const types::Structure&>(type);

        auto& definition = function.structure(structure_type.name());

        data_flow::Subset element_subset(subset.begin() + 1, subset.end());
        auto member = SymEngine::rcp_dynamic_cast<const SymEngine::Integer>(subset.at(0));
        return infer_type_internal(function, definition.member_type(member), element_subset);
    } else if (type.type_id() == TypeID::Pointer) {
        throw InvalidSDFGException("Subset references non-contiguous memory");
    }

    throw InvalidSDFGException("Type inference failed because of unknown type");
};

const types::IType& infer_type(const sdfg::Function& function, const types::IType& type, const data_flow::Subset& subset) {
    if (subset.empty()) {
        return type;
    }

    if (type.type_id() == TypeID::Pointer) {
        auto& pointer_type = static_cast<const types::Pointer&>(type);
        if (!pointer_type.has_pointee_type()) {
            throw InvalidSDFGException("Non-empty subset for pointer type without pointee type");
        }

        auto& pointee_type = pointer_type.pointee_type();

        data_flow::Subset element_subset(subset.begin() + 1, subset.end());
        return infer_type_internal(function, pointee_type, element_subset);
    } else {
        return infer_type_internal(function, type, subset);
    }
};

std::unique_ptr<types::IType> recombine_array_type(const types::IType& type, uint depth, const types::IType& inner_type) {
    if (depth == 0) {
        return inner_type.clone();
    } else {
        if (auto atype = dynamic_cast<const types::Array*>(&type)) {
            return std::make_unique<types::Array>(
                atype->storage_type(),
                atype->alignment(),
                atype->initializer(),
                *recombine_array_type(atype->element_type(), depth - 1, inner_type).get(),
                atype->num_elements()
            );
        } else {
            throw std::runtime_error("construct_type: Non array types are not supported yet!");
        }
    }
};

const IType& peel_to_innermost_element(const IType& type, int follow_ptr) {
    int next_follow = follow_ptr;
    if (follow_ptr == PEEL_TO_INNERMOST_ELEMENT_FOLLOW_ONLY_OUTER_PTR) {
        next_follow = 0; // only follow an outermost pointer
    }

    switch (type.type_id()) {
        case TypeID::Array:
            return peel_to_innermost_element(dynamic_cast<const types::Array&>(type).element_type(), next_follow);
        case TypeID::Reference:
            return peel_to_innermost_element(dynamic_cast<const codegen::Reference&>(type).reference_type(), next_follow);
        case TypeID::Pointer:
            if (follow_ptr != 0) {
                if (follow_ptr != PEEL_TO_INNERMOST_ELEMENT_FOLLOW_ONLY_OUTER_PTR) {
                    next_follow = follow_ptr - 1; // follow one less pointer
                }

                return peel_to_innermost_element(dynamic_cast<const types::Pointer&>(type).pointee_type(), next_follow);
            }
            // fall back to cut-off if we did not follow the pointer
        default:
            return type;
    }
}

symbolic::Expression get_contiguous_element_size(const types::IType& type, bool allow_comp_time_eval) {
    // need to peel explicitly, primitive_type() would follow ALL pointers, even ***, even though this is not contiguous
    auto& innermost = peel_to_innermost_element(type, PEEL_TO_INNERMOST_ELEMENT_FOLLOW_ONLY_OUTER_PTR);

    return get_type_size(innermost, allow_comp_time_eval);
}

symbolic::Expression get_type_size(const types::IType& type, bool allow_comp_time_eval) {
    bool only_symbolic = false;

    auto id = type.type_id();
    if (id == TypeID::Pointer || id == TypeID::Reference || id == TypeID::Function) {
        // TODO NEED target info to know pointer size (4 or 8 bytes?) !!
        only_symbolic = true;
    } else if (id == TypeID::Structure) {
        // TODO if we have the target definition, we could evaluate the StructureDefinition to a size
        only_symbolic = true;
    } else if (id == TypeID::Array) {
        auto& arr = dynamic_cast<const types::Array&>(type);
        auto inner_element_size = get_type_size(arr.element_type(), allow_comp_time_eval);
        if (!inner_element_size.is_null()) {
            return symbolic::mul(inner_element_size, arr.num_elements());
        } else {
            return {};
        }
    }

    if (only_symbolic) {
        // Could not statically figure out the size
        // Could be struct we could evaluate by its definition or sth. we do not understand here
        if (allow_comp_time_eval) {
            return symbolic::size_of_type(type);
        } else { // size unknown
            return {};
        }
    } else { // should just be a primitive type
        auto prim_type = type.primitive_type();

        long size_of_type = static_cast<long>(types::bit_width(prim_type)) / 8;
        if (size_of_type != 0) {
            return symbolic::integer(size_of_type);
        } else {
            codegen::CLanguageExtension lang;
            std::cerr << "Unexpected primitive_type " << primitive_type_to_string(prim_type) << " of "
                      << lang.declaration("", type) << ", unknown size";
            return {};
        }
    }
}

} // namespace types
} // namespace sdfg

1	#include "sdfg/types/utils.h"
2
3	#include "sdfg/codegen/utils.h"
4	#include "sdfg/symbolic/symbolic.h"
5
6	#include "sdfg/codegen/language_extensions/c_language_extension.h"
7
8	namespace sdfg {
9	namespace types {
10
11	const types::IType&
12	infer_type_internal(const sdfg::Function& function, const types::IType& type, const data_flow::Subset& subset) {	962✔
13	if (subset.empty()) {	962✔
14	return type;	463✔
15	}
16
17	if (type.type_id() == TypeID::Scalar) {	499✔
18	if (!subset.empty()) {	×
19	throw InvalidSDFGException("Scalar type must have no subset");	×
20	}
21
22	return type;	×
23	} else if (type.type_id() == TypeID::Array) {	499✔
24	auto& array_type = static_cast<const types::Array&>(type);	498✔
25
26	data_flow::Subset element_subset(subset.begin() + 1, subset.end());	498✔
27	return infer_type_internal(function, array_type.element_type(), element_subset);	498✔
28	} else if (type.type_id() == TypeID::Structure) {	499✔
29	auto& structure_type = static_cast<const types::Structure&>(type);	1✔
30
31	auto& definition = function.structure(structure_type.name());	1✔
32
33	data_flow::Subset element_subset(subset.begin() + 1, subset.end());	1✔
34	auto member = SymEngine::rcp_dynamic_cast<const SymEngine::Integer>(subset.at(0));	1✔
35	return infer_type_internal(function, definition.member_type(member), element_subset);	1✔
36	} else if (type.type_id() == TypeID::Pointer) {	1✔
37	throw InvalidSDFGException("Subset references non-contiguous memory");	×
38	}
39
40	throw InvalidSDFGException("Type inference failed because of unknown type");	×
41	};	962✔
42
43	const types::IType& infer_type(const sdfg::Function& function, const types::IType& type, const data_flow::Subset& subset) {	1,338✔
44	if (subset.empty()) {	1,338✔
45	return type;	875✔
46	}
47
48	if (type.type_id() == TypeID::Pointer) {	463✔
49	auto& pointer_type = static_cast<const types::Pointer&>(type);	218✔
50	if (!pointer_type.has_pointee_type()) {	218✔
NEW 51	throw InvalidSDFGException("Non-empty subset for pointer type without pointee type");	×
52	}
53
54	auto& pointee_type = pointer_type.pointee_type();	218✔
55
56	data_flow::Subset element_subset(subset.begin() + 1, subset.end());	218✔
57	return infer_type_internal(function, pointee_type, element_subset);	218✔
58	} else {	218✔
59	return infer_type_internal(function, type, subset);	245✔
60	}
61	};	1,338✔
62
63	std::unique_ptr<types::IType> recombine_array_type(const types::IType& type, uint depth, const types::IType& inner_type) {	21✔
64	if (depth == 0) {	21✔
65	return inner_type.clone();	9✔
66	} else {
67	if (auto atype = dynamic_cast<const types::Array*>(&type)) {	12✔
68	return std::make_unique<types::Array>(	12✔
69	atype->storage_type(),	12✔
70	atype->alignment(),	12✔
71	atype->initializer(),	12✔
72	*recombine_array_type(atype->element_type(), depth - 1, inner_type).get(),	12✔
73	atype->num_elements()	12✔
74	);
75	} else {
76	throw std::runtime_error("construct_type: Non array types are not supported yet!");	×
77	}
78	}
79	};	21✔
80
81	const IType& peel_to_innermost_element(const IType& type, int follow_ptr) {	13✔
82	int next_follow = follow_ptr;	13✔
83	if (follow_ptr == PEEL_TO_INNERMOST_ELEMENT_FOLLOW_ONLY_OUTER_PTR) {	13✔
84	next_follow = 0; // only follow an outermost pointer	5✔
85	}	5✔
86
87	switch (type.type_id()) {	13✔
88	case TypeID::Array:
89	return peel_to_innermost_element(dynamic_cast<const types::Array&>(type).element_type(), next_follow);	3✔
90	case TypeID::Reference:
91	return peel_to_innermost_element(dynamic_cast<const codegen::Reference&>(type).reference_type(), next_follow);	×
92	case TypeID::Pointer:
93	if (follow_ptr != 0) {	6✔
94	if (follow_ptr != PEEL_TO_INNERMOST_ELEMENT_FOLLOW_ONLY_OUTER_PTR) {	5✔
95	next_follow = follow_ptr - 1; // follow one less pointer	×
96	}	×
97
98	return peel_to_innermost_element(dynamic_cast<const types::Pointer&>(type).pointee_type(), next_follow);	5✔
99	}
100	// fall back to cut-off if we did not follow the pointer
101	default:
102	return type;	5✔
103	}
104	}	13✔
105
106	symbolic::Expression get_contiguous_element_size(const types::IType& type, bool allow_comp_time_eval) {	5✔
107	// need to peel explicitly, primitive_type() would follow ALL pointers, even ***, even though this is not contiguous
108	auto& innermost = peel_to_innermost_element(type, PEEL_TO_INNERMOST_ELEMENT_FOLLOW_ONLY_OUTER_PTR);	5✔
109
110	return get_type_size(innermost, allow_comp_time_eval);	5✔
111	}
112
113	symbolic::Expression get_type_size(const types::IType& type, bool allow_comp_time_eval) {	13✔
114	bool only_symbolic = false;	13✔
115
116	auto id = type.type_id();	13✔
117	if (id == TypeID::Pointer \|\| id == TypeID::Reference \|\| id == TypeID::Function) {	13✔
118	// TODO NEED target info to know pointer size (4 or 8 bytes?) !!
119	only_symbolic = true;	4✔
120	} else if (id == TypeID::Structure) {	13✔
121	// TODO if we have the target definition, we could evaluate the StructureDefinition to a size
122	only_symbolic = true;	5✔
123	} else if (id == TypeID::Array) {	9✔
124	auto& arr = dynamic_cast<const types::Array&>(type);	1✔
125	auto inner_element_size = get_type_size(arr.element_type(), allow_comp_time_eval);	1✔
126	if (!inner_element_size.is_null()) {	1✔
127	return symbolic::mul(inner_element_size, arr.num_elements());	1✔
128	} else {
129	return {};	×
130	}
131	}	1✔
132
133	if (only_symbolic) {	12✔
134	// Could not statically figure out the size
135	// Could be struct we could evaluate by its definition or sth. we do not understand here
136	if (allow_comp_time_eval) {	9✔
137	return symbolic::size_of_type(type);	5✔
138	} else { // size unknown
139	return {};	4✔
140	}
141	} else { // should just be a primitive type
142	auto prim_type = type.primitive_type();	3✔
143
144	long size_of_type = static_cast<long>(types::bit_width(prim_type)) / 8;	3✔
145	if (size_of_type != 0) {	3✔
146	return symbolic::integer(size_of_type);	3✔
147	} else {
148	codegen::CLanguageExtension lang;	×
149	std::cerr << "Unexpected primitive_type " << primitive_type_to_string(prim_type) << " of "	×
150	<< lang.declaration("", type) << ", unknown size";	×
151	return {};	×
UNCOV 152	}	×
153	}
154	}	13✔
155
156	} // namespace types
157	} // namespace sdfg

daisytuner / sdfglib / 16779684622

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