Home
last modified time | relevance | path

Searched refs:queue (Results 1 – 3 of 3) sorted by relevance

/coreutils/src/
Dsort.c3451 queue_destroy (struct merge_node_queue *queue) in queue_destroy() argument
3453 heap_free (queue->priority_queue); in queue_destroy()
3454 pthread_cond_destroy (&queue->cond); in queue_destroy()
3455 pthread_mutex_destroy (&queue->mutex); in queue_destroy()
3462 queue_init (struct merge_node_queue *queue, size_t nthreads) in queue_init() argument
3467 queue->priority_queue = heap_alloc (compare_nodes, 2 * nthreads); in queue_init()
3468 pthread_mutex_init (&queue->mutex, nullptr); in queue_init()
3469 pthread_cond_init (&queue->cond, nullptr); in queue_init()
3476 queue_insert (struct merge_node_queue *queue, struct merge_node *node) in queue_insert() argument
3478 pthread_mutex_lock (&queue->mutex); in queue_insert()
[all …]
Dfactor.c1985 struct { uintmax_t Q; uintmax_t P; } queue[QUEUE_SIZE]; in factor_using_squfof() local
2100 queue[qpos].Q = g; in factor_using_squfof()
2101 queue[qpos].P = P % g; in factor_using_squfof()
2120 if (queue[j].Q == r) in factor_using_squfof()
2127 if (P >= queue[j].P) in factor_using_squfof()
2128 t = P - queue[j].P; in factor_using_squfof()
2130 t = queue[j].P - P; in factor_using_squfof()
2135 memmove (queue, queue + j + 1, in factor_using_squfof()
2136 (qpos - j - 1) * sizeof (queue[0])); in factor_using_squfof()
/coreutils/doc/
Dcoreutils.texi8005 @c message queue, if this is a distinct file type