1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
/*****************************************************************************
Copyright (c) 2006, 2025, Oracle and/or its affiliates.
This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License, version 2.0, as published by the
Free Software Foundation.
This program is designed to work with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have either included with
the program or referenced in the documentation.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU General Public License, version 2.0,
for more details.
You should have received a copy of the GNU General Public License along with
this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*****************************************************************************/
/** @file include/ut0wqueue.h
A work queue
Created 4/26/2006 Osku Salerma
************************************************************************/
/** A Work queue. Threads can add work items to the queue and other threads can
wait for work items to be available and take them off the queue for
processing.
************************************************************************/
#ifndef IB_WORK_QUEUE_H
#define IB_WORK_QUEUE_H
#include "mem0mem.h"
#include "sync0sync.h"
#include "ut0list.h"
// Forward declaration
struct ib_list_t;
struct ib_wqueue_t;
/** Create a new work queue.
@return work queue */
ib_wqueue_t *ib_wqueue_create();
/** Free a work queue. */
void ib_wqueue_free(ib_wqueue_t *wq); /*!< in: work queue */
/** Add a work item to the queue.
@param[in] wq Work queue
@param[in] item Work item
@param[in] heap Memory heap to use for allocating the list node */
void ib_wqueue_add(ib_wqueue_t *wq, void *item, mem_heap_t *heap);
/** read total number of work item to the queue.
@param[in] wq Work queue
@return total count of work item in the queue */
uint64_t ib_wqueue_get_count(ib_wqueue_t *wq);
/********************************************************************
Check if queue is empty. */
bool ib_wqueue_is_empty(
/* out: true if queue empty
else false */
const ib_wqueue_t *wq); /* in: work queue */
/********************************************************************
Wait for a work item to appear in the queue for specified time. */
void *ib_wqueue_timedwait(
/* out: work item or NULL on timeout*/
ib_wqueue_t *wq, /* in: work queue */
std::chrono::microseconds wait); /* in: wait time */
#endif /* IB_WORK_QUEUE_H */
|
