4 * @brief Implementation of send_queue_t.
9 * Copyright (C) 2005 Jan Hutter, Martin Willi
10 * Hochschule fuer Technik Rapperswil
12 * This program is free software; you can redistribute it and/or modify it
13 * under the terms of the GNU General Public License as published by the
14 * Free Software Foundation; either version 2 of the License, or (at your
15 * option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
17 * This program is distributed in the hope that it will be useful, but
18 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
19 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
25 #include "send_queue.h"
27 #include <utils/linked_list.h>
30 typedef struct private_send_queue_t private_send_queue_t
;
33 * @brief Private Variables and Functions of send_queue class
36 struct private_send_queue_t
{
38 * Public part of the send_queue_t object
43 * The packets are stored in a linked list
48 * access to linked_list is locked through this mutex
50 pthread_mutex_t mutex
;
53 * If the queue is empty a thread has to wait
54 * This condvar is used to wake up such a thread
56 pthread_cond_t condvar
;
61 * implements send_queue_t.get_count
63 static int get_count(private_send_queue_t
*this)
66 pthread_mutex_lock(&(this->mutex
));
67 count
= this->list
->get_count(this->list
);
68 pthread_mutex_unlock(&(this->mutex
));
73 * implements send_queue_t.get
75 static packet_t
*get(private_send_queue_t
*this)
79 pthread_mutex_lock(&(this->mutex
));
80 /* go to wait while no packets available */
82 while(this->list
->get_count(this->list
) == 0)
84 /* add mutex unlock handler for cancellation, enable cancellation */
85 pthread_cleanup_push((void(*)(void*))pthread_mutex_unlock
, (void*)&(this->mutex
));
86 pthread_setcancelstate(PTHREAD_CANCEL_ENABLE
, &oldstate
);
87 pthread_cond_wait( &(this->condvar
), &(this->mutex
));
89 /* reset cancellation, remove mutex-unlock handler (without executing) */
90 pthread_setcancelstate(oldstate
, NULL
);
91 pthread_cleanup_pop(0);
93 this->list
->remove_first(this->list
,(void **)&packet
);
94 pthread_mutex_unlock(&(this->mutex
));
99 * implements send_queue_t.add
101 static void add(private_send_queue_t
*this, packet_t
*packet
)
103 pthread_mutex_lock(&(this->mutex
));
104 this->list
->insert_last(this->list
,packet
);
105 pthread_cond_signal( &(this->condvar
));
106 pthread_mutex_unlock(&(this->mutex
));
110 * implements send_queue_t.destroy
112 static void destroy (private_send_queue_t
*this)
115 /* destroy all packets in list before destroying list */
116 while (this->list
->get_count(this->list
) > 0)
119 if (this->list
->remove_first(this->list
,(void *) &packet
) != SUCCESS
)
121 this->list
->destroy(this->list
);
124 packet
->destroy(packet
);
126 this->list
->destroy(this->list
);
128 pthread_mutex_destroy(&(this->mutex
));
130 pthread_cond_destroy(&(this->condvar
));
137 * Documented in header
139 send_queue_t
*send_queue_create()
141 private_send_queue_t
*this = malloc_thing(private_send_queue_t
);
143 this->public.get_count
= (int(*)(send_queue_t
*)) get_count
;
144 this->public.get
= (packet_t
*(*)(send_queue_t
*)) get
;
145 this->public.add
= (void(*)(send_queue_t
*, packet_t
*)) add
;
146 this->public.destroy
= (void(*)(send_queue_t
*)) destroy
;
148 this->list
= linked_list_create();
149 pthread_mutex_init(&(this->mutex
), NULL
);
150 pthread_cond_init(&(this->condvar
), NULL
);
152 return (&this->public);