2011-05-30 10:07:34 +02:00
|
|
|
/*
|
2011-11-01 18:06:11 +01:00
|
|
|
Copyright (c) 2011 250bpm s.r.o.
|
2012-01-03 16:24:16 +01:00
|
|
|
Copyright (c) 2011-2012 Spotify AB
|
2011-11-01 18:06:11 +01:00
|
|
|
Copyright (c) 2011 Other contributors as noted in the AUTHORS file
|
2011-05-30 10:07:34 +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
|
|
|
|
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.
|
|
|
|
|
|
|
|
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_MTRIE_HPP_INCLUDED__
|
|
|
|
#define __ZMQ_MTRIE_HPP_INCLUDED__
|
|
|
|
|
|
|
|
#include <stddef.h>
|
|
|
|
#include <set>
|
|
|
|
|
|
|
|
#include "stdint.hpp"
|
|
|
|
|
|
|
|
namespace zmq
|
|
|
|
{
|
|
|
|
|
2011-11-09 15:22:20 +01:00
|
|
|
class pipe_t;
|
|
|
|
|
2011-05-30 10:07:34 +02:00
|
|
|
// Multi-trie. Each node in the trie is a set of pointers to pipes.
|
|
|
|
|
|
|
|
class mtrie_t
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
|
|
|
mtrie_t ();
|
|
|
|
~mtrie_t ();
|
|
|
|
|
|
|
|
// Add key to the trie. Returns true if it's a new subscription
|
|
|
|
// rather than a duplicate.
|
2011-11-09 15:22:20 +01:00
|
|
|
bool add (unsigned char *prefix_, size_t size_, zmq::pipe_t *pipe_);
|
2011-05-30 10:07:34 +02:00
|
|
|
|
|
|
|
// Remove all subscriptions for a specific peer from the trie.
|
|
|
|
// If there are no subscriptions left on some topics, invoke the
|
|
|
|
// supplied callback function.
|
2011-11-09 15:22:20 +01:00
|
|
|
void rm (zmq::pipe_t *pipe_,
|
2011-05-30 10:07:34 +02:00
|
|
|
void (*func_) (unsigned char *data_, size_t size_, void *arg_),
|
|
|
|
void *arg_);
|
|
|
|
|
|
|
|
// Remove specific subscription from the trie. Return true is it was
|
|
|
|
// actually removed rather than de-duplicated.
|
2011-11-09 15:22:20 +01:00
|
|
|
bool rm (unsigned char *prefix_, size_t size_, zmq::pipe_t *pipe_);
|
2011-05-30 10:07:34 +02:00
|
|
|
|
2011-06-11 20:29:56 +02:00
|
|
|
// Signal all the matching pipes.
|
|
|
|
void match (unsigned char *data_, size_t size_,
|
2011-11-09 15:22:20 +01:00
|
|
|
void (*func_) (zmq::pipe_t *pipe_, void *arg_), void *arg_);
|
2011-05-30 10:07:34 +02:00
|
|
|
|
|
|
|
private:
|
|
|
|
|
2011-06-01 11:54:33 +02:00
|
|
|
bool add_helper (unsigned char *prefix_, size_t size_,
|
2011-11-09 15:22:20 +01:00
|
|
|
zmq::pipe_t *pipe_);
|
|
|
|
void rm_helper (zmq::pipe_t *pipe_, unsigned char **buff_,
|
2011-05-30 10:07:34 +02:00
|
|
|
size_t buffsize_, size_t maxbuffsize_,
|
|
|
|
void (*func_) (unsigned char *data_, size_t size_, void *arg_),
|
|
|
|
void *arg_);
|
2011-06-01 11:54:33 +02:00
|
|
|
bool rm_helper (unsigned char *prefix_, size_t size_,
|
2011-11-09 15:22:20 +01:00
|
|
|
zmq::pipe_t *pipe_);
|
2012-01-03 16:24:16 +01:00
|
|
|
bool is_redundant () const;
|
2011-05-30 10:07:34 +02:00
|
|
|
|
2011-11-09 15:22:20 +01:00
|
|
|
typedef std::set <zmq::pipe_t*> pipes_t;
|
2011-05-30 10:07:34 +02:00
|
|
|
pipes_t pipes;
|
2011-06-11 20:29:56 +02:00
|
|
|
|
2011-05-30 10:07:34 +02:00
|
|
|
unsigned char min;
|
|
|
|
unsigned short count;
|
2012-01-03 16:24:16 +01:00
|
|
|
unsigned short live_nodes;
|
2011-05-30 10:07:34 +02:00
|
|
|
union {
|
|
|
|
class mtrie_t *node;
|
|
|
|
class mtrie_t **table;
|
|
|
|
} next;
|
|
|
|
|
|
|
|
mtrie_t (const mtrie_t&);
|
|
|
|
const mtrie_t &operator = (const mtrie_t&);
|
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|