Lines Matching refs:task
124 task_t task;
134 int chunk_size; /* # of units of data for each map task. */
142 bool oneOutputQueuePerMapTask; /* One output queue per map task? */
143 bool oneOutputQueuePerReduceTask; /* One output queue per reduce task? */
161 /* Array to send to reduce task. */
163 keyval_arr_t *final_vals; /* Array to send to merge task. */
189 TASK_TYPE_T task_type; /* Assigned task type. */
396 /* Determine the number of threads to schedule for each type of task. */
673 * Dequeue the latest task and run it
674 * @return true if ran a task, false otherwise
691 /* Get new map task. */
705 /* Perform map task. */
813 * Dequeue next reduce task and do it
828 /* Get the next reduce task. */
1081 * Split phase of map task generation, creates all tasks and throws in single
1091 task_queued *task = NULL;
1097 task = (task_queued *)phoenix_mem_malloc (sizeof (task_queued));
1098 task->task.id = cur_task_id;
1099 task->task.len = (uint64_t)args.length;
1100 task->task.data = (uint64_t)args.data;
1102 queue_push_back (q, &task->queue_elem);
1107 if (task == NULL) {
1113 task = queue_entry (queue_elem, task_queued, queue_elem);
1114 assert (task != NULL);
1115 phoenix_mem_free (task);
1127 * in the same task queue.
1155 task_queued *task;
1162 task = queue_entry (queue_elem, task_queued, queue_elem);
1163 assert (task != NULL);
1165 if (tq_enqueue_seq (env->taskQueue, &task->task, lgrp) < 0) {
1166 phoenix_mem_free (task);
1170 phoenix_mem_free (task);
1192 task_queued *task;
1196 task = queue_entry (queue_elem, task_queued, queue_elem);
1197 assert (task != NULL);
1199 args.length = task->task.len;
1200 args.data = (void*)task->task.data;
1210 task->task.v[3] = lgrp; /* For debugging. */
1211 if (tq_enqueue_seq (env->taskQueue, &task->task, lgrp) != 0) {
1212 phoenix_mem_free (task);
1216 phoenix_mem_free (task);
1298 /* New task. */