# | Line 40 | Line 40 | |
---|---|---|
40 | */ | |
41 | #include <algorithm> | |
42 | #include "brains/BlockSnapshotManager.hpp" | |
43 | + | #include "utils/residentMem.h" |
44 | #include "utils/physmem.h" | |
45 | #include "utils/Algorithm.hpp" | |
46 | #include "brains/SimInfo.hpp" | |
# | Line 48 | Line 49 | BlockSnapshotManager::BlockSnapshotManager(SimInfo* in | |
49 | namespace oopse { | |
50 | BlockSnapshotManager::BlockSnapshotManager(SimInfo* info, const std::string& filename, | |
51 | int storageLayout, int blockCapacity) | |
52 | < | : SnapshotManager(storageLayout), info_(info), blockCapacity_(blockCapacity), activeBlocks_(blockCapacity_, -1) { |
52 | > | : SnapshotManager(storageLayout), info_(info), blockCapacity_(blockCapacity), |
53 | > | activeBlocks_(blockCapacity_, -1), activeRefCount_(blockCapacity_, 0) { |
54 | ||
55 | nAtoms_ = info->getNGlobalAtoms(); | |
56 | nRigidBodies_ = info->getNGlobalRigidBodies(); | |
57 | ||
58 | + | double physMem = physmem_total(); |
59 | double avalPhysMem = physmem_available(); | |
60 | < | |
60 | > | double rssMem = residentMem(); |
61 | > | |
62 | > | std::cout << "physmem = " << physMem << "\t availablePhysMem = " << avalPhysMem << "\trssMem = "<< rssMem<<std::endl; |
63 | int bytesPerStuntDouble = DataStorage::getBytesPerStuntDouble(storageLayout); | |
64 | ||
65 | int bytesPerFrame = (nRigidBodies_ + nAtoms_) * bytesPerStuntDouble; | |
66 | ||
67 | < | int frameCapacity = int (avalPhysMem / bytesPerFrame); |
67 | > | int frameCapacity = int (rssMem / bytesPerFrame); |
68 | ||
69 | nSnapshotPerBlock_ = frameCapacity /blockCapacity_ ; | |
70 | ||
# | Line 77 | Line 82 | BlockSnapshotManager::BlockSnapshotManager(SimInfo* in | |
82 | //the last block may not have nSnapshotPerBlock frames, we need to consider this special situation | |
83 | blocks_.back().second = nframes_; | |
84 | ||
85 | < | snapshots_.insert(snapshots_.begin(), nframes_,(Snapshot*)(NULL)); |
85 | > | snapshots_.insert(snapshots_.begin(), nframes_, static_cast<Snapshot*>(NULL)); |
86 | ||
87 | } | |
88 | ||
# | Line 97 | Line 102 | int BlockSnapshotManager::getNActiveBlocks() { | |
102 | } | |
103 | ||
104 | int BlockSnapshotManager::getNActiveBlocks() { | |
105 | + | #ifdef __RWSTD |
106 | + | int count = 0; |
107 | + | std::count_if(activeBlocks_.begin(), activeBlocks_.end(), std::bind2nd(std::not_equal_to<int>(), -1), count); |
108 | + | return count; |
109 | + | #else |
110 | return std::count_if(activeBlocks_.begin(), activeBlocks_.end(), std::bind2nd(std::not_equal_to<int>(), -1)); | |
111 | + | #endif |
112 | } | |
113 | ||
103 | – | bool BlockSnapshotManager::isBlockActive(int block) { |
104 | – | return std::find(activeBlocks_.begin(), activeBlocks_.end(), block) != activeBlocks_.end() ? true : false; |
105 | – | } |
114 | ||
115 | + | |
116 | bool BlockSnapshotManager::loadBlock(int block) { | |
117 | + | std::vector<int>::iterator i = findActiveBlock(block); |
118 | bool loadSuccess; | |
119 | < | if (isBlockActive(block)) { |
119 | > | if (i != activeBlocks_.end()) { |
120 | > | //if block is already in memory, just increast the reference count |
121 | > | ++activeRefCount_[i - activeBlocks_.begin()]; |
122 | loadSuccess = true; | |
123 | } else if (getNActiveBlocks() < blockCapacity_){ | |
124 | < | |
125 | < | for (int i = blocks_[block].first; i < blocks_[block].second; ++i) { |
114 | < | snapshots_[i] = loadFrame(i); |
115 | < | } |
116 | < | |
117 | < | std::vector<int>::iterator j; |
118 | < | j = std::find(activeBlocks_.begin(), activeBlocks_.end(), -1); |
119 | < | assert(j != activeBlocks_.end()); |
120 | < | *j = block; |
124 | > | //if number of active blocks is less than the block capacity, just load it |
125 | > | internalLoad(block); |
126 | loadSuccess = true; | |
127 | < | }else { |
127 | > | } else if (hasZeroRefBlock() > 0) { |
128 | > | //if already reach the block capacity, need to unload a block with 0 reference |
129 | > | int zeroRefBlock = getFirstZeroRefBlock(); |
130 | > | assert(zeroRefBlock != -1); |
131 | > | internalUnload(zeroRefBlock); |
132 | > | internalLoad(block); |
133 | > | } else { |
134 | > | //reach the capacity and all blocks in memory are not zero reference |
135 | loadSuccess = false; | |
136 | } | |
137 | < | |
137 | > | |
138 | return loadSuccess; | |
139 | } | |
140 | ||
141 | bool BlockSnapshotManager::unloadBlock(int block) { | |
142 | bool unloadSuccess; | |
143 | < | if (!isBlockActive(block)){ |
144 | < | unloadSuccess = false; |
145 | < | } else { |
146 | < | for (int i = blocks_[block].first; i < blocks_[block].second; ++i) { |
147 | < | delete snapshots_[i]; |
148 | < | snapshots_[i] = NULL; |
143 | > | std::vector<int>::iterator i = findActiveBlock(block); |
144 | > | |
145 | > | if (i != activeBlocks_.end()){ |
146 | > | --activeRefCount_[i - activeBlocks_.begin()]; |
147 | > | if (activeRefCount_[i - activeBlocks_.begin()] < 0) { |
148 | > | //in case, unloadBlock called multiple times |
149 | > | activeRefCount_[i - activeBlocks_.begin()] = 0; |
150 | } | |
151 | < | std::vector<int>::iterator j; |
139 | < | j = std::find(activeBlocks_.begin(), activeBlocks_.end(), block); |
140 | < | assert(j != activeBlocks_.end()); |
141 | < | *j = -1; |
151 | > | |
152 | unloadSuccess = true; | |
153 | + | } else { |
154 | + | unloadSuccess = false; |
155 | } | |
156 | ||
157 | return unloadSuccess; | |
158 | } | |
159 | ||
160 | + | void BlockSnapshotManager::internalLoad(int block) { |
161 | + | |
162 | + | for (int i = blocks_[block].first; i < blocks_[block].second; ++i) { |
163 | + | snapshots_[i] = loadFrame(i); |
164 | + | } |
165 | + | |
166 | + | std::vector<int>::iterator j; |
167 | + | j = std::find(activeBlocks_.begin(), activeBlocks_.end(), -1); |
168 | + | assert(j != activeBlocks_.end()); |
169 | + | *j = block; |
170 | + | ++activeRefCount_[j - activeBlocks_.begin()]; |
171 | + | } |
172 | + | |
173 | + | void BlockSnapshotManager::internalUnload(int block) { |
174 | + | for (int i = blocks_[block].first; i < blocks_[block].second; ++i) { |
175 | + | delete snapshots_[i]; |
176 | + | snapshots_[i] = NULL; |
177 | + | } |
178 | + | std::vector<int>::iterator j; |
179 | + | j = std::find(activeBlocks_.begin(), activeBlocks_.end(), block); |
180 | + | assert(j != activeBlocks_.end()); |
181 | + | *j = -1; |
182 | + | } |
183 | + | |
184 | + | bool BlockSnapshotManager::hasZeroRefBlock(){ |
185 | + | return std::find(activeRefCount_.begin(), activeRefCount_.end(), 0) != activeRefCount_.end() ? true : false; |
186 | + | } |
187 | + | |
188 | + | int BlockSnapshotManager::getFirstZeroRefBlock(){ |
189 | + | std::vector<int>::iterator i = std::find(activeRefCount_.begin(), activeRefCount_.end(), 0); |
190 | + | return i != activeRefCount_.end() ? activeBlocks_[i - activeRefCount_.begin()] : -1; |
191 | + | } |
192 | + | |
193 | std::vector<int> BlockSnapshotManager::getActiveBlocks() { | |
194 | std::vector<int> result; | |
195 | oopse::copy_if(activeBlocks_.begin(), activeBlocks_.end(), std::back_inserter(result), |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |