libzmq/src/ctx.hpp

152 lines
4.7 KiB
C++
Raw Normal View History

2009-07-29 12:07:54 +02:00
/*
Copyright (c) 2007-2010 iMatix Corporation
2009-07-29 12:07:54 +02:00
This file is part of 0MQ.
0MQ is free software; you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License as published by
2009-07-29 12:07:54 +02:00
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
GNU Lesser General Public License for more details.
2009-07-29 12:07:54 +02:00
You should have received a copy of the GNU Lesser General Public License
2009-07-29 12:07:54 +02:00
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
2010-05-05 14:24:54 +02:00
#ifndef __ZMQ_CTX_HPP_INCLUDED__
#define __ZMQ_CTX_HPP_INCLUDED__
2009-07-29 12:07:54 +02:00
#include <map>
2010-08-12 08:16:18 +02:00
#include <vector>
2009-07-29 12:07:54 +02:00
#include <string>
#include "../include/zmq.h"
#include "mailbox.hpp"
#include "semaphore.hpp"
2009-07-29 12:07:54 +02:00
#include "ypipe.hpp"
2010-08-31 21:03:34 +02:00
#include "array.hpp"
2009-07-29 12:07:54 +02:00
#include "config.hpp"
#include "mutex.hpp"
#include "stdint.hpp"
#include "thread.hpp"
#include "options.hpp"
2009-07-29 12:07:54 +02:00
2009-08-03 11:30:13 +02:00
namespace zmq
2009-07-29 12:07:54 +02:00
{
// Information associated with inproc endpoint. Note that endpoint options
// are registered as well so that the peer can access them without a need
// for synchronisation, handshaking or similar.
struct endpoint_t
{
class socket_base_t *socket;
options_t options;
};
2010-05-05 14:24:54 +02:00
// Context object encapsulates all the global state associated with
// the library.
2009-07-29 12:07:54 +02:00
2010-05-05 14:24:54 +02:00
class ctx_t
2009-07-29 12:07:54 +02:00
{
public:
2010-05-05 14:24:54 +02:00
// Create the context object. The argument specifies the size
// of I/O thread pool to create.
2010-05-05 14:24:54 +02:00
ctx_t (uint32_t io_threads_);
2009-07-29 12:07:54 +02:00
2009-09-04 16:02:41 +02:00
// This function is called when user invokes zmq_term. If there are
// no more sockets open it'll cause all the infrastructure to be shut
// down. If there are open sockets still, the deallocation happens
// after the last one is closed.
2010-08-12 08:16:18 +02:00
int terminate ();
2009-07-29 12:07:54 +02:00
// Create and destroy a socket.
2009-08-09 16:30:22 +02:00
class socket_base_t *create_socket (int type_);
void destroy_socket (class socket_base_t *socket_);
2009-09-04 16:02:41 +02:00
// Send command to the destination thread.
void send_command (uint32_t tid_, const command_t &command_);
2009-07-29 12:07:54 +02:00
// Returns the I/O thread that is the least busy at the moment.
// Affinity specifies which I/O threads are eligible (0 = all).
// Returns NULL is no I/O thread is available.
class io_thread_t *choose_io_thread (uint64_t affinity_);
2009-07-29 12:07:54 +02:00
// Returns reaper thread object.
class object_t *get_reaper ();
2009-11-21 20:59:55 +01:00
// Management of inproc endpoints.
int register_endpoint (const char *addr_, endpoint_t &endpoint_);
2009-11-21 20:59:55 +01:00
void unregister_endpoints (class socket_base_t *socket_);
endpoint_t find_endpoint (const char *addr_);
2009-11-21 20:59:55 +01:00
// Logging.
void log (zmq_msg_t *msg_);
enum {
term_tid = 0,
reaper_tid = 1
};
2009-07-29 12:07:54 +02:00
private:
2010-05-05 14:24:54 +02:00
~ctx_t ();
2009-09-04 16:02:41 +02:00
// Sockets belonging to this context. We need the list so that
// we can notify the sockets when zmq_term() is called. The sockets
// will return ETERM then.
2010-08-31 21:03:34 +02:00
typedef array_t <socket_base_t> sockets_t;
sockets_t sockets;
// List of unused thread slots.
typedef std::vector <uint32_t> emtpy_slots_t;
emtpy_slots_t empty_slots;
// If true, zmq_term was already called.
bool terminating;
2009-07-29 12:07:54 +02:00
// Synchronisation of accesses to global slot-related data:
// sockets, empty_slots, terminating. It also synchronises
// access to zombie sockets as such (as oposed to slots) and provides
// a memory barrier to ensure that all CPU cores see the same data.
mutex_t slot_sync;
2009-07-29 12:07:54 +02:00
// The reaper thread.
class reaper_t *reaper;
2009-07-29 12:07:54 +02:00
// I/O threads.
typedef std::vector <class io_thread_t*> io_threads_t;
io_threads_t io_threads;
// Array of pointers to mailboxes for both application and I/O threads.
uint32_t slot_count;
mailbox_t **slots;
2009-09-04 16:02:41 +02:00
// Mailbox for zmq_term thread.
mailbox_t term_mailbox;
2009-11-21 20:59:55 +01:00
// List of inproc endpoints within this context.
typedef std::map <std::string, endpoint_t> endpoints_t;
2009-11-21 20:59:55 +01:00
endpoints_t endpoints;
// Synchronisation of access to the list of inproc endpoints.
mutex_t endpoints_sync;
// PUB socket for logging. The socket is shared among all the threads,
// thus it is synchronised by a mutex.
class socket_base_t *log_socket;
mutex_t log_sync;
2010-05-05 14:24:54 +02:00
ctx_t (const ctx_t&);
const ctx_t &operator = (const ctx_t&);
2009-07-29 12:07:54 +02:00
};
}
#endif