From: Stéphane Castelli Date: Tue, 13 May 2014 08:53:37 +0000 (+0200) Subject: Add a function returning an instance of fat tree X-Git-Tag: v3_11~81 X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/commitdiff_plain/f9825904050fcc814a82d1bbe4a698020afc31dc Add a function returning an instance of fat tree --- diff --git a/src/surf/surf_routing_cluster_fat_tree.cpp b/src/surf/surf_routing_cluster_fat_tree.cpp index 5733fd30d7..cfa9a5b54b 100644 --- a/src/surf/surf_routing_cluster_fat_tree.cpp +++ b/src/surf/surf_routing_cluster_fat_tree.cpp @@ -8,6 +8,10 @@ +AS_t model_fatTree_cluster_create(void) { + return new AsClusterFatTree(); +} + AsClusterFatTree::AsClusterFatTree() : levels(0) {} AsClusterFatTree::~AsClusterFatTree() { diff --git a/src/surf/surf_routing_cluster_fat_tree.hpp b/src/surf/surf_routing_cluster_fat_tree.hpp index edc48f1ab8..7d5b21515f 100644 --- a/src/surf/surf_routing_cluster_fat_tree.hpp +++ b/src/surf/surf_routing_cluster_fat_tree.hpp @@ -10,6 +10,8 @@ #define SURF_ROUTING_CLUSTER_FAT_TREE_HPP_ +AS_t model_fatTree_cluster_create(void); + /* The class AsClusterFatTree describes PGFT, as introduced by Eitan Zahavi * in "D-Mod-K Routing Providing Non-Blocking Traffic for Shift Permutations * on Real Life Fat Trees" (2010). RLFT are PGFT with some restrictions to