1 /* +------------------------------------+
2 * | Inspire Internet Relay Chat Daemon |
3 * +------------------------------------+
5 * InspIRCd is copyright (C) 2002-2006 ChatSpike-Dev.
7 * <brain@chatspike.net>
8 * <Craig@chatspike.net>
10 * Written by Craig Edwards, Craig McLure, and others.
11 * This program is free but copyrighted software; see
12 * the file COPYING for details.
14 * ---------------------------------------------------
17 /* $ModDesc: Povides a spanning tree server link protocol */
25 #include "inspircd_config.h"
27 #include <ext/hash_map>
36 #include "helperfuncs.h"
38 #include "inspstring.h"
43 #include "cull_list.h"
47 #define nspace __gnu_cxx
53 * The server list in InspIRCd is maintained as two structures
54 * which hold the data in different ways. Most of the time, we
55 * want to very quicky obtain three pieces of information:
57 * (1) The information on a server
58 * (2) The information on the server we must send data through
59 * to actually REACH the server we're after
60 * (3) Potentially, the child/parent objects of this server
62 * The InspIRCd spanning protocol provides easy access to these
63 * by storing the data firstly in a recursive structure, where
64 * each item references its parent item, and a dynamic list
65 * of child items, and another structure which stores the items
66 * hashed, linearly. This means that if we want to find a server
67 * by name quickly, we can look it up in the hash, avoiding
68 * any O(n) lookups. If however, during a split or sync, we want
69 * to apply an operation to a server, and any of its child objects
70 * we can resort to recursion to walk the tree structure.
73 class ModuleSpanningTree;
74 static ModuleSpanningTree* TreeProtocolModule;
76 extern ServerConfig* Config;
78 extern std::vector<Module*> modules;
79 extern std::vector<ircd_module*> factory;
82 /* Any socket can have one of five states at any one time.
83 * The LISTENER state indicates a socket which is listening
84 * for connections. It cannot receive data itself, only incoming
86 * The CONNECTING state indicates an outbound socket which is
87 * waiting to be writeable.
88 * The WAIT_AUTH_1 state indicates the socket is outbound and
89 * has successfully connected, but has not yet sent and received
91 * The WAIT_AUTH_2 state indicates that the socket is inbound
92 * (allocated by a LISTENER) but has not yet sent and received
94 * The CONNECTED state represents a fully authorized, fully
97 enum ServerState { LISTENER, CONNECTING, WAIT_AUTH_1, WAIT_AUTH_2, CONNECTED };
99 /* We need to import these from the core for use in netbursts */
100 extern user_hash clientlist;
101 extern chan_hash chanlist;
103 /* Foward declarations */
107 /* This variable represents the root of the server tree
108 * (for all intents and purposes, it's us)
110 TreeServer *TreeRoot;
114 /* This hash_map holds the hash equivalent of the server
115 * tree, used for rapid linear lookups.
117 typedef nspace::hash_map<std::string, TreeServer*> server_hash;
118 server_hash serverlist;
120 /* More forward declarations */
121 bool DoOneToOne(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string target);
122 bool DoOneToAllButSender(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string omit);
123 bool DoOneToMany(std::string prefix, std::string command, std::deque<std::string> ¶ms);
124 bool DoOneToAllButSenderRaw(std::string data, std::string omit, std::string prefix, std::string command, std::deque<std::string> ¶ms);
125 void ReadConfiguration(bool rebind);
127 /* Flatten links and /MAP for non-opers */
129 /* Hide U-Lined servers in /MAP and /LINKS */
132 /* Imported from xline.cpp for use during netburst */
133 extern std::vector<KLine> klines;
134 extern std::vector<GLine> glines;
135 extern std::vector<ZLine> zlines;
136 extern std::vector<QLine> qlines;
137 extern std::vector<ELine> elines;
138 extern std::vector<KLine> pklines;
139 extern std::vector<GLine> pglines;
140 extern std::vector<ZLine> pzlines;
141 extern std::vector<QLine> pqlines;
142 extern std::vector<ELine> pelines;
144 /* Each server in the tree is represented by one class of
145 * type TreeServer. A locally connected TreeServer can
146 * have a class of type TreeSocket associated with it, for
147 * remote servers, the TreeSocket entry will be NULL.
148 * Each server also maintains a pointer to its parent
149 * (NULL if this server is ours, at the top of the tree)
150 * and a pointer to its "Route" (see the comments in the
151 * constructors below), and also a dynamic list of pointers
152 * to its children which can be iterated recursively
153 * if required. Creating or deleting objects of type
154 * TreeServer automatically maintains the hash_map of
155 * TreeServer items, deleting and inserting them as they
156 * are created and destroyed.
161 TreeServer* Parent; /* Parent entry */
162 TreeServer* Route; /* Route entry */
163 std::vector<TreeServer*> Children; /* List of child objects */
164 std::string ServerName; /* Server's name */
165 std::string ServerDesc; /* Server's description */
166 std::string VersionString; /* Version string or empty string */
167 int UserCount; /* Not used in this version */
168 int OperCount; /* Not used in this version */
169 TreeSocket* Socket; /* For directly connected servers this points at the socket object */
170 time_t NextPing; /* After this time, the server should be PINGed*/
171 bool LastPingWasGood; /* True if the server responded to the last PING with a PONG */
175 /* We don't use this constructor. Its a dummy, and won't cause any insertion
176 * of the TreeServer into the hash_map. See below for the two we DO use.
184 UserCount = OperCount = 0;
185 VersionString = Srv->GetVersion();
188 /* We use this constructor only to create the 'root' item, TreeRoot, which
189 * represents our own server. Therefore, it has no route, no parent, and
190 * no socket associated with it. Its version string is our own local version.
192 TreeServer(std::string Name, std::string Desc) : ServerName(Name), ServerDesc(Desc)
196 UserCount = OperCount = 0;
197 VersionString = Srv->GetVersion();
199 Socket = NULL; /* Fix by brain */
203 /* When we create a new server, we call this constructor to initialize it.
204 * This constructor initializes the server's Route and Parent, and sets up
205 * its ping counters so that it will be pinged one minute from now.
207 TreeServer(std::string Name, std::string Desc, TreeServer* Above, TreeSocket* Sock) : Parent(Above), ServerName(Name), ServerDesc(Desc), Socket(Sock)
210 UserCount = OperCount = 0;
211 this->SetNextPingTime(time(NULL) + 120);
214 /* find the 'route' for this server (e.g. the one directly connected
215 * to the local server, which we can use to reach it)
217 * In the following example, consider we have just added a TreeServer
218 * class for server G on our network, of which we are server A.
219 * To route traffic to G (marked with a *) we must send the data to
220 * B (marked with a +) so this algorithm initializes the 'Route'
221 * value to point at whichever server traffic must be routed through
222 * to get here. If we were to try this algorithm with server B,
223 * the Route pointer would point at its own object ('this').
233 * We only run this algorithm when a server is created, as
234 * the routes remain constant while ever the server exists, and
235 * do not need to be re-calculated.
239 if (Route == TreeRoot)
245 while (this->Route->GetParent() != TreeRoot)
247 this->Route = Route->GetParent();
251 /* Because recursive code is slow and takes a lot of resources,
252 * we store two representations of the server tree. The first
253 * is a recursive structure where each server references its
254 * children and its parent, which is used for netbursts and
255 * netsplits to dump the whole dataset to the other server,
256 * and the second is used for very fast lookups when routing
257 * messages and is instead a hash_map, where each item can
258 * be referenced by its server name. The AddHashEntry()
259 * call below automatically inserts each TreeServer class
260 * into the hash_map as it is created. There is a similar
261 * maintainance call in the destructor to tidy up deleted
265 this->AddHashEntry();
268 /* This method is used to add the structure to the
269 * hash_map for linear searches. It is only called
270 * by the constructors.
274 server_hash::iterator iter;
275 iter = serverlist.find(this->ServerName);
276 if (iter == serverlist.end())
277 serverlist[this->ServerName] = this;
280 /* This method removes the reference to this object
281 * from the hash_map which is used for linear searches.
282 * It is only called by the default destructor.
286 server_hash::iterator iter;
287 iter = serverlist.find(this->ServerName);
288 if (iter != serverlist.end())
289 serverlist.erase(iter);
292 /* These accessors etc should be pretty self-
296 TreeServer* GetRoute()
301 std::string GetName()
306 std::string GetDesc()
311 std::string GetVersion()
313 return VersionString;
316 void SetNextPingTime(time_t t)
319 LastPingWasGood = false;
322 time_t NextPingTime()
327 bool AnsweredLastPing()
329 return LastPingWasGood;
334 LastPingWasGood = true;
357 TreeSocket* GetSocket()
362 TreeServer* GetParent()
367 void SetVersion(std::string Version)
369 VersionString = Version;
372 unsigned int ChildCount()
374 return Children.size();
377 TreeServer* GetChild(unsigned int n)
379 if (n < Children.size())
381 /* Make sure they cant request
382 * an out-of-range object. After
383 * all we know what these programmer
384 * types are like *grin*.
394 void AddChild(TreeServer* Child)
396 Children.push_back(Child);
399 bool DelChild(TreeServer* Child)
401 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
412 /* Removes child nodes of this node, and of that node, etc etc.
413 * This is used during netsplits to automatically tidy up the
414 * server tree. It is slow, we don't use it for much else.
418 bool stillchildren = true;
419 while (stillchildren)
421 stillchildren = false;
422 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
424 TreeServer* s = (TreeServer*)*a;
428 stillchildren = true;
437 /* We'd better tidy up after ourselves, eh? */
438 this->DelHashEntry();
442 /* The Link class might as well be a struct,
443 * but this is C++ and we don't believe in structs (!).
444 * It holds the entire information of one <link>
445 * tag from the main config file. We maintain a list
446 * of them, and populate the list on rehash/load.
455 std::string SendPass;
456 std::string RecvPass;
457 unsigned long AutoConnect;
458 time_t NextConnectTime;
459 std::string EncryptionKey;
460 bool HiddenFromStats;
463 /* The usual stuff for inspircd modules,
464 * plus the vector of Link classes which we
465 * use to store the <link> tags from the config
469 std::vector<Link> LinkBlocks;
471 /* Yay for fast searches!
472 * This is hundreds of times faster than recursion
473 * or even scanning a linked list, especially when
474 * there are more than a few servers to deal with.
477 TreeServer* FindServer(std::string ServerName)
479 server_hash::iterator iter;
480 iter = serverlist.find(ServerName);
481 if (iter != serverlist.end())
491 /* Returns the locally connected server we must route a
492 * message through to reach server 'ServerName'. This
493 * only applies to one-to-one and not one-to-many routing.
494 * See the comments for the constructor of TreeServer
497 TreeServer* BestRouteTo(std::string ServerName)
499 if (ServerName.c_str() == TreeRoot->GetName())
501 TreeServer* Found = FindServer(ServerName);
504 return Found->GetRoute();
512 /* Find the first server matching a given glob mask.
513 * Theres no find-using-glob method of hash_map [awwww :-(]
514 * so instead, we iterate over the list using an iterator
515 * and match each one until we get a hit. Yes its slow,
518 TreeServer* FindServerMask(std::string ServerName)
520 for (server_hash::iterator i = serverlist.begin(); i != serverlist.end(); i++)
522 if (Srv->MatchText(i->first,ServerName))
528 /* A convenient wrapper that returns true if a server exists */
529 bool IsServer(std::string ServerName)
531 return (FindServer(ServerName) != NULL);
535 class cmd_rconnect : public command_t
539 cmd_rconnect (Module* Callback) : command_t("RCONNECT", 'o', 2), Creator(Callback)
541 this->source = "m_spanningtree.so";
544 void Handle (char **parameters, int pcnt, userrec *user)
546 WriteServ(user->fd,"NOTICE %s :*** RCONNECT: Sending remote connect to \002%s\002 to connect server \002%s\002.",user->nick,parameters[0],parameters[1]);
547 /* Is this aimed at our server? */
548 if (Srv->MatchText(Srv->GetServerName(),parameters[0]))
550 /* Yes, initiate the given connect */
551 WriteOpers("*** Remote CONNECT from %s matching \002%s\002, connecting server \002%s\002",user->nick,parameters[0],parameters[1]);
553 para[0] = parameters[1];
554 Creator->OnPreCommand("CONNECT", para, 1, user, true);
561 /* Every SERVER connection inbound or outbound is represented by
562 * an object of type TreeSocket.
563 * TreeSockets, being inherited from InspSocket, can be tied into
564 * the core socket engine, and we cn therefore receive activity events
565 * for them, just like activex objects on speed. (yes really, that
566 * is a technical term!) Each of these which relates to a locally
567 * connected server is assocated with it, by hooking it onto a
568 * TreeSocket class using its constructor. In this way, we can
569 * maintain a list of servers, some of which are directly connected,
570 * some of which are not.
573 class TreeSocket : public InspSocket
576 std::string in_buffer;
577 ServerState LinkState;
578 std::string InboundServerName;
579 std::string InboundDescription;
581 int num_lost_servers;
583 bool LastPingWasGood;
587 unsigned int keylength;
591 /* Because most of the I/O gubbins are encapsulated within
592 * InspSocket, we just call the superclass constructor for
593 * most of the action, and append a few of our own values
596 TreeSocket(std::string host, int port, bool listening, unsigned long maxtime)
597 : InspSocket(host, port, listening, maxtime)
600 this->LinkState = LISTENER;
602 this->ctx_out = NULL;
605 TreeSocket(std::string host, int port, bool listening, unsigned long maxtime, std::string ServerName)
606 : InspSocket(host, port, listening, maxtime)
609 this->LinkState = CONNECTING;
611 this->ctx_out = NULL;
614 /* When a listening socket gives us a new file descriptor,
615 * we must associate it with a socket without creating a new
616 * connection. This constructor is used for this purpose.
618 TreeSocket(int newfd, char* ip)
619 : InspSocket(newfd, ip)
621 this->LinkState = WAIT_AUTH_1;
623 this->ctx_out = NULL;
624 this->SendCapabilities();
635 void InitAES(std::string key,std::string SName)
642 log(DEBUG,"Initialized AES key %s",key.c_str());
643 // key must be 16, 24, 32 etc bytes (multiple of 8)
644 keylength = key.length();
645 if (!(keylength == 16 || keylength == 24 || keylength == 32))
647 WriteOpers("*** \2ERROR\2: Key length for encryptionkey is not 16, 24 or 32 bytes in length!");
648 log(DEBUG,"Key length not 16, 24 or 32 characters!");
652 WriteOpers("*** \2AES\2: Initialized %d bit encryption to server %s",keylength*8,SName.c_str());
653 ctx_in->MakeKey(key.c_str(), "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\
654 \0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0", keylength, keylength);
655 ctx_out->MakeKey(key.c_str(), "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\
656 \0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0", keylength, keylength);
660 /* When an outbound connection finishes connecting, we receive
661 * this event, and must send our SERVER string to the other
662 * side. If the other side is happy, as outlined in the server
663 * to server docs on the inspircd.org site, the other side
664 * will then send back its own server string.
666 virtual bool OnConnected()
668 if (this->LinkState == CONNECTING)
670 /* we do not need to change state here. */
671 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
673 if (x->Name == this->myhost)
675 Srv->SendOpers("*** Connection to \2"+myhost+"\2["+(x->HiddenFromStats ? "<hidden>" : this->GetIP())+"] established.");
676 this->SendCapabilities();
677 if (x->EncryptionKey != "")
679 if (!(x->EncryptionKey.length() == 16 || x->EncryptionKey.length() == 24 || x->EncryptionKey.length() == 32))
681 WriteOpers("\2WARNING\2: Your encryption key is NOT 16, 24 or 32 characters in length, encryption will \2NOT\2 be enabled.");
685 this->WriteLine("AES "+Srv->GetServerName());
686 this->InitAES(x->EncryptionKey,x->Name);
689 /* found who we're supposed to be connecting to, send the neccessary gubbins. */
690 this->WriteLine("SERVER "+Srv->GetServerName()+" "+x->SendPass+" 0 :"+Srv->GetServerDescription());
695 /* There is a (remote) chance that between the /CONNECT and the connection
696 * being accepted, some muppet has removed the <link> block and rehashed.
697 * If that happens the connection hangs here until it's closed. Unlikely
698 * and rather harmless.
700 Srv->SendOpers("*** Connection to \2"+myhost+"\2 lost link tag(!)");
704 virtual void OnError(InspSocketError e)
706 /* We don't handle this method, because all our
707 * dirty work is done in OnClose() (see below)
708 * which is still called on error conditions too.
712 virtual int OnDisconnect()
714 /* For the same reason as above, we don't
715 * handle OnDisconnect()
720 /* Recursively send the server tree with distances as hops.
721 * This is used during network burst to inform the other server
722 * (and any of ITS servers too) of what servers we know about.
723 * If at any point any of these servers already exist on the other
724 * end, our connection may be terminated. The hopcounts given
725 * by this function are relative, this doesn't matter so long as
726 * they are all >1, as all the remote servers re-calculate them
727 * to be relative too, with themselves as hop 0.
729 void SendServers(TreeServer* Current, TreeServer* s, int hops)
732 for (unsigned int q = 0; q < Current->ChildCount(); q++)
734 TreeServer* recursive_server = Current->GetChild(q);
735 if (recursive_server != s)
737 snprintf(command,1024,":%s SERVER %s * %d :%s",Current->GetName().c_str(),recursive_server->GetName().c_str(),hops,recursive_server->GetDesc().c_str());
738 this->WriteLine(command);
739 this->WriteLine(":"+recursive_server->GetName()+" VERSION :"+recursive_server->GetVersion());
740 /* down to next level */
741 this->SendServers(recursive_server, s, hops+1);
746 std::string MyCapabilities()
748 ServerConfig* Config = Srv->GetConfig();
749 std::vector<std::string> modlist;
750 std::string capabilities = "";
752 for (int i = 0; i <= MODCOUNT; i++)
754 if ((modules[i]->GetVersion().Flags & VF_STATIC) || (modules[i]->GetVersion().Flags & VF_COMMON))
755 modlist.push_back(Config->module_names[i]);
757 sort(modlist.begin(),modlist.end());
758 for (unsigned int i = 0; i < modlist.size(); i++)
761 capabilities = capabilities + ",";
762 capabilities = capabilities + modlist[i];
767 void SendCapabilities()
769 this->WriteLine("CAPAB "+MyCapabilities());
772 bool Capab(std::deque<std::string> params)
774 if (params.size() != 1)
776 this->WriteLine("ERROR :Invalid number of parameters for CAPAB");
779 if (params[0] != this->MyCapabilities())
781 std::string quitserver = this->myhost;
782 if (this->InboundServerName != "")
784 quitserver = this->InboundServerName;
786 WriteOpers("*** \2ERROR\2: Server '%s' does not have the same set of modules loaded, cannot link!",quitserver.c_str());
787 WriteOpers("*** Our networked module set is: '%s'",this->MyCapabilities().c_str());
788 WriteOpers("*** Other server's networked module set is: '%s'",params[0].c_str());
789 WriteOpers("*** These lists must match exactly on both servers. Please correct these errors, and try again.");
790 this->WriteLine("ERROR :CAPAB mismatch; My capabilities: '"+this->MyCapabilities()+"'");
796 /* This function forces this server to quit, removing this server
797 * and any users on it (and servers and users below that, etc etc).
798 * It's very slow and pretty clunky, but luckily unless your network
799 * is having a REAL bad hair day, this function shouldnt be called
800 * too many times a month ;-)
802 void SquitServer(TreeServer* Current, CullList* Goners)
804 /* recursively squit the servers attached to 'Current'.
805 * We're going backwards so we don't remove users
806 * while we still need them ;)
808 for (unsigned int q = 0; q < Current->ChildCount(); q++)
810 TreeServer* recursive_server = Current->GetChild(q);
811 this->SquitServer(recursive_server,Goners);
813 /* Now we've whacked the kids, whack self */
815 for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
817 if (!strcasecmp(u->second->server,Current->GetName().c_str()))
819 std::string qreason = Current->GetName()+" "+std::string(Srv->GetServerName());
820 Goners->AddItem(u->second,qreason);
826 /* This is a wrapper function for SquitServer above, which
827 * does some validation first and passes on the SQUIT to all
828 * other remaining servers.
830 void Squit(TreeServer* Current,std::string reason)
832 if ((Current) && (Current != TreeRoot))
834 std::deque<std::string> params;
835 params.push_back(Current->GetName());
836 params.push_back(":"+reason);
837 DoOneToAllButSender(Current->GetParent()->GetName(),"SQUIT",params,Current->GetName());
838 if (Current->GetParent() == TreeRoot)
840 Srv->SendOpers("Server \002"+Current->GetName()+"\002 split: "+reason);
844 Srv->SendOpers("Server \002"+Current->GetName()+"\002 split from server \002"+Current->GetParent()->GetName()+"\002 with reason: "+reason);
846 num_lost_servers = 0;
848 CullList* Goners = new CullList();
849 SquitServer(Current, Goners);
852 Current->GetParent()->DelChild(Current);
855 WriteOpers("Netsplit complete, lost \002%d\002 users on \002%d\002 servers.", num_lost_users, num_lost_servers);
859 log(DEFAULT,"Squit from unknown server");
864 bool ForceMode(std::string source, std::deque<std::string> params)
866 userrec* who = new userrec;
867 who->fd = FD_MAGIC_NUMBER;
868 if (params.size() < 2)
871 for (unsigned int q = 0; q < params.size(); q++)
873 modelist[q] = (char*)params[q].c_str();
875 Srv->SendMode(modelist,params.size(),who);
876 DoOneToAllButSender(source,"FMODE",params,source);
882 bool ForceTopic(std::string source, std::deque<std::string> params)
884 if (params.size() != 4)
886 time_t ts = atoi(params[1].c_str());
887 std::string nsource = source;
889 chanrec* c = Srv->FindChannel(params[0]);
892 if ((ts >= c->topicset) || (!*c->topic))
894 std::string oldtopic = c->topic;
895 strlcpy(c->topic,params[3].c_str(),MAXTOPIC);
896 strlcpy(c->setby,params[2].c_str(),NICKMAX);
898 /* if the topic text is the same as the current topic,
899 * dont bother to send the TOPIC command out, just silently
900 * update the set time and set nick.
902 if (oldtopic != params[3])
904 userrec* user = Srv->FindNick(source);
907 WriteChannelWithServ((char*)source.c_str(), c, "TOPIC %s :%s", c->name, c->topic);
911 WriteChannel(c, user, "TOPIC %s :%s", c->name, c->topic);
912 nsource = user->server;
919 /* all done, send it on its way */
920 params[3] = ":" + params[3];
921 DoOneToAllButSender(source,"FTOPIC",params,nsource);
926 /* FJOIN, similar to unreal SJOIN */
927 bool ForceJoin(std::string source, std::deque<std::string> params)
929 if (params.size() < 3)
933 char modestring[MAXBUF];
934 char* mode_users[127];
935 mode_users[0] = first;
936 mode_users[1] = modestring;
937 strcpy(mode_users[1],"+");
938 unsigned int modectr = 2;
941 std::string channel = params[0];
942 time_t TS = atoi(params[1].c_str());
945 chanrec* chan = Srv->FindChannel(channel);
950 strlcpy(mode_users[0],channel.c_str(),MAXBUF);
952 /* default is a high value, which if we dont have this
953 * channel will let the other side apply their modes.
955 time_t ourTS = time(NULL)+600;
956 chanrec* us = Srv->FindChannel(channel);
962 log(DEBUG,"FJOIN detected, our TS=%lu, their TS=%lu",ourTS,TS);
964 /* do this first, so our mode reversals are correctly received by other servers
965 * if there is a TS collision.
967 DoOneToAllButSender(source,"FJOIN",params,source);
969 for (unsigned int usernum = 2; usernum < params.size(); usernum++)
971 /* process one channel at a time, applying modes. */
972 char* usr = (char*)params[usernum].c_str();
973 /* Safety check just to make sure someones not sent us an FJOIN full of spaces
974 * (is this even possible?) */
977 char permissions = *usr;
982 mode_users[modectr++] = usr;
983 strlcat(modestring,"o",MAXBUF);
987 mode_users[modectr++] = usr;
988 strlcat(modestring,"h",MAXBUF);
992 mode_users[modectr++] = usr;
993 strlcat(modestring,"v",MAXBUF);
996 who = Srv->FindNick(usr);
999 Srv->JoinUserToChannel(who,channel,key);
1000 if (modectr >= (MAXMODES-1))
1002 /* theres a mode for this user. push them onto the mode queue, and flush it
1003 * if there are more than MAXMODES to go.
1005 if ((ourTS >= TS) || (Srv->IsUlined(who->server)))
1007 /* We also always let u-lined clients win, no matter what the TS value */
1008 log(DEBUG,"Our our channel newer than theirs, accepting their modes");
1009 Srv->SendMode(mode_users,modectr,who);
1013 log(DEBUG,"Their channel newer than ours, bouncing their modes");
1014 /* bouncy bouncy! */
1015 std::deque<std::string> params;
1016 /* modes are now being UNSET... */
1017 *mode_users[1] = '-';
1018 for (unsigned int x = 0; x < modectr; x++)
1020 params.push_back(mode_users[x]);
1022 // tell everyone to bounce the modes. bad modes, bad!
1023 DoOneToMany(Srv->GetServerName(),"FMODE",params);
1025 strcpy(mode_users[1],"+");
1031 /* there werent enough modes built up to flush it during FJOIN,
1032 * or, there are a number left over. flush them out.
1034 if ((modectr > 2) && (who))
1038 log(DEBUG,"Our our channel newer than theirs, accepting their modes");
1039 Srv->SendMode(mode_users,modectr,who);
1043 log(DEBUG,"Their channel newer than ours, bouncing their modes");
1044 std::deque<std::string> params;
1045 *mode_users[1] = '-';
1046 for (unsigned int x = 0; x < modectr; x++)
1048 params.push_back(mode_users[x]);
1050 DoOneToMany(Srv->GetServerName(),"FMODE",params);
1057 bool IntroduceClient(std::string source, std::deque<std::string> params)
1059 if (params.size() < 8)
1061 // NICK age nick host dhost ident +modes ip :gecos
1063 time_t age = atoi(params[0].c_str());
1064 std::string modes = params[5];
1065 while (*(modes.c_str()) == '+')
1067 char* m = (char*)modes.c_str();
1071 char* tempnick = (char*)params[1].c_str();
1072 log(DEBUG,"Introduce client %s!%s@%s",tempnick,params[4].c_str(),params[2].c_str());
1074 user_hash::iterator iter;
1075 iter = clientlist.find(tempnick);
1076 if (iter != clientlist.end())
1079 log(DEBUG,"Nick collision on %s!%s@%s: %lu %lu",tempnick,params[4].c_str(),params[2].c_str(),(unsigned long)age,(unsigned long)iter->second->age);
1080 this->WriteLine(":"+Srv->GetServerName()+" KILL "+tempnick+" :Nickname collision");
1084 clientlist[tempnick] = new userrec();
1085 clientlist[tempnick]->fd = FD_MAGIC_NUMBER;
1086 strlcpy(clientlist[tempnick]->nick, tempnick,NICKMAX);
1087 strlcpy(clientlist[tempnick]->host, params[2].c_str(),160);
1088 strlcpy(clientlist[tempnick]->dhost, params[3].c_str(),160);
1089 clientlist[tempnick]->server = (char*)FindServerNamePtr(source.c_str());
1090 strlcpy(clientlist[tempnick]->ident, params[4].c_str(),IDENTMAX);
1091 strlcpy(clientlist[tempnick]->fullname, params[7].c_str(),MAXGECOS);
1092 clientlist[tempnick]->registered = 7;
1093 clientlist[tempnick]->signon = age;
1094 strlcpy(clientlist[tempnick]->modes, modes.c_str(),53);
1095 inet_aton(params[6].c_str(),&clientlist[tempnick]->ip4);
1100 for (int i = 0; i < MAXCHANS; i++)
1101 clientlist[tempnick]->chans.push_back(a);
1103 if (!this->bursting)
1105 WriteOpers("*** Client connecting at %s: %s!%s@%s [%s]",clientlist[tempnick]->server,clientlist[tempnick]->nick,clientlist[tempnick]->ident,clientlist[tempnick]->host,(char*)inet_ntoa(clientlist[tempnick]->ip4));
1107 params[7] = ":" + params[7];
1108 DoOneToAllButSender(source,"NICK",params,source);
1110 // Increment the Source Servers User Count..
1111 TreeServer* SourceServer = FindServer(source);
1113 SourceServer->AddUserCount();
1119 /* Send one or more FJOINs for a channel of users.
1120 * If the length of a single line is more than 480-NICKMAX
1121 * in length, it is split over multiple lines.
1123 void SendFJoins(TreeServer* Current, chanrec* c)
1125 log(DEBUG,"Sending FJOINs to other server for %s",c->name);
1127 snprintf(list,MAXBUF,":%s FJOIN %s %lu",Srv->GetServerName().c_str(),c->name,(unsigned long)c->age);
1128 std::map<char*,char*> *ulist = c->GetUsers();
1129 for (std::map<char*,char*>::iterator i = ulist->begin(); i != ulist->end(); i++)
1131 char* o = i->second;
1132 userrec* otheruser = (userrec*)o;
1133 strlcat(list," ",MAXBUF);
1134 strlcat(list,cmode(otheruser,c),MAXBUF);
1135 strlcat(list,otheruser->nick,MAXBUF);
1136 if (strlen(list)>(480-NICKMAX))
1138 log(DEBUG,"FJOIN line wrapped");
1139 this->WriteLine(list);
1140 snprintf(list,MAXBUF,":%s FJOIN %s %lu",Srv->GetServerName().c_str(),c->name,(unsigned long)c->age);
1143 if (list[strlen(list)-1] != ':')
1145 log(DEBUG,"Final FJOIN line");
1146 this->WriteLine(list);
1150 /* Send G, Q, Z and E lines */
1151 void SendXLines(TreeServer* Current)
1154 const char* sn = Srv->GetServerName().c_str();
1155 /* Yes, these arent too nice looking, but they get the job done */
1156 for (std::vector<ZLine>::iterator i = zlines.begin(); i != zlines.end(); i++)
1158 snprintf(data,MAXBUF,":%s ADDLINE Z %s %s %lu %lu :%s",sn,i->ipaddr,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1159 this->WriteLine(data);
1161 for (std::vector<QLine>::iterator i = qlines.begin(); i != qlines.end(); i++)
1163 snprintf(data,MAXBUF,":%s ADDLINE Q %s %s %lu %lu :%s",sn,i->nick,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1164 this->WriteLine(data);
1166 for (std::vector<GLine>::iterator i = glines.begin(); i != glines.end(); i++)
1168 snprintf(data,MAXBUF,":%s ADDLINE G %s %s %lu %lu :%s",sn,i->hostmask,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1169 this->WriteLine(data);
1171 for (std::vector<ELine>::iterator i = elines.begin(); i != elines.end(); i++)
1173 snprintf(data,MAXBUF,":%s ADDLINE E %s %s %lu %lu :%s",sn,i->hostmask,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1174 this->WriteLine(data);
1176 for (std::vector<ZLine>::iterator i = pzlines.begin(); i != pzlines.end(); i++)
1178 snprintf(data,MAXBUF,":%s ADDLINE Z %s %s %lu %lu :%s",sn,i->ipaddr,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1179 this->WriteLine(data);
1181 for (std::vector<QLine>::iterator i = pqlines.begin(); i != pqlines.end(); i++)
1183 snprintf(data,MAXBUF,":%s ADDLINE Q %s %s %lu %lu :%s",sn,i->nick,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1184 this->WriteLine(data);
1186 for (std::vector<GLine>::iterator i = pglines.begin(); i != pglines.end(); i++)
1188 snprintf(data,MAXBUF,":%s ADDLINE G %s %s %lu %lu :%s",sn,i->hostmask,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1189 this->WriteLine(data);
1191 for (std::vector<ELine>::iterator i = pelines.begin(); i != pelines.end(); i++)
1193 snprintf(data,MAXBUF,":%s ADDLINE E %s %s %lu %lu :%s",sn,i->hostmask,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1194 this->WriteLine(data);
1198 /* Send channel modes and topics */
1199 void SendChannelModes(TreeServer* Current)
1202 std::deque<std::string> list;
1203 const char* sn = Srv->GetServerName().c_str();
1204 for (chan_hash::iterator c = chanlist.begin(); c != chanlist.end(); c++)
1206 SendFJoins(Current, c->second);
1207 snprintf(data,MAXBUF,":%s FMODE %s +%s",sn,c->second->name,chanmodes(c->second,true));
1208 this->WriteLine(data);
1209 if (*c->second->topic)
1211 snprintf(data,MAXBUF,":%s FTOPIC %s %lu %s :%s",sn,c->second->name,(unsigned long)c->second->topicset,c->second->setby,c->second->topic);
1212 this->WriteLine(data);
1214 for (BanList::iterator b = c->second->bans.begin(); b != c->second->bans.end(); b++)
1216 snprintf(data,MAXBUF,":%s FMODE %s +b %s",sn,c->second->name,b->data);
1217 this->WriteLine(data);
1219 FOREACH_MOD(I_OnSyncChannel,OnSyncChannel(c->second,(Module*)TreeProtocolModule,(void*)this));
1221 c->second->GetExtList(list);
1222 for (unsigned int j = 0; j < list.size(); j++)
1224 FOREACH_MOD(I_OnSyncChannelMetaData,OnSyncChannelMetaData(c->second,(Module*)TreeProtocolModule,(void*)this,list[j]));
1229 /* send all users and their oper state/modes */
1230 void SendUsers(TreeServer* Current)
1233 std::deque<std::string> list;
1234 for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
1236 if (u->second->registered == 7)
1238 snprintf(data,MAXBUF,":%s NICK %lu %s %s %s %s +%s %s :%s",u->second->server,(unsigned long)u->second->age,u->second->nick,u->second->host,u->second->dhost,u->second->ident,u->second->modes,(char*)inet_ntoa(u->second->ip4),u->second->fullname);
1239 this->WriteLine(data);
1240 if (*u->second->oper)
1242 this->WriteLine(":"+std::string(u->second->nick)+" OPERTYPE "+std::string(u->second->oper));
1244 if (*u->second->awaymsg)
1246 this->WriteLine(":"+std::string(u->second->nick)+" AWAY :"+std::string(u->second->awaymsg));
1248 FOREACH_MOD(I_OnSyncUser,OnSyncUser(u->second,(Module*)TreeProtocolModule,(void*)this));
1250 u->second->GetExtList(list);
1251 for (unsigned int j = 0; j < list.size(); j++)
1253 FOREACH_MOD(I_OnSyncUserMetaData,OnSyncUserMetaData(u->second,(Module*)TreeProtocolModule,(void*)this,list[j]));
1259 /* This function is called when we want to send a netburst to a local
1260 * server. There is a set order we must do this, because for example
1261 * users require their servers to exist, and channels require their
1262 * users to exist. You get the idea.
1264 void DoBurst(TreeServer* s)
1266 Srv->SendOpers("*** Bursting to \2"+s->GetName()+"\2.");
1267 this->WriteLine("BURST");
1268 /* send our version string */
1269 this->WriteLine(":"+Srv->GetServerName()+" VERSION :"+Srv->GetVersion());
1270 /* Send server tree */
1271 this->SendServers(TreeRoot,s,1);
1272 /* Send users and their oper status */
1274 /* Send everything else (channel modes, xlines etc) */
1275 this->SendChannelModes(s);
1276 this->SendXLines(s);
1277 FOREACH_MOD(I_OnSyncOtherMetaData,OnSyncOtherMetaData((Module*)TreeProtocolModule,(void*)this));
1278 this->WriteLine("ENDBURST");
1279 Srv->SendOpers("*** Finished bursting to \2"+s->GetName()+"\2.");
1282 /* This function is called when we receive data from a remote
1283 * server. We buffer the data in a std::string (it doesnt stay
1284 * there for long), reading using InspSocket::Read() which can
1285 * read up to 16 kilobytes in one operation.
1287 * IF THIS FUNCTION RETURNS FALSE, THE CORE CLOSES AND DELETES
1288 * THE SOCKET OBJECT FOR US.
1290 virtual bool OnDataReady()
1292 char* data = this->Read();
1293 /* Check that the data read is a valid pointer and it has some content */
1296 this->in_buffer.append(data);
1297 /* While there is at least one new line in the buffer,
1298 * do something useful (we hope!) with it.
1300 while (in_buffer.find("\n") != std::string::npos)
1302 std::string ret = in_buffer.substr(0,in_buffer.find("\n")-1);
1303 in_buffer = in_buffer.substr(in_buffer.find("\n")+1,in_buffer.length()-in_buffer.find("\n"));
1304 if (ret.find("\r") != std::string::npos)
1305 ret = in_buffer.substr(0,in_buffer.find("\r")-1);
1306 /* Process this one, abort if it
1307 * didnt return true.
1313 memset(result,0,1024);
1315 log(DEBUG,"Original string '%s'",ret.c_str());
1316 /* ERROR + CAPAB is still allowed unencryped */
1317 if ((ret.substr(0,7) != "ERROR :") && (ret.substr(0,6) != "CAPAB "))
1319 int nbytes = from64tobits(out, ret.c_str(), 1024);
1320 if ((nbytes > 0) && (nbytes < 1024))
1322 log(DEBUG,"m_spanningtree: decrypt %d bytes",nbytes);
1323 ctx_in->Decrypt(out, result, nbytes, 1);
1324 for (int t = 0; t < nbytes; t++)
1325 if (result[t] == '\7') result[t] = 0;
1330 if (!this->ProcessLine(ret))
1336 /* EAGAIN returns an empty but non-NULL string, so this
1337 * evaluates to TRUE for EAGAIN but to FALSE for EOF.
1339 return (data != NULL);
1342 int WriteLine(std::string line)
1344 log(DEBUG,"OUT: %s",line.c_str());
1347 log(DEBUG,"AES context");
1349 char result64[10240];
1350 if (this->keylength)
1352 while (line.length() % this->keylength != 0)
1354 // pad it to be a multiple of the key length
1358 unsigned int ll = line.length();
1359 log(DEBUG,"Plaintext line with padding = %d chars",ll);
1360 ctx_out->Encrypt(line.c_str(), result, ll, 1);
1361 log(DEBUG,"Encrypted.");
1362 to64frombits((unsigned char*)result64,(unsigned char*)result,ll);
1364 log(DEBUG,"Encrypted: %s",line.c_str());
1365 //int from64tobits(char *out, const char *in, int maxlen);
1367 return this->Write(line + "\r\n");
1370 /* Handle ERROR command */
1371 bool Error(std::deque<std::string> params)
1373 if (params.size() < 1)
1375 std::string Errmsg = params[0];
1376 std::string SName = myhost;
1377 if (InboundServerName != "")
1379 SName = InboundServerName;
1381 Srv->SendOpers("*** ERROR from "+SName+": "+Errmsg);
1382 /* we will return false to cause the socket to close.
1387 /* Because the core won't let users or even SERVERS set +o,
1388 * we use the OPERTYPE command to do this.
1390 bool OperType(std::string prefix, std::deque<std::string> ¶ms)
1392 if (params.size() != 1)
1394 std::string opertype = params[0];
1395 userrec* u = Srv->FindNick(prefix);
1398 strlcpy(u->oper,opertype.c_str(),NICKMAX);
1399 if (!strchr(u->modes,'o'))
1401 strcat(u->modes,"o");
1403 DoOneToAllButSender(u->nick,"OPERTYPE",params,u->server);
1408 /* Because Andy insists that services-compatible servers must
1409 * implement SVSNICK and SVSJOIN, that's exactly what we do :p
1411 bool ForceNick(std::string prefix, std::deque<std::string> ¶ms)
1413 if (params.size() < 3)
1415 userrec* u = Srv->FindNick(params[0]);
1418 Srv->ChangeUserNick(u,params[1]);
1419 u->age = atoi(params[2].c_str());
1420 DoOneToAllButSender(prefix,"SVSNICK",params,prefix);
1425 bool ServiceJoin(std::string prefix, std::deque<std::string> ¶ms)
1427 if (params.size() < 2)
1429 userrec* u = Srv->FindNick(params[0]);
1432 Srv->JoinUserToChannel(u,params[1],"");
1433 DoOneToAllButSender(prefix,"SVSJOIN",params,prefix);
1438 bool RemoteRehash(std::string prefix, std::deque<std::string> ¶ms)
1440 if (params.size() < 1)
1442 std::string servermask = params[0];
1443 if (Srv->MatchText(Srv->GetServerName(),servermask))
1445 Srv->SendOpers("*** Remote rehash initiated from server \002"+prefix+"\002.");
1446 Srv->RehashServer();
1447 ReadConfiguration(false);
1449 DoOneToAllButSender(prefix,"REHASH",params,prefix);
1453 bool RemoteKill(std::string prefix, std::deque<std::string> ¶ms)
1455 if (params.size() != 2)
1457 std::string nick = params[0];
1458 userrec* u = Srv->FindNick(prefix);
1459 userrec* who = Srv->FindNick(nick);
1462 /* Prepend kill source, if we don't have one */
1463 std::string sourceserv = prefix;
1466 sourceserv = u->server;
1468 if (*(params[1].c_str()) != '[')
1470 params[1] = "[" + sourceserv + "] Killed (" + params[1] +")";
1472 std::string reason = params[1];
1473 params[1] = ":" + params[1];
1474 DoOneToAllButSender(prefix,"KILL",params,sourceserv);
1475 Srv->QuitUser(who,reason);
1480 bool LocalPong(std::string prefix, std::deque<std::string> ¶ms)
1482 if (params.size() < 1)
1484 TreeServer* ServerSource = FindServer(prefix);
1487 ServerSource->SetPingFlag();
1492 bool MetaData(std::string prefix, std::deque<std::string> ¶ms)
1494 if (params.size() < 3)
1496 TreeServer* ServerSource = FindServer(prefix);
1499 if (params[0] == "*")
1501 FOREACH_MOD(I_OnDecodeMetaData,OnDecodeMetaData(TYPE_OTHER,NULL,params[1],params[2]));
1503 else if (*(params[0].c_str()) == '#')
1505 chanrec* c = Srv->FindChannel(params[0]);
1508 FOREACH_MOD(I_OnDecodeMetaData,OnDecodeMetaData(TYPE_CHANNEL,c,params[1],params[2]));
1511 else if (*(params[0].c_str()) != '#')
1513 userrec* u = Srv->FindNick(params[0]);
1516 FOREACH_MOD(I_OnDecodeMetaData,OnDecodeMetaData(TYPE_USER,u,params[1],params[2]));
1520 params[2] = ":" + params[2];
1521 DoOneToAllButSender(prefix,"METADATA",params,prefix);
1525 bool ServerVersion(std::string prefix, std::deque<std::string> ¶ms)
1527 if (params.size() < 1)
1529 TreeServer* ServerSource = FindServer(prefix);
1532 ServerSource->SetVersion(params[0]);
1534 params[0] = ":" + params[0];
1535 DoOneToAllButSender(prefix,"VERSION",params,prefix);
1539 bool ChangeHost(std::string prefix, std::deque<std::string> ¶ms)
1541 if (params.size() < 1)
1543 userrec* u = Srv->FindNick(prefix);
1546 Srv->ChangeHost(u,params[0]);
1547 DoOneToAllButSender(prefix,"FHOST",params,u->server);
1552 bool AddLine(std::string prefix, std::deque<std::string> ¶ms)
1554 if (params.size() < 6)
1557 bool propogate = false;
1559 switch (*(params[0].c_str()))
1562 propogate = add_zline(atoi(params[4].c_str()), params[2].c_str(), params[5].c_str(), params[1].c_str());
1563 zline_set_creation_time((char*)params[1].c_str(), atoi(params[3].c_str()));
1566 propogate = add_qline(atoi(params[4].c_str()), params[2].c_str(), params[5].c_str(), params[1].c_str());
1567 qline_set_creation_time((char*)params[1].c_str(), atoi(params[3].c_str()));
1570 propogate = add_eline(atoi(params[4].c_str()), params[2].c_str(), params[5].c_str(), params[1].c_str());
1571 eline_set_creation_time((char*)params[1].c_str(), atoi(params[3].c_str()));
1574 propogate = add_gline(atoi(params[4].c_str()), params[2].c_str(), params[5].c_str(), params[1].c_str());
1575 gline_set_creation_time((char*)params[1].c_str(), atoi(params[3].c_str()));
1578 propogate = add_kline(atoi(params[4].c_str()), params[2].c_str(), params[5].c_str(), params[1].c_str());
1581 /* Just in case... */
1582 Srv->SendOpers("*** \2WARNING\2: Invalid xline type '"+params[0]+"' sent by server "+prefix+", ignored!");
1586 /* Send it on its way */
1589 params[5] = ":" + params[5];
1590 DoOneToAllButSender(prefix,"ADDLINE",params,prefix);
1595 bool ChangeName(std::string prefix, std::deque<std::string> ¶ms)
1597 if (params.size() < 1)
1599 userrec* u = Srv->FindNick(prefix);
1602 Srv->ChangeGECOS(u,params[0]);
1603 params[0] = ":" + params[0];
1604 DoOneToAllButSender(prefix,"FNAME",params,u->server);
1609 bool Whois(std::string prefix, std::deque<std::string> ¶ms)
1611 if (params.size() < 1)
1613 log(DEBUG,"In IDLE command");
1614 userrec* u = Srv->FindNick(prefix);
1617 log(DEBUG,"USER EXISTS: %s",u->nick);
1618 // an incoming request
1619 if (params.size() == 1)
1621 userrec* x = Srv->FindNick(params[0]);
1622 if ((x) && (x->fd > -1))
1624 userrec* x = Srv->FindNick(params[0]);
1625 log(DEBUG,"Got IDLE");
1626 char signon[MAXBUF];
1628 log(DEBUG,"Sending back IDLE 3");
1629 snprintf(signon,MAXBUF,"%lu",(unsigned long)x->signon);
1630 snprintf(idle,MAXBUF,"%lu",(unsigned long)abs((x->idle_lastmsg)-time(NULL)));
1631 std::deque<std::string> par;
1632 par.push_back(prefix);
1633 par.push_back(signon);
1634 par.push_back(idle);
1635 // ours, we're done, pass it BACK
1636 DoOneToOne(params[0],"IDLE",par,u->server);
1640 // not ours pass it on
1641 DoOneToOne(prefix,"IDLE",params,x->server);
1644 else if (params.size() == 3)
1646 std::string who_did_the_whois = params[0];
1647 userrec* who_to_send_to = Srv->FindNick(who_did_the_whois);
1648 if ((who_to_send_to) && (who_to_send_to->fd > -1))
1650 log(DEBUG,"Got final IDLE");
1651 // an incoming reply to a whois we sent out
1652 std::string nick_whoised = prefix;
1653 unsigned long signon = atoi(params[1].c_str());
1654 unsigned long idle = atoi(params[2].c_str());
1655 if ((who_to_send_to) && (who_to_send_to->fd > -1))
1656 do_whois(who_to_send_to,u,signon,idle,(char*)nick_whoised.c_str());
1660 // not ours, pass it on
1661 DoOneToOne(prefix,"IDLE",params,who_to_send_to->server);
1668 bool Push(std::string prefix, std::deque<std::string> ¶ms)
1670 if (params.size() < 2)
1672 userrec* u = Srv->FindNick(params[0]);
1675 // push the raw to the user
1676 ::Write(u->fd,"%s",params[1].c_str());
1680 // continue the raw onwards
1681 DoOneToOne(prefix,"PUSH",params,u->server);
1686 bool LocalPing(std::string prefix, std::deque<std::string> ¶ms)
1688 if (params.size() < 1)
1690 std::string stufftobounce = params[0];
1691 this->WriteLine(":"+Srv->GetServerName()+" PONG "+stufftobounce);
1695 bool RemoteServer(std::string prefix, std::deque<std::string> ¶ms)
1697 if (params.size() < 4)
1699 std::string servername = params[0];
1700 std::string password = params[1];
1701 // hopcount is not used for a remote server, we calculate this ourselves
1702 std::string description = params[3];
1703 TreeServer* ParentOfThis = FindServer(prefix);
1706 this->WriteLine("ERROR :Protocol error - Introduced remote server from unknown server "+prefix);
1709 TreeServer* CheckDupe = FindServer(servername);
1712 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1713 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, already exists on server "+CheckDupe->GetParent()->GetName());
1716 TreeServer* Node = new TreeServer(servername,description,ParentOfThis,NULL);
1717 ParentOfThis->AddChild(Node);
1718 params[3] = ":" + params[3];
1719 DoOneToAllButSender(prefix,"SERVER",params,prefix);
1720 Srv->SendOpers("*** Server \002"+prefix+"\002 introduced server \002"+servername+"\002 ("+description+")");
1724 bool Outbound_Reply_Server(std::deque<std::string> ¶ms)
1726 if (params.size() < 4)
1728 std::string servername = params[0];
1729 std::string password = params[1];
1730 int hops = atoi(params[2].c_str());
1733 this->WriteLine("ERROR :Server too far away for authentication");
1734 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, server is too far away for authentication");
1737 std::string description = params[3];
1738 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1740 if ((x->Name == servername) && (x->RecvPass == password))
1742 TreeServer* CheckDupe = FindServer(servername);
1745 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1746 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, already exists on server "+CheckDupe->GetParent()->GetName());
1749 // Begin the sync here. this kickstarts the
1750 // other side, waiting in WAIT_AUTH_2 state,
1751 // into starting their burst, as it shows
1752 // that we're happy.
1753 this->LinkState = CONNECTED;
1754 // we should add the details of this server now
1755 // to the servers tree, as a child of the root
1757 TreeServer* Node = new TreeServer(servername,description,TreeRoot,this);
1758 TreeRoot->AddChild(Node);
1759 params[3] = ":" + params[3];
1760 DoOneToAllButSender(TreeRoot->GetName(),"SERVER",params,servername);
1761 this->bursting = true;
1762 this->DoBurst(Node);
1766 this->WriteLine("ERROR :Invalid credentials");
1767 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, invalid link credentials");
1771 bool Inbound_Server(std::deque<std::string> ¶ms)
1773 if (params.size() < 4)
1775 std::string servername = params[0];
1776 std::string password = params[1];
1777 int hops = atoi(params[2].c_str());
1780 this->WriteLine("ERROR :Server too far away for authentication");
1781 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, server is too far away for authentication");
1784 std::string description = params[3];
1785 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1787 if ((x->Name == servername) && (x->RecvPass == password))
1789 TreeServer* CheckDupe = FindServer(servername);
1792 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1793 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, already exists on server "+CheckDupe->GetParent()->GetName());
1796 /* If the config says this link is encrypted, but the remote side
1797 * hasnt bothered to send the AES command before SERVER, then we
1798 * boot them off as we MUST have this connection encrypted.
1800 if ((x->EncryptionKey != "") && (!this->ctx_in))
1802 this->WriteLine("ERROR :This link requires AES encryption to be enabled. Plaintext connection refused.");
1803 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, remote server did not enable AES.");
1806 Srv->SendOpers("*** Verified incoming server connection from \002"+servername+"\002["+(x->HiddenFromStats ? "<hidden>" : this->GetIP())+"] ("+description+")");
1807 this->InboundServerName = servername;
1808 this->InboundDescription = description;
1809 // this is good. Send our details: Our server name and description and hopcount of 0,
1810 // along with the sendpass from this block.
1811 this->WriteLine("SERVER "+Srv->GetServerName()+" "+x->SendPass+" 0 :"+Srv->GetServerDescription());
1812 // move to the next state, we are now waiting for THEM.
1813 this->LinkState = WAIT_AUTH_2;
1817 this->WriteLine("ERROR :Invalid credentials");
1818 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, invalid link credentials");
1822 void Split(std::string line, bool stripcolon, std::deque<std::string> &n)
1824 if (!strchr(line.c_str(),' '))
1829 std::stringstream s(line);
1830 std::string param = "";
1849 if ((param == ":") && (item > 0))
1872 bool ProcessLine(std::string line)
1874 char* l = (char*)line.c_str();
1875 while ((strlen(l)) && (l[strlen(l)-1] == '\r') || (l[strlen(l)-1] == '\n'))
1876 l[strlen(l)-1] = '\0';
1880 Srv->Log(DEBUG,"IN: "+line);
1882 std::deque<std::string> params;
1883 this->Split(line,true,params);
1884 std::string command = "";
1885 std::string prefix = "";
1886 if (((params[0].c_str())[0] == ':') && (params.size() > 1))
1889 command = params[1];
1890 char* pref = (char*)prefix.c_str();
1898 command = params[0];
1902 if ((!this->ctx_in) && (command == "AES"))
1904 std::string sserv = params[0];
1905 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1907 if ((x->EncryptionKey != "") && (x->Name == sserv))
1909 this->InitAES(x->EncryptionKey,sserv);
1914 else if ((this->ctx_in) && (command == "AES"))
1916 WriteOpers("*** \2AES\2: Encryption already enabled on this connection yet %s is trying to enable it twice!",params[0].c_str());
1919 switch (this->LinkState)
1924 // Waiting for SERVER command from remote server. Server initiating
1925 // the connection sends the first SERVER command, listening server
1926 // replies with theirs if its happy, then if the initiator is happy,
1927 // it starts to send its net sync, which starts the merge, otherwise
1928 // it sends an ERROR.
1929 if (command == "PASS")
1931 /* Silently ignored */
1933 else if (command == "SERVER")
1935 return this->Inbound_Server(params);
1937 else if (command == "ERROR")
1939 return this->Error(params);
1941 else if (command == "USER")
1943 this->WriteLine("ERROR :Client connections to this port are prohibited.");
1946 else if (command == "CAPAB")
1948 return this->Capab(params);
1950 else if ((command == "U") || (command == "S"))
1952 this->WriteLine("ERROR :Cannot use the old-style mesh linking protocol with m_spanningtree.so!");
1957 this->WriteLine("ERROR :Invalid command in negotiation phase.");
1962 // Waiting for start of other side's netmerge to say they liked our
1964 if (command == "SERVER")
1966 // cant do this, they sent it to us in the WAIT_AUTH_1 state!
1970 else if ((command == "U") || (command == "S"))
1972 this->WriteLine("ERROR :Cannot use the old-style mesh linking protocol with m_spanningtree.so!");
1975 else if (command == "BURST")
1977 this->LinkState = CONNECTED;
1978 Node = new TreeServer(InboundServerName,InboundDescription,TreeRoot,this);
1979 TreeRoot->AddChild(Node);
1981 params.push_back(InboundServerName);
1982 params.push_back("*");
1983 params.push_back("1");
1984 params.push_back(":"+InboundDescription);
1985 DoOneToAllButSender(TreeRoot->GetName(),"SERVER",params,InboundServerName);
1986 this->bursting = true;
1987 this->DoBurst(Node);
1989 else if (command == "ERROR")
1991 return this->Error(params);
1993 else if (command == "CAPAB")
1995 return this->Capab(params);
2000 this->WriteLine("ERROR :Internal error -- listening socket accepted its own descriptor!!!");
2004 if (command == "SERVER")
2006 // another server we connected to, which was in WAIT_AUTH_1 state,
2007 // has just sent us their credentials. If we get this far, theyre
2008 // happy with OUR credentials, and they are now in WAIT_AUTH_2 state.
2009 // if we're happy with this, we should send our netburst which
2010 // kickstarts the merge.
2011 return this->Outbound_Reply_Server(params);
2013 else if (command == "ERROR")
2015 return this->Error(params);
2019 // This is the 'authenticated' state, when all passwords
2020 // have been exchanged and anything past this point is taken
2025 std::string direction = prefix;
2026 userrec* t = Srv->FindNick(prefix);
2029 direction = t->server;
2031 TreeServer* route_back_again = BestRouteTo(direction);
2032 if ((!route_back_again) || (route_back_again->GetSocket() != this))
2034 if (route_back_again)
2035 log(DEBUG,"Protocol violation: Fake direction in command '%s' from connection '%s'",line.c_str(),this->GetName().c_str());
2040 * When there is activity on the socket, reset the ping counter so
2041 * that we're not wasting bandwidth pinging an active server.
2043 route_back_again->SetNextPingTime(time(NULL) + 120);
2044 route_back_again->SetPingFlag();
2047 if (command == "SVSMODE")
2049 /* Services expects us to implement
2050 * SVSMODE. In inspircd its the same as
2055 std::string target = "";
2056 /* Yes, know, this is a mess. Its reasonably fast though as we're
2057 * working with std::string here.
2059 if ((command == "NICK") && (params.size() > 1))
2061 return this->IntroduceClient(prefix,params);
2063 else if (command == "FJOIN")
2065 return this->ForceJoin(prefix,params);
2067 else if (command == "SERVER")
2069 return this->RemoteServer(prefix,params);
2071 else if (command == "ERROR")
2073 return this->Error(params);
2075 else if (command == "OPERTYPE")
2077 return this->OperType(prefix,params);
2079 else if (command == "FMODE")
2081 return this->ForceMode(prefix,params);
2083 else if (command == "KILL")
2085 return this->RemoteKill(prefix,params);
2087 else if (command == "FTOPIC")
2089 return this->ForceTopic(prefix,params);
2091 else if (command == "REHASH")
2093 return this->RemoteRehash(prefix,params);
2095 else if (command == "METADATA")
2097 return this->MetaData(prefix,params);
2099 else if (command == "PING")
2101 return this->LocalPing(prefix,params);
2103 else if (command == "PONG")
2105 return this->LocalPong(prefix,params);
2107 else if (command == "VERSION")
2109 return this->ServerVersion(prefix,params);
2111 else if (command == "FHOST")
2113 return this->ChangeHost(prefix,params);
2115 else if (command == "FNAME")
2117 return this->ChangeName(prefix,params);
2119 else if (command == "ADDLINE")
2121 return this->AddLine(prefix,params);
2123 else if (command == "SVSNICK")
2127 prefix = this->GetName();
2129 return this->ForceNick(prefix,params);
2131 else if (command == "IDLE")
2133 return this->Whois(prefix,params);
2135 else if (command == "PUSH")
2137 return this->Push(prefix,params);
2139 else if (command == "SVSJOIN")
2143 prefix = this->GetName();
2145 return this->ServiceJoin(prefix,params);
2147 else if (command == "SQUIT")
2149 if (params.size() == 2)
2151 this->Squit(FindServer(params[0]),params[1]);
2155 else if (command == "ENDBURST")
2157 this->bursting = false;
2162 // not a special inter-server command.
2163 // Emulate the actual user doing the command,
2164 // this saves us having a huge ugly parser.
2165 userrec* who = Srv->FindNick(prefix);
2166 std::string sourceserv = this->myhost;
2167 if (this->InboundServerName != "")
2169 sourceserv = this->InboundServerName;
2173 if ((command == "NICK") && (params.size() > 0))
2175 /* On nick messages, check that the nick doesnt
2176 * already exist here. If it does, kill their copy,
2179 userrec* x = Srv->FindNick(params[0]);
2182 std::deque<std::string> p;
2183 p.push_back(params[0]);
2184 p.push_back("Nickname collision ("+prefix+" -> "+params[0]+")");
2185 DoOneToMany(Srv->GetServerName(),"KILL",p);
2187 p.push_back(prefix);
2188 p.push_back("Nickname collision");
2189 DoOneToMany(Srv->GetServerName(),"KILL",p);
2190 Srv->QuitUser(x,"Nickname collision ("+prefix+" -> "+params[0]+")");
2191 userrec* y = Srv->FindNick(prefix);
2194 Srv->QuitUser(y,"Nickname collision");
2196 return DoOneToAllButSenderRaw(line,sourceserv,prefix,command,params);
2200 target = who->server;
2201 char* strparams[127];
2202 for (unsigned int q = 0; q < params.size(); q++)
2204 strparams[q] = (char*)params[q].c_str();
2206 Srv->CallCommandHandler(command, strparams, params.size(), who);
2210 // its not a user. Its either a server, or somethings screwed up.
2211 if (IsServer(prefix))
2213 target = Srv->GetServerName();
2217 log(DEBUG,"Command with unknown origin '%s'",prefix.c_str());
2221 return DoOneToAllButSenderRaw(line,sourceserv,prefix,command,params);
2230 virtual std::string GetName()
2232 std::string sourceserv = this->myhost;
2233 if (this->InboundServerName != "")
2235 sourceserv = this->InboundServerName;
2240 virtual void OnTimeout()
2242 if (this->LinkState == CONNECTING)
2244 Srv->SendOpers("*** CONNECT: Connection to \002"+myhost+"\002 timed out.");
2248 virtual void OnClose()
2250 // Connection closed.
2251 // If the connection is fully up (state CONNECTED)
2252 // then propogate a netsplit to all peers.
2253 std::string quitserver = this->myhost;
2254 if (this->InboundServerName != "")
2256 quitserver = this->InboundServerName;
2258 TreeServer* s = FindServer(quitserver);
2261 Squit(s,"Remote host closed the connection");
2263 WriteOpers("Server '\2%s\2' closed the connection.",quitserver.c_str());
2266 virtual int OnIncomingConnection(int newsock, char* ip)
2268 TreeSocket* s = new TreeSocket(newsock, ip);
2274 void AddThisServer(TreeServer* server, std::deque<TreeServer*> &list)
2276 for (unsigned int c = 0; c < list.size(); c++)
2278 if (list[c] == server)
2283 list.push_back(server);
2286 // returns a list of DIRECT servernames for a specific channel
2287 void GetListOfServersForChannel(chanrec* c, std::deque<TreeServer*> &list)
2289 std::map<char*,char*> *ulist = c->GetUsers();
2290 for (std::map<char*,char*>::iterator i = ulist->begin(); i != ulist->end(); i++)
2292 char* o = i->second;
2293 userrec* otheruser = (userrec*)o;
2294 if (otheruser->fd < 0)
2296 TreeServer* best = BestRouteTo(otheruser->server);
2298 AddThisServer(best,list);
2304 bool DoOneToAllButSenderRaw(std::string data, std::string omit, std::string prefix, std::string command, std::deque<std::string> ¶ms)
2306 TreeServer* omitroute = BestRouteTo(omit);
2307 if ((command == "NOTICE") || (command == "PRIVMSG"))
2309 if ((params.size() >= 2) && (*(params[0].c_str()) != '$'))
2312 if ((*(params[0].c_str()) == '@') || (*(params[0].c_str()) == '%') || (*(params[0].c_str()) == '+'))
2314 params[0] = params[0].substr(1, params[0].length()-1);
2316 if (*(params[0].c_str()) != '#')
2318 // special routing for private messages/notices
2319 userrec* d = Srv->FindNick(params[0]);
2322 std::deque<std::string> par;
2323 par.push_back(params[0]);
2324 par.push_back(":"+params[1]);
2325 DoOneToOne(prefix,command,par,d->server);
2331 log(DEBUG,"Channel privmsg going to chan %s",params[0].c_str());
2332 chanrec* c = Srv->FindChannel(params[0]);
2335 std::deque<TreeServer*> list;
2336 GetListOfServersForChannel(c,list);
2337 log(DEBUG,"Got a list of %d servers",list.size());
2338 unsigned int lsize = list.size();
2339 for (unsigned int i = 0; i < lsize; i++)
2341 TreeSocket* Sock = list[i]->GetSocket();
2342 if ((Sock) && (list[i]->GetName() != omit) && (omitroute != list[i]))
2344 log(DEBUG,"Writing privmsg to server %s",list[i]->GetName().c_str());
2345 Sock->WriteLine(data);
2353 unsigned int items = TreeRoot->ChildCount();
2354 for (unsigned int x = 0; x < items; x++)
2356 TreeServer* Route = TreeRoot->GetChild(x);
2357 if ((Route->GetSocket()) && (Route->GetName() != omit) && (omitroute != Route))
2359 TreeSocket* Sock = Route->GetSocket();
2360 Sock->WriteLine(data);
2366 bool DoOneToAllButSender(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string omit)
2368 TreeServer* omitroute = BestRouteTo(omit);
2369 std::string FullLine = ":" + prefix + " " + command;
2370 unsigned int words = params.size();
2371 for (unsigned int x = 0; x < words; x++)
2373 FullLine = FullLine + " " + params[x];
2375 unsigned int items = TreeRoot->ChildCount();
2376 for (unsigned int x = 0; x < items; x++)
2378 TreeServer* Route = TreeRoot->GetChild(x);
2379 // Send the line IF:
2380 // The route has a socket (its a direct connection)
2381 // The route isnt the one to be omitted
2382 // The route isnt the path to the one to be omitted
2383 if ((Route->GetSocket()) && (Route->GetName() != omit) && (omitroute != Route))
2385 TreeSocket* Sock = Route->GetSocket();
2386 Sock->WriteLine(FullLine);
2392 bool DoOneToMany(std::string prefix, std::string command, std::deque<std::string> ¶ms)
2394 std::string FullLine = ":" + prefix + " " + command;
2395 unsigned int words = params.size();
2396 for (unsigned int x = 0; x < words; x++)
2398 FullLine = FullLine + " " + params[x];
2400 unsigned int items = TreeRoot->ChildCount();
2401 for (unsigned int x = 0; x < items; x++)
2403 TreeServer* Route = TreeRoot->GetChild(x);
2404 if (Route->GetSocket())
2406 TreeSocket* Sock = Route->GetSocket();
2407 Sock->WriteLine(FullLine);
2413 bool DoOneToOne(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string target)
2415 TreeServer* Route = BestRouteTo(target);
2418 std::string FullLine = ":" + prefix + " " + command;
2419 unsigned int words = params.size();
2420 for (unsigned int x = 0; x < words; x++)
2422 FullLine = FullLine + " " + params[x];
2424 if (Route->GetSocket())
2426 TreeSocket* Sock = Route->GetSocket();
2427 Sock->WriteLine(FullLine);
2437 std::vector<TreeSocket*> Bindings;
2439 void ReadConfiguration(bool rebind)
2441 Conf = new ConfigReader;
2444 for (int j =0; j < Conf->Enumerate("bind"); j++)
2446 std::string Type = Conf->ReadValue("bind","type",j);
2447 std::string IP = Conf->ReadValue("bind","address",j);
2448 long Port = Conf->ReadInteger("bind","port",j,true);
2449 if (Type == "servers")
2455 TreeSocket* listener = new TreeSocket(IP.c_str(),Port,true,10);
2456 if (listener->GetState() == I_LISTENING)
2458 Srv->AddSocket(listener);
2459 Bindings.push_back(listener);
2463 log(DEFAULT,"m_spanningtree: Warning: Failed to bind server port %d",Port);
2470 FlatLinks = Conf->ReadFlag("options","flatlinks",0);
2471 HideULines = Conf->ReadFlag("options","hideulines",0);
2473 for (int j =0; j < Conf->Enumerate("link"); j++)
2476 L.Name = Conf->ReadValue("link","name",j);
2477 L.IPAddr = Conf->ReadValue("link","ipaddr",j);
2478 L.Port = Conf->ReadInteger("link","port",j,true);
2479 L.SendPass = Conf->ReadValue("link","sendpass",j);
2480 L.RecvPass = Conf->ReadValue("link","recvpass",j);
2481 L.AutoConnect = Conf->ReadInteger("link","autoconnect",j,true);
2482 L.EncryptionKey = Conf->ReadValue("link","encryptionkey",j);
2483 L.HiddenFromStats = Conf->ReadFlag("link","hidden",j);
2484 L.NextConnectTime = time(NULL) + L.AutoConnect;
2485 /* Bugfix by brain, do not allow people to enter bad configurations */
2486 if ((L.RecvPass != "") && (L.SendPass != "") && (L.Name != "") && (L.Port))
2488 LinkBlocks.push_back(L);
2489 log(DEBUG,"m_spanningtree: Read server %s with host %s:%d",L.Name.c_str(),L.IPAddr.c_str(),L.Port);
2493 if (L.RecvPass == "")
2495 log(DEFAULT,"Invalid configuration for server '%s', recvpass not defined!",L.Name.c_str());
2497 else if (L.SendPass == "")
2499 log(DEFAULT,"Invalid configuration for server '%s', sendpass not defined!",L.Name.c_str());
2501 else if (L.Name == "")
2503 log(DEFAULT,"Invalid configuration, link tag without a name!");
2507 log(DEFAULT,"Invalid configuration for server '%s', no port specified!",L.Name.c_str());
2515 class ModuleSpanningTree : public Module
2517 std::vector<TreeSocket*> Bindings;
2520 unsigned int max_local;
2521 unsigned int max_global;
2522 cmd_rconnect* command_rconnect;
2526 ModuleSpanningTree(Server* Me)
2527 : Module::Module(Me), max_local(0), max_global(0)
2532 // Create the root of the tree
2533 TreeRoot = new TreeServer(Srv->GetServerName(),Srv->GetServerDescription());
2535 ReadConfiguration(true);
2537 command_rconnect = new cmd_rconnect(this);
2538 Srv->AddCommand(command_rconnect);
2541 void ShowLinks(TreeServer* Current, userrec* user, int hops)
2543 std::string Parent = TreeRoot->GetName();
2544 if (Current->GetParent())
2546 Parent = Current->GetParent()->GetName();
2548 for (unsigned int q = 0; q < Current->ChildCount(); q++)
2550 if ((HideULines) && (Srv->IsUlined(Current->GetName())))
2554 ShowLinks(Current->GetChild(q),user,hops+1);
2559 ShowLinks(Current->GetChild(q),user,hops+1);
2562 WriteServ(user->fd,"364 %s %s %s :%d %s",user->nick,Current->GetName().c_str(),(FlatLinks && (!*user->oper)) ? Srv->GetServerName().c_str() : Parent.c_str(),(FlatLinks && (!*user->oper)) ? 0 : hops,Current->GetDesc().c_str());
2565 int CountLocalServs()
2567 return TreeRoot->ChildCount();
2572 return serverlist.size();
2575 void HandleLinks(char** parameters, int pcnt, userrec* user)
2577 ShowLinks(TreeRoot,user,0);
2578 WriteServ(user->fd,"365 %s * :End of /LINKS list.",user->nick);
2582 void HandleLusers(char** parameters, int pcnt, userrec* user)
2584 /* Only update these when someone wants to see them, more efficient */
2585 if ((unsigned int)local_count() > max_local)
2586 max_local = local_count();
2587 if (clientlist.size() > max_global)
2588 max_global = clientlist.size();
2590 WriteServ(user->fd,"251 %s :There are %d users and %d invisible on %d servers",user->nick,usercnt()-usercount_invisible(),usercount_invisible(),this->CountServs());
2591 WriteServ(user->fd,"252 %s %d :operator(s) online",user->nick,usercount_opers());
2592 WriteServ(user->fd,"253 %s %d :unknown connections",user->nick,usercount_unknown());
2593 WriteServ(user->fd,"254 %s %d :channels formed",user->nick,chancount());
2594 WriteServ(user->fd,"254 %s :I have %d clients and %d servers",user->nick,local_count(),this->CountLocalServs());
2595 WriteServ(user->fd,"265 %s :Current Local Users: %d Max: %d",user->nick,local_count(),max_local);
2596 WriteServ(user->fd,"266 %s :Current Global Users: %d Max: %d",user->nick,clientlist.size(),max_global);
2600 // WARNING: NOT THREAD SAFE - DONT GET ANY SMART IDEAS.
2602 void ShowMap(TreeServer* Current, userrec* user, int depth, char matrix[128][80])
2606 for (int t = 0; t < depth; t++)
2608 matrix[line][t] = ' ';
2611 // For Aligning, we need to work out exactly how deep this thing is, and produce
2612 // a 'Spacer' String to compensate.
2615 memset(spacer,' ',40);
2616 if ((40 - Current->GetName().length() - depth) > 1) {
2617 spacer[40 - Current->GetName().length() - depth] = '\0';
2626 if (clientlist.size() == 0) {
2627 // If there are no users, WHO THE HELL DID THE /MAP?!?!?!
2632 percent = ((float)Current->GetUserCount() / (float)clientlist.size()) * 100;
2634 snprintf(text, 80, "%s %s%5d [%5.2f%%]", Current->GetName().c_str(), spacer, Current->GetUserCount(), percent);
2635 strlcpy(&matrix[line][depth],text,80);
2637 for (unsigned int q = 0; q < Current->ChildCount(); q++)
2639 if ((HideULines) && (Srv->IsUlined(Current->GetChild(q)->GetName())))
2643 ShowMap(Current->GetChild(q),user,(FlatLinks && (!*user->oper)) ? depth : depth+2,matrix);
2648 ShowMap(Current->GetChild(q),user,(FlatLinks && (!*user->oper)) ? depth : depth+2,matrix);
2654 // Ok, prepare to be confused.
2655 // After much mulling over how to approach this, it struck me that
2656 // the 'usual' way of doing a /MAP isnt the best way. Instead of
2657 // keeping track of a ton of ascii characters, and line by line
2658 // under recursion working out where to place them using multiplications
2659 // and divisons, we instead render the map onto a backplane of characters
2660 // (a character matrix), then draw the branches as a series of "L" shapes
2661 // from the nodes. This is not only friendlier on CPU it uses less stack.
2663 void HandleMap(char** parameters, int pcnt, userrec* user)
2665 // This array represents a virtual screen which we will
2666 // "scratch" draw to, as the console device of an irc
2667 // client does not provide for a proper terminal.
2668 char matrix[128][80];
2669 for (unsigned int t = 0; t < 128; t++)
2671 matrix[t][0] = '\0';
2674 // The only recursive bit is called here.
2675 ShowMap(TreeRoot,user,0,matrix);
2676 // Process each line one by one. The algorithm has a limit of
2677 // 128 servers (which is far more than a spanning tree should have
2678 // anyway, so we're ok). This limit can be raised simply by making
2679 // the character matrix deeper, 128 rows taking 10k of memory.
2680 for (int l = 1; l < line; l++)
2682 // scan across the line looking for the start of the
2683 // servername (the recursive part of the algorithm has placed
2684 // the servers at indented positions depending on what they
2686 int first_nonspace = 0;
2687 while (matrix[l][first_nonspace] == ' ')
2692 // Draw the `- (corner) section: this may be overwritten by
2693 // another L shape passing along the same vertical pane, becoming
2694 // a |- (branch) section instead.
2695 matrix[l][first_nonspace] = '-';
2696 matrix[l][first_nonspace-1] = '`';
2698 // Draw upwards until we hit the parent server, causing possibly
2699 // other corners (`-) to become branches (|-)
2700 while ((matrix[l2][first_nonspace-1] == ' ') || (matrix[l2][first_nonspace-1] == '`'))
2702 matrix[l2][first_nonspace-1] = '|';
2706 // dump the whole lot to the user. This is the easy bit, honest.
2707 for (int t = 0; t < line; t++)
2709 WriteServ(user->fd,"006 %s :%s",user->nick,&matrix[t][0]);
2711 WriteServ(user->fd,"007 %s :End of /MAP",user->nick);
2715 int HandleSquit(char** parameters, int pcnt, userrec* user)
2717 TreeServer* s = FindServerMask(parameters[0]);
2722 WriteServ(user->fd,"NOTICE %s :*** SQUIT: Foolish mortal, you cannot make a server SQUIT itself! (%s matches local server name)",user->nick,parameters[0]);
2725 TreeSocket* sock = s->GetSocket();
2728 log(DEBUG,"Splitting server %s",s->GetName().c_str());
2729 WriteOpers("*** SQUIT: Server \002%s\002 removed from network by %s",parameters[0],user->nick);
2730 sock->Squit(s,"Server quit by "+std::string(user->nick)+"!"+std::string(user->ident)+"@"+std::string(user->host));
2731 Srv->RemoveSocket(sock);
2735 WriteServ(user->fd,"NOTICE %s :*** SQUIT: The server \002%s\002 is not directly connected.",user->nick,parameters[0]);
2740 WriteServ(user->fd,"NOTICE %s :*** SQUIT: The server \002%s\002 does not exist on the network.",user->nick,parameters[0]);
2745 int HandleRemoteWhois(char** parameters, int pcnt, userrec* user)
2747 if ((user->fd > -1) && (pcnt > 1))
2749 userrec* remote = Srv->FindNick(parameters[1]);
2750 if ((remote) && (remote->fd < 0))
2752 std::deque<std::string> params;
2753 params.push_back(parameters[1]);
2754 DoOneToOne(user->nick,"IDLE",params,remote->server);
2759 WriteServ(user->fd,"401 %s %s :No such nick/channel",user->nick, parameters[1]);
2760 WriteServ(user->fd,"318 %s %s :End of /WHOIS list.",user->nick, parameters[1]);
2767 void DoPingChecks(time_t curtime)
2769 for (unsigned int j = 0; j < TreeRoot->ChildCount(); j++)
2771 TreeServer* serv = TreeRoot->GetChild(j);
2772 TreeSocket* sock = serv->GetSocket();
2775 if (curtime >= serv->NextPingTime())
2777 if (serv->AnsweredLastPing())
2779 sock->WriteLine(":"+Srv->GetServerName()+" PING "+serv->GetName());
2780 serv->SetNextPingTime(curtime + 120);
2784 // they didnt answer, boot them
2785 WriteOpers("*** Server \002%s\002 pinged out",serv->GetName().c_str());
2786 sock->Squit(serv,"Ping timeout");
2787 Srv->RemoveSocket(sock);
2796 void AutoConnectServers(time_t curtime)
2798 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
2800 if ((x->AutoConnect) && (curtime >= x->NextConnectTime))
2802 log(DEBUG,"Auto-Connecting %s",x->Name.c_str());
2803 x->NextConnectTime = curtime + x->AutoConnect;
2804 TreeServer* CheckDupe = FindServer(x->Name);
2807 // an autoconnected server is not connected. Check if its time to connect it
2808 WriteOpers("*** AUTOCONNECT: Auto-connecting server \002%s\002 (%lu seconds until next attempt)",x->Name.c_str(),x->AutoConnect);
2809 TreeSocket* newsocket = new TreeSocket(x->IPAddr,x->Port,false,10,x->Name);
2810 if (newsocket->GetState() != I_ERROR)
2812 Srv->AddSocket(newsocket);
2816 WriteOpers("*** AUTOCONNECT: Error autoconnecting \002%s\002.",x->Name.c_str());
2824 int HandleVersion(char** parameters, int pcnt, userrec* user)
2826 // we've already checked if pcnt > 0, so this is safe
2827 TreeServer* found = FindServerMask(parameters[0]);
2830 std::string Version = found->GetVersion();
2831 WriteServ(user->fd,"351 %s :%s",user->nick,Version.c_str());
2832 if (found == TreeRoot)
2834 std::stringstream out(Config->data005);
2835 std::string token = "";
2836 std::string line5 = "";
2837 int token_counter = 0;
2841 line5 = line5 + token + " ";
2843 if ((token_counter >= 13) || (out.eof() == true))
2845 WriteServ(user->fd,"005 %s %s:are supported by this server",user->nick,line5.c_str());
2854 WriteServ(user->fd,"402 %s %s :No such server",user->nick,parameters[0]);
2859 int HandleConnect(char** parameters, int pcnt, userrec* user)
2861 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
2863 if (Srv->MatchText(x->Name.c_str(),parameters[0]))
2865 TreeServer* CheckDupe = FindServer(x->Name);
2868 WriteServ(user->fd,"NOTICE %s :*** CONNECT: Connecting to server: \002%s\002 (%s:%d)",user->nick,x->Name.c_str(),(x->HiddenFromStats ? "<hidden>" : x->IPAddr.c_str()),x->Port);
2869 TreeSocket* newsocket = new TreeSocket(x->IPAddr,x->Port,false,10,x->Name);
2870 if (newsocket->GetState() != I_ERROR)
2872 Srv->AddSocket(newsocket);
2876 WriteServ(user->fd,"NOTICE %s :*** CONNECT: Error connecting \002%s\002.",user->nick,x->Name.c_str());
2883 WriteServ(user->fd,"NOTICE %s :*** CONNECT: Server \002%s\002 already exists on the network and is connected via \002%s\002",user->nick,x->Name.c_str(),CheckDupe->GetParent()->GetName().c_str());
2888 WriteServ(user->fd,"NOTICE %s :*** CONNECT: No server matching \002%s\002 could be found in the config file.",user->nick,parameters[0]);
2892 virtual int OnStats(char statschar, userrec* user)
2894 if (statschar == 'c')
2896 for (unsigned int i = 0; i < LinkBlocks.size(); i++)
2898 WriteServ(user->fd,"213 %s C *@%s * %s %d 0 %c%c%c",user->nick,(LinkBlocks[i].HiddenFromStats ? "<hidden>" : LinkBlocks[i].IPAddr).c_str(),LinkBlocks[i].Name.c_str(),LinkBlocks[i].Port,(LinkBlocks[i].EncryptionKey != "" ? 'e' : '-'),(LinkBlocks[i].AutoConnect ? 'a' : '-'),'s');
2899 WriteServ(user->fd,"244 %s H * * %s",user->nick,LinkBlocks[i].Name.c_str());
2901 WriteServ(user->fd,"219 %s %c :End of /STATS report",user->nick,statschar);
2902 WriteOpers("*** Notice: Stats '%c' requested by %s (%s@%s)",statschar,user->nick,user->ident,user->host);
2908 virtual int OnPreCommand(std::string command, char **parameters, int pcnt, userrec *user, bool validated)
2910 /* If the command doesnt appear to be valid, we dont want to mess with it. */
2914 if (command == "CONNECT")
2916 return this->HandleConnect(parameters,pcnt,user);
2918 else if (command == "SQUIT")
2920 return this->HandleSquit(parameters,pcnt,user);
2922 else if (command == "MAP")
2924 this->HandleMap(parameters,pcnt,user);
2927 else if (command == "LUSERS")
2929 this->HandleLusers(parameters,pcnt,user);
2932 else if (command == "LINKS")
2934 this->HandleLinks(parameters,pcnt,user);
2937 else if (command == "WHOIS")
2942 return this->HandleRemoteWhois(parameters,pcnt,user);
2945 else if ((command == "VERSION") && (pcnt > 0))
2947 this->HandleVersion(parameters,pcnt,user);
2950 else if (Srv->IsValidModuleCommand(command, pcnt, user))
2952 // this bit of code cleverly routes all module commands
2953 // to all remote severs *automatically* so that modules
2954 // can just handle commands locally, without having
2955 // to have any special provision in place for remote
2956 // commands and linking protocols.
2957 std::deque<std::string> params;
2959 for (int j = 0; j < pcnt; j++)
2961 if (strchr(parameters[j],' '))
2963 params.push_back(":" + std::string(parameters[j]));
2967 params.push_back(std::string(parameters[j]));
2970 log(DEBUG,"Globally route '%s'",command.c_str());
2971 DoOneToMany(user->nick,command,params);
2976 virtual void OnGetServerDescription(std::string servername,std::string &description)
2978 TreeServer* s = FindServer(servername);
2981 description = s->GetDesc();
2985 virtual void OnUserInvite(userrec* source,userrec* dest,chanrec* channel)
2987 if (source->fd > -1)
2989 std::deque<std::string> params;
2990 params.push_back(dest->nick);
2991 params.push_back(channel->name);
2992 DoOneToMany(source->nick,"INVITE",params);
2996 virtual void OnPostLocalTopicChange(userrec* user, chanrec* chan, std::string topic)
2998 std::deque<std::string> params;
2999 params.push_back(chan->name);
3000 params.push_back(":"+topic);
3001 DoOneToMany(user->nick,"TOPIC",params);
3004 virtual void OnWallops(userrec* user, std::string text)
3008 std::deque<std::string> params;
3009 params.push_back(":"+text);
3010 DoOneToMany(user->nick,"WALLOPS",params);
3014 virtual void OnUserNotice(userrec* user, void* dest, int target_type, std::string text, char status)
3016 if (target_type == TYPE_USER)
3018 userrec* d = (userrec*)dest;
3019 if ((d->fd < 0) && (user->fd > -1))
3021 std::deque<std::string> params;
3023 params.push_back(d->nick);
3024 params.push_back(":"+text);
3025 DoOneToOne(user->nick,"NOTICE",params,d->server);
3032 chanrec *c = (chanrec*)dest;
3033 std::string cname = c->name;
3035 cname = status + cname;
3036 std::deque<TreeServer*> list;
3037 GetListOfServersForChannel(c,list);
3038 unsigned int ucount = list.size();
3039 for (unsigned int i = 0; i < ucount; i++)
3041 TreeSocket* Sock = list[i]->GetSocket();
3043 Sock->WriteLine(":"+std::string(user->nick)+" NOTICE "+cname+" :"+text);
3049 virtual void OnUserMessage(userrec* user, void* dest, int target_type, std::string text, char status)
3051 if (target_type == TYPE_USER)
3053 // route private messages which are targetted at clients only to the server
3054 // which needs to receive them
3055 userrec* d = (userrec*)dest;
3056 if ((d->fd < 0) && (user->fd > -1))
3058 std::deque<std::string> params;
3060 params.push_back(d->nick);
3061 params.push_back(":"+text);
3062 DoOneToOne(user->nick,"PRIVMSG",params,d->server);
3069 chanrec *c = (chanrec*)dest;
3070 std::string cname = c->name;
3072 cname = status + cname;
3073 std::deque<TreeServer*> list;
3074 GetListOfServersForChannel(c,list);
3075 unsigned int ucount = list.size();
3076 for (unsigned int i = 0; i < ucount; i++)
3078 TreeSocket* Sock = list[i]->GetSocket();
3080 Sock->WriteLine(":"+std::string(user->nick)+" PRIVMSG "+cname+" :"+text);
3086 virtual void OnBackgroundTimer(time_t curtime)
3088 AutoConnectServers(curtime);
3089 DoPingChecks(curtime);
3092 virtual void OnUserJoin(userrec* user, chanrec* channel)
3094 // Only do this for local users
3097 std::deque<std::string> params;
3099 params.push_back(channel->name);
3102 // if the channel has a key, force the join by emulating the key.
3103 params.push_back(channel->key);
3105 if (channel->GetUserCounter() > 1)
3107 // not the first in the channel
3108 DoOneToMany(user->nick,"JOIN",params);
3112 // first in the channel, set up their permissions
3113 // and the channel TS with FJOIN.
3115 snprintf(ts,24,"%lu",(unsigned long)channel->age);
3117 params.push_back(channel->name);
3118 params.push_back(ts);
3119 params.push_back("@"+std::string(user->nick));
3120 DoOneToMany(Srv->GetServerName(),"FJOIN",params);
3125 virtual void OnChangeHost(userrec* user, std::string newhost)
3127 // only occurs for local clients
3128 if (user->registered != 7)
3130 std::deque<std::string> params;
3131 params.push_back(newhost);
3132 DoOneToMany(user->nick,"FHOST",params);
3135 virtual void OnChangeName(userrec* user, std::string gecos)
3137 // only occurs for local clients
3138 if (user->registered != 7)
3140 std::deque<std::string> params;
3141 params.push_back(gecos);
3142 DoOneToMany(user->nick,"FNAME",params);
3145 virtual void OnUserPart(userrec* user, chanrec* channel, std::string partmessage)
3149 std::deque<std::string> params;
3150 params.push_back(channel->name);
3151 if (partmessage != "")
3152 params.push_back(":"+partmessage);
3153 DoOneToMany(user->nick,"PART",params);
3157 virtual void OnUserConnect(userrec* user)
3159 char agestr[MAXBUF];
3162 std::deque<std::string> params;
3163 snprintf(agestr,MAXBUF,"%lu",(unsigned long)user->age);
3164 params.push_back(agestr);
3165 params.push_back(user->nick);
3166 params.push_back(user->host);
3167 params.push_back(user->dhost);
3168 params.push_back(user->ident);
3169 params.push_back("+"+std::string(user->modes));
3170 params.push_back((char*)inet_ntoa(user->ip4));
3171 params.push_back(":"+std::string(user->fullname));
3172 DoOneToMany(Srv->GetServerName(),"NICK",params);
3174 // User is Local, change needs to be reflected!
3175 TreeServer* SourceServer = FindServer(user->server);
3177 SourceServer->AddUserCount();
3183 virtual void OnUserQuit(userrec* user, std::string reason)
3185 if ((user->fd > -1) && (user->registered == 7))
3187 std::deque<std::string> params;
3188 params.push_back(":"+reason);
3189 DoOneToMany(user->nick,"QUIT",params);
3191 // Regardless, We need to modify the user Counts..
3192 TreeServer* SourceServer = FindServer(user->server);
3194 SourceServer->DelUserCount();
3199 virtual void OnUserPostNick(userrec* user, std::string oldnick)
3203 std::deque<std::string> params;
3204 params.push_back(user->nick);
3205 DoOneToMany(oldnick,"NICK",params);
3209 virtual void OnUserKick(userrec* source, userrec* user, chanrec* chan, std::string reason)
3211 if ((source) && (source->fd > -1))
3213 std::deque<std::string> params;
3214 params.push_back(chan->name);
3215 params.push_back(user->nick);
3216 params.push_back(":"+reason);
3217 DoOneToMany(source->nick,"KICK",params);
3221 virtual void OnRemoteKill(userrec* source, userrec* dest, std::string reason)
3223 std::deque<std::string> params;
3224 params.push_back(dest->nick);
3225 params.push_back(":"+reason);
3226 DoOneToMany(source->nick,"KILL",params);
3229 virtual void OnRehash(std::string parameter)
3231 if (parameter != "")
3233 std::deque<std::string> params;
3234 params.push_back(parameter);
3235 DoOneToMany(Srv->GetServerName(),"REHASH",params);
3237 if (Srv->MatchText(Srv->GetServerName(),parameter))
3239 Srv->SendOpers("*** Remote rehash initiated from server \002"+Srv->GetServerName()+"\002.");
3240 Srv->RehashServer();
3243 ReadConfiguration(false);
3246 // note: the protocol does not allow direct umode +o except
3247 // via NICK with 8 params. sending OPERTYPE infers +o modechange
3249 virtual void OnOper(userrec* user, std::string opertype)
3253 std::deque<std::string> params;
3254 params.push_back(opertype);
3255 DoOneToMany(user->nick,"OPERTYPE",params);
3259 void OnLine(userrec* source, std::string host, bool adding, char linetype, long duration, std::string reason)
3261 if (source->fd > -1)
3264 snprintf(type,8,"%cLINE",linetype);
3265 std::string stype = type;
3268 char sduration[MAXBUF];
3269 snprintf(sduration,MAXBUF,"%ld",duration);
3270 std::deque<std::string> params;
3271 params.push_back(host);
3272 params.push_back(sduration);
3273 params.push_back(":"+reason);
3274 DoOneToMany(source->nick,stype,params);
3278 std::deque<std::string> params;
3279 params.push_back(host);
3280 DoOneToMany(source->nick,stype,params);
3285 virtual void OnAddGLine(long duration, userrec* source, std::string reason, std::string hostmask)
3287 OnLine(source,hostmask,true,'G',duration,reason);
3290 virtual void OnAddZLine(long duration, userrec* source, std::string reason, std::string ipmask)
3292 OnLine(source,ipmask,true,'Z',duration,reason);
3295 virtual void OnAddQLine(long duration, userrec* source, std::string reason, std::string nickmask)
3297 OnLine(source,nickmask,true,'Q',duration,reason);
3300 virtual void OnAddELine(long duration, userrec* source, std::string reason, std::string hostmask)
3302 OnLine(source,hostmask,true,'E',duration,reason);
3305 virtual void OnDelGLine(userrec* source, std::string hostmask)
3307 OnLine(source,hostmask,false,'G',0,"");
3310 virtual void OnDelZLine(userrec* source, std::string ipmask)
3312 OnLine(source,ipmask,false,'Z',0,"");
3315 virtual void OnDelQLine(userrec* source, std::string nickmask)
3317 OnLine(source,nickmask,false,'Q',0,"");
3320 virtual void OnDelELine(userrec* source, std::string hostmask)
3322 OnLine(source,hostmask,false,'E',0,"");
3325 virtual void OnMode(userrec* user, void* dest, int target_type, std::string text)
3327 if ((user->fd > -1) && (user->registered == 7))
3329 if (target_type == TYPE_USER)
3331 userrec* u = (userrec*)dest;
3332 std::deque<std::string> params;
3333 params.push_back(u->nick);
3334 params.push_back(text);
3335 DoOneToMany(user->nick,"MODE",params);
3339 chanrec* c = (chanrec*)dest;
3340 std::deque<std::string> params;
3341 params.push_back(c->name);
3342 params.push_back(text);
3343 DoOneToMany(user->nick,"MODE",params);
3348 virtual void OnSetAway(userrec* user)
3352 std::deque<std::string> params;
3353 params.push_back(":"+std::string(user->awaymsg));
3354 DoOneToMany(user->nick,"AWAY",params);
3358 virtual void OnCancelAway(userrec* user)
3362 std::deque<std::string> params;
3364 DoOneToMany(user->nick,"AWAY",params);
3368 virtual void ProtoSendMode(void* opaque, int target_type, void* target, std::string modeline)
3370 TreeSocket* s = (TreeSocket*)opaque;
3373 if (target_type == TYPE_USER)
3375 userrec* u = (userrec*)target;
3376 s->WriteLine(":"+Srv->GetServerName()+" FMODE "+u->nick+" "+modeline);
3380 chanrec* c = (chanrec*)target;
3381 s->WriteLine(":"+Srv->GetServerName()+" FMODE "+c->name+" "+modeline);
3386 virtual void ProtoSendMetaData(void* opaque, int target_type, void* target, std::string extname, std::string extdata)
3388 TreeSocket* s = (TreeSocket*)opaque;
3391 if (target_type == TYPE_USER)
3393 userrec* u = (userrec*)target;
3394 s->WriteLine(":"+Srv->GetServerName()+" METADATA "+u->nick+" "+extname+" :"+extdata);
3396 else if (target_type == TYPE_OTHER)
3398 s->WriteLine(":"+Srv->GetServerName()+" METADATA * "+extname+" :"+extdata);
3400 else if (target_type == TYPE_CHANNEL)
3402 chanrec* c = (chanrec*)target;
3403 s->WriteLine(":"+Srv->GetServerName()+" METADATA "+c->name+" "+extname+" :"+extdata);
3408 virtual void OnEvent(Event* event)
3410 if (event->GetEventID() == "send_metadata")
3412 std::deque<std::string>* params = (std::deque<std::string>*)event->GetData();
3413 if (params->size() < 3)
3415 (*params)[2] = ":" + (*params)[2];
3416 DoOneToMany(Srv->GetServerName(),"METADATA",*params);
3420 virtual ~ModuleSpanningTree()
3424 virtual Version GetVersion()
3426 return Version(1,0,0,0,VF_STATIC|VF_VENDOR);
3429 void Implements(char* List)
3431 List[I_OnPreCommand] = List[I_OnGetServerDescription] = List[I_OnUserInvite] = List[I_OnPostLocalTopicChange] = 1;
3432 List[I_OnWallops] = List[I_OnUserNotice] = List[I_OnUserMessage] = List[I_OnBackgroundTimer] = 1;
3433 List[I_OnUserJoin] = List[I_OnChangeHost] = List[I_OnChangeName] = List[I_OnUserPart] = List[I_OnUserConnect] = 1;
3434 List[I_OnUserQuit] = List[I_OnUserPostNick] = List[I_OnUserKick] = List[I_OnRemoteKill] = List[I_OnRehash] = 1;
3435 List[I_OnOper] = List[I_OnAddGLine] = List[I_OnAddZLine] = List[I_OnAddQLine] = List[I_OnAddELine] = 1;
3436 List[I_OnDelGLine] = List[I_OnDelZLine] = List[I_OnDelQLine] = List[I_OnDelELine] = List[I_ProtoSendMode] = List[I_OnMode] = 1;
3437 List[I_OnStats] = List[I_ProtoSendMetaData] = List[I_OnEvent] = List[I_OnSetAway] = List[I_OnCancelAway] = 1;
3440 /* It is IMPORTANT that m_spanningtree is the last module in the chain
3441 * so that any activity it sees is FINAL, e.g. we arent going to send out
3442 * a NICK message before m_cloaking has finished putting the +x on the user,
3444 * Therefore, we return PRIORITY_LAST to make sure we end up at the END of
3445 * the module call queue.
3447 Priority Prioritize()
3449 return PRIORITY_LAST;
3454 class ModuleSpanningTreeFactory : public ModuleFactory
3457 ModuleSpanningTreeFactory()
3461 ~ModuleSpanningTreeFactory()
3465 virtual Module * CreateModule(Server* Me)
3467 TreeProtocolModule = new ModuleSpanningTree(Me);
3468 return TreeProtocolModule;
3474 extern "C" void * init_module( void )
3476 return new ModuleSpanningTreeFactory;