Searched refs:sets (Results 1 - 14 of 14) sorted by relevance
/gem5/src/mem/cache/tags/indexing_policies/ |
H A D | base.cc | 61 setShift(floorLog2(p->entry_size)), setMask(numSets - 1), sets(numSets), 64 fatal_if(!isPowerOf2(numSets), "# of sets must be non-zero and a power " \ 70 sets[i].resize(assoc); 77 return sets[set][way]; 92 sets[set][way] = entry;
|
H A D | set_associative.cc | 75 return sets[extractSet(addr)];
|
H A D | base.hh | 75 * The number of sets in the cache. 90 * The cache sets. 92 std::vector<std::vector<ReplaceableEntry*>> sets; member in class:BaseIndexingPolicy
|
H A D | skewed_associative.cc | 51 // Check if set is too big to do skewing. If using big sets, rewrite 56 // We must have more than two sets, otherwise the MSB and LSB are the same 58 fatal_if(numSets <= 2, "The number of sets must be greater than 2"); 216 entries.push_back(sets[extractSet(addr, way)][way]);
|
/gem5/src/dev/arm/ |
H A D | smmu_v3_caches.cc | 175 sets.resize(num_sets, set); 184 Set &set = sets[pickSetIdx(va)]; 217 for (size_t s = 0; s < sets.size(); s++) { 218 Set &set = sets[s]; 253 Set &set = sets[pickSetIdx(incoming.va)]; 263 Set &set = sets[pickSetIdx(sid, ssid)]; 276 for (size_t s = 0; s < sets.size(); s++) { 277 Set &set = sets[s]; 291 Set &set = sets[pickSetIdx(va)]; 307 Set &set = sets[pickSetId [all...] |
H A D | smmu_v3_caches.hh | 143 std::vector<Set> sets; member in class:SMMUTLB 188 std::vector<Set> sets; member in class:ARMArchTLB 228 std::vector<Set> sets; member in class:IPACache 275 std::vector<Set> sets; member in class:ConfigCache 341 std::vector<Set> sets; member in class:WalkCache
|
/gem5/ext/googletest/googlemock/scripts/generator/cpp/ |
H A D | keywords.py | 33 from sets import Set as set
|
H A D | gmock_class.py | 43 import sets 44 set = sets.Set
|
H A D | tokenize.py | 38 from sets import Set as set 128 # Cache various valid character sets for speed.
|
/gem5/ext/googletest/googlemock/scripts/ |
H A D | fuse_gmock_files.py | 66 import sets 123 processed_files = sets.Set() # Holds all gmock headers we've processed. 162 processed_files = sets.Set()
|
/gem5/src/mem/cache/prefetch/ |
H A D | stride.hh | 105 * @param sets Number of sets in the table. 109 PCTable(int assoc, int sets, const std::string name, 146 * PC hashing function to index sets in the table.
|
H A D | stride.cc | 118 StridePrefetcher::PCTable::PCTable(int assoc, int sets, const std::string name, argument 120 : pcTableSets(sets), _name(name), entries(pcTableSets), 123 for (int set = 0; set < sets; set++) {
|
/gem5/ext/googletest/googletest/scripts/ |
H A D | fuse_gtest_files.py | 64 from sets import Set as set # For Python 2.3 compatibility
|
/gem5/ext/googletest/googletest/test/ |
H A D | gtest_filter_unittest.py | 48 from sets import Set as set # For Python 2.3 compatibility 234 """Asserts that two sets are equal.""" 353 sets the flags accordingly.
|
Completed in 11 milliseconds