]>
code.delx.au - pulseaudio/blob - polyp/memblockq.c
4 This file is part of polypaudio.
6 polypaudio is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published
8 by the Free Software Foundation; either version 2 of the License,
9 or (at your option) any later version.
11 polypaudio is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with polypaudio; if not, write to the Free Software
18 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
32 #include "memblockq.h"
35 struct memblock_list
{
36 struct memblock_list
*next
;
37 struct pa_memchunk chunk
;
42 struct memblock_list
*blocks
, *blocks_tail
;
44 size_t current_length
, maxlength
, tlength
, base
, prebuf
, minreq
;
47 struct pa_mcalign
*mcalign
;
48 struct pa_memblock_stat
*memblock_stat
;
51 struct pa_memblockq
* pa_memblockq_new(size_t maxlength
, size_t tlength
, size_t base
, size_t prebuf
, size_t minreq
, struct pa_memblock_stat
*s
) {
52 struct pa_memblockq
* bq
;
53 assert(maxlength
&& base
&& maxlength
);
55 bq
= pa_xmalloc(sizeof(struct pa_memblockq
));
56 bq
->blocks
= bq
->blocks_tail
= 0;
59 bq
->current_length
= 0;
61 fprintf(stderr
, "memblockq requested: maxlength=%u, tlength=%u, base=%u, prebuf=%u, minreq=%u\n", maxlength
, tlength
, base
, prebuf
, minreq
);
65 bq
->maxlength
= ((maxlength
+base
-1)/base
)*base
;
66 assert(bq
->maxlength
>= base
);
68 bq
->tlength
= ((tlength
+base
-1)/base
)*base
;
69 if (bq
->tlength
== 0 || bq
->tlength
>= bq
->maxlength
)
70 bq
->tlength
= bq
->maxlength
;
72 bq
->prebuf
= (prebuf
== (size_t) -1) ? bq
->maxlength
/2 : prebuf
;
73 bq
->prebuf
= (bq
->prebuf
/base
)*base
;
74 if (bq
->prebuf
> bq
->maxlength
)
75 bq
->prebuf
= bq
->maxlength
;
77 bq
->minreq
= (minreq
/base
)*base
;
81 fprintf(stderr
, "memblockq sanitized: maxlength=%u, tlength=%u, base=%u, prebuf=%u, minreq=%u\n", bq
->maxlength
, bq
->tlength
, bq
->base
, bq
->prebuf
, bq
->minreq
);
83 bq
->measure_delay
= 0;
88 bq
->memblock_stat
= s
;
93 void pa_memblockq_free(struct pa_memblockq
* bq
) {
94 struct memblock_list
*l
;
98 pa_mcalign_free(bq
->mcalign
);
100 while ((l
= bq
->blocks
)) {
101 bq
->blocks
= l
->next
;
102 pa_memblock_unref(l
->chunk
.memblock
);
109 void pa_memblockq_push(struct pa_memblockq
* bq
, const struct pa_memchunk
*chunk
, size_t delta
) {
110 struct memblock_list
*q
;
111 assert(bq
&& chunk
&& chunk
->memblock
&& chunk
->length
&& (chunk
->length
% bq
->base
) == 0);
113 if (bq
->blocks_tail
&& bq
->blocks_tail
->chunk
.memblock
== chunk
->memblock
) {
114 /* Try to merge memory chunks */
116 if (bq
->blocks_tail
->chunk
.index
+bq
->blocks_tail
->chunk
.length
== chunk
->index
) {
117 bq
->blocks_tail
->chunk
.length
+= chunk
->length
;
118 bq
->current_length
+= chunk
->length
;
120 /* fprintf(stderr, __FILE__": merge succeeded: %u\n", chunk->length);*/
125 q
= pa_xmalloc(sizeof(struct memblock_list
));
127 if (bq
->measure_delay
)
128 gettimeofday(&q
->stamp
, NULL
);
130 timerclear(&q
->stamp
);
133 pa_memblock_ref(q
->chunk
.memblock
);
134 assert(q
->chunk
.index
+q
->chunk
.length
<= q
->chunk
.memblock
->length
);
138 bq
->blocks_tail
->next
= q
;
145 bq
->current_length
+= chunk
->length
;
147 pa_memblockq_shorten(bq
, bq
->maxlength
);
150 int pa_memblockq_peek(struct pa_memblockq
* bq
, struct pa_memchunk
*chunk
) {
153 if (!bq
->blocks
|| bq
->current_length
< bq
->prebuf
)
158 *chunk
= bq
->blocks
->chunk
;
159 pa_memblock_ref(chunk
->memblock
);
161 /* if (chunk->memblock->ref != 2) */
162 /* fprintf(stderr, "block %p with ref %u peeked.\n", chunk->memblock, chunk->memblock->ref); */
168 int memblockq_pop(struct memblockq* bq, struct pa_memchunk *chunk) {
169 struct memblock_list *q;
173 if (!bq->blocks || bq->current_length < bq->prebuf)
179 bq->blocks = bq->blocks->next;
184 bq->current_length -= chunk->length;
191 static uint32_t age(struct timeval
*tv
) {
199 gettimeofday(&now
, NULL
);
201 r
= (now
.tv_sec
-tv
->tv_sec
) * 1000000;
203 if (now
.tv_usec
>= tv
->tv_usec
)
204 r
+= now
.tv_usec
- tv
->tv_usec
;
206 r
-= tv
->tv_usec
- now
.tv_usec
;
211 void pa_memblockq_drop(struct pa_memblockq
*bq
, size_t length
) {
212 assert(bq
&& length
&& (length
% bq
->base
) == 0);
216 assert(bq
->blocks
&& bq
->current_length
>= length
);
218 if (l
> bq
->blocks
->chunk
.length
)
219 l
= bq
->blocks
->chunk
.length
;
221 if (bq
->measure_delay
)
222 bq
->delay
= age(&bq
->blocks
->stamp
);
224 bq
->blocks
->chunk
.index
+= l
;
225 bq
->blocks
->chunk
.length
-= l
;
226 bq
->current_length
-= l
;
228 if (bq
->blocks
->chunk
.length
== 0) {
229 struct memblock_list
*q
;
232 bq
->blocks
= bq
->blocks
->next
;
233 if (bq
->blocks
== NULL
)
234 bq
->blocks_tail
= NULL
;
235 pa_memblock_unref(q
->chunk
.memblock
);
245 void pa_memblockq_shorten(struct pa_memblockq
*bq
, size_t length
) {
249 if (bq
->current_length
<= length
)
252 fprintf(stderr
, "Warning! pa_memblockq_shorten()\n");
254 l
= bq
->current_length
- length
;
258 pa_memblockq_drop(bq
, l
);
262 void pa_memblockq_empty(struct pa_memblockq
*bq
) {
264 pa_memblockq_shorten(bq
, 0);
267 int pa_memblockq_is_readable(struct pa_memblockq
*bq
) {
270 return bq
->current_length
&& (bq
->current_length
>= bq
->prebuf
);
273 int pa_memblockq_is_writable(struct pa_memblockq
*bq
, size_t length
) {
276 return bq
->current_length
+ length
<= bq
->tlength
;
279 uint32_t pa_memblockq_get_delay(struct pa_memblockq
*bq
) {
284 uint32_t pa_memblockq_get_length(struct pa_memblockq
*bq
) {
286 return bq
->current_length
;
289 uint32_t pa_memblockq_missing(struct pa_memblockq
*bq
) {
293 if (bq
->current_length
>= bq
->tlength
)
296 l
= bq
->tlength
- bq
->current_length
;
299 return (l
>= bq
->minreq
) ? l
: 0;
302 void pa_memblockq_push_align(struct pa_memblockq
* bq
, const struct pa_memchunk
*chunk
, size_t delta
) {
303 struct pa_memchunk rchunk
;
304 assert(bq
&& chunk
&& bq
->base
);
307 pa_memblockq_push(bq
, chunk
, delta
);
312 bq
->mcalign
= pa_mcalign_new(bq
->base
, bq
->memblock_stat
);
316 pa_mcalign_push(bq
->mcalign
, chunk
);
318 while (pa_mcalign_pop(bq
->mcalign
, &rchunk
) >= 0) {
319 pa_memblockq_push(bq
, &rchunk
, delta
);
320 pa_memblock_unref(rchunk
.memblock
);
325 uint32_t pa_memblockq_get_minreq(struct pa_memblockq
*bq
) {
330 void pa_memblockq_prebuf_disable(struct pa_memblockq
*bq
) {