]>
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
;
50 struct pa_memblockq
* pa_memblockq_new(size_t maxlength
, size_t tlength
, size_t base
, size_t prebuf
, size_t minreq
) {
51 struct pa_memblockq
* bq
;
52 assert(maxlength
&& base
&& maxlength
);
54 bq
= pa_xmalloc(sizeof(struct pa_memblockq
));
55 bq
->blocks
= bq
->blocks_tail
= 0;
58 bq
->current_length
= 0;
60 fprintf(stderr
, "memblockq requested: maxlength=%u, tlength=%u, base=%u, prebuf=%u, minreq=%u\n", maxlength
, tlength
, base
, prebuf
, minreq
);
64 bq
->maxlength
= ((maxlength
+base
-1)/base
)*base
;
65 assert(bq
->maxlength
>= base
);
67 bq
->tlength
= ((tlength
+base
-1)/base
)*base
;
68 if (bq
->tlength
== 0 || bq
->tlength
>= bq
->maxlength
)
69 bq
->tlength
= bq
->maxlength
;
71 bq
->prebuf
= (prebuf
== (size_t) -1) ? bq
->maxlength
/2 : prebuf
;
72 bq
->prebuf
= (bq
->prebuf
/base
)*base
;
73 if (bq
->prebuf
> bq
->maxlength
)
74 bq
->prebuf
= bq
->maxlength
;
76 bq
->minreq
= (minreq
/base
)*base
;
80 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
);
82 bq
->measure_delay
= 0;
90 void pa_memblockq_free(struct pa_memblockq
* bq
) {
91 struct memblock_list
*l
;
95 pa_mcalign_free(bq
->mcalign
);
97 while ((l
= bq
->blocks
)) {
99 pa_memblock_unref(l
->chunk
.memblock
);
106 void pa_memblockq_push(struct pa_memblockq
* bq
, const struct pa_memchunk
*chunk
, size_t delta
) {
107 struct memblock_list
*q
;
108 assert(bq
&& chunk
&& chunk
->memblock
&& chunk
->length
&& (chunk
->length
% bq
->base
) == 0);
110 if (bq
->blocks_tail
&& bq
->blocks_tail
->chunk
.memblock
== chunk
->memblock
) {
111 /* Try to merge memory chunks */
113 if (bq
->blocks_tail
->chunk
.index
+bq
->blocks_tail
->chunk
.length
== chunk
->index
) {
114 bq
->blocks_tail
->chunk
.length
+= chunk
->length
;
115 bq
->current_length
+= chunk
->length
;
117 /* fprintf(stderr, __FILE__": merge succeeded: %u\n", chunk->length);*/
122 q
= pa_xmalloc(sizeof(struct memblock_list
));
124 if (bq
->measure_delay
)
125 gettimeofday(&q
->stamp
, NULL
);
127 timerclear(&q
->stamp
);
130 pa_memblock_ref(q
->chunk
.memblock
);
131 assert(q
->chunk
.index
+q
->chunk
.length
<= q
->chunk
.memblock
->length
);
135 bq
->blocks_tail
->next
= q
;
142 bq
->current_length
+= chunk
->length
;
144 pa_memblockq_shorten(bq
, bq
->maxlength
);
147 int pa_memblockq_peek(struct pa_memblockq
* bq
, struct pa_memchunk
*chunk
) {
150 if (!bq
->blocks
|| bq
->current_length
< bq
->prebuf
)
155 *chunk
= bq
->blocks
->chunk
;
156 pa_memblock_ref(chunk
->memblock
);
158 /* if (chunk->memblock->ref != 2) */
159 /* fprintf(stderr, "block %p with ref %u peeked.\n", chunk->memblock, chunk->memblock->ref); */
165 int memblockq_pop(struct memblockq* bq, struct pa_memchunk *chunk) {
166 struct memblock_list *q;
170 if (!bq->blocks || bq->current_length < bq->prebuf)
176 bq->blocks = bq->blocks->next;
181 bq->current_length -= chunk->length;
188 static uint32_t age(struct timeval
*tv
) {
196 gettimeofday(&now
, NULL
);
198 r
= (now
.tv_sec
-tv
->tv_sec
) * 1000000;
200 if (now
.tv_usec
>= tv
->tv_usec
)
201 r
+= now
.tv_usec
- tv
->tv_usec
;
203 r
-= tv
->tv_usec
- now
.tv_usec
;
208 void pa_memblockq_drop(struct pa_memblockq
*bq
, size_t length
) {
209 assert(bq
&& length
&& (length
% bq
->base
) == 0);
213 assert(bq
->blocks
&& bq
->current_length
>= length
);
215 if (l
> bq
->blocks
->chunk
.length
)
216 l
= bq
->blocks
->chunk
.length
;
218 if (bq
->measure_delay
)
219 bq
->delay
= age(&bq
->blocks
->stamp
);
221 bq
->blocks
->chunk
.index
+= l
;
222 bq
->blocks
->chunk
.length
-= l
;
223 bq
->current_length
-= l
;
225 if (bq
->blocks
->chunk
.length
== 0) {
226 struct memblock_list
*q
;
229 bq
->blocks
= bq
->blocks
->next
;
230 if (bq
->blocks
== NULL
)
231 bq
->blocks_tail
= NULL
;
232 pa_memblock_unref(q
->chunk
.memblock
);
242 void pa_memblockq_shorten(struct pa_memblockq
*bq
, size_t length
) {
246 if (bq
->current_length
<= length
)
249 fprintf(stderr
, "Warning! pa_memblockq_shorten()\n");
251 l
= bq
->current_length
- length
;
255 pa_memblockq_drop(bq
, l
);
259 void pa_memblockq_empty(struct pa_memblockq
*bq
) {
261 pa_memblockq_shorten(bq
, 0);
264 int pa_memblockq_is_readable(struct pa_memblockq
*bq
) {
267 return bq
->current_length
&& (bq
->current_length
>= bq
->prebuf
);
270 int pa_memblockq_is_writable(struct pa_memblockq
*bq
, size_t length
) {
273 return bq
->current_length
+ length
<= bq
->tlength
;
276 uint32_t pa_memblockq_get_delay(struct pa_memblockq
*bq
) {
281 uint32_t pa_memblockq_get_length(struct pa_memblockq
*bq
) {
283 return bq
->current_length
;
286 uint32_t pa_memblockq_missing(struct pa_memblockq
*bq
) {
290 if (bq
->current_length
>= bq
->tlength
)
293 l
= bq
->tlength
- bq
->current_length
;
296 return (l
>= bq
->minreq
) ? l
: 0;
299 void pa_memblockq_push_align(struct pa_memblockq
* bq
, const struct pa_memchunk
*chunk
, size_t delta
) {
300 struct pa_memchunk rchunk
;
301 assert(bq
&& chunk
&& bq
->base
);
304 pa_memblockq_push(bq
, chunk
, delta
);
309 bq
->mcalign
= pa_mcalign_new(bq
->base
);
313 pa_mcalign_push(bq
->mcalign
, chunk
);
315 while (pa_mcalign_pop(bq
->mcalign
, &rchunk
) >= 0) {
316 pa_memblockq_push(bq
, &rchunk
, delta
);
317 pa_memblock_unref(rchunk
.memblock
);
322 uint32_t pa_memblockq_get_minreq(struct pa_memblockq
*bq
) {