MappingGraphTests.cpp File Reference

#include <CGRA/Mapping.h>
#include <CGRA/Module.h>
#include <CGRA/user-inc/UserArchs.h>
#include "testutils/OpGraphsForTesting.hpp"
#include <iostream>
#include <catch2/catch.hpp>

Go to the source code of this file.

Functions
	SCENARIO ("Mapping Graph Tests")
	SCENARIO ("Complex Latency Tests")
	TEST_CASE ("Latency Balancing -- small graphs")

Function Documentation

SCENARIO() [1/2]

SCENARIO

(

"Complex Latency Tests"

)

a -> l -—> m -—> d ^–n—' ^–o—'

a -> b2 -> c '--> b –^ ^ \ 'd'

This test currently has an edge case that fails occasionally. It fails because it does a search on a node that it thinks is part of a cycle but it isn't. The node being refered to is b2 and b2_out. Most likely fix is to add something to the queue to indicate if the emplacement is a fanin or a fanout so we avoid cycle checks on nodes that were fanins.

a->b->c->d->e ^ ^-—| | |-------—|

Definition at line 547 of file MappingGraphTests.cpp.

SCENARIO() [2/2]

SCENARIO

(

"Mapping Graph Tests"

)

Definition at line 31 of file MappingGraphTests.cpp.

TEST_CASE()

TEST_CASE

(

"Latency Balancing -- small graphs"

)

Definition at line 921 of file MappingGraphTests.cpp.