summaryrefslogtreecommitdiff
path: root/src/ypollset.cpp
blob: a90d04271072de82282ed0e496a1cc20c936d599 (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
/*
    Copyright (c) 2007-2009 FastMQ Inc.

    This file is part of 0MQ.

    0MQ is free software; you can redistribute it and/or modify it under
    the terms of the Lesser GNU General Public License as published by
    the Free Software Foundation; either version 3 of the License, or
    (at your option) any later version.

    0MQ 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
    Lesser GNU General Public License for more details.

    You should have received a copy of the Lesser GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

#include "ypollset.hpp"

zmq::ypollset_t::ypollset_t ()
{
}

void zmq::ypollset_t::signal (int signal_)
{
    zmq_assert (signal_ >= 0 && signal_ < wait_signal);
    if (bits.btsr (signal_, wait_signal))
        sem.post (); 
}

zmq::ypollset_t::signals_t zmq::ypollset_t::poll ()
{
    signals_t result = 0;
    while (!result) {
        result = bits.izte (signals_t (1) << wait_signal, 0);
        if (!result) {
            sem.wait ();
            result = bits.xchg (0);
        }

        //  If btsr was really atomic, result would never be 0 at this
        //  point, i.e. no looping would be possible. However, to
        //  support even CPU architectures without CAS instruction
        //  we allow btsr to be composed of two independent atomic
        //  operation (set and reset). In such case looping can occur
        //  sporadically.
    }
    return result;      
}

zmq::ypollset_t::signals_t zmq::ypollset_t::check ()
{
    return bits.xchg (0);
}