зеркало из https://github.com/mozilla/gecko-dev.git
Bug 1027897 - IonMonkey: Minor code simplifications. r=bhackett
This commit is contained in:
Родитель
e8cb8d7c75
Коммит
3a3e49dc57
|
@ -963,7 +963,7 @@ BacktrackingAllocator::resolveControlFlow()
|
||||||
LBlock *predecessor = mSuccessor->getPredecessor(k)->lir();
|
LBlock *predecessor = mSuccessor->getPredecessor(k)->lir();
|
||||||
JS_ASSERT(predecessor->mir()->numSuccessors() == 1);
|
JS_ASSERT(predecessor->mir()->numSuccessors() == 1);
|
||||||
|
|
||||||
LAllocation *input = phi->getOperand(predecessor->mir()->positionInPhiSuccessor());
|
LAllocation *input = phi->getOperand(k);
|
||||||
LiveInterval *from = vregs[input].intervalFor(outputOf(predecessor->lastId()));
|
LiveInterval *from = vregs[input].intervalFor(outputOf(predecessor->lastId()));
|
||||||
JS_ASSERT(from);
|
JS_ASSERT(from);
|
||||||
|
|
||||||
|
|
|
@ -242,7 +242,7 @@ LinearScanAllocator::resolveControlFlow()
|
||||||
LBlock *predecessor = mSuccessor->getPredecessor(k)->lir();
|
LBlock *predecessor = mSuccessor->getPredecessor(k)->lir();
|
||||||
JS_ASSERT(predecessor->mir()->numSuccessors() == 1);
|
JS_ASSERT(predecessor->mir()->numSuccessors() == 1);
|
||||||
|
|
||||||
LAllocation *input = phi->getOperand(predecessor->mir()->positionInPhiSuccessor());
|
LAllocation *input = phi->getOperand(k);
|
||||||
LiveInterval *from = vregs[input].intervalFor(outputOf(predecessor->lastId()));
|
LiveInterval *from = vregs[input].intervalFor(outputOf(predecessor->lastId()));
|
||||||
JS_ASSERT(from);
|
JS_ASSERT(from);
|
||||||
|
|
||||||
|
|
|
@ -234,7 +234,7 @@ AllocationIntegrityState::checkIntegrity(LBlock *block, LInstruction *ins,
|
||||||
if (info.outputs[0].virtualRegister() == vreg) {
|
if (info.outputs[0].virtualRegister() == vreg) {
|
||||||
for (size_t j = 0, jend = phi->numOperands(); j < jend; j++) {
|
for (size_t j = 0, jend = phi->numOperands(); j < jend; j++) {
|
||||||
uint32_t newvreg = info.inputs[j].toUse()->virtualRegister();
|
uint32_t newvreg = info.inputs[j].toUse()->virtualRegister();
|
||||||
LBlock *predecessor = graph.getBlock(block->mir()->getPredecessor(j)->id());
|
LBlock *predecessor = block->mir()->getPredecessor(j)->lir();
|
||||||
if (!addPredecessor(predecessor, newvreg, alloc))
|
if (!addPredecessor(predecessor, newvreg, alloc))
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
@ -245,7 +245,7 @@ AllocationIntegrityState::checkIntegrity(LBlock *block, LInstruction *ins,
|
||||||
// No phi which defined the vreg we are tracking, follow back through all
|
// No phi which defined the vreg we are tracking, follow back through all
|
||||||
// predecessors with the existing vreg.
|
// predecessors with the existing vreg.
|
||||||
for (size_t i = 0, iend = block->mir()->numPredecessors(); i < iend; i++) {
|
for (size_t i = 0, iend = block->mir()->numPredecessors(); i < iend; i++) {
|
||||||
LBlock *predecessor = graph.getBlock(block->mir()->getPredecessor(i)->id());
|
LBlock *predecessor = block->mir()->getPredecessor(i)->lir();
|
||||||
if (!addPredecessor(predecessor, vreg, alloc))
|
if (!addPredecessor(predecessor, vreg, alloc))
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
|
@ -282,7 +282,7 @@ StupidAllocator::syncForBlockEnd(LBlock *block, LInstruction *ins)
|
||||||
MBasicBlock *successor = block->mir()->successorWithPhis();
|
MBasicBlock *successor = block->mir()->successorWithPhis();
|
||||||
if (successor) {
|
if (successor) {
|
||||||
uint32_t position = block->mir()->positionInPhiSuccessor();
|
uint32_t position = block->mir()->positionInPhiSuccessor();
|
||||||
LBlock *lirsuccessor = graph.getBlock(successor->id());
|
LBlock *lirsuccessor = successor->lir();
|
||||||
for (size_t i = 0; i < lirsuccessor->numPhis(); i++) {
|
for (size_t i = 0; i < lirsuccessor->numPhis(); i++) {
|
||||||
LPhi *phi = lirsuccessor->getPhi(i);
|
LPhi *phi = lirsuccessor->getPhi(i);
|
||||||
|
|
||||||
|
|
Загрузка…
Ссылка в новой задаче