PT: TODO: re-inline this
| 164 | |
| 165 | // PT: TODO: re-inline this |
| 166 | void PrunerExt::growDirtyList(PrunerHandle handle) |
| 167 | { |
| 168 | // pruners must either provide indices in order or reuse existing indices, so this 'if' is enough to ensure we have space for the new handle |
| 169 | // PT: TODO: fix this. There is just no need for any of it. The pruning pool itself could support the feature for free, similar to what we do |
| 170 | // in MBP. There would be no need for the bitmap or the dirty list array. However doing this through the virtual interface would be clumsy, |
| 171 | // adding the cost of virtual calls for very cheap & simple operations. It would be a lot easier to drop it and go back to what we had before. |
| 172 | |
| 173 | Cm::BitMap& dirtyMap = mDirtyMap; |
| 174 | if(dirtyMap.size() <= handle) |
| 175 | dirtyMap.resize(PxMax<PxU32>(dirtyMap.size() * 2, 1024)); |
| 176 | PX_ASSERT(handle<dirtyMap.size()); |
| 177 | dirtyMap.reset(handle); |
| 178 | } |
| 179 | |
| 180 | /////////////////////////////////////////////////////////////////////////////// |
| 181 |
no test coverage detected