/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
+#include "simgrid_config.h" /* getline */
+#include <errno.h>
#include <stdlib.h>
#include "xbt/sysdep.h"
#include "xbt/log.h"
#include "xbt/graphxml_parse.h"
#include "xbt/dict.h"
#include "xbt/heap.h"
+#include "xbt/str.h"
unsigned int cursor;
xbt_dynar_foreach(src->out, cursor, edge) {
- DEBUG3("%p = %p--%p", edge, edge->src, edge->dst);
+ XBT_DEBUG("%p = %p--%p", edge, edge->src, edge->dst);
if ((edge->src == src) && (edge->dst == dst))
return edge;
}
if (!g->directed) {
xbt_dynar_foreach(src->out, cursor, edge) {
- DEBUG3("%p = %p--%p", edge, edge->src, edge->dst);
+ XBT_DEBUG("%p = %p--%p", edge, edge->src, edge->dst);
if ((edge->dst == src) && (edge->src == dst))
return edge;
}
xbt_dynar_free(&(node->out));
xbt_dynar_free(&(node->in));
if (node_free_function)
- (*node_free_function) (node->data);
+ node_free_function(node->data);
}
xbt_dynar_foreach(g->edges, cursor, edge) {
if (edge_free_function)
- (*edge_free_function) (edge->data);
+ edge_free_function(edge->data);
}
xbt_dynar_foreach(g->nodes, cursor, node)
free(edge);
xbt_dynar_free(&(g->edges));
if (graph_free_function)
- (*graph_free_function) (g->data);
+ graph_free_function(g->data);
free(g);
-
+ xbt_graph_parse_lex_destroy();
return;
}
}
if ((node_free_function) && (n->data))
- (*node_free_function) (n->data);
+ node_free_function(n->data);
cursor = 0;
xbt_dynar_foreach(g->nodes, cursor, node)
xbt_edge_t edge = NULL;
if ((free_function) && (e->data))
- (*free_function) (e->data);
+ free_function(e->data);
xbt_dynar_foreach(g->edges, cursor, edge) {
if (edge == e) {
xbt_heap_t heap = xbt_heap_new(10, NULL);
unsigned int cursor;
- xbt_assert0(!(g->directed),
+ xbt_assert(!(g->directed),
"Spanning trees do not make sense on directed graphs");
xbt_dynar_foreach(g->nodes, cursor, node) {
if (*((int *) (n->xbtdata)) == ALREADY_EXPLORED)
return;
else if (*((int *) (n->xbtdata)) == CURRENTLY_EXPLORING)
- THROW0(0, 0, "There is a cycle");
+ THROWF(0, 0, "There is a cycle");
else {
*((int *) (n->xbtdata)) = CURRENTLY_EXPLORING;
static void __parse_graph_begin(void)
{
- DEBUG0("<graph>");
+ XBT_DEBUG("<graph>");
if (A_graphxml_graph_isDirected == A_graphxml_graph_isDirected_true)
parsed_graph = xbt_graph_new_graph(1, NULL);
else
parsed_graph = xbt_graph_new_graph(0, NULL);
- parsed_nodes = xbt_dict_new();
+ parsed_nodes = xbt_dict_new_homogeneous(NULL);
}
static void __parse_graph_end(void)
{
xbt_dict_free(&parsed_nodes);
- DEBUG0("</graph>");
+ XBT_DEBUG("</graph>");
}
static void __parse_node(void)
{
xbt_node_t node = xbt_graph_new_node(parsed_graph, NULL);
- DEBUG1("<node name=\"%s\"/>", A_graphxml_node_name);
+ XBT_DEBUG("<node name=\"%s\"/>", A_graphxml_node_name);
if (__parse_node_label_and_data)
node->data = __parse_node_label_and_data(node, A_graphxml_node_label,
A_graphxml_node_data);
- xbt_graph_parse_get_double(&(node->position_x),
- A_graphxml_node_position_x);
- xbt_graph_parse_get_double(&(node->position_y),
- A_graphxml_node_position_y);
+ node->position_x = xbt_graph_parse_get_double(A_graphxml_node_position_x);
+ node->position_y = xbt_graph_parse_get_double(A_graphxml_node_position_y);
xbt_dict_set(parsed_nodes, A_graphxml_node_name, (void *) node, NULL);
}
edge->data = __parse_edge_label_and_data(edge, A_graphxml_edge_label,
A_graphxml_edge_data);
- xbt_graph_parse_get_double(&(edge->length), A_graphxml_edge_length);
+ edge->length = xbt_graph_parse_get_double(A_graphxml_edge_length);
- DEBUG3("<edge source=\"%s\" target=\"%s\" length=\"%f\"/>",
+ XBT_DEBUG("<edge source=\"%s\" target=\"%s\" length=\"%f\"/>",
(char *) (edge->src)->data,
(char *) (edge->dst)->data, xbt_graph_edge_get_length(edge));
}
ETag_graphxml_edge_fun = __parse_edge;
xbt_graph_parse_open(filename);
- xbt_assert1((!(*xbt_graph_parse) ()), "Parse error in %s", filename);
+ _XBT_GNUC_UNUSED int res;
+ res = xbt_graph_parse();
+ xbt_assert(!res, "Parse error in %s", filename);
xbt_graph_parse_close();
graph = parsed_graph;
const char *name = NULL;
file = fopen(filename, "w");
- xbt_assert1(file, "Failed to open %s \n", filename);
+ xbt_assert(file, "Failed to open %s \n", filename);
if (g->directed)
fprintf(file, "digraph test {\n");
const char *name = NULL;
file = fopen(filename, "w");
- xbt_assert1(file, "Failed to open %s \n", filename);
+ xbt_assert(file, "Failed to open %s \n", filename);
fprintf(file, "<?xml version='1.0'?>\n");
fprintf(file, "<!DOCTYPE graph SYSTEM \"graphxml.dtd\">\n");
fprintf(file, "</graph>\n");
fclose(file);
}
+
+/** @brief Load a graph from a file (in the SimGrid Graph format) */
+xbt_graph_t xbt_graph_load (const char *filename)
+{
+ FILE *file = NULL;
+ ssize_t read;
+ file = fopen (filename, "r");
+ xbt_assert(file, "Failed to open %s \n", filename);
+
+ xbt_dict_t nodes_dict = xbt_dict_new_homogeneous(NULL);
+ xbt_graph_t ret = xbt_graph_new_graph (0, NULL);
+
+ //read the number of nodes
+ size_t size;
+ char *nnodes_str = NULL;
+ read = getline (&nnodes_str, &size, file);
+ if (read == -1)
+ THROWF(system_error, 0, "getline failed to read the number of nodes (errno = %d)", errno);
+ int i, nnodes = atoi (nnodes_str);
+ free (nnodes_str);
+
+ //read all nodes
+ for (i = 0; i < nnodes; i++){
+ char *node_str = NULL;
+ read = getline (&node_str, &size, file);
+ if (read == -1)
+ THROWF(system_error, 0, "getline failed to read all nodes (errno = %d)", errno);
+ xbt_node_t n;
+ char *name = xbt_strdup (node_str);
+ xbt_str_subst (name, '\n', '\0', 0);
+ n = xbt_graph_new_node (ret, name);
+ xbt_dict_set (nodes_dict, name, n, NULL);
+ free (node_str);
+ }
+
+ //read the number of edges
+ char *nedges_str = NULL;
+ read = getline (&nedges_str, &size, file);
+ if (read == -1)
+ THROWF(system_error, 0, "getline failed to read the number of edges (errno = %d)", errno);
+ int nedges = atoi (nedges_str);
+ free (nedges_str);
+
+ //read all edges
+ for (i = 0; i < nedges; i++){
+ char *edge_str = NULL, edge_id[200], node_source[200], node_target[200];
+ read = getline (&edge_str, &size, file);
+ if (read == -1)
+ THROWF(system_error, 0, "getline failed to read all edges (errno = %d)", errno);
+ sscanf (edge_str, "%s %s %s", edge_id, node_source, node_target);
+ free (edge_str);
+ xbt_str_subst (edge_id, '\n', '\0', 0);
+ xbt_str_subst (node_source, '\n', '\0', 0);
+ xbt_str_subst (node_target, '\n', '\0', 0);
+
+ xbt_node_t source = xbt_dict_get (nodes_dict, node_source);
+ xbt_node_t target = xbt_dict_get (nodes_dict, node_target);
+ xbt_graph_new_edge (ret, source, target, xbt_strdup(edge_id));
+ }
+ xbt_dict_free (&nodes_dict);
+ return ret;
+}
+
+/** @brief Save a graph from a file (in the SimGrid Graph format) */
+void xbt_graph_save (xbt_graph_t span,
+ const char *filename,
+ const char *(nname) (xbt_node_t),
+ const char *(ename) (xbt_edge_t))
+{
+ FILE *file = NULL;
+ file = fopen(filename, "w");
+ xbt_assert(file, "Failed to open %s \n", filename);
+
+ xbt_dynar_t nodes = xbt_graph_get_nodes (span);
+ xbt_dynar_t edges = xbt_graph_get_edges (span);
+ unsigned int cpt;
+ xbt_node_t node;
+ fprintf (file, "%lu\n", xbt_dynar_length (nodes));
+ xbt_dynar_foreach (nodes, cpt, node) {
+ if (nname){
+ fprintf (file, "%s\n", nname(node));
+ }else{
+ fprintf (file, "%p\n", node);
+ }
+ }
+ fprintf (file, "%lu\n", xbt_dynar_length (edges));
+ xbt_edge_t edge;
+ xbt_dynar_foreach (edges, cpt, edge) {
+ xbt_node_t source = xbt_graph_edge_get_source (edge);
+ xbt_node_t target = xbt_graph_edge_get_target (edge);
+ if (ename){
+ if (nname){
+ fprintf (file, "%s %s %s\n", ename(edge), nname(source), nname(target));
+ }else{
+ fprintf (file, "%s %p %p\n", ename(edge), source, target);
+ }
+ }else{
+ if (nname){
+ fprintf (file, "%p %s %s\n", edge, nname(source), nname(target));
+ }else{
+ fprintf (file, "%p %p %p\n", edge, source, target);
+ }
+ }
+ }
+ fclose (file);
+}
