mirror of
https://github.com/azahar-emu/dynarmic
synced 2025-11-10 09:00:00 +01:00
1abe881921
Currently basic block kind of acts like a 'dumb struct' which makes things a little more verbose to write (as opposed to keeping it all in one place, I guess). It's also a little wonky conceptually, considering a block is composed of instructions (i.e. 'contains' them). So providing accessors that make it act more like a container can make working with algorithms a little nicer. It also makes the API a little more defined. Ideally, the list would be only available through a function, but currently, the pool allocator is exposed, which seems somewhat odd, considering the block itself should manage its overall allocations (with placement new, and regular new), rather than putting that sanitizing directly on the IR emitter (it should just care about emission, not block state). However, recontaining that can be followed up with, as it's very trivial to do.
46 lines
1.3 KiB
C++
46 lines
1.3 KiB
C++
/* This file is part of the dynarmic project.
|
|
* Copyright (c) 2016 MerryMage
|
|
* This software may be used and distributed according to the terms of the GNU
|
|
* General Public License version 2 or any later version.
|
|
*/
|
|
|
|
#include <map>
|
|
|
|
#include "common/assert.h"
|
|
#include "common/common_types.h"
|
|
#include "frontend/ir/basic_block.h"
|
|
#include "frontend/ir/microinstruction.h"
|
|
#include "ir_opt/passes.h"
|
|
|
|
namespace Dynarmic {
|
|
namespace Optimization {
|
|
|
|
void VerificationPass(const IR::Block& block) {
|
|
for (const auto& inst : block) {
|
|
for (size_t i = 0; i < inst.NumArgs(); i++) {
|
|
IR::Type t1 = inst.GetArg(i).GetType();
|
|
IR::Type t2 = IR::GetArgTypeOf(inst.GetOpcode(), i);
|
|
if (!IR::AreTypesCompatible(t1, t2)) {
|
|
puts(IR::DumpBlock(block).c_str());
|
|
ASSERT(false);
|
|
}
|
|
}
|
|
}
|
|
|
|
std::map<IR::Inst*, size_t> actual_uses;
|
|
for (const auto& inst : block) {
|
|
for (size_t i = 0; i < inst.NumArgs(); i++) {
|
|
if (!inst.GetArg(i).IsImmediate()) {
|
|
actual_uses[inst.GetArg(i).GetInst()]++;
|
|
}
|
|
}
|
|
}
|
|
|
|
for (const auto& pair : actual_uses) {
|
|
ASSERT(pair.first->use_count == pair.second);
|
|
}
|
|
}
|
|
|
|
} // namespace Optimization
|
|
} // namespace Dynarmic
|