Lines Matching refs:StackTop
137 unsigned StackTop; // The current top of the FP stack.
179 for (unsigned i = 0; i != StackTop; ++i) {
199 return Slot < StackTop && Stack[Slot] == RegNo;
217 if (STi >= StackTop)
219 return Stack[StackTop-1-STi];
225 return StackTop - 1 - getSlot(RegNo) + X86::ST0;
231 if (StackTop >= 8)
233 Stack[StackTop] = Reg;
234 RegMap[Reg] = StackTop++;
237 bool isAtTop(unsigned RegNo) const { return getSlot(RegNo) == StackTop-1; }
249 if (RegMap[RegOnTop] >= StackTop)
251 std::swap(Stack[RegMap[RegOnTop]], Stack[StackTop-1]);
362 StackTop = 0;
501 StackTop = 0;
563 Bundle.FixCount = StackTop;
564 for (unsigned i = 0; i < StackTop; ++i)
835 if (StackTop == 0)
837 RegMap[Stack[--StackTop]] = ~0; // Update state
872 unsigned TopReg = Stack[StackTop-1];
876 Stack[--StackTop] = ~0;
885 for (unsigned i = 0; i < StackTop; ++i) {
910 while (StackTop) {
939 assert(StackTop == CountPopulation_32(Mask) && "Live count mismatch");
1032 if (StackTop == 0)
1034 --StackTop;
1065 if (StackTop == 0)
1067 --StackTop;
1249 assert(UpdatedSlot < StackTop && Dest < 7);
1416 // This means that StackTop does not match the hardware stack between a
1423 assert(StackTop < 8 && "Stack overflowed before FpPOP_RETVAL");
1424 if (StackTop) {
1425 std::copy_backward(Stack, Stack + StackTop, Stack + StackTop + 1);
1429 ++StackTop;
1607 StackTop -= NumSTPopped;
1670 --StackTop;
1722 assert(StackTop == 1 && FirstFPRegOp == getStackEntry(0) &&
1728 StackTop = 0;
1735 if (StackTop == 1) {
1747 assert(StackTop == 2 && "Must have two values live!");
1760 StackTop = 0;
