Searched refs:StackTop (Results 1 – 6 of 6) sorted by relevance
154 StackTop = getChildIndex(StackTop, ID); in push()155 assert(StackTop); in push()165 assert(StackTop); in pop()166 assert(Nodes[StackTop].Parent < StackTop); in pop()168 assert(Nodes[StackTop].Interior == ID); in pop()171 assert(Nodes[Nodes[StackTop].Parent].Children[ID] == StackTop); in pop()172 StackTop = Nodes[StackTop].Parent; in pop()186 if (StackTop) { in update()187 TimerIdT Leaf = Nodes[StackTop].Interior; in update()196 TTindex Prefix = StackTop; in update()[all …]
93 TTindex StackTop = 0; variable
136 unsigned StackTop; // The current top of the FP stack. member177 for (unsigned i = 0; i != StackTop; ++i) { in dumpStack()196 return Slot < StackTop && Stack[Slot] == RegNo; in isLive()214 if (STi >= StackTop) in getStackEntry()216 return Stack[StackTop-1-STi]; in getStackEntry()222 return StackTop - 1 - getSlot(RegNo) + llvm::X86::ST0; in getSTReg()228 if (StackTop >= 8) in pushReg()230 Stack[StackTop] = Reg; in pushReg()231 RegMap[Reg] = StackTop++; in pushReg()234 bool isAtTop(unsigned RegNo) const { return getSlot(RegNo) == StackTop-1; } in isAtTop()[all …]
155 unsigned StackTop; // The current top of the FP stack. member176 for (unsigned i = 0; i != StackTop; ++i) { in dumpStack()193 return Slot < StackTop && Stack[Slot] == RegNo; in isLive()198 if (STi >= StackTop) in getStackEntry()200 return Stack[StackTop-1-STi]; in getStackEntry()206 return StackTop - 1 - getSlot(RegNo) + X86::ST0; in getSTReg()212 if (StackTop >= 8) in pushReg()214 Stack[StackTop] = Reg; in pushReg()215 RegMap[Reg] = StackTop++; in pushReg()220 if (StackTop == 0) in popReg()[all …]
146 unsigned StackTop; // The current top of the FP stack. member167 for (unsigned i = 0; i != StackTop; ++i) { in dumpStack()184 return Slot < StackTop && Stack[Slot] == RegNo; in isLive()189 if (STi >= StackTop) in getStackEntry()191 return Stack[StackTop-1-STi]; in getStackEntry()197 return StackTop - 1 - getSlot(RegNo) + X86::ST0; in getSTReg()203 if (StackTop >= 8) in pushReg()205 Stack[StackTop] = Reg; in pushReg()206 RegMap[Reg] = StackTop++; in pushReg()209 bool isAtTop(unsigned RegNo) const { return getSlot(RegNo) == StackTop-1; } in isAtTop()[all …]
760 return self.StackTop() <= address <= self.StackBottom()998 def StackTop(self): member in MinidumpReader3569 start = self.reader.StackTop()3864 print " stack-top: %s" % heap.FormatIntPtr(reader.StackTop())