mirror of
https://github.com/RPCSX/llvm.git
synced 2025-02-27 16:38:30 +00:00
[Hexagon] Formatting changes, NFC
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@301953 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
584a18cd27
commit
033d5060aa
@ -113,7 +113,7 @@ void HexagonMCChecker::init(MCInst const &MCI) {
|
||||
// The instruction table models the USR.OVF flag, which can be
|
||||
// implicitly modified more than once, but cannot be modified in the
|
||||
// same packet with an instruction that modifies is explicitly. Deal
|
||||
// with such situ- ations individually.
|
||||
// with such situations individually.
|
||||
SoftDefs.insert(R);
|
||||
else if (isPredicateRegister(R) &&
|
||||
HexagonMCInstrInfo::isPredicateLate(MCII, MCI))
|
||||
@ -196,9 +196,8 @@ void HexagonMCChecker::init(MCInst const &MCI) {
|
||||
if (HexagonMCInstrInfo::hasNewValue2(MCII, MCI)) {
|
||||
unsigned R2 = HexagonMCInstrInfo::getNewValueOperand2(MCII, MCI).getReg();
|
||||
|
||||
for (MCRegAliasIterator SRI(R2, &RI,
|
||||
!MCSubRegIterator(R2, &RI).isValid());
|
||||
SRI.isValid(); ++SRI)
|
||||
bool HasSubRegs = MCSubRegIterator(R2, &RI).isValid();
|
||||
for (MCRegAliasIterator SRI(R2, &RI, !HasSubRegs); SRI.isValid(); ++SRI)
|
||||
if (!MCSubRegIterator(*SRI, &RI).isValid())
|
||||
NewDefs[*SRI].push_back(NewSense::Def(
|
||||
PredReg, HexagonMCInstrInfo::isPredicatedTrue(MCII, MCI),
|
||||
@ -553,8 +552,7 @@ bool HexagonMCChecker::checkRegisters() {
|
||||
if (PM.count(P) && PM.size() > 2) {
|
||||
// Error out on conditional changes based on the same predicate
|
||||
// multiple times
|
||||
// (e.g., "{ if (p0) r0 =...; if (!p0) r0 =... }; if (!p0) r0 =...
|
||||
// }").
|
||||
// (e.g., "if (p0) r0 =...; if (!p0) r0 =... }; if (!p0) r0 =...").
|
||||
reportErrorRegisters(R);
|
||||
return false;
|
||||
}
|
||||
|
@ -105,8 +105,9 @@ class HexagonMCChecker {
|
||||
void init();
|
||||
void init(MCInst const &);
|
||||
void initReg(MCInst const &, unsigned, unsigned &PredReg, bool &isTrue);
|
||||
|
||||
|
||||
bool registerUsed(unsigned Register);
|
||||
|
||||
// Checks performed.
|
||||
bool checkBranches();
|
||||
bool checkPredicates();
|
||||
|
@ -22,15 +22,18 @@
|
||||
#include "llvm/MC/MCSubtargetInfo.h"
|
||||
|
||||
namespace llvm {
|
||||
|
||||
Hexagon::PacketIterator::PacketIterator(MCInstrInfo const &MCII,
|
||||
MCInst const &Inst)
|
||||
: MCII(MCII), BundleCurrent(Inst.begin() +
|
||||
HexagonMCInstrInfo::bundleInstructionsOffset),
|
||||
BundleEnd(Inst.end()), DuplexCurrent(Inst.end()), DuplexEnd(Inst.end()) {}
|
||||
|
||||
Hexagon::PacketIterator::PacketIterator(MCInstrInfo const &MCII,
|
||||
MCInst const &Inst, std::nullptr_t)
|
||||
: MCII(MCII), BundleCurrent(Inst.end()), BundleEnd(Inst.end()),
|
||||
DuplexCurrent(Inst.end()), DuplexEnd(Inst.end()) {}
|
||||
|
||||
Hexagon::PacketIterator &Hexagon::PacketIterator::operator++() {
|
||||
if (DuplexCurrent != DuplexEnd) {
|
||||
++DuplexCurrent;
|
||||
@ -50,15 +53,18 @@ Hexagon::PacketIterator &Hexagon::PacketIterator::operator++() {
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
MCInst const &Hexagon::PacketIterator::operator*() const {
|
||||
if (DuplexCurrent != DuplexEnd)
|
||||
return *DuplexCurrent->getInst();
|
||||
return *BundleCurrent->getInst();
|
||||
}
|
||||
|
||||
bool Hexagon::PacketIterator::operator==(PacketIterator const &Other) const {
|
||||
return BundleCurrent == Other.BundleCurrent && BundleEnd == Other.BundleEnd &&
|
||||
DuplexCurrent == Other.DuplexCurrent && DuplexEnd == Other.DuplexEnd;
|
||||
}
|
||||
|
||||
void HexagonMCInstrInfo::addConstant(MCInst &MI, uint64_t Value,
|
||||
MCContext &Context) {
|
||||
MI.addOperand(MCOperand::createExpr(MCConstantExpr::create(Value, Context)));
|
||||
|
@ -210,7 +210,7 @@ bool HexagonShuffler::check() {
|
||||
// Descriptive slot masks.
|
||||
const unsigned slotSingleLoad = 0x1, slotSingleStore = 0x1, slotOne = 0x2,
|
||||
slotThree = 0x8, // slotFirstJump = 0x8,
|
||||
slotFirstLoadStore = 0x2, slotLastLoadStore = 0x1;
|
||||
slotFirstLoadStore = 0x2, slotLastLoadStore = 0x1;
|
||||
// Highest slots for branches and stores used to keep their original order.
|
||||
// unsigned slotJump = slotFirstJump;
|
||||
unsigned slotLoadStore = slotFirstLoadStore;
|
||||
|
Loading…
x
Reference in New Issue
Block a user