This patch adds funnel_queue, a mostly lock-free multi-producer, single-consumer queue. It also adds the request queue used by the dm-vdo deduplication index, and the work_queue used by the dm-vdo data store. Both of these are built on top of funnel queue and are intended to support the dispatching of many short-running tasks. The work_queue also supports priorities. Finally, this patch adds vdo_completion, the structure which is enqueued on work_queues. Co-developed-by: J. corwin Coburn <corwin@hurlbutnet.net> Signed-off-by: J. corwin Coburn <corwin@hurlbutnet.net> Co-developed-by: Michael Sclafani <dm-devel@lists.linux.dev> Signed-off-by: Michael Sclafani <dm-devel@lists.linux.dev> Co-developed-by: Sweet Tea Dorminy <sweettea-kernel@dorminy.me> Signed-off-by: Sweet Tea Dorminy <sweettea-kernel@dorminy.me> Co-developed-by: Ken Raeburn <raeburn@redhat.com> Signed-off-by: Ken Raeburn <raeburn@redhat.com> Signed-off-by: Matthew Sakai <msakai@redhat.com> Signed-off-by: Mike Snitzer <snitzer@kernel.org>
32 lines
912 B
C
32 lines
912 B
C
/* SPDX-License-Identifier: GPL-2.0-only */
|
|
/*
|
|
* Copyright 2023 Red Hat
|
|
*/
|
|
|
|
#ifndef UDS_REQUEST_QUEUE_H
|
|
#define UDS_REQUEST_QUEUE_H
|
|
|
|
#include "uds.h"
|
|
|
|
/*
|
|
* A simple request queue which will handle new requests in the order in which they are received,
|
|
* and will attempt to handle requeued requests before new ones. However, the nature of the
|
|
* implementation means that it cannot guarantee this ordering; the prioritization is merely a
|
|
* hint.
|
|
*/
|
|
|
|
struct uds_request_queue;
|
|
|
|
typedef void (*uds_request_queue_processor_fn)(struct uds_request *);
|
|
|
|
int __must_check uds_make_request_queue(const char *queue_name,
|
|
uds_request_queue_processor_fn processor,
|
|
struct uds_request_queue **queue_ptr);
|
|
|
|
void uds_request_queue_enqueue(struct uds_request_queue *queue,
|
|
struct uds_request *request);
|
|
|
|
void uds_request_queue_finish(struct uds_request_queue *queue);
|
|
|
|
#endif /* UDS_REQUEST_QUEUE_H */
|