Searched refs:stackPos (Results 1 – 6 of 6) sorted by relevance
450 int stackPos = 0; in parseCaseList() local466 if (!nodeStack[stackPos]->hasChild(curName)) in parseCaseList()472 nodeStack[stackPos]->addChild(newChild); in parseCaseList()484 stackPos = 0; in parseCaseList()501 if ((int)nodeStack.size() <= stackPos+1) in parseCaseList()504 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName) in parseCaseList()506 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName); in parseCaseList()514 nodeStack[stackPos]->addChild(curGroup); in parseCaseList()523 nodeStack[stackPos+1] = curGroup; in parseCaseList()525 if ((int)nodeStack.size() > stackPos+2) in parseCaseList()[all …]
114 const size_t stackPos = compNdx + 1; in seekToCase() local116 if (stackPos >= m_nodeStack.size()) in seekToCase()118 else if (components[compNdx] != m_nodeStack[stackPos].node->getName()) in seekToCase()121 pruneStack(stackPos); in seekToCase()
731 static void translateFPRegister(MCInst *mcInst, uint8_t stackPos) in translateFPRegister() argument733 MCOperand_CreateReg0(mcInst, X86_ST0 + stackPos); in translateFPRegister()
944 uint8_t stackPos) { in translateFPRegister() argument945 mcInst.addOperand(MCOperand::createReg(X86::ST0 + stackPos)); in translateFPRegister()
2225 uint8_t stackPos) { in translateFPRegister() argument2226 mcInst.addOperand(MCOperand::createReg(X86::ST0 + stackPos)); in translateFPRegister()
2205 uint8_t stackPos) { in translateFPRegister() argument2206 mcInst.addOperand(MCOperand::createReg(X86::ST0 + stackPos)); in translateFPRegister()