1 /* Copyright (c) 2009-2015. 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 "simgrid/simdag.h"
12 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(sd_daxparse, sd, "Parsing DAX files");
18 bool children_are_marked(SD_task_t task);
19 bool parents_are_marked(SD_task_t task);
22 static void dax_parse_error(char *msg)
24 fprintf(stderr, "Parse error on line %d: %s\n", dax_lineno, msg);
28 static double dax_parse_double(const char *string)
33 ret = sscanf(string, "%lg", &value);
35 dax_parse_error(bprintf("%s is not a double", string));
39 /* Ensure that transfer tasks have unique names even though a file is used
42 void uniq_transfer_task_name(SD_task_t task)
44 SD_task_t child, parent;
45 xbt_dynar_t children, parents;
48 children = SD_task_get_children(task);
49 parents = SD_task_get_parents(task);
51 xbt_dynar_get_cpy(children, 0, &child);
52 xbt_dynar_get_cpy(parents, 0, &parent);
54 new_name = bprintf("%s_%s_%s",
55 SD_task_get_name(parent),
56 SD_task_get_name(task), SD_task_get_name(child));
58 SD_task_set_name(task, new_name);
60 xbt_dynar_free_container(&children);
61 xbt_dynar_free_container(&parents);
65 bool children_are_marked(SD_task_t task){
66 SD_task_t child_task = NULL;
67 bool all_marked = true;
68 SD_dependency_t depafter = NULL;
70 xbt_dynar_foreach(task->tasks_after,count,depafter){
71 child_task = depafter->dst;
73 if(child_task->marked == 0) {
82 bool parents_are_marked(SD_task_t task){
83 SD_task_t parent_task = NULL;
84 bool all_marked = true;
85 SD_dependency_t depbefore = NULL;
87 xbt_dynar_foreach(task->tasks_before,count,depbefore){
88 parent_task = depbefore->src;
90 if(parent_task->marked == 0) {
99 bool acyclic_graph_detail(xbt_dynar_t dag){
100 unsigned int count=0, count_current=0;
101 bool all_marked = true;
102 SD_task_t task = NULL, parent_task = NULL, child_task = NULL;
103 SD_dependency_t depbefore = NULL, depafter = NULL;
104 xbt_dynar_t next = NULL, current = xbt_dynar_new(sizeof(SD_task_t),NULL);
106 xbt_dynar_foreach(dag,count,task){
107 if(task->kind == SD_TASK_COMM_E2E) continue;
109 if(xbt_dynar_is_empty(task->tasks_after)){
110 xbt_dynar_push(current, &task);
115 //test if something has to be done for the next iteration
116 while(!xbt_dynar_is_empty(current)){
117 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
118 //test if the current iteration is done
120 xbt_dynar_foreach(current,count_current,task){
121 if (task == NULL) continue;
126 xbt_dynar_foreach(task->tasks_before,count,depbefore){
127 parent_task = depbefore->src;
128 if(parent_task->kind == SD_TASK_COMM_E2E){
130 parent_task->marked = 1;
131 SD_task_t parent_task_2 = NULL;
132 xbt_dynar_foreach(parent_task->tasks_before,j,depbefore){
133 parent_task_2 = depbefore->src;
134 if(children_are_marked(parent_task_2))
135 xbt_dynar_push(next, &parent_task_2);
138 if(children_are_marked(parent_task))
139 xbt_dynar_push(next, &parent_task);
146 xbt_dynar_free(¤t);
150 xbt_dynar_free(¤t);
153 xbt_dynar_foreach(dag,count,task){
154 if(task->kind == SD_TASK_COMM_E2E) continue;
155 //test if all tasks are marked
156 if(task->marked == 0){
157 XBT_WARN("the task %s is not marked",task->name);
164 XBT_VERB("there is at least one cycle in your task graph");
166 current = xbt_dynar_new(sizeof(SD_task_t),NULL);
167 xbt_dynar_foreach(dag,count,task){
168 if(task->kind == SD_TASK_COMM_E2E) continue;
169 if(xbt_dynar_is_empty(task->tasks_before)){
170 xbt_dynar_push(current, &task);
176 xbt_dynar_foreach(dag,count,task){
177 if(task->kind == SD_TASK_COMM_E2E) continue;
178 if(xbt_dynar_is_empty(task->tasks_before)){
180 xbt_dynar_push(current, &task);
185 //test if something has to be done for the next iteration
186 while(!xbt_dynar_is_empty(current)){
187 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
188 //test if the current iteration is done
190 xbt_dynar_foreach(current,count_current,task){
191 if (task == NULL) continue;
196 xbt_dynar_foreach(task->tasks_after,count,depafter){
197 child_task = depbefore->dst;
198 if(child_task->kind == SD_TASK_COMM_E2E){
200 child_task->marked = 1;
201 SD_task_t child_task_2 = NULL;
202 xbt_dynar_foreach(child_task->tasks_after,j,depafter){
203 child_task_2 = depbefore->dst;
204 if(parents_are_marked(child_task_2))
205 xbt_dynar_push(next, &child_task_2);
208 if(parents_are_marked(child_task))
209 xbt_dynar_push(next, &child_task);
216 xbt_dynar_free(¤t);
220 xbt_dynar_free(¤t);
223 xbt_dynar_foreach(dag,count,task){
224 if(task->kind == SD_TASK_COMM_E2E) continue;
225 //test if all tasks are marked
226 if(task->marked == 0){
227 XBT_WARN("the task %s is in a cycle",task->name);
237 static YY_BUFFER_STATE input_buffer;
239 static xbt_dynar_t result;
240 static xbt_dict_t jobs;
241 static xbt_dict_t files;
242 static SD_task_t current_job;
243 static SD_task_t root_task, end_task;
245 static void dax_task_free(void *task)
251 /** @brief loads a DAX file describing a DAG
253 * See https://confluence.pegasus.isi.edu/display/pegasus/WorkflowGenerator
256 xbt_dynar_t SD_daxload(const char *filename)
258 xbt_dict_cursor_t cursor;
261 FILE *in_file = fopen(filename, "r");
262 xbt_assert(in_file, "Unable to open \"%s\"\n", filename);
263 input_buffer = dax__create_buffer(in_file, 10);
264 dax__switch_to_buffer(input_buffer);
267 result = xbt_dynar_new(sizeof(SD_task_t), dax_task_free);
268 files = xbt_dict_new_homogeneous(&dax_task_free);
269 jobs = xbt_dict_new_homogeneous(NULL);
270 root_task = SD_task_create_comp_seq("root", NULL, 0);
271 /* by design the root task is always SCHEDULABLE */
272 __SD_task_set_state(root_task, SD_SCHEDULABLE);
274 xbt_dynar_push(result, &root_task);
275 end_task = SD_task_create_comp_seq("end", NULL, 0);
279 xbt_die("Parse error in %s: %s", filename, dax__parse_err_msg());
280 dax__delete_buffer(input_buffer);
283 xbt_dict_free(&jobs);
285 /* And now, post-process the files.
286 * We want a file task per pair of computation tasks exchanging the file. Duplicate on need
287 * Files not produced in the system are said to be produced by root task (top of DAG).
288 * Files not consumed in the system are said to be consumed by end task (bottom of DAG).
291 xbt_dict_foreach(files, cursor, name, file) {
292 unsigned int cpt1, cpt2;
294 SD_dependency_t depbefore, depafter;
295 if (xbt_dynar_is_empty(file->tasks_before)) {
296 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
297 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
298 SD_task_dependency_add(NULL, NULL, root_task, newfile);
299 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
301 const char *category = depafter->src->category;
303 TRACE_category (category);
304 TRACE_sd_set_task_category(newfile, category);
307 xbt_dynar_push(result, &newfile);
309 } else if (xbt_dynar_is_empty(file->tasks_after)) {
310 xbt_dynar_foreach(file->tasks_before, cpt2, depbefore) {
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, end_task);
315 const char *category = depbefore->src->category;
317 TRACE_category (category);
318 TRACE_sd_set_task_category(newfile, category);
321 xbt_dynar_push(result, &newfile);
324 xbt_dynar_foreach(file->tasks_before, cpt1, depbefore) {
325 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
326 if (depbefore->src == depafter->dst) {
328 ("File %s is produced and consumed by task %s. This loop dependency will prevent the execution of the task.",
329 file->name, depbefore->src->name);
331 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
332 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
333 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
335 const char *category = depbefore->src->category;
337 TRACE_category (category);
338 TRACE_sd_set_task_category(newfile, category);
341 xbt_dynar_push(result, &newfile);
347 /* Push end task last */
348 xbt_dynar_push(result, &end_task);
350 /* Free previous copy of the files */
351 xbt_dict_free(&files);
353 xbt_dynar_foreach(result, cpt, file) {
354 if (SD_task_get_kind(file) == SD_TASK_COMM_E2E) {
355 uniq_transfer_task_name(file);
356 } else if (SD_task_get_kind(file) == SD_TASK_COMP_SEQ){
357 /* If some tasks do not take files as input, connect them to the root, if
358 * they don't produce files, connect them to the end node.
360 if ((file != root_task) && xbt_dynar_is_empty(file->tasks_before)) {
361 SD_task_dependency_add(NULL, NULL, root_task, file);
363 if ((file != end_task) && xbt_dynar_is_empty(file->tasks_after)) {
364 SD_task_dependency_add(NULL, NULL, file, end_task);
369 if (!acyclic_graph_detail(result)){
370 XBT_ERROR("The DAX described in %s is not a DAG. It contains a cycle.", filename);
371 xbt_dynar_foreach(result, cpt, file)
372 SD_task_destroy(file);
373 xbt_dynar_free_container(&result);
380 void STag_dax__adag(void)
382 _XBT_GNUC_UNUSED double version;
383 version = dax_parse_double(A_dax__adag_version);
385 xbt_assert(version == 2.1,
386 "Expected version 2.1 in <adag> tag, got %f. Fix the parser or your file",
390 void STag_dax__job(void)
392 double runtime = dax_parse_double(A_dax__job_runtime);
393 char *name = bprintf("%s@%s", A_dax__job_id, A_dax__job_name);
394 runtime *= 4200000000.; /* Assume that timings were done on a 4.2GFlops machine. I mean, why not? */
395 // XBT_INFO("See <job id=%s runtime=%s %.0f>",A_dax__job_id,A_dax__job_runtime,runtime);
396 current_job = SD_task_create_comp_seq(name, NULL, runtime);
397 char *category = A_dax__job_name;
399 TRACE_category (category);
400 TRACE_sd_set_task_category(current_job, category);
402 xbt_dict_set(jobs, A_dax__job_id, current_job, NULL);
404 xbt_dynar_push(result, ¤t_job);
407 void STag_dax__uses(void)
410 double size = dax_parse_double(A_dax__uses_size);
411 int is_input = (A_dax__uses_link == A_dax__uses_link_input);
413 // XBT_INFO("See <uses file=%s %s>",A_dax__uses_file,(is_input?"in":"out"));
414 file = xbt_dict_get_or_null(files, A_dax__uses_file);
416 file = SD_task_create_comm_e2e(A_dax__uses_file, NULL, size);
417 xbt_dict_set(files, A_dax__uses_file, file, NULL);
419 if (SD_task_get_amount(file) != size) {
420 XBT_WARN("Ignoring file %s size redefinition from %.0f to %.0f",
421 A_dax__uses_file, SD_task_get_amount(file), size);
425 SD_task_dependency_add(NULL, NULL, file, current_job);
427 SD_task_dependency_add(NULL, NULL, current_job, file);
428 if (xbt_dynar_length(file->tasks_before) > 1) {
429 XBT_WARN("File %s created at more than one location...", file->name);
434 static SD_task_t current_child;
435 void STag_dax__child(void)
437 current_child = xbt_dict_get_or_null(jobs, A_dax__child_ref);
438 if (current_child == NULL)
439 dax_parse_error(bprintf
440 ("Asked to add dependencies to the non-existent %s task",
444 void ETag_dax__child(void)
446 current_child = NULL;
449 void STag_dax__parent(void)
451 SD_task_t parent = xbt_dict_get_or_null(jobs, A_dax__parent_ref);
453 dax_parse_error(bprintf
454 ("Asked to add a dependency from %s to %s, but %s does not exist",
455 current_child->name, A_dax__parent_ref,
457 SD_task_dependency_add(NULL, NULL, parent, current_child);
458 XBT_DEBUG("Control-flow dependency from %s to %s", current_child->name,
462 void ETag_dax__adag(void)
464 // XBT_INFO("See </adag>");
467 void ETag_dax__job(void)
470 // XBT_INFO("See </job>");
473 void ETag_dax__parent(void)
475 // XBT_INFO("See </parent>");
478 void ETag_dax__uses(void)
480 // XBT_INFO("See </uses>");