1
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
5
COPYING CONDITIONS NOTICE:
7
This program is free software; you can redistribute it and/or modify
8
it under the terms of version 2 of the GNU General Public License as
9
published by the Free Software Foundation, and provided that the
10
following conditions are met:
12
* Redistributions of source code must retain this COPYING
13
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
14
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
15
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
18
* Redistributions in binary form must reproduce this COPYING
19
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
20
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
21
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
22
GRANT (below) in the documentation and/or other materials
23
provided with the distribution.
25
You should have received a copy of the GNU General Public License
26
along with this program; if not, write to the Free Software
27
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
32
TokuDB, Tokutek Fractal Tree Indexing Library.
33
Copyright (C) 2007-2013 Tokutek, Inc.
37
This program is distributed in the hope that it will be useful, but
38
WITHOUT ANY WARRANTY; without even the implied warranty of
39
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
40
General Public License for more details.
42
UNIVERSITY PATENT NOTICE:
44
The technology is licensed by the Massachusetts Institute of
45
Technology, Rutgers State University of New Jersey, and the Research
46
Foundation of State University of New York at Stony Brook under
47
United States of America Serial No. 11/760379 and to the patents
48
and/or patent applications resulting from it.
50
PATENT MARKING NOTICE:
52
This software is covered by US Patent No. 8,185,551.
53
This software is covered by US Patent No. 8,489,638.
57
"THIS IMPLEMENTATION" means the copyrightable works distributed by
58
Tokutek as part of the Fractal Tree project.
60
"PATENT CLAIMS" means the claims of patents that are owned or
61
licensable by Tokutek, both currently or in the future; and that in
62
the absence of this license would be infringed by THIS
63
IMPLEMENTATION or by using or running THIS IMPLEMENTATION.
65
"PATENT CHALLENGE" shall mean a challenge to the validity,
66
patentability, enforceability and/or non-infringement of any of the
67
PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.
69
Tokutek hereby grants to you, for the term and geographical scope of
70
the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,
71
irrevocable (except as stated in this section) patent license to
72
make, have made, use, offer to sell, sell, import, transfer, and
73
otherwise run, modify, and propagate the contents of THIS
74
IMPLEMENTATION, where such license applies only to the PATENT
75
CLAIMS. This grant does not include claims that would be infringed
76
only as a consequence of further modifications of THIS
77
IMPLEMENTATION. If you or your agent or licensee institute or order
78
or agree to the institution of patent litigation against any entity
79
(including a cross-claim or counterclaim in a lawsuit) alleging that
80
THIS IMPLEMENTATION constitutes direct or contributory patent
81
infringement, or inducement of patent infringement, then any rights
82
granted to you under this License shall terminate as of the date
83
such litigation is filed. If you or your agent or exclusive
84
licensee institute or order or agree to the institution of a PATENT
85
CHALLENGE, then Tokutek may terminate any rights granted to you
89
#ident "Copyright (c) 2010-2013 Tokutek Inc. All rights reserved."
90
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."
92
#include <toku_portability.h>
95
#include <toku_assert.h>
98
#include <toku_pthread.h>
109
uint64_t contents_weight; // how much stuff is in there?
110
uint64_t weight_limit; // Block enqueueing when the contents gets to be bigger than the weight.
111
struct qitem *head, *tail;
119
// Representation invariant:
120
// q->contents_weight is the sum of the weights of everything in the queue.
121
// q->weight_limit is the limit on the weight before we block.
122
// q->head is the oldest thing in the queue. q->tail is the newest. (If nothing is in the queue then both are NULL)
123
// If q->head is not null:
124
// q->head->item is the oldest item.
125
// q->head->weight is the weight of that item.
126
// q->head->next is the next youngest thing.
127
// q->eof indicates that the producer has said "that's all".
128
// q->mutex and q->cond are used as condition variables.
131
int queue_create (QUEUE *q, uint64_t weight_limit)
133
QUEUE CALLOC(result);
134
if (result==NULL) return get_error_errno();
135
result->contents_weight = 0;
136
result->weight_limit = weight_limit;
140
toku_mutex_init(&result->mutex, NULL);
141
toku_cond_init(&result->cond, NULL);
146
int queue_destroy (QUEUE q)
148
if (q->head) return EINVAL;
149
assert(q->contents_weight==0);
150
toku_mutex_destroy(&q->mutex);
151
toku_cond_destroy(&q->cond);
156
int queue_enq (QUEUE q, void *item, uint64_t weight, uint64_t *total_weight_after_enq)
158
toku_mutex_lock(&q->mutex);
160
// Go ahead and put it in, even if it's too much.
161
struct qitem *MALLOC(qi);
163
int r = get_error_errno();
164
toku_mutex_unlock(&q->mutex);
167
q->contents_weight += weight;
174
assert(q->head==NULL);
178
// Wake up the consumer.
179
toku_cond_signal(&q->cond);
180
// Now block if there's too much stuff in there.
181
while (q->weight_limit < q->contents_weight) {
182
toku_cond_wait(&q->cond, &q->mutex);
184
// we are allowed to return.
185
if (total_weight_after_enq) {
186
*total_weight_after_enq = q->contents_weight;
188
toku_mutex_unlock(&q->mutex);
192
int queue_eof (QUEUE q)
194
toku_mutex_lock(&q->mutex);
197
toku_cond_signal(&q->cond);
198
toku_mutex_unlock(&q->mutex);
202
int queue_deq (QUEUE q, void **item, uint64_t *weight, uint64_t *total_weight_after_deq)
204
toku_mutex_lock(&q->mutex);
206
while (q->head==NULL && !q->eof) {
207
toku_cond_wait(&q->cond, &q->mutex);
213
struct qitem *head = q->head;
214
q->contents_weight -= head->weight;
217
*weight = head->weight;
218
if (total_weight_after_deq)
219
*total_weight_after_deq = q->contents_weight;
220
q->head = head->next;
225
// wake up the producer, since we decreased the contents_weight.
226
toku_cond_signal(&q->cond);
227
// Successful result.
230
toku_mutex_unlock(&q->mutex);