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", dax_lineno, string);
36 /* Ensure that transfer tasks have unique names even though a file is used several times */
38 void uniq_transfer_task_name(SD_task_t task)
40 SD_task_t child, parent;
41 xbt_dynar_t children, parents;
44 children = SD_task_get_children(task);
45 parents = SD_task_get_parents(task);
47 xbt_dynar_get_cpy(children, 0, &child);
48 xbt_dynar_get_cpy(parents, 0, &parent);
50 new_name = bprintf("%s_%s_%s", SD_task_get_name(parent), SD_task_get_name(task), SD_task_get_name(child));
52 SD_task_set_name(task, new_name);
54 xbt_dynar_free_container(&children);
55 xbt_dynar_free_container(&parents);
59 bool children_are_marked(SD_task_t task){
60 SD_task_t child_task = NULL;
61 bool all_marked = true;
62 SD_dependency_t depafter = NULL;
64 xbt_dynar_foreach(task->tasks_after,count,depafter){
65 child_task = depafter->dst;
67 if(child_task->marked == 0) {
76 bool parents_are_marked(SD_task_t task){
77 SD_task_t parent_task = NULL;
78 bool all_marked = true;
79 SD_dependency_t depbefore = NULL;
81 xbt_dynar_foreach(task->tasks_before,count,depbefore){
82 parent_task = depbefore->src;
84 if(parent_task->marked == 0) {
93 bool acyclic_graph_detail(xbt_dynar_t dag){
94 unsigned int count=0, count_current=0;
95 bool all_marked = true;
96 SD_task_t task = NULL, parent_task = NULL, child_task = NULL;
97 SD_dependency_t depbefore = NULL, depafter = NULL;
98 xbt_dynar_t next = NULL, current = xbt_dynar_new(sizeof(SD_task_t),NULL);
100 xbt_dynar_foreach(dag,count,task){
101 if(task->kind == SD_TASK_COMM_E2E) continue;
103 if(xbt_dynar_is_empty(task->tasks_after)){
104 xbt_dynar_push(current, &task);
109 //test if something has to be done for the next iteration
110 while(!xbt_dynar_is_empty(current)){
111 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
112 //test if the current iteration is done
114 xbt_dynar_foreach(current,count_current,task){
115 if (task == NULL) continue;
120 xbt_dynar_foreach(task->tasks_before,count,depbefore){
121 parent_task = depbefore->src;
122 if(parent_task->kind == SD_TASK_COMM_E2E){
124 parent_task->marked = 1;
125 SD_task_t parent_task_2 = NULL;
126 xbt_dynar_foreach(parent_task->tasks_before,j,depbefore){
127 parent_task_2 = depbefore->src;
128 if(children_are_marked(parent_task_2))
129 xbt_dynar_push(next, &parent_task_2);
132 if(children_are_marked(parent_task))
133 xbt_dynar_push(next, &parent_task);
140 xbt_dynar_free(¤t);
144 xbt_dynar_free(¤t);
147 xbt_dynar_foreach(dag,count,task){
148 if(task->kind == SD_TASK_COMM_E2E) continue;
149 //test if all tasks are marked
150 if(task->marked == 0){
151 XBT_WARN("the task %s is not marked",task->name);
158 XBT_VERB("there is at least one cycle in your task graph");
160 current = xbt_dynar_new(sizeof(SD_task_t),NULL);
161 xbt_dynar_foreach(dag,count,task){
162 if(task->kind == SD_TASK_COMM_E2E) continue;
163 if(xbt_dynar_is_empty(task->tasks_before)){
164 xbt_dynar_push(current, &task);
170 xbt_dynar_foreach(dag,count,task){
171 if(task->kind == SD_TASK_COMM_E2E) continue;
172 if(xbt_dynar_is_empty(task->tasks_before)){
174 xbt_dynar_push(current, &task);
179 //test if something has to be done for the next iteration
180 while(!xbt_dynar_is_empty(current)){
181 next = xbt_dynar_new(sizeof(SD_task_t),NULL);
182 //test if the current iteration is done
184 xbt_dynar_foreach(current,count_current,task){
185 if (task == NULL) continue;
190 xbt_dynar_foreach(task->tasks_after,count,depafter){
191 child_task = depbefore->dst;
192 if(child_task->kind == SD_TASK_COMM_E2E){
194 child_task->marked = 1;
195 SD_task_t child_task_2 = NULL;
196 xbt_dynar_foreach(child_task->tasks_after,j,depafter){
197 child_task_2 = depbefore->dst;
198 if(parents_are_marked(child_task_2))
199 xbt_dynar_push(next, &child_task_2);
202 if(parents_are_marked(child_task))
203 xbt_dynar_push(next, &child_task);
210 xbt_dynar_free(¤t);
214 xbt_dynar_free(¤t);
217 xbt_dynar_foreach(dag,count,task){
218 if(task->kind == SD_TASK_COMM_E2E) continue;
219 //test if all tasks are marked
220 if(task->marked == 0){
221 XBT_WARN("the task %s is in a cycle",task->name);
231 static YY_BUFFER_STATE input_buffer;
233 static xbt_dynar_t result;
234 static xbt_dict_t jobs;
235 static xbt_dict_t files;
236 static SD_task_t current_job;
237 static SD_task_t root_task, end_task;
239 static void dax_task_free(void *task)
241 SD_task_destroy((SD_task_t)task);
244 /** @brief loads a DAX file describing a DAG
246 * See https://confluence.pegasus.isi.edu/display/pegasus/WorkflowGenerator for more details.
248 xbt_dynar_t SD_daxload(const char *filename)
250 xbt_dict_cursor_t cursor;
253 FILE *in_file = fopen(filename, "r");
254 xbt_assert(in_file, "Unable to open \"%s\"\n", filename);
255 input_buffer = dax__create_buffer(in_file, 10);
256 dax__switch_to_buffer(input_buffer);
259 result = xbt_dynar_new(sizeof(SD_task_t), dax_task_free);
260 files = xbt_dict_new_homogeneous(&dax_task_free);
261 jobs = xbt_dict_new_homogeneous(NULL);
262 root_task = SD_task_create_comp_seq("root", NULL, 0);
263 /* by design the root task is always SCHEDULABLE */
264 SD_task_set_state(root_task, SD_SCHEDULABLE);
266 xbt_dynar_push(result, &root_task);
267 end_task = SD_task_create_comp_seq("end", NULL, 0);
271 xbt_die("Parse error in %s: %s", filename, dax__parse_err_msg());
272 dax__delete_buffer(input_buffer);
275 xbt_dict_free(&jobs);
277 /* And now, post-process the files.
278 * We want a file task per pair of computation tasks exchanging the file. Duplicate on need
279 * Files not produced in the system are said to be produced by root task (top of DAG).
280 * Files not consumed in the system are said to be consumed by end task (bottom of DAG).
283 xbt_dict_foreach(files, cursor, name, file) {
284 unsigned int cpt1, cpt2;
286 SD_dependency_t depbefore, depafter;
287 if (xbt_dynar_is_empty(file->tasks_before)) {
288 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
289 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
290 SD_task_dependency_add(NULL, NULL, root_task, newfile);
291 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
292 xbt_dynar_push(result, &newfile);
294 } else if (xbt_dynar_is_empty(file->tasks_after)) {
295 xbt_dynar_foreach(file->tasks_before, cpt2, depbefore) {
296 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
297 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
298 SD_task_dependency_add(NULL, NULL, newfile, end_task);
299 xbt_dynar_push(result, &newfile);
302 xbt_dynar_foreach(file->tasks_before, cpt1, depbefore) {
303 xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
304 if (depbefore->src == depafter->dst) {
306 ("File %s is produced and consumed by task %s."
307 "This loop dependency will prevent the execution of the task.", file->name, depbefore->src->name);
309 newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
310 SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
311 SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
312 xbt_dynar_push(result, &newfile);
318 /* Push end task last */
319 xbt_dynar_push(result, &end_task);
321 /* Free previous copy of the files */
322 xbt_dict_free(&files);
324 xbt_dynar_foreach(result, cpt, file) {
325 if (SD_task_get_kind(file) == SD_TASK_COMM_E2E) {
326 uniq_transfer_task_name(file);
327 } else if (SD_task_get_kind(file) == SD_TASK_COMP_SEQ){
328 /* If some tasks do not take files as input, connect them to the root, if
329 * they don't produce files, connect them to the end node.
331 if ((file != root_task) && xbt_dynar_is_empty(file->tasks_before)) {
332 SD_task_dependency_add(NULL, NULL, root_task, file);
334 if ((file != end_task) && xbt_dynar_is_empty(file->tasks_after)) {
335 SD_task_dependency_add(NULL, NULL, file, end_task);
340 if (!acyclic_graph_detail(result)){
341 XBT_ERROR("The DAX described in %s is not a DAG. It contains a cycle.", xbt_basename(filename));
342 xbt_dynar_foreach(result, cpt, file)
343 SD_task_destroy(file);
344 xbt_dynar_free_container(&result);
351 void STag_dax__adag(void)
353 XBT_ATTRIB_UNUSED double version;
354 version = dax_parse_double(A_dax__adag_version);
356 xbt_assert(version == 2.1, "Expected version 2.1 in <adag> tag, got %f. Fix the parser or your file", version);
359 void STag_dax__job(void)
361 double runtime = dax_parse_double(A_dax__job_runtime);
362 char *name = bprintf("%s@%s", A_dax__job_id, A_dax__job_name);
363 runtime *= 4200000000.; /* Assume that timings were done on a 4.2GFlops machine. I mean, why not? */
364 // XBT_INFO("See <job id=%s runtime=%s %.0f>",A_dax__job_id,A_dax__job_runtime,runtime);
365 current_job = SD_task_create_comp_seq(name, NULL, runtime);
366 xbt_dict_set(jobs, A_dax__job_id, current_job, NULL);
368 xbt_dynar_push(result, ¤t_job);
371 void STag_dax__uses(void)
374 double size = dax_parse_double(A_dax__uses_size);
375 int is_input = (A_dax__uses_link == A_dax__uses_link_input);
377 // XBT_INFO("See <uses file=%s %s>",A_dax__uses_file,(is_input?"in":"out"));
378 file = (SD_task_t)xbt_dict_get_or_null(files, A_dax__uses_file);
380 file = SD_task_create_comm_e2e(A_dax__uses_file, NULL, size);
381 xbt_dynar_pop(sd_global->initial_task_set,NULL);
382 xbt_dict_set(files, A_dax__uses_file, file, NULL);
384 if (SD_task_get_amount(file) != size) {
385 XBT_WARN("Ignore file %s size redefinition from %.0f to %.0f", A_dax__uses_file, SD_task_get_amount(file), size);
389 SD_task_dependency_add(NULL, NULL, file, current_job);
391 SD_task_dependency_add(NULL, NULL, current_job, file);
392 if (xbt_dynar_length(file->tasks_before) > 1) {
393 XBT_WARN("File %s created at more than one location...", file->name);
398 static SD_task_t current_child;
399 void STag_dax__child(void)
401 current_child = (SD_task_t)xbt_dict_get_or_null(jobs, A_dax__child_ref);
402 xbt_assert(current_child != NULL,"Parse error on line %d: Asked to add dependencies to the non-existent %s task",
403 dax_lineno, A_dax__child_ref);
406 void ETag_dax__child(void)
408 current_child = NULL;
411 void STag_dax__parent(void)
413 SD_task_t parent = (SD_task_t)xbt_dict_get_or_null(jobs, A_dax__parent_ref);
414 xbt_assert(parent != NULL, "Parse error on line %d: Asked to add a dependency from %s to %s, but %s does not exist",
415 dax_lineno, current_child->name, A_dax__parent_ref, A_dax__parent_ref);
416 SD_task_dependency_add(NULL, NULL, parent, current_child);
417 XBT_DEBUG("Control-flow dependency from %s to %s", current_child->name, parent->name);
420 void ETag_dax__adag(void)
422 // XBT_INFO("See </adag>");
425 void ETag_dax__job(void)
428 // XBT_INFO("See </job>");
431 void ETag_dax__parent(void)
433 // XBT_INFO("See </parent>");
436 void ETag_dax__uses(void)
438 // XBT_INFO("See </uses>");