| /freebsd-current/contrib/llvm-project/clang/include/clang/Analysis/FlowSensitive/ |
| H A D | WatchedLiteralsSolver.h | 49 Result solve(llvm::ArrayRef<const Formula *> Vals) override;
|
| H A D | Solver.h | 89 virtual Result solve(llvm::ArrayRef<const Formula *> Vals) = 0;
|
| /freebsd-current/contrib/llvm-project/llvm/lib/Support/Unix/ |
| H A D | DynamicLibrary.inc | 76 // If this is darwin, it has some funky issues, try to solve them here. Some
|
| /freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | SCCP.cpp | 79 Solver.solve();
|
| /freebsd-current/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SCCPSolver.h | 108 void solve();
112 /// However, this is not a safe assumption. After we solve dataflow, this
|
| /freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RegAllocPBQP.h | 292 Solution solve() { function in class:llvm::PBQP::RegAlloc::RegAllocSolverImpl
522 inline Solution solve(PBQPRAGraph& G) { function in namespace:llvm::PBQP::RegAlloc
526 return RegAllocSolver.solve();
|
| /freebsd-current/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
| H A D | WatchedLiteralsSolver.cpp | 525 std::pair<Solver::Result, std::int64_t> solve(std::int64_t MaxIterations) && { function in class:clang::dataflow::WatchedLiteralsSolverImpl::Assignment
787 WatchedLiteralsSolver::solve(llvm::ArrayRef<const Formula *> Vals) { function in class:WatchedLiteralsSolver
790 auto [Res, Iterations] = WatchedLiteralsSolverImpl(Vals).solve(MaxIterations);
|
| H A D | DataflowAnalysisContext.cpp | 172 return S->solve(Constraints.getArrayRef());
|
| /freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SCCPSolver.cpp | 722 void solve();
812 solve();
822 solve();
832 solve();
1841 void SCCPInstVisitor::solve() { function in class:SCCPInstVisitor
1931 // Because of the way we solve return values, tracked calls must
2027 void SCCPSolver::solve() { Visitor->solve(); } function in class:SCCPSolver
|
| /freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUIGroupLP.cpp | 44 "which we attempt to solve with the exponential time "
289 // Whether or not we actually have any SyncedInstrs to try to solve.
365 void solve();
807 void PipelineSolver::solve() { function in class:__anon2257::PipelineSolver
1634 PS.solve();
|
| /freebsd-current/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LazyValueInfo.cpp | 290 // possible to solve now. We do NOT try to proactively update these values.
346 // While analyzing which blocks we can solve values for, we need the dominator
435 void solve();
511 void LazyValueInfoImpl::solve() { function in class:LazyValueInfoImpl
1509 // this function is generally cached when called from the solve* functions
1511 // context instruction), because when this function is called from the solve*
1528 solve();
1565 // we may have to call solve() multiple times, as the edge value calculation
1567 solve();
2047 // We can generate (solve) LV
[all...] |
| /freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 113 /// PBQP based allocators solve the register allocation problem by mapping
870 PBQP::Solution Solution = PBQP::RegAlloc::solve(G);
|