summaryrefslogtreecommitdiff
path: root/src/stable/synchroheap.h
blob: 845e08a4ddaa64d305ccdc2149acb4fbb2bb78e2 (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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
/*
 * Copyright (C) 2007-2013 Xagasoft, All rights reserved.
 *
 * This file is part of the libbu++ library and is released under the
 * terms of the license contained in the file LICENSE.
 */

#ifndef BU_SYNCHRO_HEAP_H
#define BU_SYNCHRO_HEAP_H

#include "bu/heap.h"
#include "bu/mutex.h"
#include "bu/condition.h"

namespace Bu
{
    template<typename item, typename cmpfunc=__basicLTCmp<item>,
        typename itemalloc=std::allocator<item> >
    class SynchroHeap
    {
    public:
        SynchroHeap()
        {
        }

        virtual ~SynchroHeap()
        {
        }

        void enqueue( item i )
        {
            imData.lock();
            hData.enqueue( i );
            icBlock.signal();
            imData.unlock();
        }

        item dequeue( bool bBlock=false )
        {
            imData.lock();
            if( hData.isEmpty() )
            {
                imData.unlock();

                if( bBlock )
                {
                    icBlock.lock();

                    while( hData.isEmpty() )
                        icBlock.wait();

                    imData.lock();
                    try
                    {
                        item iRet = hData.dequeue();
                        imData.unlock();
                        icBlock.unlock();
                        return iRet;
                    }
                    catch(...)
                    {
                        imData.unlock();
                        icBlock.unlock();
                        throw;
                    }
                }
                throw HeapException("Heap empty.");
            }
            else
            {
                try
                {
                    item iRet = hData.dequeue();
                    imData.unlock();
                    return iRet;
                }
                catch(...)
                {
                    imData.unlock();
                    throw;
                }
            }
        }

        item dequeue( int iSec, int iUSec )
        {
            imData.lock();
            if( hData.isEmpty() )
            {
                imData.unlock();

                icBlock.lock();

                icBlock.wait( iSec, iUSec );

                imData.lock();
                try
                {
                    item iRet = hData.dequeue();
                    imData.unlock();
                    icBlock.unlock();
                    return iRet;
                }
                catch(...)
                {
                    imData.unlock();
                    icBlock.unlock();
                    throw;
                }
            }
            else
            {
                try
                {
                    item iRet = hData.dequeue();
                    imData.unlock();
                    return iRet;
                }
                catch(...)
                {
                    imData.unlock();
                    throw;
                }
            }
        }
        
        bool isEmpty()
        {
            imData.lock();
            bool bRet = hData.isEmpty();
            imData.unlock();
            return bRet;
        }

        int getSize()
        {
            imData.lock();
            int iRet = hData.getSize();
            imData.unlock();
            return iRet;
        }

    private:
        Heap< item, cmpfunc, itemalloc > hData;
        Mutex imData;
        Condition icBlock;
    };
};

#endif