Lines Matching refs:curName
346 string curName; in parseCaseTrie() local
363 if (!curName.empty() && expectNode) in parseCaseTrie()
365 CaseTreeNode* const newChild = new CaseTreeNode(curName); in parseCaseTrie()
380 curName.clear(); in parseCaseTrie()
382 else if (curName.empty() == expectNode) in parseCaseTrie()
403 curName += (char)curChr; in parseCaseTrie()
415 string curName; in parseCaseList() local
427 if (curName.empty()) in parseCaseList()
430 if (nodeStack[stackPos]->hasChild(curName)) in parseCaseList()
433 CaseTreeNode* const newChild = new CaseTreeNode(curName); in parseCaseList()
445 curName.clear(); in parseCaseList()
460 if (curName.empty()) in parseCaseList()
466 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName) in parseCaseList()
468 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName); in parseCaseList()
472 curGroup = new CaseTreeNode(curName); in parseCaseList()
491 DE_ASSERT(nodeStack[stackPos+1]->getName() == curName); in parseCaseList()
493 curName.clear(); in parseCaseList()
497 curName += (char)curChr; in parseCaseList()