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");
21 bool children_are_marked(SD_task_t task);
22 bool parents_are_marked(SD_task_t task);
26 static double dax_parse_double(const char *string)
31 ret = sscanf(string, "%lg", &value);
32 xbt_assert (ret == 1, "Parse error on line %d: %s is not a double",
37 /* Ensure that transfer tasks have unique names even though a file is used
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",
53 SD_task_get_name(parent),
54 SD_task_get_name(task), SD_task_get_name(child));
56 SD_task_set_name(task, new_name);
58 xbt_dynar_free_container(&children);
59 xbt_dynar_free_container(&parents);
63 bool children_are_marked(SD_task_t task){
64 SD_task_t child_task = NULL;
65 bool all_marked = true;
66 SD_dependency_t depafter = NULL;
68 xbt_dynar_foreach(task->tasks_after,count,depafter){
69 child_task = depafter->dst;
71 if(child_task->marked == 0) {
80 bool parents_are_marked(SD_task_t task){
81 SD_task_t parent_task = NULL;
82 bool all_marked = true;
83 SD_dependency_t depbefore = NULL;
85 xbt_dynar_foreach(task->tasks_before,count,depbefore){
86 parent_task = depbefore->src;
88 if(parent_task->marked == 0) {
97 bool acyclic_graph_detail(xbt_dynar_t dag){
98 unsigned int count=0, count_current=0;
99 bool all_marked = true;
100 SD_task_t task = NULL, parent_task = NULL, child_task = NULL;
101 SD_dependency_t depbefore = NULL, depafter = NULL;
102 xbt_dynar_t next = NULL, current = xbt_dynar_new(sizeof(SD_task_t),NULL);
104 xbt_dynar_foreach(dag,count,task){
105 if(task->kind == SD_TASK_COMM_E2E) continue;
107 if(xbt_dynar_is_empty(task->tasks_after)){
108 xbt_dynar_push(current, &task);
113 //test if something has to be done for the next iteration
114 while(!xbt_dynar_is_empty(current)){
115 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
116 //test if the current iteration is done
118 xbt_dynar_foreach(current,count_current,task){
119 if (task == NULL) continue;
124 xbt_dynar_foreach(task->tasks_before,count,depbefore){
125 parent_task = depbefore->src;
126 if(parent_task->kind == SD_TASK_COMM_E2E){
128 parent_task->marked = 1;
129 SD_task_t parent_task_2 = NULL;
130 xbt_dynar_foreach(parent_task->tasks_before,j,depbefore){
131 parent_task_2 = depbefore->src;
132 if(children_are_marked(parent_task_2))
133 xbt_dynar_push(next, &parent_task_2);
136 if(children_are_marked(parent_task))
137 xbt_dynar_push(next, &parent_task);
144 xbt_dynar_free(¤t);
148 xbt_dynar_free(¤t);
151 xbt_dynar_foreach(dag,count,task){
152 if(task->kind == SD_TASK_COMM_E2E) continue;
153 //test if all tasks are marked
154 if(task->marked == 0){
155 XBT_WARN("the task %s is not marked",task->name);
162 XBT_VERB("there is at least one cycle in your task graph");
164 current = xbt_dynar_new(sizeof(SD_task_t),NULL);
165 xbt_dynar_foreach(dag,count,task){
166 if(task->kind == SD_TASK_COMM_E2E) continue;
167 if(xbt_dynar_is_empty(task->tasks_before)){
168 xbt_dynar_push(current, &task);
174 xbt_dynar_foreach(dag,count,task){
175 if(task->kind == SD_TASK_COMM_E2E) continue;
176 if(xbt_dynar_is_empty(task->tasks_before)){
178 xbt_dynar_push(current, &task);
183 //test if something has to be done for the next iteration
184 while(!xbt_dynar_is_empty(current)){
185 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
186 //test if the current iteration is done
188 xbt_dynar_foreach(current,count_current,task){
189 if (task == NULL) continue;
194 xbt_dynar_foreach(task->tasks_after,count,depafter){
195 child_task = depbefore->dst;
196 if(child_task->kind == SD_TASK_COMM_E2E){
198 child_task->marked = 1;
199 SD_task_t child_task_2 = NULL;
200 xbt_dynar_foreach(child_task->tasks_after,j,depafter){
201 child_task_2 = depbefore->dst;
202 if(parents_are_marked(child_task_2))
203 xbt_dynar_push(next, &child_task_2);
206 if(parents_are_marked(child_task))
207 xbt_dynar_push(next, &child_task);
214 xbt_dynar_free(¤t);
218 xbt_dynar_free(¤t);
221 xbt_dynar_foreach(dag,count,task){
222 if(task->kind == SD_TASK_COMM_E2E) continue;
223 //test if all tasks are marked
224 if(task->marked == 0){
225 XBT_WARN("the task %s is in a cycle",task->name);
235 static YY_BUFFER_STATE input_buffer;
237 static xbt_dynar_t result;
238 static xbt_dict_t jobs;
239 static xbt_dict_t files;
240 static SD_task_t current_job;
241 static SD_task_t root_task, end_task;
243 static void dax_task_free(void *task)
245 SD_task_destroy((SD_task_t)task);
248 /** @brief loads a DAX file describing a DAG
250 * See https://confluence.pegasus.isi.edu/display/pegasus/WorkflowGenerator
253 xbt_dynar_t SD_daxload(const char *filename)
255 xbt_dict_cursor_t cursor;
258 FILE *in_file = fopen(filename, "r");
259 xbt_assert(in_file, "Unable to open \"%s\"\n", filename);
260 input_buffer = dax__create_buffer(in_file, 10);
261 dax__switch_to_buffer(input_buffer);
264 result = xbt_dynar_new(sizeof(SD_task_t), dax_task_free);
265 files = xbt_dict_new_homogeneous(&dax_task_free);
266 jobs = xbt_dict_new_homogeneous(NULL);
267 root_task = SD_task_create_comp_seq("root", NULL, 0);
268 /* by design the root task is always SCHEDULABLE */
269 SD_task_set_state(root_task, SD_SCHEDULABLE);
271 xbt_dynar_push(result, &root_task);
272 end_task = SD_task_create_comp_seq("end", NULL, 0);
276 xbt_die("Parse error in %s: %s", filename, dax__parse_err_msg());
277 dax__delete_buffer(input_buffer);
280 xbt_dict_free(&jobs);
282 /* And now, post-process the files.
283 * We want a file task per pair of computation tasks exchanging the file. Duplicate on need
284 * Files not produced in the system are said to be produced by root task (top of DAG).
285 * Files not consumed in the system are said to be consumed by end task (bottom of DAG).
288 xbt_dict_foreach(files, cursor, name, file) {
289 unsigned int cpt1, cpt2;
291 SD_dependency_t depbefore, depafter;
292 if (xbt_dynar_is_empty(file->tasks_before)) {
293 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
294 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
295 SD_task_dependency_add(NULL, NULL, root_task, newfile);
296 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
297 xbt_dynar_push(result, &newfile);
299 } else if (xbt_dynar_is_empty(file->tasks_after)) {
300 xbt_dynar_foreach(file->tasks_before, cpt2, depbefore) {
301 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
302 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
303 SD_task_dependency_add(NULL, NULL, newfile, end_task);
304 xbt_dynar_push(result, &newfile);
307 xbt_dynar_foreach(file->tasks_before, cpt1, depbefore) {
308 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
309 if (depbefore->src == depafter->dst) {
311 ("File %s is produced and consumed by task %s. This loop dependency will prevent the execution of the task.",
312 file->name, depbefore->src->name);
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, depafter->dst);
317 xbt_dynar_push(result, &newfile);
323 /* Push end task last */
324 xbt_dynar_push(result, &end_task);
326 /* Free previous copy of the files */
327 xbt_dict_free(&files);
329 xbt_dynar_foreach(result, cpt, file) {
330 if (SD_task_get_kind(file) == SD_TASK_COMM_E2E) {
331 uniq_transfer_task_name(file);
332 } else if (SD_task_get_kind(file) == SD_TASK_COMP_SEQ){
333 /* If some tasks do not take files as input, connect them to the root, if
334 * they don't produce files, connect them to the end node.
336 if ((file != root_task) && xbt_dynar_is_empty(file->tasks_before)) {
337 SD_task_dependency_add(NULL, NULL, root_task, file);
339 if ((file != end_task) && xbt_dynar_is_empty(file->tasks_after)) {
340 SD_task_dependency_add(NULL, NULL, file, end_task);
345 if (!acyclic_graph_detail(result)){
346 XBT_ERROR("The DAX described in %s is not a DAG. It contains a cycle.",
347 xbt_basename(filename));
348 xbt_dynar_foreach(result, cpt, file)
349 SD_task_destroy(file);
350 xbt_dynar_free_container(&result);
357 void STag_dax__adag(void)
359 XBT_ATTRIB_UNUSED double version;
360 version = dax_parse_double(A_dax__adag_version);
362 xbt_assert(version == 2.1,
363 "Expected version 2.1 in <adag> tag, got %f. Fix the parser or your file",
367 void STag_dax__job(void)
369 double runtime = dax_parse_double(A_dax__job_runtime);
370 char *name = bprintf("%s@%s", A_dax__job_id, A_dax__job_name);
371 runtime *= 4200000000.; /* Assume that timings were done on a 4.2GFlops machine. I mean, why not? */
372 // XBT_INFO("See <job id=%s runtime=%s %.0f>",A_dax__job_id,A_dax__job_runtime,runtime);
373 current_job = SD_task_create_comp_seq(name, NULL, runtime);
374 xbt_dict_set(jobs, A_dax__job_id, current_job, NULL);
376 xbt_dynar_push(result, ¤t_job);
379 void STag_dax__uses(void)
382 double size = dax_parse_double(A_dax__uses_size);
383 int is_input = (A_dax__uses_link == A_dax__uses_link_input);
385 // XBT_INFO("See <uses file=%s %s>",A_dax__uses_file,(is_input?"in":"out"));
386 file = (SD_task_t)xbt_dict_get_or_null(files, A_dax__uses_file);
388 file = SD_task_create_comm_e2e(A_dax__uses_file, NULL, size);
389 xbt_dict_set(files, A_dax__uses_file, file, NULL);
391 if (SD_task_get_amount(file) != size) {
392 XBT_WARN("Ignoring file %s size redefinition from %.0f to %.0f",
393 A_dax__uses_file, SD_task_get_amount(file), size);
397 SD_task_dependency_add(NULL, NULL, file, current_job);
399 SD_task_dependency_add(NULL, NULL, current_job, file);
400 if (xbt_dynar_length(file->tasks_before) > 1) {
401 XBT_WARN("File %s created at more than one location...", file->name);
406 static SD_task_t current_child;
407 void STag_dax__child(void)
409 current_child = (SD_task_t)xbt_dict_get_or_null(jobs, A_dax__child_ref);
410 xbt_assert(current_child != NULL,"Parse error on line %d:"
411 "Asked to add dependencies to the non-existent %s task",
412 dax_lineno, A_dax__child_ref);
415 void ETag_dax__child(void)
417 current_child = NULL;
420 void STag_dax__parent(void)
422 SD_task_t parent = (SD_task_t)xbt_dict_get_or_null(jobs, A_dax__parent_ref);
423 xbt_assert(parent != NULL, "Parse error on line %d: "
424 "Asked to add a dependency from %s to %s, but %s does not exist",
425 dax_lineno, current_child->name, A_dax__parent_ref,
427 SD_task_dependency_add(NULL, NULL, parent, current_child);
428 XBT_DEBUG("Control-flow dependency from %s to %s", current_child->name,
432 void ETag_dax__adag(void)
434 // XBT_INFO("See </adag>");
437 void ETag_dax__job(void)
440 // XBT_INFO("See </job>");
443 void ETag_dax__parent(void)
445 // XBT_INFO("See </parent>");
448 void ETag_dax__uses(void)
450 // XBT_INFO("See </uses>");