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 depbefore = NULL;
98 xbt_dynar_foreach(task->tasks_before,count,depbefore){
99 parent_task = depbefore->src;
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");
177 current = xbt_dynar_new(sizeof(SD_task_t),NULL);
178 xbt_dynar_foreach(dag,count,task){
179 if(task->kind == SD_TASK_COMM_E2E) continue;
180 if(xbt_dynar_length(task->tasks_before) == 0){
181 xbt_dynar_push(current, &task);
187 xbt_dynar_foreach(dag,count,task){
188 if(task->kind == SD_TASK_COMM_E2E) continue;
189 if(xbt_dynar_length(task->tasks_before) == 0){
191 xbt_dynar_push(current, &task);
196 //test if something has to be done for the next iteration
197 while(xbt_dynar_length(current) != 0){
198 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
199 //test if the current iteration is done
201 xbt_dynar_foreach(current,count_current,task){
202 if (task == NULL) continue;
207 xbt_dynar_foreach(task->tasks_after,count,depafter){
208 child_task = depbefore->dst;
209 if(child_task->kind == SD_TASK_COMM_E2E){
211 child_task->marked = 1;
212 SD_task_t child_task_2 = NULL;
213 xbt_dynar_foreach(child_task->tasks_after,j,depafter){
214 child_task_2 = depbefore->dst;
215 if(parents_are_marked(child_task_2))
216 xbt_dynar_push(next, &child_task_2);
219 if(parents_are_marked(child_task))
220 xbt_dynar_push(next, &child_task);
227 xbt_dynar_free(¤t);
231 xbt_dynar_free(¤t);
234 xbt_dynar_foreach(dag,count,task){
235 if(task->kind == SD_TASK_COMM_E2E) continue;
236 //test if all tasks are marked
237 if(task->marked == 0){
238 WARN1("the task %s is in a cycle",task->name);
248 static YY_BUFFER_STATE input_buffer;
250 static xbt_dynar_t result;
251 static xbt_dict_t jobs;
252 static xbt_dict_t files;
253 static SD_task_t current_job;
254 static SD_task_t root_task, end_task;
256 static void dump_res()
260 xbt_dynar_foreach(result, cursor, task) {
261 INFO1("Task %d", cursor);
266 static void dax_task_free(void *task)
272 /** @brief loads a DAX file describing a DAG
274 * See https://confluence.pegasus.isi.edu/display/pegasus/WorkflowGenerator
277 xbt_dynar_t SD_daxload(const char *filename)
279 xbt_dict_cursor_t cursor;
282 FILE *in_file = fopen(filename, "r");
283 xbt_assert1(in_file, "Unable to open \"%s\"\n", filename);
284 input_buffer = dax__create_buffer(in_file, 10);
285 dax__switch_to_buffer(input_buffer);
288 result = xbt_dynar_new(sizeof(SD_task_t), dax_task_free);
289 files = xbt_dict_new();
290 jobs = xbt_dict_new();
291 root_task = SD_task_create_comp_seq("root", NULL, 0);
292 /* by design the root task is always SCHEDULABLE */
293 __SD_task_set_state(root_task, SD_SCHEDULABLE);
295 xbt_dynar_push(result, &root_task);
296 end_task = SD_task_create_comp_seq("end", NULL, 0);
298 xbt_assert2(!dax_lex(), "Parse error in %s: %s", filename,
299 dax__parse_err_msg());
300 dax__delete_buffer(input_buffer);
302 xbt_dict_free(&jobs);
304 /* And now, post-process the files.
305 * We want a file task per pair of computation tasks exchanging the file. Duplicate on need
306 * Files not produced in the system are said to be produced by root task (top of DAG).
307 * Files not consumed in the system are said to be consumed by end task (bottom of DAG).
310 xbt_dict_foreach(files, cursor, name, file) {
311 unsigned int cpt1, cpt2;
312 SD_task_t newfile = NULL;
313 SD_dependency_t depbefore, depafter;
314 if (xbt_dynar_length(file->tasks_before) == 0) {
315 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
317 SD_task_create_comm_e2e(file->name, NULL, file->amount);
318 SD_task_dependency_add(NULL, NULL, root_task, newfile);
319 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
321 const char *category = depbefore->src->category;
323 TRACE_category (category);
324 TRACE_sd_set_task_category (newfile, category);
327 xbt_dynar_push(result, &newfile);
329 } else if (xbt_dynar_length(file->tasks_after) == 0) {
330 xbt_dynar_foreach(file->tasks_before, cpt2, depbefore) {
332 SD_task_create_comm_e2e(file->name, NULL, file->amount);
333 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
334 SD_task_dependency_add(NULL, NULL, newfile, end_task);
336 const char *category = depbefore->src->category;
338 TRACE_category (category);
339 TRACE_sd_set_task_category (newfile, category);
342 xbt_dynar_push(result, &newfile);
345 xbt_dynar_foreach(file->tasks_before, cpt1, depbefore) {
346 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
347 if (depbefore->src == depafter->dst) {
349 ("File %s is produced and consumed by task %s. This loop dependency will prevent the execution of the task.",
350 file->name, depbefore->src->name);
353 SD_task_create_comm_e2e(file->name, NULL, file->amount);
354 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
355 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
357 const char *category = depbefore->src->category;
359 TRACE_category (category);
360 TRACE_sd_set_task_category (newfile, category);
363 xbt_dynar_push(result, &newfile);
369 /* Push end task last */
370 xbt_dynar_push(result, &end_task);
372 /* Free previous copy of the files */
373 xbt_dict_free(&files);
375 xbt_dynar_foreach(result, cpt, file) {
376 if (SD_task_get_kind(file) == SD_TASK_COMM_E2E) {
377 uniq_transfer_task_name(file);
381 acyclic_graph_detail(result);
385 void STag_dax__adag(void)
387 double version = dax_parse_double(A_dax__adag_version);
389 xbt_assert1((version == 2.1),
390 "Expected version 2.1 in <adag> tag, got %f. Fix the parser or your file",
394 void STag_dax__job(void)
396 double runtime = dax_parse_double(A_dax__job_runtime);
397 char *name = bprintf("%s@%s", A_dax__job_id, A_dax__job_name);
398 runtime *= 4200000000.; /* Assume that timings were done on a 4.2GFlops machine. I mean, why not? */
399 // INFO3("See <job id=%s runtime=%s %.0f>",A_dax__job_id,A_dax__job_runtime,runtime);
400 current_job = SD_task_create_comp_seq(name, NULL, runtime);
402 char *category = A_dax__job_name;
404 TRACE_category (category);
405 TRACE_sd_set_task_category(current_job, category);
408 xbt_dict_set(jobs, A_dax__job_id, current_job, NULL);
410 xbt_dynar_push(result, ¤t_job);
413 void STag_dax__uses(void)
416 double size = dax_parse_double(A_dax__uses_size);
417 int is_input = (A_dax__uses_link == A_dax__uses_link_input);
419 // INFO2("See <uses file=%s %s>",A_dax__uses_file,(is_input?"in":"out"));
420 file = xbt_dict_get_or_null(files, A_dax__uses_file);
422 file = SD_task_create_comm_e2e(A_dax__uses_file, NULL, size);
423 xbt_dict_set(files, A_dax__uses_file, file, &dax_task_free);
425 if (SD_task_get_amount(file) != size) {
426 WARN3("Ignoring file %s size redefinition from %.0f to %.0f",
427 A_dax__uses_file, SD_task_get_amount(file), size);
431 SD_task_dependency_add(NULL, NULL, file, current_job);
433 SD_task_dependency_add(NULL, NULL, current_job, file);
434 if (xbt_dynar_length(file->tasks_before) > 1) {
435 WARN1("File %s created at more than one location...", file->name);
440 static SD_task_t current_child;
441 void STag_dax__child(void)
443 current_child = xbt_dict_get_or_null(jobs, A_dax__child_ref);
444 if (current_child == NULL)
445 dax_parse_error(bprintf
446 ("Asked to add dependencies to the non-existent %s task",
450 void ETag_dax__child(void)
452 current_child = NULL;
455 void STag_dax__parent(void)
457 SD_task_t parent = xbt_dict_get_or_null(jobs, A_dax__parent_ref);
459 dax_parse_error(bprintf
460 ("Asked to add a dependency from %s to %s, but %s does not exist",
461 current_child->name, A_dax__parent_ref,
463 SD_task_dependency_add(NULL, NULL, parent, current_child);
464 DEBUG2("Control-flow dependency from %s to %s", current_child->name,
468 void ETag_dax__adag(void)
470 // INFO0("See </adag>");
473 void ETag_dax__job(void)
476 // INFO0("See </job>");
479 void ETag_dax__parent(void)
481 // INFO0("See </parent>");
484 void ETag_dax__uses(void)
486 // INFO0("See </uses>");