Searched refs:Eager (Results 1 – 17 of 17) sorted by relevance
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
D | DomTreeUpdater.cpp | 123 if (Strategy == UpdateStrategy::Eager) { in recalculate() 168 if (Strategy == UpdateStrategy::Eager || DeletedBBs.empty()) in isBBPendingDeletion() 331 if (Strategy == UpdateStrategy::Eager) { in insertEdge() 352 if (Strategy == UpdateStrategy::Eager) { in insertEdgeRelaxed() 377 if (Strategy == UpdateStrategy::Eager) { in deleteEdge() 398 if (Strategy == UpdateStrategy::Eager) { in deleteEdgeRelaxed() 410 if (Strategy == DomTreeUpdater::UpdateStrategy::Eager) in dropOutOfDateUpdates() 446 if (Strategy == UpdateStrategy::Eager) { in dump()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
D | DomTreeUpdater.h | 28 enum class UpdateStrategy : unsigned char { Eager = 0, Lazy = 1 }; enumerator 52 bool isEager() const { return Strategy == UpdateStrategy::Eager; }; in isEager()
|
/third_party/grpc/examples/cpp/ |
D | README.md | 3 - **[Hello World][]!** Eager to run your first gRPC example? You'll find
|
/third_party/boost/libs/graph_parallel/doc/ |
D | dijkstra_shortest_paths.rst | 43 conservative `Crauser et al.'s algorithm`_ or the simlistic `Eager 58 select `Eager Dijkstra's algorithm`_ and control the amount of work it 100 `Eager Dijkstra's algorithm`_ with the given lookahead value. 239 Eager Dijkstra's algorithm
|
D | index.rst | 73 - `Eager Dijkstra shortest paths`_
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
D | LoopRotationUtils.cpp | 515 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in rotateLoop() 627 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in simplifyLoopLatch()
|
D | LoopUtils.cpp | 591 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in deleteDeadLoop()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
D | LoopSimplifyCFG.cpp | 530 DTU(DT, DomTreeUpdater::UpdateStrategy::Eager) {} in ConstantTerminatorFoldingImpl() 646 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in mergeBlocksIntoPredecessors()
|
D | TailRecursionElimination.cpp | 839 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); in runOnFunction() 873 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); in run()
|
D | ADCE.cpp | 623 DomTreeUpdater(DT, &PDT, DomTreeUpdater::UpdateStrategy::Eager) in updateDeadRegions()
|
D | MergeICmps.cpp | 878 DomTreeUpdater::UpdateStrategy::Eager); in runImpl()
|
D | LoopUnswitch.cpp | 1642 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in SimplifyCode()
|
D | GVN.cpp | 2130 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in runImpl()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/ |
D | PGOMemOPSizeOpt.cpp | 352 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in perform()
|
/third_party/flutter/flutter/packages/flutter/lib/src/gestures/ |
D | arena.dart | 236 assert(_debugLogDiagnostic(pointer, 'Eager winner: ${state.eagerWinner}'));
|
/third_party/boost/libs/yap/doc/ |
D | examples.qbk | 17 way? _yap_ doesn't ever evaluate your expression eagerly. Eager evaluation
|
/third_party/node/deps/npm/ |
D | AUTHORS | 10 Christian Eager <christian.eager@nokia.com>
|