1 /* Copyright (c) 2009, 2010. 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"
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 static int dax_parse_int(const char *string)
44 ret = sscanf(string, "%d", &value);
46 dax_parse_error(bprintf("%s is not an integer", string));
50 /* Ensure that transfer tasks have unique names even though a file is used
53 void uniq_transfer_task_name(SD_task_t task)
55 SD_task_t child, parent;
56 xbt_dynar_t children, parents;
59 children = SD_task_get_children(task);
60 parents = SD_task_get_parents(task);
62 xbt_dynar_get_cpy(children, 0, &child);
63 xbt_dynar_get_cpy(parents, 0, &parent);
65 new_name = bprintf("%s_%s_%s",
66 SD_task_get_name(parent),
67 SD_task_get_name(task), SD_task_get_name(child));
69 SD_task_set_name(task, new_name);
71 xbt_dynar_free_container(&children);
72 xbt_dynar_free_container(&parents);
76 bool children_are_marked(SD_task_t task){
77 SD_task_t child_task = NULL;
78 bool all_marked = true;
79 SD_dependency_t depafter = NULL;
81 xbt_dynar_foreach(task->tasks_after,count,depafter){
82 child_task = depafter->dst;
84 if(child_task->marked == 0) {
93 bool parents_are_marked(SD_task_t task){
94 SD_task_t parent_task = NULL;
95 bool all_marked = true;
96 SD_dependency_t depafter = NULL;
98 xbt_dynar_foreach(task->tasks_after,count,depafter){
99 parent_task = depafter->dst;
101 if(parent_task->marked == 0) {
110 bool acyclic_graph_detail(xbt_dynar_t dag){
111 unsigned int count=0, count_current=0;
112 bool all_marked = true;
113 SD_task_t task = NULL, parent_task = NULL, child_task = NULL;
114 SD_dependency_t depbefore = NULL, depafter = NULL;
115 xbt_dynar_t next = NULL, current = xbt_dynar_new(sizeof(SD_task_t),NULL);
117 xbt_dynar_foreach(dag,count,task){
118 if(task->kind == SD_TASK_COMM_E2E) continue;
120 if(xbt_dynar_length(task->tasks_after) == 0){
121 xbt_dynar_push(current, &task);
126 //test if something has to be done for the next iteration
127 while(xbt_dynar_length(current) != 0){
128 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
129 //test if the current iteration is done
131 xbt_dynar_foreach(current,count_current,task){
132 if (task == NULL) continue;
137 xbt_dynar_foreach(task->tasks_before,count,depbefore){
138 parent_task = depbefore->src;
139 if(parent_task->kind == SD_TASK_COMM_E2E){
141 parent_task->marked = 1;
142 SD_task_t parent_task_2 = NULL;
143 xbt_dynar_foreach(parent_task->tasks_before,j,depbefore){
144 parent_task_2 = depbefore->src;
145 if(children_are_marked(parent_task_2))
146 xbt_dynar_push(next, &parent_task_2);
149 if(children_are_marked(parent_task))
150 xbt_dynar_push(next, &parent_task);
157 xbt_dynar_free(¤t);
161 xbt_dynar_free(¤t);
164 xbt_dynar_foreach(dag,count,task){
165 if(task->kind == SD_TASK_COMM_E2E) continue;
166 //test if all tasks are marked
167 if(task->marked == 0){
168 WARN1("the task %s is not marked",task->name);
175 VERB0("there is at least one cycle in your task graph");
179 xbt_dynar_foreach(dag,count,task){
180 if(task->kind == SD_TASK_COMM_E2E) continue;
182 if(xbt_dynar_length(task->tasks_before) == 0){
183 xbt_dynar_push(current, &task);
188 //test if something has to be done for the next iteration
189 while(xbt_dynar_length(current) != 0){
190 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
191 //test if the current iteration is done
193 xbt_dynar_foreach(current,count_current,task){
194 if (task == NULL) continue;
199 xbt_dynar_foreach(task->tasks_after,count,depafter){
200 child_task = depafter->dst;
201 if(child_task->kind == SD_TASK_COMM_E2E){
203 child_task->marked = 1;
204 SD_task_t child_task_2 = NULL;
205 xbt_dynar_foreach(child_task->tasks_after,j,depafter){
206 child_task_2 = depafter->src;
207 if(parents_are_marked(child_task_2))
208 xbt_dynar_push(next, &child_task_2);
211 if(parents_are_marked(child_task))
212 xbt_dynar_push(next, &child_task);
219 xbt_dynar_free(¤t);
223 xbt_dynar_free(¤t);
226 xbt_dynar_foreach(dag,count,task){
227 if(task->kind == SD_TASK_COMM_E2E) continue;
228 //test if all tasks are marked
229 if(task->marked == 0){
230 WARN1("the task %s is not marked",task->name);
238 bool acyclic_graph_detection(xbt_dynar_t dag){
239 unsigned int count=0, count_current=0;
240 bool all_marked = true;
241 SD_task_t task = NULL, parent_task = NULL;
242 SD_dependency_t depbefore = NULL;
243 xbt_dynar_t next = NULL, current = xbt_dynar_new(sizeof(SD_task_t),NULL);
245 xbt_dynar_foreach(dag,count,task){
246 if(task->kind == SD_TASK_COMM_E2E) continue;
248 if(xbt_dynar_length(task->tasks_after) == 0){
249 xbt_dynar_push(current, &task);
254 //test if something has to be done for the next iteration
255 while(xbt_dynar_length(current) != 0){
256 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
257 //test if the current iteration is done
259 xbt_dynar_foreach(current,count_current,task){
260 if (task == NULL) continue;
265 xbt_dynar_foreach(task->tasks_before,count,depbefore){
266 parent_task = depbefore->src;
267 if(parent_task->kind == SD_TASK_COMM_E2E){
269 parent_task->marked = 1;
270 SD_task_t parent_task_2 = NULL;
271 xbt_dynar_foreach(parent_task->tasks_before,j,depbefore){
272 parent_task_2 = depbefore->src;
273 if(children_are_marked(parent_task_2))
274 xbt_dynar_push(next, &parent_task_2);
277 if(children_are_marked(parent_task))
278 xbt_dynar_push(next, &parent_task);
285 xbt_dynar_free(¤t);
289 xbt_dynar_free(¤t);
292 xbt_dynar_foreach(dag,count,task){
293 if(task->kind == SD_TASK_COMM_E2E) continue;
294 //test if all tasks are marked
295 if(task->marked == 0){
296 WARN1("the task %s is not marked",task->name);
303 VERB0("there is at least one cycle in your task graph");
309 static YY_BUFFER_STATE input_buffer;
311 static xbt_dynar_t result;
312 static xbt_dict_t jobs;
313 static xbt_dict_t files;
314 static SD_task_t current_job;
315 static SD_task_t root_task, end_task;
317 static void dump_res()
321 xbt_dynar_foreach(result, cursor, task) {
322 INFO1("Task %d", cursor);
327 static void dax_task_free(void *task)
333 /** @brief loads a DAX file describing a DAG
335 * See https://confluence.pegasus.isi.edu/display/pegasus/WorkflowGenerator
338 xbt_dynar_t SD_daxload(const char *filename)
340 xbt_dict_cursor_t cursor;
343 FILE *in_file = fopen(filename, "r");
344 xbt_assert1(in_file, "Unable to open \"%s\"\n", filename);
345 input_buffer = dax__create_buffer(in_file, 10);
346 dax__switch_to_buffer(input_buffer);
349 result = xbt_dynar_new(sizeof(SD_task_t), dax_task_free);
350 files = xbt_dict_new();
351 jobs = xbt_dict_new();
352 root_task = SD_task_create_comp_seq("root", NULL, 0);
353 /* by design the root task is always SCHEDULABLE */
354 __SD_task_set_state(root_task, SD_SCHEDULABLE);
356 xbt_dynar_push(result, &root_task);
357 end_task = SD_task_create_comp_seq("end", NULL, 0);
359 xbt_assert2(!dax_lex(), "Parse error in %s: %s", filename,
360 dax__parse_err_msg());
361 dax__delete_buffer(input_buffer);
363 xbt_dict_free(&jobs);
365 /* And now, post-process the files.
366 * We want a file task per pair of computation tasks exchanging the file. Duplicate on need
367 * Files not produced in the system are said to be produced by root task (top of DAG).
368 * Files not consumed in the system are said to be consumed by end task (bottom of DAG).
371 xbt_dict_foreach(files, cursor, name, file) {
372 unsigned int cpt1, cpt2;
373 SD_task_t newfile = NULL;
374 SD_dependency_t depbefore, depafter;
375 if (xbt_dynar_length(file->tasks_before) == 0) {
376 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
378 SD_task_create_comm_e2e(file->name, NULL, file->amount);
379 SD_task_dependency_add(NULL, NULL, root_task, newfile);
380 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
382 const char *category = depbefore->src->category;
384 TRACE_category (category);
385 TRACE_sd_set_task_category (newfile, category);
388 xbt_dynar_push(result, &newfile);
390 } else if (xbt_dynar_length(file->tasks_after) == 0) {
391 xbt_dynar_foreach(file->tasks_before, cpt2, depbefore) {
393 SD_task_create_comm_e2e(file->name, NULL, file->amount);
394 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
395 SD_task_dependency_add(NULL, NULL, newfile, end_task);
397 const char *category = depbefore->src->category;
399 TRACE_category (category);
400 TRACE_sd_set_task_category (newfile, category);
403 xbt_dynar_push(result, &newfile);
406 xbt_dynar_foreach(file->tasks_before, cpt1, depbefore) {
407 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
408 if (depbefore->src == depafter->dst) {
410 ("File %s is produced and consumed by task %s. This loop dependency will prevent the execution of the task.",
411 file->name, depbefore->src->name);
414 SD_task_create_comm_e2e(file->name, NULL, file->amount);
415 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
416 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
418 const char *category = depbefore->src->category;
420 TRACE_category (category);
421 TRACE_sd_set_task_category (newfile, category);
424 xbt_dynar_push(result, &newfile);
430 /* Push end task last */
431 xbt_dynar_push(result, &end_task);
433 /* Free previous copy of the files */
434 xbt_dict_free(&files);
436 xbt_dynar_foreach(result, cpt, file) {
437 if (SD_task_get_kind(file) == SD_TASK_COMM_E2E) {
438 uniq_transfer_task_name(file);
442 acyclic_graph_detection(result);
446 void STag_dax__adag(void)
448 double version = dax_parse_double(A_dax__adag_version);
450 xbt_assert1((version == 2.1),
451 "Expected version 2.1 in <adag> tag, got %f. Fix the parser or your file",
455 void STag_dax__job(void)
457 double runtime = dax_parse_double(A_dax__job_runtime);
458 char *name = bprintf("%s@%s", A_dax__job_id, A_dax__job_name);
459 runtime *= 4200000000.; /* Assume that timings were done on a 4.2GFlops machine. I mean, why not? */
460 // INFO3("See <job id=%s runtime=%s %.0f>",A_dax__job_id,A_dax__job_runtime,runtime);
461 current_job = SD_task_create_comp_seq(name, NULL, runtime);
463 char *category = A_dax__job_name;
465 TRACE_category (category);
466 TRACE_sd_set_task_category(current_job, category);
469 xbt_dict_set(jobs, A_dax__job_id, current_job, NULL);
471 xbt_dynar_push(result, ¤t_job);
474 void STag_dax__uses(void)
477 double size = dax_parse_double(A_dax__uses_size);
478 int is_input = (A_dax__uses_link == A_dax__uses_link_input);
480 // INFO2("See <uses file=%s %s>",A_dax__uses_file,(is_input?"in":"out"));
481 file = xbt_dict_get_or_null(files, A_dax__uses_file);
483 file = SD_task_create_comm_e2e(A_dax__uses_file, NULL, size);
484 xbt_dict_set(files, A_dax__uses_file, file, &dax_task_free);
486 if (SD_task_get_amount(file) != size) {
487 WARN3("Ignoring file %s size redefinition from %.0f to %.0f",
488 A_dax__uses_file, SD_task_get_amount(file), size);
492 SD_task_dependency_add(NULL, NULL, file, current_job);
494 SD_task_dependency_add(NULL, NULL, current_job, file);
495 if (xbt_dynar_length(file->tasks_before) > 1) {
496 WARN1("File %s created at more than one location...", file->name);
501 static SD_task_t current_child;
502 void STag_dax__child(void)
504 current_child = xbt_dict_get_or_null(jobs, A_dax__child_ref);
505 if (current_child == NULL)
506 dax_parse_error(bprintf
507 ("Asked to add dependencies to the non-existent %s task",
511 void ETag_dax__child(void)
513 current_child = NULL;
516 void STag_dax__parent(void)
518 SD_task_t parent = xbt_dict_get_or_null(jobs, A_dax__parent_ref);
520 dax_parse_error(bprintf
521 ("Asked to add a dependency from %s to %s, but %s does not exist",
522 current_child->name, A_dax__parent_ref,
524 SD_task_dependency_add(NULL, NULL, parent, current_child);
525 DEBUG2("Control-flow dependency from %s to %s", current_child->name,
529 void ETag_dax__adag(void)
531 // INFO0("See </adag>");
534 void ETag_dax__job(void)
537 // INFO0("See </job>");
540 void ETag_dax__parent(void)
542 // INFO0("See </parent>");
545 void ETag_dax__uses(void)
547 // INFO0("See </uses>");