CGRA-ME
|
#include <CGRA/dotparse.h>
#include <CGRA/HeuristicMappers.h>
#include <CGRA/MRRGProcedures.h>
#include <CGRA/OpGraphProcedures.h>
#include <CGRA/user-inc/UserArchs.h>
#include <CGRA/utility/CodeProfiling.h>
#include <CGRA/Visual.h>
#include "testutils/OpGraphsForTesting.hpp"
#include <chrono>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <catch2/catch.hpp>
Go to the source code of this file.
Functions | |
SCENARIO ("mapOpsJustByConnectivity Tests", "") | |
template<typename PLACEMENTS > | |
void | then_placement_should_fail_after_n_placements (const std::size_t nplace, const PLACEMENTS &placements, const Mapping &final_mapping) |
template<typename NFINDER , typename EDGE_COSTER > | |
void | when_mapped_then_placement_should_fail_after_n_placements (const std::size_t nplace, const OpGraph &opgraph, const MRRG &mrrg, const NFINDER &neighbour_finder, const EDGE_COSTER &edge_coster, ConfigStore options={}) |
SCENARIO ("is mapOpsJustByConnectivity exact?") | |
SCENARIO ("routeOpMappingByChoosingPaths Tests", "") | |
SCENARIO ("Try op mappings until one routes - Easy", "") | |
SCENARIO ("Try op mappings until one routes - Sometimes hard", "[!hide]") | |
TEST_CASE ("Heurmpr: path merging") | |
SCENARIO ("hycube AES test", "[!hide]") | |
SCENARIO ("Demo", "[!hide]") | |
SCENARIO | ( | "Demo" | , |
"" | [!hide] | ||
) |
Definition at line 1034 of file HeuristicMappers_tests.cpp.
SCENARIO | ( | "hycube AES test" | , |
"" | [!hide] | ||
) |
Definition at line 830 of file HeuristicMappers_tests.cpp.
SCENARIO | ( | "is mapOpsJustByConnectivity exact?" | ) |
Definition at line 294 of file HeuristicMappers_tests.cpp.
SCENARIO | ( | "mapOpsJustByConnectivity Tests" | , |
"" | |||
) |
Definition at line 204 of file HeuristicMappers_tests.cpp.
SCENARIO | ( | "routeOpMappingByChoosingPaths Tests" | , |
"" | |||
) |
Definition at line 437 of file HeuristicMappers_tests.cpp.
SCENARIO | ( | "Try op mappings until one routes - Easy" | , |
"" | |||
) |
Definition at line 576 of file HeuristicMappers_tests.cpp.
SCENARIO | ( | "Try op mappings until one routes - Sometimes hard" | , |
"" | [!hide] | ||
) |
These ones seem to occasionally take forever, and then map with too many NNs needed
Definition at line 644 of file HeuristicMappers_tests.cpp.
TEST_CASE | ( | "Heurmpr: path merging" | ) |
Definition at line 751 of file HeuristicMappers_tests.cpp.
void then_placement_should_fail_after_n_placements | ( | const std::size_t | nplace, |
const PLACEMENTS & | placements, | ||
const Mapping & | final_mapping | ||
) |
Definition at line 259 of file HeuristicMappers_tests.cpp.
void when_mapped_then_placement_should_fail_after_n_placements | ( | const std::size_t | nplace, |
const OpGraph & | opgraph, | ||
const MRRG & | mrrg, | ||
const NFINDER & | neighbour_finder, | ||
const EDGE_COSTER & | edge_coster, | ||
ConfigStore | options = {} |
||
) |
Definition at line 271 of file HeuristicMappers_tests.cpp.