Lines Matching refs:curName
351 string curName; in parseCaseTrie() local
368 if (!curName.empty() && expectNode) in parseCaseTrie()
370 CaseTreeNode* const newChild = new CaseTreeNode(curName); in parseCaseTrie()
385 curName.clear(); in parseCaseTrie()
387 else if (curName.empty() == expectNode) in parseCaseTrie()
408 curName += (char)curChr; in parseCaseTrie()
420 string curName; in parseCaseList() local
432 if (curName.empty()) in parseCaseList()
435 if (nodeStack[stackPos]->hasChild(curName)) in parseCaseList()
438 CaseTreeNode* const newChild = new CaseTreeNode(curName); in parseCaseList()
450 curName.clear(); in parseCaseList()
465 if (curName.empty()) in parseCaseList()
471 if (!nodeStack[stackPos+1] || nodeStack[stackPos+1]->getName() != curName) in parseCaseList()
473 CaseTreeNode* curGroup = nodeStack[stackPos]->getChild(curName); in parseCaseList()
477 curGroup = new CaseTreeNode(curName); in parseCaseList()
496 DE_ASSERT(nodeStack[stackPos+1]->getName() == curName); in parseCaseList()
498 curName.clear(); in parseCaseList()
502 curName += (char)curChr; in parseCaseList()