Home
last modified time | relevance | path

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/
DDomTreeUpdater.cpp123 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/
DDomTreeUpdater.h28 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/
DREADME.md3 - **[Hello World][]!** Eager to run your first gRPC example? You'll find
/third_party/boost/libs/graph_parallel/doc/
Ddijkstra_shortest_paths.rst43 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
Dindex.rst73 - `Eager Dijkstra shortest paths`_
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
DLoopRotationUtils.cpp515 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in rotateLoop()
627 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in simplifyLoopLatch()
DLoopUtils.cpp591 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in deleteDeadLoop()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
DLoopSimplifyCFG.cpp530 DTU(DT, DomTreeUpdater::UpdateStrategy::Eager) {} in ConstantTerminatorFoldingImpl()
646 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in mergeBlocksIntoPredecessors()
DTailRecursionElimination.cpp839 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); in runOnFunction()
873 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); in run()
DADCE.cpp623 DomTreeUpdater(DT, &PDT, DomTreeUpdater::UpdateStrategy::Eager) in updateDeadRegions()
DMergeICmps.cpp878 DomTreeUpdater::UpdateStrategy::Eager); in runImpl()
DLoopUnswitch.cpp1642 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in SimplifyCode()
DGVN.cpp2130 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in runImpl()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/
DPGOMemOPSizeOpt.cpp352 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); in perform()
/third_party/flutter/flutter/packages/flutter/lib/src/gestures/
Darena.dart236 assert(_debugLogDiagnostic(pointer, 'Eager winner: ${state.eagerWinner}'));
/third_party/boost/libs/yap/doc/
Dexamples.qbk17 way? _yap_ doesn't ever evaluate your expression eagerly. Eager evaluation
/third_party/node/deps/npm/
DAUTHORS10 Christian Eager <christian.eager@nokia.com>