eb8154908c
remove useless memorybarrier remove double membarrier in wait pm4 cmd add int64 cvar use int64 cvar for x64 feature mask Rework some functions that were frontend bound according to vtune placing some of their code in different noinline functions, profiling after indicating l1 cache misses decreased and perf of func increased remove long vpinsrd dep chain code for conversion.h, instead do normal load+bswap or movbe if avail Much faster entry table via split_map, code size could be improved though GetResolveInfo was very large and had impact on icache, mark callees as noinline + msvc pragma optimize small use log2 shifts instead of integer divides in memory minor optimizations in PhysicalHeap::EnableAccessCallbacks, the majority of time in the function is spent looping, NOT calling Protect! Someone should optimize this function and rework the algo completely remove wonky scheduling log message, it was spammy and unhelpful lock count was unnecessary for criticalsection mutex, criticalsection is already a recursive mutex brief notes i gotta run
108 lines
3.2 KiB
C++
108 lines
3.2 KiB
C++
/**
|
|
******************************************************************************
|
|
* Xenia : Xbox 360 Emulator Research Project *
|
|
******************************************************************************
|
|
* Copyright 2013 Ben Vanik. All rights reserved. *
|
|
* Released under the BSD license - see LICENSE in the root for more details. *
|
|
******************************************************************************
|
|
*/
|
|
|
|
#include "xenia/cpu/entry_table.h"
|
|
|
|
#include "xenia/base/profiling.h"
|
|
#include "xenia/base/threading.h"
|
|
|
|
namespace xe {
|
|
namespace cpu {
|
|
|
|
EntryTable::EntryTable() = default;
|
|
|
|
EntryTable::~EntryTable() {
|
|
auto global_lock = global_critical_region_.Acquire();
|
|
for (auto it : map_.Values()) {
|
|
Entry* entry = it;
|
|
delete entry;
|
|
}
|
|
}
|
|
|
|
Entry* EntryTable::Get(uint32_t address) {
|
|
auto global_lock = global_critical_region_.Acquire();
|
|
uint32_t idx = map_.IndexForKey(address);
|
|
if (idx == map_.size() || *map_.KeyAt(idx) != address) {
|
|
return nullptr;
|
|
}
|
|
Entry* entry = *map_.ValueAt(idx);
|
|
if (entry) {
|
|
// TODO(benvanik): wait if needed?
|
|
if (entry->status != Entry::STATUS_READY) {
|
|
entry = nullptr;
|
|
}
|
|
}
|
|
return entry;
|
|
}
|
|
|
|
Entry::Status EntryTable::GetOrCreate(uint32_t address, Entry** out_entry) {
|
|
// TODO(benvanik): replace with a map with wait-free for find.
|
|
// https://github.com/facebook/folly/blob/master/folly/AtomicHashMap.h
|
|
|
|
auto global_lock = global_critical_region_.Acquire();
|
|
|
|
uint32_t idx = map_.IndexForKey(address);
|
|
|
|
Entry* entry = idx != map_.size() && *map_.KeyAt(idx) == address
|
|
? *map_.ValueAt(idx)
|
|
: nullptr;
|
|
Entry::Status status;
|
|
if (entry) {
|
|
// If we aren't ready yet spin and wait.
|
|
if (entry->status == Entry::STATUS_COMPILING) {
|
|
// Still compiling, so spin.
|
|
do {
|
|
global_lock.unlock();
|
|
// TODO(benvanik): sleep for less time?
|
|
xe::threading::Sleep(std::chrono::microseconds(10));
|
|
global_lock.lock();
|
|
} while (entry->status == Entry::STATUS_COMPILING);
|
|
}
|
|
status = entry->status;
|
|
} else {
|
|
// Create and return for initialization.
|
|
entry = new Entry();
|
|
entry->address = address;
|
|
entry->end_address = 0;
|
|
entry->status = Entry::STATUS_COMPILING;
|
|
entry->function = 0;
|
|
map_.InsertAt(address, entry, idx);
|
|
// map_[address] = entry;
|
|
status = Entry::STATUS_NEW;
|
|
}
|
|
global_lock.unlock();
|
|
*out_entry = entry;
|
|
return status;
|
|
}
|
|
|
|
void EntryTable::Delete(uint32_t address) {
|
|
auto global_lock = global_critical_region_.Acquire();
|
|
// doesnt this leak memory by not deleting the entry?
|
|
uint32_t idx = map_.IndexForKey(address);
|
|
if (idx != map_.size() && *map_.KeyAt(idx) == address) {
|
|
map_.EraseAt(idx);
|
|
}
|
|
}
|
|
|
|
std::vector<Function*> EntryTable::FindWithAddress(uint32_t address) {
|
|
auto global_lock = global_critical_region_.Acquire();
|
|
std::vector<Function*> fns;
|
|
for (auto& it : map_.Values()) {
|
|
Entry* entry = it;
|
|
if (address >= entry->address && address <= entry->end_address) {
|
|
if (entry->status == Entry::STATUS_READY) {
|
|
fns.push_back(entry->function);
|
|
}
|
|
}
|
|
}
|
|
return fns;
|
|
}
|
|
} // namespace cpu
|
|
} // namespace xe
|