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"
11 #include "xbt/file.h" /* xbt_basename() */
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(sd_daxparse, sd, "Parsing DAX files");
18 #define register /* g++ don't like register, so don't say it */
23 bool children_are_marked(SD_task_t task);
24 bool parents_are_marked(SD_task_t task);
28 static double dax_parse_double(const char *string)
33 ret = sscanf(string, "%lg", &value);
34 xbt_assert (ret == 1, "Parse error on line %d: %s is not a double", dax_lineno, string);
38 /* Ensure that transfer tasks have unique names even though a file is used several times */
40 void uniq_transfer_task_name(SD_task_t task)
42 SD_task_t child, parent;
43 xbt_dynar_t children, parents;
46 children = SD_task_get_children(task);
47 parents = SD_task_get_parents(task);
49 xbt_dynar_get_cpy(children, 0, &child);
50 xbt_dynar_get_cpy(parents, 0, &parent);
52 new_name = bprintf("%s_%s_%s", SD_task_get_name(parent), SD_task_get_name(task), SD_task_get_name(child));
54 SD_task_set_name(task, new_name);
56 xbt_dynar_free_container(&children);
57 xbt_dynar_free_container(&parents);
61 bool children_are_marked(SD_task_t task){
62 SD_task_t child_task = NULL;
63 bool all_marked = true;
64 SD_dependency_t depafter = NULL;
66 xbt_dynar_foreach(task->tasks_after,count,depafter){
67 child_task = depafter->dst;
69 if(child_task->marked == 0) {
78 bool parents_are_marked(SD_task_t task){
79 SD_task_t parent_task = NULL;
80 bool all_marked = true;
81 SD_dependency_t depbefore = NULL;
83 xbt_dynar_foreach(task->tasks_before,count,depbefore){
84 parent_task = depbefore->src;
86 if(parent_task->marked == 0) {
95 bool acyclic_graph_detail(xbt_dynar_t dag){
96 unsigned int count=0, count_current=0;
97 bool all_marked = true;
98 SD_task_t task = NULL, parent_task = NULL, child_task = NULL;
99 SD_dependency_t depbefore = NULL, depafter = NULL;
100 xbt_dynar_t next = NULL, current = xbt_dynar_new(sizeof(SD_task_t),NULL);
102 xbt_dynar_foreach(dag,count,task){
103 if(task->kind == SD_TASK_COMM_E2E) continue;
105 if(xbt_dynar_is_empty(task->tasks_after)){
106 xbt_dynar_push(current, &task);
111 //test if something has to be done for the next iteration
112 while(!xbt_dynar_is_empty(current)){
113 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
114 //test if the current iteration is done
116 xbt_dynar_foreach(current,count_current,task){
117 if (task == NULL) continue;
122 xbt_dynar_foreach(task->tasks_before,count,depbefore){
123 parent_task = depbefore->src;
124 if(parent_task->kind == SD_TASK_COMM_E2E){
126 parent_task->marked = 1;
127 SD_task_t parent_task_2 = NULL;
128 xbt_dynar_foreach(parent_task->tasks_before,j,depbefore){
129 parent_task_2 = depbefore->src;
130 if(children_are_marked(parent_task_2))
131 xbt_dynar_push(next, &parent_task_2);
134 if(children_are_marked(parent_task))
135 xbt_dynar_push(next, &parent_task);
142 xbt_dynar_free(¤t);
146 xbt_dynar_free(¤t);
149 xbt_dynar_foreach(dag,count,task){
150 if(task->kind == SD_TASK_COMM_E2E) continue;
151 //test if all tasks are marked
152 if(task->marked == 0){
153 XBT_WARN("the task %s is not marked",task->name);
160 XBT_VERB("there is at least one cycle in your task graph");
162 current = xbt_dynar_new(sizeof(SD_task_t),NULL);
163 xbt_dynar_foreach(dag,count,task){
164 if(task->kind == SD_TASK_COMM_E2E) continue;
165 if(xbt_dynar_is_empty(task->tasks_before)){
166 xbt_dynar_push(current, &task);
172 xbt_dynar_foreach(dag,count,task){
173 if(task->kind == SD_TASK_COMM_E2E) continue;
174 if(xbt_dynar_is_empty(task->tasks_before)){
176 xbt_dynar_push(current, &task);
181 //test if something has to be done for the next iteration
182 while(!xbt_dynar_is_empty(current)){
183 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
184 //test if the current iteration is done
186 xbt_dynar_foreach(current,count_current,task){
187 if (task == NULL) continue;
192 xbt_dynar_foreach(task->tasks_after,count,depafter){
193 child_task = depbefore->dst;
194 if(child_task->kind == SD_TASK_COMM_E2E){
196 child_task->marked = 1;
197 SD_task_t child_task_2 = NULL;
198 xbt_dynar_foreach(child_task->tasks_after,j,depafter){
199 child_task_2 = depbefore->dst;
200 if(parents_are_marked(child_task_2))
201 xbt_dynar_push(next, &child_task_2);
204 if(parents_are_marked(child_task))
205 xbt_dynar_push(next, &child_task);
212 xbt_dynar_free(¤t);
216 xbt_dynar_free(¤t);
219 xbt_dynar_foreach(dag,count,task){
220 if(task->kind == SD_TASK_COMM_E2E) continue;
221 //test if all tasks are marked
222 if(task->marked == 0){
223 XBT_WARN("the task %s is in a cycle",task->name);
233 static YY_BUFFER_STATE input_buffer;
235 static xbt_dynar_t result;
236 static xbt_dict_t jobs;
237 static xbt_dict_t files;
238 static SD_task_t current_job;
239 static SD_task_t root_task, end_task;
241 static void dax_task_free(void *task)
243 SD_task_destroy((SD_task_t)task);
246 /** @brief loads a DAX file describing a DAG
248 * See https://confluence.pegasus.isi.edu/display/pegasus/WorkflowGenerator for more details.
250 xbt_dynar_t SD_daxload(const char *filename)
252 xbt_dict_cursor_t cursor;
255 FILE *in_file = fopen(filename, "r");
256 xbt_assert(in_file, "Unable to open \"%s\"\n", filename);
257 input_buffer = dax__create_buffer(in_file, 10);
258 dax__switch_to_buffer(input_buffer);
261 result = xbt_dynar_new(sizeof(SD_task_t), dax_task_free);
262 files = xbt_dict_new_homogeneous(&dax_task_free);
263 jobs = xbt_dict_new_homogeneous(NULL);
264 root_task = SD_task_create_comp_seq("root", NULL, 0);
265 /* by design the root task is always SCHEDULABLE */
266 SD_task_set_state(root_task, SD_SCHEDULABLE);
268 xbt_dynar_push(result, &root_task);
269 end_task = SD_task_create_comp_seq("end", NULL, 0);
273 xbt_die("Parse error in %s: %s", filename, dax__parse_err_msg());
274 dax__delete_buffer(input_buffer);
277 xbt_dict_free(&jobs);
279 /* And now, post-process the files.
280 * We want a file task per pair of computation tasks exchanging the file. Duplicate on need
281 * Files not produced in the system are said to be produced by root task (top of DAG).
282 * Files not consumed in the system are said to be consumed by end task (bottom of DAG).
285 xbt_dict_foreach(files, cursor, name, file) {
286 unsigned int cpt1, cpt2;
288 SD_dependency_t depbefore, depafter;
289 if (xbt_dynar_is_empty(file->tasks_before)) {
290 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
291 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
292 SD_task_dependency_add(NULL, NULL, root_task, newfile);
293 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
294 xbt_dynar_push(result, &newfile);
296 } else if (xbt_dynar_is_empty(file->tasks_after)) {
297 xbt_dynar_foreach(file->tasks_before, cpt2, depbefore) {
298 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
299 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
300 SD_task_dependency_add(NULL, NULL, newfile, end_task);
301 xbt_dynar_push(result, &newfile);
304 xbt_dynar_foreach(file->tasks_before, cpt1, depbefore) {
305 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
306 if (depbefore->src == depafter->dst) {
308 ("File %s is produced and consumed by task %s."
309 "This loop dependency will prevent the execution of the task.", file->name, depbefore->src->name);
311 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
312 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
313 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
314 xbt_dynar_push(result, &newfile);
320 /* Push end task last */
321 xbt_dynar_push(result, &end_task);
323 /* Free previous copy of the files */
324 xbt_dict_free(&files);
326 xbt_dynar_foreach(result, cpt, file) {
327 if (SD_task_get_kind(file) == SD_TASK_COMM_E2E) {
328 uniq_transfer_task_name(file);
329 } else if (SD_task_get_kind(file) == SD_TASK_COMP_SEQ){
330 /* If some tasks do not take files as input, connect them to the root, if
331 * they don't produce files, connect them to the end node.
333 if ((file != root_task) && xbt_dynar_is_empty(file->tasks_before)) {
334 SD_task_dependency_add(NULL, NULL, root_task, file);
336 if ((file != end_task) && xbt_dynar_is_empty(file->tasks_after)) {
337 SD_task_dependency_add(NULL, NULL, file, end_task);
342 if (!acyclic_graph_detail(result)){
343 XBT_ERROR("The DAX described in %s is not a DAG. It contains a cycle.", xbt_basename(filename));
344 xbt_dynar_foreach(result, cpt, file)
345 SD_task_destroy(file);
346 xbt_dynar_free_container(&result);
353 void STag_dax__adag(void)
355 XBT_ATTRIB_UNUSED double version;
356 version = dax_parse_double(A_dax__adag_version);
358 xbt_assert(version == 2.1, "Expected version 2.1 in <adag> tag, got %f. Fix the parser or your file", version);
361 void STag_dax__job(void)
363 double runtime = dax_parse_double(A_dax__job_runtime);
364 char *name = bprintf("%s@%s", A_dax__job_id, A_dax__job_name);
365 runtime *= 4200000000.; /* Assume that timings were done on a 4.2GFlops machine. I mean, why not? */
366 // XBT_INFO("See <job id=%s runtime=%s %.0f>",A_dax__job_id,A_dax__job_runtime,runtime);
367 current_job = SD_task_create_comp_seq(name, NULL, runtime);
368 xbt_dict_set(jobs, A_dax__job_id, current_job, NULL);
370 xbt_dynar_push(result, ¤t_job);
373 void STag_dax__uses(void)
376 double size = dax_parse_double(A_dax__uses_size);
377 int is_input = (A_dax__uses_link == A_dax__uses_link_input);
379 // XBT_INFO("See <uses file=%s %s>",A_dax__uses_file,(is_input?"in":"out"));
380 file = (SD_task_t)xbt_dict_get_or_null(files, A_dax__uses_file);
382 file = SD_task_create_comm_e2e(A_dax__uses_file, NULL, size);
383 xbt_dynar_pop(sd_global->initial_task_set,NULL);
384 xbt_dict_set(files, A_dax__uses_file, file, NULL);
386 if (SD_task_get_amount(file) != size) {
387 XBT_WARN("Ignore file %s size redefinition from %.0f to %.0f", A_dax__uses_file, SD_task_get_amount(file), size);
391 SD_task_dependency_add(NULL, NULL, file, current_job);
393 SD_task_dependency_add(NULL, NULL, current_job, file);
394 if (xbt_dynar_length(file->tasks_before) > 1) {
395 XBT_WARN("File %s created at more than one location...", file->name);
400 static SD_task_t current_child;
401 void STag_dax__child(void)
403 current_child = (SD_task_t)xbt_dict_get_or_null(jobs, A_dax__child_ref);
404 xbt_assert(current_child != NULL,"Parse error on line %d: Asked to add dependencies to the non-existent %s task",
405 dax_lineno, A_dax__child_ref);
408 void ETag_dax__child(void)
410 current_child = NULL;
413 void STag_dax__parent(void)
415 SD_task_t parent = (SD_task_t)xbt_dict_get_or_null(jobs, A_dax__parent_ref);
416 xbt_assert(parent != NULL, "Parse error on line %d: Asked to add a dependency from %s to %s, but %s does not exist",
417 dax_lineno, current_child->name, A_dax__parent_ref, A_dax__parent_ref);
418 SD_task_dependency_add(NULL, NULL, parent, current_child);
419 XBT_DEBUG("Control-flow dependency from %s to %s", current_child->name, parent->name);
422 void ETag_dax__adag(void)
424 // XBT_INFO("See </adag>");
427 void ETag_dax__job(void)
430 // XBT_INFO("See </job>");
433 void ETag_dax__parent(void)
435 // XBT_INFO("See </parent>");
438 void ETag_dax__uses(void)
440 // XBT_INFO("See </uses>");