2 * Copyright (C) 1999,2000 Erik Walthinsen <omega@cse.ogi.edu>
3 * 2000 Wim Taymans <wtay@chello.be>
4 * 2002 Thomas Vander Stichele <thomas@apestaart.org>
6 * gstutils.c: Utility functions
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Library General Public
10 * License as published by the Free Software Foundation; either
11 * version 2 of the License, or (at your option) any later version.
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Library General Public License for more details.
18 * You should have received a copy of the GNU Library General Public
19 * License along with this library; if not, write to the
20 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
21 * Boston, MA 02111-1307, USA.
26 * @short_description: Various utility functions
28 * When defining own plugins, use the GST_BOILERPLATE ease gobject creation.
31 #include "gst_private.h"
35 #include "gstghostpad.h"
41 #include "gst-i18n-lib.h"
46 * @mem: a pointer to the memory to dump
47 * @size: the size of the memory block to dump
49 * Dumps the memory block into a hex representation. Useful for debugging.
52 gst_util_dump_mem (const guchar * mem, guint size)
55 GString *string = g_string_sized_new (50);
56 GString *chars = g_string_sized_new (18);
60 if (g_ascii_isprint (mem[i]))
61 g_string_append_c (chars, mem[i]);
63 g_string_append_c (chars, '.');
65 g_string_append_printf (string, "%02x ", mem[i]);
70 if (j == 16 || i == size) {
71 g_print ("%08x (%p): %-48.48s %-16.16s\n", i - j, mem + i - j,
72 string->str, chars->str);
73 g_string_set_size (string, 0);
74 g_string_set_size (chars, 0);
78 g_string_free (string, TRUE);
79 g_string_free (chars, TRUE);
84 * gst_util_set_value_from_string:
85 * @value: (out caller-allocates): the value to set
86 * @value_str: the string to get the value from
88 * Converts the string to the type of the value and
89 * sets the value with it.
91 * Note that this function is dangerous as it does not return any indication
92 * if the conversion worked or not.
95 gst_util_set_value_from_string (GValue * value, const gchar * value_str)
99 g_return_if_fail (value != NULL);
100 g_return_if_fail (value_str != NULL);
102 GST_CAT_DEBUG (GST_CAT_PARAMS, "parsing '%s' to type %s", value_str,
103 g_type_name (G_VALUE_TYPE (value)));
105 res = gst_value_deserialize (value, value_str);
106 if (!res && G_VALUE_TYPE (value) == G_TYPE_BOOLEAN) {
107 /* backwards compat, all booleans that fail to parse are false */
108 g_value_set_boolean (value, FALSE);
111 g_return_if_fail (res);
115 * gst_util_set_object_arg:
116 * @object: the object to set the argument of
117 * @name: the name of the argument to set
118 * @value: the string value to set
120 * Convertes the string value to the type of the objects argument and
121 * sets the argument with it.
123 * Note that this function silently returns if @object has no property named
124 * @name or when @value cannot be converted to the type of the property.
127 gst_util_set_object_arg (GObject * object, const gchar * name,
134 g_return_if_fail (G_IS_OBJECT (object));
135 g_return_if_fail (name != NULL);
136 g_return_if_fail (value != NULL);
138 pspec = g_object_class_find_property (G_OBJECT_GET_CLASS (object), name);
142 value_type = pspec->value_type;
144 GST_DEBUG ("pspec->flags is %d, pspec->value_type is %s",
145 pspec->flags, g_type_name (value_type));
147 if (!(pspec->flags & G_PARAM_WRITABLE))
150 g_value_init (&v, value_type);
152 /* special case for element <-> xml (de)serialisation */
153 if (GST_VALUE_HOLDS_STRUCTURE (&v) && strcmp (value, "NULL") == 0) {
154 g_value_set_boxed (&v, NULL);
158 if (!gst_value_deserialize (&v, value))
163 g_object_set_property (object, pspec->name, &v);
167 /* work around error C2520: conversion from unsigned __int64 to double
168 * not implemented, use signed __int64
170 * These are implemented as functions because on some platforms a 64bit int to
171 * double conversion is not defined/implemented.
175 gst_util_guint64_to_gdouble (guint64 value)
177 if (value & G_GINT64_CONSTANT (0x8000000000000000))
178 return (gdouble) ((gint64) value) + (gdouble) 18446744073709551616.;
180 return (gdouble) ((gint64) value);
184 gst_util_gdouble_to_guint64 (gdouble value)
186 if (value < (gdouble) 9223372036854775808.) /* 1 << 63 */
187 return ((guint64) ((gint64) value));
189 value -= (gdouble) 18446744073709551616.;
190 return ((guint64) ((gint64) value));
193 #ifndef HAVE_UINT128_T
194 /* convenience struct for getting high and low uint32 parts of
201 #if G_BYTE_ORDER == G_BIG_ENDIAN
209 #if defined (__x86_64__) && defined (__GNUC__)
211 gst_util_uint64_mul_uint64 (GstUInt64 * c1, GstUInt64 * c0, guint64 arg1,
214 __asm__ __volatile__ ("mulq %3":"=a" (c0->ll), "=d" (c1->ll)
215 :"a" (arg1), "g" (arg2)
218 #else /* defined (__x86_64__) */
219 /* multiply two 64-bit unsigned ints into a 128-bit unsigned int. the high
220 * and low 64 bits of the product are placed in c1 and c0 respectively.
221 * this operation cannot overflow. */
223 gst_util_uint64_mul_uint64 (GstUInt64 * c1, GstUInt64 * c0, guint64 arg1,
233 /* do 128 bits multiply
241 * -------------------
244 * "a0" is optimized away, result is stored directly in c0. "b1" is
245 * optimized away, result is stored directly in c1.
247 c0->ll = (guint64) v.l.low * n.l.low;
248 a1.ll = (guint64) v.l.low * n.l.high;
249 b0.ll = (guint64) v.l.high * n.l.low;
251 /* add the high word of a0 to the low words of a1 and b0 using c1 as
252 * scrach space to capture the carry. the low word of the result becomes
253 * the final high word of c0 */
254 c1->ll = (guint64) c0->l.high + a1.l.low + b0.l.low;
255 c0->l.high = c1->l.low;
257 /* add the carry from the result above (found in the high word of c1) and
258 * the high words of a1 and b0 to b1, the result is c1. */
259 c1->ll = (guint64) v.l.high * n.l.high + c1->l.high + a1.l.high + b0.l.high;
261 #endif /* defined (__x86_64__) */
263 #if defined (__x86_64__) && defined (__GNUC__)
264 static inline guint64
265 gst_util_div128_64 (GstUInt64 c1, GstUInt64 c0, guint64 denom)
269 __asm__ __volatile__ ("divq %3":"=a" (res)
270 :"d" (c1.ll), "a" (c0.ll), "g" (denom)
276 /* count leading zeros */
278 gst_util_clz (guint32 val)
282 s = val | (val >> 1);
286 s = ~(s | (s >> 16));
287 s = s - ((s >> 1) & 0x55555555);
288 s = (s & 0x33333333) + ((s >> 2) & 0x33333333);
289 s = (s + (s >> 4)) & 0x0f0f0f0f;
291 s = (s + (s >> 16)) & 0x3f;
296 /* based on Hacker's Delight p152 */
297 static inline guint64
298 gst_util_div128_64 (GstUInt64 c1, GstUInt64 c0, guint64 denom)
300 GstUInt64 q1, q0, rhat;
301 GstUInt64 v, cmp1, cmp2;
306 /* count number of leading zeroes, we know they must be in the high
307 * part of denom since denom > G_MAXUINT32. */
308 s = gst_util_clz (v.l.high);
311 /* normalize divisor and dividend */
313 c1.ll = (c1.ll << s) | (c0.l.high >> (32 - s));
317 q1.ll = c1.ll / v.l.high;
318 rhat.ll = c1.ll - q1.ll * v.l.high;
320 cmp1.l.high = rhat.l.low;
321 cmp1.l.low = c0.l.high;
322 cmp2.ll = q1.ll * v.l.low;
324 while (q1.l.high || cmp2.ll > cmp1.ll) {
329 cmp1.l.high = rhat.l.low;
332 c1.l.high = c1.l.low;
333 c1.l.low = c0.l.high;
334 c1.ll -= q1.ll * v.ll;
335 q0.ll = c1.ll / v.l.high;
336 rhat.ll = c1.ll - q0.ll * v.l.high;
338 cmp1.l.high = rhat.l.low;
339 cmp1.l.low = c0.l.low;
340 cmp2.ll = q0.ll * v.l.low;
342 while (q0.l.high || cmp2.ll > cmp1.ll) {
347 cmp1.l.high = rhat.l.low;
350 q0.l.high += q1.l.low;
354 #endif /* defined (__GNUC__) */
356 /* This always gives the correct result because:
357 * a) val <= G_MAXUINT64-1
358 * b) (c0,c1) <= G_MAXUINT64 * (G_MAXUINT64-1)
360 * (c0,c1) == G_MAXUINT64 * G_MAXUINT64 and denom < G_MAXUINT64
361 * (note: num==denom case is handled by short path)
362 * This means that (c0,c1) either has enough space for val
363 * or that the overall result will overflow anyway.
366 /* add correction with carry */
367 #define CORRECT(c0,c1,val) \
369 if (G_MAXUINT64 - c0.ll < val) { \
370 if (G_UNLIKELY (c1.ll == G_MAXUINT64)) \
372 return G_MAXUINT64; \
379 gst_util_uint64_scale_uint64_unchecked (guint64 val, guint64 num,
380 guint64 denom, guint64 correct)
384 /* compute 128-bit numerator product */
385 gst_util_uint64_mul_uint64 (&c1, &c0, val, num);
387 /* perform rounding correction */
388 CORRECT (c0, c1, correct);
390 /* high word as big as or bigger than denom --> overflow */
391 if (G_UNLIKELY (c1.ll >= denom))
394 /* compute quotient, fits in 64 bits */
395 return gst_util_div128_64 (c1, c0, denom);
399 #define GST_MAXUINT128 ((__uint128_t) -1)
401 gst_util_uint64_scale_uint64_unchecked (guint64 val, guint64 num,
402 guint64 denom, guint64 correct)
406 /* Calculate val * num */
407 tmp = ((__uint128_t) val) * ((__uint128_t) num);
409 /* overflow checks */
410 if (G_UNLIKELY (GST_MAXUINT128 - correct < tmp))
413 /* perform rounding correction */
416 /* Divide by denom */
419 /* if larger than G_MAXUINT64 --> overflow */
420 if (G_UNLIKELY (tmp > G_MAXUINT64))
423 /* compute quotient, fits in 64 bits */
424 return (guint64) tmp;
429 #if !defined (__x86_64__) && !defined (HAVE_UINT128_T)
431 gst_util_uint64_mul_uint32 (GstUInt64 * c1, GstUInt64 * c0, guint64 arg1,
438 c0->ll = (guint64) a.l.low * arg2;
439 c1->ll = (guint64) a.l.high * arg2 + c0->l.high;
443 /* divide a 96-bit unsigned int by a 32-bit unsigned int when we know the
444 * quotient fits into 64 bits. the high 64 bits and low 32 bits of the
445 * numerator are expected in c1 and c0 respectively. */
446 static inline guint64
447 gst_util_div96_32 (guint64 c1, guint64 c0, guint32 denom)
449 c0 += (c1 % denom) << 32;
450 return ((c1 / denom) << 32) + (c0 / denom);
453 static inline guint64
454 gst_util_uint64_scale_uint32_unchecked (guint64 val, guint32 num,
455 guint32 denom, guint32 correct)
459 /* compute 96-bit numerator product */
460 gst_util_uint64_mul_uint32 (&c1, &c0, val, num);
462 /* condition numerator based on rounding mode */
463 CORRECT (c0, c1, correct);
465 /* high 32 bits as big as or bigger than denom --> overflow */
466 if (G_UNLIKELY (c1.l.high >= denom))
469 /* compute quotient, fits in 64 bits */
470 return gst_util_div96_32 (c1.ll, c0.ll, denom);
474 /* the guts of the gst_util_uint64_scale() variants */
476 _gst_util_uint64_scale (guint64 val, guint64 num, guint64 denom,
479 g_return_val_if_fail (denom != 0, G_MAXUINT64);
481 if (G_UNLIKELY (num == 0))
484 if (G_UNLIKELY (num == denom))
487 /* on 64bits we always use a full 128bits multipy/division */
488 #if !defined (__x86_64__) && !defined (HAVE_UINT128_T)
489 /* denom is low --> try to use 96 bit muldiv */
490 if (G_LIKELY (denom <= G_MAXUINT32)) {
491 /* num is low --> use 96 bit muldiv */
492 if (G_LIKELY (num <= G_MAXUINT32))
493 return gst_util_uint64_scale_uint32_unchecked (val, (guint32) num,
494 (guint32) denom, correct);
496 /* num is high but val is low --> swap and use 96-bit muldiv */
497 if (G_LIKELY (val <= G_MAXUINT32))
498 return gst_util_uint64_scale_uint32_unchecked (num, (guint32) val,
499 (guint32) denom, correct);
501 #endif /* !defined (__x86_64__) && !defined (HAVE_UINT128_T) */
503 /* val is high and num is high --> use 128-bit muldiv */
504 return gst_util_uint64_scale_uint64_unchecked (val, num, denom, correct);
508 * gst_util_uint64_scale:
509 * @val: the number to scale
510 * @num: the numerator of the scale ratio
511 * @denom: the denominator of the scale ratio
513 * Scale @val by the rational number @num / @denom, avoiding overflows and
514 * underflows and without loss of precision.
516 * This function can potentially be very slow if val and num are both
517 * greater than G_MAXUINT32.
519 * Returns: @val * @num / @denom. In the case of an overflow, this
520 * function returns G_MAXUINT64. If the result is not exactly
521 * representable as an integer it is truncated. See also
522 * gst_util_uint64_scale_round(), gst_util_uint64_scale_ceil(),
523 * gst_util_uint64_scale_int(), gst_util_uint64_scale_int_round(),
524 * gst_util_uint64_scale_int_ceil().
527 gst_util_uint64_scale (guint64 val, guint64 num, guint64 denom)
529 return _gst_util_uint64_scale (val, num, denom, 0);
533 * gst_util_uint64_scale_round:
534 * @val: the number to scale
535 * @num: the numerator of the scale ratio
536 * @denom: the denominator of the scale ratio
538 * Scale @val by the rational number @num / @denom, avoiding overflows and
539 * underflows and without loss of precision.
541 * This function can potentially be very slow if val and num are both
542 * greater than G_MAXUINT32.
544 * Returns: @val * @num / @denom. In the case of an overflow, this
545 * function returns G_MAXUINT64. If the result is not exactly
546 * representable as an integer, it is rounded to the nearest integer
547 * (half-way cases are rounded up). See also gst_util_uint64_scale(),
548 * gst_util_uint64_scale_ceil(), gst_util_uint64_scale_int(),
549 * gst_util_uint64_scale_int_round(), gst_util_uint64_scale_int_ceil().
552 gst_util_uint64_scale_round (guint64 val, guint64 num, guint64 denom)
554 return _gst_util_uint64_scale (val, num, denom, denom >> 1);
558 * gst_util_uint64_scale_ceil:
559 * @val: the number to scale
560 * @num: the numerator of the scale ratio
561 * @denom: the denominator of the scale ratio
563 * Scale @val by the rational number @num / @denom, avoiding overflows and
564 * underflows and without loss of precision.
566 * This function can potentially be very slow if val and num are both
567 * greater than G_MAXUINT32.
569 * Returns: @val * @num / @denom. In the case of an overflow, this
570 * function returns G_MAXUINT64. If the result is not exactly
571 * representable as an integer, it is rounded up. See also
572 * gst_util_uint64_scale(), gst_util_uint64_scale_round(),
573 * gst_util_uint64_scale_int(), gst_util_uint64_scale_int_round(),
574 * gst_util_uint64_scale_int_ceil().
577 gst_util_uint64_scale_ceil (guint64 val, guint64 num, guint64 denom)
579 return _gst_util_uint64_scale (val, num, denom, denom - 1);
582 /* the guts of the gst_util_uint64_scale_int() variants */
584 _gst_util_uint64_scale_int (guint64 val, gint num, gint denom, gint correct)
586 g_return_val_if_fail (denom > 0, G_MAXUINT64);
587 g_return_val_if_fail (num >= 0, G_MAXUINT64);
589 if (G_UNLIKELY (num == 0))
592 if (G_UNLIKELY (num == denom))
595 if (val <= G_MAXUINT32) {
596 /* simple case. num and denom are not negative so casts are OK. when
597 * not truncating, the additions to the numerator cannot overflow
598 * because val*num <= G_MAXUINT32 * G_MAXINT32 < G_MAXUINT64 -
599 * G_MAXINT32, so there's room to add another gint32. */
600 val *= (guint64) num;
601 /* add rounding correction */
604 return val / (guint64) denom;
606 #if !defined (__x86_64__) && !defined (HAVE_UINT128_T)
607 /* num and denom are not negative so casts are OK */
608 return gst_util_uint64_scale_uint32_unchecked (val, (guint32) num,
609 (guint32) denom, (guint32) correct);
611 /* always use full 128bits scale */
612 return gst_util_uint64_scale_uint64_unchecked (val, num, denom, correct);
617 * gst_util_uint64_scale_int:
618 * @val: guint64 (such as a #GstClockTime) to scale.
619 * @num: numerator of the scale factor.
620 * @denom: denominator of the scale factor.
622 * Scale @val by the rational number @num / @denom, avoiding overflows and
623 * underflows and without loss of precision. @num must be non-negative and
624 * @denom must be positive.
626 * Returns: @val * @num / @denom. In the case of an overflow, this
627 * function returns G_MAXUINT64. If the result is not exactly
628 * representable as an integer, it is truncated. See also
629 * gst_util_uint64_scale_int_round(), gst_util_uint64_scale_int_ceil(),
630 * gst_util_uint64_scale(), gst_util_uint64_scale_round(),
631 * gst_util_uint64_scale_ceil().
634 gst_util_uint64_scale_int (guint64 val, gint num, gint denom)
636 return _gst_util_uint64_scale_int (val, num, denom, 0);
640 * gst_util_uint64_scale_int_round:
641 * @val: guint64 (such as a #GstClockTime) to scale.
642 * @num: numerator of the scale factor.
643 * @denom: denominator of the scale factor.
645 * Scale @val by the rational number @num / @denom, avoiding overflows and
646 * underflows and without loss of precision. @num must be non-negative and
647 * @denom must be positive.
649 * Returns: @val * @num / @denom. In the case of an overflow, this
650 * function returns G_MAXUINT64. If the result is not exactly
651 * representable as an integer, it is rounded to the nearest integer
652 * (half-way cases are rounded up). See also gst_util_uint64_scale_int(),
653 * gst_util_uint64_scale_int_ceil(), gst_util_uint64_scale(),
654 * gst_util_uint64_scale_round(), gst_util_uint64_scale_ceil().
657 gst_util_uint64_scale_int_round (guint64 val, gint num, gint denom)
659 /* we can use a shift to divide by 2 because denom is required to be
661 return _gst_util_uint64_scale_int (val, num, denom, denom >> 1);
665 * gst_util_uint64_scale_int_ceil:
666 * @val: guint64 (such as a #GstClockTime) to scale.
667 * @num: numerator of the scale factor.
668 * @denom: denominator of the scale factor.
670 * Scale @val by the rational number @num / @denom, avoiding overflows and
671 * underflows and without loss of precision. @num must be non-negative and
672 * @denom must be positive.
674 * Returns: @val * @num / @denom. In the case of an overflow, this
675 * function returns G_MAXUINT64. If the result is not exactly
676 * representable as an integer, it is rounded up. See also
677 * gst_util_uint64_scale_int(), gst_util_uint64_scale_int_round(),
678 * gst_util_uint64_scale(), gst_util_uint64_scale_round(),
679 * gst_util_uint64_scale_ceil().
682 gst_util_uint64_scale_int_ceil (guint64 val, gint num, gint denom)
684 return _gst_util_uint64_scale_int (val, num, denom, denom - 1);
688 * gst_util_seqnum_next:
690 * Return a constantly incrementing sequence number.
692 * This function is used internally to GStreamer to be able to determine which
693 * events and messages are "the same". For example, elements may set the seqnum
694 * on a segment-done message to be the same as that of the last seek event, to
695 * indicate that event and the message correspond to the same segment.
697 * Returns: A constantly incrementing 32-bit unsigned integer, which might
698 * overflow back to 0 at some point. Use gst_util_seqnum_compare() to make sure
699 * you handle wraparound correctly.
704 gst_util_seqnum_next (void)
706 static gint counter = 0;
707 return g_atomic_int_exchange_and_add (&counter, 1);
711 * gst_util_seqnum_compare:
712 * @s1: A sequence number.
713 * @s2: Another sequence number.
715 * Compare two sequence numbers, handling wraparound.
717 * The current implementation just returns (gint32)(@s1 - @s2).
719 * Returns: A negative number if @s1 is before @s2, 0 if they are equal, or a
720 * positive number if @s1 is after @s2.
725 gst_util_seqnum_compare (guint32 s1, guint32 s2)
727 return (gint32) (s1 - s2);
730 /* -----------------------------------------------------
732 * The following code will be moved out of the main
733 * gstreamer library someday.
739 string_append_indent (GString * str, gint count)
743 for (xx = 0; xx < count; xx++)
744 g_string_append_c (str, ' ');
748 * gst_print_pad_caps:
749 * @buf: the buffer to print the caps in
750 * @indent: initial indentation
751 * @pad: (transfer none): the pad to print the caps from
753 * Write the pad capabilities in a human readable format into
757 gst_print_pad_caps (GString * buf, gint indent, GstPad * pad)
764 string_append_indent (buf, indent);
765 g_string_printf (buf, "%s:%s has no capabilities",
766 GST_DEBUG_PAD_NAME (pad));
770 s = gst_caps_to_string (caps);
771 g_string_append (buf, s);
777 * gst_print_element_args:
778 * @buf: the buffer to print the args in
779 * @indent: initial indentation
780 * @element: (transfer none): the element to print the args of
782 * Print the element argument in a human readable format in the given
786 gst_print_element_args (GString * buf, gint indent, GstElement * element)
789 GValue value = { 0, }; /* the important thing is that value.type = 0 */
791 GParamSpec *spec, **specs, **walk;
793 specs = g_object_class_list_properties (G_OBJECT_GET_CLASS (element), NULL);
796 for (walk = specs; *walk; walk++) {
798 if (width < strlen (spec->name))
799 width = strlen (spec->name);
802 for (walk = specs; *walk; walk++) {
805 if (spec->flags & G_PARAM_READABLE) {
806 g_value_init (&value, spec->value_type);
807 g_object_get_property (G_OBJECT (element), spec->name, &value);
808 str = g_strdup_value_contents (&value);
809 g_value_unset (&value);
811 str = g_strdup ("Parameter not readable.");
814 string_append_indent (buf, indent);
815 g_string_append (buf, spec->name);
816 string_append_indent (buf, 2 + width - strlen (spec->name));
817 g_string_append (buf, str);
818 g_string_append_c (buf, '\n');
827 * gst_element_create_all_pads:
828 * @element: (transfer none): a #GstElement to create pads for
830 * Creates a pad for each pad template that is always available.
831 * This function is only useful during object intialization of
832 * subclasses of #GstElement.
835 gst_element_create_all_pads (GstElement * element)
839 /* FIXME: lock element */
842 gst_element_class_get_pad_template_list (GST_ELEMENT_CLASS
843 (G_OBJECT_GET_CLASS (element)));
846 GstPadTemplate *padtempl = (GstPadTemplate *) padlist->data;
848 if (padtempl->presence == GST_PAD_ALWAYS) {
851 pad = gst_pad_new_from_template (padtempl, padtempl->name_template);
853 gst_element_add_pad (element, pad);
855 padlist = padlist->next;
860 * gst_element_get_compatible_pad_template:
861 * @element: (transfer none): a #GstElement to get a compatible pad template for
862 * @compattempl: (transfer none): the #GstPadTemplate to find a compatible
865 * Retrieves a pad template from @element that is compatible with @compattempl.
866 * Pads from compatible templates can be linked together.
868 * Returns: (transfer none): a compatible #GstPadTemplate, or NULL if none
869 * was found. No unreferencing is necessary.
872 gst_element_get_compatible_pad_template (GstElement * element,
873 GstPadTemplate * compattempl)
875 GstPadTemplate *newtempl = NULL;
877 GstElementClass *class;
880 g_return_val_if_fail (element != NULL, NULL);
881 g_return_val_if_fail (GST_IS_ELEMENT (element), NULL);
882 g_return_val_if_fail (compattempl != NULL, NULL);
884 class = GST_ELEMENT_GET_CLASS (element);
886 padlist = gst_element_class_get_pad_template_list (class);
888 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS,
889 "Looking for a suitable pad template in %s out of %d templates...",
890 GST_ELEMENT_NAME (element), g_list_length (padlist));
893 GstPadTemplate *padtempl = (GstPadTemplate *) padlist->data;
897 * Check direction (must be opposite)
900 GST_CAT_LOG (GST_CAT_CAPS,
901 "checking pad template %s", padtempl->name_template);
902 if (padtempl->direction != compattempl->direction) {
903 GST_CAT_DEBUG (GST_CAT_CAPS,
904 "compatible direction: found %s pad template \"%s\"",
905 padtempl->direction == GST_PAD_SRC ? "src" : "sink",
906 padtempl->name_template);
908 GST_CAT_DEBUG (GST_CAT_CAPS,
909 "intersecting %" GST_PTR_FORMAT, GST_PAD_TEMPLATE_CAPS (compattempl));
910 GST_CAT_DEBUG (GST_CAT_CAPS,
911 "..and %" GST_PTR_FORMAT, GST_PAD_TEMPLATE_CAPS (padtempl));
913 compatible = gst_caps_can_intersect (GST_PAD_TEMPLATE_CAPS (compattempl),
914 GST_PAD_TEMPLATE_CAPS (padtempl));
916 GST_CAT_DEBUG (GST_CAT_CAPS, "caps are %scompatible",
917 (compatible ? "" : "not "));
925 padlist = g_list_next (padlist);
928 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS,
929 "Returning new pad template %p", newtempl);
931 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "No compatible pad template found");
937 gst_element_request_pad (GstElement * element, GstPadTemplate * templ,
940 GstPad *newpad = NULL;
941 GstElementClass *oclass;
943 oclass = GST_ELEMENT_GET_CLASS (element);
945 if (oclass->request_new_pad)
946 newpad = (oclass->request_new_pad) (element, templ, name);
949 gst_object_ref (newpad);
957 * gst_element_get_pad_from_template:
958 * @element: (transfer none): a #GstElement.
959 * @templ: (transfer none): a #GstPadTemplate belonging to @element.
961 * Gets a pad from @element described by @templ. If the presence of @templ is
962 * #GST_PAD_REQUEST, requests a new pad. Can return %NULL for #GST_PAD_SOMETIMES
965 * Returns: (transfer full): the #GstPad, or NULL if one could not be found
969 gst_element_get_pad_from_template (GstElement * element, GstPadTemplate * templ)
972 GstPadPresence presence;
974 /* If this function is ever exported, we need check the validity of `element'
975 * and `templ', and to make sure the template actually belongs to the
978 presence = GST_PAD_TEMPLATE_PRESENCE (templ);
982 case GST_PAD_SOMETIMES:
983 ret = gst_element_get_static_pad (element, templ->name_template);
984 if (!ret && presence == GST_PAD_ALWAYS)
986 ("Element %s has an ALWAYS template %s, but no pad of the same name",
987 GST_OBJECT_NAME (element), templ->name_template);
990 case GST_PAD_REQUEST:
991 ret = gst_element_request_pad (element, templ, NULL);
999 * gst_element_request_compatible_pad:
1000 * @element: a #GstElement.
1001 * @templ: the #GstPadTemplate to which the new pad should be able to link.
1003 * Requests a pad from @element. The returned pad should be unlinked and
1004 * compatible with @templ. Might return an existing pad, or request a new one.
1006 * Returns: a #GstPad, or %NULL if one could not be found or created.
1009 gst_element_request_compatible_pad (GstElement * element,
1010 GstPadTemplate * templ)
1012 GstPadTemplate *templ_new;
1015 g_return_val_if_fail (GST_IS_ELEMENT (element), NULL);
1016 g_return_val_if_fail (GST_IS_PAD_TEMPLATE (templ), NULL);
1018 /* FIXME: should really loop through the templates, testing each for
1019 * compatibility and pad availability. */
1020 templ_new = gst_element_get_compatible_pad_template (element, templ);
1022 pad = gst_element_get_pad_from_template (element, templ_new);
1024 /* This can happen for non-request pads. No need to unref. */
1025 if (pad && GST_PAD_PEER (pad))
1032 * Checks if the source pad and the sink pad can be linked.
1033 * Both @srcpad and @sinkpad must be unlinked and have a parent.
1036 gst_pad_check_link (GstPad * srcpad, GstPad * sinkpad)
1038 /* FIXME This function is gross. It's almost a direct copy of
1039 * gst_pad_link_filtered(). Any decent programmer would attempt
1040 * to merge the two functions, which I will do some day. --ds
1043 /* generic checks */
1044 g_return_val_if_fail (GST_IS_PAD (srcpad), FALSE);
1045 g_return_val_if_fail (GST_IS_PAD (sinkpad), FALSE);
1047 GST_CAT_INFO (GST_CAT_PADS, "trying to link %s:%s and %s:%s",
1048 GST_DEBUG_PAD_NAME (srcpad), GST_DEBUG_PAD_NAME (sinkpad));
1050 /* FIXME: shouldn't we convert this to g_return_val_if_fail? */
1051 if (GST_PAD_PEER (srcpad) != NULL) {
1052 GST_CAT_INFO (GST_CAT_PADS, "Source pad %s:%s has a peer, failed",
1053 GST_DEBUG_PAD_NAME (srcpad));
1056 if (GST_PAD_PEER (sinkpad) != NULL) {
1057 GST_CAT_INFO (GST_CAT_PADS, "Sink pad %s:%s has a peer, failed",
1058 GST_DEBUG_PAD_NAME (sinkpad));
1061 if (!GST_PAD_IS_SRC (srcpad)) {
1062 GST_CAT_INFO (GST_CAT_PADS, "Src pad %s:%s is not source pad, failed",
1063 GST_DEBUG_PAD_NAME (srcpad));
1066 if (!GST_PAD_IS_SINK (sinkpad)) {
1067 GST_CAT_INFO (GST_CAT_PADS, "Sink pad %s:%s is not sink pad, failed",
1068 GST_DEBUG_PAD_NAME (sinkpad));
1071 if (GST_PAD_PARENT (srcpad) == NULL) {
1072 GST_CAT_INFO (GST_CAT_PADS, "Src pad %s:%s has no parent, failed",
1073 GST_DEBUG_PAD_NAME (srcpad));
1076 if (GST_PAD_PARENT (sinkpad) == NULL) {
1077 GST_CAT_INFO (GST_CAT_PADS, "Sink pad %s:%s has no parent, failed",
1078 GST_DEBUG_PAD_NAME (srcpad));
1086 * gst_element_get_compatible_pad:
1087 * @element: (transfer none): a #GstElement in which the pad should be found.
1088 * @pad: (transfer none): the #GstPad to find a compatible one for.
1089 * @caps: the #GstCaps to use as a filter.
1091 * Looks for an unlinked pad to which the given pad can link. It is not
1092 * guaranteed that linking the pads will work, though it should work in most
1095 * This function will first attempt to find a compatible unlinked ALWAYS pad,
1096 * and if none can be found, it will request a compatible REQUEST pad by looking
1097 * at the templates of @element.
1099 * Returns: (transfer full): the #GstPad to which a link can be made, or %NULL
1100 * if one cannot be found. gst_object_unref() after usage.
1103 gst_element_get_compatible_pad (GstElement * element, GstPad * pad,
1104 const GstCaps * caps)
1107 GstPadTemplate *templ;
1109 GstPad *foundpad = NULL;
1112 g_return_val_if_fail (GST_IS_ELEMENT (element), NULL);
1113 g_return_val_if_fail (GST_IS_PAD (pad), NULL);
1115 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS,
1116 "finding pad in %s compatible with %s:%s",
1117 GST_ELEMENT_NAME (element), GST_DEBUG_PAD_NAME (pad));
1119 g_return_val_if_fail (GST_PAD_PEER (pad) == NULL, NULL);
1123 /* try to get an existing unlinked pad */
1124 if (GST_PAD_IS_SRC (pad)) {
1125 pads = gst_element_iterate_sink_pads (element);
1126 } else if (GST_PAD_IS_SINK (pad)) {
1127 pads = gst_element_iterate_src_pads (element);
1129 pads = gst_element_iterate_pads (element);
1135 switch (gst_iterator_next (pads, &padptr)) {
1136 case GST_ITERATOR_OK:
1141 current = GST_PAD (padptr);
1143 GST_CAT_LOG (GST_CAT_ELEMENT_PADS, "examining pad %s:%s",
1144 GST_DEBUG_PAD_NAME (current));
1146 peer = gst_pad_get_peer (current);
1148 if (peer == NULL && gst_pad_check_link (pad, current)) {
1149 GstCaps *temp, *intersection;
1150 gboolean compatible;
1152 /* Now check if the two pads' caps are compatible */
1153 temp = gst_pad_get_caps_reffed (pad);
1155 intersection = gst_caps_intersect (temp, caps);
1156 gst_caps_unref (temp);
1158 intersection = temp;
1161 temp = gst_pad_get_caps_reffed (current);
1162 compatible = gst_caps_can_intersect (temp, intersection);
1163 gst_caps_unref (temp);
1164 gst_caps_unref (intersection);
1167 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS,
1168 "found existing unlinked compatible pad %s:%s",
1169 GST_DEBUG_PAD_NAME (current));
1170 gst_iterator_free (pads);
1174 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "incompatible pads");
1177 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS,
1178 "already linked or cannot be linked (peer = %p)", peer);
1180 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "unreffing pads");
1182 gst_object_unref (current);
1184 gst_object_unref (peer);
1187 case GST_ITERATOR_DONE:
1190 case GST_ITERATOR_RESYNC:
1191 gst_iterator_resync (pads);
1193 case GST_ITERATOR_ERROR:
1194 g_assert_not_reached ();
1198 gst_iterator_free (pads);
1200 GST_CAT_DEBUG_OBJECT (GST_CAT_ELEMENT_PADS, element,
1201 "Could not find a compatible unlinked always pad to link to %s:%s, now checking request pads",
1202 GST_DEBUG_PAD_NAME (pad));
1204 /* try to create a new one */
1205 /* requesting is a little crazy, we need a template. Let's create one */
1206 /* FIXME: why not gst_pad_get_pad_template (pad); */
1207 templcaps = gst_pad_get_caps_reffed (pad);
1209 templ = gst_pad_template_new ((gchar *) GST_PAD_NAME (pad),
1210 GST_PAD_DIRECTION (pad), GST_PAD_ALWAYS, templcaps);
1212 foundpad = gst_element_request_compatible_pad (element, templ);
1213 gst_object_unref (templ);
1216 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS,
1217 "found existing request pad %s:%s", GST_DEBUG_PAD_NAME (foundpad));
1221 GST_CAT_INFO_OBJECT (GST_CAT_ELEMENT_PADS, element,
1222 "Could not find a compatible pad to link to %s:%s",
1223 GST_DEBUG_PAD_NAME (pad));
1228 * gst_element_state_get_name:
1229 * @state: a #GstState to get the name of.
1231 * Gets a string representing the given state.
1233 * Returns: (transfer none): a string with the name of the state.
1235 G_CONST_RETURN gchar *
1236 gst_element_state_get_name (GstState state)
1239 #ifdef GST_DEBUG_COLOR
1240 case GST_STATE_VOID_PENDING:
1241 return "VOID_PENDING";
1242 case GST_STATE_NULL:
1243 return "\033[01;34mNULL\033[00m";
1244 case GST_STATE_READY:
1245 return "\033[01;31mREADY\033[00m";
1246 case GST_STATE_PLAYING:
1247 return "\033[01;32mPLAYING\033[00m";
1248 case GST_STATE_PAUSED:
1249 return "\033[01;33mPAUSED\033[00m";
1251 /* This is a memory leak */
1252 return g_strdup_printf ("\033[01;35;41mUNKNOWN!\033[00m(%d)", state);
1254 case GST_STATE_VOID_PENDING:
1255 return "VOID_PENDING";
1256 case GST_STATE_NULL:
1258 case GST_STATE_READY:
1260 case GST_STATE_PLAYING:
1262 case GST_STATE_PAUSED:
1265 /* This is a memory leak */
1266 return g_strdup_printf ("UNKNOWN!(%d)", state);
1272 * gst_element_state_change_return_get_name:
1273 * @state_ret: a #GstStateChangeReturn to get the name of.
1275 * Gets a string representing the given state change result.
1277 * Returns: (transfer none): a string with the name of the state
1282 G_CONST_RETURN gchar *
1283 gst_element_state_change_return_get_name (GstStateChangeReturn state_ret)
1285 switch (state_ret) {
1286 #ifdef GST_DEBUG_COLOR
1287 case GST_STATE_CHANGE_FAILURE:
1288 return "\033[01;31mFAILURE\033[00m";
1289 case GST_STATE_CHANGE_SUCCESS:
1290 return "\033[01;32mSUCCESS\033[00m";
1291 case GST_STATE_CHANGE_ASYNC:
1292 return "\033[01;33mASYNC\033[00m";
1293 case GST_STATE_CHANGE_NO_PREROLL:
1294 return "\033[01;34mNO_PREROLL\033[00m";
1296 /* This is a memory leak */
1297 return g_strdup_printf ("\033[01;35;41mUNKNOWN!\033[00m(%d)", state_ret);
1299 case GST_STATE_CHANGE_FAILURE:
1301 case GST_STATE_CHANGE_SUCCESS:
1303 case GST_STATE_CHANGE_ASYNC:
1305 case GST_STATE_CHANGE_NO_PREROLL:
1306 return "NO PREROLL";
1308 /* This is a memory leak */
1309 return g_strdup_printf ("UNKNOWN!(%d)", state_ret);
1316 * gst_element_factory_can_src_caps:
1317 * @factory: factory to query
1318 * @caps: the caps to check
1320 * Checks if the factory can source the given capability.
1322 * Returns: true if it can src the capabilities
1325 gst_element_factory_can_src_caps (GstElementFactory * factory,
1326 const GstCaps * caps)
1330 g_return_val_if_fail (factory != NULL, FALSE);
1331 g_return_val_if_fail (caps != NULL, FALSE);
1333 templates = factory->staticpadtemplates;
1336 GstStaticPadTemplate *template = (GstStaticPadTemplate *) templates->data;
1338 if (template->direction == GST_PAD_SRC) {
1339 if (gst_caps_is_always_compatible (gst_static_caps_get
1340 (&template->static_caps), caps))
1343 templates = g_list_next (templates);
1350 * gst_element_factory_can_sink_caps:
1351 * @factory: factory to query
1352 * @caps: the caps to check
1354 * Checks if the factory can sink the given capability.
1356 * Returns: true if it can sink the capabilities
1359 gst_element_factory_can_sink_caps (GstElementFactory * factory,
1360 const GstCaps * caps)
1364 g_return_val_if_fail (factory != NULL, FALSE);
1365 g_return_val_if_fail (caps != NULL, FALSE);
1367 templates = factory->staticpadtemplates;
1370 GstStaticPadTemplate *template = (GstStaticPadTemplate *) templates->data;
1372 if (template->direction == GST_PAD_SINK) {
1373 if (gst_caps_is_always_compatible (caps,
1374 gst_static_caps_get (&template->static_caps)))
1377 templates = g_list_next (templates);
1384 /* if return val is true, *direct_child is a caller-owned ref on the direct
1385 * child of ancestor that is part of object's ancestry */
1387 object_has_ancestor (GstObject * object, GstObject * ancestor,
1388 GstObject ** direct_child)
1390 GstObject *child, *parent;
1393 *direct_child = NULL;
1395 child = gst_object_ref (object);
1396 parent = gst_object_get_parent (object);
1399 if (ancestor == parent) {
1401 *direct_child = child;
1403 gst_object_unref (child);
1404 gst_object_unref (parent);
1408 gst_object_unref (child);
1410 parent = gst_object_get_parent (parent);
1413 gst_object_unref (child);
1418 /* caller owns return */
1420 find_common_root (GstObject * o1, GstObject * o2)
1422 GstObject *top = o1;
1423 GstObject *kid1, *kid2;
1424 GstObject *root = NULL;
1426 while (GST_OBJECT_PARENT (top))
1427 top = GST_OBJECT_PARENT (top);
1429 /* the itsy-bitsy spider... */
1431 if (!object_has_ancestor (o2, top, &kid2))
1434 root = gst_object_ref (top);
1436 if (!object_has_ancestor (o1, kid2, &kid1)) {
1437 gst_object_unref (kid2);
1441 if (!object_has_ancestor (o2, kid1, &kid2)) {
1442 gst_object_unref (kid1);
1449 /* caller does not own return */
1451 ghost_up (GstElement * e, GstPad * pad)
1453 static gint ghost_pad_index = 0;
1458 GstObject *parent = GST_OBJECT_PARENT (e);
1460 name = g_strdup_printf ("ghost%d", ghost_pad_index++);
1461 gpad = gst_ghost_pad_new (name, pad);
1465 gst_element_get_state (e, ¤t, &next, 0);
1467 if (current > GST_STATE_READY || next == GST_STATE_PAUSED)
1468 gst_pad_set_active (gpad, TRUE);
1470 if (!gst_element_add_pad ((GstElement *) parent, gpad)) {
1471 g_warning ("Pad named %s already exists in element %s\n",
1472 GST_OBJECT_NAME (gpad), GST_OBJECT_NAME (parent));
1473 gst_object_unref ((GstObject *) gpad);
1474 GST_STATE_UNLOCK (e);
1477 GST_STATE_UNLOCK (e);
1483 remove_pad (gpointer ppad, gpointer unused)
1487 if (!gst_element_remove_pad ((GstElement *) GST_OBJECT_PARENT (pad), pad))
1488 g_warning ("Couldn't remove pad %s from element %s",
1489 GST_OBJECT_NAME (pad), GST_OBJECT_NAME (GST_OBJECT_PARENT (pad)));
1493 prepare_link_maybe_ghosting (GstPad ** src, GstPad ** sink,
1494 GSList ** pads_created)
1498 GSList *pads_created_local = NULL;
1500 g_assert (pads_created);
1502 e1 = GST_OBJECT_PARENT (*src);
1503 e2 = GST_OBJECT_PARENT (*sink);
1505 if (G_UNLIKELY (e1 == NULL)) {
1506 GST_WARNING ("Trying to ghost a pad that doesn't have a parent: %"
1507 GST_PTR_FORMAT, *src);
1510 if (G_UNLIKELY (e2 == NULL)) {
1511 GST_WARNING ("Trying to ghost a pad that doesn't have a parent: %"
1512 GST_PTR_FORMAT, *sink);
1516 if (GST_OBJECT_PARENT (e1) == GST_OBJECT_PARENT (e2)) {
1517 GST_CAT_INFO (GST_CAT_PADS, "%s and %s in same bin, no need for ghost pads",
1518 GST_OBJECT_NAME (e1), GST_OBJECT_NAME (e2));
1522 GST_CAT_INFO (GST_CAT_PADS, "%s and %s not in same bin, making ghost pads",
1523 GST_OBJECT_NAME (e1), GST_OBJECT_NAME (e2));
1525 /* we need to setup some ghost pads */
1526 root = find_common_root (e1, e2);
1528 g_warning ("Trying to connect elements that don't share a common "
1529 "ancestor: %s and %s", GST_ELEMENT_NAME (e1), GST_ELEMENT_NAME (e2));
1533 while (GST_OBJECT_PARENT (e1) != root) {
1534 *src = ghost_up ((GstElement *) e1, *src);
1537 e1 = GST_OBJECT_PARENT (*src);
1538 pads_created_local = g_slist_prepend (pads_created_local, *src);
1540 while (GST_OBJECT_PARENT (e2) != root) {
1541 *sink = ghost_up ((GstElement *) e2, *sink);
1544 e2 = GST_OBJECT_PARENT (*sink);
1545 pads_created_local = g_slist_prepend (pads_created_local, *sink);
1548 gst_object_unref (root);
1549 *pads_created = g_slist_concat (*pads_created, pads_created_local);
1553 gst_object_unref (root);
1554 g_slist_foreach (pads_created_local, remove_pad, NULL);
1555 g_slist_free (pads_created_local);
1560 pad_link_maybe_ghosting (GstPad * src, GstPad * sink, GstPadLinkCheck flags)
1562 GSList *pads_created = NULL;
1565 if (!prepare_link_maybe_ghosting (&src, &sink, &pads_created)) {
1568 ret = (gst_pad_link_full (src, sink, flags) == GST_PAD_LINK_OK);
1572 g_slist_foreach (pads_created, remove_pad, NULL);
1574 g_slist_free (pads_created);
1580 * gst_element_link_pads_full:
1581 * @src: a #GstElement containing the source pad.
1582 * @srcpadname: (allow-none): the name of the #GstPad in source element
1583 * or NULL for any pad.
1584 * @dest: (transfer none): the #GstElement containing the destination pad.
1585 * @destpadname: (allow-none): the name of the #GstPad in destination element,
1586 * or NULL for any pad.
1587 * @flags: the #GstPadLinkCheck to be performed when linking pads.
1589 * Links the two named pads of the source and destination elements.
1590 * Side effect is that if one of the pads has no parent, it becomes a
1591 * child of the parent of the other element. If they have different
1592 * parents, the link fails.
1594 * Calling gst_element_link_pads_full() with @flags == %GST_PAD_LINK_CHECK_DEFAULT
1595 * is the same as calling gst_element_link_pads() and the recommended way of
1596 * linking pads with safety checks applied.
1598 * Returns: TRUE if the pads could be linked, FALSE otherwise.
1603 gst_element_link_pads_full (GstElement * src, const gchar * srcpadname,
1604 GstElement * dest, const gchar * destpadname, GstPadLinkCheck flags)
1606 const GList *srcpads, *destpads, *srctempls, *desttempls, *l;
1607 GstPad *srcpad, *destpad;
1608 GstPadTemplate *srctempl, *desttempl;
1609 GstElementClass *srcclass, *destclass;
1612 g_return_val_if_fail (GST_IS_ELEMENT (src), FALSE);
1613 g_return_val_if_fail (GST_IS_ELEMENT (dest), FALSE);
1615 GST_CAT_INFO (GST_CAT_ELEMENT_PADS,
1616 "trying to link element %s:%s to element %s:%s", GST_ELEMENT_NAME (src),
1617 srcpadname ? srcpadname : "(any)", GST_ELEMENT_NAME (dest),
1618 destpadname ? destpadname : "(any)");
1622 /* name specified, look it up */
1623 if (!(srcpad = gst_element_get_static_pad (src, srcpadname)))
1624 srcpad = gst_element_get_request_pad (src, srcpadname);
1626 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "no pad %s:%s",
1627 GST_ELEMENT_NAME (src), srcpadname);
1630 if (!(GST_PAD_DIRECTION (srcpad) == GST_PAD_SRC)) {
1631 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "pad %s:%s is no src pad",
1632 GST_DEBUG_PAD_NAME (srcpad));
1633 gst_object_unref (srcpad);
1636 if (GST_PAD_PEER (srcpad) != NULL) {
1637 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "pad %s:%s is already linked",
1638 GST_DEBUG_PAD_NAME (srcpad));
1639 gst_object_unref (srcpad);
1645 /* no name given, get the first available pad */
1646 GST_OBJECT_LOCK (src);
1647 srcpads = GST_ELEMENT_PADS (src);
1648 srcpad = srcpads ? GST_PAD_CAST (srcpads->data) : NULL;
1650 gst_object_ref (srcpad);
1651 GST_OBJECT_UNLOCK (src);
1654 /* get a destination pad */
1656 /* name specified, look it up */
1657 if (!(destpad = gst_element_get_static_pad (dest, destpadname)))
1658 destpad = gst_element_get_request_pad (dest, destpadname);
1660 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "no pad %s:%s",
1661 GST_ELEMENT_NAME (dest), destpadname);
1664 if (!(GST_PAD_DIRECTION (destpad) == GST_PAD_SINK)) {
1665 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "pad %s:%s is no sink pad",
1666 GST_DEBUG_PAD_NAME (destpad));
1667 gst_object_unref (destpad);
1670 if (GST_PAD_PEER (destpad) != NULL) {
1671 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "pad %s:%s is already linked",
1672 GST_DEBUG_PAD_NAME (destpad));
1673 gst_object_unref (destpad);
1679 /* no name given, get the first available pad */
1680 GST_OBJECT_LOCK (dest);
1681 destpads = GST_ELEMENT_PADS (dest);
1682 destpad = destpads ? GST_PAD_CAST (destpads->data) : NULL;
1684 gst_object_ref (destpad);
1685 GST_OBJECT_UNLOCK (dest);
1688 if (srcpadname && destpadname) {
1691 /* two explicitly specified pads */
1692 result = pad_link_maybe_ghosting (srcpad, destpad, flags);
1694 gst_object_unref (srcpad);
1695 gst_object_unref (destpad);
1701 /* loop through the allowed pads in the source, trying to find a
1702 * compatible destination pad */
1703 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS,
1704 "looping through allowed src and dest pads");
1706 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "trying src pad %s:%s",
1707 GST_DEBUG_PAD_NAME (srcpad));
1708 if ((GST_PAD_DIRECTION (srcpad) == GST_PAD_SRC) &&
1709 (GST_PAD_PEER (srcpad) == NULL)) {
1714 gst_object_ref (temp);
1716 temp = gst_element_get_compatible_pad (dest, srcpad, NULL);
1719 if (temp && pad_link_maybe_ghosting (srcpad, temp, flags)) {
1720 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "linked pad %s:%s to pad %s:%s",
1721 GST_DEBUG_PAD_NAME (srcpad), GST_DEBUG_PAD_NAME (temp));
1723 gst_object_unref (destpad);
1724 gst_object_unref (srcpad);
1725 gst_object_unref (temp);
1730 gst_object_unref (temp);
1733 /* find a better way for this mess */
1735 srcpads = g_list_next (srcpads);
1737 gst_object_unref (srcpad);
1738 srcpad = GST_PAD_CAST (srcpads->data);
1739 gst_object_ref (srcpad);
1745 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "no link possible from %s:%s to %s",
1746 GST_DEBUG_PAD_NAME (srcpad), GST_ELEMENT_NAME (dest));
1748 gst_object_unref (destpad);
1752 gst_object_unref (srcpad);
1756 /* loop through the existing pads in the destination */
1758 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "trying dest pad %s:%s",
1759 GST_DEBUG_PAD_NAME (destpad));
1760 if ((GST_PAD_DIRECTION (destpad) == GST_PAD_SINK) &&
1761 (GST_PAD_PEER (destpad) == NULL)) {
1762 GstPad *temp = gst_element_get_compatible_pad (src, destpad, NULL);
1764 if (temp && pad_link_maybe_ghosting (temp, destpad, flags)) {
1765 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "linked pad %s:%s to pad %s:%s",
1766 GST_DEBUG_PAD_NAME (temp), GST_DEBUG_PAD_NAME (destpad));
1767 gst_object_unref (temp);
1768 gst_object_unref (destpad);
1772 gst_object_unref (temp);
1776 destpads = g_list_next (destpads);
1778 gst_object_unref (destpad);
1779 destpad = GST_PAD_CAST (destpads->data);
1780 gst_object_ref (destpad);
1787 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "no link possible from %s to %s:%s",
1788 GST_ELEMENT_NAME (src), GST_DEBUG_PAD_NAME (destpad));
1789 gst_object_unref (destpad);
1793 gst_object_unref (destpad);
1797 srcclass = GST_ELEMENT_GET_CLASS (src);
1798 destclass = GST_ELEMENT_GET_CLASS (dest);
1800 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS,
1801 "we might have request pads on both sides, checking...");
1802 srctempls = gst_element_class_get_pad_template_list (srcclass);
1803 desttempls = gst_element_class_get_pad_template_list (destclass);
1805 if (srctempls && desttempls) {
1807 srctempl = (GstPadTemplate *) srctempls->data;
1808 if (srctempl->presence == GST_PAD_REQUEST) {
1809 for (l = desttempls; l; l = l->next) {
1810 desttempl = (GstPadTemplate *) l->data;
1811 if (desttempl->presence == GST_PAD_REQUEST &&
1812 desttempl->direction != srctempl->direction) {
1813 if (gst_caps_is_always_compatible (gst_pad_template_get_caps
1814 (srctempl), gst_pad_template_get_caps (desttempl))) {
1816 gst_element_get_request_pad (src, srctempl->name_template);
1818 gst_element_get_request_pad (dest, desttempl->name_template);
1819 if (srcpad && destpad
1820 && pad_link_maybe_ghosting (srcpad, destpad, flags)) {
1821 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS,
1822 "linked pad %s:%s to pad %s:%s",
1823 GST_DEBUG_PAD_NAME (srcpad), GST_DEBUG_PAD_NAME (destpad));
1824 gst_object_unref (srcpad);
1825 gst_object_unref (destpad);
1828 /* it failed, so we release the request pads */
1830 gst_element_release_request_pad (src, srcpad);
1832 gst_element_release_request_pad (dest, destpad);
1837 srctempls = srctempls->next;
1841 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "no link possible from %s to %s",
1842 GST_ELEMENT_NAME (src), GST_ELEMENT_NAME (dest));
1847 * gst_element_link_pads:
1848 * @src: a #GstElement containing the source pad.
1849 * @srcpadname: (allow-none): the name of the #GstPad in source element
1850 * or NULL for any pad.
1851 * @dest: (transfer none): the #GstElement containing the destination pad.
1852 * @destpadname: (allow-none): the name of the #GstPad in destination element,
1853 * or NULL for any pad.
1855 * Links the two named pads of the source and destination elements.
1856 * Side effect is that if one of the pads has no parent, it becomes a
1857 * child of the parent of the other element. If they have different
1858 * parents, the link fails.
1860 * Returns: TRUE if the pads could be linked, FALSE otherwise.
1863 gst_element_link_pads (GstElement * src, const gchar * srcpadname,
1864 GstElement * dest, const gchar * destpadname)
1866 return gst_element_link_pads_full (src, srcpadname, dest, destpadname,
1867 GST_PAD_LINK_CHECK_DEFAULT);
1871 * gst_element_link_pads_filtered:
1872 * @src: a #GstElement containing the source pad.
1873 * @srcpadname: (allow-none): the name of the #GstPad in source element
1874 * or NULL for any pad.
1875 * @dest: (transfer none): the #GstElement containing the destination pad.
1876 * @destpadname: (allow-none): the name of the #GstPad in destination element
1877 * or NULL for any pad.
1878 * @filter: (transfer none) (allow-none): the #GstCaps to filter the link,
1879 * or #NULL for no filter.
1881 * Links the two named pads of the source and destination elements. Side effect
1882 * is that if one of the pads has no parent, it becomes a child of the parent of
1883 * the other element. If they have different parents, the link fails. If @caps
1884 * is not #NULL, makes sure that the caps of the link is a subset of @caps.
1886 * Returns: TRUE if the pads could be linked, FALSE otherwise.
1889 gst_element_link_pads_filtered (GstElement * src, const gchar * srcpadname,
1890 GstElement * dest, const gchar * destpadname, GstCaps * filter)
1893 g_return_val_if_fail (GST_IS_ELEMENT (src), FALSE);
1894 g_return_val_if_fail (GST_IS_ELEMENT (dest), FALSE);
1895 g_return_val_if_fail (filter == NULL || GST_IS_CAPS (filter), FALSE);
1898 GstElement *capsfilter;
1900 GstState state, pending;
1903 capsfilter = gst_element_factory_make ("capsfilter", NULL);
1905 GST_ERROR ("Could not make a capsfilter");
1909 parent = gst_object_get_parent (GST_OBJECT (src));
1910 g_return_val_if_fail (GST_IS_BIN (parent), FALSE);
1912 gst_element_get_state (GST_ELEMENT_CAST (parent), &state, &pending, 0);
1914 if (!gst_bin_add (GST_BIN (parent), capsfilter)) {
1915 GST_ERROR ("Could not add capsfilter");
1916 gst_object_unref (capsfilter);
1917 gst_object_unref (parent);
1921 if (pending != GST_STATE_VOID_PENDING)
1924 gst_element_set_state (capsfilter, state);
1926 gst_object_unref (parent);
1928 g_object_set (capsfilter, "caps", filter, NULL);
1930 lr1 = gst_element_link_pads (src, srcpadname, capsfilter, "sink");
1931 lr2 = gst_element_link_pads (capsfilter, "src", dest, destpadname);
1936 GST_INFO ("Could not link pads: %s:%s - capsfilter:sink",
1937 GST_ELEMENT_NAME (src), srcpadname);
1939 GST_INFO ("Could not link pads: capsfilter:src - %s:%s",
1940 GST_ELEMENT_NAME (dest), destpadname);
1942 gst_element_set_state (capsfilter, GST_STATE_NULL);
1943 /* this will unlink and unref as appropriate */
1944 gst_bin_remove (GST_BIN (GST_OBJECT_PARENT (capsfilter)), capsfilter);
1948 if (gst_element_link_pads (src, srcpadname, dest, destpadname)) {
1951 GST_INFO ("Could not link pads: %s:%s - %s:%s", GST_ELEMENT_NAME (src),
1952 srcpadname, GST_ELEMENT_NAME (dest), destpadname);
1960 * @src: (transfer none): a #GstElement containing the source pad.
1961 * @dest: (transfer none): the #GstElement containing the destination pad.
1963 * Links @src to @dest. The link must be from source to
1964 * destination; the other direction will not be tried. The function looks for
1965 * existing pads that aren't linked yet. It will request new pads if necessary.
1966 * Such pads need to be released manualy when unlinking.
1967 * If multiple links are possible, only one is established.
1969 * Make sure you have added your elements to a bin or pipeline with
1970 * gst_bin_add() before trying to link them.
1972 * Returns: TRUE if the elements could be linked, FALSE otherwise.
1975 gst_element_link (GstElement * src, GstElement * dest)
1977 return gst_element_link_pads (src, NULL, dest, NULL);
1981 * gst_element_link_many:
1982 * @element_1: (transfer none): the first #GstElement in the link chain.
1983 * @element_2: (transfer none): the second #GstElement in the link chain.
1984 * @...: the NULL-terminated list of elements to link in order.
1986 * Chain together a series of elements. Uses gst_element_link().
1987 * Make sure you have added your elements to a bin or pipeline with
1988 * gst_bin_add() before trying to link them.
1990 * Returns: TRUE on success, FALSE otherwise.
1993 gst_element_link_many (GstElement * element_1, GstElement * element_2, ...)
1995 gboolean res = TRUE;
1998 g_return_val_if_fail (GST_IS_ELEMENT (element_1), FALSE);
1999 g_return_val_if_fail (GST_IS_ELEMENT (element_2), FALSE);
2001 va_start (args, element_2);
2004 if (!gst_element_link (element_1, element_2)) {
2009 element_1 = element_2;
2010 element_2 = va_arg (args, GstElement *);
2019 * gst_element_link_filtered:
2020 * @src: a #GstElement containing the source pad.
2021 * @dest: (transfer none): the #GstElement containing the destination pad.
2022 * @filter: (transfer none) (allow-none): the #GstCaps to filter the link,
2023 * or #NULL for no filter.
2025 * Links @src to @dest using the given caps as filtercaps.
2026 * The link must be from source to
2027 * destination; the other direction will not be tried. The function looks for
2028 * existing pads that aren't linked yet. It will request new pads if necessary.
2029 * If multiple links are possible, only one is established.
2031 * Make sure you have added your elements to a bin or pipeline with
2032 * gst_bin_add() before trying to link them.
2034 * Returns: TRUE if the pads could be linked, FALSE otherwise.
2037 gst_element_link_filtered (GstElement * src, GstElement * dest,
2040 return gst_element_link_pads_filtered (src, NULL, dest, NULL, filter);
2044 * gst_element_unlink_pads:
2045 * @src: a (transfer none): #GstElement containing the source pad.
2046 * @srcpadname: the name of the #GstPad in source element.
2047 * @dest: (transfer none): a #GstElement containing the destination pad.
2048 * @destpadname: the name of the #GstPad in destination element.
2050 * Unlinks the two named pads of the source and destination elements.
2053 gst_element_unlink_pads (GstElement * src, const gchar * srcpadname,
2054 GstElement * dest, const gchar * destpadname)
2056 GstPad *srcpad, *destpad;
2057 gboolean srcrequest, destrequest;
2059 srcrequest = destrequest = FALSE;
2061 g_return_if_fail (src != NULL);
2062 g_return_if_fail (GST_IS_ELEMENT (src));
2063 g_return_if_fail (srcpadname != NULL);
2064 g_return_if_fail (dest != NULL);
2065 g_return_if_fail (GST_IS_ELEMENT (dest));
2066 g_return_if_fail (destpadname != NULL);
2068 /* obtain the pads requested */
2069 if (!(srcpad = gst_element_get_static_pad (src, srcpadname)))
2070 if ((srcpad = gst_element_get_request_pad (src, srcpadname)))
2072 if (srcpad == NULL) {
2073 GST_WARNING_OBJECT (src, "source element has no pad \"%s\"", srcpadname);
2076 if (!(destpad = gst_element_get_static_pad (dest, destpadname)))
2077 if ((destpad = gst_element_get_request_pad (dest, destpadname)))
2079 if (destpad == NULL) {
2080 GST_WARNING_OBJECT (dest, "destination element has no pad \"%s\"",
2085 /* we're satisified they can be unlinked, let's do it */
2086 gst_pad_unlink (srcpad, destpad);
2089 gst_element_release_request_pad (dest, destpad);
2090 gst_object_unref (destpad);
2094 gst_element_release_request_pad (src, srcpad);
2095 gst_object_unref (srcpad);
2099 * gst_element_unlink_many:
2100 * @element_1: (transfer none): the first #GstElement in the link chain.
2101 * @element_2: (transfer none): the second #GstElement in the link chain.
2102 * @...: the NULL-terminated list of elements to unlink in order.
2104 * Unlinks a series of elements. Uses gst_element_unlink().
2107 gst_element_unlink_many (GstElement * element_1, GstElement * element_2, ...)
2111 g_return_if_fail (element_1 != NULL && element_2 != NULL);
2112 g_return_if_fail (GST_IS_ELEMENT (element_1) && GST_IS_ELEMENT (element_2));
2114 va_start (args, element_2);
2117 gst_element_unlink (element_1, element_2);
2119 element_1 = element_2;
2120 element_2 = va_arg (args, GstElement *);
2127 * gst_element_unlink:
2128 * @src: (transfer none): the source #GstElement to unlink.
2129 * @dest: (transfer none): the sink #GstElement to unlink.
2131 * Unlinks all source pads of the source element with all sink pads
2132 * of the sink element to which they are linked.
2134 * If the link has been made using gst_element_link(), it could have created an
2135 * requestpad, which has to be released using gst_element_release_request_pad().
2138 gst_element_unlink (GstElement * src, GstElement * dest)
2141 gboolean done = FALSE;
2143 g_return_if_fail (GST_IS_ELEMENT (src));
2144 g_return_if_fail (GST_IS_ELEMENT (dest));
2146 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS, "unlinking \"%s\" and \"%s\"",
2147 GST_ELEMENT_NAME (src), GST_ELEMENT_NAME (dest));
2149 pads = gst_element_iterate_pads (src);
2153 switch (gst_iterator_next (pads, &data)) {
2154 case GST_ITERATOR_OK:
2156 GstPad *pad = GST_PAD_CAST (data);
2158 if (GST_PAD_IS_SRC (pad)) {
2159 GstPad *peerpad = gst_pad_get_peer (pad);
2161 /* see if the pad is linked and is really a pad of dest */
2163 GstElement *peerelem;
2165 peerelem = gst_pad_get_parent_element (peerpad);
2167 if (peerelem == dest) {
2168 gst_pad_unlink (pad, peerpad);
2171 gst_object_unref (peerelem);
2173 gst_object_unref (peerpad);
2176 gst_object_unref (pad);
2179 case GST_ITERATOR_RESYNC:
2180 gst_iterator_resync (pads);
2182 case GST_ITERATOR_DONE:
2186 g_assert_not_reached ();
2190 gst_iterator_free (pads);
2194 * gst_element_query_position:
2195 * @element: a #GstElement to invoke the position query on.
2196 * @format: (inout): a pointer to the #GstFormat asked for.
2197 * On return contains the #GstFormat used.
2198 * @cur: (out) (allow-none): a location in which to store the current
2199 * position, or NULL.
2201 * Queries an element for the stream position.
2203 * Returns: TRUE if the query could be performed.
2206 gst_element_query_position (GstElement * element, GstFormat * format,
2212 g_return_val_if_fail (GST_IS_ELEMENT (element), FALSE);
2213 g_return_val_if_fail (format != NULL, FALSE);
2215 query = gst_query_new_position (*format);
2216 ret = gst_element_query (element, query);
2219 gst_query_parse_position (query, format, cur);
2221 gst_query_unref (query);
2227 * gst_element_query_duration:
2228 * @element: a #GstElement to invoke the duration query on.
2229 * @format: (inout): a pointer to the #GstFormat asked for.
2230 * On return contains the #GstFormat used.
2231 * @duration: (out): A location in which to store the total duration, or NULL.
2233 * Queries an element for the total stream duration.
2235 * Returns: TRUE if the query could be performed.
2238 gst_element_query_duration (GstElement * element, GstFormat * format,
2244 g_return_val_if_fail (GST_IS_ELEMENT (element), FALSE);
2245 g_return_val_if_fail (format != NULL, FALSE);
2247 query = gst_query_new_duration (*format);
2248 ret = gst_element_query (element, query);
2251 gst_query_parse_duration (query, format, duration);
2253 gst_query_unref (query);
2259 * gst_element_query_convert:
2260 * @element: a #GstElement to invoke the convert query on.
2261 * @src_format: (inout): a #GstFormat to convert from.
2262 * @src_val: a value to convert.
2263 * @dest_format: (inout): a pointer to the #GstFormat to convert to.
2264 * @dest_val: (out): a pointer to the result.
2266 * Queries an element to convert @src_val in @src_format to @dest_format.
2268 * Returns: TRUE if the query could be performed.
2271 gst_element_query_convert (GstElement * element, GstFormat src_format,
2272 gint64 src_val, GstFormat * dest_format, gint64 * dest_val)
2277 g_return_val_if_fail (GST_IS_ELEMENT (element), FALSE);
2278 g_return_val_if_fail (dest_format != NULL, FALSE);
2279 g_return_val_if_fail (dest_val != NULL, FALSE);
2281 if (*dest_format == src_format || src_val == -1) {
2282 *dest_val = src_val;
2286 query = gst_query_new_convert (src_format, src_val, *dest_format);
2287 ret = gst_element_query (element, query);
2290 gst_query_parse_convert (query, NULL, NULL, dest_format, dest_val);
2292 gst_query_unref (query);
2298 * gst_element_seek_simple
2299 * @element: a #GstElement to seek on
2300 * @format: a #GstFormat to execute the seek in, such as #GST_FORMAT_TIME
2301 * @seek_flags: seek options; playback applications will usually want to use
2302 * GST_SEEK_FLAG_FLUSH | GST_SEEK_FLAG_KEY_UNIT here
2303 * @seek_pos: position to seek to (relative to the start); if you are doing
2304 * a seek in #GST_FORMAT_TIME this value is in nanoseconds -
2305 * multiply with #GST_SECOND to convert seconds to nanoseconds or
2306 * with #GST_MSECOND to convert milliseconds to nanoseconds.
2308 * Simple API to perform a seek on the given element, meaning it just seeks
2309 * to the given position relative to the start of the stream. For more complex
2310 * operations like segment seeks (e.g. for looping) or changing the playback
2311 * rate or seeking relative to the last configured playback segment you should
2312 * use gst_element_seek().
2314 * In a completely prerolled PAUSED or PLAYING pipeline, seeking is always
2315 * guaranteed to return %TRUE on a seekable media type or %FALSE when the media
2316 * type is certainly not seekable (such as a live stream).
2318 * Some elements allow for seeking in the READY state, in this
2319 * case they will store the seek event and execute it when they are put to
2320 * PAUSED. If the element supports seek in READY, it will always return %TRUE when
2321 * it receives the event in the READY state.
2323 * Returns: %TRUE if the seek operation succeeded (the seek might not always be
2324 * executed instantly though)
2329 gst_element_seek_simple (GstElement * element, GstFormat format,
2330 GstSeekFlags seek_flags, gint64 seek_pos)
2332 g_return_val_if_fail (GST_IS_ELEMENT (element), FALSE);
2333 g_return_val_if_fail (seek_pos >= 0, FALSE);
2335 return gst_element_seek (element, 1.0, format, seek_flags,
2336 GST_SEEK_TYPE_SET, seek_pos, GST_SEEK_TYPE_NONE, 0);
2340 * gst_pad_use_fixed_caps:
2341 * @pad: the pad to use
2343 * A helper function you can use that sets the
2344 * @gst_pad_get_fixed_caps_func as the getcaps function for the
2345 * pad. This way the function will always return the negotiated caps
2346 * or in case the pad is not negotiated, the padtemplate caps.
2348 * Use this function on a pad that, once gst_pad_set_caps() has been called
2349 * on it, cannot be renegotiated to something else.
2352 gst_pad_use_fixed_caps (GstPad * pad)
2354 gst_pad_set_getcaps_function (pad, gst_pad_get_fixed_caps_func);
2358 * gst_pad_get_fixed_caps_func:
2359 * @pad: the pad to use
2361 * A helper function you can use as a GetCaps function that
2362 * will return the currently negotiated caps or the padtemplate
2365 * Free-function: gst_caps_unref
2367 * Returns: (transfer full): the currently negotiated caps or the padtemplate.
2370 gst_pad_get_fixed_caps_func (GstPad * pad)
2374 g_return_val_if_fail (GST_IS_PAD (pad), NULL);
2376 GST_OBJECT_LOCK (pad);
2377 if (GST_PAD_CAPS (pad)) {
2378 result = GST_PAD_CAPS (pad);
2380 GST_CAT_DEBUG (GST_CAT_CAPS,
2381 "using pad caps %p %" GST_PTR_FORMAT, result, result);
2383 result = gst_caps_ref (result);
2384 } else if (GST_PAD_PAD_TEMPLATE (pad)) {
2385 GstPadTemplate *templ = GST_PAD_PAD_TEMPLATE (pad);
2387 result = GST_PAD_TEMPLATE_CAPS (templ);
2388 GST_CAT_DEBUG (GST_CAT_CAPS,
2389 "using pad template %p with caps %p %" GST_PTR_FORMAT, templ, result,
2392 result = gst_caps_ref (result);
2394 GST_CAT_DEBUG (GST_CAT_CAPS, "pad has no caps");
2395 result = gst_caps_new_empty ();
2397 GST_OBJECT_UNLOCK (pad);
2403 * gst_pad_get_parent_element:
2406 * Gets the parent of @pad, cast to a #GstElement. If a @pad has no parent or
2407 * its parent is not an element, return NULL.
2409 * Returns: (transfer full): the parent of the pad. The caller has a
2410 * reference on the parent, so unref when you're finished with it.
2415 gst_pad_get_parent_element (GstPad * pad)
2419 g_return_val_if_fail (GST_IS_PAD (pad), NULL);
2421 p = gst_object_get_parent (GST_OBJECT_CAST (pad));
2423 if (p && !GST_IS_ELEMENT (p)) {
2424 gst_object_unref (p);
2427 return GST_ELEMENT_CAST (p);
2431 * gst_object_default_error:
2432 * @source: the #GstObject that initiated the error.
2433 * @error: (in): the GError.
2434 * @debug: (in) (allow-none): an additional debug information string, or NULL
2436 * A default error function.
2438 * The default handler will simply print the error string using g_print.
2441 gst_object_default_error (GstObject * source, GError * error, gchar * debug)
2443 gchar *name = gst_object_get_path_string (source);
2445 g_print (_("ERROR: from element %s: %s\n"), name, error->message);
2447 g_print (_("Additional debug info:\n%s\n"), debug);
2455 * @element_1: (transfer full): the #GstElement element to add to the bin
2456 * @...: (transfer full): additional elements to add to the bin
2458 * Adds a NULL-terminated list of elements to a bin. This function is
2459 * equivalent to calling gst_bin_add() for each member of the list. The return
2460 * value of each gst_bin_add() is ignored.
2463 gst_bin_add_many (GstBin * bin, GstElement * element_1, ...)
2467 g_return_if_fail (GST_IS_BIN (bin));
2468 g_return_if_fail (GST_IS_ELEMENT (element_1));
2470 va_start (args, element_1);
2473 gst_bin_add (bin, element_1);
2475 element_1 = va_arg (args, GstElement *);
2482 * gst_bin_remove_many:
2484 * @element_1: (transfer none): the first #GstElement to remove from the bin
2485 * @...: (transfer none): NULL-terminated list of elements to remove from the bin
2487 * Remove a list of elements from a bin. This function is equivalent
2488 * to calling gst_bin_remove() with each member of the list.
2491 gst_bin_remove_many (GstBin * bin, GstElement * element_1, ...)
2495 g_return_if_fail (GST_IS_BIN (bin));
2496 g_return_if_fail (GST_IS_ELEMENT (element_1));
2498 va_start (args, element_1);
2501 gst_bin_remove (bin, element_1);
2503 element_1 = va_arg (args, GstElement *);
2510 gst_element_populate_std_props (GObjectClass * klass, const gchar * prop_name,
2511 guint arg_id, GParamFlags flags)
2513 GQuark prop_id = g_quark_from_string (prop_name);
2516 static GQuark fd_id = 0;
2517 static GQuark blocksize_id;
2518 static GQuark bytesperread_id;
2519 static GQuark dump_id;
2520 static GQuark filesize_id;
2521 static GQuark mmapsize_id;
2522 static GQuark location_id;
2523 static GQuark offset_id;
2524 static GQuark silent_id;
2525 static GQuark touch_id;
2527 flags |= G_PARAM_STATIC_STRINGS;
2530 fd_id = g_quark_from_static_string ("fd");
2531 blocksize_id = g_quark_from_static_string ("blocksize");
2532 bytesperread_id = g_quark_from_static_string ("bytesperread");
2533 dump_id = g_quark_from_static_string ("dump");
2534 filesize_id = g_quark_from_static_string ("filesize");
2535 mmapsize_id = g_quark_from_static_string ("mmapsize");
2536 location_id = g_quark_from_static_string ("location");
2537 offset_id = g_quark_from_static_string ("offset");
2538 silent_id = g_quark_from_static_string ("silent");
2539 touch_id = g_quark_from_static_string ("touch");
2542 if (prop_id == fd_id) {
2543 pspec = g_param_spec_int ("fd", "File-descriptor",
2544 "File-descriptor for the file being read", 0, G_MAXINT, 0, flags);
2545 } else if (prop_id == blocksize_id) {
2546 pspec = g_param_spec_ulong ("blocksize", "Block Size",
2547 "Block size to read per buffer", 0, G_MAXULONG, 4096, flags);
2549 } else if (prop_id == bytesperread_id) {
2550 pspec = g_param_spec_int ("bytesperread", "Bytes per read",
2551 "Number of bytes to read per buffer", G_MININT, G_MAXINT, 0, flags);
2553 } else if (prop_id == dump_id) {
2554 pspec = g_param_spec_boolean ("dump", "Dump",
2555 "Dump bytes to stdout", FALSE, flags);
2557 } else if (prop_id == filesize_id) {
2558 pspec = g_param_spec_int64 ("filesize", "File Size",
2559 "Size of the file being read", 0, G_MAXINT64, 0, flags);
2561 } else if (prop_id == mmapsize_id) {
2562 pspec = g_param_spec_ulong ("mmapsize", "mmap() Block Size",
2563 "Size in bytes of mmap()d regions", 0, G_MAXULONG, 4 * 1048576, flags);
2565 } else if (prop_id == location_id) {
2566 pspec = g_param_spec_string ("location", "File Location",
2567 "Location of the file to read", NULL, flags);
2569 } else if (prop_id == offset_id) {
2570 pspec = g_param_spec_int64 ("offset", "File Offset",
2571 "Byte offset of current read pointer", 0, G_MAXINT64, 0, flags);
2573 } else if (prop_id == silent_id) {
2574 pspec = g_param_spec_boolean ("silent", "Silent", "Don't produce events",
2577 } else if (prop_id == touch_id) {
2578 pspec = g_param_spec_boolean ("touch", "Touch read data",
2579 "Touch data to force disk read before " "push ()", TRUE, flags);
2581 g_warning ("Unknown - 'standard' property '%s' id %d from klass %s",
2582 prop_name, arg_id, g_type_name (G_OBJECT_CLASS_TYPE (klass)));
2587 g_object_class_install_property (klass, arg_id, pspec);
2592 * gst_element_class_install_std_props:
2593 * @klass: the #GstElementClass to add the properties to.
2594 * @first_name: the name of the first property.
2595 * in a NULL terminated
2596 * @...: the id and flags of the first property, followed by
2597 * further 'name', 'id', 'flags' triplets and terminated by NULL.
2599 * Adds a list of standardized properties with types to the @klass.
2600 * the id is for the property switch in your get_prop method, and
2601 * the flags determine readability / writeability.
2604 gst_element_class_install_std_props (GstElementClass * klass,
2605 const gchar * first_name, ...)
2611 g_return_if_fail (GST_IS_ELEMENT_CLASS (klass));
2613 va_start (args, first_name);
2618 int arg_id = va_arg (args, int);
2619 int flags = va_arg (args, int);
2621 gst_element_populate_std_props ((GObjectClass *) klass, name, arg_id,
2624 name = va_arg (args, char *);
2633 * @buf1: (transfer none): the first source #GstBuffer to merge.
2634 * @buf2: (transfer none): the second source #GstBuffer to merge.
2636 * Create a new buffer that is the concatenation of the two source
2637 * buffers. The original source buffers will not be modified or
2638 * unref'd. Make sure you unref the source buffers if they are not used
2639 * anymore afterwards.
2641 * If the buffers point to contiguous areas of memory, the buffer
2642 * is created without copying the data.
2644 * Free-function: gst_buffer_unref
2646 * Returns: (transfer full): the new #GstBuffer which is the concatenation
2647 * of the source buffers.
2650 gst_buffer_merge (GstBuffer * buf1, GstBuffer * buf2)
2654 /* we're just a specific case of the more general gst_buffer_span() */
2655 result = gst_buffer_span (buf1, 0, buf2, buf1->size + buf2->size);
2662 * @buf1: the first source #GstBuffer.
2663 * @buf2: the second source #GstBuffer.
2665 * Create a new buffer that is the concatenation of the two source
2666 * buffers, and unrefs the original source buffers.
2668 * If the buffers point to contiguous areas of memory, the buffer
2669 * is created without copying the data.
2671 * This is a convenience function for C programmers. See also
2672 * gst_buffer_merge(), which does the same thing without
2673 * unreffing the input parameters. Language bindings without
2674 * explicit reference counting should not wrap this function.
2676 * Returns: the new #GstBuffer which is the concatenation of the source buffers.
2679 gst_buffer_join (GstBuffer * buf1, GstBuffer * buf2)
2683 result = gst_buffer_span (buf1, 0, buf2, buf1->size + buf2->size);
2684 gst_buffer_unref (buf1);
2685 gst_buffer_unref (buf2);
2693 * @dest: (transfer none): buffer to stamp
2694 * @src: buffer to stamp from
2696 * Copies additional information (the timestamp, duration, and offset start
2697 * and end) from one buffer to the other.
2699 * This function does not copy any buffer flags or caps and is equivalent to
2700 * gst_buffer_copy_metadata(@dest, @src, GST_BUFFER_COPY_TIMESTAMPS).
2702 * Deprecated: use gst_buffer_copy_metadata() instead, it provides more
2705 #ifndef GST_REMOVE_DEPRECATED
2706 #ifdef GST_DISABLE_DEPRECATED
2707 void gst_buffer_stamp (GstBuffer * dest, const GstBuffer * src);
2710 gst_buffer_stamp (GstBuffer * dest, const GstBuffer * src)
2712 gst_buffer_copy_metadata (dest, src, GST_BUFFER_COPY_TIMESTAMPS);
2714 #endif /* GST_REMOVE_DEPRECATED */
2717 getcaps_fold_func (GstPad * pad, GValue * ret, GstPad * orig)
2719 gboolean empty = FALSE;
2720 GstCaps *peercaps, *existing;
2722 existing = g_value_get_pointer (ret);
2723 peercaps = gst_pad_peer_get_caps_reffed (pad);
2724 if (G_LIKELY (peercaps)) {
2725 GstCaps *intersection = gst_caps_intersect (existing, peercaps);
2727 empty = gst_caps_is_empty (intersection);
2729 g_value_set_pointer (ret, intersection);
2730 gst_caps_unref (existing);
2731 gst_caps_unref (peercaps);
2733 gst_object_unref (pad);
2738 * gst_pad_proxy_getcaps:
2739 * @pad: a #GstPad to proxy.
2741 * Calls gst_pad_get_allowed_caps() for every other pad belonging to the
2742 * same element as @pad, and returns the intersection of the results.
2744 * This function is useful as a default getcaps function for an element
2745 * that can handle any stream format, but requires all its pads to have
2746 * the same caps. Two such elements are tee and adder.
2748 * Free-function: gst_caps_unref
2750 * Returns: (transfer full): the intersection of the other pads' allowed caps.
2753 gst_pad_proxy_getcaps (GstPad * pad)
2755 GstElement *element;
2756 GstCaps *caps, *intersected;
2758 GstIteratorResult res;
2759 GValue ret = { 0, };
2761 g_return_val_if_fail (GST_IS_PAD (pad), NULL);
2763 GST_CAT_DEBUG (GST_CAT_PADS, "proxying getcaps for %s:%s",
2764 GST_DEBUG_PAD_NAME (pad));
2766 element = gst_pad_get_parent_element (pad);
2767 if (element == NULL)
2770 /* value to hold the return, by default it holds ANY, the ref is taken by
2772 g_value_init (&ret, G_TYPE_POINTER);
2773 g_value_set_pointer (&ret, gst_caps_new_any ());
2775 /* only iterate the pads in the oposite direction */
2776 if (GST_PAD_IS_SRC (pad))
2777 iter = gst_element_iterate_sink_pads (element);
2779 iter = gst_element_iterate_src_pads (element);
2783 gst_iterator_fold (iter, (GstIteratorFoldFunction) getcaps_fold_func,
2786 case GST_ITERATOR_RESYNC:
2787 /* unref any value stored */
2788 if ((caps = g_value_get_pointer (&ret)))
2789 gst_caps_unref (caps);
2790 /* need to reset the result again to ANY */
2791 g_value_set_pointer (&ret, gst_caps_new_any ());
2792 gst_iterator_resync (iter);
2794 case GST_ITERATOR_DONE:
2795 /* all pads iterated, return collected value */
2797 case GST_ITERATOR_OK:
2798 /* premature exit (happens if caps intersection is empty) */
2801 /* iterator returned _ERROR, mark an error and exit */
2802 if ((caps = g_value_get_pointer (&ret)))
2803 gst_caps_unref (caps);
2804 g_value_set_pointer (&ret, NULL);
2809 gst_iterator_free (iter);
2811 gst_object_unref (element);
2813 caps = g_value_get_pointer (&ret);
2814 g_value_unset (&ret);
2818 gst_caps_intersect (caps, gst_pad_get_pad_template_caps (pad));
2819 gst_caps_unref (caps);
2821 intersected = gst_caps_copy (gst_pad_get_pad_template_caps (pad));
2829 GST_DEBUG_OBJECT (pad, "no parent");
2830 return gst_caps_copy (gst_pad_get_pad_template_caps (pad));
2834 g_warning ("Pad list returned error on element %s",
2835 GST_ELEMENT_NAME (element));
2836 gst_iterator_free (iter);
2837 gst_object_unref (element);
2838 return gst_caps_copy (gst_pad_get_pad_template_caps (pad));
2849 setcaps_fold_func (GstPad * pad, GValue * ret, SetCapsFoldData * data)
2851 gboolean success = TRUE;
2853 if (pad != data->orig) {
2854 success = gst_pad_set_caps (pad, data->caps);
2855 g_value_set_boolean (ret, success);
2857 gst_object_unref (pad);
2863 * gst_pad_proxy_setcaps
2864 * @pad: a #GstPad to proxy from
2865 * @caps: (transfer none): the #GstCaps to link with
2867 * Calls gst_pad_set_caps() for every other pad belonging to the
2868 * same element as @pad. If gst_pad_set_caps() fails on any pad,
2869 * the proxy setcaps fails. May be used only during negotiation.
2871 * Returns: TRUE if sucessful
2874 gst_pad_proxy_setcaps (GstPad * pad, GstCaps * caps)
2876 GstElement *element;
2878 GstIteratorResult res;
2879 GValue ret = { 0, };
2880 SetCapsFoldData data;
2882 g_return_val_if_fail (GST_IS_PAD (pad), FALSE);
2883 g_return_val_if_fail (caps != NULL, FALSE);
2885 GST_CAT_DEBUG (GST_CAT_PADS, "proxying pad link for %s:%s",
2886 GST_DEBUG_PAD_NAME (pad));
2888 element = gst_pad_get_parent_element (pad);
2889 if (element == NULL)
2892 /* only iterate the pads in the oposite direction */
2893 if (GST_PAD_IS_SRC (pad))
2894 iter = gst_element_iterate_sink_pads (element);
2896 iter = gst_element_iterate_src_pads (element);
2898 g_value_init (&ret, G_TYPE_BOOLEAN);
2899 g_value_set_boolean (&ret, TRUE);
2904 res = gst_iterator_fold (iter, (GstIteratorFoldFunction) setcaps_fold_func,
2908 case GST_ITERATOR_RESYNC:
2909 /* reset return value */
2910 g_value_set_boolean (&ret, TRUE);
2911 gst_iterator_resync (iter);
2913 case GST_ITERATOR_DONE:
2914 /* all pads iterated, return collected value */
2917 /* iterator returned _ERROR or premature end with _OK,
2918 * mark an error and exit */
2923 gst_iterator_free (iter);
2925 gst_object_unref (element);
2927 /* ok not to unset the gvalue */
2928 return g_value_get_boolean (&ret);
2933 g_warning ("Pad list return error on element %s",
2934 GST_ELEMENT_NAME (element));
2935 gst_iterator_free (iter);
2936 gst_object_unref (element);
2942 * gst_pad_query_position:
2943 * @pad: a #GstPad to invoke the position query on.
2944 * @format: (inout): a pointer to the #GstFormat asked for.
2945 * On return contains the #GstFormat used.
2946 * @cur: (out): A location in which to store the current position, or NULL.
2948 * Queries a pad for the stream position.
2950 * Returns: TRUE if the query could be performed.
2953 gst_pad_query_position (GstPad * pad, GstFormat * format, gint64 * cur)
2958 g_return_val_if_fail (GST_IS_PAD (pad), FALSE);
2959 g_return_val_if_fail (format != NULL, FALSE);
2961 query = gst_query_new_position (*format);
2962 ret = gst_pad_query (pad, query);
2965 gst_query_parse_position (query, format, cur);
2967 gst_query_unref (query);
2973 * gst_pad_query_peer_position:
2974 * @pad: a #GstPad on whose peer to invoke the position query on.
2975 * Must be a sink pad.
2976 * @format: (inout): a pointer to the #GstFormat asked for.
2977 * On return contains the #GstFormat used.
2978 * @cur: (out) (allow-none): a location in which to store the current
2979 * position, or NULL.
2981 * Queries the peer of a given sink pad for the stream position.
2983 * Returns: TRUE if the query could be performed.
2986 gst_pad_query_peer_position (GstPad * pad, GstFormat * format, gint64 * cur)
2988 gboolean ret = FALSE;
2991 g_return_val_if_fail (GST_IS_PAD (pad), FALSE);
2992 g_return_val_if_fail (GST_PAD_IS_SINK (pad), FALSE);
2993 g_return_val_if_fail (format != NULL, FALSE);
2995 peer = gst_pad_get_peer (pad);
2997 ret = gst_pad_query_position (peer, format, cur);
2998 gst_object_unref (peer);
3005 * gst_pad_query_duration:
3006 * @pad: a #GstPad to invoke the duration query on.
3007 * @format: (inout): a pointer to the #GstFormat asked for.
3008 * On return contains the #GstFormat used.
3009 * @duration: (out) (allow-none): a location in which to store the total
3010 * duration, or NULL.
3012 * Queries a pad for the total stream duration.
3014 * Returns: TRUE if the query could be performed.
3017 gst_pad_query_duration (GstPad * pad, GstFormat * format, gint64 * duration)
3022 g_return_val_if_fail (GST_IS_PAD (pad), FALSE);
3023 g_return_val_if_fail (format != NULL, FALSE);
3025 query = gst_query_new_duration (*format);
3026 ret = gst_pad_query (pad, query);
3029 gst_query_parse_duration (query, format, duration);
3031 gst_query_unref (query);
3037 * gst_pad_query_peer_duration:
3038 * @pad: a #GstPad on whose peer pad to invoke the duration query on.
3039 * Must be a sink pad.
3040 * @format: (inout) :a pointer to the #GstFormat asked for.
3041 * On return contains the #GstFormat used.
3042 * @duration: (out) (allow-none): a location in which to store the total
3043 * duration, or NULL.
3045 * Queries the peer pad of a given sink pad for the total stream duration.
3047 * Returns: TRUE if the query could be performed.
3050 gst_pad_query_peer_duration (GstPad * pad, GstFormat * format,
3053 gboolean ret = FALSE;
3056 g_return_val_if_fail (GST_IS_PAD (pad), FALSE);
3057 g_return_val_if_fail (GST_PAD_IS_SINK (pad), FALSE);
3058 g_return_val_if_fail (format != NULL, FALSE);
3060 peer = gst_pad_get_peer (pad);
3062 ret = gst_pad_query_duration (peer, format, duration);
3063 gst_object_unref (peer);
3070 * gst_pad_query_convert:
3071 * @pad: a #GstPad to invoke the convert query on.
3072 * @src_format: a #GstFormat to convert from.
3073 * @src_val: a value to convert.
3074 * @dest_format: (inout): a pointer to the #GstFormat to convert to.
3075 * @dest_val: (out): a pointer to the result.
3077 * Queries a pad to convert @src_val in @src_format to @dest_format.
3079 * Returns: TRUE if the query could be performed.
3082 gst_pad_query_convert (GstPad * pad, GstFormat src_format, gint64 src_val,
3083 GstFormat * dest_format, gint64 * dest_val)
3088 g_return_val_if_fail (GST_IS_PAD (pad), FALSE);
3089 g_return_val_if_fail (dest_format != NULL, FALSE);
3090 g_return_val_if_fail (dest_val != NULL, FALSE);
3092 if (*dest_format == src_format || src_val == -1) {
3093 *dest_val = src_val;
3097 query = gst_query_new_convert (src_format, src_val, *dest_format);
3098 ret = gst_pad_query (pad, query);
3101 gst_query_parse_convert (query, NULL, NULL, dest_format, dest_val);
3103 gst_query_unref (query);
3109 * gst_pad_query_peer_convert:
3110 * @pad: a #GstPad, on whose peer pad to invoke the convert query on.
3111 * Must be a sink pad.
3112 * @src_format: a #GstFormat to convert from.
3113 * @src_val: a value to convert.
3114 * @dest_format: (inout): a pointer to the #GstFormat to convert to.
3115 * @dest_val: (out): a pointer to the result.
3117 * Queries the peer pad of a given sink pad to convert @src_val in @src_format
3120 * Returns: TRUE if the query could be performed.
3123 gst_pad_query_peer_convert (GstPad * pad, GstFormat src_format, gint64 src_val,
3124 GstFormat * dest_format, gint64 * dest_val)
3126 gboolean ret = FALSE;
3129 g_return_val_if_fail (GST_IS_PAD (pad), FALSE);
3130 g_return_val_if_fail (GST_PAD_IS_SINK (pad), FALSE);
3131 g_return_val_if_fail (dest_format != NULL, FALSE);
3132 g_return_val_if_fail (dest_val != NULL, FALSE);
3134 peer = gst_pad_get_peer (pad);
3136 ret = gst_pad_query_convert (peer, src_format, src_val, dest_format,
3138 gst_object_unref (peer);
3145 * gst_atomic_int_set:
3146 * @atomic_int: (inout): pointer to an atomic integer
3147 * @value: value to set
3149 * Unconditionally sets the atomic integer to @value.
3151 * Deprecated: Use g_atomic_int_set().
3154 #ifndef GST_REMOVE_DEPRECATED
3155 #ifdef GST_DISABLE_DEPRECATED
3156 void gst_atomic_int_set (gint * atomic_int, gint value);
3159 gst_atomic_int_set (gint * atomic_int, gint value)
3161 g_atomic_int_set (atomic_int, value);
3166 * gst_pad_add_data_probe:
3167 * @pad: pad to add the data probe handler to
3168 * @handler: function to call when data is passed over pad
3169 * @data: (closure): data to pass along with the handler
3171 * Adds a "data probe" to a pad. This function will be called whenever data
3172 * passes through a pad. In this case data means both events and buffers. The
3173 * probe will be called with the data as an argument, meaning @handler should
3174 * have the same callback signature as the #GstPad::have-data signal.
3175 * Note that the data will have a reference count greater than 1, so it will
3176 * be immutable -- you must not change it.
3178 * For source pads, the probe will be called after the blocking function, if any
3179 * (see gst_pad_set_blocked_async()), but before looking up the peer to chain
3180 * to. For sink pads, the probe function will be called before configuring the
3181 * sink with new caps, if any, and before calling the pad's chain function.
3183 * Your data probe should return TRUE to let the data continue to flow, or FALSE
3184 * to drop it. Dropping data is rarely useful, but occasionally comes in handy
3187 * Although probes are implemented internally by connecting @handler to the
3188 * have-data signal on the pad, if you want to remove a probe it is insufficient
3189 * to only call g_signal_handler_disconnect on the returned handler id. To
3190 * remove a probe, use the appropriate function, such as
3191 * gst_pad_remove_data_probe().
3193 * Returns: The handler id.
3196 gst_pad_add_data_probe (GstPad * pad, GCallback handler, gpointer data)
3198 return gst_pad_add_data_probe_full (pad, handler, data, NULL);
3202 * gst_pad_add_data_probe_full:
3203 * @pad: pad to add the data probe handler to
3204 * @handler: function to call when data is passed over pad
3205 * @data: (closure): data to pass along with the handler
3206 * @notify: (allow-none): function to call when the probe is disconnected,
3209 * Adds a "data probe" to a pad. This function will be called whenever data
3210 * passes through a pad. In this case data means both events and buffers. The
3211 * probe will be called with the data as an argument, meaning @handler should
3212 * have the same callback signature as the #GstPad::have-data signal.
3213 * Note that the data will have a reference count greater than 1, so it will
3214 * be immutable -- you must not change it.
3216 * For source pads, the probe will be called after the blocking function, if any
3217 * (see gst_pad_set_blocked_async()), but before looking up the peer to chain
3218 * to. For sink pads, the probe function will be called before configuring the
3219 * sink with new caps, if any, and before calling the pad's chain function.
3221 * Your data probe should return TRUE to let the data continue to flow, or FALSE
3222 * to drop it. Dropping data is rarely useful, but occasionally comes in handy
3225 * Although probes are implemented internally by connecting @handler to the
3226 * have-data signal on the pad, if you want to remove a probe it is insufficient
3227 * to only call g_signal_handler_disconnect on the returned handler id. To
3228 * remove a probe, use the appropriate function, such as
3229 * gst_pad_remove_data_probe().
3231 * The @notify function is called when the probe is disconnected and usually
3232 * used to free @data.
3234 * Returns: The handler id.
3239 gst_pad_add_data_probe_full (GstPad * pad, GCallback handler,
3240 gpointer data, GDestroyNotify notify)
3244 g_return_val_if_fail (GST_IS_PAD (pad), 0);
3245 g_return_val_if_fail (handler != NULL, 0);
3247 GST_OBJECT_LOCK (pad);
3249 /* we only expose a GDestroyNotify in our API because that's less confusing */
3250 sigid = g_signal_connect_data (pad, "have-data", handler, data,
3251 (GClosureNotify) notify, 0);
3253 GST_PAD_DO_EVENT_SIGNALS (pad)++;
3254 GST_PAD_DO_BUFFER_SIGNALS (pad)++;
3255 GST_CAT_DEBUG_OBJECT (GST_CAT_PADS, pad,
3256 "adding data probe, now %d data, %d event probes",
3257 GST_PAD_DO_BUFFER_SIGNALS (pad), GST_PAD_DO_EVENT_SIGNALS (pad));
3258 _priv_gst_pad_invalidate_cache (pad);
3259 GST_OBJECT_UNLOCK (pad);
3265 * gst_pad_add_event_probe:
3266 * @pad: pad to add the event probe handler to
3267 * @handler: function to call when events are passed over pad
3268 * @data: (closure): data to pass along with the handler
3270 * Adds a probe that will be called for all events passing through a pad. See
3271 * gst_pad_add_data_probe() for more information.
3273 * Returns: The handler id
3276 gst_pad_add_event_probe (GstPad * pad, GCallback handler, gpointer data)
3278 return gst_pad_add_event_probe_full (pad, handler, data, NULL);
3282 * gst_pad_add_event_probe_full:
3283 * @pad: pad to add the event probe handler to
3284 * @handler: function to call when events are passed over pad
3285 * @data: (closure): data to pass along with the handler, or NULL
3286 * @notify: (allow-none): function to call when probe is disconnected, or NULL
3288 * Adds a probe that will be called for all events passing through a pad. See
3289 * gst_pad_add_data_probe() for more information.
3291 * The @notify function is called when the probe is disconnected and usually
3292 * used to free @data.
3294 * Returns: The handler id
3299 gst_pad_add_event_probe_full (GstPad * pad, GCallback handler,
3300 gpointer data, GDestroyNotify notify)
3304 g_return_val_if_fail (GST_IS_PAD (pad), 0);
3305 g_return_val_if_fail (handler != NULL, 0);
3307 GST_OBJECT_LOCK (pad);
3309 /* we only expose a GDestroyNotify in our API because that's less confusing */
3310 sigid = g_signal_connect_data (pad, "have-data::event", handler, data,
3311 (GClosureNotify) notify, 0);
3313 GST_PAD_DO_EVENT_SIGNALS (pad)++;
3314 GST_CAT_DEBUG_OBJECT (GST_CAT_PADS, pad, "adding event probe, now %d probes",
3315 GST_PAD_DO_EVENT_SIGNALS (pad));
3316 _priv_gst_pad_invalidate_cache (pad);
3317 GST_OBJECT_UNLOCK (pad);
3323 * gst_pad_add_buffer_probe:
3324 * @pad: pad to add the buffer probe handler to
3325 * @handler: function to call when buffers are passed over pad
3326 * @data: (closure): data to pass along with the handler
3328 * Adds a probe that will be called for all buffers passing through a pad. See
3329 * gst_pad_add_data_probe() for more information.
3331 * Returns: The handler id
3334 gst_pad_add_buffer_probe (GstPad * pad, GCallback handler, gpointer data)
3336 return gst_pad_add_buffer_probe_full (pad, handler, data, NULL);
3340 * gst_pad_add_buffer_probe_full:
3341 * @pad: pad to add the buffer probe handler to
3342 * @handler: function to call when buffer are passed over pad
3343 * @data: (closure): data to pass along with the handler
3344 * @notify: (allow-none): function to call when the probe is disconnected,
3347 * Adds a probe that will be called for all buffers passing through a pad. See
3348 * gst_pad_add_data_probe() for more information.
3350 * The @notify function is called when the probe is disconnected and usually
3351 * used to free @data.
3353 * Returns: The handler id
3358 gst_pad_add_buffer_probe_full (GstPad * pad, GCallback handler,
3359 gpointer data, GDestroyNotify notify)
3363 g_return_val_if_fail (GST_IS_PAD (pad), 0);
3364 g_return_val_if_fail (handler != NULL, 0);
3366 GST_OBJECT_LOCK (pad);
3368 /* we only expose a GDestroyNotify in our API because that's less confusing */
3369 sigid = g_signal_connect_data (pad, "have-data::buffer", handler, data,
3370 (GClosureNotify) notify, 0);
3372 GST_PAD_DO_BUFFER_SIGNALS (pad)++;
3373 GST_CAT_DEBUG_OBJECT (GST_CAT_PADS, pad, "adding buffer probe, now %d probes",
3374 GST_PAD_DO_BUFFER_SIGNALS (pad));
3375 _priv_gst_pad_invalidate_cache (pad);
3376 GST_OBJECT_UNLOCK (pad);
3382 * gst_pad_remove_data_probe:
3383 * @pad: pad to remove the data probe handler from
3384 * @handler_id: handler id returned from gst_pad_add_data_probe
3386 * Removes a data probe from @pad.
3389 gst_pad_remove_data_probe (GstPad * pad, guint handler_id)
3391 g_return_if_fail (GST_IS_PAD (pad));
3392 g_return_if_fail (handler_id);
3394 GST_OBJECT_LOCK (pad);
3395 g_signal_handler_disconnect (pad, handler_id);
3396 GST_PAD_DO_BUFFER_SIGNALS (pad)--;
3397 GST_PAD_DO_EVENT_SIGNALS (pad)--;
3398 GST_CAT_DEBUG_OBJECT (GST_CAT_PADS, pad,
3399 "removed data probe, now %d event, %d buffer probes",
3400 GST_PAD_DO_EVENT_SIGNALS (pad), GST_PAD_DO_BUFFER_SIGNALS (pad));
3401 GST_OBJECT_UNLOCK (pad);
3406 * gst_pad_remove_event_probe:
3407 * @pad: pad to remove the event probe handler from
3408 * @handler_id: handler id returned from gst_pad_add_event_probe
3410 * Removes an event probe from @pad.
3413 gst_pad_remove_event_probe (GstPad * pad, guint handler_id)
3415 g_return_if_fail (GST_IS_PAD (pad));
3416 g_return_if_fail (handler_id);
3418 GST_OBJECT_LOCK (pad);
3419 g_signal_handler_disconnect (pad, handler_id);
3420 GST_PAD_DO_EVENT_SIGNALS (pad)--;
3421 GST_CAT_DEBUG_OBJECT (GST_CAT_PADS, pad,
3422 "removed event probe, now %d event probes",
3423 GST_PAD_DO_EVENT_SIGNALS (pad));
3424 GST_OBJECT_UNLOCK (pad);
3428 * gst_pad_remove_buffer_probe:
3429 * @pad: pad to remove the buffer probe handler from
3430 * @handler_id: handler id returned from gst_pad_add_buffer_probe
3432 * Removes a buffer probe from @pad.
3435 gst_pad_remove_buffer_probe (GstPad * pad, guint handler_id)
3437 g_return_if_fail (GST_IS_PAD (pad));
3438 g_return_if_fail (handler_id);
3440 GST_OBJECT_LOCK (pad);
3441 g_signal_handler_disconnect (pad, handler_id);
3442 GST_PAD_DO_BUFFER_SIGNALS (pad)--;
3443 GST_CAT_DEBUG_OBJECT (GST_CAT_PADS, pad,
3444 "removed buffer probe, now %d buffer probes",
3445 GST_PAD_DO_BUFFER_SIGNALS (pad));
3446 GST_OBJECT_UNLOCK (pad);
3451 * gst_element_found_tags_for_pad:
3452 * @element: element for which to post taglist to bus.
3453 * @pad: (transfer none): pad on which to push tag-event
3454 * @list: (transfer full): the taglist to post on the bus and create event from
3456 * Posts a message to the bus that new tags were found and pushes the
3457 * tags as event. Takes ownership of the @list.
3459 * This is a utility method for elements. Applications should use the
3460 * #GstTagSetter interface.
3463 gst_element_found_tags_for_pad (GstElement * element,
3464 GstPad * pad, GstTagList * list)
3466 g_return_if_fail (element != NULL);
3467 g_return_if_fail (pad != NULL);
3468 g_return_if_fail (list != NULL);
3470 gst_pad_push_event (pad, gst_event_new_tag (gst_tag_list_copy (list)));
3471 /* FIXME 0.11: Set the pad as source. */
3472 gst_element_post_message (element,
3473 gst_message_new_tag_full (GST_OBJECT (element), pad, list));
3477 push_and_ref (GstPad * pad, GstEvent * event)
3479 gst_pad_push_event (pad, gst_event_ref (event));
3480 /* iterator refs pad, we unref when we are done with it */
3481 gst_object_unref (pad);
3485 * gst_element_found_tags:
3486 * @element: element for which we found the tags.
3487 * @list: (transfer full): list of tags.
3489 * Posts a message to the bus that new tags were found, and pushes an event
3490 * to all sourcepads. Takes ownership of the @list.
3492 * This is a utility method for elements. Applications should use the
3493 * #GstTagSetter interface.
3496 gst_element_found_tags (GstElement * element, GstTagList * list)
3501 g_return_if_fail (element != NULL);
3502 g_return_if_fail (list != NULL);
3504 iter = gst_element_iterate_src_pads (element);
3505 event = gst_event_new_tag (gst_tag_list_copy (list));
3506 gst_iterator_foreach (iter, (GFunc) push_and_ref, event);
3507 gst_iterator_free (iter);
3508 gst_event_unref (event);
3510 gst_element_post_message (element,
3511 gst_message_new_tag (GST_OBJECT (element), list));
3515 element_find_unlinked_pad (GstElement * element, GstPadDirection direction)
3518 GstPad *unlinked_pad = NULL;
3521 switch (direction) {
3523 iter = gst_element_iterate_src_pads (element);
3526 iter = gst_element_iterate_sink_pads (element);
3529 g_return_val_if_reached (NULL);
3536 switch (gst_iterator_next (iter, &pad)) {
3537 case GST_ITERATOR_OK:{
3540 GST_CAT_LOG (GST_CAT_ELEMENT_PADS, "examining pad %s:%s",
3541 GST_DEBUG_PAD_NAME (pad));
3543 peer = gst_pad_get_peer (GST_PAD (pad));
3547 GST_CAT_DEBUG (GST_CAT_ELEMENT_PADS,
3548 "found existing unlinked pad %s:%s",
3549 GST_DEBUG_PAD_NAME (unlinked_pad));
3551 gst_object_unref (pad);
3552 gst_object_unref (peer);
3556 case GST_ITERATOR_DONE:
3559 case GST_ITERATOR_RESYNC:
3560 gst_iterator_resync (iter);
3562 case GST_ITERATOR_ERROR:
3563 g_return_val_if_reached (NULL);
3568 gst_iterator_free (iter);
3570 return unlinked_pad;
3574 * gst_bin_find_unlinked_pad:
3575 * @bin: bin in which to look for elements with unlinked pads
3576 * @direction: whether to look for an unlinked source or sink pad
3578 * Recursively looks for elements with an unlinked pad of the given
3579 * direction within the specified bin and returns an unlinked pad
3580 * if one is found, or NULL otherwise. If a pad is found, the caller
3581 * owns a reference to it and should use gst_object_unref() on the
3582 * pad when it is not needed any longer.
3584 * Returns: (transfer full): unlinked pad of the given direction, or NULL.
3589 gst_bin_find_unlinked_pad (GstBin * bin, GstPadDirection direction)
3595 g_return_val_if_fail (GST_IS_BIN (bin), NULL);
3596 g_return_val_if_fail (direction != GST_PAD_UNKNOWN, NULL);
3599 iter = gst_bin_iterate_recurse (bin);
3603 switch (gst_iterator_next (iter, &element)) {
3604 case GST_ITERATOR_OK:
3605 pad = element_find_unlinked_pad (GST_ELEMENT (element), direction);
3606 gst_object_unref (element);
3610 case GST_ITERATOR_DONE:
3613 case GST_ITERATOR_RESYNC:
3614 gst_iterator_resync (iter);
3616 case GST_ITERATOR_ERROR:
3617 g_return_val_if_reached (NULL);
3622 gst_iterator_free (iter);
3628 * gst_bin_find_unconnected_pad:
3629 * @bin: bin in which to look for elements with unlinked pads
3630 * @direction: whether to look for an unlinked source or sink pad
3632 * Recursively looks for elements with an unlinked pad of the given
3633 * direction within the specified bin and returns an unlinked pad
3634 * if one is found, or NULL otherwise. If a pad is found, the caller
3635 * owns a reference to it and should use gst_object_unref() on the
3636 * pad when it is not needed any longer.
3638 * Returns: (transfer full): unlinked pad of the given direction, or NULL.
3642 * Deprecated: use gst_bin_find_unlinked_pad() instead.
3644 #ifndef GST_REMOVE_DEPRECATED
3645 #ifdef GST_DISABLE_DEPRECATED
3646 GstPad *gst_bin_find_unconnected_pad (GstBin * bin, GstPadDirection direction);
3649 gst_bin_find_unconnected_pad (GstBin * bin, GstPadDirection direction)
3651 return gst_bin_find_unlinked_pad (bin, direction);
3656 * gst_parse_bin_from_description:
3657 * @bin_description: command line describing the bin
3658 * @ghost_unlinked_pads: whether to automatically create ghost pads
3659 * for unlinked source or sink pads within the bin
3660 * @err: where to store the error message in case of an error, or NULL
3662 * This is a convenience wrapper around gst_parse_launch() to create a
3663 * #GstBin from a gst-launch-style pipeline description. See
3664 * gst_parse_launch() and the gst-launch man page for details about the
3665 * syntax. Ghost pads on the bin for unlinked source or sink pads
3666 * within the bin can automatically be created (but only a maximum of
3667 * one ghost pad for each direction will be created; if you expect
3668 * multiple unlinked source pads or multiple unlinked sink pads
3669 * and want them all ghosted, you will have to create the ghost pads
3672 * Returns: a newly-created bin, or NULL if an error occurred.
3677 gst_parse_bin_from_description (const gchar * bin_description,
3678 gboolean ghost_unlinked_pads, GError ** err)
3680 return gst_parse_bin_from_description_full (bin_description,
3681 ghost_unlinked_pads, NULL, 0, err);
3685 * gst_parse_bin_from_description_full:
3686 * @bin_description: command line describing the bin
3687 * @ghost_unlinked_pads: whether to automatically create ghost pads
3688 * for unlinked source or sink pads within the bin
3689 * @context: (transfer none) (allow-none): a parse context allocated with
3690 * gst_parse_context_new(), or %NULL
3691 * @flags: parsing options, or #GST_PARSE_FLAG_NONE
3692 * @err: where to store the error message in case of an error, or NULL
3694 * This is a convenience wrapper around gst_parse_launch() to create a
3695 * #GstBin from a gst-launch-style pipeline description. See
3696 * gst_parse_launch() and the gst-launch man page for details about the
3697 * syntax. Ghost pads on the bin for unlinked source or sink pads
3698 * within the bin can automatically be created (but only a maximum of
3699 * one ghost pad for each direction will be created; if you expect
3700 * multiple unlinked source pads or multiple unlinked sink pads
3701 * and want them all ghosted, you will have to create the ghost pads
3704 * Returns: a newly-created bin, or NULL if an error occurred.
3709 gst_parse_bin_from_description_full (const gchar * bin_description,
3710 gboolean ghost_unlinked_pads, GstParseContext * context,
3711 GstParseFlags flags, GError ** err)
3713 #ifndef GST_DISABLE_PARSE
3718 g_return_val_if_fail (bin_description != NULL, NULL);
3719 g_return_val_if_fail (err == NULL || *err == NULL, NULL);
3721 GST_DEBUG ("Making bin from description '%s'", bin_description);
3723 /* parse the pipeline to a bin */
3724 desc = g_strdup_printf ("bin.( %s )", bin_description);
3725 bin = (GstBin *) gst_parse_launch_full (desc, context, flags, err);
3728 if (bin == NULL || (err && *err != NULL)) {
3730 gst_object_unref (bin);
3734 /* find pads and ghost them if necessary */
3735 if (ghost_unlinked_pads) {
3736 if ((pad = gst_bin_find_unlinked_pad (bin, GST_PAD_SRC))) {
3737 gst_element_add_pad (GST_ELEMENT (bin), gst_ghost_pad_new ("src", pad));
3738 gst_object_unref (pad);
3740 if ((pad = gst_bin_find_unlinked_pad (bin, GST_PAD_SINK))) {
3741 gst_element_add_pad (GST_ELEMENT (bin), gst_ghost_pad_new ("sink", pad));
3742 gst_object_unref (pad);
3746 return GST_ELEMENT (bin);
3750 GST_WARNING ("Disabled API called");
3752 msg = gst_error_get_message (GST_CORE_ERROR, GST_CORE_ERROR_DISABLED);
3753 g_set_error (err, GST_CORE_ERROR, GST_CORE_ERROR_DISABLED, "%s", msg);
3761 * gst_type_register_static_full:
3762 * @parent_type: The GType of the parent type the newly registered type will
3764 * @type_name: NULL-terminated string used as the name of the new type
3765 * @class_size: Size of the class structure.
3766 * @base_init: Location of the base initialization function (optional).
3767 * @base_finalize: Location of the base finalization function (optional).
3768 * @class_init: Location of the class initialization function for class types
3769 * Location of the default vtable inititalization function for interface
3771 * @class_finalize: Location of the class finalization function for class types.
3772 * Location of the default vtable finalization function for interface types.
3774 * @class_data: User-supplied data passed to the class init/finalize functions.
3775 * @instance_size: Size of the instance (object) structure (required for
3776 * instantiatable types only).
3777 * @n_preallocs: The number of pre-allocated (cached) instances to reserve
3778 * memory for (0 indicates no caching). Ignored on recent GLib's.
3779 * @instance_init: Location of the instance initialization function (optional,
3780 * for instantiatable types only).
3781 * @value_table: A GTypeValueTable function table for generic handling of
3782 * GValues of this type (usually only useful for fundamental types).
3783 * @flags: #GTypeFlags for this GType. E.g: G_TYPE_FLAG_ABSTRACT
3785 * Helper function which constructs a #GTypeInfo structure and registers a
3786 * GType, but which generates less linker overhead than a static const
3787 * #GTypeInfo structure. For further details of the parameters, please see
3788 * #GTypeInfo in the GLib documentation.
3790 * Registers type_name as the name of a new static type derived from
3791 * parent_type. The value of flags determines the nature (e.g. abstract or
3792 * not) of the type. It works by filling a GTypeInfo struct and calling
3793 * g_type_register_static().
3795 * Returns: A #GType for the newly-registered type.
3800 gst_type_register_static_full (GType parent_type,
3801 const gchar * type_name,
3803 GBaseInitFunc base_init,
3804 GBaseFinalizeFunc base_finalize,
3805 GClassInitFunc class_init,
3806 GClassFinalizeFunc class_finalize,
3807 gconstpointer class_data,
3808 guint instance_size,
3809 guint16 n_preallocs,
3810 GInstanceInitFunc instance_init,
3811 const GTypeValueTable * value_table, GTypeFlags flags)
3815 info.class_size = class_size;
3816 info.base_init = base_init;
3817 info.base_finalize = base_finalize;
3818 info.class_init = class_init;
3819 info.class_finalize = class_finalize;
3820 info.class_data = class_data;
3821 info.instance_size = instance_size;
3822 info.n_preallocs = n_preallocs;
3823 info.instance_init = instance_init;
3824 info.value_table = value_table;
3826 return g_type_register_static (parent_type, type_name, &info, flags);
3831 * gst_util_get_timestamp:
3833 * Get a timestamp as GstClockTime to be used for interval meassurements.
3834 * The timestamp should not be interpreted in any other way.
3836 * Returns: the timestamp
3841 gst_util_get_timestamp (void)
3843 #if defined (HAVE_POSIX_TIMERS) && defined(HAVE_MONOTONIC_CLOCK)
3844 struct timespec now;
3846 clock_gettime (CLOCK_MONOTONIC, &now);
3847 return GST_TIMESPEC_TO_TIME (now);
3851 g_get_current_time (&now);
3852 return GST_TIMEVAL_TO_TIME (now);
3857 * gst_util_array_binary_search:
3858 * @array: the sorted input array
3859 * @num_elements: number of elements in the array
3860 * @element_size: size of every element in bytes
3861 * @search_func: function to compare two elements, @search_data will always be passed as second argument
3862 * @mode: search mode that should be used
3863 * @search_data: element that should be found
3864 * @user_data: (closure): data to pass to @search_func
3866 * Searches inside @array for @search_data by using the comparison function
3867 * @search_func. @array must be sorted ascending.
3869 * As @search_data is always passed as second argument to @search_func it's
3870 * not required that @search_data has the same type as the array elements.
3872 * The complexity of this search function is O(log (num_elements)).
3874 * Returns: The address of the found element or %NULL if nothing was found
3879 gst_util_array_binary_search (gpointer array, guint num_elements,
3880 gsize element_size, GCompareDataFunc search_func, GstSearchMode mode,
3881 gconstpointer search_data, gpointer user_data)
3883 glong left = 0, right = num_elements - 1, m;
3885 guint8 *data = (guint8 *) array;
3887 g_return_val_if_fail (array != NULL, NULL);
3888 g_return_val_if_fail (element_size > 0, NULL);
3889 g_return_val_if_fail (search_func != NULL, NULL);
3891 /* 0. No elements => return NULL */
3892 if (num_elements == 0)
3895 /* 1. If search_data is before the 0th element return the 0th element */
3896 ret = search_func (data, search_data, user_data);
3897 if ((ret >= 0 && mode == GST_SEARCH_MODE_AFTER) || ret == 0)
3902 /* 2. If search_data is after the last element return the last element */
3904 search_func (data + (num_elements - 1) * element_size, search_data,
3906 if ((ret <= 0 && mode == GST_SEARCH_MODE_BEFORE) || ret == 0)
3907 return data + (num_elements - 1) * element_size;
3911 /* 3. else binary search */
3913 m = left + (right - left) / 2;
3915 ret = search_func (data + m * element_size, search_data, user_data);
3918 return data + m * element_size;
3919 } else if (ret < 0) {
3925 /* No exact match found */
3927 if (mode == GST_SEARCH_MODE_EXACT) {
3929 } else if (mode == GST_SEARCH_MODE_AFTER) {
3931 return (m < num_elements) ? data + (m + 1) * element_size : NULL;
3933 return data + m * element_size;
3936 return data + m * element_size;
3938 return (m > 0) ? data + (m - 1) * element_size : NULL;
3944 /* Finds the greatest common divisor.
3945 * Returns 1 if none other found.
3946 * This is Euclid's algorithm. */
3949 * gst_util_greatest_common_divisor:
3950 * @a: First value as #gint
3951 * @b: Second value as #gint
3953 * Calculates the greatest common divisor of @a
3956 * Returns: Greatest common divisor of @a and @b
3961 gst_util_greatest_common_divisor (gint a, gint b)
3974 * gst_util_fraction_to_double:
3975 * @src_n: Fraction numerator as #gint
3976 * @src_d: Fraction denominator #gint
3977 * @dest: (out): pointer to a #gdouble for the result
3979 * Transforms a #gdouble to a fraction and simplifies the result.
3984 gst_util_fraction_to_double (gint src_n, gint src_d, gdouble * dest)
3986 g_return_if_fail (dest != NULL);
3987 g_return_if_fail (src_d != 0);
3989 *dest = ((gdouble) src_n) / ((gdouble) src_d);
3992 #define MAX_TERMS 30
3993 #define MIN_DIVISOR 1.0e-10
3994 #define MAX_ERROR 1.0e-20
3996 /* use continued fractions to transform a double into a fraction,
3997 * see http://mathforum.org/dr.math/faq/faq.fractions.html#decfrac.
3998 * This algorithm takes care of overflows.
4002 * gst_util_double_to_fraction:
4003 * @src: #gdouble to transform
4004 * @dest_n: (out): pointer to a #gint to hold the result numerator
4005 * @dest_d: (out): pointer to a #gint to hold the result denominator
4007 * Transforms a #gdouble to a fraction and simplifies
4013 gst_util_double_to_fraction (gdouble src, gint * dest_n, gint * dest_d)
4016 gdouble V, F; /* double being converted */
4017 gint N, D; /* will contain the result */
4018 gint A; /* current term in continued fraction */
4019 gint64 N1, D1; /* numerator, denominator of last approx */
4020 gint64 N2, D2; /* numerator, denominator of previous approx */
4023 gboolean negative = FALSE;
4025 g_return_if_fail (dest_n != NULL);
4026 g_return_if_fail (dest_d != NULL);
4028 /* initialize fraction being converted */
4036 /* initialize fractions with 1/0, 0/1 */
4044 for (i = 0; i < MAX_TERMS; i++) {
4046 A = (gint) F; /* no floor() needed, F is always >= 0 */
4047 /* get new divisor */
4050 /* calculate new fraction in temp */
4054 /* guard against overflow */
4055 if (N2 > G_MAXINT || D2 > G_MAXINT) {
4062 /* save last two fractions */
4068 /* quit if dividing by zero or close enough to target */
4069 if (F < MIN_DIVISOR || fabs (V - ((gdouble) N) / D) < MAX_ERROR) {
4073 /* Take reciprocal */
4076 /* fix for overflow */
4081 /* fix for negative */
4086 gcd = gst_util_greatest_common_divisor (N, D);
4098 * gst_util_fraction_multiply:
4099 * @a_n: Numerator of first value
4100 * @a_d: Denominator of first value
4101 * @b_n: Numerator of second value
4102 * @b_d: Denominator of second value
4103 * @res_n: (out): Pointer to #gint to hold the result numerator
4104 * @res_d: (out): Pointer to #gint to hold the result denominator
4106 * Multiplies the fractions @a_n/@a_d and @b_n/@b_d and stores
4107 * the result in @res_n and @res_d.
4109 * Returns: %FALSE on overflow, %TRUE otherwise.
4114 gst_util_fraction_multiply (gint a_n, gint a_d, gint b_n, gint b_d,
4115 gint * res_n, gint * res_d)
4119 g_return_val_if_fail (res_n != NULL, FALSE);
4120 g_return_val_if_fail (res_d != NULL, FALSE);
4121 g_return_val_if_fail (a_d != 0, FALSE);
4122 g_return_val_if_fail (b_d != 0, FALSE);
4124 gcd = gst_util_greatest_common_divisor (a_n, a_d);
4128 gcd = gst_util_greatest_common_divisor (b_n, b_d);
4132 gcd = gst_util_greatest_common_divisor (a_n, b_d);
4136 gcd = gst_util_greatest_common_divisor (a_d, b_n);
4140 /* This would result in overflow */
4141 if (a_n != 0 && G_MAXINT / ABS (a_n) < ABS (b_n))
4143 if (G_MAXINT / ABS (a_d) < ABS (b_d))
4149 gcd = gst_util_greatest_common_divisor (*res_n, *res_d);
4157 * gst_util_fraction_add:
4158 * @a_n: Numerator of first value
4159 * @a_d: Denominator of first value
4160 * @b_n: Numerator of second value
4161 * @b_d: Denominator of second value
4162 * @res_n: (out): Pointer to #gint to hold the result numerator
4163 * @res_d: (out): Pointer to #gint to hold the result denominator
4165 * Adds the fractions @a_n/@a_d and @b_n/@b_d and stores
4166 * the result in @res_n and @res_d.
4168 * Returns: %FALSE on overflow, %TRUE otherwise.
4173 gst_util_fraction_add (gint a_n, gint a_d, gint b_n, gint b_d, gint * res_n,
4178 g_return_val_if_fail (res_n != NULL, FALSE);
4179 g_return_val_if_fail (res_d != NULL, FALSE);
4180 g_return_val_if_fail (a_d != 0, FALSE);
4181 g_return_val_if_fail (b_d != 0, FALSE);
4183 gcd = gst_util_greatest_common_divisor (a_n, a_d);
4187 gcd = gst_util_greatest_common_divisor (b_n, b_d);
4202 /* This would result in overflow */
4203 if (G_MAXINT / ABS (a_n) < ABS (b_n))
4205 if (G_MAXINT / ABS (a_d) < ABS (b_d))
4207 if (G_MAXINT / ABS (a_d) < ABS (b_d))
4210 *res_n = (a_n * b_d) + (a_d * b_n);
4213 gcd = gst_util_greatest_common_divisor (*res_n, *res_d);
4226 * gst_util_fraction_compare:
4227 * @a_n: Numerator of first value
4228 * @a_d: Denominator of first value
4229 * @b_n: Numerator of second value
4230 * @b_d: Denominator of second value
4232 * Compares the fractions @a_n/@a_d and @b_n/@b_d and returns
4233 * -1 if a < b, 0 if a = b and 1 if a > b.
4235 * Returns: -1 if a < b; 0 if a = b; 1 if a > b.
4240 gst_util_fraction_compare (gint a_n, gint a_d, gint b_n, gint b_d)
4246 g_return_val_if_fail (a_d != 0 && b_d != 0, 0);
4249 gcd = gst_util_greatest_common_divisor (a_n, a_d);
4253 gcd = gst_util_greatest_common_divisor (b_n, b_d);
4257 /* fractions are reduced when set, so we can quickly see if they're equal */
4258 if (a_n == b_n && a_d == b_d)
4261 /* extend to 64 bits */
4262 new_num_1 = ((gint64) a_n) * b_d;
4263 new_num_2 = ((gint64) b_n) * a_d;
4264 if (new_num_1 < new_num_2)
4266 if (new_num_1 > new_num_2)
4269 /* Should not happen because a_d and b_d are not 0 */
4270 g_return_val_if_reached (0);