Lines Matching defs:StackTop

136     unsigned StackTop;          // The current top of the FP stack.
178 for (unsigned i = 0; i != StackTop; ++i) {
198 return Slot < StackTop && Stack[Slot] == RegNo;
216 if (STi >= StackTop)
218 return Stack[StackTop-1-STi];
224 return StackTop - 1 - getSlot(RegNo) + X86::ST0;
230 if (StackTop >= 8)
232 Stack[StackTop] = Reg;
233 RegMap[Reg] = StackTop++;
236 bool isAtTop(unsigned RegNo) const { return getSlot(RegNo) == StackTop-1; }
248 if (RegMap[RegOnTop] >= StackTop)
250 std::swap(Stack[RegMap[RegOnTop]], Stack[StackTop-1]);
361 StackTop = 0;
500 StackTop = 0;
562 Bundle.FixCount = StackTop;
563 for (unsigned i = 0; i < StackTop; ++i)
834 if (StackTop == 0)
836 RegMap[Stack[--StackTop]] = ~0; // Update state
871 unsigned TopReg = Stack[StackTop-1];
875 Stack[--StackTop] = ~0;
884 for (unsigned i = 0; i < StackTop; ++i) {
909 while (StackTop) {
938 assert(StackTop == CountPopulation_32(Mask) && "Live count mismatch");
1031 if (StackTop == 0)
1033 --StackTop;
1064 if (StackTop == 0)
1066 --StackTop;
1248 assert(UpdatedSlot < StackTop && Dest < 7);
1415 // This means that StackTop does not match the hardware stack between a
1422 assert(StackTop < 8 && "Stack overflowed before FpPOP_RETVAL");
1423 if (StackTop) {
1424 std::copy_backward(Stack, Stack + StackTop, Stack + StackTop + 1);
1428 ++StackTop;
1606 StackTop -= NumSTPopped;
1669 --StackTop;
1719 assert(StackTop == 1 && FirstFPRegOp == getStackEntry(0) &&
1725 StackTop = 0;
1732 if (StackTop == 1) {
1744 assert(StackTop == 2 && "Must have two values live!");
1757 StackTop = 0;