summaryrefslogtreecommitdiff
path: root/include/ut0wqueue.h
blob: 6bb80dad5326befbdf56b7d2a7dae4ac3cc4a3e5 (plain)
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
/*****************************************************************************

Copyright (c) 2006, 2009, Innobase Oy. All Rights Reserved.

This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free Software
Foundation; version 2 of the License.

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 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., 59 Temple
Place, Suite 330, Boston, MA 02111-1307 USA

*****************************************************************************/

/***********************************************************************
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 "ut0list.h"
#include "mem0mem.h"
#include "os0sync.h"
#include "sync0types.h"

typedef struct ib_wqueue_struct ib_wqueue_t;

/********************************************************************
Create a new work queue. */
UNIV_INTERN
ib_wqueue_t*
ib_wqueue_create(void);
/*===================*/
			/* out: work queue */

/********************************************************************
Free a work queue. */
UNIV_INTERN
void
ib_wqueue_free(
/*===========*/
	ib_wqueue_t*	wq);	/* in: work queue */

/********************************************************************
Add a work item to the queue. */
UNIV_INTERN
void
ib_wqueue_add(
/*==========*/
	ib_wqueue_t*	wq,	/* in: work queue */
	void*		item,	/* in: work item */
	mem_heap_t*	heap);	/* in: memory heap to use for allocating the
				list node */

/********************************************************************
Wait for a work item to appear in the queue. */
UNIV_INTERN
void*
ib_wqueue_wait(
				/* out: work item */
	ib_wqueue_t*	wq);	/* in: work queue */

/* Work queue. */
struct ib_wqueue_struct {
	mutex_t		mutex;	/* mutex protecting everything */
	ib_list_t*	items;	/* work item list */
	os_event_t	event;	/* event we use to signal additions to list */
};

#endif