laag-libzmq 4.2.3.0

data/vendor/github.com/zeromq/libzmq/src/dist.cpp

@@ -0,0 +1,235 @@
+/*
+    Copyright (c) 2007-2016 Contributors as noted in the AUTHORS file
+
+    This file is part of libzmq, the ZeroMQ core engine in C++.
+
+    libzmq is free software; you can redistribute it and/or modify it under
+    the terms of the GNU Lesser General Public License (LGPL) as published
+    by the Free Software Foundation; either version 3 of the License, or
+    (at your option) any later version.
+
+    As a special exception, the Contributors give you permission to link
+    this library with independent modules to produce an executable,
+    regardless of the license terms of these independent modules, and to
+    copy and distribute the resulting executable under terms of your choice,
+    provided that you also meet, for each linked independent module, the
+    terms and conditions of the license of that module. An independent
+    module is a module which is not derived from or based on this library.
+    If you modify this library, you must extend this exception to your
+    version of the library.
+
+    libzmq 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 Lesser General Public
+    License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#include "precompiled.hpp"
+#include "dist.hpp"
+#include "pipe.hpp"
+#include "err.hpp"
+#include "msg.hpp"
+#include "likely.hpp"
+
+zmq::dist_t::dist_t () :
+    matching (0),
+    active (0),
+    eligible (0),
+    more (false)
+{
+}
+
+zmq::dist_t::~dist_t ()
+{
+    zmq_assert (pipes.empty ());
+}
+
+void zmq::dist_t::attach (pipe_t *pipe_)
+{
+    //  If we are in the middle of sending a message, we'll add new pipe
+    //  into the list of eligible pipes. Otherwise we add it to the list
+    //  of active pipes.
+    if (more) {
+        pipes.push_back (pipe_);
+        pipes.swap (eligible, pipes.size () - 1);
+        eligible++;
+    }
+    else {
+        pipes.push_back (pipe_);
+        pipes.swap (active, pipes.size () - 1);
+        active++;
+        eligible++;
+    }
+}
+
+void zmq::dist_t::match (pipe_t *pipe_)
+{
+    //  If pipe is already matching do nothing.
+    if (pipes.index (pipe_) < matching)
+        return;
+
+    //  If the pipe isn't eligible, ignore it.
+    if (pipes.index (pipe_) >= eligible)
+        return;
+
+    //  Mark the pipe as matching.
+    pipes.swap (pipes.index (pipe_), matching);
+    matching++;
+}
+
+void zmq::dist_t::reverse_match ()
+{
+    pipes_t::size_type prev_matching = matching;
+
+    // Reset matching to 0
+    unmatch();
+
+    // Mark all matching pipes as not matching and vice-versa.
+    // To do this, push all pipes that are eligible but not
+    // matched - i.e. between "matching" and "eligible" -
+    // to the beginning of the queue.
+    for (pipes_t::size_type i = prev_matching; i < eligible; ++i) {
+        pipes.swap(i, matching++);
+    }
+}
+
+void zmq::dist_t::unmatch ()
+{
+    matching = 0;
+}
+
+void zmq::dist_t::pipe_terminated (pipe_t *pipe_)
+{
+    //  Remove the pipe from the list; adjust number of matching, active and/or
+    //  eligible pipes accordingly.
+    if (pipes.index (pipe_) < matching) {
+        pipes.swap (pipes.index (pipe_), matching - 1);
+        matching--;
+    }
+    if (pipes.index (pipe_) < active) {
+        pipes.swap (pipes.index (pipe_), active - 1);
+        active--;
+    }
+    if (pipes.index (pipe_) < eligible) {
+        pipes.swap (pipes.index (pipe_), eligible - 1);
+        eligible--;
+    }
+
+    pipes.erase (pipe_);
+}
+
+void zmq::dist_t::activated (pipe_t *pipe_)
+{
+    //  Move the pipe from passive to eligible state.
+    if (eligible < pipes.size ()) {
+        pipes.swap (pipes.index (pipe_), eligible);
+        eligible++;
+    }
+
+    //  If there's no message being sent at the moment, move it to
+    //  the active state.
+    if (!more && active < pipes.size ()) {
+        pipes.swap (eligible - 1, active);
+        active++;
+    }
+}
+
+int zmq::dist_t::send_to_all (msg_t *msg_)
+{
+    matching = active;
+    return send_to_matching (msg_);
+}
+
+int zmq::dist_t::send_to_matching (msg_t *msg_)
+{
+    //  Is this end of a multipart message?
+    bool msg_more = msg_->flags () & msg_t::more ? true : false;
+
+    //  Push the message to matching pipes.
+    distribute (msg_);
+
+    //  If multipart message is fully sent, activate all the eligible pipes.
+    if (!msg_more)
+        active = eligible;
+
+    more = msg_more;
+
+    return 0;
+}
+
+void zmq::dist_t::distribute (msg_t *msg_)
+{
+    //  If there are no matching pipes available, simply drop the message.
+    if (matching == 0) {
+        int rc = msg_->close ();
+        errno_assert (rc == 0);
+        rc = msg_->init ();
+        errno_assert (rc == 0);
+        return;
+    }
+
+    if (msg_->is_vsm ()) {
+        for (pipes_t::size_type i = 0; i < matching; ++i)
+            if(!write (pipes [i], msg_))
+                --i; //  Retry last write because index will have been swapped
+        int rc = msg_->close();
+        errno_assert (rc == 0);
+        rc = msg_->init ();
+        errno_assert (rc == 0);
+        return;
+    }
+
+    //  Add matching-1 references to the message. We already hold one reference,
+    //  that's why -1.
+    msg_->add_refs ((int) matching - 1);
+
+    //  Push copy of the message to each matching pipe.
+    int failed = 0;
+    for (pipes_t::size_type i = 0; i < matching; ++i)
+        if (!write (pipes [i], msg_)) {
+            ++failed;
+            --i; //  Retry last write because index will have been swapped
+        }
+    if (unlikely (failed))
+        msg_->rm_refs (failed);
+
+    //  Detach the original message from the data buffer. Note that we don't
+    //  close the message. That's because we've already used all the references.
+    int rc = msg_->init ();
+    errno_assert (rc == 0);
+}
+
+bool zmq::dist_t::has_out ()
+{
+    return true;
+}
+
+bool zmq::dist_t::write (pipe_t *pipe_, msg_t *msg_)
+{
+    if (!pipe_->write (msg_)) {
+        pipes.swap (pipes.index (pipe_), matching - 1);
+        matching--;
+        pipes.swap (pipes.index (pipe_), active - 1);
+        active--;
+        pipes.swap (active, eligible - 1);
+        eligible--;
+        return false;
+    }
+    if (!(msg_->flags () & msg_t::more))
+        pipe_->flush ();
+    return true;
+}
+
+bool zmq::dist_t::check_hwm ()
+{
+    for (pipes_t::size_type i = 0; i < matching; ++i)
+        if (!pipes [i]->check_hwm ())
+            return false;
+
+    return true;
+}
+
+

data/vendor/github.com/zeromq/libzmq/src/dist.hpp

@@ -0,0 +1,120 @@
+/*
+    Copyright (c) 2007-2016 Contributors as noted in the AUTHORS file
+
+    This file is part of libzmq, the ZeroMQ core engine in C++.
+
+    libzmq is free software; you can redistribute it and/or modify it under
+    the terms of the GNU Lesser General Public License (LGPL) as published
+    by the Free Software Foundation; either version 3 of the License, or
+    (at your option) any later version.
+
+    As a special exception, the Contributors give you permission to link
+    this library with independent modules to produce an executable,
+    regardless of the license terms of these independent modules, and to
+    copy and distribute the resulting executable under terms of your choice,
+    provided that you also meet, for each linked independent module, the
+    terms and conditions of the license of that module. An independent
+    module is a module which is not derived from or based on this library.
+    If you modify this library, you must extend this exception to your
+    version of the library.
+
+    libzmq 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 Lesser General Public
+    License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#ifndef __ZMQ_DIST_HPP_INCLUDED__
+#define __ZMQ_DIST_HPP_INCLUDED__
+
+#include <vector>
+
+#include "array.hpp"
+#include "pipe.hpp"
+
+namespace zmq
+{
+
+    class pipe_t;
+    class msg_t;
+
+    //  Class manages a set of outbound pipes. It sends each messages to
+    //  each of them.
+    class dist_t
+    {
+    public:
+
+        dist_t ();
+        ~dist_t ();
+
+        //  Adds the pipe to the distributor object.
+        void attach (zmq::pipe_t *pipe_);
+
+        //  Activates pipe that have previously reached high watermark.
+        void activated (zmq::pipe_t *pipe_);
+
+        //  Mark the pipe as matching. Subsequent call to send_to_matching
+        //  will send message also to this pipe.
+        void match (zmq::pipe_t *pipe_);
+
+        //  Marks all pipes that are not matched as matched and vice-versa.
+        void reverse_match();
+
+        //  Mark all pipes as non-matching.
+        void unmatch ();
+
+        //  Removes the pipe from the distributor object.
+        void pipe_terminated (zmq::pipe_t *pipe_);
+
+        //  Send the message to the matching outbound pipes.
+        int send_to_matching (zmq::msg_t *msg_);
+
+        //  Send the message to all the outbound pipes.
+        int send_to_all (zmq::msg_t *msg_);
+
+        bool has_out ();
+
+        // check HWM of all pipes matching
+        bool check_hwm ();
+
+    private:
+
+        //  Write the message to the pipe. Make the pipe inactive if writing
+        //  fails. In such a case false is returned.
+        bool write (zmq::pipe_t *pipe_, zmq::msg_t *msg_);
+
+        //  Put the message to all active pipes.
+        void distribute (zmq::msg_t *msg_);
+
+        //  List of outbound pipes.
+        typedef array_t <zmq::pipe_t, 2> pipes_t;
+        pipes_t pipes;
+
+        //  Number of all the pipes to send the next message to.
+        pipes_t::size_type matching;
+
+        //  Number of active pipes. All the active pipes are located at the
+        //  beginning of the pipes array. These are the pipes the messages
+        //  can be sent to at the moment.
+        pipes_t::size_type active;
+
+        //  Number of pipes eligible for sending messages to. This includes all
+        //  the active pipes plus all the pipes that we can in theory send
+        //  messages to (the HWM is not yet reached), but sending a message
+        //  to them would result in partial message being delivered, ie. message
+        //  with initial parts missing.
+        pipes_t::size_type eligible;
+
+        //  True if last we are in the middle of a multipart message.
+        bool more;
+
+        dist_t (const dist_t&);
+        const dist_t &operator = (const dist_t&);
+    };
+
+}
+
+#endif

data/vendor/github.com/zeromq/libzmq/src/encoder.hpp

@@ -0,0 +1,189 @@
+/*
+    Copyright (c) 2007-2016 Contributors as noted in the AUTHORS file
+
+    This file is part of libzmq, the ZeroMQ core engine in C++.
+
+    libzmq is free software; you can redistribute it and/or modify it under
+    the terms of the GNU Lesser General Public License (LGPL) as published
+    by the Free Software Foundation; either version 3 of the License, or
+    (at your option) any later version.
+
+    As a special exception, the Contributors give you permission to link
+    this library with independent modules to produce an executable,
+    regardless of the license terms of these independent modules, and to
+    copy and distribute the resulting executable under terms of your choice,
+    provided that you also meet, for each linked independent module, the
+    terms and conditions of the license of that module. An independent
+    module is a module which is not derived from or based on this library.
+    If you modify this library, you must extend this exception to your
+    version of the library.
+
+    libzmq 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 Lesser General Public
+    License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#ifndef __ZMQ_ENCODER_HPP_INCLUDED__
+#define __ZMQ_ENCODER_HPP_INCLUDED__
+
+#if defined(_MSC_VER)
+#ifndef NOMINMAX
+#define NOMINMAX
+#endif
+#endif
+
+#include <stddef.h>
+#include <string.h>
+#include <stdlib.h>
+#include <algorithm>
+
+#include "err.hpp"
+#include "msg.hpp"
+#include "i_encoder.hpp"
+
+namespace zmq
+{
+
+    //  Helper base class for encoders. It implements the state machine that
+    //  fills the outgoing buffer. Derived classes should implement individual
+    //  state machine actions.
+
+    template <typename T> class encoder_base_t : public i_encoder
+    {
+    public:
+
+        inline encoder_base_t (size_t bufsize_) :
+            write_pos(0),
+            to_write(0),
+            next(NULL),
+            new_msg_flag(false),
+            bufsize (bufsize_),
+            in_progress (NULL)
+        {
+            buf = (unsigned char*) malloc (bufsize_);
+            alloc_assert (buf);
+        }
+
+        //  The destructor doesn't have to be virtual. It is made virtual
+        //  just to keep ICC and code checking tools from complaining.
+        inline virtual ~encoder_base_t ()
+        {
+            free (buf);
+        }
+
+        //  The function returns a batch of binary data. The data
+        //  are filled to a supplied buffer. If no buffer is supplied (data_
+        //  points to NULL) decoder object will provide buffer of its own.
+        inline size_t encode (unsigned char **data_, size_t size_)
+        {
+            unsigned char *buffer = !*data_ ? buf : *data_;
+            size_t buffersize = !*data_ ? bufsize : size_;
+
+            if (in_progress == NULL)
+                return 0;
+
+            size_t pos = 0;
+            while (pos < buffersize) {
+
+                //  If there are no more data to return, run the state machine.
+                //  If there are still no data, return what we already have
+                //  in the buffer.
+                if (!to_write) {
+                    if (new_msg_flag) {
+                        int rc = in_progress->close ();
+                        errno_assert (rc == 0);
+                        rc = in_progress->init ();
+                        errno_assert (rc == 0);
+                        in_progress = NULL;
+                        break;
+                    }
+                    (static_cast <T*> (this)->*next) ();
+                }
+
+                //  If there are no data in the buffer yet and we are able to
+                //  fill whole buffer in a single go, let's use zero-copy.
+                //  There's no disadvantage to it as we cannot stuck multiple
+                //  messages into the buffer anyway. Note that subsequent
+                //  write(s) are non-blocking, thus each single write writes
+                //  at most SO_SNDBUF bytes at once not depending on how large
+                //  is the chunk returned from here.
+                //  As a consequence, large messages being sent won't block
+                //  other engines running in the same I/O thread for excessive
+                //  amounts of time.
+                if (!pos && !*data_ && to_write >= buffersize) {
+                    *data_ = write_pos;
+                    pos = to_write;
+                    write_pos = NULL;
+                    to_write = 0;
+                    return pos;
+                }
+
+                //  Copy data to the buffer. If the buffer is full, return.
+                size_t to_copy = std::min (to_write, buffersize - pos);
+                memcpy (buffer + pos, write_pos, to_copy);
+                pos += to_copy;
+                write_pos += to_copy;
+                to_write -= to_copy;
+            }
+
+            *data_ = buffer;
+            return pos;
+        }
+
+        void load_msg (msg_t *msg_)
+        {
+            zmq_assert (in_progress == NULL);
+            in_progress = msg_;
+            (static_cast <T*> (this)->*next) ();
+        }
+
+    protected:
+
+        //  Prototype of state machine action.
+        typedef void (T::*step_t) ();
+
+        //  This function should be called from derived class to write the data
+        //  to the buffer and schedule next state machine action.
+        inline void next_step (void *write_pos_, size_t to_write_,
+            step_t next_, bool new_msg_flag_)
+        {
+            write_pos = (unsigned char*) write_pos_;
+            to_write = to_write_;
+            next = next_;
+            new_msg_flag = new_msg_flag_;
+        }
+
+    private:
+
+        //  Where to get the data to write from.
+        unsigned char *write_pos;
+
+        //  How much data to write before next step should be executed.
+        size_t to_write;
+
+        //  Next step. If set to NULL, it means that associated data stream
+        //  is dead.
+        step_t next;
+
+        bool new_msg_flag;
+
+        //  The buffer for encoded data.
+        size_t bufsize;
+        unsigned char *buf;
+
+        encoder_base_t (const encoder_base_t&);
+        void operator = (const encoder_base_t&);
+
+    protected:
+
+        msg_t *in_progress;
+
+    };
+}
+
+#endif
+