2000-01-30 09:03:00 +00:00
|
|
|
/* Gnome-Streamer
|
|
|
|
* Copyright (C) <1999> Erik Walthinsen <omega@cse.ogi.edu>
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Library General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Library General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Library General Public
|
|
|
|
* License along with this library; if not, write to the
|
|
|
|
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
|
* Boston, MA 02111-1307, USA.
|
|
|
|
*/
|
|
|
|
|
2000-05-21 21:58:20 +00:00
|
|
|
//#define DEBUG_ENABLED
|
2000-06-18 13:50:18 +00:00
|
|
|
//#define STATUS_ENABLED
|
|
|
|
#ifdef STATUS_ENABLED
|
2000-07-12 22:52:42 +00:00
|
|
|
#define STATUS(A) DEBUG(A, gst_element_get_name(GST_ELEMENT(queue)))
|
2000-06-18 13:50:18 +00:00
|
|
|
#else
|
|
|
|
#define STATUS(A)
|
|
|
|
#endif
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
#include <gstqueue.h>
|
|
|
|
|
2000-09-22 23:35:14 +00:00
|
|
|
#include <gst/gstarch.h>
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
GstElementDetails gst_queue_details = {
|
|
|
|
"Queue",
|
|
|
|
"Connection",
|
|
|
|
"Simple data queue",
|
|
|
|
VERSION,
|
|
|
|
"Erik Walthinsen <omega@cse.ogi.edu>",
|
|
|
|
"(C) 1999",
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/* Queue signals and args */
|
|
|
|
enum {
|
|
|
|
/* FILL ME */
|
|
|
|
LAST_SIGNAL
|
|
|
|
};
|
|
|
|
|
|
|
|
enum {
|
|
|
|
ARG_0,
|
|
|
|
ARG_LEVEL,
|
2000-02-13 15:20:49 +00:00
|
|
|
ARG_MAX_LEVEL,
|
2000-01-30 09:03:00 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static void gst_queue_class_init (GstQueueClass *klass);
|
|
|
|
static void gst_queue_init (GstQueue *queue);
|
2000-01-30 09:03:00 +00:00
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static void gst_queue_set_arg (GtkObject *object, GtkArg *arg, guint id);
|
|
|
|
static void gst_queue_get_arg (GtkObject *object, GtkArg *arg, guint id);
|
2000-10-30 21:02:08 +00:00
|
|
|
|
Another big set of changes. Connections are now also pullfunc based. gstqueue has been updated, I don't know of any ...
Original commit message from CVS:
Another big set of changes. Connections are now also pullfunc based.
gstqueue has been updated, I don't know of any other connections offhand.
There are still a few things that need doing, specifically the concept
of a source or connection with connections to multiple thread contexts is
not dealt with. This may force us to move the threadstate from the
element to the pad, maybe keeping the element's copy for simple cases.
Then the Bin would create a structure to pass to the cothreaded _wrappers
of any such elements, which would detail the pads that are to be dealt with
by this particular cothread context.
That will speed things up to, since we don't have to look through the list
of all pads for every Src or Connection element for every iteration, we can
simply step through the list provided by the plan. Special case might even
have a single pad pointer sitting there to trump the list, if there's only
one (the common case anyway).
Task 23098 is tracking these changes. The main task 22588 depends on that
subtask, as well as 22240, which is a consistency check on PAD_DISABLED.
2000-12-08 10:33:01 +00:00
|
|
|
static void gst_queue_pull (GstPad *pad);
|
2000-11-25 14:18:47 +00:00
|
|
|
static void gst_queue_chain (GstPad *pad, GstBuffer *buf);
|
|
|
|
|
|
|
|
static void gst_queue_flush (GstQueue *queue);
|
|
|
|
|
|
|
|
static GstElementStateReturn gst_queue_change_state (GstElement *element);
|
2000-10-30 21:02:08 +00:00
|
|
|
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
static GstConnectionClass *parent_class = NULL;
|
2000-02-27 23:18:38 +00:00
|
|
|
//static guint gst_queue_signals[LAST_SIGNAL] = { 0 };
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
GtkType
|
|
|
|
gst_queue_get_type(void) {
|
|
|
|
static GtkType queue_type = 0;
|
|
|
|
|
|
|
|
if (!queue_type) {
|
|
|
|
static const GtkTypeInfo queue_info = {
|
|
|
|
"GstQueue",
|
|
|
|
sizeof(GstQueue),
|
|
|
|
sizeof(GstQueueClass),
|
|
|
|
(GtkClassInitFunc)gst_queue_class_init,
|
|
|
|
(GtkObjectInitFunc)gst_queue_init,
|
|
|
|
(GtkArgSetFunc)gst_queue_set_arg,
|
|
|
|
(GtkArgGetFunc)gst_queue_get_arg,
|
|
|
|
(GtkClassInitFunc)NULL,
|
|
|
|
};
|
2000-11-25 14:18:47 +00:00
|
|
|
queue_type = gtk_type_unique (GST_TYPE_CONNECTION, &queue_info);
|
2000-01-30 09:03:00 +00:00
|
|
|
}
|
|
|
|
return queue_type;
|
|
|
|
}
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static void
|
|
|
|
gst_queue_class_init (GstQueueClass *klass)
|
|
|
|
{
|
2000-01-30 09:03:00 +00:00
|
|
|
GtkObjectClass *gtkobject_class;
|
2000-10-30 21:02:08 +00:00
|
|
|
GstElementClass *gstelement_class;
|
2000-01-30 09:03:00 +00:00
|
|
|
GstConnectionClass *gstconnection_class;
|
|
|
|
|
|
|
|
gtkobject_class = (GtkObjectClass*)klass;
|
2000-10-30 21:02:08 +00:00
|
|
|
gstelement_class = (GstElementClass*)klass;
|
2000-01-30 09:03:00 +00:00
|
|
|
gstconnection_class = (GstConnectionClass*)klass;
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
parent_class = gtk_type_class (GST_TYPE_CONNECTION);
|
2000-01-30 09:03:00 +00:00
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
gtk_object_add_arg_type ("GstQueue::level", GTK_TYPE_INT,
|
|
|
|
GTK_ARG_READABLE, ARG_LEVEL);
|
|
|
|
gtk_object_add_arg_type ("GstQueue::max_level", GTK_TYPE_INT,
|
|
|
|
GTK_ARG_READWRITE, ARG_MAX_LEVEL);
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
gtkobject_class->set_arg = gst_queue_set_arg;
|
|
|
|
gtkobject_class->get_arg = gst_queue_get_arg;
|
2000-10-30 21:02:08 +00:00
|
|
|
|
|
|
|
gstelement_class->change_state = gst_queue_change_state;
|
2000-01-30 09:03:00 +00:00
|
|
|
}
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static void
|
|
|
|
gst_queue_init (GstQueue *queue)
|
|
|
|
{
|
|
|
|
queue->sinkpad = gst_pad_new ("sink", GST_PAD_SINK);
|
|
|
|
gst_pad_set_chain_function (queue->sinkpad, gst_queue_chain);
|
2000-12-11 00:24:32 +00:00
|
|
|
gst_element_add_pad (GST_ELEMENT (queue), queue->sinkpad);
|
2000-09-24 14:29:49 +00:00
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
queue->srcpad = gst_pad_new ("src", GST_PAD_SRC);
|
Another big set of changes. Connections are now also pullfunc based. gstqueue has been updated, I don't know of any ...
Original commit message from CVS:
Another big set of changes. Connections are now also pullfunc based.
gstqueue has been updated, I don't know of any other connections offhand.
There are still a few things that need doing, specifically the concept
of a source or connection with connections to multiple thread contexts is
not dealt with. This may force us to move the threadstate from the
element to the pad, maybe keeping the element's copy for simple cases.
Then the Bin would create a structure to pass to the cothreaded _wrappers
of any such elements, which would detail the pads that are to be dealt with
by this particular cothread context.
That will speed things up to, since we don't have to look through the list
of all pads for every Src or Connection element for every iteration, we can
simply step through the list provided by the plan. Special case might even
have a single pad pointer sitting there to trump the list, if there's only
one (the common case anyway).
Task 23098 is tracking these changes. The main task 22588 depends on that
subtask, as well as 22240, which is a consistency check on PAD_DISABLED.
2000-12-08 10:33:01 +00:00
|
|
|
gst_pad_set_pull_function (queue->srcpad, gst_queue_pull);
|
2000-11-25 14:18:47 +00:00
|
|
|
gst_element_add_pad (GST_ELEMENT (queue), queue->srcpad);
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
queue->queue = NULL;
|
|
|
|
queue->level_buffers = 0;
|
2000-10-09 20:01:17 +00:00
|
|
|
queue->max_buffers = 20;
|
2000-01-30 09:03:00 +00:00
|
|
|
queue->level_bytes = 0;
|
|
|
|
queue->size_buffers = 0;
|
|
|
|
queue->size_bytes = 0;
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
queue->emptylock = g_mutex_new ();
|
|
|
|
queue->emptycond = g_cond_new ();
|
2000-02-13 13:43:32 +00:00
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
queue->fulllock = g_mutex_new ();
|
|
|
|
queue->fullcond = g_cond_new ();
|
2000-01-30 09:03:00 +00:00
|
|
|
}
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static void
|
|
|
|
gst_queue_cleanup_buffers (gpointer data, const gpointer user_data)
|
2000-07-12 22:52:42 +00:00
|
|
|
{
|
|
|
|
DEBUG("queue: %s cleaning buffer %p\n", (gchar *)user_data, data);
|
2000-11-11 15:13:50 +00:00
|
|
|
|
|
|
|
gst_buffer_unref (GST_BUFFER (data));
|
2000-07-12 22:52:42 +00:00
|
|
|
}
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static void
|
|
|
|
gst_queue_flush (GstQueue *queue)
|
|
|
|
{
|
|
|
|
g_slist_foreach (queue->queue, gst_queue_cleanup_buffers,
|
|
|
|
(char *)gst_element_get_name (GST_ELEMENT (queue)));
|
|
|
|
g_slist_free (queue->queue);
|
|
|
|
|
2000-10-30 21:02:08 +00:00
|
|
|
queue->queue = NULL;
|
|
|
|
queue->level_buffers = 0;
|
|
|
|
}
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static void
|
|
|
|
gst_queue_chain (GstPad *pad, GstBuffer *buf)
|
|
|
|
{
|
2000-01-30 09:03:00 +00:00
|
|
|
GstQueue *queue;
|
|
|
|
gboolean tosignal = FALSE;
|
2000-11-11 15:13:50 +00:00
|
|
|
const guchar *name;
|
2000-01-30 09:03:00 +00:00
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
g_return_if_fail (pad != NULL);
|
|
|
|
g_return_if_fail (GST_IS_PAD (pad));
|
|
|
|
g_return_if_fail (buf != NULL);
|
2000-01-30 09:03:00 +00:00
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
queue = GST_QUEUE (pad->parent);
|
|
|
|
name = gst_element_get_name (GST_ELEMENT (queue));
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
/* we have to lock the queue since we span threads */
|
2000-02-13 13:43:32 +00:00
|
|
|
|
2000-09-24 14:29:49 +00:00
|
|
|
DEBUG("queue: try have queue lock\n");
|
2000-11-25 14:18:47 +00:00
|
|
|
GST_LOCK (queue);
|
|
|
|
DEBUG("queue: %s adding buffer %p %ld\n", name, buf, pthread_self ());
|
2000-09-22 23:35:14 +00:00
|
|
|
DEBUG("queue: have queue lock\n");
|
2000-07-12 22:52:42 +00:00
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
if (GST_BUFFER_FLAG_IS_SET (buf, GST_BUFFER_FLUSH)) {
|
|
|
|
gst_queue_flush (queue);
|
2000-07-12 22:52:42 +00:00
|
|
|
}
|
|
|
|
|
2000-06-25 21:38:00 +00:00
|
|
|
DEBUG("queue: %s: chain %d %p\n", name, queue->level_buffers, buf);
|
2000-01-30 09:03:00 +00:00
|
|
|
|
2000-09-22 23:35:14 +00:00
|
|
|
while (queue->level_buffers >= queue->max_buffers) {
|
2000-06-25 21:38:00 +00:00
|
|
|
DEBUG("queue: %s waiting %d\n", name, queue->level_buffers);
|
2000-09-22 23:35:14 +00:00
|
|
|
STATUS("%s: O\n");
|
2000-11-25 14:18:47 +00:00
|
|
|
GST_UNLOCK (queue);
|
|
|
|
g_mutex_lock (queue->fulllock);
|
|
|
|
g_cond_wait (queue->fullcond, queue->fulllock);
|
|
|
|
g_mutex_unlock (queue->fulllock);
|
|
|
|
GST_LOCK (queue);
|
2000-09-22 23:35:14 +00:00
|
|
|
STATUS("%s: O+\n");
|
2000-06-25 21:38:00 +00:00
|
|
|
DEBUG("queue: %s waiting done %d\n", name, queue->level_buffers);
|
2000-02-13 13:43:32 +00:00
|
|
|
}
|
|
|
|
|
2000-09-24 14:29:49 +00:00
|
|
|
/* put the buffer on the tail of the list */
|
2000-11-25 14:18:47 +00:00
|
|
|
queue->queue = g_slist_append (queue->queue, buf);
|
2000-07-12 22:52:42 +00:00
|
|
|
STATUS("%s: +\n");
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
/* if we were empty, but aren't any more, signal a condition */
|
2000-09-22 23:35:14 +00:00
|
|
|
tosignal = (queue->level_buffers >= 0);
|
2000-05-21 21:58:20 +00:00
|
|
|
queue->level_buffers++;
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
/* we can unlock now */
|
2000-09-22 23:35:14 +00:00
|
|
|
DEBUG("queue: %s chain %d end signal(%d,%p)\n", name, queue->level_buffers, tosignal, queue->emptycond);
|
2000-11-25 14:18:47 +00:00
|
|
|
GST_UNLOCK (queue);
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
if (tosignal) {
|
2000-11-25 14:18:47 +00:00
|
|
|
g_mutex_lock (queue->emptylock);
|
2000-11-01 22:11:48 +00:00
|
|
|
STATUS("%s: >\n");
|
2000-11-25 14:18:47 +00:00
|
|
|
g_cond_signal (queue->emptycond);
|
2000-09-24 14:29:49 +00:00
|
|
|
STATUS("%s: >>\n");
|
2000-11-25 14:18:47 +00:00
|
|
|
g_mutex_unlock (queue->emptylock);
|
2000-01-30 09:03:00 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static void
|
Another big set of changes. Connections are now also pullfunc based. gstqueue has been updated, I don't know of any ...
Original commit message from CVS:
Another big set of changes. Connections are now also pullfunc based.
gstqueue has been updated, I don't know of any other connections offhand.
There are still a few things that need doing, specifically the concept
of a source or connection with connections to multiple thread contexts is
not dealt with. This may force us to move the threadstate from the
element to the pad, maybe keeping the element's copy for simple cases.
Then the Bin would create a structure to pass to the cothreaded _wrappers
of any such elements, which would detail the pads that are to be dealt with
by this particular cothread context.
That will speed things up to, since we don't have to look through the list
of all pads for every Src or Connection element for every iteration, we can
simply step through the list provided by the plan. Special case might even
have a single pad pointer sitting there to trump the list, if there's only
one (the common case anyway).
Task 23098 is tracking these changes. The main task 22588 depends on that
subtask, as well as 22240, which is a consistency check on PAD_DISABLED.
2000-12-08 10:33:01 +00:00
|
|
|
gst_queue_pull (GstPad *pad)
|
2000-11-25 14:18:47 +00:00
|
|
|
{
|
Another big set of changes. Connections are now also pullfunc based. gstqueue has been updated, I don't know of any ...
Original commit message from CVS:
Another big set of changes. Connections are now also pullfunc based.
gstqueue has been updated, I don't know of any other connections offhand.
There are still a few things that need doing, specifically the concept
of a source or connection with connections to multiple thread contexts is
not dealt with. This may force us to move the threadstate from the
element to the pad, maybe keeping the element's copy for simple cases.
Then the Bin would create a structure to pass to the cothreaded _wrappers
of any such elements, which would detail the pads that are to be dealt with
by this particular cothread context.
That will speed things up to, since we don't have to look through the list
of all pads for every Src or Connection element for every iteration, we can
simply step through the list provided by the plan. Special case might even
have a single pad pointer sitting there to trump the list, if there's only
one (the common case anyway).
Task 23098 is tracking these changes. The main task 22588 depends on that
subtask, as well as 22240, which is a consistency check on PAD_DISABLED.
2000-12-08 10:33:01 +00:00
|
|
|
GstQueue *queue = GST_QUEUE (gst_pad_get_parent(pad));
|
2000-01-30 09:03:00 +00:00
|
|
|
GstBuffer *buf = NULL;
|
2000-09-24 14:29:49 +00:00
|
|
|
GSList *front;
|
2000-02-13 13:43:32 +00:00
|
|
|
gboolean tosignal = FALSE;
|
2000-11-11 15:13:50 +00:00
|
|
|
const guchar *name;
|
Another big set of changes. Connections are now also pullfunc based. gstqueue has been updated, I don't know of any ...
Original commit message from CVS:
Another big set of changes. Connections are now also pullfunc based.
gstqueue has been updated, I don't know of any other connections offhand.
There are still a few things that need doing, specifically the concept
of a source or connection with connections to multiple thread contexts is
not dealt with. This may force us to move the threadstate from the
element to the pad, maybe keeping the element's copy for simple cases.
Then the Bin would create a structure to pass to the cothreaded _wrappers
of any such elements, which would detail the pads that are to be dealt with
by this particular cothread context.
That will speed things up to, since we don't have to look through the list
of all pads for every Src or Connection element for every iteration, we can
simply step through the list provided by the plan. Special case might even
have a single pad pointer sitting there to trump the list, if there's only
one (the common case anyway).
Task 23098 is tracking these changes. The main task 22588 depends on that
subtask, as well as 22240, which is a consistency check on PAD_DISABLED.
2000-12-08 10:33:01 +00:00
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
name = gst_element_get_name (GST_ELEMENT (queue));
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
/* have to lock for thread-safety */
|
2000-11-01 22:11:48 +00:00
|
|
|
DEBUG("queue: %s try have queue lock\n", name);
|
2000-11-25 14:18:47 +00:00
|
|
|
GST_LOCK (queue);
|
|
|
|
DEBUG("queue: %s push %d %ld %p\n", name, queue->level_buffers, pthread_self (), queue->emptycond);
|
2000-11-01 22:11:48 +00:00
|
|
|
DEBUG("queue: %s have queue lock\n", name);
|
2000-01-30 09:03:00 +00:00
|
|
|
|
2000-07-12 22:52:42 +00:00
|
|
|
while (!queue->level_buffers) {
|
2000-11-01 22:11:48 +00:00
|
|
|
STATUS("queue: %s U released lock\n");
|
2000-11-25 14:18:47 +00:00
|
|
|
GST_UNLOCK (queue);
|
|
|
|
g_mutex_lock (queue->emptylock);
|
|
|
|
g_cond_wait (queue->emptycond, queue->emptylock);
|
|
|
|
g_mutex_unlock (queue->emptylock);
|
|
|
|
GST_LOCK (queue);
|
2000-11-01 22:11:48 +00:00
|
|
|
STATUS("queue: %s U- getting lock\n");
|
2000-01-30 09:03:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
front = queue->queue;
|
|
|
|
buf = (GstBuffer *)(front->data);
|
2000-11-25 14:18:47 +00:00
|
|
|
queue->queue = g_slist_remove_link (queue->queue, front);
|
|
|
|
g_slist_free (front);
|
|
|
|
|
2000-01-30 09:03:00 +00:00
|
|
|
queue->level_buffers--;
|
2000-07-12 22:52:42 +00:00
|
|
|
STATUS("%s: -\n");
|
2000-02-13 13:43:32 +00:00
|
|
|
tosignal = queue->level_buffers < queue->max_buffers;
|
2000-01-30 09:03:00 +00:00
|
|
|
GST_UNLOCK(queue);
|
2000-02-13 13:43:32 +00:00
|
|
|
|
|
|
|
if (tosignal) {
|
2000-11-25 14:18:47 +00:00
|
|
|
g_mutex_lock (queue->fulllock);
|
2000-09-22 23:35:14 +00:00
|
|
|
STATUS("%s: < \n");
|
2000-11-25 14:18:47 +00:00
|
|
|
g_cond_signal (queue->fullcond);
|
2000-09-22 23:35:14 +00:00
|
|
|
STATUS("%s: << \n");
|
2000-11-25 14:18:47 +00:00
|
|
|
g_mutex_unlock (queue->fulllock);
|
2000-02-13 13:43:32 +00:00
|
|
|
}
|
2000-05-21 21:58:20 +00:00
|
|
|
|
2000-09-24 14:29:49 +00:00
|
|
|
DEBUG("queue: %s pushing %d %p \n", name, queue->level_buffers, buf);
|
2000-11-25 14:18:47 +00:00
|
|
|
gst_pad_push (queue->srcpad, buf);
|
2000-09-24 14:29:49 +00:00
|
|
|
DEBUG("queue: %s pushing %d done \n", name, queue->level_buffers);
|
2000-02-13 13:43:32 +00:00
|
|
|
|
|
|
|
/* unlock now */
|
2000-01-30 09:03:00 +00:00
|
|
|
}
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static GstElementStateReturn
|
|
|
|
gst_queue_change_state (GstElement *element)
|
|
|
|
{
|
2000-10-30 21:02:08 +00:00
|
|
|
GstQueue *queue;
|
2000-11-25 14:18:47 +00:00
|
|
|
g_return_val_if_fail (GST_IS_QUEUE (element), GST_STATE_FAILURE);
|
2000-10-30 21:02:08 +00:00
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
queue = GST_QUEUE (element);
|
|
|
|
DEBUG("gstqueue: state pending %d\n", GST_STATE_PENDING (element));
|
2000-10-30 21:02:08 +00:00
|
|
|
|
|
|
|
/* if going down into NULL state, clear out buffers*/
|
2000-11-25 14:18:47 +00:00
|
|
|
if (GST_STATE_PENDING (element) == GST_STATE_READY) {
|
2000-10-30 21:02:08 +00:00
|
|
|
/* otherwise (READY or higher) we need to open the file */
|
2000-11-25 14:18:47 +00:00
|
|
|
gst_queue_flush (queue);
|
2000-10-30 21:02:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* if we haven't failed already, give the parent class a chance to ;-) */
|
2000-11-25 14:18:47 +00:00
|
|
|
if (GST_ELEMENT_CLASS (parent_class)->change_state)
|
|
|
|
return GST_ELEMENT_CLASS (parent_class)->change_state (element);
|
2000-10-30 21:02:08 +00:00
|
|
|
|
|
|
|
return GST_STATE_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2000-01-30 09:03:00 +00:00
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static void
|
|
|
|
gst_queue_set_arg (GtkObject *object, GtkArg *arg, guint id)
|
|
|
|
{
|
2000-01-30 09:03:00 +00:00
|
|
|
GstQueue *queue;
|
|
|
|
|
|
|
|
/* it's not null if we got it, but it might not be ours */
|
2000-11-25 14:18:47 +00:00
|
|
|
g_return_if_fail (GST_IS_QUEUE (object));
|
|
|
|
|
|
|
|
queue = GST_QUEUE (object);
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
switch(id) {
|
2000-02-13 15:20:49 +00:00
|
|
|
case ARG_MAX_LEVEL:
|
2000-11-25 14:18:47 +00:00
|
|
|
queue->max_buffers = GTK_VALUE_INT (*arg);
|
2000-02-13 15:20:49 +00:00
|
|
|
break;
|
2000-01-30 09:03:00 +00:00
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-11-25 14:18:47 +00:00
|
|
|
static void
|
|
|
|
gst_queue_get_arg (GtkObject *object, GtkArg *arg, guint id)
|
|
|
|
{
|
2000-01-30 09:03:00 +00:00
|
|
|
GstQueue *queue;
|
|
|
|
|
|
|
|
/* it's not null if we got it, but it might not be ours */
|
2000-11-25 14:18:47 +00:00
|
|
|
g_return_if_fail (GST_IS_QUEUE (object));
|
|
|
|
|
|
|
|
queue = GST_QUEUE (object);
|
2000-01-30 09:03:00 +00:00
|
|
|
|
|
|
|
switch (id) {
|
|
|
|
case ARG_LEVEL:
|
2000-11-25 14:18:47 +00:00
|
|
|
GTK_VALUE_INT (*arg) = queue->level_buffers;
|
2000-01-30 09:03:00 +00:00
|
|
|
break;
|
2000-02-13 15:20:49 +00:00
|
|
|
case ARG_MAX_LEVEL:
|
2000-11-25 14:18:47 +00:00
|
|
|
GTK_VALUE_INT (*arg) = queue->max_buffers;
|
2000-02-13 15:20:49 +00:00
|
|
|
break;
|
2000-01-30 09:03:00 +00:00
|
|
|
default:
|
|
|
|
arg->type = GTK_TYPE_INVALID;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|