1 /* Copyright (c) 2009-2016. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #include "src/simdag/simdag_private.h"
8 #include "simgrid/simdag.h"
12 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(sd_dotparse, sd, "Parsing DOT files");
15 #include <graphviz/cgraph.h>
23 xbt_dynar_t SD_dotload_generic(const char * filename, seq_par_t seq_or_par, bool schedule);
25 static void dot_task_p_free(void *task) {
26 SD_task_destroy(*(SD_task_t *)task);
29 /** @brief loads a DOT file describing a DAG
31 * See http://www.graphviz.org/doc/info/lang.html for more details.
32 * The size attribute of a node describes:
33 * - for a compute task: the amount of flops to execute
34 * - for a communication task : the amount of bytes to transfer
35 * If this attribute is ommited, the default value is zero.
37 xbt_dynar_t SD_dotload(const char *filename) {
38 return SD_dotload_generic(filename, sequential, false);
41 xbt_dynar_t SD_PTG_dotload(const char * filename) {
42 return SD_dotload_generic(filename, parallel, false);
45 xbt_dynar_t SD_dotload_with_sched(const char *filename) {
46 return SD_dotload_generic(filename, sequential, true);
49 static int edge_compare(const void *a, const void *b)
51 unsigned va = AGSEQ(*(Agedge_t **)a);
52 unsigned vb = AGSEQ(*(Agedge_t **)b);
53 return va == vb ? 0 : (va < vb ? -1 : 1);
56 xbt_dynar_t SD_dotload_generic(const char * filename, seq_par_t seq_or_par, bool schedule){
57 xbt_assert(filename, "Unable to use a null file descriptor\n");
58 FILE *in_file = fopen(filename, "r");
59 xbt_assert(in_file != NULL, "Failed to open file: %s", filename);
62 SD_task_t root, end, task;
64 xbt_dynar_t computer = NULL;
65 xbt_dict_cursor_t dict_cursor;
66 bool schedule_success = true;
68 xbt_dict_t jobs = xbt_dict_new_homogeneous(NULL);
69 xbt_dynar_t result = xbt_dynar_new(sizeof(SD_task_t), dot_task_p_free);
71 Agraph_t * dag_dot = agread(in_file, NIL(Agdisc_t *));
74 computers = xbt_dict_new_homogeneous(NULL);
76 /* Create all the nodes */
77 Agnode_t *node = NULL;
78 for (node = agfstnode(dag_dot); node; node = agnxtnode(dag_dot, node)) {
79 char *name = agnameof(node);
80 double amount = atof(agget(node, (char *) "size"));
82 if (!(task = (SD_task_t)xbt_dict_get_or_null(jobs, name))) {
83 if (seq_or_par == sequential){
84 XBT_DEBUG("See <job id=%s amount =%.0f>", name, amount);
85 task = SD_task_create_comp_seq(name, NULL , amount);
87 double alpha = atof(agget(node, (char *) "alpha"));
88 XBT_DEBUG("See <job id=%s amount =%.0f alpha = %.3f>", name, amount, alpha);
89 task = SD_task_create_comp_par_amdahl(name, NULL , amount, alpha);
92 xbt_dict_set(jobs, name, task, NULL);
94 if (strcmp(name,"root") && strcmp(name,"end"))
95 xbt_dynar_push(result, &task);
97 if((seq_or_par == sequential) &&
98 ((schedule && schedule_success) || XBT_LOG_ISENABLED(sd_dotparse, xbt_log_priority_verbose))){
99 /* try to take the information to schedule the task only if all is right*/
100 char *char_performer = agget(node, (char *) "performer");
101 char *char_order = agget(node, (char *) "order");
102 /* Tasks will execute on in a given "order" on a given set of "performer" hosts */
103 int performer = ((!char_performer || !strcmp(char_performer,"")) ? -1:atoi(char_performer));
104 int order = ((!char_order || !strcmp(char_order, ""))? -1:atoi(char_order));
106 if((performer != -1 && order != -1) && performer < (int) sg_host_count()){
107 /* required parameters are given and less performers than hosts are required */
108 XBT_DEBUG ("Task '%s' is scheduled on workstation '%d' in position '%d'", task->name, performer, order);
109 if(!(computer = (xbt_dynar_t) xbt_dict_get_or_null(computers, char_performer))){
110 computer = xbt_dynar_new(sizeof(SD_task_t), NULL);
111 xbt_dict_set(computers, char_performer, computer, NULL);
114 if((unsigned int)order < xbt_dynar_length(computer)){
115 SD_task_t *task_test = (SD_task_t *)xbt_dynar_get_ptr(computer,order);
116 if(*task_test && *task_test != task){
117 /* the user gave the same order to several tasks */
118 schedule_success = false;
119 XBT_VERB("Task '%s' wants to start on performer '%s' at the same position '%s' as task '%s'",
120 (*task_test)->name, char_performer, char_order, task->name);
124 /* the parameter seems to be ok */
125 xbt_dynar_set_as(computer, order, SD_task_t, task);
127 /* one of required parameters is not given */
128 schedule_success = false;
129 XBT_VERB("The schedule is ignored, task '%s' can not be scheduled on %d hosts", task->name, performer);
133 XBT_WARN("Task '%s' is defined more than once", name);
137 /*Check if 'root' and 'end' nodes have been explicitly declared. If not, create them. */
138 if (!(root = (SD_task_t)xbt_dict_get_or_null(jobs, "root")))
139 root = (seq_or_par == sequential?SD_task_create_comp_seq("root", NULL, 0):
140 SD_task_create_comp_par_amdahl("root", NULL, 0, 0));
142 SD_task_set_state(root, SD_SCHEDULABLE); /* by design the root task is always SCHEDULABLE */
143 xbt_dynar_insert_at(result, 0, &root); /* Put it at the beginning of the dynar */
145 if (!(end = (SD_task_t)xbt_dict_get_or_null(jobs, "end")))
146 end = (seq_or_par == sequential?SD_task_create_comp_seq("end", NULL, 0):
147 SD_task_create_comp_par_amdahl("end", NULL, 0, 0));
150 xbt_dynar_t edges = xbt_dynar_new(sizeof(Agedge_t*), NULL);
151 for (node = agfstnode(dag_dot); node; node = agnxtnode(dag_dot, node)) {
153 xbt_dynar_reset(edges);
154 for (edge = agfstout(dag_dot, node); edge; edge = agnxtout(dag_dot, edge))
155 xbt_dynar_push_as(edges, Agedge_t *, edge);
157 /* Be sure edges are sorted */
158 xbt_dynar_sort(edges, edge_compare);
160 xbt_dynar_foreach(edges, i, edge) {
162 char *src_name=agnameof(agtail(edge)), *dst_name=agnameof(aghead(edge));
163 double size = atof(agget(edge, (char *) "size"));
165 src = (SD_task_t)xbt_dict_get_or_null(jobs, src_name);
166 dst = (SD_task_t)xbt_dict_get_or_null(jobs, dst_name);
169 char *name = (char*)xbt_malloc((strlen(src_name)+strlen(dst_name)+6)*sizeof(char));
170 sprintf(name, "%s->%s", src_name, dst_name);
171 XBT_DEBUG("See <transfer id=%s amount = %.0f>", name, size);
172 if (!(task = (SD_task_t)xbt_dict_get_or_null(jobs, name))) {
173 if (seq_or_par == sequential)
174 task = SD_task_create_comm_e2e(name, NULL , size);
176 task = SD_task_create_comm_par_mxn_1d_block(name, NULL , size);
177 SD_task_dependency_add(NULL, NULL, src, task);
178 SD_task_dependency_add(NULL, NULL, task, dst);
179 xbt_dict_set(jobs, name, task, NULL);
180 xbt_dynar_push(result, &task);
182 XBT_WARN("Task '%s' is defined more than once", name);
186 SD_task_dependency_add(NULL, NULL, src, dst);
190 xbt_dynar_free(&edges);
192 XBT_DEBUG("All tasks have been created, put %s at the end of the dynar", end->name);
193 xbt_dynar_push(result, &end);
195 /* Connect entry tasks to 'root', and exit tasks to 'end'*/
196 xbt_dynar_foreach (result, i, task){
197 if (xbt_dynar_is_empty(task->tasks_before) && task != root) {
198 XBT_DEBUG("Task '%s' has no source. Add dependency from 'root'", task->name);
199 SD_task_dependency_add(NULL, NULL, root, task);
202 if (xbt_dynar_is_empty(task->tasks_after) && task != end) {
203 XBT_DEBUG("Task '%s' has no destination. Add dependency to 'end'", task->name);
204 SD_task_dependency_add(NULL, NULL, task, end);
209 xbt_dict_free(&jobs);
214 if (schedule_success) {
215 const sg_host_t *workstations = sg_host_list ();
216 xbt_dict_foreach(computers,dict_cursor,computer_name,computer){
217 SD_task_t previous_task = NULL;
218 xbt_dynar_foreach(computer, i, task){
219 /* add dependency between the previous and the task to avoid parallel execution */
221 if(previous_task && !SD_task_dependency_exists(previous_task, task))
222 SD_task_dependency_add(NULL, NULL, previous_task, task);
224 SD_task_schedulel(task, 1, workstations[atoi(computer_name)]);
225 previous_task = task;
228 xbt_dynar_free(&computer);
230 xbt_dict_free(&computers);
232 XBT_WARN("The scheduling is ignored");
233 xbt_dict_foreach(computers,dict_cursor,computer_name,computer)
234 xbt_dynar_free(&computer);
235 xbt_dict_free(&computers);
236 xbt_dynar_free(&result);
241 if (result && !acyclic_graph_detail(result)) {
242 XBT_ERROR("The DOT described in %s is not a DAG. It contains a cycle.", xbt_basename((char*)filename));
243 xbt_dynar_free(&result);