rizin/test/unit/test_agraph.c
Riccardo Schirone a7fd3fa3c6 Use mu_main to reduce boilerplate in unit tests
* Disable colors on Windows because terminal looks bad otherwise
* Use environment on Windows to set PATH and make sure unit tests use
  the compiled libraries and not the installed ones
* Define ssize_t on Windows as well by using SSIZE_T

Update test_analysis_block.c

Update test_intervaltree.c

Update test_unum.c
2021-01-03 11:42:38 +01:00

107 lines
No EOL
2.8 KiB
C

#include <rz_core.h>
#include <rz_analysis.h>
#include <rz_agraph.h>
#include <rz_util.h>
#include "minunit.h"
bool test_graph_to_agraph() {
RzCore *core = rz_core_new ();
rz_core_cmd0 (core, "ac A");
rz_core_cmd0 (core, "ac B");
rz_core_cmd0 (core, "ac C");
rz_core_cmd0 (core, "ac D");
rz_core_cmd0 (core, "acb B A");
rz_core_cmd0 (core, "acb C A");
rz_core_cmd0 (core, "acb D B");
rz_core_cmd0 (core, "acb D C");
RzGraph *graph = rz_analysis_class_get_inheritance_graph (core->analysis);
mu_assert_notnull (graph, "Couldn't create the graph");
mu_assert_eq (graph->nodes->length, 4, "Wrong node count");
RzAGraph *agraph = create_agraph_from_graph (graph);
mu_assert_notnull (agraph, "Couldn't create the graph");
mu_assert_eq (agraph->graph->nodes->length, 4, "Wrong node count");
RzListIter *iter;
RzGraphNode *node;
int i = 0;
ls_foreach (agraph->graph->nodes, iter, node) {
RzANode *info = node->data;
switch (i++) {
case 0:
mu_assert_streq (info->title, "A", "Wrong node name");
mu_assert_eq (node->out_nodes->length, 2, "Wrong node out-nodes");
{
RzListIter *iter;
RzGraphNode *out_node;
int i = 0;
ls_foreach (node->out_nodes, iter, out_node) {
RzANode *info = out_node->data;
switch (i++) {
case 0:
mu_assert_streq (info->title, "B", "Wrong node name");
break;
case 1:
mu_assert_streq (info->title, "C", "Wrong node name");
break;
}
}
}
break;
case 1:
mu_assert_streq (info->title, "B", "Wrong node name");
mu_assert_eq (node->out_nodes->length, 1, "Wrong node out-nodes");
mu_assert_eq (node->in_nodes->length, 1, "Wrong node in-nodes");
{
RzListIter *iter;
RzGraphNode *out_node;
int i = 0;
ls_foreach (node->out_nodes, iter, out_node) {
RzANode *info = out_node->data;
switch (i++) {
case 0:
mu_assert_streq (info->title, "D", "Wrong node name");
break;
}
}
}
break;
case 2:
mu_assert_streq (info->title, "C", "Wrong node name");
mu_assert_eq (node->out_nodes->length, 1, "Wrong node out-nodes");
mu_assert_eq (node->in_nodes->length, 1, "Wrong node in-nodes");
{
RzListIter *iter;
RzGraphNode *out_node;
int i = 0;
ls_foreach (node->out_nodes, iter, out_node) {
RzANode *info = out_node->data;
switch (i++) {
case 0:
mu_assert_streq (info->title, "D", "Wrong node name");
break;
}
}
}
break;
case 3:
mu_assert_streq (info->title, "D", "Wrong node name");
mu_assert_eq (node->in_nodes->length, 2, "Wrong node in-nodes");
break;
default:
break;
}
}
rz_core_free (core);
rz_graph_free (graph);
rz_agraph_free (agraph);
mu_end;
}
int all_tests() {
mu_run_test (test_graph_to_agraph);
return tests_passed != tests_run;
}
mu_main (all_tests)