mirror of
https://gitlab.freedesktop.org/gstreamer/gstreamer.git
synced 2024-12-18 22:36:33 +00:00
71f3a6f0f7
Since everything GstXML related has been deprecated, we can now skip the libxml includes from the public headers when GST_DISABLE_DEPRECATED is defined. See #463435.
2195 lines
58 KiB
C
2195 lines
58 KiB
C
/* GStreamer
|
|
* Copyright (C) <2003> David A. Schleef <ds@schleef.org>
|
|
*
|
|
* 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:gstcaps
|
|
* @short_description: Structure describing sets of media formats
|
|
* @see_also: #GstStructure
|
|
*
|
|
* Caps (capabilities) are lighweight refcounted objects describing media types.
|
|
* They are composed of an array of #GstStructure.
|
|
*
|
|
* Caps are exposed on #GstPadTemplate to describe all possible types a
|
|
* given pad can handle. They are also stored in the #GstRegistry along with
|
|
* a description of the #GstElement.
|
|
*
|
|
* Caps are exposed on the element pads using the gst_pad_get_caps() pad
|
|
* function. This function describes the possible types that the pad can
|
|
* handle or produce at runtime.
|
|
*
|
|
* Caps are also attached to buffers to describe to content of the data
|
|
* pointed to by the buffer with gst_buffer_set_caps(). Caps attached to
|
|
* a #GstBuffer allow for format negotiation upstream and downstream.
|
|
*
|
|
* A #GstCaps can be constructed with the following code fragment:
|
|
*
|
|
* <example>
|
|
* <title>Creating caps</title>
|
|
* <programlisting>
|
|
* GstCaps *caps;
|
|
* caps = gst_caps_new_simple ("video/x-raw-yuv",
|
|
* "format", GST_TYPE_FOURCC, GST_MAKE_FOURCC ('I', '4', '2', '0'),
|
|
* "framerate", GST_TYPE_FRACTION, 25, 1,
|
|
* "pixel-aspect-ratio", GST_TYPE_FRACTION, 1, 1,
|
|
* "width", G_TYPE_INT, 320,
|
|
* "height", G_TYPE_INT, 240,
|
|
* NULL);
|
|
* </programlisting>
|
|
* </example>
|
|
*
|
|
* A #GstCaps is fixed when it has no properties with ranges or lists. Use
|
|
* gst_caps_is_fixed() to test for fixed caps. Only fixed caps can be
|
|
* set on a #GstPad or #GstBuffer.
|
|
*
|
|
* Various methods exist to work with the media types such as subtracting
|
|
* or intersecting.
|
|
*
|
|
* Last reviewed on 2007-02-13 (0.10.10)
|
|
*/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include "config.h"
|
|
#endif
|
|
#include <string.h>
|
|
#include <signal.h>
|
|
|
|
#include "gst_private.h"
|
|
#include <gst/gst.h>
|
|
#include <gobject/gvaluecollector.h>
|
|
|
|
#ifdef GST_DISABLE_DEPRECATED
|
|
#if !defined(GST_DISABLE_LOADSAVE) && !defined(GST_REMOVE_DEPRECATED)
|
|
#include <libxml/parser.h>
|
|
xmlNodePtr gst_caps_save_thyself (const GstCaps * caps, xmlNodePtr parent);
|
|
GstCaps *gst_caps_load_thyself (xmlNodePtr parent);
|
|
#endif
|
|
#endif
|
|
|
|
#define DEBUG_REFCOUNT
|
|
|
|
#define CAPS_POISON(caps) G_STMT_START{ \
|
|
if (caps) { \
|
|
GstCaps *_newcaps = gst_caps_copy (caps); \
|
|
gst_caps_unref(caps); \
|
|
caps = _newcaps; \
|
|
} \
|
|
} G_STMT_END
|
|
#define STRUCTURE_POISON(structure) G_STMT_START{ \
|
|
if (structure) { \
|
|
GstStructure *_newstruct = gst_structure_copy (structure); \
|
|
gst_structure_free(structure); \
|
|
structure = _newstruct; \
|
|
} \
|
|
} G_STMT_END
|
|
#define IS_WRITABLE(caps) \
|
|
(g_atomic_int_get (&(caps)->refcount) == 1)
|
|
|
|
/* same as gst_caps_is_any () */
|
|
#define CAPS_IS_ANY(caps) \
|
|
((caps)->flags & GST_CAPS_FLAGS_ANY)
|
|
|
|
/* same as gst_caps_is_empty () */
|
|
#define CAPS_IS_EMPTY(caps) \
|
|
(!CAPS_IS_ANY(caps) && CAPS_IS_EMPTY_SIMPLE(caps))
|
|
|
|
#define CAPS_IS_EMPTY_SIMPLE(caps) \
|
|
(((caps)->structs == NULL) || ((caps)->structs->len == 0))
|
|
|
|
/* quick way to get a caps structure at an index without doing a type or array
|
|
* length check */
|
|
#define gst_caps_get_structure_unchecked(caps, index) \
|
|
((GstStructure *)g_ptr_array_index ((caps)->structs, (index)))
|
|
/* quick way to append a structure without checking the args */
|
|
#define gst_caps_append_structure_unchecked(caps, structure) G_STMT_START{\
|
|
GstStructure *__s=structure; \
|
|
gst_structure_set_parent_refcount (__s, &caps->refcount); \
|
|
g_ptr_array_add (caps->structs, __s); \
|
|
}G_STMT_END
|
|
|
|
/* lock to protect multiple invocations of static caps to caps conversion */
|
|
G_LOCK_DEFINE_STATIC (static_caps_lock);
|
|
|
|
static void gst_caps_transform_to_string (const GValue * src_value,
|
|
GValue * dest_value);
|
|
static gboolean gst_caps_from_string_inplace (GstCaps * caps,
|
|
const gchar * string);
|
|
static GstCaps *gst_caps_copy_conditional (GstCaps * src);
|
|
|
|
GType
|
|
gst_caps_get_type (void)
|
|
{
|
|
static GType gst_caps_type = 0;
|
|
|
|
if (G_UNLIKELY (gst_caps_type == 0)) {
|
|
gst_caps_type = g_boxed_type_register_static ("GstCaps",
|
|
(GBoxedCopyFunc) gst_caps_copy_conditional,
|
|
(GBoxedFreeFunc) gst_caps_unref);
|
|
|
|
g_value_register_transform_func (gst_caps_type,
|
|
G_TYPE_STRING, gst_caps_transform_to_string);
|
|
}
|
|
|
|
return gst_caps_type;
|
|
}
|
|
|
|
/* creation/deletion */
|
|
|
|
/**
|
|
* gst_caps_new_empty:
|
|
*
|
|
* Creates a new #GstCaps that is empty. That is, the returned
|
|
* #GstCaps contains no media formats.
|
|
* Caller is responsible for unreffing the returned caps.
|
|
*
|
|
* Returns: the new #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_new_empty (void)
|
|
{
|
|
GstCaps *caps = g_slice_new (GstCaps);
|
|
|
|
caps->type = GST_TYPE_CAPS;
|
|
caps->refcount = 1;
|
|
caps->flags = 0;
|
|
caps->structs = g_ptr_array_new ();
|
|
/* the 32 has been determined by logging caps sizes in _gst_caps_free
|
|
* but g_ptr_array uses 16 anyway if it expands once, so this does not help
|
|
* in practise
|
|
* caps->structs = g_ptr_array_sized_new (32);
|
|
*/
|
|
|
|
#ifdef DEBUG_REFCOUNT
|
|
GST_CAT_LOG (GST_CAT_CAPS, "created caps %p", caps);
|
|
#endif
|
|
|
|
return caps;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_new_any:
|
|
*
|
|
* Creates a new #GstCaps that indicates that it is compatible with
|
|
* any media format.
|
|
*
|
|
* Returns: the new #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_new_any (void)
|
|
{
|
|
GstCaps *caps = gst_caps_new_empty ();
|
|
|
|
caps->flags = GST_CAPS_FLAGS_ANY;
|
|
|
|
return caps;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_new_simple:
|
|
* @media_type: the media type of the structure
|
|
* @fieldname: first field to set
|
|
* @...: additional arguments
|
|
*
|
|
* Creates a new #GstCaps that contains one #GstStructure. The
|
|
* structure is defined by the arguments, which have the same format
|
|
* as gst_structure_new().
|
|
* Caller is responsible for unreffing the returned caps.
|
|
*
|
|
* Returns: the new #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_new_simple (const char *media_type, const char *fieldname, ...)
|
|
{
|
|
GstCaps *caps;
|
|
GstStructure *structure;
|
|
va_list var_args;
|
|
|
|
caps = gst_caps_new_empty ();
|
|
|
|
va_start (var_args, fieldname);
|
|
structure = gst_structure_new_valist (media_type, fieldname, var_args);
|
|
va_end (var_args);
|
|
|
|
gst_caps_append_structure_unchecked (caps, structure);
|
|
|
|
return caps;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_new_full:
|
|
* @struct1: the first structure to add
|
|
* @...: additional structures to add
|
|
*
|
|
* Creates a new #GstCaps and adds all the structures listed as
|
|
* arguments. The list must be NULL-terminated. The structures
|
|
* are not copied; the returned #GstCaps owns the structures.
|
|
*
|
|
* Returns: the new #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_new_full (GstStructure * struct1, ...)
|
|
{
|
|
GstCaps *caps;
|
|
va_list var_args;
|
|
|
|
va_start (var_args, struct1);
|
|
caps = gst_caps_new_full_valist (struct1, var_args);
|
|
va_end (var_args);
|
|
|
|
return caps;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_new_full_valist:
|
|
* @structure: the first structure to add
|
|
* @var_args: additional structures to add
|
|
*
|
|
* Creates a new #GstCaps and adds all the structures listed as
|
|
* arguments. The list must be NULL-terminated. The structures
|
|
* are not copied; the returned #GstCaps owns the structures.
|
|
*
|
|
* Returns: the new #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_new_full_valist (GstStructure * structure, va_list var_args)
|
|
{
|
|
GstCaps *caps;
|
|
|
|
caps = gst_caps_new_empty ();
|
|
|
|
while (structure) {
|
|
gst_caps_append_structure_unchecked (caps, structure);
|
|
structure = va_arg (var_args, GstStructure *);
|
|
}
|
|
|
|
return caps;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_copy:
|
|
* @caps: the #GstCaps to copy
|
|
*
|
|
* Creates a new #GstCaps as a copy of the old @caps. The new caps will have a
|
|
* refcount of 1, owned by the caller. The structures are copied as well.
|
|
*
|
|
* Note that this function is the semantic equivalent of a gst_caps_ref()
|
|
* followed by a gst_caps_make_writable(). If you only want to hold on to a
|
|
* reference to the data, you should use gst_caps_ref().
|
|
*
|
|
* When you are finished with the caps, call gst_caps_unref() on it.
|
|
*
|
|
* Returns: the new #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_copy (const GstCaps * caps)
|
|
{
|
|
GstCaps *newcaps;
|
|
GstStructure *structure;
|
|
guint i, n;
|
|
|
|
g_return_val_if_fail (GST_IS_CAPS (caps), NULL);
|
|
|
|
newcaps = gst_caps_new_empty ();
|
|
newcaps->flags = caps->flags;
|
|
n = caps->structs->len;
|
|
|
|
for (i = 0; i < n; i++) {
|
|
structure = gst_caps_get_structure_unchecked (caps, i);
|
|
gst_caps_append_structure_unchecked (newcaps,
|
|
gst_structure_copy (structure));
|
|
}
|
|
|
|
return newcaps;
|
|
}
|
|
|
|
static void
|
|
_gst_caps_free (GstCaps * caps)
|
|
{
|
|
GstStructure *structure;
|
|
guint i, len;
|
|
|
|
/* The refcount must be 0, but since we're only called by gst_caps_unref,
|
|
* don't bother testing. */
|
|
len = caps->structs->len;
|
|
/* This can be used to get statistics about caps sizes */
|
|
/*GST_CAT_INFO (GST_CAT_CAPS, "caps size: %d", len); */
|
|
for (i = 0; i < len; i++) {
|
|
structure = (GstStructure *) gst_caps_get_structure_unchecked (caps, i);
|
|
gst_structure_set_parent_refcount (structure, NULL);
|
|
gst_structure_free (structure);
|
|
}
|
|
g_ptr_array_free (caps->structs, TRUE);
|
|
#ifdef USE_POISONING
|
|
memset (caps, 0xff, sizeof (GstCaps));
|
|
#endif
|
|
|
|
#ifdef DEBUG_REFCOUNT
|
|
GST_CAT_LOG (GST_CAT_CAPS, "freeing caps %p", caps);
|
|
#endif
|
|
g_slice_free (GstCaps, caps);
|
|
}
|
|
|
|
/**
|
|
* gst_caps_make_writable:
|
|
* @caps: the #GstCaps to make writable
|
|
*
|
|
* Returns a writable copy of @caps.
|
|
*
|
|
* If there is only one reference count on @caps, the caller must be the owner,
|
|
* and so this function will return the caps object unchanged. If on the other
|
|
* hand there is more than one reference on the object, a new caps object will
|
|
* be returned. The caller's reference on @caps will be removed, and instead the
|
|
* caller will own a reference to the returned object.
|
|
*
|
|
* In short, this function unrefs the caps in the argument and refs the caps
|
|
* that it returns. Don't access the argument after calling this function. See
|
|
* also: gst_caps_ref().
|
|
*
|
|
* Returns: the same #GstCaps object.
|
|
*/
|
|
GstCaps *
|
|
gst_caps_make_writable (GstCaps * caps)
|
|
{
|
|
GstCaps *copy;
|
|
|
|
g_return_val_if_fail (caps != NULL, NULL);
|
|
|
|
/* we are the only instance reffing this caps */
|
|
if (IS_WRITABLE (caps))
|
|
return caps;
|
|
|
|
/* else copy */
|
|
GST_CAT_DEBUG (GST_CAT_PERFORMANCE, "copy caps");
|
|
copy = gst_caps_copy (caps);
|
|
gst_caps_unref (caps);
|
|
|
|
return copy;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_ref:
|
|
* @caps: the #GstCaps to reference
|
|
*
|
|
* Add a reference to a #GstCaps object.
|
|
*
|
|
* From this point on, until the caller calls gst_caps_unref() or
|
|
* gst_caps_make_writable(), it is guaranteed that the caps object will not
|
|
* change. This means its structures won't change, etc. To use a #GstCaps
|
|
* object, you must always have a refcount on it -- either the one made
|
|
* implicitly by e.g. gst_caps_new_simple(), or via taking one explicitly with
|
|
* this function.
|
|
*
|
|
* Returns: the same #GstCaps object.
|
|
*/
|
|
GstCaps *
|
|
gst_caps_ref (GstCaps * caps)
|
|
{
|
|
g_return_val_if_fail (caps != NULL, NULL);
|
|
|
|
#ifdef DEBUG_REFCOUNT
|
|
GST_CAT_TRACE (GST_CAT_REFCOUNTING, "%p %d->%d", caps,
|
|
GST_CAPS_REFCOUNT_VALUE (caps), GST_CAPS_REFCOUNT_VALUE (caps) + 1);
|
|
#endif
|
|
g_return_val_if_fail (GST_CAPS_REFCOUNT_VALUE (caps) > 0, NULL);
|
|
|
|
g_atomic_int_inc (&caps->refcount);
|
|
|
|
return caps;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_unref:
|
|
* @caps: the #GstCaps to unref
|
|
*
|
|
* Unref a #GstCaps and and free all its structures and the
|
|
* structures' values when the refcount reaches 0.
|
|
*/
|
|
void
|
|
gst_caps_unref (GstCaps * caps)
|
|
{
|
|
g_return_if_fail (caps != NULL);
|
|
|
|
#ifdef DEBUG_REFCOUNT
|
|
GST_CAT_TRACE (GST_CAT_REFCOUNTING, "%p %d->%d", caps,
|
|
GST_CAPS_REFCOUNT_VALUE (caps), GST_CAPS_REFCOUNT_VALUE (caps) - 1);
|
|
#endif
|
|
|
|
g_return_if_fail (GST_CAPS_REFCOUNT_VALUE (caps) > 0);
|
|
|
|
/* if we ended up with the refcount at zero, free the caps */
|
|
if (G_UNLIKELY (g_atomic_int_dec_and_test (&caps->refcount)))
|
|
_gst_caps_free (caps);
|
|
}
|
|
|
|
GType
|
|
gst_static_caps_get_type (void)
|
|
{
|
|
static GType staticcaps_type = 0;
|
|
|
|
if (G_UNLIKELY (staticcaps_type == 0)) {
|
|
staticcaps_type = g_pointer_type_register_static ("GstStaticCaps");
|
|
}
|
|
return staticcaps_type;
|
|
}
|
|
|
|
|
|
/**
|
|
* gst_static_caps_get:
|
|
* @static_caps: the #GstStaticCaps to convert
|
|
*
|
|
* Converts a #GstStaticCaps to a #GstCaps.
|
|
*
|
|
* Returns: A pointer to the #GstCaps. Unref after usage. Since the
|
|
* core holds an additional ref to the returned caps,
|
|
* use gst_caps_make_writable() on the returned caps to modify it.
|
|
*/
|
|
GstCaps *
|
|
gst_static_caps_get (GstStaticCaps * static_caps)
|
|
{
|
|
GstCaps *caps;
|
|
|
|
g_return_val_if_fail (static_caps != NULL, NULL);
|
|
|
|
caps = (GstCaps *) static_caps;
|
|
|
|
/* refcount is 0 when we need to convert */
|
|
if (G_UNLIKELY (g_atomic_int_get (&caps->refcount) == 0)) {
|
|
const char *string;
|
|
GstCaps temp;
|
|
|
|
G_LOCK (static_caps_lock);
|
|
/* check if other thread already updated */
|
|
if (G_UNLIKELY (g_atomic_int_get (&caps->refcount) > 0))
|
|
goto done;
|
|
|
|
string = static_caps->string;
|
|
|
|
if (G_UNLIKELY (string == NULL))
|
|
goto no_string;
|
|
|
|
GST_CAT_LOG (GST_CAT_CAPS, "creating %p", static_caps);
|
|
|
|
/* we construct the caps on the stack, then copy over the struct into our
|
|
* real caps, refcount last. We do this because we must leave the refcount
|
|
* of the result caps to 0 so that other threads don't run away with the
|
|
* caps while we are constructing it. */
|
|
temp.type = GST_TYPE_CAPS;
|
|
temp.flags = 0;
|
|
temp.structs = g_ptr_array_new ();
|
|
|
|
/* initialize the caps to a refcount of 1 so the caps can be writable for
|
|
* the next statement */
|
|
temp.refcount = 1;
|
|
|
|
/* convert to string */
|
|
if (G_UNLIKELY (!gst_caps_from_string_inplace (&temp, string)))
|
|
g_critical ("Could not convert static caps \"%s\"", string);
|
|
|
|
/* now copy stuff over to the real caps. */
|
|
caps->type = temp.type;
|
|
caps->flags = temp.flags;
|
|
caps->structs = temp.structs;
|
|
/* and bump the refcount so other threads can now read */
|
|
g_atomic_int_set (&caps->refcount, 1);
|
|
|
|
GST_CAT_LOG (GST_CAT_CAPS, "created %p", static_caps);
|
|
done:
|
|
G_UNLOCK (static_caps_lock);
|
|
}
|
|
/* ref the caps, makes it not writable */
|
|
gst_caps_ref (caps);
|
|
|
|
return caps;
|
|
|
|
/* ERRORS */
|
|
no_string:
|
|
{
|
|
G_UNLOCK (static_caps_lock);
|
|
g_warning ("static caps %p string is NULL", static_caps);
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
/* manipulation */
|
|
|
|
static GstStructure *
|
|
gst_caps_remove_and_get_structure (GstCaps * caps, guint idx)
|
|
{
|
|
/* don't use index_fast, gst_caps_do_simplify relies on the order */
|
|
GstStructure *s = g_ptr_array_remove_index (caps->structs, idx);
|
|
|
|
gst_structure_set_parent_refcount (s, NULL);
|
|
return s;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_steal_structure:
|
|
* @caps: the #GstCaps to retrieve from
|
|
* @idx: Index of the structure to retrieve
|
|
*
|
|
* Retrieves the stucture with the given index from the list of structures
|
|
* contained in @caps. The caller becomes the owner of the returned structure.
|
|
*
|
|
* Returns: a pointer to the #GstStructure corresponding to @index.
|
|
*
|
|
* Since: 0.10.30
|
|
*/
|
|
GstStructure *
|
|
gst_caps_steal_structure (GstCaps * caps, guint idx)
|
|
{
|
|
g_return_val_if_fail (caps != NULL, NULL);
|
|
g_return_val_if_fail (IS_WRITABLE (caps), NULL);
|
|
|
|
if (G_UNLIKELY (idx >= caps->structs->len))
|
|
return NULL;
|
|
|
|
return gst_caps_remove_and_get_structure (caps, idx);
|
|
}
|
|
|
|
static gboolean
|
|
gst_structure_is_equal_foreach (GQuark field_id, const GValue * val2,
|
|
gpointer data)
|
|
{
|
|
GstStructure *struct1 = (GstStructure *) data;
|
|
const GValue *val1 = gst_structure_id_get_value (struct1, field_id);
|
|
|
|
if (G_UNLIKELY (val1 == NULL))
|
|
return FALSE;
|
|
if (gst_value_compare (val1, val2) == GST_VALUE_EQUAL) {
|
|
return TRUE;
|
|
}
|
|
|
|
return FALSE;
|
|
}
|
|
|
|
static gboolean
|
|
gst_caps_structure_is_subset_field (GQuark field_id, const GValue * value,
|
|
gpointer user_data)
|
|
{
|
|
GstStructure *subtract_from = user_data;
|
|
GValue subtraction = { 0, };
|
|
const GValue *other;
|
|
|
|
if (!(other = gst_structure_id_get_value (subtract_from, field_id)))
|
|
/* field is missing in one set */
|
|
return FALSE;
|
|
|
|
/* equal values are subset */
|
|
if (gst_value_compare (other, value) == GST_VALUE_EQUAL)
|
|
return TRUE;
|
|
|
|
/*
|
|
* 1 - [1,2] = empty
|
|
* -> !subset
|
|
*
|
|
* [1,2] - 1 = 2
|
|
* -> 1 - [1,2] = empty
|
|
* -> subset
|
|
*
|
|
* [1,3] - [1,2] = 3
|
|
* -> [1,2] - [1,3] = empty
|
|
* -> subset
|
|
*
|
|
* {1,2} - {1,3} = 2
|
|
* -> {1,3} - {1,2} = 3
|
|
* -> !subset
|
|
*
|
|
* First caps subtraction needs to return a non-empty set, second
|
|
* subtractions needs to give en empty set.
|
|
*/
|
|
if (gst_value_subtract (&subtraction, other, value)) {
|
|
g_value_unset (&subtraction);
|
|
/* !empty result, swapping must be empty */
|
|
if (!gst_value_subtract (&subtraction, value, other))
|
|
return TRUE;
|
|
|
|
g_value_unset (&subtraction);
|
|
}
|
|
return FALSE;
|
|
}
|
|
|
|
static gboolean
|
|
gst_caps_structure_is_subset (const GstStructure * minuend,
|
|
const GstStructure * subtrahend)
|
|
{
|
|
if ((minuend->name != subtrahend->name) ||
|
|
(gst_structure_n_fields (minuend) !=
|
|
gst_structure_n_fields (subtrahend))) {
|
|
return FALSE;
|
|
}
|
|
|
|
return gst_structure_foreach ((GstStructure *) subtrahend,
|
|
gst_caps_structure_is_subset_field, (gpointer) minuend);
|
|
}
|
|
|
|
/**
|
|
* gst_caps_append:
|
|
* @caps1: the #GstCaps that will be appended to
|
|
* @caps2: the #GstCaps to append
|
|
*
|
|
* Appends the structures contained in @caps2 to @caps1. The structures in
|
|
* @caps2 are not copied -- they are transferred to @caps1, and then @caps2 is
|
|
* freed. If either caps is ANY, the resulting caps will be ANY.
|
|
*/
|
|
void
|
|
gst_caps_append (GstCaps * caps1, GstCaps * caps2)
|
|
{
|
|
GstStructure *structure;
|
|
int i;
|
|
|
|
g_return_if_fail (GST_IS_CAPS (caps1));
|
|
g_return_if_fail (GST_IS_CAPS (caps2));
|
|
g_return_if_fail (IS_WRITABLE (caps1));
|
|
g_return_if_fail (IS_WRITABLE (caps2));
|
|
|
|
#ifdef USE_POISONING
|
|
CAPS_POISON (caps2);
|
|
#endif
|
|
if (G_UNLIKELY (CAPS_IS_ANY (caps1) || CAPS_IS_ANY (caps2))) {
|
|
/* FIXME: this leaks */
|
|
caps1->flags |= GST_CAPS_FLAGS_ANY;
|
|
for (i = caps2->structs->len - 1; i >= 0; i--) {
|
|
structure = gst_caps_remove_and_get_structure (caps2, i);
|
|
gst_structure_free (structure);
|
|
}
|
|
} else {
|
|
for (i = caps2->structs->len; i; i--) {
|
|
structure = gst_caps_remove_and_get_structure (caps2, 0);
|
|
gst_caps_append_structure_unchecked (caps1, structure);
|
|
}
|
|
}
|
|
gst_caps_unref (caps2); /* guaranteed to free it */
|
|
}
|
|
|
|
/**
|
|
* gst_caps_merge:
|
|
* @caps1: the #GstCaps that will take the new entries
|
|
* @caps2: the #GstCaps to merge in
|
|
*
|
|
* Appends the structures contained in @caps2 to @caps1 if they are not yet
|
|
* expressed by @caps1. The structures in @caps2 are not copied -- they are
|
|
* transferred to @caps1, and then @caps2 is freed.
|
|
* If either caps is ANY, the resulting caps will be ANY.
|
|
*
|
|
* Since: 0.10.10
|
|
*/
|
|
void
|
|
gst_caps_merge (GstCaps * caps1, GstCaps * caps2)
|
|
{
|
|
GstStructure *structure;
|
|
int i;
|
|
|
|
g_return_if_fail (GST_IS_CAPS (caps1));
|
|
g_return_if_fail (GST_IS_CAPS (caps2));
|
|
g_return_if_fail (IS_WRITABLE (caps1));
|
|
g_return_if_fail (IS_WRITABLE (caps2));
|
|
|
|
#ifdef USE_POISONING
|
|
CAPS_POISON (caps2);
|
|
#endif
|
|
if (G_UNLIKELY (CAPS_IS_ANY (caps1))) {
|
|
for (i = caps2->structs->len - 1; i >= 0; i--) {
|
|
structure = gst_caps_remove_and_get_structure (caps2, i);
|
|
gst_structure_free (structure);
|
|
}
|
|
} else if (G_UNLIKELY (CAPS_IS_ANY (caps2))) {
|
|
caps1->flags |= GST_CAPS_FLAGS_ANY;
|
|
for (i = caps1->structs->len - 1; i >= 0; i--) {
|
|
structure = gst_caps_remove_and_get_structure (caps1, i);
|
|
gst_structure_free (structure);
|
|
}
|
|
} else {
|
|
for (i = caps2->structs->len; i; i--) {
|
|
structure = gst_caps_remove_and_get_structure (caps2, 0);
|
|
gst_caps_merge_structure (caps1, structure);
|
|
}
|
|
/* this is too naive
|
|
GstCaps *com = gst_caps_intersect (caps1, caps2);
|
|
GstCaps *add = gst_caps_subtract (caps2, com);
|
|
|
|
GST_DEBUG ("common : %d", gst_caps_get_size (com));
|
|
GST_DEBUG ("adding : %d", gst_caps_get_size (add));
|
|
gst_caps_append (caps1, add);
|
|
gst_caps_unref (com);
|
|
*/
|
|
}
|
|
gst_caps_unref (caps2); /* guaranteed to free it */
|
|
}
|
|
|
|
/**
|
|
* gst_caps_append_structure:
|
|
* @caps: the #GstCaps that will be appended to
|
|
* @structure: the #GstStructure to append
|
|
*
|
|
* Appends @structure to @caps. The structure is not copied; @caps
|
|
* becomes the owner of @structure.
|
|
*/
|
|
void
|
|
gst_caps_append_structure (GstCaps * caps, GstStructure * structure)
|
|
{
|
|
g_return_if_fail (GST_IS_CAPS (caps));
|
|
g_return_if_fail (IS_WRITABLE (caps));
|
|
|
|
if (G_LIKELY (structure)) {
|
|
g_return_if_fail (structure->parent_refcount == NULL);
|
|
#if 0
|
|
#ifdef USE_POISONING
|
|
STRUCTURE_POISON (structure);
|
|
#endif
|
|
#endif
|
|
gst_caps_append_structure_unchecked (caps, structure);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* gst_caps_remove_structure:
|
|
* @caps: the #GstCaps to remove from
|
|
* @idx: Index of the structure to remove
|
|
*
|
|
* removes the stucture with the given index from the list of structures
|
|
* contained in @caps.
|
|
*/
|
|
void
|
|
gst_caps_remove_structure (GstCaps * caps, guint idx)
|
|
{
|
|
GstStructure *structure;
|
|
|
|
g_return_if_fail (caps != NULL);
|
|
g_return_if_fail (idx <= gst_caps_get_size (caps));
|
|
g_return_if_fail (IS_WRITABLE (caps));
|
|
|
|
structure = gst_caps_remove_and_get_structure (caps, idx);
|
|
gst_structure_free (structure);
|
|
}
|
|
|
|
/**
|
|
* gst_caps_merge_structure:
|
|
* @caps: the #GstCaps that will the the new structure
|
|
* @structure: the #GstStructure to merge
|
|
*
|
|
* Appends @structure to @caps if its not already expressed by @caps. The
|
|
* structure is not copied; @caps becomes the owner of @structure.
|
|
*/
|
|
void
|
|
gst_caps_merge_structure (GstCaps * caps, GstStructure * structure)
|
|
{
|
|
g_return_if_fail (GST_IS_CAPS (caps));
|
|
g_return_if_fail (IS_WRITABLE (caps));
|
|
|
|
if (G_LIKELY (structure)) {
|
|
GstStructure *structure1;
|
|
int i;
|
|
gboolean unique = TRUE;
|
|
|
|
g_return_if_fail (structure->parent_refcount == NULL);
|
|
#if 0
|
|
#ifdef USE_POISONING
|
|
STRUCTURE_POISON (structure);
|
|
#endif
|
|
#endif
|
|
/* check each structure */
|
|
for (i = caps->structs->len - 1; i >= 0; i--) {
|
|
structure1 = gst_caps_get_structure_unchecked (caps, i);
|
|
/* if structure is a subset of structure1, then skip it */
|
|
if (gst_caps_structure_is_subset (structure1, structure)) {
|
|
unique = FALSE;
|
|
break;
|
|
}
|
|
}
|
|
if (unique) {
|
|
gst_caps_append_structure_unchecked (caps, structure);
|
|
} else {
|
|
gst_structure_free (structure);
|
|
}
|
|
}
|
|
}
|
|
|
|
/**
|
|
* gst_caps_get_size:
|
|
* @caps: a #GstCaps
|
|
*
|
|
* Gets the number of structures contained in @caps.
|
|
*
|
|
* Returns: the number of structures that @caps contains
|
|
*/
|
|
guint
|
|
gst_caps_get_size (const GstCaps * caps)
|
|
{
|
|
g_return_val_if_fail (GST_IS_CAPS (caps), 0);
|
|
|
|
return caps->structs->len;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_get_structure:
|
|
* @caps: a #GstCaps
|
|
* @index: the index of the structure
|
|
*
|
|
* Finds the structure in @caps that has the index @index, and
|
|
* returns it.
|
|
*
|
|
* WARNING: This function takes a const GstCaps *, but returns a
|
|
* non-const GstStructure *. This is for programming convenience --
|
|
* the caller should be aware that structures inside a constant
|
|
* #GstCaps should not be modified. However, if you know the caps
|
|
* are writable, either because you have just copied them or made
|
|
* them writable with gst_caps_make_writable(), you may modify the
|
|
* structure returned in the usual way, e.g. with functions like
|
|
* gst_structure_set().
|
|
*
|
|
* You do not need to free or unref the structure returned, it
|
|
* belongs to the #GstCaps.
|
|
*
|
|
* Returns: a pointer to the #GstStructure corresponding to @index
|
|
*/
|
|
GstStructure *
|
|
gst_caps_get_structure (const GstCaps * caps, guint index)
|
|
{
|
|
g_return_val_if_fail (GST_IS_CAPS (caps), NULL);
|
|
g_return_val_if_fail (index < caps->structs->len, NULL);
|
|
|
|
return gst_caps_get_structure_unchecked (caps, index);
|
|
}
|
|
|
|
/**
|
|
* gst_caps_copy_nth:
|
|
* @caps: the #GstCaps to copy
|
|
* @nth: the nth structure to copy
|
|
*
|
|
* Creates a new #GstCaps and appends a copy of the nth structure
|
|
* contained in @caps.
|
|
*
|
|
* Returns: the new #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_copy_nth (const GstCaps * caps, guint nth)
|
|
{
|
|
GstCaps *newcaps;
|
|
GstStructure *structure;
|
|
|
|
g_return_val_if_fail (GST_IS_CAPS (caps), NULL);
|
|
|
|
newcaps = gst_caps_new_empty ();
|
|
newcaps->flags = caps->flags;
|
|
|
|
if (G_LIKELY (caps->structs->len > nth)) {
|
|
structure = gst_caps_get_structure_unchecked (caps, nth);
|
|
gst_caps_append_structure_unchecked (newcaps,
|
|
gst_structure_copy (structure));
|
|
}
|
|
|
|
return newcaps;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_truncate:
|
|
* @caps: the #GstCaps to truncate
|
|
*
|
|
* Destructively discard all but the first structure from @caps. Useful when
|
|
* fixating. @caps must be writable.
|
|
*/
|
|
void
|
|
gst_caps_truncate (GstCaps * caps)
|
|
{
|
|
gint i;
|
|
|
|
g_return_if_fail (GST_IS_CAPS (caps));
|
|
g_return_if_fail (IS_WRITABLE (caps));
|
|
|
|
i = caps->structs->len - 1;
|
|
|
|
while (i > 0)
|
|
gst_caps_remove_structure (caps, i--);
|
|
}
|
|
|
|
/**
|
|
* gst_caps_set_value:
|
|
* @caps: a writable caps
|
|
* @field: name of the field to set
|
|
* @value: value to set the field to
|
|
*
|
|
* Sets the given @field on all structures of @caps to the given @value.
|
|
* This is a convenience function for calling gst_structure_set_value() on
|
|
* all structures of @caps.
|
|
*
|
|
* Since: 0.10.26
|
|
**/
|
|
void
|
|
gst_caps_set_value (GstCaps * caps, const char *field, const GValue * value)
|
|
{
|
|
guint i, len;
|
|
|
|
g_return_if_fail (GST_IS_CAPS (caps));
|
|
g_return_if_fail (IS_WRITABLE (caps));
|
|
g_return_if_fail (field != NULL);
|
|
g_return_if_fail (G_IS_VALUE (value));
|
|
|
|
len = caps->structs->len;
|
|
for (i = 0; i < len; i++) {
|
|
GstStructure *structure = gst_caps_get_structure_unchecked (caps, i);
|
|
gst_structure_set_value (structure, field, value);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* gst_caps_set_simple_valist:
|
|
* @caps: the #GstCaps to set
|
|
* @field: first field to set
|
|
* @varargs: additional parameters
|
|
*
|
|
* Sets fields in a #GstCaps. The arguments must be passed in the same
|
|
* manner as gst_structure_set(), and be NULL-terminated.
|
|
* <note>Prior to GStreamer version 0.10.26, this function failed when
|
|
* @caps was not simple. If your code needs to work with those versions
|
|
* of GStreamer, you may only call this function when GST_CAPS_IS_SIMPLE()
|
|
* is %TRUE for @caps.</note>
|
|
*/
|
|
void
|
|
gst_caps_set_simple_valist (GstCaps * caps, const char *field, va_list varargs)
|
|
{
|
|
GValue value = { 0, };
|
|
|
|
g_return_if_fail (GST_IS_CAPS (caps));
|
|
g_return_if_fail (IS_WRITABLE (caps));
|
|
|
|
while (field) {
|
|
GType type;
|
|
char *err;
|
|
|
|
type = va_arg (varargs, GType);
|
|
|
|
if (G_UNLIKELY (type == G_TYPE_DATE)) {
|
|
g_warning ("Don't use G_TYPE_DATE, use GST_TYPE_DATE instead\n");
|
|
type = GST_TYPE_DATE;
|
|
}
|
|
#if GLIB_CHECK_VERSION(2,23,3)
|
|
G_VALUE_COLLECT_INIT (&value, type, varargs, 0, &err);
|
|
#else
|
|
g_value_init (&value, type);
|
|
G_VALUE_COLLECT (&value, varargs, 0, &err);
|
|
#endif
|
|
if (G_UNLIKELY (err)) {
|
|
g_critical ("%s", err);
|
|
return;
|
|
}
|
|
|
|
gst_caps_set_value (caps, field, &value);
|
|
|
|
g_value_unset (&value);
|
|
|
|
field = va_arg (varargs, const gchar *);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* gst_caps_set_simple:
|
|
* @caps: the #GstCaps to set
|
|
* @field: first field to set
|
|
* @...: additional parameters
|
|
*
|
|
* Sets fields in a #GstCaps. The arguments must be passed in the same
|
|
* manner as gst_structure_set(), and be NULL-terminated.
|
|
* <note>Prior to GStreamer version 0.10.26, this function failed when
|
|
* @caps was not simple. If your code needs to work with those versions
|
|
* of GStreamer, you may only call this function when GST_CAPS_IS_SIMPLE()
|
|
* is %TRUE for @caps.</note>
|
|
*/
|
|
void
|
|
gst_caps_set_simple (GstCaps * caps, const char *field, ...)
|
|
{
|
|
va_list var_args;
|
|
|
|
g_return_if_fail (GST_IS_CAPS (caps));
|
|
g_return_if_fail (IS_WRITABLE (caps));
|
|
|
|
va_start (var_args, field);
|
|
gst_caps_set_simple_valist (caps, field, var_args);
|
|
va_end (var_args);
|
|
}
|
|
|
|
/* tests */
|
|
|
|
/**
|
|
* gst_caps_is_any:
|
|
* @caps: the #GstCaps to test
|
|
*
|
|
* Determines if @caps represents any media format.
|
|
*
|
|
* Returns: TRUE if @caps represents any format.
|
|
*/
|
|
gboolean
|
|
gst_caps_is_any (const GstCaps * caps)
|
|
{
|
|
g_return_val_if_fail (GST_IS_CAPS (caps), FALSE);
|
|
|
|
return (CAPS_IS_ANY (caps));
|
|
}
|
|
|
|
/**
|
|
* gst_caps_is_empty:
|
|
* @caps: the #GstCaps to test
|
|
*
|
|
* Determines if @caps represents no media formats.
|
|
*
|
|
* Returns: TRUE if @caps represents no formats.
|
|
*/
|
|
gboolean
|
|
gst_caps_is_empty (const GstCaps * caps)
|
|
{
|
|
g_return_val_if_fail (GST_IS_CAPS (caps), FALSE);
|
|
|
|
if (CAPS_IS_ANY (caps))
|
|
return FALSE;
|
|
|
|
return CAPS_IS_EMPTY_SIMPLE (caps);
|
|
}
|
|
|
|
static gboolean
|
|
gst_caps_is_fixed_foreach (GQuark field_id, const GValue * value,
|
|
gpointer unused)
|
|
{
|
|
return gst_value_is_fixed (value);
|
|
}
|
|
|
|
/**
|
|
* gst_caps_is_fixed:
|
|
* @caps: the #GstCaps to test
|
|
*
|
|
* Fixed #GstCaps describe exactly one format, that is, they have exactly
|
|
* one structure, and each field in the structure describes a fixed type.
|
|
* Examples of non-fixed types are GST_TYPE_INT_RANGE and GST_TYPE_LIST.
|
|
*
|
|
* Returns: TRUE if @caps is fixed
|
|
*/
|
|
gboolean
|
|
gst_caps_is_fixed (const GstCaps * caps)
|
|
{
|
|
GstStructure *structure;
|
|
|
|
g_return_val_if_fail (GST_IS_CAPS (caps), FALSE);
|
|
|
|
if (caps->structs->len != 1)
|
|
return FALSE;
|
|
|
|
structure = gst_caps_get_structure_unchecked (caps, 0);
|
|
|
|
return gst_structure_foreach (structure, gst_caps_is_fixed_foreach, NULL);
|
|
}
|
|
|
|
/**
|
|
* gst_caps_is_equal_fixed:
|
|
* @caps1: the #GstCaps to test
|
|
* @caps2: the #GstCaps to test
|
|
*
|
|
* Tests if two #GstCaps are equal. This function only works on fixed
|
|
* #GstCaps.
|
|
*
|
|
* Returns: TRUE if the arguments represent the same format
|
|
*/
|
|
gboolean
|
|
gst_caps_is_equal_fixed (const GstCaps * caps1, const GstCaps * caps2)
|
|
{
|
|
GstStructure *struct1, *struct2;
|
|
|
|
g_return_val_if_fail (gst_caps_is_fixed (caps1), FALSE);
|
|
g_return_val_if_fail (gst_caps_is_fixed (caps2), FALSE);
|
|
|
|
struct1 = gst_caps_get_structure_unchecked (caps1, 0);
|
|
struct2 = gst_caps_get_structure_unchecked (caps2, 0);
|
|
|
|
if (struct1->name != struct2->name) {
|
|
return FALSE;
|
|
}
|
|
if (struct1->fields->len != struct2->fields->len) {
|
|
return FALSE;
|
|
}
|
|
|
|
return gst_structure_foreach (struct1, gst_structure_is_equal_foreach,
|
|
struct2);
|
|
}
|
|
|
|
/**
|
|
* gst_caps_is_always_compatible:
|
|
* @caps1: the #GstCaps to test
|
|
* @caps2: the #GstCaps to test
|
|
*
|
|
* A given #GstCaps structure is always compatible with another if
|
|
* every media format that is in the first is also contained in the
|
|
* second. That is, @caps1 is a subset of @caps2.
|
|
*
|
|
* Returns: TRUE if @caps1 is a subset of @caps2.
|
|
*/
|
|
gboolean
|
|
gst_caps_is_always_compatible (const GstCaps * caps1, const GstCaps * caps2)
|
|
{
|
|
g_return_val_if_fail (GST_IS_CAPS (caps1), FALSE);
|
|
g_return_val_if_fail (GST_IS_CAPS (caps2), FALSE);
|
|
|
|
return gst_caps_is_subset (caps1, caps2);
|
|
}
|
|
|
|
/**
|
|
* gst_caps_is_subset:
|
|
* @subset: a #GstCaps
|
|
* @superset: a potentially greater #GstCaps
|
|
*
|
|
* Checks if all caps represented by @subset are also represented by @superset.
|
|
* <note>This function does not work reliably if optional properties for caps
|
|
* are included on one caps and omitted on the other.</note>
|
|
*
|
|
* Returns: %TRUE if @subset is a subset of @superset
|
|
*/
|
|
gboolean
|
|
gst_caps_is_subset (const GstCaps * subset, const GstCaps * superset)
|
|
{
|
|
GstCaps *caps;
|
|
gboolean ret;
|
|
|
|
g_return_val_if_fail (subset != NULL, FALSE);
|
|
g_return_val_if_fail (superset != NULL, FALSE);
|
|
|
|
if (CAPS_IS_EMPTY (subset) || CAPS_IS_ANY (superset))
|
|
return TRUE;
|
|
if (CAPS_IS_ANY (subset) || CAPS_IS_EMPTY (superset))
|
|
return FALSE;
|
|
|
|
caps = gst_caps_subtract (subset, superset);
|
|
ret = CAPS_IS_EMPTY_SIMPLE (caps);
|
|
gst_caps_unref (caps);
|
|
return ret;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_is_equal:
|
|
* @caps1: a #GstCaps
|
|
* @caps2: another #GstCaps
|
|
*
|
|
* Checks if the given caps represent the same set of caps.
|
|
* <note>This function does not work reliably if optional properties for caps
|
|
* are included on one caps and omitted on the other.</note>
|
|
*
|
|
* This function deals correctly with passing NULL for any of the caps.
|
|
*
|
|
* Returns: TRUE if both caps are equal.
|
|
*/
|
|
gboolean
|
|
gst_caps_is_equal (const GstCaps * caps1, const GstCaps * caps2)
|
|
{
|
|
/* FIXME 0.11: NULL pointers are no valid Caps but indicate an error
|
|
* So there should be an assertion that caps1 and caps2 != NULL */
|
|
|
|
/* NULL <-> NULL is allowed here */
|
|
if (G_UNLIKELY (caps1 == caps2))
|
|
return TRUE;
|
|
|
|
/* one of them NULL => they are different (can't be both NULL because
|
|
* we checked that above) */
|
|
if (G_UNLIKELY (caps1 == NULL || caps2 == NULL))
|
|
return FALSE;
|
|
|
|
if (G_UNLIKELY (gst_caps_is_fixed (caps1) && gst_caps_is_fixed (caps2)))
|
|
return gst_caps_is_equal_fixed (caps1, caps2);
|
|
|
|
return gst_caps_is_subset (caps1, caps2) && gst_caps_is_subset (caps2, caps1);
|
|
}
|
|
|
|
/* intersect operation */
|
|
|
|
typedef struct
|
|
{
|
|
GstStructure *dest;
|
|
const GstStructure *intersect;
|
|
}
|
|
IntersectData;
|
|
|
|
static gboolean
|
|
gst_caps_structure_intersect_field1 (GQuark id, const GValue * val1,
|
|
gpointer data)
|
|
{
|
|
IntersectData *idata = (IntersectData *) data;
|
|
const GValue *val2 = gst_structure_id_get_value (idata->intersect, id);
|
|
|
|
if (G_UNLIKELY (val2 == NULL)) {
|
|
gst_structure_id_set_value (idata->dest, id, val1);
|
|
} else {
|
|
GValue dest_value = { 0 };
|
|
if (gst_value_intersect (&dest_value, val1, val2)) {
|
|
gst_structure_id_set_value (idata->dest, id, &dest_value);
|
|
g_value_unset (&dest_value);
|
|
} else {
|
|
return FALSE;
|
|
}
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
static gboolean
|
|
gst_caps_structure_intersect_field2 (GQuark id, const GValue * val1,
|
|
gpointer data)
|
|
{
|
|
IntersectData *idata = (IntersectData *) data;
|
|
const GValue *val2 = gst_structure_id_get_value (idata->intersect, id);
|
|
|
|
if (G_UNLIKELY (val2 == NULL)) {
|
|
gst_structure_id_set_value (idata->dest, id, val1);
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
static GstStructure *
|
|
gst_caps_structure_intersect (const GstStructure * struct1,
|
|
const GstStructure * struct2)
|
|
{
|
|
IntersectData data;
|
|
|
|
g_assert (struct1 != NULL);
|
|
g_assert (struct2 != NULL);
|
|
|
|
if (G_UNLIKELY (struct1->name != struct2->name))
|
|
return NULL;
|
|
|
|
/* copy fields from struct1 which we have not in struct2 to target
|
|
* intersect if we have the field in both */
|
|
data.dest = gst_structure_id_empty_new (struct1->name);
|
|
data.intersect = struct2;
|
|
if (G_UNLIKELY (!gst_structure_foreach ((GstStructure *) struct1,
|
|
gst_caps_structure_intersect_field1, &data)))
|
|
goto error;
|
|
|
|
/* copy fields from struct2 which we have not in struct1 to target */
|
|
data.intersect = struct1;
|
|
if (G_UNLIKELY (!gst_structure_foreach ((GstStructure *) struct2,
|
|
gst_caps_structure_intersect_field2, &data)))
|
|
goto error;
|
|
|
|
return data.dest;
|
|
|
|
error:
|
|
gst_structure_free (data.dest);
|
|
return NULL;
|
|
}
|
|
|
|
static gboolean
|
|
gst_caps_structure_can_intersect_field (GQuark id, const GValue * val1,
|
|
gpointer data)
|
|
{
|
|
GstStructure *other = (GstStructure *) data;
|
|
const GValue *val2 = gst_structure_id_get_value (other, id);
|
|
|
|
if (G_LIKELY (val2)) {
|
|
if (!gst_value_can_intersect (val1, val2)) {
|
|
return FALSE;
|
|
} else {
|
|
gint eq = gst_value_compare (val1, val2);
|
|
|
|
if (eq == GST_VALUE_UNORDERED) {
|
|
/* we need to try interseting */
|
|
GValue dest_value = { 0 };
|
|
if (gst_value_intersect (&dest_value, val1, val2)) {
|
|
g_value_unset (&dest_value);
|
|
} else {
|
|
return FALSE;
|
|
}
|
|
} else if (eq != GST_VALUE_EQUAL) {
|
|
return FALSE;
|
|
}
|
|
}
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
static gboolean
|
|
gst_caps_structure_can_intersect (const GstStructure * struct1,
|
|
const GstStructure * struct2)
|
|
{
|
|
g_assert (struct1 != NULL);
|
|
g_assert (struct2 != NULL);
|
|
|
|
if (G_UNLIKELY (struct1->name != struct2->name))
|
|
return FALSE;
|
|
|
|
/* tries to intersect if we have the field in both */
|
|
if (G_UNLIKELY (!gst_structure_foreach ((GstStructure *) struct1,
|
|
gst_caps_structure_can_intersect_field, (gpointer) struct2)))
|
|
return FALSE;
|
|
|
|
return TRUE;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_can_intersect:
|
|
* @caps1: a #GstCaps to intersect
|
|
* @caps2: a #GstCaps to intersect
|
|
*
|
|
* Tries intersecting @caps1 and @caps2 and reports wheter the result would not
|
|
* be empty
|
|
*
|
|
* Returns: %TRUE if intersection would be not empty
|
|
*
|
|
* Since: 0.10.25
|
|
*/
|
|
gboolean
|
|
gst_caps_can_intersect (const GstCaps * caps1, const GstCaps * caps2)
|
|
{
|
|
guint64 i; /* index can be up to 2 * G_MAX_UINT */
|
|
guint j, k, len1, len2;
|
|
GstStructure *struct1;
|
|
GstStructure *struct2;
|
|
|
|
g_return_val_if_fail (GST_IS_CAPS (caps1), FALSE);
|
|
g_return_val_if_fail (GST_IS_CAPS (caps2), FALSE);
|
|
|
|
/* caps are exactly the same pointers */
|
|
if (G_UNLIKELY (caps1 == caps2))
|
|
return TRUE;
|
|
|
|
/* empty caps on either side, return empty */
|
|
if (G_UNLIKELY (CAPS_IS_EMPTY (caps1) || CAPS_IS_EMPTY (caps2)))
|
|
return FALSE;
|
|
|
|
/* one of the caps is any */
|
|
if (G_UNLIKELY (CAPS_IS_ANY (caps1) || CAPS_IS_ANY (caps2)))
|
|
return TRUE;
|
|
|
|
/* run zigzag on top line then right line, this preserves the caps order
|
|
* much better than a simple loop.
|
|
*
|
|
* This algorithm zigzags over the caps structures as demonstrated in
|
|
* the folowing matrix:
|
|
*
|
|
* caps1
|
|
* +-------------
|
|
* | 1 2 4 7
|
|
* caps2 | 3 5 8 10
|
|
* | 6 9 11 12
|
|
*
|
|
* First we iterate over the caps1 structures (top line) intersecting
|
|
* the structures diagonally down, then we iterate over the caps2
|
|
* structures.
|
|
*/
|
|
len1 = caps1->structs->len;
|
|
len2 = caps2->structs->len;
|
|
for (i = 0; i < len1 + len2 - 1; i++) {
|
|
/* superset index goes from 0 to sgst_caps_structure_intersectuperset->structs->len-1 */
|
|
j = MIN (i, len1 - 1);
|
|
/* subset index stays 0 until i reaches superset->structs->len, then it
|
|
* counts up from 1 to subset->structs->len - 1 */
|
|
k = MAX (0, i - j);
|
|
|
|
/* now run the diagonal line, end condition is the left or bottom
|
|
* border */
|
|
while (k < len2) {
|
|
struct1 = gst_caps_get_structure_unchecked (caps1, j);
|
|
struct2 = gst_caps_get_structure_unchecked (caps2, k);
|
|
|
|
if (gst_caps_structure_can_intersect (struct1, struct2)) {
|
|
return TRUE;
|
|
}
|
|
/* move down left */
|
|
k++;
|
|
if (G_UNLIKELY (j == 0))
|
|
break; /* so we don't roll back to G_MAXUINT */
|
|
j--;
|
|
}
|
|
}
|
|
return FALSE;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_intersect:
|
|
* @caps1: a #GstCaps to intersect
|
|
* @caps2: a #GstCaps to intersect
|
|
*
|
|
* Creates a new #GstCaps that contains all the formats that are common
|
|
* to both @caps1 and @caps2.
|
|
*
|
|
* Returns: the new #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_intersect (const GstCaps * caps1, const GstCaps * caps2)
|
|
{
|
|
guint64 i; /* index can be up to 2 * G_MAX_UINT */
|
|
guint j, k, len1, len2;
|
|
|
|
GstStructure *struct1;
|
|
GstStructure *struct2;
|
|
GstCaps *dest;
|
|
GstStructure *istruct;
|
|
|
|
g_return_val_if_fail (GST_IS_CAPS (caps1), NULL);
|
|
g_return_val_if_fail (GST_IS_CAPS (caps2), NULL);
|
|
|
|
/* caps are exactly the same pointers, just copy one caps */
|
|
if (G_UNLIKELY (caps1 == caps2))
|
|
return gst_caps_copy (caps1);
|
|
|
|
/* empty caps on either side, return empty */
|
|
if (G_UNLIKELY (CAPS_IS_EMPTY (caps1) || CAPS_IS_EMPTY (caps2)))
|
|
return gst_caps_new_empty ();
|
|
|
|
/* one of the caps is any, just copy the other caps */
|
|
if (G_UNLIKELY (CAPS_IS_ANY (caps1)))
|
|
return gst_caps_copy (caps2);
|
|
if (G_UNLIKELY (CAPS_IS_ANY (caps2)))
|
|
return gst_caps_copy (caps1);
|
|
|
|
dest = gst_caps_new_empty ();
|
|
|
|
/* run zigzag on top line then right line, this preserves the caps order
|
|
* much better than a simple loop.
|
|
*
|
|
* This algorithm zigzags over the caps structures as demonstrated in
|
|
* the folowing matrix:
|
|
*
|
|
* caps1
|
|
* +-------------
|
|
* | 1 2 4 7
|
|
* caps2 | 3 5 8 10
|
|
* | 6 9 11 12
|
|
*
|
|
* First we iterate over the caps1 structures (top line) intersecting
|
|
* the structures diagonally down, then we iterate over the caps2
|
|
* structures.
|
|
*/
|
|
len1 = caps1->structs->len;
|
|
len2 = caps2->structs->len;
|
|
for (i = 0; i < len1 + len2 - 1; i++) {
|
|
/* caps1 index goes from 0 to caps1->structs->len-1 */
|
|
j = MIN (i, len1 - 1);
|
|
/* caps2 index stays 0 until i reaches caps1->structs->len, then it counts
|
|
* up from 1 to caps2->structs->len - 1 */
|
|
k = MAX (0, i - j);
|
|
|
|
/* now run the diagonal line, end condition is the left or bottom
|
|
* border */
|
|
while (k < len2) {
|
|
struct1 = gst_caps_get_structure_unchecked (caps1, j);
|
|
struct2 = gst_caps_get_structure_unchecked (caps2, k);
|
|
|
|
istruct = gst_caps_structure_intersect (struct1, struct2);
|
|
|
|
gst_caps_append_structure (dest, istruct);
|
|
/* move down left */
|
|
k++;
|
|
if (G_UNLIKELY (j == 0))
|
|
break; /* so we don't roll back to G_MAXUINT */
|
|
j--;
|
|
}
|
|
}
|
|
return dest;
|
|
}
|
|
|
|
/* subtract operation */
|
|
|
|
typedef struct
|
|
{
|
|
const GstStructure *subtract_from;
|
|
GSList *put_into;
|
|
}
|
|
SubtractionEntry;
|
|
|
|
static gboolean
|
|
gst_caps_structure_subtract_field (GQuark field_id, const GValue * value,
|
|
gpointer user_data)
|
|
{
|
|
SubtractionEntry *e = user_data;
|
|
GValue subtraction = { 0, };
|
|
const GValue *other;
|
|
GstStructure *structure;
|
|
|
|
other = gst_structure_id_get_value (e->subtract_from, field_id);
|
|
if (!other) {
|
|
return FALSE;
|
|
}
|
|
if (!gst_value_subtract (&subtraction, other, value))
|
|
return TRUE;
|
|
if (gst_value_compare (&subtraction, other) == GST_VALUE_EQUAL) {
|
|
g_value_unset (&subtraction);
|
|
return FALSE;
|
|
} else {
|
|
structure = gst_structure_copy (e->subtract_from);
|
|
gst_structure_id_set_value (structure, field_id, &subtraction);
|
|
g_value_unset (&subtraction);
|
|
e->put_into = g_slist_prepend (e->put_into, structure);
|
|
return TRUE;
|
|
}
|
|
}
|
|
|
|
static gboolean
|
|
gst_caps_structure_subtract (GSList ** into, const GstStructure * minuend,
|
|
const GstStructure * subtrahend)
|
|
{
|
|
SubtractionEntry e;
|
|
gboolean ret;
|
|
|
|
e.subtract_from = minuend;
|
|
e.put_into = NULL;
|
|
|
|
ret = gst_structure_foreach ((GstStructure *) subtrahend,
|
|
gst_caps_structure_subtract_field, &e);
|
|
if (ret) {
|
|
*into = e.put_into;
|
|
} else {
|
|
GSList *walk;
|
|
|
|
for (walk = e.put_into; walk; walk = g_slist_next (walk)) {
|
|
gst_structure_free (walk->data);
|
|
}
|
|
g_slist_free (e.put_into);
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_subtract:
|
|
* @minuend: #GstCaps to substract from
|
|
* @subtrahend: #GstCaps to substract
|
|
*
|
|
* Subtracts the @subtrahend from the @minuend.
|
|
* <note>This function does not work reliably if optional properties for caps
|
|
* are included on one caps and omitted on the other.</note>
|
|
*
|
|
* Returns: the resulting caps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_subtract (const GstCaps * minuend, const GstCaps * subtrahend)
|
|
{
|
|
guint i, j, sublen;
|
|
GstStructure *min;
|
|
GstStructure *sub;
|
|
GstCaps *dest = NULL, *src;
|
|
|
|
g_return_val_if_fail (minuend != NULL, NULL);
|
|
g_return_val_if_fail (subtrahend != NULL, NULL);
|
|
|
|
if (CAPS_IS_EMPTY (minuend) || CAPS_IS_ANY (subtrahend)) {
|
|
return gst_caps_new_empty ();
|
|
}
|
|
if (CAPS_IS_EMPTY_SIMPLE (subtrahend))
|
|
return gst_caps_copy (minuend);
|
|
|
|
/* FIXME: Do we want this here or above?
|
|
The reason we need this is that there is no definition about what
|
|
ANY means for specific types, so it's not possible to reduce ANY partially
|
|
You can only remove everything or nothing and that is done above.
|
|
Note: there's a test that checks this behaviour. */
|
|
g_return_val_if_fail (!CAPS_IS_ANY (minuend), NULL);
|
|
sublen = subtrahend->structs->len;
|
|
g_assert (sublen > 0);
|
|
|
|
src = gst_caps_copy (minuend);
|
|
for (i = 0; i < sublen; i++) {
|
|
guint srclen;
|
|
|
|
sub = gst_caps_get_structure_unchecked (subtrahend, i);
|
|
if (dest) {
|
|
gst_caps_unref (src);
|
|
src = dest;
|
|
}
|
|
dest = gst_caps_new_empty ();
|
|
srclen = src->structs->len;
|
|
for (j = 0; j < srclen; j++) {
|
|
min = gst_caps_get_structure_unchecked (src, j);
|
|
if (gst_structure_get_name_id (min) == gst_structure_get_name_id (sub)) {
|
|
GSList *list;
|
|
|
|
if (gst_caps_structure_subtract (&list, min, sub)) {
|
|
GSList *walk;
|
|
|
|
for (walk = list; walk; walk = g_slist_next (walk)) {
|
|
gst_caps_append_structure_unchecked (dest,
|
|
(GstStructure *) walk->data);
|
|
}
|
|
g_slist_free (list);
|
|
} else {
|
|
gst_caps_append_structure_unchecked (dest, gst_structure_copy (min));
|
|
}
|
|
} else {
|
|
gst_caps_append_structure_unchecked (dest, gst_structure_copy (min));
|
|
}
|
|
}
|
|
if (CAPS_IS_EMPTY_SIMPLE (dest)) {
|
|
gst_caps_unref (src);
|
|
return dest;
|
|
}
|
|
}
|
|
|
|
gst_caps_unref (src);
|
|
gst_caps_do_simplify (dest);
|
|
return dest;
|
|
}
|
|
|
|
/* union operation */
|
|
|
|
#if 0
|
|
static GstStructure *
|
|
gst_caps_structure_union (const GstStructure * struct1,
|
|
const GstStructure * struct2)
|
|
{
|
|
int i;
|
|
GstStructure *dest;
|
|
const GstStructureField *field1;
|
|
const GstStructureField *field2;
|
|
int ret;
|
|
|
|
/* FIXME this doesn't actually work */
|
|
|
|
if (struct1->name != struct2->name)
|
|
return NULL;
|
|
|
|
dest = gst_structure_id_empty_new (struct1->name);
|
|
|
|
for (i = 0; i < struct1->fields->len; i++) {
|
|
GValue dest_value = { 0 };
|
|
|
|
field1 = GST_STRUCTURE_FIELD (struct1, i);
|
|
field2 = gst_structure_id_get_field (struct2, field1->name);
|
|
|
|
if (field2 == NULL) {
|
|
continue;
|
|
} else {
|
|
if (gst_value_union (&dest_value, &field1->value, &field2->value)) {
|
|
gst_structure_set_value (dest, g_quark_to_string (field1->name),
|
|
&dest_value);
|
|
} else {
|
|
ret = gst_value_compare (&field1->value, &field2->value);
|
|
}
|
|
}
|
|
}
|
|
|
|
return dest;
|
|
}
|
|
#endif
|
|
|
|
/**
|
|
* gst_caps_union:
|
|
* @caps1: a #GstCaps to union
|
|
* @caps2: a #GstCaps to union
|
|
*
|
|
* Creates a new #GstCaps that contains all the formats that are in
|
|
* either @caps1 and @caps2.
|
|
*
|
|
* Returns: the new #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_union (const GstCaps * caps1, const GstCaps * caps2)
|
|
{
|
|
GstCaps *dest1;
|
|
GstCaps *dest2;
|
|
|
|
/* NULL pointers are no correct GstCaps */
|
|
g_return_val_if_fail (caps1 != NULL, NULL);
|
|
g_return_val_if_fail (caps2 != NULL, NULL);
|
|
|
|
if (CAPS_IS_EMPTY (caps1))
|
|
return gst_caps_copy (caps2);
|
|
|
|
if (CAPS_IS_EMPTY (caps2))
|
|
return gst_caps_copy (caps1);
|
|
|
|
if (CAPS_IS_ANY (caps1) || CAPS_IS_ANY (caps2))
|
|
return gst_caps_new_any ();
|
|
|
|
dest1 = gst_caps_copy (caps1);
|
|
dest2 = gst_caps_copy (caps2);
|
|
gst_caps_append (dest1, dest2);
|
|
|
|
gst_caps_do_simplify (dest1);
|
|
return dest1;
|
|
}
|
|
|
|
/* normalize/simplify operations */
|
|
|
|
typedef struct _NormalizeForeach
|
|
{
|
|
GstCaps *caps;
|
|
GstStructure *structure;
|
|
}
|
|
NormalizeForeach;
|
|
|
|
static gboolean
|
|
gst_caps_normalize_foreach (GQuark field_id, const GValue * value, gpointer ptr)
|
|
{
|
|
NormalizeForeach *nf = (NormalizeForeach *) ptr;
|
|
GValue val = { 0 };
|
|
guint i;
|
|
|
|
if (G_VALUE_TYPE (value) == GST_TYPE_LIST) {
|
|
guint len = gst_value_list_get_size (value);
|
|
for (i = 1; i < len; i++) {
|
|
const GValue *v = gst_value_list_get_value (value, i);
|
|
GstStructure *structure = gst_structure_copy (nf->structure);
|
|
|
|
gst_structure_id_set_value (structure, field_id, v);
|
|
gst_caps_append_structure_unchecked (nf->caps, structure);
|
|
}
|
|
|
|
gst_value_init_and_copy (&val, gst_value_list_get_value (value, 0));
|
|
gst_structure_id_set_value (nf->structure, field_id, &val);
|
|
g_value_unset (&val);
|
|
|
|
return FALSE;
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_normalize:
|
|
* @caps: a #GstCaps to normalize
|
|
*
|
|
* Creates a new #GstCaps that represents the same set of formats as
|
|
* @caps, but contains no lists. Each list is expanded into separate
|
|
* @GstStructures.
|
|
*
|
|
* Returns: the new #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_normalize (const GstCaps * caps)
|
|
{
|
|
NormalizeForeach nf;
|
|
GstCaps *newcaps;
|
|
guint i, nlen;
|
|
|
|
g_return_val_if_fail (GST_IS_CAPS (caps), NULL);
|
|
|
|
newcaps = gst_caps_copy (caps);
|
|
nf.caps = newcaps;
|
|
nlen = newcaps->structs->len;
|
|
|
|
for (i = 0; i < nlen; i++) {
|
|
nf.structure = gst_caps_get_structure_unchecked (newcaps, i);
|
|
|
|
while (!gst_structure_foreach (nf.structure,
|
|
gst_caps_normalize_foreach, &nf));
|
|
}
|
|
|
|
return newcaps;
|
|
}
|
|
|
|
static gint
|
|
gst_caps_compare_structures (gconstpointer one, gconstpointer two)
|
|
{
|
|
gint ret;
|
|
const GstStructure *struct1 = *((const GstStructure **) one);
|
|
const GstStructure *struct2 = *((const GstStructure **) two);
|
|
|
|
/* FIXME: this orders alphabetically, but ordering the quarks might be faster
|
|
So what's the best way? */
|
|
ret = strcmp (gst_structure_get_name (struct1),
|
|
gst_structure_get_name (struct2));
|
|
if (ret)
|
|
return ret;
|
|
|
|
return gst_structure_n_fields (struct2) - gst_structure_n_fields (struct1);
|
|
}
|
|
|
|
typedef struct
|
|
{
|
|
GQuark name;
|
|
GValue value;
|
|
GstStructure *compare;
|
|
}
|
|
UnionField;
|
|
|
|
static gboolean
|
|
gst_caps_structure_figure_out_union (GQuark field_id, const GValue * value,
|
|
gpointer user_data)
|
|
{
|
|
UnionField *u = user_data;
|
|
const GValue *val = gst_structure_id_get_value (u->compare, field_id);
|
|
|
|
if (!val) {
|
|
if (u->name)
|
|
g_value_unset (&u->value);
|
|
return FALSE;
|
|
}
|
|
if (gst_value_compare (val, value) == GST_VALUE_EQUAL)
|
|
return TRUE;
|
|
if (u->name) {
|
|
g_value_unset (&u->value);
|
|
return FALSE;
|
|
}
|
|
u->name = field_id;
|
|
gst_value_union (&u->value, val, value);
|
|
return TRUE;
|
|
}
|
|
|
|
static gboolean
|
|
gst_caps_structure_simplify (GstStructure ** result,
|
|
const GstStructure * simplify, GstStructure * compare)
|
|
{
|
|
GSList *list;
|
|
UnionField field = { 0, {0,}, NULL };
|
|
|
|
/* try to subtract to get a real subset */
|
|
if (gst_caps_structure_subtract (&list, simplify, compare)) {
|
|
switch (g_slist_length (list)) {
|
|
case 0:
|
|
*result = NULL;
|
|
return TRUE;
|
|
case 1:
|
|
*result = list->data;
|
|
g_slist_free (list);
|
|
return TRUE;
|
|
default:
|
|
{
|
|
GSList *walk;
|
|
|
|
for (walk = list; walk; walk = g_slist_next (walk)) {
|
|
gst_structure_free (walk->data);
|
|
}
|
|
g_slist_free (list);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* try to union both structs */
|
|
field.compare = compare;
|
|
if (gst_structure_foreach ((GstStructure *) simplify,
|
|
gst_caps_structure_figure_out_union, &field)) {
|
|
gboolean ret = FALSE;
|
|
|
|
/* now we know all of simplify's fields are the same in compare
|
|
* but at most one field: field.name */
|
|
if (G_IS_VALUE (&field.value)) {
|
|
if (gst_structure_n_fields (simplify) == gst_structure_n_fields (compare)) {
|
|
gst_structure_id_set_value (compare, field.name, &field.value);
|
|
*result = NULL;
|
|
ret = TRUE;
|
|
}
|
|
g_value_unset (&field.value);
|
|
} else if (gst_structure_n_fields (simplify) <=
|
|
gst_structure_n_fields (compare)) {
|
|
/* compare is just more specific, will be optimized away later */
|
|
/* FIXME: do this here? */
|
|
GST_LOG ("found a case that will be optimized later.");
|
|
} else {
|
|
gchar *one = gst_structure_to_string (simplify);
|
|
gchar *two = gst_structure_to_string (compare);
|
|
|
|
GST_ERROR
|
|
("caps mismatch: structures %s and %s claim to be possible to unify, but aren't",
|
|
one, two);
|
|
g_free (one);
|
|
g_free (two);
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
return FALSE;
|
|
}
|
|
|
|
static void
|
|
gst_caps_switch_structures (GstCaps * caps, GstStructure * old,
|
|
GstStructure * new, gint i)
|
|
{
|
|
gst_structure_set_parent_refcount (old, NULL);
|
|
gst_structure_free (old);
|
|
gst_structure_set_parent_refcount (new, &caps->refcount);
|
|
g_ptr_array_index (caps->structs, i) = new;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_do_simplify:
|
|
* @caps: a #GstCaps to simplify
|
|
*
|
|
* Modifies the given @caps inplace into a representation that represents the
|
|
* same set of formats, but in a simpler form. Component structures that are
|
|
* identical are merged. Component structures that have values that can be
|
|
* merged are also merged.
|
|
*
|
|
* Returns: TRUE, if the caps could be simplified
|
|
*/
|
|
gboolean
|
|
gst_caps_do_simplify (GstCaps * caps)
|
|
{
|
|
GstStructure *simplify, *compare, *result = NULL;
|
|
gint i, j, start;
|
|
gboolean changed = FALSE;
|
|
|
|
g_return_val_if_fail (caps != NULL, FALSE);
|
|
g_return_val_if_fail (IS_WRITABLE (caps), FALSE);
|
|
|
|
if (gst_caps_get_size (caps) < 2)
|
|
return FALSE;
|
|
|
|
g_ptr_array_sort (caps->structs, gst_caps_compare_structures);
|
|
|
|
start = caps->structs->len - 1;
|
|
for (i = caps->structs->len - 1; i >= 0; i--) {
|
|
simplify = gst_caps_get_structure_unchecked (caps, i);
|
|
if (gst_structure_get_name_id (simplify) !=
|
|
gst_structure_get_name_id (gst_caps_get_structure_unchecked (caps,
|
|
start)))
|
|
start = i;
|
|
for (j = start; j >= 0; j--) {
|
|
if (j == i)
|
|
continue;
|
|
compare = gst_caps_get_structure_unchecked (caps, j);
|
|
if (gst_structure_get_name_id (simplify) !=
|
|
gst_structure_get_name_id (compare)) {
|
|
break;
|
|
}
|
|
if (gst_caps_structure_simplify (&result, simplify, compare)) {
|
|
if (result) {
|
|
gst_caps_switch_structures (caps, simplify, result, i);
|
|
simplify = result;
|
|
} else {
|
|
gst_caps_remove_structure (caps, i);
|
|
start--;
|
|
break;
|
|
}
|
|
changed = TRUE;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (!changed)
|
|
return FALSE;
|
|
|
|
/* gst_caps_do_simplify (caps); */
|
|
return TRUE;
|
|
}
|
|
|
|
/* persistence */
|
|
|
|
#if !defined(GST_DISABLE_LOADSAVE) && !defined(GST_REMOVE_DEPRECATED)
|
|
/**
|
|
* gst_caps_save_thyself:
|
|
* @caps: a #GstCaps structure
|
|
* @parent: a XML parent node
|
|
*
|
|
* Serializes a #GstCaps to XML and adds it as a child node of @parent.
|
|
*
|
|
* Returns: a XML node pointer
|
|
*/
|
|
xmlNodePtr
|
|
gst_caps_save_thyself (const GstCaps * caps, xmlNodePtr parent)
|
|
{
|
|
char *s = gst_caps_to_string (caps);
|
|
|
|
xmlNewChild (parent, NULL, (xmlChar *) "caps", (xmlChar *) s);
|
|
g_free (s);
|
|
return parent;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_load_thyself:
|
|
* @parent: a XML node
|
|
*
|
|
* Creates a #GstCaps from its XML serialization.
|
|
*
|
|
* Returns: a new #GstCaps structure
|
|
*/
|
|
GstCaps *
|
|
gst_caps_load_thyself (xmlNodePtr parent)
|
|
{
|
|
if (strcmp ("caps", (char *) parent->name) == 0) {
|
|
return gst_caps_from_string ((gchar *) xmlNodeGetContent (parent));
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
#endif
|
|
|
|
/* utility */
|
|
|
|
/**
|
|
* gst_caps_replace:
|
|
* @caps: a pointer to #GstCaps
|
|
* @newcaps: a #GstCaps to replace *caps
|
|
*
|
|
* Replaces *caps with @newcaps. Unrefs the #GstCaps in the location
|
|
* pointed to by @caps, if applicable, then modifies @caps to point to
|
|
* @newcaps. An additional ref on @newcaps is taken.
|
|
*
|
|
* This function does not take any locks so you might want to lock
|
|
* the object owning @caps pointer.
|
|
*/
|
|
void
|
|
gst_caps_replace (GstCaps ** caps, GstCaps * newcaps)
|
|
{
|
|
GstCaps *oldcaps;
|
|
|
|
g_return_if_fail (caps != NULL);
|
|
|
|
oldcaps = *caps;
|
|
|
|
GST_CAT_TRACE (GST_CAT_REFCOUNTING, "%p, %p -> %p", caps, oldcaps, newcaps);
|
|
|
|
if (newcaps != oldcaps) {
|
|
if (newcaps)
|
|
gst_caps_ref (newcaps);
|
|
|
|
*caps = newcaps;
|
|
|
|
if (oldcaps)
|
|
gst_caps_unref (oldcaps);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* gst_caps_to_string:
|
|
* @caps: a #GstCaps
|
|
*
|
|
* Converts @caps to a string representation. This string representation
|
|
* can be converted back to a #GstCaps by gst_caps_from_string().
|
|
*
|
|
* For debugging purposes its easier to do something like this:
|
|
* |[
|
|
* GST_LOG ("caps are %" GST_PTR_FORMAT, caps);
|
|
* ]|
|
|
* This prints the caps in human readble form.
|
|
*
|
|
* Returns: a newly allocated string representing @caps.
|
|
*/
|
|
gchar *
|
|
gst_caps_to_string (const GstCaps * caps)
|
|
{
|
|
guint i, slen, clen;
|
|
GString *s;
|
|
|
|
/* NOTE: This function is potentially called by the debug system,
|
|
* so any calls to gst_log() (and GST_DEBUG(), GST_LOG(), etc.)
|
|
* should be careful to avoid recursion. This includes any functions
|
|
* called by gst_caps_to_string. In particular, calls should
|
|
* not use the GST_PTR_FORMAT extension. */
|
|
|
|
if (caps == NULL) {
|
|
return g_strdup ("NULL");
|
|
}
|
|
if (CAPS_IS_ANY (caps)) {
|
|
return g_strdup ("ANY");
|
|
}
|
|
if (CAPS_IS_EMPTY_SIMPLE (caps)) {
|
|
return g_strdup ("EMPTY");
|
|
}
|
|
|
|
/* estimate a rough string length to avoid unnecessary reallocs in GString */
|
|
slen = 0;
|
|
clen = caps->structs->len;
|
|
for (i = 0; i < clen; i++) {
|
|
slen +=
|
|
STRUCTURE_ESTIMATED_STRING_LEN (gst_caps_get_structure_unchecked (caps,
|
|
i));
|
|
}
|
|
|
|
s = g_string_sized_new (slen);
|
|
for (i = 0; i < clen; i++) {
|
|
GstStructure *structure;
|
|
|
|
if (i > 0) {
|
|
/* ';' is now added by gst_structure_to_string */
|
|
g_string_append_c (s, ' ');
|
|
}
|
|
|
|
structure = gst_caps_get_structure_unchecked (caps, i);
|
|
priv_gst_structure_append_to_gstring (structure, s);
|
|
}
|
|
if (s->len && s->str[s->len - 1] == ';') {
|
|
/* remove latest ';' */
|
|
s->str[--s->len] = '\0';
|
|
}
|
|
return g_string_free (s, FALSE);
|
|
}
|
|
|
|
static gboolean
|
|
gst_caps_from_string_inplace (GstCaps * caps, const gchar * string)
|
|
{
|
|
GstStructure *structure;
|
|
gchar *s;
|
|
|
|
if (strcmp ("ANY", string) == 0) {
|
|
caps->flags = GST_CAPS_FLAGS_ANY;
|
|
return TRUE;
|
|
}
|
|
if (strcmp ("EMPTY", string) == 0) {
|
|
return TRUE;
|
|
}
|
|
|
|
structure = gst_structure_from_string (string, &s);
|
|
if (structure == NULL) {
|
|
return FALSE;
|
|
}
|
|
gst_caps_append_structure_unchecked (caps, structure);
|
|
|
|
do {
|
|
|
|
while (g_ascii_isspace (*s))
|
|
s++;
|
|
if (*s == '\0') {
|
|
break;
|
|
}
|
|
structure = gst_structure_from_string (s, &s);
|
|
if (structure == NULL) {
|
|
return FALSE;
|
|
}
|
|
gst_caps_append_structure_unchecked (caps, structure);
|
|
|
|
} while (TRUE);
|
|
|
|
return TRUE;
|
|
}
|
|
|
|
/**
|
|
* gst_caps_from_string:
|
|
* @string: a string to convert to #GstCaps
|
|
*
|
|
* Converts @caps from a string representation.
|
|
*
|
|
* Returns: a newly allocated #GstCaps
|
|
*/
|
|
GstCaps *
|
|
gst_caps_from_string (const gchar * string)
|
|
{
|
|
GstCaps *caps;
|
|
|
|
g_return_val_if_fail (string, FALSE);
|
|
|
|
caps = gst_caps_new_empty ();
|
|
if (gst_caps_from_string_inplace (caps, string)) {
|
|
return caps;
|
|
} else {
|
|
gst_caps_unref (caps);
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
static void
|
|
gst_caps_transform_to_string (const GValue * src_value, GValue * dest_value)
|
|
{
|
|
g_return_if_fail (G_IS_VALUE (src_value));
|
|
g_return_if_fail (G_IS_VALUE (dest_value));
|
|
g_return_if_fail (G_VALUE_HOLDS (src_value, GST_TYPE_CAPS));
|
|
g_return_if_fail (G_VALUE_HOLDS (dest_value, G_TYPE_STRING)
|
|
|| G_VALUE_HOLDS (dest_value, G_TYPE_POINTER));
|
|
|
|
dest_value->data[0].v_pointer =
|
|
gst_caps_to_string (src_value->data[0].v_pointer);
|
|
}
|
|
|
|
static GstCaps *
|
|
gst_caps_copy_conditional (GstCaps * src)
|
|
{
|
|
if (src) {
|
|
return gst_caps_ref (src);
|
|
} else {
|
|
return NULL;
|
|
}
|
|
}
|