Searched refs:RecursiveFn (Results 1 – 1 of 1) sorted by relevance
280 auto [RecursiveIt, IsNew] = RecursiveFn.insert(std::make_pair(D, true)); in IsFunctionTrivial()299 for (auto &It : RecursiveFn) in IsFunctionTrivial()302 RecursiveIt = RecursiveFn.find(D); in IsFunctionTrivial()303 assert(RecursiveIt != RecursiveFn.end()); in IsFunctionTrivial()305 RecursiveFn.erase(RecursiveIt); in IsFunctionTrivial()553 CacheTy RecursiveFn; member in clang::TrivialFunctionAnalysisVisitor