-/* Copyright (c) 2009-2016. The SimGrid Team.
+/* Copyright (c) 2009-2019. The SimGrid Team.
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
-#include "src/simdag/simdag_private.h"
+#include "simdag_private.hpp"
#include "simgrid/simdag.h"
-#include "xbt/misc.h"
+#include "xbt/file.hpp"
#include "xbt/log.h"
-#include "xbt/file.h" /* xbt_basename() */
-
-XBT_LOG_NEW_DEFAULT_SUBCATEGORY(sd_daxparse, sd, "Parsing DAX files");
-
-extern "C" {
- #undef CLEANUP
- #include "dax_dtd.h"
- #define register /* g++ don't like register, so don't say it */
- #include "dax_dtd.c"
- #undef register
-}
-
-bool children_are_marked(SD_task_t task);
-bool parents_are_marked(SD_task_t task);
-
-/* Parsing helpers */
+#include "xbt/misc.h"
+#include <algorithm>
+#include <map>
-static double dax_parse_double(const char *string)
-{
- int ret = 0;
- double value;
+#include "dax_dtd.h"
+#include "dax_dtd.c"
- ret = sscanf(string, "%lg", &value);
- xbt_assert (ret == 1, "Parse error on line %d: %s is not a double", dax_lineno, string);
- return value;
-}
+XBT_LOG_NEW_DEFAULT_SUBCATEGORY(sd_daxparse, sd, "Parsing DAX files");
/* Ensure that transfer tasks have unique names even though a file is used several times */
-
void uniq_transfer_task_name(SD_task_t task)
{
- SD_task_t child, parent;
- xbt_dynar_t children, parents;
- char *new_name;
-
- children = SD_task_get_children(task);
- parents = SD_task_get_parents(task);
+ SD_task_t child = *(task->successors->begin());
+ SD_task_t parent = *(task->predecessors->begin());
- xbt_dynar_get_cpy(children, 0, &child);
- xbt_dynar_get_cpy(parents, 0, &parent);
+ std::string new_name =
+ std::string(SD_task_get_name(parent)) + "_" + SD_task_get_name(task) + "_" + SD_task_get_name(child);
- new_name = bprintf("%s_%s_%s", SD_task_get_name(parent), SD_task_get_name(task), SD_task_get_name(child));
-
- SD_task_set_name(task, new_name);
-
- xbt_dynar_free_container(&children);
- xbt_dynar_free_container(&parents);
- free(new_name);
+ SD_task_set_name(task, new_name.c_str());
}
-bool children_are_marked(SD_task_t task){
- SD_task_t child_task = NULL;
- bool all_marked = true;
- SD_dependency_t depafter = NULL;
- unsigned int count;
- xbt_dynar_foreach(task->tasks_after,count,depafter){
- child_task = depafter->dst;
- //test marked
- if(child_task->marked == 0) {
- all_marked = false;
- break;
- }
- child_task = NULL;
- }
- return all_marked;
+static bool children_are_marked(SD_task_t task){
+ return std::none_of(task->successors->begin(), task->successors->end(),
+ [](const SD_task_t& elm) { return not elm->marked; }) &&
+ std::none_of(task->outputs->begin(), task->outputs->end(),
+ [](const SD_task_t& elm) { return not elm->marked; });
}
-bool parents_are_marked(SD_task_t task){
- SD_task_t parent_task = NULL;
- bool all_marked = true;
- SD_dependency_t depbefore = NULL;
- unsigned int count;
- xbt_dynar_foreach(task->tasks_before,count,depbefore){
- parent_task = depbefore->src;
- //test marked
- if(parent_task->marked == 0) {
- all_marked = false;
- break;
- }
- parent_task = NULL;
- }
- return all_marked;
+static bool parents_are_marked(SD_task_t task){
+ return std::none_of(task->predecessors->begin(), task->predecessors->end(),
+ [](const SD_task_t& elm) { return not elm->marked; }) &&
+ std::none_of(task->inputs->begin(), task->inputs->end(), [](const SD_task_t& elm) { return not elm->marked; });
}
bool acyclic_graph_detail(xbt_dynar_t dag){
- unsigned int count=0, count_current=0;
+ unsigned int count;
bool all_marked = true;
- SD_task_t task = NULL, parent_task = NULL, child_task = NULL;
- SD_dependency_t depbefore = NULL, depafter = NULL;
- xbt_dynar_t next = NULL, current = xbt_dynar_new(sizeof(SD_task_t),NULL);
-
- xbt_dynar_foreach(dag,count,task){
- if(task->kind == SD_TASK_COMM_E2E) continue;
- task->marked = 0;
- if(xbt_dynar_is_empty(task->tasks_after)){
- xbt_dynar_push(current, &task);
- }
- }
- task = NULL;
- count = 0;
- //test if something has to be done for the next iteration
- while(!xbt_dynar_is_empty(current)){
- next = xbt_dynar_new(sizeof(SD_task_t),NULL);
- //test if the current iteration is done
- count_current=0;
- xbt_dynar_foreach(current,count_current,task){
- if (task == NULL) continue;
- count = 0;
- //push task in next
- task->marked = 1;
- count = 0;
- xbt_dynar_foreach(task->tasks_before,count,depbefore){
- parent_task = depbefore->src;
- if(parent_task->kind == SD_TASK_COMM_E2E){
- unsigned int j=0;
- parent_task->marked = 1;
- SD_task_t parent_task_2 = NULL;
- xbt_dynar_foreach(parent_task->tasks_before,j,depbefore){
- parent_task_2 = depbefore->src;
- if(children_are_marked(parent_task_2))
- xbt_dynar_push(next, &parent_task_2);
- }
- } else{
- if(children_are_marked(parent_task))
- xbt_dynar_push(next, &parent_task);
- }
- parent_task = NULL;
+ SD_task_t task = nullptr;
+ std::vector<SD_task_t> current;
+ xbt_dynar_foreach (dag, count, task)
+ if (task->kind != SD_TASK_COMM_E2E && task->successors->empty() && task->outputs->empty())
+ current.push_back(task);
+
+ while (not current.empty()) {
+ std::vector<SD_task_t> next;
+ for (auto const& t : current) {
+ //Mark task
+ t->marked = true;
+ for (SD_task_t const& input : *t->inputs) {
+ input->marked = true;
+ // Inputs are communication, hence they can have only one predecessor
+ SD_task_t input_pred = *(input->predecessors->begin());
+ if (children_are_marked(input_pred))
+ next.push_back(input_pred);
+ }
+ for (SD_task_t const& pred : *t->predecessors) {
+ if (children_are_marked(pred))
+ next.push_back(pred);
}
- task = NULL;
- count = 0;
}
- xbt_dynar_free(¤t);
+ current.clear();
current = next;
- next = NULL;
}
- xbt_dynar_free(¤t);
- current = NULL;
+
all_marked = true;
+ //test if all tasks are marked
xbt_dynar_foreach(dag,count,task){
- if(task->kind == SD_TASK_COMM_E2E) continue;
- //test if all tasks are marked
- if(task->marked == 0){
+ if (task->kind != SD_TASK_COMM_E2E && not task->marked) {
XBT_WARN("the task %s is not marked",task->name);
all_marked = false;
break;
}
}
- task = NULL;
- if(!all_marked){
- XBT_VERB("there is at least one cycle in your task graph");
- current = xbt_dynar_new(sizeof(SD_task_t),NULL);
- xbt_dynar_foreach(dag,count,task){
- if(task->kind == SD_TASK_COMM_E2E) continue;
- if(xbt_dynar_is_empty(task->tasks_before)){
- xbt_dynar_push(current, &task);
- }
- }
-
- count = 0;
- task = NULL;
+ if (not all_marked) {
+ XBT_VERB("there is at least one cycle in your task graph");
xbt_dynar_foreach(dag,count,task){
- if(task->kind == SD_TASK_COMM_E2E) continue;
- if(xbt_dynar_is_empty(task->tasks_before)){
- task->marked = 1;
- xbt_dynar_push(current, &task);
+ if(task->kind != SD_TASK_COMM_E2E && task->predecessors->empty() && task->inputs->empty()){
+ task->marked = true;
+ current.push_back(task);
}
}
- task = NULL;
- count = 0;
//test if something has to be done for the next iteration
- while(!xbt_dynar_is_empty(current)){
- next = xbt_dynar_new(sizeof(SD_task_t),NULL);
+ while (not current.empty()) {
+ std::vector<SD_task_t> next;
//test if the current iteration is done
- count_current=0;
- xbt_dynar_foreach(current,count_current,task){
- if (task == NULL) continue;
- count = 0;
- //push task in next
- task->marked = 1;
- count = 0;
- xbt_dynar_foreach(task->tasks_after,count,depafter){
- child_task = depbefore->dst;
- if(child_task->kind == SD_TASK_COMM_E2E){
- unsigned int j=0;
- child_task->marked = 1;
- SD_task_t child_task_2 = NULL;
- xbt_dynar_foreach(child_task->tasks_after,j,depafter){
- child_task_2 = depbefore->dst;
- if(parents_are_marked(child_task_2))
- xbt_dynar_push(next, &child_task_2);
- }
- } else{
- if(parents_are_marked(child_task))
- xbt_dynar_push(next, &child_task);
- }
- child_task = NULL;
+ for (auto const& t : current) {
+ t->marked = true;
+ for (SD_task_t const& output : *t->outputs) {
+ output->marked = true;
+ // outputs are communication, hence they can have only one successor
+ SD_task_t output_succ = *(output->successors->begin());
+ if (parents_are_marked(output_succ))
+ next.push_back(output_succ);
+ }
+ for (SD_task_t const& succ : *t->successors) {
+ if (parents_are_marked(succ))
+ next.push_back(succ);
}
- task = NULL;
- count = 0;
}
- xbt_dynar_free(¤t);
+ current.clear();
current = next;
- next = NULL;
}
- xbt_dynar_free(¤t);
- current = NULL;
+
all_marked = true;
xbt_dynar_foreach(dag,count,task){
- if(task->kind == SD_TASK_COMM_E2E) continue;
- //test if all tasks are marked
- if(task->marked == 0){
+ if (task->kind != SD_TASK_COMM_E2E && not task->marked) {
XBT_WARN("the task %s is in a cycle",task->name);
all_marked = false;
}
return all_marked;
}
-
-
static YY_BUFFER_STATE input_buffer;
static xbt_dynar_t result;
-static xbt_dict_t jobs;
-static xbt_dict_t files;
+static std::map<std::string, SD_task_t> jobs;
+static std::map<std::string, SD_task_t> files;
static SD_task_t current_job;
-static SD_task_t root_task, end_task;
-
-static void dax_task_free(void *task)
-{
- SD_task_destroy((SD_task_t)task);
-}
/** @brief loads a DAX file describing a DAG
- *
+ *
* See https://confluence.pegasus.isi.edu/display/pegasus/WorkflowGenerator for more details.
*/
xbt_dynar_t SD_daxload(const char *filename)
{
- xbt_dict_cursor_t cursor;
SD_task_t file;
- char *name;
- FILE *in_file = fopen(filename, "r");
+ FILE* in_file = fopen(filename, "r");
xbt_assert(in_file, "Unable to open \"%s\"\n", filename);
input_buffer = dax__create_buffer(in_file, 10);
dax__switch_to_buffer(input_buffer);
dax_lineno = 1;
- result = xbt_dynar_new(sizeof(SD_task_t), dax_task_free);
- files = xbt_dict_new_homogeneous(&dax_task_free);
- jobs = xbt_dict_new_homogeneous(NULL);
- root_task = SD_task_create_comp_seq("root", NULL, 0);
+ result = xbt_dynar_new(sizeof(SD_task_t), nullptr);
+ SD_task_t root_task = SD_task_create_comp_seq("root", nullptr, 0);
/* by design the root task is always SCHEDULABLE */
SD_task_set_state(root_task, SD_SCHEDULABLE);
xbt_dynar_push(result, &root_task);
- end_task = SD_task_create_comp_seq("end", NULL, 0);
+ SD_task_t end_task = SD_task_create_comp_seq("end", nullptr, 0);
int res = dax_lex();
if (res != 0)
dax__delete_buffer(input_buffer);
fclose(in_file);
dax_lex_destroy();
- xbt_dict_free(&jobs);
/* And now, post-process the files.
* We want a file task per pair of computation tasks exchanging the file. Duplicate on need
* Files not consumed in the system are said to be consumed by end task (bottom of DAG).
*/
- xbt_dict_foreach(files, cursor, name, file) {
- unsigned int cpt1, cpt2;
+ for (auto const& elm : files) {
+ file = elm.second;
SD_task_t newfile;
- SD_dependency_t depbefore, depafter;
- if (xbt_dynar_is_empty(file->tasks_before)) {
- xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
- newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
- SD_task_dependency_add(NULL, NULL, root_task, newfile);
- SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
+ if (file->predecessors->empty()) {
+ for (SD_task_t const& it : *file->successors) {
+ newfile = SD_task_create_comm_e2e(file->name, nullptr, file->amount);
+ SD_task_dependency_add(root_task, newfile);
+ SD_task_dependency_add(newfile, it);
xbt_dynar_push(result, &newfile);
}
- } else if (xbt_dynar_is_empty(file->tasks_after)) {
- xbt_dynar_foreach(file->tasks_before, cpt2, depbefore) {
- newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
- SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
- SD_task_dependency_add(NULL, NULL, newfile, end_task);
+ }
+ if (file->successors->empty()) {
+ for (SD_task_t const& it : *file->predecessors) {
+ newfile = SD_task_create_comm_e2e(file->name, nullptr, file->amount);
+ SD_task_dependency_add(it, newfile);
+ SD_task_dependency_add(newfile, end_task);
xbt_dynar_push(result, &newfile);
}
- } else {
- xbt_dynar_foreach(file->tasks_before, cpt1, depbefore) {
- xbt_dynar_foreach(file->tasks_after, cpt2, depafter) {
- if (depbefore->src == depafter->dst) {
- XBT_WARN
- ("File %s is produced and consumed by task %s."
- "This loop dependency will prevent the execution of the task.", file->name, depbefore->src->name);
- }
- newfile = SD_task_create_comm_e2e(file->name, NULL, file->amount);
- SD_task_dependency_add(NULL, NULL, depbefore->src, newfile);
- SD_task_dependency_add(NULL, NULL, newfile, depafter->dst);
- xbt_dynar_push(result, &newfile);
+ }
+ for (SD_task_t const& it : *file->predecessors) {
+ for (SD_task_t const& it2 : *file->successors) {
+ if (it == it2) {
+ XBT_WARN("File %s is produced and consumed by task %s."
+ "This loop dependency will prevent the execution of the task.",
+ file->name, it->name);
}
+ newfile = SD_task_create_comm_e2e(file->name, nullptr, file->amount);
+ SD_task_dependency_add(it, newfile);
+ SD_task_dependency_add(newfile, it2);
+ xbt_dynar_push(result, &newfile);
}
}
+ /* Free previous copy of the files */
+ SD_task_destroy(file);
}
/* Push end task last */
xbt_dynar_push(result, &end_task);
- /* Free previous copy of the files */
- xbt_dict_free(&files);
unsigned int cpt;
xbt_dynar_foreach(result, cpt, file) {
if (SD_task_get_kind(file) == SD_TASK_COMM_E2E) {
uniq_transfer_task_name(file);
- } else if (SD_task_get_kind(file) == SD_TASK_COMP_SEQ){
- /* If some tasks do not take files as input, connect them to the root, if
- * they don't produce files, connect them to the end node.
+ } else {
+ /* If some tasks do not take files as input, connect them to the root
+ * if they don't produce files, connect them to the end node.
*/
- if ((file != root_task) && xbt_dynar_is_empty(file->tasks_before)) {
- SD_task_dependency_add(NULL, NULL, root_task, file);
- }
- if ((file != end_task) && xbt_dynar_is_empty(file->tasks_after)) {
- SD_task_dependency_add(NULL, NULL, file, end_task);
+ if ((file != root_task) && (file != end_task)) {
+ if (file->inputs->empty())
+ SD_task_dependency_add(root_task, file);
+ if (file->outputs->empty())
+ SD_task_dependency_add(file, end_task);
}
}
}
- if (!acyclic_graph_detail(result)){
- XBT_ERROR("The DAX described in %s is not a DAG. It contains a cycle.", xbt_basename(filename));
+ if (not acyclic_graph_detail(result)) {
+ XBT_ERROR("The DAX described in %s is not a DAG. It contains a cycle.",
+ simgrid::xbt::Path(filename).get_base_name().c_str());
xbt_dynar_foreach(result, cpt, file)
SD_task_destroy(file);
xbt_dynar_free_container(&result);
- return NULL;
- } else {
- return result;
+ result = nullptr;
}
+
+ return result;
}
-void STag_dax__adag(void)
+void STag_dax__adag()
{
- XBT_ATTRIB_UNUSED double version;
- version = dax_parse_double(A_dax__adag_version);
-
- xbt_assert(version == 2.1, "Expected version 2.1 in <adag> tag, got %f. Fix the parser or your file", version);
+ try {
+ double version = std::stod(std::string(A_dax__adag_version));
+ xbt_assert(version == 2.1, "Expected version 2.1 in <adag> tag, got %f. Fix the parser or your file", version);
+ } catch (std::invalid_argument& ia) {
+ throw std::invalid_argument(std::string("Parse error: ") + A_dax__adag_version + " is not a double");
+ }
}
-void STag_dax__job(void)
+void STag_dax__job()
{
- double runtime = dax_parse_double(A_dax__job_runtime);
- char *name = bprintf("%s@%s", A_dax__job_id, A_dax__job_name);
- runtime *= 4200000000.; /* Assume that timings were done on a 4.2GFlops machine. I mean, why not? */
-// XBT_INFO("See <job id=%s runtime=%s %.0f>",A_dax__job_id,A_dax__job_runtime,runtime);
- current_job = SD_task_create_comp_seq(name, NULL, runtime);
- xbt_dict_set(jobs, A_dax__job_id, current_job, NULL);
- free(name);
- xbt_dynar_push(result, ¤t_job);
+ try {
+ double runtime = std::stod(std::string(A_dax__job_runtime));
+
+ std::string name = std::string(A_dax__job_id) + "@" + A_dax__job_name;
+ runtime *= 4200000000.; /* Assume that timings were done on a 4.2GFlops machine. I mean, why not? */
+ XBT_DEBUG("See <job id=%s runtime=%s %.0f>", A_dax__job_id, A_dax__job_runtime, runtime);
+ current_job = SD_task_create_comp_seq(name.c_str(), nullptr, runtime);
+ jobs.insert({A_dax__job_id, current_job});
+ xbt_dynar_push(result, ¤t_job);
+ } catch (std::invalid_argument& ia) {
+ throw std::invalid_argument(std::string("Parse error: ") + A_dax__job_runtime + " is not a double");
+ }
}
-void STag_dax__uses(void)
+void STag_dax__uses()
{
+ double size;
+ try {
+ size = std::stod(std::string(A_dax__uses_size));
+ } catch (std::invalid_argument& ia) {
+ throw std::invalid_argument(std::string("Parse error: ") + A_dax__uses_size + " is not a double");
+ }
+ bool is_input = (A_dax__uses_link == A_dax__uses_link_input);
+
+ XBT_DEBUG("See <uses file=%s %s>",A_dax__uses_file,(is_input?"in":"out"));
+ auto it = files.find(A_dax__uses_file);
SD_task_t file;
- double size = dax_parse_double(A_dax__uses_size);
- int is_input = (A_dax__uses_link == A_dax__uses_link_input);
-
-// XBT_INFO("See <uses file=%s %s>",A_dax__uses_file,(is_input?"in":"out"));
- file = (SD_task_t)xbt_dict_get_or_null(files, A_dax__uses_file);
- if (file == NULL) {
- file = SD_task_create_comm_e2e(A_dax__uses_file, NULL, size);
- xbt_dynar_pop(sd_global->initial_task_set,NULL);
- xbt_dict_set(files, A_dax__uses_file, file, NULL);
+ if (it == files.end()) {
+ file = SD_task_create_comm_e2e(A_dax__uses_file, nullptr, size);
+ sd_global->initial_tasks->erase(file);
+ files[A_dax__uses_file] = file;
} else {
- if (SD_task_get_amount(file) != size) {
+ file = it->second;
+ if (file->amount < size || file->amount > size) {
XBT_WARN("Ignore file %s size redefinition from %.0f to %.0f", A_dax__uses_file, SD_task_get_amount(file), size);
}
}
if (is_input) {
- SD_task_dependency_add(NULL, NULL, file, current_job);
+ SD_task_dependency_add(file, current_job);
} else {
- SD_task_dependency_add(NULL, NULL, current_job, file);
- if (xbt_dynar_length(file->tasks_before) > 1) {
+ SD_task_dependency_add(current_job, file);
+ if ((file->predecessors->size() + file->inputs->size()) > 1) {
XBT_WARN("File %s created at more than one location...", file->name);
}
}
}
static SD_task_t current_child;
-void STag_dax__child(void)
+void STag_dax__child()
{
- current_child = (SD_task_t)xbt_dict_get_or_null(jobs, A_dax__child_ref);
- xbt_assert(current_child != NULL,"Parse error on line %d: Asked to add dependencies to the non-existent %s task",
- dax_lineno, A_dax__child_ref);
+ auto job = jobs.find(A_dax__child_ref);
+ if (job != jobs.end()) {
+ current_child = job->second;
+ } else {
+ throw std::out_of_range(std::string("Parse error on line ") + std::to_string(dax_lineno) +
+ ": Asked to add dependencies to the non-existent " + A_dax__child_ref + "task");
+ }
}
-void ETag_dax__child(void)
+void ETag_dax__child()
{
- current_child = NULL;
+ current_child = nullptr;
}
-void STag_dax__parent(void)
+void STag_dax__parent()
{
- SD_task_t parent = (SD_task_t)xbt_dict_get_or_null(jobs, A_dax__parent_ref);
- xbt_assert(parent != NULL, "Parse error on line %d: Asked to add a dependency from %s to %s, but %s does not exist",
- dax_lineno, current_child->name, A_dax__parent_ref, A_dax__parent_ref);
- SD_task_dependency_add(NULL, NULL, parent, current_child);
- XBT_DEBUG("Control-flow dependency from %s to %s", current_child->name, parent->name);
+ auto job = jobs.find(A_dax__parent_ref);
+ if (job != jobs.end()) {
+ SD_task_t parent = job->second;
+ SD_task_dependency_add(parent, current_child);
+ XBT_DEBUG("Control-flow dependency from %s to %s", current_child->name, parent->name);
+ } else {
+ throw std::out_of_range(std::string("Parse error on line ") + std::to_string(dax_lineno) +
+ ": Asked to add a dependency from " + current_child->name + " to " + A_dax__parent_ref +
+ ", but " + A_dax__parent_ref + " does not exist");
+ }
}
-void ETag_dax__adag(void)
+void ETag_dax__adag()
{
-// XBT_INFO("See </adag>");
+ XBT_DEBUG("See </adag>");
}
-void ETag_dax__job(void)
+void ETag_dax__job()
{
- current_job = NULL;
-// XBT_INFO("See </job>");
+ current_job = nullptr;
+ XBT_DEBUG("See </job>");
}
-void ETag_dax__parent(void)
+void ETag_dax__parent()
{
-// XBT_INFO("See </parent>");
+ XBT_DEBUG("See </parent>");
}
-void ETag_dax__uses(void)
+void ETag_dax__uses()
{
-// XBT_INFO("See </uses>");
+ XBT_DEBUG("See </uses>");
}
