git » nmdb » master » tree

[master] / nmdb / queue.h 

 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
#ifndef _QUEUE_H
#define _QUEUE_H

#include <pthread.h>		/* for mutexes */
#include <stdint.h>		/* for uint32_t */
#include "req.h"		/* for req_info */
#include "sparse.h"

struct queue {
	pthread_mutex_t lock;
	pthread_cond_t cond;

	size_t size;
	struct queue_entry *top, *bottom;
};

struct queue_entry {
	uint32_t operation;
	struct req_info *req;

	unsigned char *key;
	unsigned char *val;
	unsigned char *newval;
	size_t ksize;
	size_t vsize;
	size_t nvsize;

	struct queue_entry *prev;
	/* A pointer to the next element on the list is actually not
	 * necessary, because it's not needed for put and get.
	 */
};


struct queue *queue_create();
void queue_free(struct queue *q);

struct queue_entry *queue_entry_create();
void queue_entry_free(struct queue_entry *e);

void queue_lock(struct queue *q)
	__acquires(q->lock);
void queue_unlock(struct queue *q)
	__releases(q->lock);
void queue_signal(struct queue *q);
int queue_timedwait(struct queue *q, struct timespec *ts)
	__with_lock_acquired(q->lock);

void queue_put(struct queue *q, struct queue_entry *e)
	__with_lock_acquired(q->lock);
struct queue_entry *queue_get(struct queue *q)
	__with_lock_acquired(q->lock);
int queue_isempty(struct queue *q)
	__with_lock_acquired(q->lock);

#endif