| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/marl/src/ |
| H A D | marl_bench.h | 62 template <int NumTasks = 0x40000>
65 b->Args({NumTasks, 0}); in args()
69 b->Args({NumTasks, threads}); in args()
73 b->Args({NumTasks, threads}); in args()
77 b->Args({NumTasks, numLogicalCPUs}); in args()
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/sat/ |
| H A D | disjunctive.h | 141 task_to_event_.resize(helper_->NumTasks()); in DisjunctiveOverloadChecker()
164 task_set_(helper->NumTasks()) {} in DisjunctiveDetectablePrecedences()
218 task_set_(helper->NumTasks()) {} in DisjunctiveNotLast()
273 task_set_(helper->NumTasks()), in DisjunctivePrecedences()
274 task_to_arc_index_(helper->NumTasks()) {} in DisjunctivePrecedences()
|
| H A D | cumulative_energy.cc | 48 const int num_tasks = helper->NumTasks(); in AddCumulativeOverloadChecker()
90 const int num_tasks = helper_->NumTasks(); in CumulativeEnergyConstraint()
290 is_in_subtasks_.assign(helper->NumTasks(), false); in CumulativeIsAfterSubsetConstraint()
305 for (int t = 0; t < helper_->NumTasks(); ++t) { in Propagate()
357 for (int t = 0; t < helper_->NumTasks(); ++t) { in Propagate()
|
| H A D | diffn.cc | 86 for (int box = 0; box < y->NumTasks(); ++box) { in usage()
118 const int num_boxes = x_.NumTasks(); in usage()
338 x_(x->NumTasks(), model), in usage()
458 if (x_.NumTasks() == 2) { in usage()
472 if (x_.NumTasks() <= 2) return true; in usage()
496 const int num_boxes = global_x_.NumTasks(); in usage()
|
| H A D | intervals.cc | 106 CHECK_EQ(NumTasks(), num_tasks); in SchedulingConstraintHelper()
314 const int num_tasks = NumTasks(); in TaskByIncreasingStartMin()
326 const int num_tasks = NumTasks(); in TaskByIncreasingEndMin()
338 const int num_tasks = NumTasks(); in TaskByDecreasingStartMax()
351 const int num_tasks = NumTasks(); in TaskByDecreasingEndMax()
365 const int num_tasks = NumTasks(); in TaskByIncreasingShiftedStartMin()
|
| H A D | scheduling_cuts.cc | 65 for (int t = 0; t < helper->NumTasks(); ++t) { in AddIntegerVariableFromIntervals()
126 for (int i = 0; i < helper->NumTasks(); ++i) { in GenerateCumulativeEnergyCuts()
453 for (int i = 0; i < helper->NumTasks(); ++i) { in CreateCumulativeTimeTableCutGenerator()
620 for (int t = 0; t < helper->NumTasks(); ++t) { in CreateCumulativePrecedenceCutGenerator()
658 for (int t = 0; t < helper->NumTasks(); ++t) { in CreateNoOverlapPrecedenceCutGenerator()
878 for (int index = 0; index < helper->NumTasks(); ++index) { in CreateNoOverlapCompletionTimeCutGenerator()
936 for (int index = 0; index < helper->NumTasks(); ++index) { in CreateCumulativeCompletionTimeCutGenerator()
1004 const int num_boxes = x_helper->NumTasks(); in CreateNoOverlap2dCompletionTimeCutGenerator()
1248 const int num_boxes = x_helper->NumTasks(); in CreateNoOverlap2dEnergyCutGenerator()
|
| H A D | disjunctive.cc | 251 DCHECK_EQ(helper_->NumTasks(), 2); in Propagate()
321 task_to_disjunctives_.resize(helper_->NumTasks()); in CombinedDisjunctive()
352 const int num_tasks = helper_->NumTasks(); in Propagate()
645 processed_.assign(helper_->NumTasks(), false); in Propagate()
1175 const int num_tasks = helper_->NumTasks(); in Propagate()
|
| H A D | timetable_edgefinding.cc | 34 : num_tasks_(helper->NumTasks()), in TimeTableEdgeFinding()
|
| H A D | intervals.h | 204 int NumTasks() const { return starts_.size(); } in NumTasks() function
493 already_added_to_other_reasons_.assign(NumTasks(), false); in ClearReason()
|
| H A D | cumulative.cc | 146 for (int t = 0; t < helper->NumTasks(); ++t) { in Cumulative()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 176 size_t NumTasks = std::min(static_cast<size_t>(MaxTasksPerGroup), NumInputs); in parallel_transform_reduce() local
177 std::vector<ResultTy> Results(NumTasks, Init); in parallel_transform_reduce()
183 size_t TaskSize = NumInputs / NumTasks; in parallel_transform_reduce()
184 size_t RemainingInputs = NumInputs % NumTasks; in parallel_transform_reduce()
186 for (size_t TaskId = 0; TaskId < NumTasks; ++TaskId) { in parallel_transform_reduce()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 201 size_t NumTasks = std::min(static_cast<size_t>(MaxTasksPerGroup), NumInputs); in parallel_transform_reduce() local
202 std::vector<ResultTy> Results(NumTasks, Init); in parallel_transform_reduce()
208 size_t TaskSize = NumInputs / NumTasks; in parallel_transform_reduce()
209 size_t RemainingInputs = NumInputs % NumTasks; in parallel_transform_reduce()
211 for (size_t TaskId = 0; TaskId < NumTasks; ++TaskId) { in parallel_transform_reduce()
|
| /dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/Support/ |
| H A D | Parallel.h | 201 size_t NumTasks = std::min(static_cast<size_t>(MaxTasksPerGroup), NumInputs); in parallel_transform_reduce() local
202 std::vector<ResultTy> Results(NumTasks, Init); in parallel_transform_reduce()
208 size_t TaskSize = NumInputs / NumTasks; in parallel_transform_reduce()
209 size_t RemainingInputs = NumInputs % NumTasks; in parallel_transform_reduce()
211 for (size_t TaskId = 0; TaskId < NumTasks; ++TaskId) { in parallel_transform_reduce()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 176 size_t NumTasks = std::min(static_cast<size_t>(MaxTasksPerGroup), NumInputs); in parallel_transform_reduce() local
177 std::vector<ResultTy> Results(NumTasks, Init); in parallel_transform_reduce()
183 size_t TaskSize = NumInputs / NumTasks; in parallel_transform_reduce()
184 size_t RemainingInputs = NumInputs % NumTasks; in parallel_transform_reduce()
186 for (size_t TaskId = 0; TaskId < NumTasks; ++TaskId) { in parallel_transform_reduce()
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 198 size_t NumTasks = std::min(static_cast<size_t>(MaxTasksPerGroup), NumInputs); in parallel_transform_reduce() local
199 std::vector<ResultTy> Results(NumTasks, Init); in parallel_transform_reduce()
205 size_t TaskSize = NumInputs / NumTasks; in parallel_transform_reduce()
206 size_t RemainingInputs = NumInputs % NumTasks; in parallel_transform_reduce()
208 for (size_t TaskId = 0; TaskId < NumTasks; ++TaskId) { in parallel_transform_reduce()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 201 size_t NumTasks = std::min(static_cast<size_t>(MaxTasksPerGroup), NumInputs); in parallel_transform_reduce() local
202 std::vector<ResultTy> Results(NumTasks, Init); in parallel_transform_reduce()
208 size_t TaskSize = NumInputs / NumTasks; in parallel_transform_reduce()
209 size_t RemainingInputs = NumInputs % NumTasks; in parallel_transform_reduce()
211 for (size_t TaskId = 0; TaskId < NumTasks; ++TaskId) { in parallel_transform_reduce()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 201 size_t NumTasks = std::min(static_cast<size_t>(MaxTasksPerGroup), NumInputs); in parallel_transform_reduce() local
202 std::vector<ResultTy> Results(NumTasks, Init); in parallel_transform_reduce()
208 size_t TaskSize = NumInputs / NumTasks; in parallel_transform_reduce()
209 size_t RemainingInputs = NumInputs % NumTasks; in parallel_transform_reduce()
211 for (size_t TaskId = 0; TaskId < NumTasks; ++TaskId) { in parallel_transform_reduce()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 176 size_t NumTasks = std::min(static_cast<size_t>(MaxTasksPerGroup), NumInputs); in parallel_transform_reduce() local
177 std::vector<ResultTy> Results(NumTasks, Init); in parallel_transform_reduce()
183 size_t TaskSize = NumInputs / NumTasks; in parallel_transform_reduce()
184 size_t RemainingInputs = NumInputs % NumTasks; in parallel_transform_reduce()
186 for (size_t TaskId = 0; TaskId < NumTasks; ++TaskId) { in parallel_transform_reduce()
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/Support/ |
| H A D | Parallel.h | 201 size_t NumTasks = std::min(static_cast<size_t>(MaxTasksPerGroup), NumInputs); in parallel_transform_reduce() local
202 std::vector<ResultTy> Results(NumTasks, Init); in parallel_transform_reduce()
208 size_t TaskSize = NumInputs / NumTasks; in parallel_transform_reduce()
209 size_t RemainingInputs = NumInputs % NumTasks; in parallel_transform_reduce()
211 for (size_t TaskId = 0; TaskId < NumTasks; ++TaskId) { in parallel_transform_reduce()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/marl/tools/bench/ |
| H A D | bench.go | 31 NumTasks uint member
52 t.NumTasks = uint(n)
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/flang/lib/Semantics/ |
| H A D | check-omp-structure.h | 138 void Enter(const parser::OmpClause::NumTasks &);
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/flang/lib/Semantics/ |
| H A D | check-omp-structure.h | 149 void Enter(const parser::OmpClause::NumTasks &);
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/flang/lib/Semantics/ |
| H A D | check-omp-structure.h | 149 void Enter(const parser::OmpClause::NumTasks &);
|
| /dports/devel/f18/f18-1688bef/lib/semantics/ |
| H A D | check-omp-structure.h | 104 void Enter(const parser::OmpClause::NumTasks &);
|
| /dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/google.golang.org/appengine/internal/taskqueue/ |
| H A D | taskqueue_service.pb.go | 1137 …NumTasks *int32 `protobuf:"varint,2,req,name=num_tasks" json:"num_task… member
1152 if m != nil && m.NumTasks != nil {
1153 return *m.NumTasks
|