Lines Matching refs:evaluationList

235     pushEvaluationList(&unit.evaluationList);  in enterModule()
253 auto evaluationList = evaluationListStack.back(); in endFunctionBody() local
254 if (evaluationList->empty() || !evaluationList->back().isEndStmt()) { in endFunctionBody()
304 pushEvaluationList(&unit.evaluationList); in enterFunction()
326 eval.evaluationList.reset(new lower::pft::EvaluationList); in enterConstructOrDirective()
327 pushEvaluationList(eval.evaluationList.get()); in enterConstructOrDirective()
339 Fortran::lower::pft::EvaluationList &evaluationList = in exitConstructOrDirective() local
340 *eval->evaluationList; in exitConstructOrDirective()
341 if (!evaluationList.empty() && evaluationList.back().isConstruct()) { in exitConstructOrDirective()
438 void pushEvaluationList(lower::pft::EvaluationList *evaluationList) { in pushEvaluationList() argument
440 assert(evaluationList && evaluationList->empty() && in pushEvaluationList()
442 evaluationListStack.emplace_back(evaluationList); in pushEvaluationList()
491 auto &evaluationList = *evaluationListStack.back(); in rewriteIfGotos() local
492 if (!evaluationList.size()) in rewriteIfGotos()
501 evaluationList.begin()->getIf<parser::NonLabelDoStmt>(); in rewriteIfGotos()
503 for (auto it = evaluationList.begin(), end = evaluationList.end(); in rewriteIfGotos()
511 return e->isConstruct() ? &*e->evaluationList->begin() : e; in rewriteIfGotos()
532 *ifConstructIt->evaluationList; in rewriteIfGotos()
546 ifBodyList.splice(endIfStmtIt, evaluationList, successorIt, it); in rewriteIfGotos()
553 if (eval.isA<parser::IfConstruct>() && eval.evaluationList->size() == 3) { in rewriteIfGotos()
554 const auto bodyEval = std::next(eval.evaluationList->begin()); in rewriteIfGotos()
625 eval.constructExit = &eval.evaluationList->back().nonNopSuccessor(); in setConstructExit()
725 std::list<lower::pft::Evaluation> &evaluationList) { in analyzeBranches() argument
727 for (auto &eval : evaluationList) { in analyzeBranches()
747 markBranchTarget(eval, construct->evaluationList->back()); in analyzeBranches()
853 eval.controlSuccessor = &evaluationList.back(); in analyzeBranches()
865 lower::pft::Evaluation &doEval = evaluationList.front(); in analyzeBranches()
927 eval.constructExit = &eval.evaluationList->back(); in analyzeBranches()
935 eval.constructExit = &eval.evaluationList->back(); in analyzeBranches()
939 eval.constructExit = &eval.evaluationList->back(); in analyzeBranches()
968 if (eval.evaluationList) in analyzeBranches()
969 analyzeBranches(&eval, *eval.evaluationList); in analyzeBranches()
1097 dumpEvaluationList(outputStream, *eval.evaluationList, indent + 1); in dumpEvaluation()
1108 const lower::pft::EvaluationList &evaluationList, in dumpEvaluationList() argument
1112 for (const lower::pft::Evaluation &eval : evaluationList) in dumpEvaluationList()
1154 dumpEvaluationList(outputStream, functionLikeUnit.evaluationList); in dumpFunctionLikeUnit()
1169 dumpEvaluationList(outputStream, moduleLikeUnit.evaluationList); in dumpModuleLikeUnit()
1640 if (!evaluationList.empty()) in getStartingSourceLoc()
1641 return evaluationList.front().position; in getStartingSourceLoc()