Lines Matching refs:curName
424 string curName; in parseCaseTrie() local
441 if (!curName.empty() && expectNode) in parseCaseTrie()
443 CaseTreeNode* const newChild = new CaseTreeNode(curName); in parseCaseTrie()
458 curName.clear(); in parseCaseTrie()
460 else if (curName.empty() == expectNode) in parseCaseTrie()
481 curName += (char)curChr; in parseCaseTrie()
492 string curName; in parseSimpleCaseList() local
500 if (curName.empty()) in parseSimpleCaseList()
503 if (!nodeStack[stackPos]->hasChild(curName)) in parseSimpleCaseList()
505 CaseTreeNode* const newChild = new CaseTreeNode(curName); in parseSimpleCaseList()
520 curName.clear(); in parseSimpleCaseList()
535 if (curName.empty()) in parseSimpleCaseList()
541 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName) in parseSimpleCaseList()
543 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName); in parseSimpleCaseList()
547 curGroup = new CaseTreeNode(curName); in parseSimpleCaseList()
566 DE_ASSERT(nodeStack[stackPos+1]->getName() == curName); in parseSimpleCaseList()
568 curName.clear(); in parseSimpleCaseList()
572 curName += (char)curChr; in parseSimpleCaseList()