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
As::bypassRoutes_ does not need to be a reference
[simgrid.git]
/
src
/
s4u
/
s4u_storage.cpp
diff --git
a/src/s4u/s4u_storage.cpp
b/src/s4u/s4u_storage.cpp
index 3b0841bbaa87c4284e1c24317bc39e233ec29cdc..6b99ef8bde02111bb030a6031a460fb4964a34d1 100644
(file)
--- a/
src/s4u/s4u_storage.cpp
+++ b/
src/s4u/s4u_storage.cpp
@@
-12,12
+12,12
@@
extern xbt_lib_t storage_lib;
namespace simgrid {
namespace s4u {
namespace simgrid {
namespace s4u {
-boost::unordered_map <std::string, Storage *> *Storage::storages = new boost::unordered_map<std::string, Storage*> ();
+boost::unordered_map <std::string, Storage *> *Storage::storages
_
= new boost::unordered_map<std::string, Storage*> ();
Storage::Storage(std::string name, smx_storage_t inferior) {
Storage::Storage(std::string name, smx_storage_t inferior) {
-
p_name
= name;
-
p_inferior
= inferior;
+
name_
= name;
+
inferior_
= inferior;
- storages->insert({name, this});
+ storages
_
->insert({name, this});
}
Storage::~Storage() {
}
Storage::~Storage() {
@@
-25,12
+25,12
@@
Storage::~Storage() {
}
smx_storage_t Storage::inferior() {
}
smx_storage_t Storage::inferior() {
- return
p_inferior
;
+ return
inferior_
;
}
Storage &Storage::byName(const char*name) {
s4u::Storage *res = NULL;
try {
}
Storage &Storage::byName(const char*name) {
s4u::Storage *res = NULL;
try {
- res = storages->at(name);
+ res = storages
_
->at(name);
} catch (std::out_of_range& e) {
smx_storage_t inferior = xbt_lib_get_elm_or_null(storage_lib,name);
if (inferior == NULL)
} catch (std::out_of_range& e) {
smx_storage_t inferior = xbt_lib_get_elm_or_null(storage_lib,name);
if (inferior == NULL)
@@
-42,17
+42,17
@@
Storage &Storage::byName(const char*name) {
}
const char*Storage::name() {
}
const char*Storage::name() {
- return
p_name
.c_str();
+ return
name_
.c_str();
}
}
-sg_size_t Storage::size
_f
ree() {
- return simcall_storage_get_free_size(
p_inferior
);
+sg_size_t Storage::size
F
ree() {
+ return simcall_storage_get_free_size(
inferior_
);
}
}
-sg_size_t Storage::size
_u
sed() {
- return simcall_storage_get_used_size(
p_inferior
);
+sg_size_t Storage::size
U
sed() {
+ return simcall_storage_get_used_size(
inferior_
);
}
sg_size_t Storage::size() {
}
sg_size_t Storage::size() {
- return SIMIX_storage_get_size(
p_inferior
);
+ return SIMIX_storage_get_size(
inferior_
);
}
} /* namespace s4u */
}
} /* namespace s4u */