/* GStreamer * Copyright (C) 2004 Benjamin Otte * 2005 Wim Taymans * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Library General Public * License as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Library General Public License for more details. * * You should have received a copy of the GNU Library General Public * License along with this library; if not, write to the * Free Software Foundation, Inc., 59 Temple Place - Suite 330, * Boston, MA 02111-1307, USA. */ /** * SECTION:gstadapter * @short_description: adapts incoming data on a sink pad into chunks of N bytes * * This class is for elements that receive buffers in an undesired size. * While for example raw video contains one image per buffer, the same is not * true for a lot of other formats, especially those that come directly from * a file. So if you have undefined buffer sizes and require a specific size, * this object is for you. * * An adapter is created with gst_adapter_new(). It can be freed again with * g_object_unref(). * * The theory of operation is like this: All buffers received are put * into the adapter using gst_adapter_push() and the data is then read back * in chunks of the desired size using gst_adapter_peek(). After the data is * processed, it is freed using gst_adapter_flush(). * * Other methods such as gst_adapter_take() and gst_adapter_take_buffer() * combine gst_adapter_peek() and gst_adapter_flush() in one method and are * potentially more convenient for some use cases. * * For example, a sink pad's chain function that needs to pass data to a library * in 512-byte chunks could be implemented like this: * |[ * static GstFlowReturn * sink_pad_chain (GstPad *pad, GstBuffer *buffer) * { * MyElement *this; * GstAdapter *adapter; * GstFlowReturn ret = GST_FLOW_OK; * * // will give the element an extra ref; remember to drop it * this = MY_ELEMENT (gst_pad_get_parent (pad)); * adapter = this->adapter; * * // put buffer into adapter * gst_adapter_push (adapter, buffer); * // while we can read out 512 bytes, process them * while (gst_adapter_available (adapter) >= 512 && ret == GST_FLOW_OK) { * // use flowreturn as an error value * ret = my_library_foo (gst_adapter_peek (adapter, 512)); * gst_adapter_flush (adapter, 512); * } * * gst_object_unref (this); * return ret; * } * ]| * * For another example, a simple element inside GStreamer that uses GstAdapter * is the libvisual element. * * An element using GstAdapter in its sink pad chain function should ensure that * when the FLUSH_STOP event is received, that any queued data is cleared using * gst_adapter_clear(). Data should also be cleared or processed on EOS and * when changing state from #GST_STATE_PAUSED to #GST_STATE_READY. * * Also check the GST_BUFFER_FLAG_DISCONT flag on the buffer. Some elements might * need to clear the adapter after a discontinuity. * * Since 0.10.24, the adapter will keep track of the timestamps of the buffers * that were pushed. The last seen timestamp before the current position * can be queried with gst_adapter_prev_timestamp(). This function can * optionally return the amount of bytes between the start of the buffer that * carried the timestamp and the current adapter position. The distance is * useful when dealing with, for example, raw audio samples because it allows * you to calculate the timestamp of the current adapter position by using the * last seen timestamp and the amount of bytes since. * * A last thing to note is that while GstAdapter is pretty optimized, * merging buffers still might be an operation that requires a malloc() and * memcpy() operation, and these operations are not the fastest. Because of * this, some functions like gst_adapter_available_fast() are provided to help * speed up such cases should you want to. To avoid repeated memory allocations, * gst_adapter_copy() can be used to copy data into a (statically allocated) * user provided buffer. * * GstAdapter is not MT safe. All operations on an adapter must be serialized by * the caller. This is not normally a problem, however, as the normal use case * of GstAdapter is inside one pad's chain function, in which case access is * serialized via the pad's STREAM_LOCK. * * Note that gst_adapter_push() takes ownership of the buffer passed. Use * gst_buffer_ref() before pushing it into the adapter if you still want to * access the buffer later. The adapter will never modify the data in the * buffer pushed in it. * * Last reviewed on 2009-05-13 (0.10.24). */ #include #include "gstadapter.h" #include /* default size for the assembled data buffer */ #define DEFAULT_SIZE 4096 GST_DEBUG_CATEGORY_STATIC (gst_adapter_debug); #define GST_CAT_DEFAULT gst_adapter_debug #define GST_ADAPTER_GET_PRIVATE(obj) \ (G_TYPE_INSTANCE_GET_PRIVATE ((obj), GST_TYPE_ADAPTER, GstAdapterPrivate)) struct _GstAdapterPrivate { GstClockTime timestamp; guint64 distance; guint scan_offset; GSList *scan_entry; }; #define _do_init(thing) \ GST_DEBUG_CATEGORY_INIT (gst_adapter_debug, "adapter", 0, "object to splice and merge buffers to desired size") GST_BOILERPLATE_FULL (GstAdapter, gst_adapter, GObject, G_TYPE_OBJECT, _do_init); static void gst_adapter_dispose (GObject * object); static void gst_adapter_finalize (GObject * object); static void gst_adapter_base_init (gpointer g_class) { /* nop */ } static void gst_adapter_class_init (GstAdapterClass * klass) { GObjectClass *object = G_OBJECT_CLASS (klass); g_type_class_add_private (klass, sizeof (GstAdapterPrivate)); object->dispose = gst_adapter_dispose; object->finalize = gst_adapter_finalize; } static void gst_adapter_init (GstAdapter * adapter, GstAdapterClass * g_class) { adapter->priv = GST_ADAPTER_GET_PRIVATE (adapter); adapter->assembled_data = g_malloc (DEFAULT_SIZE); adapter->assembled_size = DEFAULT_SIZE; adapter->priv->timestamp = GST_CLOCK_TIME_NONE; adapter->priv->distance = 0; } static void gst_adapter_dispose (GObject * object) { GstAdapter *adapter = GST_ADAPTER (object); gst_adapter_clear (adapter); GST_CALL_PARENT (G_OBJECT_CLASS, dispose, (object)); } static void gst_adapter_finalize (GObject * object) { GstAdapter *adapter = GST_ADAPTER (object); g_free (adapter->assembled_data); GST_CALL_PARENT (G_OBJECT_CLASS, finalize, (object)); } /** * gst_adapter_new: * * Creates a new #GstAdapter. Free with g_object_unref(). * * Returns: (transfer full): a new #GstAdapter */ GstAdapter * gst_adapter_new (void) { return g_object_newv (GST_TYPE_ADAPTER, 0, NULL); } /** * gst_adapter_clear: * @adapter: a #GstAdapter * * Removes all buffers from @adapter. */ void gst_adapter_clear (GstAdapter * adapter) { g_return_if_fail (GST_IS_ADAPTER (adapter)); g_slist_foreach (adapter->buflist, (GFunc) gst_mini_object_unref, NULL); g_slist_free (adapter->buflist); adapter->buflist = NULL; adapter->buflist_end = NULL; adapter->size = 0; adapter->skip = 0; adapter->assembled_len = 0; adapter->priv->timestamp = GST_CLOCK_TIME_NONE; adapter->priv->distance = 0; adapter->priv->scan_offset = 0; adapter->priv->scan_entry = NULL; } static inline void update_timestamp (GstAdapter * adapter, GstBuffer * buf) { GstClockTime timestamp; timestamp = GST_BUFFER_TIMESTAMP (buf); if (GST_CLOCK_TIME_IS_VALID (timestamp)) { GST_LOG_OBJECT (adapter, "new timestamp %" GST_TIME_FORMAT, GST_TIME_ARGS (timestamp)); adapter->priv->timestamp = timestamp; adapter->priv->distance = 0; } } /* copy data into @dest, skipping @skip bytes from the head buffers */ static void copy_into_unchecked (GstAdapter * adapter, guint8 * dest, guint skip, guint size) { GSList *g; GstBuffer *buf; guint bsize, csize; /* first step, do skipping */ /* we might well be copying where we were scanning */ if (adapter->priv->scan_entry && (adapter->priv->scan_offset <= skip)) { g = adapter->priv->scan_entry; skip -= adapter->priv->scan_offset; } else { g = adapter->buflist; } buf = g->data; bsize = GST_BUFFER_SIZE (buf); while (G_UNLIKELY (skip >= bsize)) { skip -= bsize; g = g_slist_next (g); buf = g->data; bsize = GST_BUFFER_SIZE (buf); } /* copy partial buffer */ csize = MIN (bsize - skip, size); memcpy (dest, GST_BUFFER_DATA (buf) + skip, csize); size -= csize; dest += csize; /* second step, copy remainder */ while (size > 0) { g = g_slist_next (g); buf = g->data; bsize = GST_BUFFER_SIZE (buf); if (G_LIKELY (bsize > 0)) { csize = MIN (bsize, size); memcpy (dest, GST_BUFFER_DATA (buf), csize); size -= csize; dest += csize; } } } /** * gst_adapter_push: * @adapter: a #GstAdapter * @buf: (transfer full): a #GstBuffer to add to queue in the adapter * * Adds the data from @buf to the data stored inside @adapter and takes * ownership of the buffer. */ void gst_adapter_push (GstAdapter * adapter, GstBuffer * buf) { guint size; g_return_if_fail (GST_IS_ADAPTER (adapter)); g_return_if_fail (GST_IS_BUFFER (buf)); size = GST_BUFFER_SIZE (buf); adapter->size += size; /* Note: merging buffers at this point is premature. */ if (G_UNLIKELY (adapter->buflist == NULL)) { GST_LOG_OBJECT (adapter, "pushing first %u bytes", size); adapter->buflist = adapter->buflist_end = g_slist_append (NULL, buf); update_timestamp (adapter, buf); } else { /* Otherwise append to the end, and advance our end pointer */ GST_LOG_OBJECT (adapter, "pushing %u bytes at end, size now %u", size, adapter->size); adapter->buflist_end = g_slist_append (adapter->buflist_end, buf); adapter->buflist_end = g_slist_next (adapter->buflist_end); } } /* Internal method only. Tries to merge buffers at the head of the queue * to form a single larger buffer of size 'size'. Only merges buffers that * where 'gst_buffer_is_span_fast' returns TRUE. * * Returns TRUE if it managed to merge anything. */ static gboolean gst_adapter_try_to_merge_up (GstAdapter * adapter, guint size) { GstBuffer *cur, *head; GSList *g; gboolean ret = FALSE; g = adapter->buflist; if (g == NULL) return FALSE; head = g->data; g = g_slist_next (g); /* How large do we want our head buffer? The requested size, plus whatever's * been skipped already */ size += adapter->skip; while (g != NULL && GST_BUFFER_SIZE (head) < size) { cur = g->data; if (!gst_buffer_is_span_fast (head, cur)) return ret; /* Merge the head buffer and the next in line */ GST_LOG_OBJECT (adapter, "Merging buffers of size %u & %u in search of target %u", GST_BUFFER_SIZE (head), GST_BUFFER_SIZE (cur), size); head = gst_buffer_join (head, cur); ret = TRUE; /* Delete the front list item, and store our new buffer in the 2nd list * item */ adapter->buflist = g_slist_delete_link (adapter->buflist, adapter->buflist); g->data = head; /* invalidate scan position */ adapter->priv->scan_offset = 0; adapter->priv->scan_entry = NULL; g = g_slist_next (g); } return ret; } /** * gst_adapter_peek: * @adapter: a #GstAdapter * @size: the number of bytes to peek * * Gets the first @size bytes stored in the @adapter. The returned pointer is * valid until the next function is called on the adapter. * * Note that setting the returned pointer as the data of a #GstBuffer is * incorrect for general-purpose plugins. The reason is that if a downstream * element stores the buffer so that it has access to it outside of the bounds * of its chain function, the buffer will have an invalid data pointer after * your element flushes the bytes. In that case you should use * gst_adapter_take(), which returns a freshly-allocated buffer that you can set * as #GstBuffer malloc_data or the potentially more performant * gst_adapter_take_buffer(). * * Returns #NULL if @size bytes are not available. * * Returns: (transfer none) (array length=size): a pointer to the first * @size bytes of data, or NULL */ const guint8 * gst_adapter_peek (GstAdapter * adapter, guint size) { GstBuffer *cur; guint skip; guint toreuse, tocopy; guint8 *data; g_return_val_if_fail (GST_IS_ADAPTER (adapter), NULL); g_return_val_if_fail (size > 0, NULL); /* we don't have enough data, return NULL. This is unlikely * as one usually does an _available() first instead of peeking a * random size. */ if (G_UNLIKELY (size > adapter->size)) return NULL; /* we have enough assembled data, return it */ if (adapter->assembled_len >= size) return adapter->assembled_data; /* our head buffer has enough data left, return it */ cur = adapter->buflist->data; skip = adapter->skip; if (GST_BUFFER_SIZE (cur) >= size + skip) return GST_BUFFER_DATA (cur) + skip; /* We may be able to efficiently merge buffers in our pool to * gather a big enough chunk to return it from the head buffer directly */ if (gst_adapter_try_to_merge_up (adapter, size)) { /* Merged something! Check if there's enough avail now */ cur = adapter->buflist->data; if (GST_BUFFER_SIZE (cur) >= size + skip) return GST_BUFFER_DATA (cur) + skip; } /* see how much data we can reuse from the assembled memory and how much * we need to copy */ toreuse = adapter->assembled_len; tocopy = size - toreuse; /* Gonna need to copy stuff out */ if (G_UNLIKELY (adapter->assembled_size < size)) { adapter->assembled_size = (size / DEFAULT_SIZE + 1) * DEFAULT_SIZE; GST_DEBUG_OBJECT (adapter, "resizing internal buffer to %u", adapter->assembled_size); if (toreuse == 0) { GST_CAT_DEBUG (GST_CAT_PERFORMANCE, "alloc new buffer"); /* no g_realloc to avoid a memcpy that is not desired here since we are * not going to reuse any data here */ g_free (adapter->assembled_data); adapter->assembled_data = g_malloc (adapter->assembled_size); } else { /* we are going to reuse all data, realloc then */ GST_CAT_DEBUG (GST_CAT_PERFORMANCE, "reusing %u bytes", toreuse); adapter->assembled_data = g_realloc (adapter->assembled_data, adapter->assembled_size); } } GST_CAT_DEBUG (GST_CAT_PERFORMANCE, "copy remaining %u bytes from adapter", tocopy); data = adapter->assembled_data; copy_into_unchecked (adapter, data + toreuse, skip + toreuse, tocopy); adapter->assembled_len = size; return adapter->assembled_data; } /** * gst_adapter_copy: * @adapter: a #GstAdapter * @dest: (out caller-allocates) (array length=size): the memory to copy into * @offset: the bytes offset in the adapter to start from * @size: the number of bytes to copy * * Copies @size bytes of data starting at @offset out of the buffers * contained in @GstAdapter into an array @dest provided by the caller. * * The array @dest should be large enough to contain @size bytes. * The user should check that the adapter has (@offset + @size) bytes * available before calling this function. * * Since: 0.10.12 */ void gst_adapter_copy (GstAdapter * adapter, guint8 * dest, guint offset, guint size) { g_return_if_fail (GST_IS_ADAPTER (adapter)); g_return_if_fail (size > 0); g_return_if_fail (offset + size <= adapter->size); copy_into_unchecked (adapter, dest, offset + adapter->skip, size); } /** * gst_adapter_flush: * @adapter: a #GstAdapter * @flush: the number of bytes to flush * * Flushes the first @flush bytes in the @adapter. The caller must ensure that * at least this many bytes are available. * * See also: gst_adapter_peek(). */ static void gst_adapter_flush_unchecked (GstAdapter * adapter, guint flush) { GstBuffer *cur; guint size; GstAdapterPrivate *priv; GSList *g; GST_LOG_OBJECT (adapter, "flushing %u bytes", flush); priv = adapter->priv; /* clear state */ adapter->size -= flush; adapter->assembled_len = 0; /* take skip into account */ flush += adapter->skip; /* distance is always at least the amount of skipped bytes */ priv->distance -= adapter->skip; g = adapter->buflist; cur = g->data; size = GST_BUFFER_SIZE (cur); while (flush >= size) { /* can skip whole buffer */ GST_LOG_OBJECT (adapter, "flushing out head buffer"); priv->distance += size; flush -= size; gst_buffer_unref (cur); g = g_slist_delete_link (g, g); if (G_UNLIKELY (g == NULL)) { GST_LOG_OBJECT (adapter, "adapter empty now"); adapter->buflist_end = NULL; break; } /* there is a new head buffer, update the timestamp */ cur = g->data; update_timestamp (adapter, cur); size = GST_BUFFER_SIZE (cur); } adapter->buflist = g; /* account for the remaining bytes */ adapter->skip = flush; adapter->priv->distance += flush; /* invalidate scan position */ priv->scan_offset = 0; priv->scan_entry = NULL; } void gst_adapter_flush (GstAdapter * adapter, guint flush) { g_return_if_fail (GST_IS_ADAPTER (adapter)); g_return_if_fail (flush <= adapter->size); /* flushing out 0 bytes will do nothing */ if (G_UNLIKELY (flush == 0)) return; gst_adapter_flush_unchecked (adapter, flush); } /* internal function, nbytes should be flushed after calling this function */ static guint8 * gst_adapter_take_internal (GstAdapter * adapter, guint nbytes) { guint8 *data; guint toreuse, tocopy; /* see how much data we can reuse from the assembled memory and how much * we need to copy */ toreuse = MIN (nbytes, adapter->assembled_len); tocopy = nbytes - toreuse; /* find memory to return */ if (adapter->assembled_size >= nbytes && toreuse > 0) { /* we reuse already allocated memory but only when we're going to reuse * something from it because else we are worse than the malloc and copy * case below */ GST_LOG_OBJECT (adapter, "reusing %u bytes of assembled data", toreuse); /* we have enough free space in the assembled array */ data = adapter->assembled_data; /* flush after this function should set the assembled_size to 0 */ adapter->assembled_data = g_malloc (adapter->assembled_size); } else { GST_LOG_OBJECT (adapter, "allocating %u bytes", nbytes); /* not enough bytes in the assembled array, just allocate new space */ data = g_malloc (nbytes); /* reuse what we can from the already assembled data */ if (toreuse) { GST_LOG_OBJECT (adapter, "reusing %u bytes", toreuse); memcpy (data, adapter->assembled_data, toreuse); } } if (tocopy) { /* copy the remaining data */ GST_LOG_OBJECT (adapter, "copying %u bytes", tocopy); copy_into_unchecked (adapter, toreuse + data, toreuse + adapter->skip, tocopy); } return data; } /** * gst_adapter_take: * @adapter: a #GstAdapter * @nbytes: the number of bytes to take * * Returns a freshly allocated buffer containing the first @nbytes bytes of the * @adapter. The returned bytes will be flushed from the adapter. * * Caller owns returned value. g_free after usage. * * Free-function: g_free * * Returns: (transfer full) (array length=nbytes): oven-fresh hot data, or * #NULL if @nbytes bytes are not available */ guint8 * gst_adapter_take (GstAdapter * adapter, guint nbytes) { guint8 *data; g_return_val_if_fail (GST_IS_ADAPTER (adapter), NULL); g_return_val_if_fail (nbytes > 0, NULL); /* we don't have enough data, return NULL. This is unlikely * as one usually does an _available() first instead of peeking a * random size. */ if (G_UNLIKELY (nbytes > adapter->size)) return NULL; data = gst_adapter_take_internal (adapter, nbytes); gst_adapter_flush_unchecked (adapter, nbytes); return data; } /** * gst_adapter_take_buffer: * @adapter: a #GstAdapter * @nbytes: the number of bytes to take * * Returns a #GstBuffer containing the first @nbytes bytes of the * @adapter. The returned bytes will be flushed from the adapter. * This function is potentially more performant than gst_adapter_take() * since it can reuse the memory in pushed buffers by subbuffering * or merging. * * Caller owns returned value. gst_buffer_unref() after usage. * * Free-function: gst_buffer_unref * * Returns: (transfer full): a #GstBuffer containing the first @nbytes of * the adapter, or #NULL if @nbytes bytes are not available * * Since: 0.10.6 */ GstBuffer * gst_adapter_take_buffer (GstAdapter * adapter, guint nbytes) { GstBuffer *buffer; GstBuffer *cur; guint hsize, skip; guint8 *data; g_return_val_if_fail (GST_IS_ADAPTER (adapter), NULL); g_return_val_if_fail (nbytes > 0, NULL); GST_LOG_OBJECT (adapter, "taking buffer of %u bytes", nbytes); /* we don't have enough data, return NULL. This is unlikely * as one usually does an _available() first instead of grabbing a * random size. */ if (G_UNLIKELY (nbytes > adapter->size)) return NULL; cur = adapter->buflist->data; skip = adapter->skip; hsize = GST_BUFFER_SIZE (cur); /* our head buffer has enough data left, return it */ if (skip == 0 && hsize == nbytes) { GST_LOG_OBJECT (adapter, "providing buffer of %d bytes as head buffer", nbytes); buffer = gst_buffer_ref (cur); goto done; } else if (hsize >= nbytes + skip) { GST_LOG_OBJECT (adapter, "providing buffer of %d bytes via sub-buffer", nbytes); buffer = gst_buffer_create_sub (cur, skip, nbytes); goto done; } if (gst_adapter_try_to_merge_up (adapter, nbytes)) { /* Merged something, let's try again for sub-buffering */ cur = adapter->buflist->data; if (GST_BUFFER_SIZE (cur) >= nbytes + skip) { GST_LOG_OBJECT (adapter, "providing buffer of %d bytes via sub-buffer", nbytes); buffer = gst_buffer_create_sub (cur, skip, nbytes); goto done; } } data = gst_adapter_take_internal (adapter, nbytes); buffer = gst_buffer_new (); GST_BUFFER_SIZE (buffer) = nbytes; GST_BUFFER_DATA (buffer) = data; GST_BUFFER_MALLOCDATA (buffer) = data; done: gst_adapter_flush_unchecked (adapter, nbytes); return buffer; } /** * gst_adapter_take_list: * @adapter: a #GstAdapter * @nbytes: the number of bytes to take * * Returns a #GList of buffers containing the first @nbytes bytes of the * @adapter. The returned bytes will be flushed from the adapter. * When the caller can deal with individual buffers, this function is more * performant because no memory should be copied. * * Caller owns returned list and contained buffers. gst_buffer_unref() each * buffer in the list before freeing the list after usage. * * Returns: (element-type Gst.Buffer) (transfer full): a #GList of buffers * containing the first @nbytes of the adapter, or #NULL if @nbytes bytes * are not available * * Since: 0.10.31 */ GList * gst_adapter_take_list (GstAdapter * adapter, guint nbytes) { GQueue queue = G_QUEUE_INIT; GstBuffer *cur; guint hsize, skip; g_return_val_if_fail (GST_IS_ADAPTER (adapter), NULL); g_return_val_if_fail (nbytes <= adapter->size, NULL); GST_LOG_OBJECT (adapter, "taking %u bytes", nbytes); while (nbytes > 0) { cur = adapter->buflist->data; skip = adapter->skip; hsize = MIN (nbytes, GST_BUFFER_SIZE (cur) - skip); cur = gst_adapter_take_buffer (adapter, hsize); g_queue_push_tail (&queue, cur); nbytes -= hsize; } return queue.head; } /** * gst_adapter_available: * @adapter: a #GstAdapter * * Gets the maximum amount of bytes available, that is it returns the maximum * value that can be supplied to gst_adapter_peek() without that function * returning NULL. * * Returns: number of bytes available in @adapter */ guint gst_adapter_available (GstAdapter * adapter) { g_return_val_if_fail (GST_IS_ADAPTER (adapter), 0); return adapter->size; } /** * gst_adapter_available_fast: * @adapter: a #GstAdapter * * Gets the maximum number of bytes that are immediately available without * requiring any expensive operations (like copying the data into a * temporary buffer). * * Returns: number of bytes that are available in @adapter without expensive * operations */ guint gst_adapter_available_fast (GstAdapter * adapter) { GstBuffer *cur; guint size; GSList *g; g_return_val_if_fail (GST_IS_ADAPTER (adapter), 0); /* no data */ if (adapter->size == 0) return 0; /* some stuff we already assembled */ if (adapter->assembled_len) return adapter->assembled_len; /* take the first non-zero buffer */ g = adapter->buflist; while (TRUE) { cur = g->data; size = GST_BUFFER_SIZE (cur); if (size != 0) break; g = g_slist_next (g); } /* we can quickly get the (remaining) data of the first buffer */ return size - adapter->skip; } /** * gst_adapter_prev_timestamp: * @adapter: a #GstAdapter * @distance: (out) (allow-none): pointer to location for distance, or NULL * * Get the timestamp that was before the current byte in the adapter. When * @distance is given, the amount of bytes between the timestamp and the current * position is returned. * * The timestamp is reset to GST_CLOCK_TIME_NONE and the distance is set to 0 when * the adapter is first created or when it is cleared. This also means that before * the first byte with a timestamp is removed from the adapter, the timestamp * and distance returned are GST_CLOCK_TIME_NONE and 0 respectively. * * Returns: The previously seen timestamp. * * Since: 0.10.24 */ GstClockTime gst_adapter_prev_timestamp (GstAdapter * adapter, guint64 * distance) { g_return_val_if_fail (GST_IS_ADAPTER (adapter), GST_CLOCK_TIME_NONE); if (distance) *distance = adapter->priv->distance; return adapter->priv->timestamp; } /** * gst_adapter_masked_scan_uint32_peek: * @adapter: a #GstAdapter * @mask: mask to apply to data before matching against @pattern * @pattern: pattern to match (after mask is applied) * @offset: offset into the adapter data from which to start scanning, returns * the last scanned position. * @size: number of bytes to scan from offset * @value: pointer to uint32 to return matching data * * Scan for pattern @pattern with applied mask @mask in the adapter data, * starting from offset @offset. If a match is found, the value that matched * is returned through @value, otherwise @value is left untouched. * * The bytes in @pattern and @mask are interpreted left-to-right, regardless * of endianness. All four bytes of the pattern must be present in the * adapter for it to match, even if the first or last bytes are masked out. * * It is an error to call this function without making sure that there is * enough data (offset+size bytes) in the adapter. * * Returns: offset of the first match, or -1 if no match was found. * * Since: 0.10.30 */ guint gst_adapter_masked_scan_uint32_peek (GstAdapter * adapter, guint32 mask, guint32 pattern, guint offset, guint size, guint32 * value) { GSList *g; guint skip, bsize, i; guint32 state; guint8 *bdata; GstBuffer *buf; g_return_val_if_fail (size > 0, -1); g_return_val_if_fail (offset + size <= adapter->size, -1); g_return_val_if_fail (((~mask) & pattern) == 0, -1); /* we can't find the pattern with less than 4 bytes */ if (G_UNLIKELY (size < 4)) return -1; skip = offset + adapter->skip; /* first step, do skipping and position on the first buffer */ /* optimistically assume scanning continues sequentially */ if (adapter->priv->scan_entry && (adapter->priv->scan_offset <= skip)) { g = adapter->priv->scan_entry; skip -= adapter->priv->scan_offset; } else { g = adapter->buflist; adapter->priv->scan_offset = 0; adapter->priv->scan_entry = NULL; } buf = g->data; bsize = GST_BUFFER_SIZE (buf); while (G_UNLIKELY (skip >= bsize)) { skip -= bsize; g = g_slist_next (g); adapter->priv->scan_offset += bsize; adapter->priv->scan_entry = g; buf = g->data; bsize = GST_BUFFER_SIZE (buf); } /* get the data now */ bsize -= skip; bdata = GST_BUFFER_DATA (buf) + skip; skip = 0; /* set the state to something that does not match */ state = ~pattern; /* now find data */ do { bsize = MIN (bsize, size); for (i = 0; i < bsize; i++) { state = ((state << 8) | bdata[i]); if (G_UNLIKELY ((state & mask) == pattern)) { /* we have a match but we need to have skipped at * least 4 bytes to fill the state. */ if (G_LIKELY (skip + i >= 3)) { if (G_LIKELY (value)) *value = state; return offset + skip + i - 3; } } } size -= bsize; if (size == 0) break; /* nothing found yet, go to next buffer */ skip += bsize; g = g_slist_next (g); adapter->priv->scan_offset += GST_BUFFER_SIZE (buf); adapter->priv->scan_entry = g; buf = g->data; bsize = GST_BUFFER_SIZE (buf); bdata = GST_BUFFER_DATA (buf); } while (TRUE); /* nothing found */ return -1; } /** * gst_adapter_masked_scan_uint32: * @adapter: a #GstAdapter * @mask: mask to apply to data before matching against @pattern * @pattern: pattern to match (after mask is applied) * @offset: offset into the adapter data from which to start scanning, returns * the last scanned position. * @size: number of bytes to scan from offset * * Scan for pattern @pattern with applied mask @mask in the adapter data, * starting from offset @offset. * * The bytes in @pattern and @mask are interpreted left-to-right, regardless * of endianness. All four bytes of the pattern must be present in the * adapter for it to match, even if the first or last bytes are masked out. * * It is an error to call this function without making sure that there is * enough data (offset+size bytes) in the adapter. * * This function calls gst_adapter_masked_scan_uint32_peek() passing NULL * for value. * * Returns: offset of the first match, or -1 if no match was found. * * Example: * * // Assume the adapter contains 0x00 0x01 0x02 ... 0xfe 0xff * * gst_adapter_masked_scan_uint32 (adapter, 0xffffffff, 0x00010203, 0, 256); * // -> returns 0 * gst_adapter_masked_scan_uint32 (adapter, 0xffffffff, 0x00010203, 1, 255); * // -> returns -1 * gst_adapter_masked_scan_uint32 (adapter, 0xffffffff, 0x01020304, 1, 255); * // -> returns 1 * gst_adapter_masked_scan_uint32 (adapter, 0xffff, 0x0001, 0, 256); * // -> returns -1 * gst_adapter_masked_scan_uint32 (adapter, 0xffff, 0x0203, 0, 256); * // -> returns 0 * gst_adapter_masked_scan_uint32 (adapter, 0xffff0000, 0x02030000, 0, 256); * // -> returns 2 * gst_adapter_masked_scan_uint32 (adapter, 0xffff0000, 0x02030000, 0, 4); * // -> returns -1 * * * Since: 0.10.24 */ guint gst_adapter_masked_scan_uint32 (GstAdapter * adapter, guint32 mask, guint32 pattern, guint offset, guint size) { return gst_adapter_masked_scan_uint32_peek (adapter, mask, pattern, offset, size, NULL); }