- Timestamp:
- Apr 15, 2013, 9:43:05 PM (13 years ago)
- Children:
- d6a338
- Parents:
- dc7dc9
- Location:
- src
- Files:
-
- 12 edited
-
base/interface.cpp (modified) (5 diffs)
-
comm/comm_mpi.cpp (modified) (1 diff)
-
comm/comm_serial.cpp (modified) (1 diff)
-
comm/domain_decomposition_mpi.cpp (modified) (2 diffs)
-
grid/grid.cpp (modified) (2 diffs)
-
grid/grid.hpp (modified) (1 diff)
-
grid/grid_properties.hpp (modified) (1 diff)
-
grid/is_grid.hpp (modified) (2 diffs)
-
grid/tempgrid.cpp (modified) (3 diffs)
-
solver/solver.cpp (modified) (1 diff)
-
solver/solver_regular.cpp (modified) (1 diff)
-
solver/solver_singular.cpp (modified) (3 diffs)
Legend:
- Unmodified
- Added
- Removed
-
src/base/interface.cpp
rdc7dc9 re58835d 61 61 //TODO: Change this to max_boundary_nodes at one point 62 62 while (global.size() == 0 || 63 (bc[0] == Open && global.back().GlobalSize New()[0] > Helper::intpow(2, levelMin)+1) ||64 (bc[1] == Open && global.back().GlobalSize New()[1] > Helper::intpow(2, levelMin)+1) ||65 (bc[2] == Open && global.back().GlobalSize New()[2] > Helper::intpow(2, levelMin)+1)) {63 (bc[0] == Open && global.back().GlobalSize()[0] > Helper::intpow(2, levelMin)+1) || 64 (bc[1] == Open && global.back().GlobalSize()[1] > Helper::intpow(2, levelMin)+1) || 65 (bc[2] == Open && global.back().GlobalSize()[2] > Helper::intpow(2, levelMin)+1)) { 66 66 67 67 global.push_back(GlobalIndices()); … … 82 82 global.back().LocalEnd() = (num_cells + inner_boundary) / 2 + add_node; 83 83 84 global.back().GlobalSize New() = global.back().LocalSize();84 global.back().GlobalSize() = global.back().LocalSize(); 85 85 global.back().GlobalBegin() = global.back().LocalBegin(); 86 86 global.back().GlobalEnd() = global.back().LocalEnd(); … … 112 112 global.back().LocalEnd() = num_cells/2 + add_node; 113 113 114 global.back().GlobalSize New() = global.back().LocalSize();114 global.back().GlobalSize() = global.back().LocalSize(); 115 115 global.back().GlobalBegin() = global.back().LocalBegin(); 116 116 global.back().GlobalEnd() = global.back().LocalEnd(); … … 124 124 } 125 125 126 while (global.back().GlobalSize New().Min() > Helper::intpow(2, levelMin)+1) {126 while (global.back().GlobalSize().Min() > Helper::intpow(2, levelMin)+1) { 127 127 128 128 num_cells /= 2; … … 140 140 global.back().LocalEnd() = num_cells/2 + add_node; 141 141 142 global.back().GlobalSize New() = global.back().LocalSize();142 global.back().GlobalSize() = global.back().LocalSize(); 143 143 global.back().GlobalBegin() = global.back().LocalBegin(); 144 144 global.back().GlobalEnd() = global.back().LocalEnd(); -
src/comm/comm_mpi.cpp
rdc7dc9 re58835d 487 487 << " GLOBAL_BEGIN: " << grid.Global().GlobalBegin() << std::endl 488 488 << " GLOBAL_END: " << grid.Global().GlobalEnd() << std::endl 489 << " GLOBAL_SIZE: " << grid.Global().GlobalSize New() << std::endl489 << " GLOBAL_SIZE: " << grid.Global().GlobalSize() << std::endl 490 490 << " GLOBAL_BEGIN_FINEST: " << grid.Global().GlobalBeginFinest() << std::endl 491 491 << " GLOBAL_END_FINEST: " << grid.Global().GlobalEndFinest() << std::endl -
src/comm/comm_serial.cpp
rdc7dc9 re58835d 329 329 << " GLOBAL_BEGIN: " << (*mg)(i).Global().GlobalBegin() << std::endl 330 330 << " GLOBAL_END: " << (*mg)(i).Global().GlobalEnd() << std::endl 331 << " GLOBAL_SIZE: " << (*mg)(i).Global().GlobalSize New() << std::endl331 << " GLOBAL_SIZE: " << (*mg)(i).Global().GlobalSize() << std::endl 332 332 << " GLOBAL_BEGIN_FINEST: " << (*mg)(i).Global().GlobalBeginFinest() << std::endl 333 333 << " GLOBAL_END_FINEST: " << (*mg)(i).Global().GlobalEndFinest() << std::endl -
src/comm/domain_decomposition_mpi.cpp
rdc7dc9 re58835d 51 51 global_l = interface->Global()[i]; 52 52 53 if (IsActive(comm, global_l.GlobalSize New(), procs)) {53 if (IsActive(comm, global_l.GlobalSize(), procs)) { 54 54 55 55 if (i == 0) { 56 56 57 remainder = global_l.GlobalSize New() % procs;57 remainder = global_l.GlobalSize() % procs; 58 58 59 global_l.LocalSize() = global_l.GlobalSize New() / procs;59 global_l.LocalSize() = global_l.GlobalSize() / procs; 60 60 for (int j=0; j<3; ++j) 61 61 if (comm->GlobalPos()[j] < remainder[j]) … … 89 89 } else { 90 90 91 remainder[j] = global_l.GlobalSize New()[j] % procs[j];91 remainder[j] = global_l.GlobalSize()[j] % procs[j]; 92 92 93 global_l.LocalSize()[j] = global_l.GlobalSize New()[j] / procs[j];93 global_l.LocalSize()[j] = global_l.GlobalSize()[j] / procs[j]; 94 94 if (comm->GlobalPos()[j] < remainder[j]) 95 95 ++(global_l.LocalSize()[j]); -
src/grid/grid.cpp
rdc7dc9 re58835d 126 126 avg += GetVal(*iter); 127 127 128 avg = MG::GetComm()->GlobalSum(avg) / Global().GlobalSize New().Product();128 avg = MG::GetComm()->GlobalSum(avg) / Global().GlobalSize().Product(); 129 129 130 130 MG::GetComm()->PrintOnce(Info, "Global constraint enforcement: %e", avg); … … 143 143 val += GetVal(*iter); 144 144 145 val = MG::GetComm()->GlobalSum(val) / Global().GlobalSize New().Product();145 val = MG::GetComm()->GlobalSum(val) / Global().GlobalSize().Product(); 146 146 147 147 if (std::abs(val) > std::numeric_limits<vmg_float>::epsilon()) { -
src/grid/grid.hpp
rdc7dc9 re58835d 186 186 { 187 187 return z - global.GlobalBegin().X() 188 + global.GlobalSize New().Z() * (y - global.GlobalBegin().Y()189 + global.GlobalSize New().Y() * (x - global.GlobalBegin().X()));188 + global.GlobalSize().Z() * (y - global.GlobalBegin().Y() 189 + global.GlobalSize().Y() * (x - global.GlobalBegin().X())); 190 190 } 191 191 -
src/grid/grid_properties.hpp
rdc7dc9 re58835d 63 63 Index& GlobalBegin() {return global_begin;} 64 64 Index& GlobalEnd() {return global_end;} 65 Index& GlobalSize New() {return global_size;}65 Index& GlobalSize() {return global_size;} 66 66 67 67 const Index& GlobalBegin() const {return global_begin;} 68 68 const Index& GlobalEnd() const {return global_end;} 69 const Index& GlobalSize New() const {return global_size;}69 const Index& GlobalSize() const {return global_size;} 70 70 71 71 Index& GlobalBeginFinest() {return global_begin_finest;} -
src/grid/is_grid.hpp
rdc7dc9 re58835d 171 171 inline int IsGrid<T>::GlobalLinearIndex(int x, int y, int z) const 172 172 { 173 return z + global.GlobalSize New().Z() * (y + global.GlobalSizeNew().Y() * x);173 return z + global.GlobalSize().Z() * (y + global.GlobalSize().Y() * x); 174 174 } 175 175 … … 177 177 inline int IsGrid<T>::GlobalLinearIndex(const Index& index) const 178 178 { 179 return index.Z() + global.GlobalSize New().Z() * (index.Y() + global.GlobalSizeNew().Y() * index.X());179 return index.Z() + global.GlobalSize().Z() * (index.Y() + global.GlobalSize().Y() * index.X()); 180 180 } 181 181 -
src/grid/tempgrid.cpp
rdc7dc9 re58835d 67 67 global.GlobalBegin() = 0; 68 68 global.GlobalEnd() = size; 69 global.GlobalSize New() = size;69 global.GlobalSize() = size; 70 70 global.GlobalBeginFinest() = 0; 71 71 global.GlobalEndFinest() = size; … … 113 113 global.GlobalBegin() = grid_finer.Global().GlobalBegin(); 114 114 global.GlobalEnd() = grid_finer.Global().GlobalEnd(); 115 global.GlobalSize New() = grid_finer.Global().GlobalSizeNew();115 global.GlobalSize() = grid_finer.Global().GlobalSize(); 116 116 117 117 global.GlobalBeginFinest() = grid_finer.Global().GlobalBeginFinest(); … … 202 202 global.GlobalBegin() = grid.Global().GlobalBegin(); 203 203 global.GlobalEnd() = grid.Global().GlobalEnd(); 204 global.GlobalSize New() = grid.Global().GlobalSizeNew();204 global.GlobalSize() = grid.Global().GlobalSize(); 205 205 206 206 global.GlobalBeginFinest() = grid.Global().GlobalBeginFinest(); -
src/solver/solver.cpp
rdc7dc9 re58835d 70 70 void Solver::Realloc(Grid& sol) 71 71 { 72 this->Realloc(sol.Global().GlobalSize New().Product());72 this->Realloc(sol.Global().GlobalSize().Product()); 73 73 } -
src/solver/solver_regular.cpp
rdc7dc9 re58835d 56 56 #endif 57 57 58 this->Realloc(rhs.Global().GlobalSize New().Product());58 this->Realloc(rhs.Global().GlobalSize().Product()); 59 59 60 60 for (grid_iter = rhs.Iterators().Local().Begin(); grid_iter != rhs.Iterators().Local().End(); ++grid_iter) { -
src/solver/solver_singular.cpp
rdc7dc9 re58835d 60 60 61 61 // Make sure that arrays are big enough to hold expanded system of equations 62 this->Realloc(rhs.Global().GlobalSize New().Product() + 1);62 this->Realloc(rhs.Global().GlobalSize().Product() + 1); 63 63 64 64 for (grid_iter = rhs.Iterators().Local().Begin(); grid_iter != rhs.Iterators().Local().End(); ++grid_iter) { … … 87 87 if (comm->BoundaryConditions()[j] == Periodic) { 88 88 if (i[j] < rhs.Global().GlobalBegin()[j]) 89 i[j] += rhs.Global().GlobalSize New()[j];89 i[j] += rhs.Global().GlobalSize()[j]; 90 90 else if (i[j] >= rhs.Global().GlobalEnd()[j]) 91 i[j] -= rhs.Global().GlobalSize New()[j];91 i[j] -= rhs.Global().GlobalSize()[j]; 92 92 } 93 93 … … 137 137 sol.Global().LocalBegin().Z() + k); 138 138 139 assert(index >= 0 && index < sol.Global().GlobalSize New().Product());139 assert(index >= 0 && index < sol.Global().GlobalSize().Product()); 140 140 141 141 // Set solution
Note:
See TracChangeset
for help on using the changeset viewer.
