forked from ap-hynninen/cutt
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Faster CPU algorithms. Easier vector library. Cache for frequent CUDA…
… API calls.
- Loading branch information
1 parent
2ac2096
commit acb7958
Showing
13 changed files
with
1,027 additions
and
1,129 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,98 @@ | ||
| /****************************************************************************** | ||
| MIT License | ||
| Copyright (c) 2016 Antti-Pekka Hynninen | ||
| Copyright (c) 2016 NVIDIA | ||
| Permission is hereby granted, free of charge, to any person obtaining a copy | ||
| of this software and associated documentation files (the "Software"), to deal | ||
| in the Software without restriction, including without limitation the rights | ||
| to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | ||
| copies of the Software, and to permit persons to whom the Software is | ||
| furnished to do so, subject to the following conditions: | ||
| The above copyright notice and this permission notice shall be included in all | ||
| copies or substantial portions of the Software. | ||
| THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | ||
| IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | ||
| FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | ||
| AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | ||
| LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | ||
| OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | ||
| SOFTWARE. | ||
| *******************************************************************************/ | ||
|
|
||
| #include <utility> | ||
| #include <list> | ||
| #include <unordered_map> | ||
|
|
||
| using namespace std; | ||
|
|
||
| // | ||
| // Simple LRU cache implementation | ||
| // | ||
| template <typename key_type, typename value_type> | ||
| class LRUCache { | ||
| private: | ||
|
|
||
| struct ValueIterator { | ||
| value_type value; | ||
| typename list<key_type>::iterator it; | ||
| }; | ||
|
|
||
| // Size of the cache | ||
| const size_t capacity; | ||
|
|
||
| // Value that is returned when the key is not found | ||
| const value_type null_value; | ||
|
|
||
| // Double linked list of keys. Oldest is at the back | ||
| list<key_type> keys; | ||
|
|
||
| // Cache: (hash table) | ||
| // key = key | ||
| // value = {value, pointer to linked list} | ||
| unordered_map<key_type, ValueIterator> cache; | ||
|
|
||
| public: | ||
|
|
||
| LRUCache(const size_t capacity, const value_type null_value) : capacity(capacity), null_value(null_value) {} | ||
|
|
||
| value_type get(key_type key) { | ||
| auto it = cache.find(key); | ||
| if (it == cache.end()) return null_value; | ||
| touch(it); | ||
| return it->second.value; | ||
| } | ||
|
|
||
| void set(key_type key, value_type value) { | ||
| auto it = cache.find(key); | ||
| if (it != cache.end()) { | ||
| // key found | ||
| it->second.value = value; | ||
| touch(it); | ||
| } else { | ||
| // key not found | ||
| if (cache.size() == capacity) { | ||
| key_type oldest_key = keys.back(); | ||
| keys.pop_back(); | ||
| cache.erase( cache.find(oldest_key) ); | ||
| } | ||
| keys.push_front(key); | ||
| ValueIterator vi; | ||
| vi.value = value; | ||
| vi.it = keys.begin(); | ||
| pair<key_type, ValueIterator> boo(key, vi); | ||
| cache.insert(boo); | ||
| } | ||
| } | ||
|
|
||
| private: | ||
|
|
||
| void touch(typename unordered_map<key_type, ValueIterator>::iterator it) { | ||
| keys.erase(it->second.it); | ||
| keys.push_front(it->first); | ||
| it->second.it = keys.begin(); | ||
| } | ||
| }; |
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.