#include "interlock.hpp" #include #include #include using namespace maskwrite; int main() { std::array banks; Number instance, code; std::array a; while (std::cin >> instance >> code >> a[0] >> a[1] >> a[2] >> a[3] >> a[4]) { Interlock& bank = banks[static_cast(instance)]; Status status = OK; std::uint32_t value = 2779096485U; Operation operation{-9, -9, 2779096485U, 2779096485U}; switch (code) { case 0: status = bank.reset(); break; case 1: status = bank.load(a[0], a[1]); break; case 2: status = bank.begin(a[0]); break; case 3: status = bank.stage(a[0], a[1], a[2], a[3], a[4]); break; case 4: status = bank.capture(a[0]); break; case 5: status = bank.commit(a[0]); break; case 6: status = bank.abort(a[0]); break; case 7: status = bank.word(a[0], value); break; case 8: status = bank.prepared(a[0], a[1], value); break; case 9: status = bank.changed(a[0], a[1], value); break; case 10: status = bank.operation(a[0], operation); break; case 11: break; } std::cout << static_cast(status) << ' ' << value << ' ' << operation.reg << ' ' << operation.kind << ' ' << operation.mask << ' ' << operation.value; State state = bank.state(); std::cout << ' ' << state.owner << ' ' << state.phase << ' ' << state.count << ' ' << state.generation; for (Number reg = 0; reg < 4; ++reg) { std::uint32_t word = 2779096485U; Status read = bank.word(reg, word); std::cout << ' ' << static_cast(read) << ' ' << word; } for (Number index = 0; index < 8; ++index) { Operation entry{-9, -9, 2779096485U, 2779096485U}; Status read = bank.operation(index, entry); std::cout << ' ' << static_cast(read) << ' ' << entry.reg << ' ' << entry.kind << ' ' << entry.mask << ' ' << entry.value; } for (Number reg = 0; reg < 4; ++reg) { std::uint32_t prospective = 2779096485U; std::uint32_t delta = 2779096485U; Status prepared = bank.prepared(state.owner, reg, prospective); Status changed = bank.changed(state.owner, reg, delta); std::cout << ' ' << static_cast(prepared) << ' ' << prospective << ' ' << static_cast(changed) << ' ' << delta; } std::cout << '\n'; } return 0; }