blob: df7ae8ce558ce1bd49afdceb5ff6d4b073e6beff (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/***************************************************************************
* threadsafe_queue_priority.cc
*
* Tue Sep 27 14:01:24 CEST 2005
* Copyright 2005 Bent Bisballe Nyeng
* deva@aasimon.org
****************************************************************************/
/*
* This file is part of MIaV.
*
* MIaV is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* MIaV 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with MIaV; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
#include "config.h"
#include "threadsafe_queue_priority.h"
#include "util.h"
ThreadSafeQueuePriority::ThreadSafeQueuePriority(Info* i, unsigned int number)
// : ThreadSafeQueue< Frame* >()
{
info = i;
framenumber = number;
}
ThreadSafeQueuePriority::~ThreadSafeQueuePriority()
{
}
void ThreadSafeQueuePriority::push(Frame *frame)
{
// Lock mutex
// pthread_mutex_lock( &mutex );
mutex.lock();
queue.push(frame);
// pthread_mutex_unlock( &mutex );
mutex.unlock();
// Unlock mutex
// sem_post(&semaphore);
semaphore.post();
}
Frame *ThreadSafeQueuePriority::pop()
{
semaphore.wait();
// sem_wait(&semaphore);
Frame *tmpframe = NULL;
Frame *frame = NULL;
while( frame == NULL ) {
// Lock mutex
// pthread_mutex_lock( &mutex );
mutex.lock();
tmpframe = queue.top();
if(tmpframe && tmpframe->number == framenumber ) {
queue.pop();
frame = tmpframe;
framenumber++;
}
// pthread_mutex_unlock( &mutex );
mutex.unlock();
// Unlock mutex
if(frame == NULL) sleep_0_2_frame();
}
return frame;
}
int ThreadSafeQueuePriority::size()
{
int sz;
// Lock mutex
// pthread_mutex_lock( &mutex );
mutex.lock();
sz = queue.size();
// pthread_mutex_unlock( &mutex );
mutex.unlock();
// Unlock mutex
return sz;
}
|
