Home
last modified time | relevance | path

Searched full:task (Results 1 – 25 of 2607) sorted by relevance

12345678910>>...105

/third_party/libwebsockets/lib/misc/threadpool/
Dthreadpool.c74 pthread_mutex_t lock; /* part of task wake_idle */
75 struct lws_threadpool_task *task; member
125 __lws_threadpool_task_dump(struct lws_threadpool_task *task, char *buf, int len) in __lws_threadpool_task_dump() argument
131 if (!task->acquired) { in __lws_threadpool_task_dump()
133 "task: %s, QUEUED queued: %dms", in __lws_threadpool_task_dump()
134 task->name, ms_delta(now, task->created)); in __lws_threadpool_task_dump()
139 if (task->acc_running) in __lws_threadpool_task_dump()
140 runms = (int)task->acc_running; in __lws_threadpool_task_dump()
142 if (task->acc_syncing) in __lws_threadpool_task_dump()
143 syncms = (int)task->acc_syncing; in __lws_threadpool_task_dump()
[all …]
DREADME.md13 thread context, where the output can be consumed, and the task told to continue,
29 of a task and that of the wsi are not necessarily linked.
31 You may start a long task, eg, that runs atomically in its thread for 30s, and
34 There are arrangements that a task can "check in" periodically with lws to see
35 if it has been asked to stop, allowing the task lifetime to be related to the
38 For that reason, at wsi close an ongoing task can detach from the wsi and
40 that work, the task is created with a `cleanup` callback that performs any
41 freeing independent of still having a wsi around to do it... the task takes over
42 responsibility to free the user pointer on destruction when the task is created.
48 Once created, although tasks may run asynchronously, the task itself does not
[all …]
/third_party/vk-gl-cts/android/cts/main/vk-master-2023-03-01/
Dycbcr.txt64 dEQP-VK.ycbcr.query.levels.task.b10x6g10x6r10x6g10x6_422_unorm_4pack16
65 dEQP-VK.ycbcr.query.levels.task.b12x4g12x4r12x4g12x4_422_unorm_4pack16
66 dEQP-VK.ycbcr.query.levels.task.b16g16r16g16_422_unorm
67 dEQP-VK.ycbcr.query.levels.task.b8g8r8g8_422_unorm
68 dEQP-VK.ycbcr.query.levels.task.g10x6_b10x6_r10x6_3plane_420_unorm_3pack16
69 dEQP-VK.ycbcr.query.levels.task.g10x6_b10x6_r10x6_3plane_420_unorm_3pack16_disjoint
70 dEQP-VK.ycbcr.query.levels.task.g10x6_b10x6_r10x6_3plane_422_unorm_3pack16
71 dEQP-VK.ycbcr.query.levels.task.g10x6_b10x6_r10x6_3plane_422_unorm_3pack16_disjoint
72 dEQP-VK.ycbcr.query.levels.task.g10x6_b10x6_r10x6_3plane_444_unorm_3pack16
73 dEQP-VK.ycbcr.query.levels.task.g10x6_b10x6_r10x6_3plane_444_unorm_3pack16_disjoint
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/marl/include/marl/
Dtask.h24 // Task is a unit of work for the scheduler.
25 class Task {
32 // SameThread ensures the task will be run on the same thread that scheduled
33 // the task. This can offer performance improvements if the current thread
34 // is immediately going to block on the newly scheduled task, by reducing
39 MARL_NO_EXPORT inline Task();
40 MARL_NO_EXPORT inline Task(const Task&);
41 MARL_NO_EXPORT inline Task(Task&&);
42 MARL_NO_EXPORT inline Task(const Function& function,
44 MARL_NO_EXPORT inline Task(Function&& function, Flags flags = Flags::None);
[all …]
/third_party/mindspore/mindspore-src/source/mindspore/ccsrc/backend/common/session/
Dexecutor.cc45 bool IsTaskReady(const std::shared_ptr<RunGraphTask> &task) { in IsTaskReady() argument
46 MS_EXCEPTION_IF_NULL(task); in IsTaskReady()
47 auto session = task->session_; in IsTaskReady()
49 auto graph = session->GetGraph(task->graph_id_); in IsTaskReady()
119 auto task = std::make_shared<ExitTask>(); in WorkerJoin() local
120 ready_tasks_.push(task); in WorkerJoin()
129 std::shared_ptr<Task> task; in WorkerLoop() local
133 task = ready_tasks_.front(); in WorkerLoop()
136 MS_EXCEPTION_IF_NULL(task); in WorkerLoop()
137 enum TaskType task_type = task->type_; in WorkerLoop()
[all …]
/third_party/mindspore/mindspore-src/source/tests/ut/python/dataset/
Dtest_datasets_cityscapes.py36 task = "color" # instance semantic polygon color
39 data = ds.CityscapesDataset(DATASET_DIR, usage=usage, quality_mode=quality_mode, task=task,
46 task_list.append(item['task'])
50 visualize_dataset(images_list, task_list, task)
53 def visualize_dataset(images, labels, task): argument
57 if task == "polygon":
66 plt.title(task)
67 plt.savefig('./cityscapes_{}_{}.jpg'.format(task, str(i)))
73 Description: Test CityscapesDataset with task of polygon
78 task = "polygon"
[all …]
/third_party/mindspore/mindspore-src/source/mindspore/lite/src/extendrt/mock/
Dexecutor.cc57 bool IsTaskReady(const std::shared_ptr<RunGraphTask> &task) { in IsTaskReady() argument
58 MS_EXCEPTION_IF_NULL(task); in IsTaskReady()
59 for (auto &input : task->input_need_wait_tensors_) { in IsTaskReady()
65 auto session = task->session_; in IsTaskReady()
67 auto graph = session->GetGraph(task->graph_id_); in IsTaskReady()
74 void WaitLockedInputs(const std::shared_ptr<RunGraphTask> &task) { in WaitLockedInputs() argument
76 for (auto &tensor : task->input_tensors_) { in WaitLockedInputs()
79 task->input_need_wait_tensors_.emplace_back(tensor); in WaitLockedInputs()
87 for (auto &input_tensor : task->input_tensors_) { in WaitLockedInputs()
96 for (auto &need_lock_tensor : task->input_need_lock_tensors_) { in WaitLockedInputs()
[all …]
/third_party/mindspore/mindspore-src/source/mindspore/lite/src/extendrt/
Dexecutor.cc57 bool IsTaskReady(const std::shared_ptr<RunGraphTask> &task) { in IsTaskReady() argument
58 MS_EXCEPTION_IF_NULL(task); in IsTaskReady()
59 for (auto &input : task->input_need_wait_tensors_) { in IsTaskReady()
65 auto session = task->session_; in IsTaskReady()
67 auto graph = session->GetGraph(task->graph_id_); in IsTaskReady()
74 void WaitLockedInputs(const std::shared_ptr<RunGraphTask> &task) { in WaitLockedInputs() argument
76 for (auto &tensor : task->input_tensors_) { in WaitLockedInputs()
79 task->input_need_wait_tensors_.emplace_back(tensor); in WaitLockedInputs()
87 for (auto &input_tensor : task->input_tensors_) { in WaitLockedInputs()
96 for (auto &need_lock_tensor : task->input_need_lock_tensors_) { in WaitLockedInputs()
[all …]
/third_party/libwebsockets/include/libwebsockets/
Dlws-threadpool.h46 LWS_TP_STATUS_FINISHED, /* lws_threadpool_task_status() frees task */
47 LWS_TP_STATUS_STOPPED, /* lws_threadpool_task_status() frees task */
64 /* OR on to indicate this task wishes to outlive its wsi */
80 const char *name; /**< user may set to describe task */
81 char async_task; /**< set to allow the task to shrug off the loss
84 enum lws_threadpool_task_return (*task)(void *user, member
86 /**< user must set to actual task function */
88 /**< socket lifecycle may end while task is not stoppable, so the task
93 * wsi may be NULL on entry, indicating the task got detached due to the
103 * \param format: printf-type format for the task name
[all …]
/third_party/python/Lib/asyncio/
Dbase_tasks.py9 def _task_repr_info(task): argument
10 info = base_futures._future_repr_info(task)
12 if task.cancelling() and not task.done():
16 info.insert(1, 'name=%r' % task.get_name())
18 coro = coroutines._format_coroutine(task._coro)
21 if task._fut_waiter is not None:
22 info.insert(3, f'wait_for={task._fut_waiter!r}')
27 def _task_repr(task): argument
28 info = ' '.join(_task_repr_info(task))
29 return f'<{task.__class__.__name__} {info}>'
[all …]
/third_party/libuv/test/
Drunner.c27 #include "task.h"
70 task_entry_t* task; in run_tests() local
75 for (task = TASKS; task->main; task++, actual++) { in run_tests()
76 if (!task->is_helper) { in run_tests()
91 for (task = TASKS; task->main; task++) { in run_tests()
92 if (task->is_helper) { in run_tests()
96 test_result = run_test(task->task_name, benchmark_output, current); in run_tests()
152 task_entry_t* task; in run_test() local
171 for (task = TASKS; task->main; task++) { in run_test()
172 if (task->is_helper && strcmp(test, task->process_name) == 0) { in run_test()
[all …]
/third_party/mesa3d/src/gallium/drivers/llvmpipe/
Dlp_cs_tpool.c45 struct lp_cs_tpool_task *task; in lp_cs_tpool_worker() local
54 task = list_first_entry(&pool->workqueue, struct lp_cs_tpool_task, in lp_cs_tpool_worker()
57 unsigned this_iter = task->iter_start; in lp_cs_tpool_worker()
59 iter_per_thread = task->iter_per_thread; in lp_cs_tpool_worker()
61 if (task->iter_remainder && in lp_cs_tpool_worker()
62 task->iter_start + task->iter_remainder == task->iter_total) { in lp_cs_tpool_worker()
63 task->iter_remainder--; in lp_cs_tpool_worker()
67 task->iter_start += iter_per_thread; in lp_cs_tpool_worker()
69 if (task->iter_start == task->iter_total) in lp_cs_tpool_worker()
70 list_del(&task->list); in lp_cs_tpool_worker()
[all …]
Dlp_rast.c98 lp_rast_tile_begin(struct lp_rasterizer_task *task, in lp_rast_tile_begin() argument
102 struct lp_scene *scene = task->scene; in lp_rast_tile_begin()
106 task->bin = bin; in lp_rast_tile_begin()
107 task->x = x * TILE_SIZE; in lp_rast_tile_begin()
108 task->y = y * TILE_SIZE; in lp_rast_tile_begin()
109 task->width = TILE_SIZE + x * TILE_SIZE > scene->fb.width ? in lp_rast_tile_begin()
111 task->height = TILE_SIZE + y * TILE_SIZE > scene->fb.height ? in lp_rast_tile_begin()
114 task->thread_data.vis_counter = 0; in lp_rast_tile_begin()
115 task->thread_data.ps_invocations = 0; in lp_rast_tile_begin()
119 task->color_tiles[i] = scene->cbufs[i].map + in lp_rast_tile_begin()
[all …]
Dlp_rast_linear.c46 lp_rast_linear_clear(struct lp_rasterizer_task *task, in lp_rast_linear_clear() argument
53 const struct lp_scene *scene = task->scene; in lp_rast_linear_clear()
57 task->x, in lp_rast_linear_clear()
58 task->y, in lp_rast_linear_clear()
59 task->width, in lp_rast_linear_clear()
60 task->height, in lp_rast_linear_clear()
68 lp_rast_linear_tile(struct lp_rasterizer_task *task, in lp_rast_linear_tile() argument
75 const struct lp_rast_state *state = task->state; in lp_rast_linear_tile()
82 const struct lp_scene *scene = task->scene; in lp_rast_linear_tile()
86 task->x, in lp_rast_linear_tile()
[all …]
/third_party/musl/ldso/linux/
Ddynlink_rand.c154 void free_task(struct loadtask *task) in free_task() argument
156 if (task == NULL) { in free_task()
159 if (task->name) { in free_task()
160 __libc_free((void *)task->name); in free_task()
161 task->name = NULL; in free_task()
163 if (task->allocated_buf) { in free_task()
164 __libc_free(task->allocated_buf); in free_task()
165 task->allocated_buf = NULL; in free_task()
167 if (task->shdr_allocated_buf != MAP_FAILED) { in free_task()
168 munmap(task->shdr_allocated_buf, task->shsize); in free_task()
[all …]
/third_party/musl/libc-test/src/functionalext/unittest/
Dunit_test_mock_dynlink.c24 void free_task(struct loadtask *task) in free_task() argument
26 if (task == NULL) { in free_task()
29 if (task->name) { in free_task()
30 free((void *)task->name); in free_task()
31 task->name = NULL; in free_task()
33 if (task->allocated_buf) { in free_task()
34 free(task->allocated_buf); in free_task()
35 task->allocated_buf = NULL; in free_task()
37 if (task->dyn_map_len) { in free_task()
38 munmap(task->dyn_map, task->dyn_map_len); in free_task()
[all …]
/third_party/typescript/tests/baselines/reference/user/
Dgrunt.log4 lib/grunt.js(91,13): error TS2551: Property 'task' does not exist on type 'typeof import("/grunt/gr…
5 lib/grunt.js(96,34): error TS2551: Property 'task' does not exist on type 'typeof import("/grunt/gr…
48 lib/grunt/help.js(81,9): error TS2551: Property 'task' does not exist on type 'typeof import("/grun…
49 lib/grunt/help.js(85,21): error TS2551: Property 'task' does not exist on type 'typeof import("/gru…
50 lib/grunt/help.js(87,22): error TS2551: Property 'task' does not exist on type 'typeof import("/gru…
51 lib/grunt/task.js(26,23): error TS2345: Argument of type 'any' is not assignable to parameter of ty…
52 lib/grunt/task.js(39,24): error TS2339: Property 'fail' does not exist on type 'typeof import("/gru…
53 lib/grunt/task.js(44,22): error TS2339: Property 'fail' does not exist on type 'typeof import("/gru…
54 lib/grunt/task.js(50,33): error TS2339: Property 'config' does not exist on type 'typeof import("/g…
55 lib/grunt/task.js(55,15): error TS2339: Property 'config' does not exist on type 'typeof import("/g…
[all …]
/third_party/musl/porting/linux/user/ldso/
Ddynlink_rand.c154 void free_task(struct loadtask *task) in free_task() argument
156 if (task == NULL) { in free_task()
159 if (task->name) { in free_task()
160 __libc_free(task->name); in free_task()
161 task->name = NULL; in free_task()
163 if (task->allocated_buf) { in free_task()
164 __libc_free(task->allocated_buf); in free_task()
165 task->allocated_buf = NULL; in free_task()
167 if (task->dyn_map_len) { in free_task()
168 munmap(task->dyn_map, task->dyn_map_len); in free_task()
[all …]
/third_party/mesa3d/src/gallium/frontends/nine/
Dthreadpool.c31 struct threadpool_task *task; in threadpool_worker() local
40 /* Pull the first task from the list. We don't free it -- it now lacks in threadpool_worker()
44 task = pool->workqueue; in threadpool_worker()
45 pool->workqueue = task->next; in threadpool_worker()
47 /* Call the task's work func. */ in threadpool_worker()
49 task->work(task->data); in threadpool_worker()
51 task->finished = true; in threadpool_worker()
52 pthread_cond_broadcast(&task->finish); in threadpool_worker()
127 struct threadpool_task *task, *previous; in _mesa_threadpool_queue_task() local
134 task = calloc(1, sizeof(*task)); in _mesa_threadpool_queue_task()
[all …]
/third_party/mindspore/mindspore-src/source/tests/ut/data/profiler_data/profiler/hccl_info/allReduce_1_1/
Diter1.trace19 "task id": 7,
20 "task type": "Notify Record",
41 "task id": 8,
42 "task type": "Notify Wait",
63 "task id": 9,
64 "task type": "Notify Record",
85 "task id": 10,
86 "task type": "Notify Wait",
107 "task id": 11,
108 "task type": "Reduce Inline",
[all …]
Diter2.trace19 "task id": 7,
20 "task type": "Notify Record",
41 "task id": 8,
42 "task type": "Notify Wait",
63 "task id": 9,
64 "task type": "Notify Record",
85 "task id": 10,
86 "task type": "Notify Wait",
107 "task id": 11,
108 "task type": "Reduce Inline",
[all …]
/third_party/protobuf/ruby/lib/google/tasks/
Dffi.rake1 # # @param task [FFI::Compiler::CompileTask] task to configure
2 def configure_common_compile_task(task) argument
11 task.add_include_path third_party_path
12 task.add_define 'NDEBUG'
13 task.cflags << "-std=gnu99 -O3"
16 ].each { |file| task.exclude << "/#{file}.c" }
17 task.ext_dir = src_dir
18 task.source_dirs = [src_dir]
20 task.cflags << "-Wall -Wsign-compare -Wno-declaration-after-statement"
24 # FFI::CompilerTask's constructor walks the filesystem at task definition time
[all …]
/third_party/python/Lib/test/test_asyncio/
Dtest_tasks.py89 Task = None variable in BaseTaskTests
93 return self.__class__.Task(coro, loop=loop, name=name, context=context)
105 task = self.__class__.Task[str]
106 self.assertEqual(task.__args__, (str,))
107 self.assertIsInstance(task, GenericAlias)
159 r'Task .* got Future .* attached'):
167 await task
169 task = asyncio.ensure_future(test(), loop=self.loop)
172 'Task cannot await on itself'):
173 self.loop.run_until_complete(task)
[all …]
/third_party/python/Doc/library/
Dasyncio-extending.rst9 classes. Asyncio has helpers that could be used to simplify this task.
37 Future and Task private constructors
40 :class:`asyncio.Future` and :class:`asyncio.Task` should be never created directly,
44 However, third-party *event loops* may *reuse* built-in future and task implementations
55 .. method:: Task.__init__(coro, *, loop=None, name=None, context=None)
57 Create a built-in task instance.
68 Task lifetime support
71 A third party task implementation should call the following functions to keep a task
74 .. function:: _register_task(task)
76 Register a new *task* as managed by *asyncio*.
[all …]
/third_party/mindspore/mindspore-src/source/mindspore/ccsrc/frontend/parallel/pass/
Dcomp_comm_scheduling.cc81 // Main loop: check each task for potential dependencies in its right neighborhood in ScheduleToDependencies()
86 // Dismiss overlapping tasks: save min end value of non-overlapping task to the right in ScheduleToDependencies()
111 bool SortByWeightMax(const std::shared_ptr<Task> &task1, const std::shared_ptr<Task> &task2) { in SortByWeightMax()
115 bool SortByWeightMin(const std::shared_ptr<Task> &task1, const std::shared_ptr<Task> &task2) { in SortByWeightMin()
119 bool SortBySuccDiff(const std::shared_ptr<Task> &task1, const std::shared_ptr<Task> &task2) { in SortBySuccDiff()
126 bool SortByBottomLevelMax(const std::shared_ptr<Task> &task1, const std::shared_ptr<Task> &task2) { in SortByBottomLevelMax()
133 bool SortByBottomLevelMin(const std::shared_ptr<Task> &task1, const std::shared_ptr<Task> &task2) { in SortByBottomLevelMin()
140 bool SortByTopLevelMax(const std::shared_ptr<Task> &task1, const std::shared_ptr<Task> &task2) { in SortByTopLevelMax()
146 bool SortByTopLevelMin(const std::shared_ptr<Task> &task1, const std::shared_ptr<Task> &task2) { in SortByTopLevelMin()
152 bool SortByBottomTopLevelMaxSum(const std::shared_ptr<Task> &task1, const std::shared_ptr<Task> &ta… in SortByBottomTopLevelMaxSum()
[all …]

12345678910>>...105