-
Notifications
You must be signed in to change notification settings - Fork 2.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #17471 from hrydgard/reduce-zero-initialization
Reduce zero initialization and copying overhead of render commands
- Loading branch information
Showing
14 changed files
with
353 additions
and
158 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,137 @@ | ||
| #pragma once | ||
|
|
||
| // Yet another replacement for std::vector, this time for use in graphics queues. | ||
| // Its major difference is that you can append uninitialized structures and initialize them after. | ||
| // This is not allows by std::vector but is very useful for our sometimes oversized unions. | ||
| // Also, copies during resize are done by memcpy, not by any move constructor or similar. | ||
|
|
||
| #include <cstdlib> | ||
| #include <cstring> | ||
|
|
||
| template<class T> | ||
| class FastVec { | ||
| public: | ||
| FastVec() {} | ||
| FastVec(size_t initialCapacity) { | ||
| capacity_ = initialCapacity; | ||
| data_ = (T *)malloc(initialCapacity * sizeof(T)); | ||
| } | ||
| ~FastVec() { if (data_) free(data_); } | ||
|
|
||
| T &push_uninitialized() { | ||
| if (size_ < capacity_) { | ||
| size_++; | ||
| return data_[size_ - 1]; | ||
| } else { | ||
| ExtendByOne(); | ||
| return data_[size_ - 1]; | ||
| } | ||
| } | ||
|
|
||
| void push_back(const T &t) { | ||
| T &dest = push_uninitialized(); | ||
| dest = t; | ||
| } | ||
|
|
||
| // Move constructor | ||
| FastVec(FastVec &&other) { | ||
| data_ = other.data_; | ||
| size_ = other.size_; | ||
| capacity_ = other.capacity_; | ||
| other.data_ = nullptr; | ||
| other.size_ = 0; | ||
| other.capacity_ = 0; | ||
| } | ||
|
|
||
| FastVec &operator=(FastVec &&other) { | ||
| if (this != &other) { | ||
| delete[] data_; | ||
| data_ = other.data_; | ||
| size_ = other.size_; | ||
| capacity_ = other.capacity_; | ||
| other.data_ = nullptr; | ||
| other.size_ = 0; | ||
| other.capacity_ = 0; | ||
| } | ||
| return *this; | ||
| } | ||
|
|
||
| // No copy constructor. | ||
| FastVec(const FastVec &other) = delete; | ||
| FastVec &operator=(const FastVec &other) = delete; | ||
|
|
||
| size_t size() const { return size_; } | ||
| size_t capacity() const { return capacity_; } | ||
| void clear() { size_ = 0; } | ||
| bool empty() const { return size_ == 0; } | ||
|
|
||
| T *begin() { return data_; } | ||
| T *end() { return data_ + size_; } | ||
| const T *begin() const { return data_; } | ||
| const T *end() const { return data_ + size_; } | ||
|
|
||
| // Out of bounds (past size() - 1) is undefined behavior. | ||
| T &operator[] (const size_t index) { return data_[index]; } | ||
| const T &operator[] (const size_t index) const { return data_[index]; } | ||
| T &at(const size_t index) { return data_[index]; } | ||
| const T &at(const size_t index) const { return data_[index]; } | ||
|
|
||
| // These two are invalid if empty(). | ||
| const T &back() const { return (*this)[size() - 1]; } | ||
| const T &front() const { return (*this)[0]; } | ||
|
|
||
| // Limited functionality for inserts and similar, add as needed. | ||
| T &insert(T *iter) { | ||
| int pos = iter - data_; | ||
| ExtendByOne(); | ||
| if (pos + 1 < size_) { | ||
| memmove(data_ + pos + 1, data_ + pos, (size_ - pos) * sizeof(T)); | ||
| } | ||
| return data_[pos]; | ||
| } | ||
|
|
||
| void insert(T *destIter, const T *beginIter, const T *endIter) { | ||
| int pos = destIter - data_; | ||
| if (beginIter == endIter) | ||
| return; | ||
| size_t newItems = endIter - beginIter; | ||
| IncreaseCapacityTo(size_ + newItems); | ||
| memmove(data_ + pos + newItems, data_ + pos, (size_ - pos) * sizeof(T)); | ||
| memcpy(data_ + pos, beginIter, newItems * sizeof(T)); | ||
| size_ += newItems; | ||
| } | ||
|
|
||
| void resize(size_t size) { | ||
| if (size < size_) { | ||
| size_ = size; | ||
| } else { | ||
| // TODO | ||
| } | ||
| } | ||
|
|
||
| private: | ||
| void IncreaseCapacityTo(size_t newCapacity) { | ||
| if (newCapacity <= capacity_) | ||
| return; | ||
| T *oldData = data_; | ||
| data_ = (T *)malloc(sizeof(T) * newCapacity); | ||
| if (capacity_ != 0) { | ||
| memcpy(data_, oldData, sizeof(T) * size_); | ||
| free(oldData); | ||
| } | ||
| } | ||
|
|
||
| void ExtendByOne() { | ||
| size_t newCapacity = capacity_ * 2; | ||
| if (newCapacity < 16) { | ||
| newCapacity = 16; | ||
| } | ||
| IncreaseCapacityTo(newCapacity); | ||
| size_++; | ||
| capacity_ = newCapacity; | ||
| } | ||
|
|
||
| size_t size_ = 0; | ||
| size_t capacity_ = 0; | ||
| T *data_ = nullptr; | ||
| }; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.