1 /*****************************************************************************
2 * block.c: Data blocks management functions
3 *****************************************************************************
4 * Copyright (C) 2003-2004 the VideoLAN team
5 * Copyright (C) 2007-2009 RĂ©mi Denis-Courmont
7 * Authors: Laurent Aimar <fenrir@videolan.org>
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
22 *****************************************************************************/
24 /*****************************************************************************
26 *****************************************************************************/
31 #include <vlc_common.h>
34 #include "vlc_block.h"
37 * @section Block handling functions.
41 * Internal state for heap block.
46 size_t i_allocated_buffer;
47 uint8_t p_allocated_buffer[];
51 static void BlockNoRelease( block_t *b )
53 fprintf( stderr, "block %p has no release callback! This is a bug!\n", b );
58 void block_Init( block_t *restrict b, void *buf, size_t size )
60 /* Fill all fields to their default */
64 b->i_dts = VLC_TS_INVALID;
70 b->pf_release = BlockNoRelease;
74 static void BlockRelease( block_t *p_block )
79 static void BlockMetaCopy( block_t *restrict out, const block_t *in )
81 out->i_dts = in->i_dts;
82 out->i_pts = in->i_pts;
83 out->i_flags = in->i_flags;
84 out->i_length = in->i_length;
85 out->i_rate = in->i_rate;
86 out->i_samples = in->i_samples;
89 /* Memory alignment */
90 #define BLOCK_ALIGN 16
91 /* Initial size of reserved header and footer */
92 #define BLOCK_PADDING_SIZE 32
93 /* Maximum size of reserved footer before we release with realloc() */
94 #define BLOCK_WASTE_SIZE 2048
96 block_t *block_Alloc( size_t i_size )
98 /* We do only one malloc
99 * TODO: bench if doing 2 malloc but keeping a pool of buffer is better
102 * 2 * BLOCK_PADDING_SIZE -> pre + post padding
104 const size_t i_alloc = i_size + 2 * BLOCK_PADDING_SIZE + BLOCK_ALIGN;
105 block_sys_t *p_sys = malloc( sizeof( *p_sys ) + i_alloc );
110 /* Fill opaque data */
111 p_sys->i_allocated_buffer = i_alloc;
113 block_Init( &p_sys->self, p_sys->p_allocated_buffer + BLOCK_PADDING_SIZE
115 - ((uintptr_t)p_sys->p_allocated_buffer % BLOCK_ALIGN),
117 p_sys->self.pf_release = BlockRelease;
122 block_t *block_Realloc( block_t *p_block, ssize_t i_prebody, size_t i_body )
124 block_sys_t *p_sys = (block_sys_t *)p_block;
125 size_t requested = i_prebody + i_body;
127 /* Corner case: empty block requested */
128 if( i_prebody <= 0 && i_body <= (size_t)(-i_prebody) )
130 block_Release( p_block );
134 if( p_block->pf_release != BlockRelease )
136 /* Special case when pf_release if overloaded
137 * TODO if used one day, then implement it in a smarter way */
138 block_t *p_dup = block_Duplicate( p_block );
139 block_Release( p_block );
144 p_sys = (block_sys_t *)p_block;
147 uint8_t *p_start = p_sys->p_allocated_buffer;
148 uint8_t *p_end = p_sys->p_allocated_buffer + p_sys->i_allocated_buffer;
150 assert( p_block->p_buffer + p_block->i_buffer <= p_end );
151 assert( p_block->p_buffer >= p_start );
153 /* Corner case: the current payload is discarded completely */
154 if( i_prebody <= 0 && p_block->i_buffer <= (size_t)-i_prebody )
155 p_block->i_buffer = 0; /* discard current payload */
156 if( p_block->i_buffer == 0 )
158 size_t available = p_end - p_start;
160 if( requested <= available )
161 { /* Enough room: recycle buffer */
162 size_t extra = available - requested;
164 p_block->p_buffer = p_start + (extra / 2);
165 p_block->i_buffer = requested;
168 /* Not enough room: allocate a new buffer */
169 block_t *p_rea = block_Alloc( requested );
171 BlockMetaCopy( p_rea, p_block );
172 block_Release( p_block );
176 /* First, shrink payload */
178 /* Pull payload start */
181 assert( p_block->i_buffer >= (size_t)-i_prebody );
182 p_block->p_buffer -= i_prebody;
183 p_block->i_buffer += i_prebody;
188 /* Trim payload end */
189 if( p_block->i_buffer > i_body )
190 p_block->i_buffer = i_body;
192 /* Second, reallocate the buffer if we lack space. This is done now to
193 * minimize the payload size for memory copy. */
194 assert( i_prebody >= 0 );
195 if( (size_t)(p_block->p_buffer - p_start) < (size_t)i_prebody
196 || (size_t)(p_end - p_block->p_buffer) < p_block->i_buffer + i_body )
198 /* FIXME: this is really dumb, we should use realloc() */
199 block_t *p_rea = block_Alloc( requested );
202 BlockMetaCopy( p_rea, p_block );
203 p_rea->p_buffer += i_prebody;
204 p_rea->i_buffer -= i_prebody;
205 memcpy( p_rea->p_buffer, p_block->p_buffer, p_block->i_buffer );
207 block_Release( p_block );
210 /* NOTE: p_start and p_end are corrupted from this point */
212 /* Third, expand payload */
214 /* Push payload start */
217 p_block->p_buffer -= i_prebody;
218 p_block->i_buffer += i_prebody;
223 /* Expand payload to requested size */
224 p_block->i_buffer = i_body;
226 /* We have a very large reserved footer now? Release some of it.
227 * XXX it might not preserve the alignment of p_buffer */
228 if( (p_sys->p_allocated_buffer + p_sys->i_allocated_buffer) -
229 (p_block->p_buffer + p_block->i_buffer) > BLOCK_WASTE_SIZE )
231 const ptrdiff_t i_prebody = p_block->p_buffer - p_sys->p_allocated_buffer;
232 const size_t i_new = i_prebody + p_block->i_buffer + 1 * BLOCK_PADDING_SIZE;
233 block_sys_t *p_new = realloc( p_sys, sizeof (*p_sys) + i_new );
238 p_sys->i_allocated_buffer = i_new;
239 p_block = &p_sys->self;
240 p_block->p_buffer = &p_sys->p_allocated_buffer[i_prebody];
253 static void block_heap_Release (block_t *self)
255 block_heap_t *block = (block_heap_t *)self;
262 * Creates a block from a heap allocation.
263 * This is provided by LibVLC so that manually heap-allocated blocks can safely
264 * be deallocated even after the origin plugin has been unloaded from memory.
266 * When block_Release() is called, VLC will free() the specified pointer.
268 * @param ptr base address of the heap allocation (will be free()'d)
269 * @param addr base address of the useful buffer data
270 * @param length bytes length of the useful buffer datan
271 * @return NULL in case of error (ptr free()'d in that case), or a valid
274 block_t *block_heap_Alloc (void *ptr, void *addr, size_t length)
276 block_heap_t *block = malloc (sizeof (*block));
283 block_Init (&block->self, (uint8_t *)addr, length);
284 block->self.pf_release = block_heap_Release;
290 # include <sys/mman.h>
292 typedef struct block_mmap_t
299 static void block_mmap_Release (block_t *block)
301 block_mmap_t *p_sys = (block_mmap_t *)block;
303 munmap (p_sys->base_addr, p_sys->length);
308 * Creates a block from a virtual address memory mapping (mmap).
309 * This is provided by LibVLC so that mmap blocks can safely be deallocated
310 * even after the allocating plugin has been unloaded from memory.
312 * @param addr base address of the mapping (as returned by mmap)
313 * @param length length (bytes) of the mapping (as passed to mmap)
314 * @return NULL if addr is MAP_FAILED, or an error occurred (in the later
315 * case, munmap(addr, length) is invoked before returning).
317 block_t *block_mmap_Alloc (void *addr, size_t length)
319 if (addr == MAP_FAILED)
322 block_mmap_t *block = malloc (sizeof (*block));
325 munmap (addr, length);
329 block_Init (&block->self, (uint8_t *)addr, length);
330 block->self.pf_release = block_mmap_Release;
331 block->base_addr = addr;
332 block->length = length;
336 block_t *block_mmap_Alloc (void *addr, size_t length)
338 (void)addr; (void)length; return NULL;
345 #define _get_osfhandle(a) ((long) (a))
349 ssize_t pread (int fd, void *buf, size_t count, off_t offset)
351 HANDLE handle = (HANDLE)(intptr_t)_get_osfhandle (fd);
352 if (handle == INVALID_HANDLE_VALUE)
355 OVERLAPPED olap; olap.Offset = offset; olap.OffsetHigh = (offset >> 32);
357 /* This braindead API will override the file pointer even if we specify
358 * an explicit read offset... So do not expect this to mix well with
359 * regular read() calls. */
360 if (ReadFile (handle, buf, count, &written, &olap))
367 * Loads a file into a block of memory. If possible a private file mapping is
368 * created. Otherwise, the file is read normally. On 32-bits platforms, this
369 * function will not work for very large files, due to memory space
370 * constraints. Cancellation point.
372 * @param fd file descriptor to load from
373 * @return a new block with the file content at p_buffer, and file length at
374 * i_buffer (release it with block_Release()), or NULL upon error (see errno).
376 block_t *block_File (int fd)
381 /* First, get the file size */
385 /* st_size is meaningful for regular files, shared memory and typed memory.
386 * It's also meaning for symlinks, but that's not possible with fstat().
387 * In other cases, it's undefined, and we should really not go further. */
389 # define S_TYPEISSHM( buf ) (0)
391 if (S_ISDIR (st.st_mode))
396 if (!S_ISREG (st.st_mode) && !S_TYPEISSHM (&st))
402 /* Prevent an integer overflow in mmap() and malloc() */
403 if (st.st_size >= SIZE_MAX)
408 length = (size_t)st.st_size;
415 addr = mmap (NULL, length, PROT_READ|PROT_WRITE, MAP_PRIVATE, fd, 0);
416 if (addr != MAP_FAILED)
417 return block_mmap_Alloc (addr, length);
421 /* If mmap() is not implemented by the OS _or_ the filesystem... */
422 block_t *block = block_Alloc (length);
425 block_cleanup_push (block);
427 for (size_t i = 0; i < length;)
429 ssize_t len = pread (fd, block->p_buffer + i, length - i, i);
432 block_Release (block);
443 * @section Thread-safe block queue functions
447 * Internal state for block queues
451 vlc_mutex_t lock; /* fifo data lock */
452 vlc_cond_t wait; /**< Wait for data */
453 vlc_cond_t wait_room; /**< Wait for queue depth to shrink */
462 block_fifo_t *block_FifoNew( void )
464 block_fifo_t *p_fifo = malloc( sizeof( block_fifo_t ) );
468 vlc_mutex_init( &p_fifo->lock );
469 vlc_cond_init( &p_fifo->wait );
470 vlc_cond_init( &p_fifo->wait_room );
471 p_fifo->p_first = NULL;
472 p_fifo->pp_last = &p_fifo->p_first;
473 p_fifo->i_depth = p_fifo->i_size = 0;
474 p_fifo->b_force_wake = false;
479 void block_FifoRelease( block_fifo_t *p_fifo )
481 block_FifoEmpty( p_fifo );
482 vlc_cond_destroy( &p_fifo->wait_room );
483 vlc_cond_destroy( &p_fifo->wait );
484 vlc_mutex_destroy( &p_fifo->lock );
488 void block_FifoEmpty( block_fifo_t *p_fifo )
492 vlc_mutex_lock( &p_fifo->lock );
493 for( b = p_fifo->p_first; b != NULL; )
502 p_fifo->i_depth = p_fifo->i_size = 0;
503 p_fifo->p_first = NULL;
504 p_fifo->pp_last = &p_fifo->p_first;
505 vlc_cond_broadcast( &p_fifo->wait_room );
506 vlc_mutex_unlock( &p_fifo->lock );
510 * Wait until the FIFO gets below a certain size (if needed).
512 * Note that if more than one thread writes to the FIFO, you cannot assume that
513 * the FIFO is actually below the requested size upon return (since another
514 * thread could have refilled it already). This is typically not an issue, as
515 * this function is meant for (relaxed) congestion control.
517 * This function may be a cancellation point and it is cancel-safe.
519 * @param fifo queue to wait on
520 * @param max_depth wait until the queue has no more than this many blocks
521 * (use SIZE_MAX to ignore this constraint)
522 * @param max_size wait until the queue has no more than this many bytes
523 * (use SIZE_MAX to ignore this constraint)
526 void block_FifoPace (block_fifo_t *fifo, size_t max_depth, size_t max_size)
530 vlc_mutex_lock (&fifo->lock);
531 while ((fifo->i_depth > max_depth) || (fifo->i_size > max_size))
533 mutex_cleanup_push (&fifo->lock);
534 vlc_cond_wait (&fifo->wait_room, &fifo->lock);
537 vlc_mutex_unlock (&fifo->lock);
541 * Immediately queue one block at the end of a FIFO.
543 * @param block head of a block list to queue (may be NULL)
545 size_t block_FifoPut( block_fifo_t *p_fifo, block_t *p_block )
548 vlc_mutex_lock( &p_fifo->lock );
550 while (p_block != NULL)
552 i_size += p_block->i_buffer;
554 *p_fifo->pp_last = p_block;
555 p_fifo->pp_last = &p_block->p_next;
557 p_fifo->i_size += p_block->i_buffer;
559 p_block = p_block->p_next;
562 /* We queued one block: wake up one read-waiting thread */
563 vlc_cond_signal( &p_fifo->wait );
564 vlc_mutex_unlock( &p_fifo->lock );
569 void block_FifoWake( block_fifo_t *p_fifo )
571 vlc_mutex_lock( &p_fifo->lock );
572 if( p_fifo->p_first == NULL )
573 p_fifo->b_force_wake = true;
574 vlc_cond_broadcast( &p_fifo->wait );
575 vlc_mutex_unlock( &p_fifo->lock );
578 block_t *block_FifoGet( block_fifo_t *p_fifo )
584 vlc_mutex_lock( &p_fifo->lock );
585 mutex_cleanup_push( &p_fifo->lock );
587 /* Remember vlc_cond_wait() may cause spurious wakeups
588 * (on both Win32 and POSIX) */
589 while( ( p_fifo->p_first == NULL ) && !p_fifo->b_force_wake )
590 vlc_cond_wait( &p_fifo->wait, &p_fifo->lock );
595 p_fifo->b_force_wake = false;
599 vlc_mutex_unlock( &p_fifo->lock );
603 p_fifo->p_first = b->p_next;
605 p_fifo->i_size -= b->i_buffer;
607 if( p_fifo->p_first == NULL )
609 p_fifo->pp_last = &p_fifo->p_first;
612 /* We don't know how many threads can queue new packets now. */
613 vlc_cond_broadcast( &p_fifo->wait_room );
614 vlc_mutex_unlock( &p_fifo->lock );
620 block_t *block_FifoShow( block_fifo_t *p_fifo )
626 vlc_mutex_lock( &p_fifo->lock );
627 mutex_cleanup_push( &p_fifo->lock );
629 while( p_fifo->p_first == NULL )
630 vlc_cond_wait( &p_fifo->wait, &p_fifo->lock );
638 /* FIXME: not thread-safe */
639 size_t block_FifoSize( const block_fifo_t *p_fifo )
641 return p_fifo->i_size;
644 /* FIXME: not thread-safe */
645 size_t block_FifoCount( const block_fifo_t *p_fifo )
647 return p_fifo->i_depth;