Skip to content
Snippets Groups Projects
Commit a35b31df authored by Jakobsen, Mads Bregenholt's avatar Jakobsen, Mads Bregenholt
Browse files

adding debugging info

parent 20193d96
No related branches found
No related tags found
No related merge requests found
......@@ -112,12 +112,12 @@ inline bool is_data_aligned_for_simd(const double* incoming_data_ptr, const doub
constexpr auto align_val_data = stdx::memory_alignment_v<stdx::native_simd<double>>;
const bool data_is_aligned = is_aligned(incoming_data_ptr,align_val_data);
//std::cout << "data_is_aligned? " << data_is_aligned << " &data " << incoming_data_ptr << "\n";
std::cout << "data_is_aligned? " << data_is_aligned << " &data " << incoming_data_ptr << "\n";
constexpr auto align_val_mem = stdx::memory_alignment_v<stdx::native_simd<double>>;
static_assert(align_val_mem == stdx::memory_alignment_v<stdx::native_simd<std::uint64_t>>);
const bool mem_is_aligned = is_aligned(running_mean_mem_ptr,align_val_mem);
//std::cout << "mem_is_aligned? " << mem_is_aligned << " &running_mean_mem_ptr " << running_mean_mem_ptr << "\n";
std::cout << "mem_is_aligned? " << mem_is_aligned << " &running_mean_mem_ptr " << running_mean_mem_ptr << "\n";
return (mem_is_aligned && data_is_aligned);
}
......@@ -132,10 +132,10 @@ void running_stats_simd(
std::uint32_t* vec_size) // of size 1
{
//if (!is_data_aligned_for_simd(data, running_mean_mem))
//{
// std::cout << "ERROR, MEMORY NOT ALIGNED for simd vector_aligned!\n";
// }
if (!is_data_aligned_for_simd(data, running_mean_mem))
{
std::cout << "ERROR, MEMORY NOT ALIGNED for simd vector_aligned!\n";
}
constexpr auto align_val_data = stdx::memory_alignment_v<stdx::native_simd<double>>;
constexpr auto num_elements_per_data_vec = align_val_data/sizeof(double);
......@@ -159,6 +159,7 @@ void running_stats_simd(
*vec_size = num_elements_per_data_vec;
double* memory = running_mean_mem;
for (std::uint32_t idx = 0; idx<data_size; idx += num_elements_per_data_vec)
{
// read values
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment