Searched refs:stackPos (Results 1 – 4 of 4) sorted by relevance
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()
107 const size_t stackPos = compNdx + 1; in seekToCase() local109 if (stackPos >= m_nodeStack.size()) in seekToCase()111 else if (components[compNdx] != m_nodeStack[stackPos].node->getName()) in seekToCase()114 pruneStack(stackPos); in seekToCase()
491 int stackPos = 0; in parseSimpleCaseList() local503 if (!nodeStack[stackPos]->hasChild(curName)) in parseSimpleCaseList()509 nodeStack[stackPos]->addChild(newChild); in parseSimpleCaseList()521 stackPos = 0; in parseSimpleCaseList()538 if ((int)nodeStack.size() <= stackPos+1) in parseSimpleCaseList()541 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName) in parseSimpleCaseList()543 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName); in parseSimpleCaseList()551 nodeStack[stackPos]->addChild(curGroup); in parseSimpleCaseList()560 nodeStack[stackPos+1] = curGroup; in parseSimpleCaseList()562 if ((int)nodeStack.size() > stackPos+2) in parseSimpleCaseList()[all …]
2205 uint8_t stackPos) { in translateFPRegister() argument2206 mcInst.addOperand(MCOperand::createReg(X86::ST0 + stackPos)); in translateFPRegister()