| /external/eigen/unsupported/Eigen/CXX11/src/ThreadPool/ |
| ThreadPoolInterface.h | 19 virtual void Schedule(std::function<void()> fn) = 0;
|
| /external/v8/src/compiler/ |
| basic-block-instrumentor.h | 19 class Schedule;
24 Graph* graph, Schedule* schedule,
|
| machine-graph-verifier.h | 17 class Schedule;
23 static void Run(Graph* graph, Schedule const* const schedule,
|
| verifier.h | 18 class Schedule;
59 // Verifies properties of a schedule, such as dominance, phi placement, etc.
62 static void Run(Schedule* schedule);
|
| scheduler.h | 11 #include "src/compiler/schedule.h"
27 // Computes a schedule from a graph, placing nodes into basic blocks and
35 // The complete scheduling algorithm. Creates a new schedule and places all
37 static Schedule* ComputeSchedule(Zone* temp_zone, Graph* graph, Flags flags);
39 // Compute the RPO of blocks in an existing schedule.
40 static BasicBlockVector* ComputeSpecialRPO(Zone* zone, Schedule* schedule);
71 Schedule* schedule_;
82 Scheduler(Zone* zone, Graph* graph, Schedule* schedule, Flags flags
[all...] |
| pipeline.h | 38 class Schedule;
57 // Run the pipeline on a machine graph and generate code. The {schedule} must
61 Schedule* schedule, Code::Kind kind, const char* debug_name,
74 // Run the pipeline on a machine graph and generate code. If {schedule} is
75 // {nullptr}, then compute a new schedule for code generation.
79 const AssemblerOptions& options, Schedule* schedule = nullptr,
|
| schedule.cc | 5 #include "src/compiler/schedule.h"
150 Schedule::Schedule(Zone* zone, size_t node_count_hint)
161 BasicBlock* Schedule::block(Node* node) const {
169 bool Schedule::IsScheduled(Node* node) {
175 BasicBlock* Schedule::GetBlockById(BasicBlock::Id block_id) {
181 bool Schedule::SameBasicBlock(Node* a, Node* b) const {
187 BasicBlock* Schedule::NewBasicBlock() {
195 void Schedule::PlanNode(BasicBlock* block, Node* node) {
206 void Schedule::AddNode(BasicBlock* block, Node* node)
[all...] |
| graph-visualizer.h | 29 class Schedule;
118 explicit AsScheduledGraph(const Schedule* schedule) : schedule(schedule) {}
119 const Schedule* schedule; member in struct:v8::internal::compiler::AsScheduledGraph
124 AsC1V(const char* phase, const Schedule* schedule,
127 : schedule_(schedule),
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| eigen_thread_pool.h | 29 void Schedule(std::function<void()> fn) override {
30 pool_->Schedule(std::move(fn));
|
| /external/eigen/unsupported/test/ |
| cxx11_tensor_notification.cpp | 42 thread_pool.Schedule(func);
66 thread_pool.Schedule(func);
67 thread_pool.Schedule(func);
68 thread_pool.Schedule(func);
69 thread_pool.Schedule(func);
|
| cxx11_non_blocking_thread_pool.cpp | 36 // Schedule kThreads tasks and ensure that they all are running.
38 tp.Schedule([&]() {
52 // Now, while the previous tasks exit, schedule another kThreads tasks and
55 tp.Schedule([&, i]() {
60 // continue running and quarter of tasks schedule another 2 tasks each.
72 tp.Schedule([&]() {
88 tp.Schedule([&]() {
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/ |
| GCNIterativeScheduler.h | 42 void schedule() override;
55 std::vector<MachineInstr *> Schedule;
61 // `const` fields are to emphasize they shouldn't change for any schedule.
68 // best schedule for the region so far (not scheduled yet)
84 Range &&Schedule) const;
94 ScheduleRef Schedule,
99 std::vector<MachineInstr*> detachSchedule(ScheduleRef Schedule) const;
104 void scheduleRegion(Region &R, Range &&Schedule,
|
| GCNIterativeScheduler.cpp | 113 OS << "Region to schedule ";
202 void schedule() { function in class:GCNIterativeScheduler::OverrideLegacyStrategy
206 Sch.BaseClass::schedule();
218 // so just use SUnits as the restoring schedule
279 // returns max pressure for a tentative schedule
282 Range &&Schedule) const {
287 // schedule doesn't include it
294 for (auto I = Schedule.end(), B = Schedule.begin(); I != B;) {
313 void GCNIterativeScheduler::schedule() { // override function in class:GCNIterativeScheduler
[all...] |
| GCNILPSched.cpp | 51 std::vector<const SUnit*> schedule(ArrayRef<const SUnit*> TopRoots,
85 // Lower priority means schedule further down. For bottom-up scheduling, lower
98 // If SU does not have a register def, schedule it close to its uses
193 // Try schedule def + use closer when Sethi-Ullman numbers are the same.
202 // Then schedule t2 = op first.
291 GCNILPScheduler::schedule(ArrayRef<const SUnit*> BotRoots, function in class:GCNILPScheduler
313 std::vector<const SUnit*> Schedule;
314 Schedule.reserve(SUnits.size());
343 Schedule.push_back(SU);
346 assert(SUnits.size() == Schedule.size())
[all...] |
| /external/tensorflow/tensorflow/core/lib/core/ |
| blocking_counter_test.cc | 43 thread_pool->Schedule([&bc] { bc.DecrementCount(); });
62 thread_pool->Schedule([&bc, shards_per_thread] {
|
| notification_test.cc | 33 thread_pool->Schedule([&start, &proceed, &counter] {
64 thread_pool->Schedule([&n, &lock, &counter] {
|
| /external/tensorflow/tensorflow/core/kernels/batching_util/ |
| basic_batch_scheduler.h | 35 // could use two BasicBatchScheduler instances to schedule the two model/GPU
56 // When Schedule() is called, if the queue is full the call will fail with an
172 // The maximum allowable number of enqueued (accepted by Schedule() but
174 // If this limit is reached, Schedule() will return an UNAVAILABLE error.
191 Status Schedule(std::unique_ptr<TaskType>* task) override;
245 Status BasicBatchScheduler<TaskType>::Schedule(
247 return shared_scheduler_queue_->Schedule(task);
|
| /external/llvm/lib/CodeGen/ |
| MachinePipeliner.cpp | 38 // 3) Attempt to schedule the nodes in the specified order using the MII.
53 // where an instruction may be inserted in the pipelined schedule.
195 /// and attempts to schedule the instructions using the SMS algorithm.
198 /// The minimum initiation interval between iterations for this schedule.
200 /// Set to true if a valid pipelined schedule is found for the loop.
227 /// Instructions to change when emitting the final schedule.
267 void schedule();
332 /// Set the Minimum Initiation Interval for this schedule attempt.
335 MachineInstr *applyInstrChange(MachineInstr *MI, SMSchedule &Schedule,
365 bool schedulePipeline(SMSchedule &Schedule);
819 void SwingSchedulerDAG::schedule() { function in class:SwingSchedulerDAG
[all...] |
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/utils/ |
| parallel_for.cc | 38 thread_pool->Schedule([&do_work, &counter, start, end]() {
|
| /external/tensorflow/tensorflow/stream_executor/host/ |
| host_stream.cc | 52 host_executor_->Schedule(NotifiedTask{this, std::move(task)});
|
| /external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
| TensorDeviceThreadPool.h | 154 pool_->Schedule(std::bind(&FunctionWrapperWithNotification<Function, Args...>::run, n, f, args...));
162 pool_->Schedule(std::bind(
168 pool_->Schedule(std::bind(f, args...));
258 pool_->Schedule([=, &handleRange]() { handleRange(mid, last); });
259 pool_->Schedule([=, &handleRange]() { handleRange(first, mid); });
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| MachinePipeliner.cpp | 38 // 3) Attempt to schedule the nodes in the specified order using the MII.
53 // where an instruction may be inserted in the pipelined schedule.
229 /// and attempts to schedule the instructions using the SMS algorithm.
232 /// The minimum initiation interval between iterations for this schedule.
234 /// Set to true if a valid pipelined schedule is found for the loop.
264 /// Instructions to change when emitting the final schedule.
309 void schedule() override;
364 /// Set the Minimum Initiation Interval for this schedule attempt.
367 void applyInstrChange(MachineInstr *MI, SMSchedule &Schedule);
403 bool schedulePipeline(SMSchedule &Schedule);
881 void SwingSchedulerDAG::schedule() { function in class:SwingSchedulerDAG
[all...] |
| /external/guava/guava-tests/test/com/google/common/util/concurrent/ |
| AbstractScheduledServiceTest.java | 301 Scheduler schedule = Scheduler.newFixedRateSchedule(initialDelay, delay, unit); local
302 schedule.schedule(null, new ScheduledThreadPoolExecutor(1) {
314 Scheduler schedule = Scheduler.newFixedDelaySchedule(initialDelay, delay, unit); local
315 schedule.schedule(null, new ScheduledThreadPoolExecutor(10) {
329 protected Schedule getNextSchedule() throws Exception {
331 return new Schedule(0, TimeUnit.SECONDS);
352 Future<?> future = scheduler.schedule(null, Executors.newScheduledThreadPool(10), task);
381 protected Schedule getNextSchedule() throws Exception
[all...] |
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| evaluation_utils.cc | 34 void Schedule(std::function<void()> fn) override {
42 pool_->Schedule(std::move(wrapped));
|
| /external/tensorflow/tensorflow/lite/kernels/ |
| eigen_support.cc | 60 void Schedule(std::function<void()> fn) override {
61 pool_->Schedule(std::move(fn));
|
