1 /* Copyright (c) 2009-2014. 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. */
8 #include "simdag/simdag.h"
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(sd_daxparse, sd, "Parsing DAX files");
19 bool children_are_marked(SD_task_t task);
20 bool parents_are_marked(SD_task_t task);
23 static void dax_parse_error(char *msg)
25 fprintf(stderr, "Parse error on line %d: %s\n", dax_lineno, msg);
29 static double dax_parse_double(const char *string)
34 ret = sscanf(string, "%lg", &value);
36 dax_parse_error(bprintf("%s is not a double", string));
40 /* Ensure that transfer tasks have unique names even though a file is used
43 void uniq_transfer_task_name(SD_task_t task)
45 SD_task_t child, parent;
46 xbt_dynar_t children, parents;
49 children = SD_task_get_children(task);
50 parents = SD_task_get_parents(task);
52 xbt_dynar_get_cpy(children, 0, &child);
53 xbt_dynar_get_cpy(parents, 0, &parent);
55 new_name = bprintf("%s_%s_%s",
56 SD_task_get_name(parent),
57 SD_task_get_name(task), SD_task_get_name(child));
59 SD_task_set_name(task, new_name);
61 xbt_dynar_free_container(&children);
62 xbt_dynar_free_container(&parents);
66 bool children_are_marked(SD_task_t task){
67 SD_task_t child_task = NULL;
68 bool all_marked = true;
69 SD_dependency_t depafter = NULL;
71 xbt_dynar_foreach(task->tasks_after,count,depafter){
72 child_task = depafter->dst;
74 if(child_task->marked == 0) {
83 bool parents_are_marked(SD_task_t task){
84 SD_task_t parent_task = NULL;
85 bool all_marked = true;
86 SD_dependency_t depbefore = NULL;
88 xbt_dynar_foreach(task->tasks_before,count,depbefore){
89 parent_task = depbefore->src;
91 if(parent_task->marked == 0) {
100 bool acyclic_graph_detail(xbt_dynar_t dag){
101 unsigned int count=0, count_current=0;
102 bool all_marked = true;
103 SD_task_t task = NULL, parent_task = NULL, child_task = NULL;
104 SD_dependency_t depbefore = NULL, depafter = NULL;
105 xbt_dynar_t next = NULL, current = xbt_dynar_new(sizeof(SD_task_t),NULL);
107 xbt_dynar_foreach(dag,count,task){
108 if(task->kind == SD_TASK_COMM_E2E) continue;
110 if(xbt_dynar_is_empty(task->tasks_after)){
111 xbt_dynar_push(current, &task);
116 //test if something has to be done for the next iteration
117 while(!xbt_dynar_is_empty(current)){
118 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
119 //test if the current iteration is done
121 xbt_dynar_foreach(current,count_current,task){
122 if (task == NULL) continue;
127 xbt_dynar_foreach(task->tasks_before,count,depbefore){
128 parent_task = depbefore->src;
129 if(parent_task->kind == SD_TASK_COMM_E2E){
131 parent_task->marked = 1;
132 SD_task_t parent_task_2 = NULL;
133 xbt_dynar_foreach(parent_task->tasks_before,j,depbefore){
134 parent_task_2 = depbefore->src;
135 if(children_are_marked(parent_task_2))
136 xbt_dynar_push(next, &parent_task_2);
139 if(children_are_marked(parent_task))
140 xbt_dynar_push(next, &parent_task);
147 xbt_dynar_free(¤t);
151 xbt_dynar_free(¤t);
154 xbt_dynar_foreach(dag,count,task){
155 if(task->kind == SD_TASK_COMM_E2E) continue;
156 //test if all tasks are marked
157 if(task->marked == 0){
158 XBT_WARN("the task %s is not marked",task->name);
165 XBT_VERB("there is at least one cycle in your task graph");
167 current = xbt_dynar_new(sizeof(SD_task_t),NULL);
168 xbt_dynar_foreach(dag,count,task){
169 if(task->kind == SD_TASK_COMM_E2E) continue;
170 if(xbt_dynar_is_empty(task->tasks_before)){
171 xbt_dynar_push(current, &task);
177 xbt_dynar_foreach(dag,count,task){
178 if(task->kind == SD_TASK_COMM_E2E) continue;
179 if(xbt_dynar_is_empty(task->tasks_before)){
181 xbt_dynar_push(current, &task);
186 //test if something has to be done for the next iteration
187 while(!xbt_dynar_is_empty(current)){
188 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
189 //test if the current iteration is done
191 xbt_dynar_foreach(current,count_current,task){
192 if (task == NULL) continue;
197 xbt_dynar_foreach(task->tasks_after,count,depafter){
198 child_task = depbefore->dst;
199 if(child_task->kind == SD_TASK_COMM_E2E){
201 child_task->marked = 1;
202 SD_task_t child_task_2 = NULL;
203 xbt_dynar_foreach(child_task->tasks_after,j,depafter){
204 child_task_2 = depbefore->dst;
205 if(parents_are_marked(child_task_2))
206 xbt_dynar_push(next, &child_task_2);
209 if(parents_are_marked(child_task))
210 xbt_dynar_push(next, &child_task);
217 xbt_dynar_free(¤t);
221 xbt_dynar_free(¤t);
224 xbt_dynar_foreach(dag,count,task){
225 if(task->kind == SD_TASK_COMM_E2E) continue;
226 //test if all tasks are marked
227 if(task->marked == 0){
228 XBT_WARN("the task %s is in a cycle",task->name);
238 static YY_BUFFER_STATE input_buffer;
240 static xbt_dynar_t result;
241 static xbt_dict_t jobs;
242 static xbt_dict_t files;
243 static SD_task_t current_job;
244 static SD_task_t root_task, end_task;
246 static void dax_task_free(void *task)
252 /** @brief loads a DAX file describing a DAG
254 * See https://confluence.pegasus.isi.edu/display/pegasus/WorkflowGenerator
257 xbt_dynar_t SD_daxload(const char *filename)
259 xbt_dict_cursor_t cursor;
262 FILE *in_file = fopen(filename, "r");
263 xbt_assert(in_file, "Unable to open \"%s\"\n", filename);
264 input_buffer = dax__create_buffer(in_file, 10);
265 dax__switch_to_buffer(input_buffer);
268 result = xbt_dynar_new(sizeof(SD_task_t), dax_task_free);
269 files = xbt_dict_new_homogeneous(&dax_task_free);
270 jobs = xbt_dict_new_homogeneous(NULL);
271 root_task = SD_task_create_comp_seq("root", NULL, 0);
272 /* by design the root task is always SCHEDULABLE */
273 __SD_task_set_state(root_task, SD_SCHEDULABLE);
275 xbt_dynar_push(result, &root_task);
276 end_task = SD_task_create_comp_seq("end", NULL, 0);
280 xbt_die("Parse error in %s: %s", filename, dax__parse_err_msg());
281 dax__delete_buffer(input_buffer);
284 xbt_dict_free(&jobs);
286 /* And now, post-process the files.
287 * We want a file task per pair of computation tasks exchanging the file. Duplicate on need
288 * Files not produced in the system are said to be produced by root task (top of DAG).
289 * Files not consumed in the system are said to be consumed by end task (bottom of DAG).
292 xbt_dict_foreach(files, cursor, name, file) {
293 unsigned int cpt1, cpt2;
295 SD_dependency_t depbefore, depafter;
296 if (xbt_dynar_is_empty(file->tasks_before)) {
297 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
298 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
299 SD_task_dependency_add(NULL, NULL, root_task, newfile);
300 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
303 const char *category = depafter->src->category;
305 TRACE_category (category);
306 TRACE_sd_set_task_category(newfile, category);
310 xbt_dynar_push(result, &newfile);
312 } else if (xbt_dynar_is_empty(file->tasks_after)) {
313 xbt_dynar_foreach(file->tasks_before, cpt2, depbefore) {
314 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
315 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
316 SD_task_dependency_add(NULL, NULL, newfile, end_task);
319 const char *category = depbefore->src->category;
321 TRACE_category (category);
322 TRACE_sd_set_task_category(newfile, category);
326 xbt_dynar_push(result, &newfile);
329 xbt_dynar_foreach(file->tasks_before, cpt1, depbefore) {
330 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
331 if (depbefore->src == depafter->dst) {
333 ("File %s is produced and consumed by task %s. This loop dependency will prevent the execution of the task.",
334 file->name, depbefore->src->name);
336 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
337 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
338 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
341 const char *category = depbefore->src->category;
343 TRACE_category (category);
344 TRACE_sd_set_task_category(newfile, category);
348 xbt_dynar_push(result, &newfile);
354 /* Push end task last */
355 xbt_dynar_push(result, &end_task);
357 /* Free previous copy of the files */
358 xbt_dict_free(&files);
360 xbt_dynar_foreach(result, cpt, file) {
361 if (SD_task_get_kind(file) == SD_TASK_COMM_E2E) {
362 uniq_transfer_task_name(file);
363 } else if (SD_task_get_kind(file) == SD_TASK_COMP_SEQ){
364 /* If some tasks do not take files as input, connect them to the root, if
365 * they don't produce files, connect them to the end node.
367 if ((file != root_task) && xbt_dynar_is_empty(file->tasks_before)) {
368 SD_task_dependency_add(NULL, NULL, root_task, file);
370 if ((file != end_task) && xbt_dynar_is_empty(file->tasks_after)) {
371 SD_task_dependency_add(NULL, NULL, file, end_task);
376 if (!acyclic_graph_detail(result)){
377 XBT_ERROR("The DAX described in %s is not a DAG. It contains a cycle.",
378 basename((char*)filename));
379 xbt_dynar_foreach(result, cpt, file)
380 SD_task_destroy(file);
381 xbt_dynar_free_container(&result);
388 void STag_dax__adag(void)
390 _XBT_GNUC_UNUSED double version;
391 version = dax_parse_double(A_dax__adag_version);
393 xbt_assert(version == 2.1,
394 "Expected version 2.1 in <adag> tag, got %f. Fix the parser or your file",
398 void STag_dax__job(void)
400 double runtime = dax_parse_double(A_dax__job_runtime);
401 char *name = bprintf("%s@%s", A_dax__job_id, A_dax__job_name);
402 runtime *= 4200000000.; /* Assume that timings were done on a 4.2GFlops machine. I mean, why not? */
403 // XBT_INFO("See <job id=%s runtime=%s %.0f>",A_dax__job_id,A_dax__job_runtime,runtime);
404 current_job = SD_task_create_comp_seq(name, NULL, runtime);
406 char *category = A_dax__job_name;
408 TRACE_category (category);
409 TRACE_sd_set_task_category(current_job, category);
412 xbt_dict_set(jobs, A_dax__job_id, current_job, NULL);
414 xbt_dynar_push(result, ¤t_job);
417 void STag_dax__uses(void)
420 double size = dax_parse_double(A_dax__uses_size);
421 int is_input = (A_dax__uses_link == A_dax__uses_link_input);
423 // XBT_INFO("See <uses file=%s %s>",A_dax__uses_file,(is_input?"in":"out"));
424 file = xbt_dict_get_or_null(files, A_dax__uses_file);
426 file = SD_task_create_comm_e2e(A_dax__uses_file, NULL, size);
427 xbt_dict_set(files, A_dax__uses_file, file, NULL);
429 if (SD_task_get_amount(file) != size) {
430 XBT_WARN("Ignoring file %s size redefinition from %.0f to %.0f",
431 A_dax__uses_file, SD_task_get_amount(file), size);
435 SD_task_dependency_add(NULL, NULL, file, current_job);
437 SD_task_dependency_add(NULL, NULL, current_job, file);
438 if (xbt_dynar_length(file->tasks_before) > 1) {
439 XBT_WARN("File %s created at more than one location...", file->name);
444 static SD_task_t current_child;
445 void STag_dax__child(void)
447 current_child = xbt_dict_get_or_null(jobs, A_dax__child_ref);
448 if (current_child == NULL)
449 dax_parse_error(bprintf
450 ("Asked to add dependencies to the non-existent %s task",
454 void ETag_dax__child(void)
456 current_child = NULL;
459 void STag_dax__parent(void)
461 SD_task_t parent = xbt_dict_get_or_null(jobs, A_dax__parent_ref);
463 dax_parse_error(bprintf
464 ("Asked to add a dependency from %s to %s, but %s does not exist",
465 current_child->name, A_dax__parent_ref,
467 SD_task_dependency_add(NULL, NULL, parent, current_child);
468 XBT_DEBUG("Control-flow dependency from %s to %s", current_child->name,
472 void ETag_dax__adag(void)
474 // XBT_INFO("See </adag>");
477 void ETag_dax__job(void)
480 // XBT_INFO("See </job>");
483 void ETag_dax__parent(void)
485 // XBT_INFO("See </parent>");
488 void ETag_dax__uses(void)
490 // XBT_INFO("See </uses>");