A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
merge branches
[simgrid.git]
/
teshsuite
/
simdag
/
network
/
p2p
/
test_latency3.c
diff --git
a/teshsuite/simdag/network/p2p/test_latency3.c
b/teshsuite/simdag/network/p2p/test_latency3.c
index
585ad93
..
bf69383
100644
(file)
--- a/
teshsuite/simdag/network/p2p/test_latency3.c
+++ b/
teshsuite/simdag/network/p2p/test_latency3.c
@@
-1,10
+1,10
@@
+/* Latency tests */
-/*
- * SimDag
- * Latency tests
- * Copyright (C) 2007
- * Sascha Hunold, Frederic Suter
- */
+/* Copyright (c) 2007, 2009, 2010. 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 <stdio.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdlib.h>
@@
-19,7
+19,8
@@
*
*/
*
*/
-int main(int argc, char **argv) {
+int main(int argc, char **argv)
+{
double time;
SD_task_t root;
SD_task_t task1;
double time;
SD_task_t root;
SD_task_t task1;
@@
-28,37
+29,38
@@
int main(int argc, char **argv) {
double communication_amount2[] = { 0.0, 0.0, 1.0, 0.0 };
double no_cost1[] = { 0.0 };
double no_cost[] = { 0.0, 0.0 };
double communication_amount2[] = { 0.0, 0.0, 1.0, 0.0 };
double no_cost1[] = { 0.0 };
double no_cost[] = { 0.0, 0.0 };
-
+ xbt_dynar_t ret;
+
SD_init(&argc, argv);
SD_create_environment(argv[1]);
SD_init(&argc, argv);
SD_create_environment(argv[1]);
- root
= SD_task_create("Root", NULL, 1.0);
+ root = SD_task_create("Root", NULL, 1.0);
task1 = SD_task_create("Comm 1", NULL, 1.0);
task2 = SD_task_create("Comm 2", NULL, 1.0);
task1 = SD_task_create("Comm 1", NULL, 1.0);
task2 = SD_task_create("Comm 2", NULL, 1.0);
-
+
SD_task_schedule(root, 1, SD_workstation_get_list(), no_cost1,
SD_task_schedule(root, 1, SD_workstation_get_list(), no_cost1,
-
no_cost1, -1.0);
+ no_cost1, -1.0);
SD_task_schedule(task1, 2, SD_workstation_get_list(), no_cost,
SD_task_schedule(task1, 2, SD_workstation_get_list(), no_cost,
-
communication_amount1, -1.0);
+ communication_amount1, -1.0);
SD_task_schedule(task2, 2, SD_workstation_get_list(), no_cost,
SD_task_schedule(task2, 2, SD_workstation_get_list(), no_cost,
-
communication_amount2, -1.0);
-
+ communication_amount2, -1.0);
+
SD_task_dependency_add(NULL, NULL, root, task1);
SD_task_dependency_add(NULL, NULL, root, task1);
- SD_task_dependency_add(NULL, NULL, root, task2);
-
- SD_simulate(-1.0);
-
+ SD_task_dependency_add(NULL, NULL, root, task2);
+
+ ret = SD_simulate(-1.0);
+ xbt_dynar_free(&ret);
+
time = SD_get_clock();
printf("%g\n", time);
fflush(stdout);
time = SD_get_clock();
printf("%g\n", time);
fflush(stdout);
-
+
SD_task_destroy(root);
SD_task_destroy(task1);
SD_task_destroy(task2);
SD_task_destroy(root);
SD_task_destroy(task1);
SD_task_destroy(task2);
-
+
SD_exit();
SD_exit();
-
+
return 0;
}
return 0;
}
-