1 /*****************************************************************************
2 * block.c: Data blocks management functions
3 *****************************************************************************
4 * Copyright (C) 2003-2004 the VideoLAN team
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 *****************************************************************************/
33 #include "vlc_block.h"
35 /*****************************************************************************
37 *****************************************************************************/
42 size_t i_allocated_buffer;
43 uint8_t p_allocated_buffer[0];
47 static void BlockNoRelease( block_t *b )
49 fprintf( stderr, "block %p has no release callback! This is a bug!\n", b );
54 void block_Init( block_t *restrict b, void *buf, size_t size )
56 /* Fill all fields to their default */
57 b->p_next = b->p_prev = NULL;
59 b->i_pts = b->i_dts = b->i_length = 0;
64 b->pf_release = BlockNoRelease;
68 static void BlockRelease( block_t *p_block )
73 /* Memory alignment */
74 #define BLOCK_ALIGN 16
75 /* Initial size of reserved header and footer */
76 #define BLOCK_PADDING_SIZE 32
77 /* Maximum size of reserved footer before we release with realloc() */
78 #define BLOCK_WASTE_SIZE 2048
80 block_t *block_Alloc( size_t i_size )
82 /* We do only one malloc
83 * TODO: bench if doing 2 malloc but keeping a pool of buffer is better
86 * 2 * BLOCK_PADDING_SIZE -> pre + post padding
88 const size_t i_alloc = i_size + 2 * BLOCK_PADDING_SIZE + BLOCK_ALIGN;
89 block_sys_t *p_sys = malloc( sizeof( *p_sys ) + i_alloc );
94 /* Fill opaque data */
95 p_sys->i_allocated_buffer = i_alloc;
97 block_Init( &p_sys->self, p_sys->p_allocated_buffer + BLOCK_PADDING_SIZE
99 - ((uintptr_t)p_sys->p_allocated_buffer % BLOCK_ALIGN),
101 p_sys->self.pf_release = BlockRelease;
106 block_t *block_Realloc( block_t *p_block, ssize_t i_prebody, size_t i_body )
108 block_sys_t *p_sys = (block_sys_t *)p_block;
109 ssize_t i_buffer_size;
111 if( p_block->pf_release != BlockRelease )
113 /* Special case when pf_release if overloaded
114 * TODO if used one day, then implement it in a smarter way */
115 block_t *p_dup = block_Duplicate( p_block );
116 block_Release( p_block );
123 i_buffer_size = i_prebody + i_body;
125 if( i_buffer_size <= 0 )
127 block_Release( p_block );
131 /* Adjust reserved header if there is enough room */
132 if( p_block->p_buffer - i_prebody > p_sys->p_allocated_buffer &&
133 p_block->p_buffer - i_prebody < p_sys->p_allocated_buffer +
134 p_sys->i_allocated_buffer )
136 p_block->p_buffer -= i_prebody;
137 p_block->i_buffer += i_prebody;
141 /* Adjust payload size if there is enough room */
142 if( p_block->p_buffer + i_body < p_sys->p_allocated_buffer +
143 p_sys->i_allocated_buffer )
145 p_block->i_buffer = i_buffer_size;
149 /* Not enough room, reallocate the buffer */
150 if( i_body > 0 || i_prebody > 0 )
152 /* FIXME: this is really dumb, we should use realloc() */
153 block_t *p_rea = block_New( NULL, i_buffer_size );
157 p_rea->i_dts = p_block->i_dts;
158 p_rea->i_pts = p_block->i_pts;
159 p_rea->i_flags = p_block->i_flags;
160 p_rea->i_length = p_block->i_length;
161 p_rea->i_rate = p_block->i_rate;
162 p_rea->i_samples = p_block->i_samples;
164 memcpy( p_rea->p_buffer + i_prebody, p_block->p_buffer,
165 __MIN( p_block->i_buffer, p_rea->i_buffer - i_prebody ) );
168 block_Release( p_block );
173 /* We have a very large reserved footer now? Release some of it. */
174 if ((p_sys->p_allocated_buffer + p_sys->i_allocated_buffer) -
175 (p_block->p_buffer + p_block->i_buffer) > BLOCK_WASTE_SIZE)
177 const size_t news = p_block->i_buffer + 2 * BLOCK_PADDING_SIZE + 16;
178 block_sys_t *newb = realloc (p_sys, sizeof (*p_sys) + news);
183 p_sys->i_allocated_buffer = news;
184 p_block = &p_sys->self;
185 p_block->p_buffer = p_sys->p_allocated_buffer + BLOCK_PADDING_SIZE
187 - ((uintptr_t)p_sys->p_allocated_buffer % BLOCK_ALIGN);
195 # include <sys/mman.h>
197 typedef struct block_mmap_t
204 static void block_mmap_Release (block_t *block)
206 block_mmap_t *p_sys = (block_mmap_t *)block;
208 munmap (p_sys->base_addr, p_sys->length);
213 * Creates a block from a virtual address memory mapping (mmap).
214 * This is provided by LibVLC so that mmap blocks can safely be deallocated
215 * even after the allocating plugin has been unloaded from memory.
217 * @param addr base address of the mapping (as returned by mmap)
218 * @param length length (bytes) of the mapping (as passed to mmap)
219 * @return NULL if addr is MAP_FAILED, or an error occurred (in the later
220 * case, munmap(addr, length) is invoked before returning).
222 block_t *block_mmap_Alloc (void *addr, size_t length)
224 if (addr == MAP_FAILED)
227 block_mmap_t *block = malloc (sizeof (*block));
230 munmap (addr, length);
234 block_Init (&block->self, (uint8_t *)addr, length);
235 block->self.pf_release = block_mmap_Release;
236 block->base_addr = addr;
237 block->length = length;
244 ssize_t pread (int fd, void *buf, size_t count, off_t offset)
246 HANDLE handle = (HANDLE)(intptr_t)_get_osfhandle (fd);
247 if (handle == INVALID_HANDLE_VALUE)
250 OVERLAPPED olap = { .Offset = offset, .OffsetHigh = (offset >> 32), };
252 /* This braindead API will override the file pointer even if we specify
253 * an explicit read offset... So do not expect this to mix well with
254 * regular read() calls. */
255 if (ReadFile (handle, buf, count, &written, &olap))
262 * Loads a file into a block of memory. If possible a private file mapping is
263 * created. Otherwise, the file is read normally. On 32-bits platforms, this
264 * function will not work for very large files, due to memory space
267 * @param fd file descriptor to load from
268 * @return a new block with the file content at p_buffer, and file length at
269 * i_buffer (release it with block_Release()), or NULL upon error (see errno).
271 block_t *block_File (int fd)
276 /* First, get the file size */
280 /* st_size is meaningful for regular files, shared memory and typed memory.
281 * It's also meaning for symlinks, but that's not possible with fstat().
282 * In other cases, it's undefined, and we should really not go further. */
284 # define S_TYPEISSHM( buf ) (0)
286 if (S_ISDIR (st.st_mode))
291 if (!S_ISREG (st.st_mode) && !S_TYPEISSHM (&st))
297 /* Prevent an integer overflow in mmap() and malloc() */
298 if (st.st_size >= SIZE_MAX)
303 length = (size_t)st.st_size;
310 addr = mmap (NULL, length, PROT_READ|PROT_WRITE, MAP_PRIVATE, fd, 0);
311 if (addr != MAP_FAILED)
312 return block_mmap_Alloc (addr, length);
316 /* If mmap() is not implemented by the OS _or_ the filesystem... */
317 block_t *block = block_Alloc (length);
321 for (size_t i = 0; i < length;)
323 ssize_t len = pread (fd, block->p_buffer + i, length - i, i);
326 block_Release (block);
334 /*****************************************************************************
335 * block_fifo_t management
336 *****************************************************************************/
339 vlc_mutex_t lock; /* fifo data lock */
340 vlc_cond_t wait; /* fifo data conditional variable */
349 block_fifo_t *block_FifoNew( void )
351 block_fifo_t *p_fifo = malloc( sizeof( block_fifo_t ) );
355 vlc_mutex_init( &p_fifo->lock );
356 vlc_cond_init( NULL, &p_fifo->wait );
357 p_fifo->p_first = NULL;
358 p_fifo->pp_last = &p_fifo->p_first;
359 p_fifo->i_depth = p_fifo->i_size = 0;
360 p_fifo->b_force_wake = false;
365 void block_FifoRelease( block_fifo_t *p_fifo )
367 block_FifoEmpty( p_fifo );
368 vlc_cond_destroy( &p_fifo->wait );
369 vlc_mutex_destroy( &p_fifo->lock );
373 void block_FifoEmpty( block_fifo_t *p_fifo )
377 vlc_mutex_lock( &p_fifo->lock );
378 for( b = p_fifo->p_first; b != NULL; )
387 p_fifo->i_depth = p_fifo->i_size = 0;
388 p_fifo->p_first = NULL;
389 p_fifo->pp_last = &p_fifo->p_first;
390 vlc_mutex_unlock( &p_fifo->lock );
393 size_t block_FifoPut( block_fifo_t *p_fifo, block_t *p_block )
396 vlc_mutex_lock( &p_fifo->lock );
400 i_size += p_block->i_buffer;
402 *p_fifo->pp_last = p_block;
403 p_fifo->pp_last = &p_block->p_next;
405 p_fifo->i_size += p_block->i_buffer;
407 p_block = p_block->p_next;
411 /* warn there is data in this fifo */
412 vlc_cond_signal( &p_fifo->wait );
413 vlc_mutex_unlock( &p_fifo->lock );
418 void block_FifoWake( block_fifo_t *p_fifo )
420 vlc_mutex_lock( &p_fifo->lock );
421 if( p_fifo->p_first == NULL )
422 p_fifo->b_force_wake = true;
423 vlc_cond_signal( &p_fifo->wait );
424 vlc_mutex_unlock( &p_fifo->lock );
427 block_t *block_FifoGet( block_fifo_t *p_fifo )
431 vlc_mutex_lock( &p_fifo->lock );
433 /* Remember vlc_cond_wait() may cause spurious wakeups
434 * (on both Win32 and POSIX) */
435 while( ( p_fifo->p_first == NULL ) && !p_fifo->b_force_wake )
437 vlc_cond_wait( &p_fifo->wait, &p_fifo->lock );
442 p_fifo->b_force_wake = false;
446 vlc_mutex_unlock( &p_fifo->lock );
450 p_fifo->p_first = b->p_next;
452 p_fifo->i_size -= b->i_buffer;
454 if( p_fifo->p_first == NULL )
456 p_fifo->pp_last = &p_fifo->p_first;
459 vlc_mutex_unlock( &p_fifo->lock );
465 block_t *block_FifoShow( block_fifo_t *p_fifo )
469 vlc_mutex_lock( &p_fifo->lock );
471 if( p_fifo->p_first == NULL )
473 vlc_cond_wait( &p_fifo->wait, &p_fifo->lock );
478 vlc_mutex_unlock( &p_fifo->lock );
483 size_t block_FifoSize( const block_fifo_t *p_fifo )
485 return p_fifo->i_size;
488 size_t block_FifoCount( const block_fifo_t *p_fifo )
490 return p_fifo->i_depth;