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 /* Imported from xline.cpp for use during netburst */
128 extern std::vector<KLine> klines;
129 extern std::vector<GLine> glines;
130 extern std::vector<ZLine> zlines;
131 extern std::vector<QLine> qlines;
132 extern std::vector<ELine> elines;
133 extern std::vector<KLine> pklines;
134 extern std::vector<GLine> pglines;
135 extern std::vector<ZLine> pzlines;
136 extern std::vector<QLine> pqlines;
137 extern std::vector<ELine> pelines;
139 /* Each server in the tree is represented by one class of
140 * type TreeServer. A locally connected TreeServer can
141 * have a class of type TreeSocket associated with it, for
142 * remote servers, the TreeSocket entry will be NULL.
143 * Each server also maintains a pointer to its parent
144 * (NULL if this server is ours, at the top of the tree)
145 * and a pointer to its "Route" (see the comments in the
146 * constructors below), and also a dynamic list of pointers
147 * to its children which can be iterated recursively
148 * if required. Creating or deleting objects of type
149 * TreeServer automatically maintains the hash_map of
150 * TreeServer items, deleting and inserting them as they
151 * are created and destroyed.
156 TreeServer* Parent; /* Parent entry */
157 TreeServer* Route; /* Route entry */
158 std::vector<TreeServer*> Children; /* List of child objects */
159 std::string ServerName; /* Server's name */
160 std::string ServerDesc; /* Server's description */
161 std::string VersionString; /* Version string or empty string */
162 int UserCount; /* Not used in this version */
163 int OperCount; /* Not used in this version */
164 TreeSocket* Socket; /* For directly connected servers this points at the socket object */
165 time_t NextPing; /* After this time, the server should be PINGed*/
166 bool LastPingWasGood; /* True if the server responded to the last PING with a PONG */
170 /* We don't use this constructor. Its a dummy, and won't cause any insertion
171 * of the TreeServer into the hash_map. See below for the two we DO use.
179 UserCount = OperCount = 0;
180 VersionString = Srv->GetVersion();
183 /* We use this constructor only to create the 'root' item, TreeRoot, which
184 * represents our own server. Therefore, it has no route, no parent, and
185 * no socket associated with it. Its version string is our own local version.
187 TreeServer(std::string Name, std::string Desc) : ServerName(Name), ServerDesc(Desc)
191 UserCount = OperCount = 0;
192 VersionString = Srv->GetVersion();
194 Socket = NULL; /* Fix by brain */
198 /* When we create a new server, we call this constructor to initialize it.
199 * This constructor initializes the server's Route and Parent, and sets up
200 * its ping counters so that it will be pinged one minute from now.
202 TreeServer(std::string Name, std::string Desc, TreeServer* Above, TreeSocket* Sock) : Parent(Above), ServerName(Name), ServerDesc(Desc), Socket(Sock)
205 UserCount = OperCount = 0;
206 this->SetNextPingTime(time(NULL) + 120);
209 /* find the 'route' for this server (e.g. the one directly connected
210 * to the local server, which we can use to reach it)
212 * In the following example, consider we have just added a TreeServer
213 * class for server G on our network, of which we are server A.
214 * To route traffic to G (marked with a *) we must send the data to
215 * B (marked with a +) so this algorithm initializes the 'Route'
216 * value to point at whichever server traffic must be routed through
217 * to get here. If we were to try this algorithm with server B,
218 * the Route pointer would point at its own object ('this').
228 * We only run this algorithm when a server is created, as
229 * the routes remain constant while ever the server exists, and
230 * do not need to be re-calculated.
234 if (Route == TreeRoot)
240 while (this->Route->GetParent() != TreeRoot)
242 this->Route = Route->GetParent();
246 /* Because recursive code is slow and takes a lot of resources,
247 * we store two representations of the server tree. The first
248 * is a recursive structure where each server references its
249 * children and its parent, which is used for netbursts and
250 * netsplits to dump the whole dataset to the other server,
251 * and the second is used for very fast lookups when routing
252 * messages and is instead a hash_map, where each item can
253 * be referenced by its server name. The AddHashEntry()
254 * call below automatically inserts each TreeServer class
255 * into the hash_map as it is created. There is a similar
256 * maintainance call in the destructor to tidy up deleted
260 this->AddHashEntry();
263 /* This method is used to add the structure to the
264 * hash_map for linear searches. It is only called
265 * by the constructors.
269 server_hash::iterator iter;
270 iter = serverlist.find(this->ServerName);
271 if (iter == serverlist.end())
272 serverlist[this->ServerName] = this;
275 /* This method removes the reference to this object
276 * from the hash_map which is used for linear searches.
277 * It is only called by the default destructor.
281 server_hash::iterator iter;
282 iter = serverlist.find(this->ServerName);
283 if (iter != serverlist.end())
284 serverlist.erase(iter);
287 /* These accessors etc should be pretty self-
291 TreeServer* GetRoute()
296 std::string GetName()
301 std::string GetDesc()
306 std::string GetVersion()
308 return VersionString;
311 void SetNextPingTime(time_t t)
314 LastPingWasGood = false;
317 time_t NextPingTime()
322 bool AnsweredLastPing()
324 return LastPingWasGood;
329 LastPingWasGood = true;
352 TreeSocket* GetSocket()
357 TreeServer* GetParent()
362 void SetVersion(std::string Version)
364 VersionString = Version;
367 unsigned int ChildCount()
369 return Children.size();
372 TreeServer* GetChild(unsigned int n)
374 if (n < Children.size())
376 /* Make sure they cant request
377 * an out-of-range object. After
378 * all we know what these programmer
379 * types are like *grin*.
389 void AddChild(TreeServer* Child)
391 Children.push_back(Child);
394 bool DelChild(TreeServer* Child)
396 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
407 /* Removes child nodes of this node, and of that node, etc etc.
408 * This is used during netsplits to automatically tidy up the
409 * server tree. It is slow, we don't use it for much else.
413 bool stillchildren = true;
414 while (stillchildren)
416 stillchildren = false;
417 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
419 TreeServer* s = (TreeServer*)*a;
423 stillchildren = true;
432 /* We'd better tidy up after ourselves, eh? */
433 this->DelHashEntry();
437 /* The Link class might as well be a struct,
438 * but this is C++ and we don't believe in structs (!).
439 * It holds the entire information of one <link>
440 * tag from the main config file. We maintain a list
441 * of them, and populate the list on rehash/load.
450 std::string SendPass;
451 std::string RecvPass;
452 unsigned long AutoConnect;
453 time_t NextConnectTime;
454 std::string EncryptionKey;
455 bool HiddenFromStats;
458 /* The usual stuff for inspircd modules,
459 * plus the vector of Link classes which we
460 * use to store the <link> tags from the config
464 std::vector<Link> LinkBlocks;
466 /* Yay for fast searches!
467 * This is hundreds of times faster than recursion
468 * or even scanning a linked list, especially when
469 * there are more than a few servers to deal with.
472 TreeServer* FindServer(std::string ServerName)
474 server_hash::iterator iter;
475 iter = serverlist.find(ServerName);
476 if (iter != serverlist.end())
486 /* Returns the locally connected server we must route a
487 * message through to reach server 'ServerName'. This
488 * only applies to one-to-one and not one-to-many routing.
489 * See the comments for the constructor of TreeServer
492 TreeServer* BestRouteTo(std::string ServerName)
494 if (ServerName.c_str() == TreeRoot->GetName())
496 TreeServer* Found = FindServer(ServerName);
499 return Found->GetRoute();
507 /* Find the first server matching a given glob mask.
508 * Theres no find-using-glob method of hash_map [awwww :-(]
509 * so instead, we iterate over the list using an iterator
510 * and match each one until we get a hit. Yes its slow,
513 TreeServer* FindServerMask(std::string ServerName)
515 for (server_hash::iterator i = serverlist.begin(); i != serverlist.end(); i++)
517 if (Srv->MatchText(i->first,ServerName))
523 /* A convenient wrapper that returns true if a server exists */
524 bool IsServer(std::string ServerName)
526 return (FindServer(ServerName) != NULL);
529 /* Every SERVER connection inbound or outbound is represented by
530 * an object of type TreeSocket.
531 * TreeSockets, being inherited from InspSocket, can be tied into
532 * the core socket engine, and we cn therefore receive activity events
533 * for them, just like activex objects on speed. (yes really, that
534 * is a technical term!) Each of these which relates to a locally
535 * connected server is assocated with it, by hooking it onto a
536 * TreeSocket class using its constructor. In this way, we can
537 * maintain a list of servers, some of which are directly connected,
538 * some of which are not.
541 class TreeSocket : public InspSocket
544 std::string in_buffer;
545 ServerState LinkState;
546 std::string InboundServerName;
547 std::string InboundDescription;
549 int num_lost_servers;
551 bool LastPingWasGood;
555 unsigned int keylength;
559 /* Because most of the I/O gubbins are encapsulated within
560 * InspSocket, we just call the superclass constructor for
561 * most of the action, and append a few of our own values
564 TreeSocket(std::string host, int port, bool listening, unsigned long maxtime)
565 : InspSocket(host, port, listening, maxtime)
568 this->LinkState = LISTENER;
570 this->ctx_out = NULL;
573 TreeSocket(std::string host, int port, bool listening, unsigned long maxtime, std::string ServerName)
574 : InspSocket(host, port, listening, maxtime)
577 this->LinkState = CONNECTING;
579 this->ctx_out = NULL;
582 /* When a listening socket gives us a new file descriptor,
583 * we must associate it with a socket without creating a new
584 * connection. This constructor is used for this purpose.
586 TreeSocket(int newfd, char* ip)
587 : InspSocket(newfd, ip)
589 this->LinkState = WAIT_AUTH_1;
591 this->ctx_out = NULL;
592 this->SendCapabilities();
603 void InitAES(std::string key,std::string SName)
610 log(DEBUG,"Initialized AES key %s",key.c_str());
611 // key must be 16, 24, 32 etc bytes (multiple of 8)
612 keylength = key.length();
613 if (!(keylength == 16 || keylength == 24 || keylength == 32))
615 WriteOpers("*** \2ERROR\2: Key length for encryptionkey is not 16, 24 or 32 bytes in length!");
616 log(DEBUG,"Key length not 16, 24 or 32 characters!");
620 WriteOpers("*** \2AES\2: Initialized %d bit encryption to server %s",keylength*8,SName.c_str());
621 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\
622 \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);
623 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\
624 \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);
628 /* When an outbound connection finishes connecting, we receive
629 * this event, and must send our SERVER string to the other
630 * side. If the other side is happy, as outlined in the server
631 * to server docs on the inspircd.org site, the other side
632 * will then send back its own server string.
634 virtual bool OnConnected()
636 if (this->LinkState == CONNECTING)
638 Srv->SendOpers("*** Connection to "+myhost+"["+this->GetIP()+"] established.");
639 /* we do not need to change state here. */
640 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
642 if (x->Name == this->myhost)
644 this->SendCapabilities();
645 if (x->EncryptionKey != "")
647 if (!(x->EncryptionKey.length() == 16 || x->EncryptionKey.length() == 24 || x->EncryptionKey.length() == 32))
649 WriteOpers("\2WARNING\2: Your encryption key is NOT 16, 24 or 32 characters in length, encryption will \2NOT\2 be enabled.");
653 this->WriteLine("AES "+Srv->GetServerName());
654 this->InitAES(x->EncryptionKey,x->Name);
657 /* found who we're supposed to be connecting to, send the neccessary gubbins. */
658 this->WriteLine("SERVER "+Srv->GetServerName()+" "+x->SendPass+" 0 :"+Srv->GetServerDescription());
663 /* There is a (remote) chance that between the /CONNECT and the connection
664 * being accepted, some muppet has removed the <link> block and rehashed.
665 * If that happens the connection hangs here until it's closed. Unlikely
666 * and rather harmless.
671 virtual void OnError(InspSocketError e)
673 /* We don't handle this method, because all our
674 * dirty work is done in OnClose() (see below)
675 * which is still called on error conditions too.
679 virtual int OnDisconnect()
681 /* For the same reason as above, we don't
682 * handle OnDisconnect()
687 /* Recursively send the server tree with distances as hops.
688 * This is used during network burst to inform the other server
689 * (and any of ITS servers too) of what servers we know about.
690 * If at any point any of these servers already exist on the other
691 * end, our connection may be terminated. The hopcounts given
692 * by this function are relative, this doesn't matter so long as
693 * they are all >1, as all the remote servers re-calculate them
694 * to be relative too, with themselves as hop 0.
696 void SendServers(TreeServer* Current, TreeServer* s, int hops)
699 for (unsigned int q = 0; q < Current->ChildCount(); q++)
701 TreeServer* recursive_server = Current->GetChild(q);
702 if (recursive_server != s)
704 snprintf(command,1024,":%s SERVER %s * %d :%s",Current->GetName().c_str(),recursive_server->GetName().c_str(),hops,recursive_server->GetDesc().c_str());
705 this->WriteLine(command);
706 this->WriteLine(":"+recursive_server->GetName()+" VERSION :"+recursive_server->GetVersion());
707 /* down to next level */
708 this->SendServers(recursive_server, s, hops+1);
713 std::string MyCapabilities()
715 ServerConfig* Config = Srv->GetConfig();
716 std::vector<std::string> modlist;
717 std::string capabilities = "";
719 for (int i = 0; i <= MODCOUNT; i++)
721 if ((modules[i]->GetVersion().Flags & VF_STATIC) || (modules[i]->GetVersion().Flags & VF_COMMON))
722 modlist.push_back(Config->module_names[i]);
724 sort(modlist.begin(),modlist.end());
725 for (unsigned int i = 0; i < modlist.size(); i++)
728 capabilities = capabilities + ",";
729 capabilities = capabilities + modlist[i];
734 void SendCapabilities()
736 this->WriteLine("CAPAB "+MyCapabilities());
739 bool Capab(std::deque<std::string> params)
741 if (params.size() != 1)
743 this->WriteLine("ERROR :Invalid number of parameters for CAPAB");
746 if (params[0] != this->MyCapabilities())
748 std::string quitserver = this->myhost;
749 if (this->InboundServerName != "")
751 quitserver = this->InboundServerName;
753 WriteOpers("*** \2ERROR\2: Server '%s' does not have the same set of modules loaded, cannot link!",quitserver.c_str());
754 WriteOpers("*** Our networked module set is: '%s'",this->MyCapabilities().c_str());
755 WriteOpers("*** Other server's networked module set is: '%s'",params[0].c_str());
756 WriteOpers("*** These lists must match exactly on both servers. Please correct these errors, and try again.");
757 this->WriteLine("ERROR :CAPAB mismatch; My capabilities: '"+this->MyCapabilities()+"'");
763 /* This function forces this server to quit, removing this server
764 * and any users on it (and servers and users below that, etc etc).
765 * It's very slow and pretty clunky, but luckily unless your network
766 * is having a REAL bad hair day, this function shouldnt be called
767 * too many times a month ;-)
769 void SquitServer(TreeServer* Current, CullList* Goners)
771 /* recursively squit the servers attached to 'Current'.
772 * We're going backwards so we don't remove users
773 * while we still need them ;)
775 for (unsigned int q = 0; q < Current->ChildCount(); q++)
777 TreeServer* recursive_server = Current->GetChild(q);
778 this->SquitServer(recursive_server,Goners);
780 /* Now we've whacked the kids, whack self */
782 for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
784 if (!strcasecmp(u->second->server,Current->GetName().c_str()))
786 std::string qreason = Current->GetName()+" "+std::string(Srv->GetServerName());
787 Goners->AddItem(u->second,qreason);
793 /* This is a wrapper function for SquitServer above, which
794 * does some validation first and passes on the SQUIT to all
795 * other remaining servers.
797 void Squit(TreeServer* Current,std::string reason)
799 if ((Current) && (Current != TreeRoot))
801 std::deque<std::string> params;
802 params.push_back(Current->GetName());
803 params.push_back(":"+reason);
804 DoOneToAllButSender(Current->GetParent()->GetName(),"SQUIT",params,Current->GetName());
805 if (Current->GetParent() == TreeRoot)
807 Srv->SendOpers("Server \002"+Current->GetName()+"\002 split: "+reason);
811 Srv->SendOpers("Server \002"+Current->GetName()+"\002 split from server \002"+Current->GetParent()->GetName()+"\002 with reason: "+reason);
813 num_lost_servers = 0;
815 CullList* Goners = new CullList();
816 SquitServer(Current, Goners);
819 Current->GetParent()->DelChild(Current);
822 WriteOpers("Netsplit complete, lost \002%d\002 users on \002%d\002 servers.", num_lost_users, num_lost_servers);
826 log(DEFAULT,"Squit from unknown server");
831 bool ForceMode(std::string source, std::deque<std::string> params)
833 userrec* who = new userrec;
834 who->fd = FD_MAGIC_NUMBER;
835 if (params.size() < 2)
838 for (unsigned int q = 0; q < params.size(); q++)
840 modelist[q] = (char*)params[q].c_str();
842 Srv->SendMode(modelist,params.size(),who);
843 DoOneToAllButSender(source,"FMODE",params,source);
849 bool ForceTopic(std::string source, std::deque<std::string> params)
851 if (params.size() != 4)
853 std::string channel = params[0];
854 time_t ts = atoi(params[1].c_str());
855 std::string setby = params[2];
856 std::string topic = params[3];
858 chanrec* c = Srv->FindChannel(channel);
861 if ((ts >= c->topicset) || (!*c->topic))
863 std::string oldtopic = c->topic;
864 strlcpy(c->topic,topic.c_str(),MAXTOPIC);
865 strlcpy(c->setby,setby.c_str(),NICKMAX);
867 /* if the topic text is the same as the current topic,
868 * dont bother to send the TOPIC command out, just silently
869 * update the set time and set nick.
871 if (oldtopic != topic)
872 WriteChannelWithServ((char*)source.c_str(), c, "TOPIC %s :%s", c->name, c->topic);
877 /* all done, send it on its way */
878 params[3] = ":" + params[3];
879 DoOneToAllButSender(source,"FTOPIC",params,source);
884 /* FJOIN, similar to unreal SJOIN */
885 bool ForceJoin(std::string source, std::deque<std::string> params)
887 if (params.size() < 3)
891 char modestring[MAXBUF];
892 char* mode_users[127];
893 mode_users[0] = first;
894 mode_users[1] = modestring;
895 strcpy(mode_users[1],"+");
896 unsigned int modectr = 2;
899 std::string channel = params[0];
900 time_t TS = atoi(params[1].c_str());
903 chanrec* chan = Srv->FindChannel(channel);
908 strlcpy(mode_users[0],channel.c_str(),MAXBUF);
910 /* default is a high value, which if we dont have this
911 * channel will let the other side apply their modes.
913 time_t ourTS = time(NULL)+600;
914 chanrec* us = Srv->FindChannel(channel);
920 log(DEBUG,"FJOIN detected, our TS=%lu, their TS=%lu",ourTS,TS);
922 /* do this first, so our mode reversals are correctly received by other servers
923 * if there is a TS collision.
925 DoOneToAllButSender(source,"FJOIN",params,source);
927 for (unsigned int usernum = 2; usernum < params.size(); usernum++)
929 /* process one channel at a time, applying modes. */
930 char* usr = (char*)params[usernum].c_str();
931 /* Safety check just to make sure someones not sent us an FJOIN full of spaces
932 * (is this even possible?) */
935 char permissions = *usr;
940 mode_users[modectr++] = usr;
941 strlcat(modestring,"o",MAXBUF);
945 mode_users[modectr++] = usr;
946 strlcat(modestring,"h",MAXBUF);
950 mode_users[modectr++] = usr;
951 strlcat(modestring,"v",MAXBUF);
954 who = Srv->FindNick(usr);
957 Srv->JoinUserToChannel(who,channel,key);
958 if (modectr >= (MAXMODES-1))
960 /* theres a mode for this user. push them onto the mode queue, and flush it
961 * if there are more than MAXMODES to go.
963 if ((ourTS >= TS) || (Srv->IsUlined(who->server)))
965 /* We also always let u-lined clients win, no matter what the TS value */
966 log(DEBUG,"Our our channel newer than theirs, accepting their modes");
967 Srv->SendMode(mode_users,modectr,who);
971 log(DEBUG,"Their channel newer than ours, bouncing their modes");
973 std::deque<std::string> params;
974 /* modes are now being UNSET... */
975 *mode_users[1] = '-';
976 for (unsigned int x = 0; x < modectr; x++)
978 params.push_back(mode_users[x]);
980 // tell everyone to bounce the modes. bad modes, bad!
981 DoOneToMany(Srv->GetServerName(),"FMODE",params);
983 strcpy(mode_users[1],"+");
989 /* there werent enough modes built up to flush it during FJOIN,
990 * or, there are a number left over. flush them out.
992 if ((modectr > 2) && (who))
996 log(DEBUG,"Our our channel newer than theirs, accepting their modes");
997 Srv->SendMode(mode_users,modectr,who);
1001 log(DEBUG,"Their channel newer than ours, bouncing their modes");
1002 std::deque<std::string> params;
1003 *mode_users[1] = '-';
1004 for (unsigned int x = 0; x < modectr; x++)
1006 params.push_back(mode_users[x]);
1008 DoOneToMany(Srv->GetServerName(),"FMODE",params);
1015 bool IntroduceClient(std::string source, std::deque<std::string> params)
1017 if (params.size() < 8)
1019 // NICK age nick host dhost ident +modes ip :gecos
1021 std::string nick = params[1];
1022 std::string host = params[2];
1023 std::string dhost = params[3];
1024 std::string ident = params[4];
1025 time_t age = atoi(params[0].c_str());
1026 std::string modes = params[5];
1027 while (*(modes.c_str()) == '+')
1029 char* m = (char*)modes.c_str();
1033 std::string ip = params[6];
1034 std::string gecos = params[7];
1035 char* tempnick = (char*)nick.c_str();
1036 log(DEBUG,"Introduce client %s!%s@%s",tempnick,ident.c_str(),host.c_str());
1038 user_hash::iterator iter;
1039 iter = clientlist.find(tempnick);
1040 if (iter != clientlist.end())
1043 log(DEBUG,"Nick collision on %s!%s@%s: %lu %lu",tempnick,ident.c_str(),host.c_str(),(unsigned long)age,(unsigned long)iter->second->age);
1044 this->WriteLine(":"+Srv->GetServerName()+" KILL "+tempnick+" :Nickname collision");
1048 clientlist[tempnick] = new userrec();
1049 clientlist[tempnick]->fd = FD_MAGIC_NUMBER;
1050 strlcpy(clientlist[tempnick]->nick, tempnick,NICKMAX);
1051 strlcpy(clientlist[tempnick]->host, host.c_str(),160);
1052 strlcpy(clientlist[tempnick]->dhost, dhost.c_str(),160);
1053 clientlist[tempnick]->server = (char*)FindServerNamePtr(source.c_str());
1054 strlcpy(clientlist[tempnick]->ident, ident.c_str(),IDENTMAX);
1055 strlcpy(clientlist[tempnick]->fullname, gecos.c_str(),MAXGECOS);
1056 clientlist[tempnick]->registered = 7;
1057 clientlist[tempnick]->signon = age;
1058 strlcpy(clientlist[tempnick]->modes, modes.c_str(),53);
1059 strlcpy(clientlist[tempnick]->ip,ip.c_str(),16);
1064 for (int i = 0; i < MAXCHANS; i++)
1065 clientlist[tempnick]->chans.push_back(a);
1067 if (!this->bursting)
1069 WriteOpers("*** Client connecting at %s: %s!%s@%s [%s]",clientlist[tempnick]->server,clientlist[tempnick]->nick,clientlist[tempnick]->ident,clientlist[tempnick]->host,clientlist[tempnick]->ip);
1071 params[7] = ":" + params[7];
1072 DoOneToAllButSender(source,"NICK",params,source);
1074 // Increment the Source Servers User Count..
1075 TreeServer* SourceServer = FindServer(source);
1077 SourceServer->AddUserCount();
1083 /* Send one or more FJOINs for a channel of users.
1084 * If the length of a single line is more than 480-NICKMAX
1085 * in length, it is split over multiple lines.
1087 void SendFJoins(TreeServer* Current, chanrec* c)
1089 log(DEBUG,"Sending FJOINs to other server for %s",c->name);
1091 snprintf(list,MAXBUF,":%s FJOIN %s %lu",Srv->GetServerName().c_str(),c->name,(unsigned long)c->age);
1092 std::map<char*,char*> *ulist = c->GetUsers();
1093 for (std::map<char*,char*>::iterator i = ulist->begin(); i != ulist->end(); i++)
1095 char* o = i->second;
1096 userrec* otheruser = (userrec*)o;
1097 strlcat(list," ",MAXBUF);
1098 strlcat(list,cmode(otheruser,c),MAXBUF);
1099 strlcat(list,otheruser->nick,MAXBUF);
1100 if (strlen(list)>(480-NICKMAX))
1102 log(DEBUG,"FJOIN line wrapped");
1103 this->WriteLine(list);
1104 snprintf(list,MAXBUF,":%s FJOIN %s %lu",Srv->GetServerName().c_str(),c->name,(unsigned long)c->age);
1107 if (list[strlen(list)-1] != ':')
1109 log(DEBUG,"Final FJOIN line");
1110 this->WriteLine(list);
1114 /* Send G, Q, Z and E lines */
1115 void SendXLines(TreeServer* Current)
1118 /* Yes, these arent too nice looking, but they get the job done */
1119 for (std::vector<ZLine>::iterator i = zlines.begin(); i != zlines.end(); i++)
1121 snprintf(data,MAXBUF,":%s ADDLINE Z %s %s %lu %lu :%s",Srv->GetServerName().c_str(),i->ipaddr,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1122 this->WriteLine(data);
1124 for (std::vector<QLine>::iterator i = qlines.begin(); i != qlines.end(); i++)
1126 snprintf(data,MAXBUF,":%s ADDLINE Q %s %s %lu %lu :%s",Srv->GetServerName().c_str(),i->nick,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1127 this->WriteLine(data);
1129 for (std::vector<GLine>::iterator i = glines.begin(); i != glines.end(); i++)
1131 snprintf(data,MAXBUF,":%s ADDLINE G %s %s %lu %lu :%s",Srv->GetServerName().c_str(),i->hostmask,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1132 this->WriteLine(data);
1134 for (std::vector<ELine>::iterator i = elines.begin(); i != elines.end(); i++)
1136 snprintf(data,MAXBUF,":%s ADDLINE E %s %s %lu %lu :%s",Srv->GetServerName().c_str(),i->hostmask,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1137 this->WriteLine(data);
1139 for (std::vector<ZLine>::iterator i = pzlines.begin(); i != pzlines.end(); i++)
1141 snprintf(data,MAXBUF,":%s ADDLINE Z %s %s %lu %lu :%s",Srv->GetServerName().c_str(),i->ipaddr,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1142 this->WriteLine(data);
1144 for (std::vector<QLine>::iterator i = pqlines.begin(); i != pqlines.end(); i++)
1146 snprintf(data,MAXBUF,":%s ADDLINE Q %s %s %lu %lu :%s",Srv->GetServerName().c_str(),i->nick,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1147 this->WriteLine(data);
1149 for (std::vector<GLine>::iterator i = pglines.begin(); i != pglines.end(); i++)
1151 snprintf(data,MAXBUF,":%s ADDLINE G %s %s %lu %lu :%s",Srv->GetServerName().c_str(),i->hostmask,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1152 this->WriteLine(data);
1154 for (std::vector<ELine>::iterator i = pelines.begin(); i != pelines.end(); i++)
1156 snprintf(data,MAXBUF,":%s ADDLINE E %s %s %lu %lu :%s",Srv->GetServerName().c_str(),i->hostmask,i->source,(unsigned long)i->set_time,(unsigned long)i->duration,i->reason);
1157 this->WriteLine(data);
1161 /* Send channel modes and topics */
1162 void SendChannelModes(TreeServer* Current)
1165 std::deque<std::string> list;
1166 for (chan_hash::iterator c = chanlist.begin(); c != chanlist.end(); c++)
1168 SendFJoins(Current, c->second);
1169 snprintf(data,MAXBUF,":%s FMODE %s +%s",Srv->GetServerName().c_str(),c->second->name,chanmodes(c->second));
1170 this->WriteLine(data);
1171 if (*c->second->topic)
1173 snprintf(data,MAXBUF,":%s FTOPIC %s %lu %s :%s",Srv->GetServerName().c_str(),c->second->name,(unsigned long)c->second->topicset,c->second->setby,c->second->topic);
1174 this->WriteLine(data);
1176 for (BanList::iterator b = c->second->bans.begin(); b != c->second->bans.end(); b++)
1178 snprintf(data,MAXBUF,":%s FMODE %s +b %s",Srv->GetServerName().c_str(),c->second->name,b->data);
1179 this->WriteLine(data);
1181 FOREACH_MOD(I_OnSyncChannel,OnSyncChannel(c->second,(Module*)TreeProtocolModule,(void*)this));
1183 c->second->GetExtList(list);
1184 for (unsigned int j = 0; j < list.size(); j++)
1186 FOREACH_MOD(I_OnSyncChannelMetaData,OnSyncChannelMetaData(c->second,(Module*)TreeProtocolModule,(void*)this,list[j]));
1191 /* send all users and their oper state/modes */
1192 void SendUsers(TreeServer* Current)
1195 std::deque<std::string> list;
1196 for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
1198 if (u->second->registered == 7)
1200 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,u->second->ip,u->second->fullname);
1201 this->WriteLine(data);
1202 if (strchr(u->second->modes,'o'))
1204 this->WriteLine(":"+std::string(u->second->nick)+" OPERTYPE "+std::string(u->second->oper));
1206 FOREACH_MOD(I_OnSyncUser,OnSyncUser(u->second,(Module*)TreeProtocolModule,(void*)this));
1208 u->second->GetExtList(list);
1209 for (unsigned int j = 0; j < list.size(); j++)
1211 FOREACH_MOD(I_OnSyncUserMetaData,OnSyncUserMetaData(u->second,(Module*)TreeProtocolModule,(void*)this,list[j]));
1217 /* This function is called when we want to send a netburst to a local
1218 * server. There is a set order we must do this, because for example
1219 * users require their servers to exist, and channels require their
1220 * users to exist. You get the idea.
1222 void DoBurst(TreeServer* s)
1224 Srv->SendOpers("*** Bursting to \2"+s->GetName()+"\2.");
1225 this->WriteLine("BURST");
1226 /* send our version string */
1227 this->WriteLine(":"+Srv->GetServerName()+" VERSION :"+Srv->GetVersion());
1228 /* Send server tree */
1229 this->SendServers(TreeRoot,s,1);
1230 /* Send users and their oper status */
1232 /* Send everything else (channel modes, xlines etc) */
1233 this->SendChannelModes(s);
1234 this->SendXLines(s);
1235 this->WriteLine("ENDBURST");
1236 Srv->SendOpers("*** Finished bursting to \2"+s->GetName()+"\2.");
1239 /* This function is called when we receive data from a remote
1240 * server. We buffer the data in a std::string (it doesnt stay
1241 * there for long), reading using InspSocket::Read() which can
1242 * read up to 16 kilobytes in one operation.
1244 * IF THIS FUNCTION RETURNS FALSE, THE CORE CLOSES AND DELETES
1245 * THE SOCKET OBJECT FOR US.
1247 virtual bool OnDataReady()
1249 char* data = this->Read();
1250 /* Check that the data read is a valid pointer and it has some content */
1253 this->in_buffer += data;
1254 /* While there is at least one new line in the buffer,
1255 * do something useful (we hope!) with it.
1257 while (in_buffer.find("\n") != std::string::npos)
1259 char* line = (char*)in_buffer.c_str();
1260 std::string ret = "";
1261 while ((*line != '\n') && (strlen(line)))
1263 if ((*line != '\r') && (*line != '\n'))
1267 if ((*line == '\n') || (*line == '\r'))
1270 /* Process this one, abort if it
1271 * didnt return true.
1277 memset(result,0,1024);
1279 log(DEBUG,"Original string '%s'",ret.c_str());
1280 /* ERROR + CAPAB is still allowed unencryped */
1281 if ((ret.substr(0,7) != "ERROR :") && (ret.substr(0,6) != "CAPAB "))
1283 int nbytes = from64tobits(out, ret.c_str(), 1024);
1284 if ((nbytes > 0) && (nbytes < 1024))
1286 log(DEBUG,"m_spanningtree: decrypt %d bytes",nbytes);
1287 ctx_in->Decrypt(out, result, nbytes, 1);
1288 for (int t = 0; t < nbytes; t++)
1289 if (result[t] == '\7') result[t] = 0;
1294 if (!this->ProcessLine(ret))
1300 /* EAGAIN returns an empty but non-NULL string, so this
1301 * evaluates to TRUE for EAGAIN but to FALSE for EOF.
1303 return (data != NULL);
1306 int WriteLine(std::string line)
1308 log(DEBUG,"OUT: %s",line.c_str());
1311 log(DEBUG,"AES context");
1313 char result64[10240];
1314 if (this->keylength)
1316 while (line.length() % this->keylength != 0)
1318 // pad it to be a multiple of the key length
1322 unsigned int ll = line.length();
1323 log(DEBUG,"Plaintext line with padding = %d chars",ll);
1324 ctx_out->Encrypt(line.c_str(), result, ll, 1);
1325 log(DEBUG,"Encrypted.");
1326 to64frombits((unsigned char*)result64,(unsigned char*)result,ll);
1328 log(DEBUG,"Encrypted: %s",line.c_str());
1329 //int from64tobits(char *out, const char *in, int maxlen);
1331 return this->Write(line + "\r\n");
1334 /* Handle ERROR command */
1335 bool Error(std::deque<std::string> params)
1337 if (params.size() < 1)
1339 std::string Errmsg = params[0];
1340 std::string SName = myhost;
1341 if (InboundServerName != "")
1343 SName = InboundServerName;
1345 Srv->SendOpers("*** ERROR from "+SName+": "+Errmsg);
1346 /* we will return false to cause the socket to close.
1351 /* Because the core won't let users or even SERVERS set +o,
1352 * we use the OPERTYPE command to do this.
1354 bool OperType(std::string prefix, std::deque<std::string> ¶ms)
1356 if (params.size() != 1)
1358 std::string opertype = params[0];
1359 userrec* u = Srv->FindNick(prefix);
1362 strlcpy(u->oper,opertype.c_str(),NICKMAX);
1363 if (!strchr(u->modes,'o'))
1365 strcat(u->modes,"o");
1367 DoOneToAllButSender(u->nick,"OPERTYPE",params,u->server);
1372 /* Because Andy insists that services-compatible servers must
1373 * implement SVSNICK and SVSJOIN, that's exactly what we do :p
1375 bool ForceNick(std::string prefix, std::deque<std::string> ¶ms)
1377 if (params.size() < 3)
1379 userrec* u = Srv->FindNick(params[0]);
1382 Srv->ChangeUserNick(u,params[1]);
1383 u->age = atoi(params[2].c_str());
1384 DoOneToAllButSender(prefix,"SVSNICK",params,prefix);
1389 bool ServiceJoin(std::string prefix, std::deque<std::string> ¶ms)
1391 if (params.size() < 2)
1393 userrec* u = Srv->FindNick(params[0]);
1396 Srv->JoinUserToChannel(u,params[1],"");
1397 DoOneToAllButSender(prefix,"SVSJOIN",params,prefix);
1402 bool RemoteRehash(std::string prefix, std::deque<std::string> ¶ms)
1404 if (params.size() < 1)
1406 std::string servermask = params[0];
1407 if (Srv->MatchText(Srv->GetServerName(),servermask))
1409 Srv->SendOpers("*** Remote rehash initiated from server \002"+prefix+"\002.");
1410 Srv->RehashServer();
1411 ReadConfiguration(false);
1413 DoOneToAllButSender(prefix,"REHASH",params,prefix);
1417 bool RemoteKill(std::string prefix, std::deque<std::string> ¶ms)
1419 if (params.size() != 2)
1421 std::string nick = params[0];
1422 userrec* u = Srv->FindNick(prefix);
1423 userrec* who = Srv->FindNick(nick);
1426 /* Prepend kill source, if we don't have one */
1427 std::string sourceserv = prefix;
1430 sourceserv = u->server;
1432 if (*(params[1].c_str()) != '[')
1434 params[1] = "[" + sourceserv + "] Killed (" + params[1] +")";
1436 std::string reason = params[1];
1437 params[1] = ":" + params[1];
1438 DoOneToAllButSender(prefix,"KILL",params,sourceserv);
1439 Srv->QuitUser(who,reason);
1444 bool LocalPong(std::string prefix, std::deque<std::string> ¶ms)
1446 if (params.size() < 1)
1448 TreeServer* ServerSource = FindServer(prefix);
1451 ServerSource->SetPingFlag();
1456 bool MetaData(std::string prefix, std::deque<std::string> ¶ms)
1458 if (params.size() < 3)
1460 TreeServer* ServerSource = FindServer(prefix);
1463 if (*(params[0].c_str()) == '#')
1465 chanrec* c = Srv->FindChannel(params[0]);
1468 FOREACH_MOD(I_OnDecodeMetaData,OnDecodeMetaData(TYPE_CHANNEL,c,params[1],params[2]));
1473 userrec* u = Srv->FindNick(params[0]);
1476 FOREACH_MOD(I_OnDecodeMetaData,OnDecodeMetaData(TYPE_USER,u,params[1],params[2]));
1480 params[2] = ":" + params[2];
1481 DoOneToAllButSender(prefix,"METADATA",params,prefix);
1485 bool ServerVersion(std::string prefix, std::deque<std::string> ¶ms)
1487 if (params.size() < 1)
1489 TreeServer* ServerSource = FindServer(prefix);
1492 ServerSource->SetVersion(params[0]);
1494 params[0] = ":" + params[0];
1495 DoOneToAllButSender(prefix,"VERSION",params,prefix);
1499 bool ChangeHost(std::string prefix, std::deque<std::string> ¶ms)
1501 if (params.size() < 1)
1503 userrec* u = Srv->FindNick(prefix);
1506 Srv->ChangeHost(u,params[0]);
1507 DoOneToAllButSender(prefix,"FHOST",params,u->server);
1512 bool AddLine(std::string prefix, std::deque<std::string> ¶ms)
1514 if (params.size() < 6)
1516 std::string linetype = params[0]; /* Z, Q, E, G, K */
1517 std::string mask = params[1]; /* Line type dependent */
1518 std::string source = params[2]; /* may not be online or may be a server */
1519 std::string settime = params[3]; /* EPOCH time set */
1520 std::string duration = params[4]; /* Duration secs */
1521 std::string reason = params[5];
1523 switch (*(linetype.c_str()))
1526 add_zline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1527 zline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1530 add_qline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1531 qline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1534 add_eline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1535 eline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1538 add_gline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1539 gline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1542 add_kline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1545 /* Just in case... */
1546 Srv->SendOpers("*** \2WARNING\2: Invalid xline type '"+linetype+"' sent by server "+prefix+", ignored!");
1549 /* Send it on its way */
1550 params[5] = ":" + params[5];
1551 DoOneToAllButSender(prefix,"ADDLINE",params,prefix);
1555 bool ChangeName(std::string prefix, std::deque<std::string> ¶ms)
1557 if (params.size() < 1)
1559 userrec* u = Srv->FindNick(prefix);
1562 Srv->ChangeGECOS(u,params[0]);
1563 params[0] = ":" + params[0];
1564 DoOneToAllButSender(prefix,"FNAME",params,u->server);
1569 bool Whois(std::string prefix, std::deque<std::string> ¶ms)
1571 if (params.size() < 1)
1573 log(DEBUG,"In IDLE command");
1574 userrec* u = Srv->FindNick(prefix);
1577 log(DEBUG,"USER EXISTS: %s",u->nick);
1578 // an incoming request
1579 if (params.size() == 1)
1581 userrec* x = Srv->FindNick(params[0]);
1582 if ((x) && (x->fd > -1))
1584 userrec* x = Srv->FindNick(params[0]);
1585 log(DEBUG,"Got IDLE");
1586 char signon[MAXBUF];
1588 log(DEBUG,"Sending back IDLE 3");
1589 snprintf(signon,MAXBUF,"%lu",(unsigned long)x->signon);
1590 snprintf(idle,MAXBUF,"%lu",(unsigned long)abs((x->idle_lastmsg)-time(NULL)));
1591 std::deque<std::string> par;
1592 par.push_back(prefix);
1593 par.push_back(signon);
1594 par.push_back(idle);
1595 // ours, we're done, pass it BACK
1596 DoOneToOne(params[0],"IDLE",par,u->server);
1600 // not ours pass it on
1601 DoOneToOne(prefix,"IDLE",params,x->server);
1604 else if (params.size() == 3)
1606 std::string who_did_the_whois = params[0];
1607 userrec* who_to_send_to = Srv->FindNick(who_did_the_whois);
1608 if ((who_to_send_to) && (who_to_send_to->fd > -1))
1610 log(DEBUG,"Got final IDLE");
1611 // an incoming reply to a whois we sent out
1612 std::string nick_whoised = prefix;
1613 unsigned long signon = atoi(params[1].c_str());
1614 unsigned long idle = atoi(params[2].c_str());
1615 if ((who_to_send_to) && (who_to_send_to->fd > -1))
1616 do_whois(who_to_send_to,u,signon,idle,(char*)nick_whoised.c_str());
1620 // not ours, pass it on
1621 DoOneToOne(prefix,"IDLE",params,who_to_send_to->server);
1628 bool LocalPing(std::string prefix, std::deque<std::string> ¶ms)
1630 if (params.size() < 1)
1632 std::string stufftobounce = params[0];
1633 this->WriteLine(":"+Srv->GetServerName()+" PONG "+stufftobounce);
1637 bool RemoteServer(std::string prefix, std::deque<std::string> ¶ms)
1639 if (params.size() < 4)
1641 std::string servername = params[0];
1642 std::string password = params[1];
1643 // hopcount is not used for a remote server, we calculate this ourselves
1644 std::string description = params[3];
1645 TreeServer* ParentOfThis = FindServer(prefix);
1648 this->WriteLine("ERROR :Protocol error - Introduced remote server from unknown server "+prefix);
1651 TreeServer* CheckDupe = FindServer(servername);
1654 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1655 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, already exists on server "+CheckDupe->GetParent()->GetName());
1658 TreeServer* Node = new TreeServer(servername,description,ParentOfThis,NULL);
1659 ParentOfThis->AddChild(Node);
1660 params[3] = ":" + params[3];
1661 DoOneToAllButSender(prefix,"SERVER",params,prefix);
1662 Srv->SendOpers("*** Server \002"+prefix+"\002 introduced server \002"+servername+"\002 ("+description+")");
1666 bool Outbound_Reply_Server(std::deque<std::string> ¶ms)
1668 if (params.size() < 4)
1670 std::string servername = params[0];
1671 std::string password = params[1];
1672 int hops = atoi(params[2].c_str());
1675 this->WriteLine("ERROR :Server too far away for authentication");
1676 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, server is too far away for authentication");
1679 std::string description = params[3];
1680 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1682 if ((x->Name == servername) && (x->RecvPass == password))
1684 TreeServer* CheckDupe = FindServer(servername);
1687 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1688 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, already exists on server "+CheckDupe->GetParent()->GetName());
1691 // Begin the sync here. this kickstarts the
1692 // other side, waiting in WAIT_AUTH_2 state,
1693 // into starting their burst, as it shows
1694 // that we're happy.
1695 this->LinkState = CONNECTED;
1696 // we should add the details of this server now
1697 // to the servers tree, as a child of the root
1699 TreeServer* Node = new TreeServer(servername,description,TreeRoot,this);
1700 TreeRoot->AddChild(Node);
1701 params[3] = ":" + params[3];
1702 DoOneToAllButSender(TreeRoot->GetName(),"SERVER",params,servername);
1703 this->bursting = true;
1704 this->DoBurst(Node);
1708 this->WriteLine("ERROR :Invalid credentials");
1709 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, invalid link credentials");
1713 bool Inbound_Server(std::deque<std::string> ¶ms)
1715 if (params.size() < 4)
1717 std::string servername = params[0];
1718 std::string password = params[1];
1719 int hops = atoi(params[2].c_str());
1722 this->WriteLine("ERROR :Server too far away for authentication");
1723 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, server is too far away for authentication");
1726 std::string description = params[3];
1727 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1729 if ((x->Name == servername) && (x->RecvPass == password))
1731 TreeServer* CheckDupe = FindServer(servername);
1734 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1735 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, already exists on server "+CheckDupe->GetParent()->GetName());
1738 /* If the config says this link is encrypted, but the remote side
1739 * hasnt bothered to send the AES command before SERVER, then we
1740 * boot them off as we MUST have this connection encrypted.
1742 if ((x->EncryptionKey != "") && (!this->ctx_in))
1744 this->WriteLine("ERROR :This link requires AES encryption to be enabled. Plaintext connection refused.");
1745 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, remote server did not enable AES.");
1748 Srv->SendOpers("*** Verified incoming server connection from \002"+servername+"\002["+(x->HideFromStats ? "<hidden>" : this->GetIP())+"] ("+description+")");
1749 this->InboundServerName = servername;
1750 this->InboundDescription = description;
1751 // this is good. Send our details: Our server name and description and hopcount of 0,
1752 // along with the sendpass from this block.
1753 this->WriteLine("SERVER "+Srv->GetServerName()+" "+x->SendPass+" 0 :"+Srv->GetServerDescription());
1754 // move to the next state, we are now waiting for THEM.
1755 this->LinkState = WAIT_AUTH_2;
1759 this->WriteLine("ERROR :Invalid credentials");
1760 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, invalid link credentials");
1764 void Split(std::string line, bool stripcolon, std::deque<std::string> &n)
1766 if (!strchr(line.c_str(),' '))
1771 std::stringstream s(line);
1772 std::string param = "";
1791 if ((param == ":") && (item > 0))
1814 bool ProcessLine(std::string line)
1816 char* l = (char*)line.c_str();
1817 while ((strlen(l)) && (l[strlen(l)-1] == '\r') || (l[strlen(l)-1] == '\n'))
1818 l[strlen(l)-1] = '\0';
1822 Srv->Log(DEBUG,"IN: "+line);
1824 std::deque<std::string> params;
1825 this->Split(line,true,params);
1826 std::string command = "";
1827 std::string prefix = "";
1828 if (((params[0].c_str())[0] == ':') && (params.size() > 1))
1831 command = params[1];
1832 char* pref = (char*)prefix.c_str();
1840 command = params[0];
1844 if ((!this->ctx_in) && (command == "AES"))
1846 std::string sserv = params[0];
1847 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1849 if ((x->EncryptionKey != "") && (x->Name == sserv))
1851 this->InitAES(x->EncryptionKey,sserv);
1856 else if ((this->ctx_in) && (command == "AES"))
1858 WriteOpers("*** \2AES\2: Encryption already enabled on this connection yet %s is trying to enable it twice!",params[0].c_str());
1861 switch (this->LinkState)
1866 // Waiting for SERVER command from remote server. Server initiating
1867 // the connection sends the first SERVER command, listening server
1868 // replies with theirs if its happy, then if the initiator is happy,
1869 // it starts to send its net sync, which starts the merge, otherwise
1870 // it sends an ERROR.
1871 if (command == "PASS")
1873 /* Silently ignored */
1875 else if (command == "SERVER")
1877 return this->Inbound_Server(params);
1879 else if (command == "ERROR")
1881 return this->Error(params);
1883 else if (command == "USER")
1885 this->WriteLine("ERROR :Client connections to this port are prohibited.");
1888 else if (command == "CAPAB")
1890 return this->Capab(params);
1892 else if ((command == "U") || (command == "S"))
1894 this->WriteLine("ERROR :Cannot use the old-style mesh linking protocol with m_spanningtree.so!");
1899 this->WriteLine("ERROR :Invalid command in negotiation phase.");
1904 // Waiting for start of other side's netmerge to say they liked our
1906 if (command == "SERVER")
1908 // cant do this, they sent it to us in the WAIT_AUTH_1 state!
1912 else if ((command == "U") || (command == "S"))
1914 this->WriteLine("ERROR :Cannot use the old-style mesh linking protocol with m_spanningtree.so!");
1917 else if (command == "BURST")
1919 this->LinkState = CONNECTED;
1920 Node = new TreeServer(InboundServerName,InboundDescription,TreeRoot,this);
1921 TreeRoot->AddChild(Node);
1923 params.push_back(InboundServerName);
1924 params.push_back("*");
1925 params.push_back("1");
1926 params.push_back(":"+InboundDescription);
1927 DoOneToAllButSender(TreeRoot->GetName(),"SERVER",params,InboundServerName);
1928 this->bursting = true;
1929 this->DoBurst(Node);
1931 else if (command == "ERROR")
1933 return this->Error(params);
1935 else if (command == "CAPAB")
1937 return this->Capab(params);
1942 this->WriteLine("ERROR :Internal error -- listening socket accepted its own descriptor!!!");
1946 if (command == "SERVER")
1948 // another server we connected to, which was in WAIT_AUTH_1 state,
1949 // has just sent us their credentials. If we get this far, theyre
1950 // happy with OUR credentials, and they are now in WAIT_AUTH_2 state.
1951 // if we're happy with this, we should send our netburst which
1952 // kickstarts the merge.
1953 return this->Outbound_Reply_Server(params);
1955 else if (command == "ERROR")
1957 return this->Error(params);
1961 // This is the 'authenticated' state, when all passwords
1962 // have been exchanged and anything past this point is taken
1967 std::string direction = prefix;
1968 userrec* t = Srv->FindNick(prefix);
1971 direction = t->server;
1973 TreeServer* route_back_again = BestRouteTo(direction);
1974 if ((!route_back_again) || (route_back_again->GetSocket() != this))
1976 if (route_back_again)
1977 log(DEBUG,"Protocol violation: Fake direction in command '%s' from connection '%s'",line.c_str(),this->GetName().c_str());
1982 * When there is activity on the socket, reset the ping counter so
1983 * that we're not wasting bandwidth pinging an active server.
1985 route_back_again->SetNextPingTime(time(NULL) + 120);
1986 route_back_again->SetPingFlag();
1989 if (command == "SVSMODE")
1991 /* Services expects us to implement
1992 * SVSMODE. In inspircd its the same as
1997 std::string target = "";
1998 /* Yes, know, this is a mess. Its reasonably fast though as we're
1999 * working with std::string here.
2001 if ((command == "NICK") && (params.size() > 1))
2003 return this->IntroduceClient(prefix,params);
2005 else if (command == "FJOIN")
2007 return this->ForceJoin(prefix,params);
2009 else if (command == "SERVER")
2011 return this->RemoteServer(prefix,params);
2013 else if (command == "ERROR")
2015 return this->Error(params);
2017 else if (command == "OPERTYPE")
2019 return this->OperType(prefix,params);
2021 else if (command == "FMODE")
2023 return this->ForceMode(prefix,params);
2025 else if (command == "KILL")
2027 return this->RemoteKill(prefix,params);
2029 else if (command == "FTOPIC")
2031 return this->ForceTopic(prefix,params);
2033 else if (command == "REHASH")
2035 return this->RemoteRehash(prefix,params);
2037 else if (command == "METADATA")
2039 return this->MetaData(prefix,params);
2041 else if (command == "PING")
2043 return this->LocalPing(prefix,params);
2045 else if (command == "PONG")
2047 return this->LocalPong(prefix,params);
2049 else if (command == "VERSION")
2051 return this->ServerVersion(prefix,params);
2053 else if (command == "FHOST")
2055 return this->ChangeHost(prefix,params);
2057 else if (command == "FNAME")
2059 return this->ChangeName(prefix,params);
2061 else if (command == "ADDLINE")
2063 return this->AddLine(prefix,params);
2065 else if (command == "SVSNICK")
2069 prefix = this->GetName();
2071 return this->ForceNick(prefix,params);
2073 else if (command == "IDLE")
2075 return this->Whois(prefix,params);
2077 else if (command == "SVSJOIN")
2081 prefix = this->GetName();
2083 return this->ServiceJoin(prefix,params);
2085 else if (command == "SQUIT")
2087 if (params.size() == 2)
2089 this->Squit(FindServer(params[0]),params[1]);
2093 else if (command == "ENDBURST")
2095 this->bursting = false;
2100 // not a special inter-server command.
2101 // Emulate the actual user doing the command,
2102 // this saves us having a huge ugly parser.
2103 userrec* who = Srv->FindNick(prefix);
2104 std::string sourceserv = this->myhost;
2105 if (this->InboundServerName != "")
2107 sourceserv = this->InboundServerName;
2112 target = who->server;
2113 char* strparams[127];
2114 for (unsigned int q = 0; q < params.size(); q++)
2116 strparams[q] = (char*)params[q].c_str();
2118 Srv->CallCommandHandler(command, strparams, params.size(), who);
2122 // its not a user. Its either a server, or somethings screwed up.
2123 if (IsServer(prefix))
2125 target = Srv->GetServerName();
2129 log(DEBUG,"Command with unknown origin '%s'",prefix.c_str());
2133 return DoOneToAllButSenderRaw(line,sourceserv,prefix,command,params);
2142 virtual std::string GetName()
2144 std::string sourceserv = this->myhost;
2145 if (this->InboundServerName != "")
2147 sourceserv = this->InboundServerName;
2152 virtual void OnTimeout()
2154 if (this->LinkState == CONNECTING)
2156 Srv->SendOpers("*** CONNECT: Connection to \002"+myhost+"\002 timed out.");
2160 virtual void OnClose()
2162 // Connection closed.
2163 // If the connection is fully up (state CONNECTED)
2164 // then propogate a netsplit to all peers.
2165 std::string quitserver = this->myhost;
2166 if (this->InboundServerName != "")
2168 quitserver = this->InboundServerName;
2170 TreeServer* s = FindServer(quitserver);
2173 Squit(s,"Remote host closed the connection");
2175 WriteOpers("Server '\2%s\2[%s]' closed the connection.",quitserver.c_str(),this->GetIP().c_str());
2178 virtual int OnIncomingConnection(int newsock, char* ip)
2180 TreeSocket* s = new TreeSocket(newsock, ip);
2186 void AddThisServer(TreeServer* server, std::deque<TreeServer*> &list)
2188 for (unsigned int c = 0; c < list.size(); c++)
2190 if (list[c] == server)
2195 list.push_back(server);
2198 // returns a list of DIRECT servernames for a specific channel
2199 void GetListOfServersForChannel(chanrec* c, std::deque<TreeServer*> &list)
2201 std::map<char*,char*> *ulist = c->GetUsers();
2202 for (std::map<char*,char*>::iterator i = ulist->begin(); i != ulist->end(); i++)
2204 char* o = i->second;
2205 userrec* otheruser = (userrec*)o;
2206 if (otheruser->fd < 0)
2208 TreeServer* best = BestRouteTo(otheruser->server);
2210 AddThisServer(best,list);
2216 bool DoOneToAllButSenderRaw(std::string data, std::string omit, std::string prefix, std::string command, std::deque<std::string> ¶ms)
2218 TreeServer* omitroute = BestRouteTo(omit);
2219 if ((command == "NOTICE") || (command == "PRIVMSG"))
2221 if ((params.size() >= 2) && (*(params[0].c_str()) != '$'))
2223 if (*(params[0].c_str()) != '#')
2225 // special routing for private messages/notices
2226 userrec* d = Srv->FindNick(params[0]);
2229 std::deque<std::string> par;
2230 par.push_back(params[0]);
2231 par.push_back(":"+params[1]);
2232 DoOneToOne(prefix,command,par,d->server);
2238 log(DEBUG,"Channel privmsg going to chan %s",params[0].c_str());
2239 chanrec* c = Srv->FindChannel(params[0]);
2242 std::deque<TreeServer*> list;
2243 GetListOfServersForChannel(c,list);
2244 log(DEBUG,"Got a list of %d servers",list.size());
2245 unsigned int lsize = list.size();
2246 for (unsigned int i = 0; i < lsize; i++)
2248 TreeSocket* Sock = list[i]->GetSocket();
2249 if ((Sock) && (list[i]->GetName() != omit) && (omitroute != list[i]))
2251 log(DEBUG,"Writing privmsg to server %s",list[i]->GetName().c_str());
2252 Sock->WriteLine(data);
2260 unsigned int items = TreeRoot->ChildCount();
2261 for (unsigned int x = 0; x < items; x++)
2263 TreeServer* Route = TreeRoot->GetChild(x);
2264 if ((Route->GetSocket()) && (Route->GetName() != omit) && (omitroute != Route))
2266 TreeSocket* Sock = Route->GetSocket();
2267 Sock->WriteLine(data);
2273 bool DoOneToAllButSender(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string omit)
2275 TreeServer* omitroute = BestRouteTo(omit);
2276 std::string FullLine = ":" + prefix + " " + command;
2277 unsigned int words = params.size();
2278 for (unsigned int x = 0; x < words; x++)
2280 FullLine = FullLine + " " + params[x];
2282 unsigned int items = TreeRoot->ChildCount();
2283 for (unsigned int x = 0; x < items; x++)
2285 TreeServer* Route = TreeRoot->GetChild(x);
2286 // Send the line IF:
2287 // The route has a socket (its a direct connection)
2288 // The route isnt the one to be omitted
2289 // The route isnt the path to the one to be omitted
2290 if ((Route->GetSocket()) && (Route->GetName() != omit) && (omitroute != Route))
2292 TreeSocket* Sock = Route->GetSocket();
2293 Sock->WriteLine(FullLine);
2299 bool DoOneToMany(std::string prefix, std::string command, std::deque<std::string> ¶ms)
2301 std::string FullLine = ":" + prefix + " " + command;
2302 unsigned int words = params.size();
2303 for (unsigned int x = 0; x < words; x++)
2305 FullLine = FullLine + " " + params[x];
2307 unsigned int items = TreeRoot->ChildCount();
2308 for (unsigned int x = 0; x < items; x++)
2310 TreeServer* Route = TreeRoot->GetChild(x);
2311 if (Route->GetSocket())
2313 TreeSocket* Sock = Route->GetSocket();
2314 Sock->WriteLine(FullLine);
2320 bool DoOneToOne(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string target)
2322 TreeServer* Route = BestRouteTo(target);
2325 std::string FullLine = ":" + prefix + " " + command;
2326 unsigned int words = params.size();
2327 for (unsigned int x = 0; x < words; x++)
2329 FullLine = FullLine + " " + params[x];
2331 if (Route->GetSocket())
2333 TreeSocket* Sock = Route->GetSocket();
2334 Sock->WriteLine(FullLine);
2344 std::vector<TreeSocket*> Bindings;
2346 void ReadConfiguration(bool rebind)
2348 Conf = new ConfigReader;
2351 for (int j =0; j < Conf->Enumerate("bind"); j++)
2353 std::string Type = Conf->ReadValue("bind","type",j);
2354 std::string IP = Conf->ReadValue("bind","address",j);
2355 long Port = Conf->ReadInteger("bind","port",j,true);
2356 if (Type == "servers")
2362 TreeSocket* listener = new TreeSocket(IP.c_str(),Port,true,10);
2363 if (listener->GetState() == I_LISTENING)
2365 Srv->AddSocket(listener);
2366 Bindings.push_back(listener);
2370 log(DEFAULT,"m_spanningtree: Warning: Failed to bind server port %d",Port);
2378 for (int j =0; j < Conf->Enumerate("link"); j++)
2381 L.Name = Conf->ReadValue("link","name",j);
2382 L.IPAddr = Conf->ReadValue("link","ipaddr",j);
2383 L.Port = Conf->ReadInteger("link","port",j,true);
2384 L.SendPass = Conf->ReadValue("link","sendpass",j);
2385 L.RecvPass = Conf->ReadValue("link","recvpass",j);
2386 L.AutoConnect = Conf->ReadInteger("link","autoconnect",j,true);
2387 L.EncryptionKey = Conf->ReadValue("link","encryptionkey",j);
2388 L.HiddenFromStats = Conf->ReadFlag("link","hidden",j);
2389 L.NextConnectTime = time(NULL) + L.AutoConnect;
2390 /* Bugfix by brain, do not allow people to enter bad configurations */
2391 if ((L.RecvPass != "") && (L.SendPass != "") && (L.Name != "") && (L.Port))
2393 LinkBlocks.push_back(L);
2394 log(DEBUG,"m_spanningtree: Read server %s with host %s:%d",L.Name.c_str(),L.IPAddr.c_str(),L.Port);
2398 if (L.RecvPass == "")
2400 log(DEFAULT,"Invalid configuration for server '%s', recvpass not defined!",L.Name.c_str());
2402 else if (L.SendPass == "")
2404 log(DEFAULT,"Invalid configuration for server '%s', sendpass not defined!",L.Name.c_str());
2406 else if (L.Name == "")
2408 log(DEFAULT,"Invalid configuration, link tag without a name!");
2412 log(DEFAULT,"Invalid configuration for server '%s', no port specified!",L.Name.c_str());
2420 class ModuleSpanningTree : public Module
2422 std::vector<TreeSocket*> Bindings;
2428 ModuleSpanningTree(Server* Me)
2429 : Module::Module(Me)
2434 // Create the root of the tree
2435 TreeRoot = new TreeServer(Srv->GetServerName(),Srv->GetServerDescription());
2437 ReadConfiguration(true);
2440 void ShowLinks(TreeServer* Current, userrec* user, int hops)
2442 std::string Parent = TreeRoot->GetName();
2443 if (Current->GetParent())
2445 Parent = Current->GetParent()->GetName();
2447 for (unsigned int q = 0; q < Current->ChildCount(); q++)
2449 ShowLinks(Current->GetChild(q),user,hops+1);
2451 WriteServ(user->fd,"364 %s %s %s :%d %s",user->nick,Current->GetName().c_str(),Parent.c_str(),hops,Current->GetDesc().c_str());
2454 int CountLocalServs()
2456 return TreeRoot->ChildCount();
2461 return serverlist.size();
2464 void HandleLinks(char** parameters, int pcnt, userrec* user)
2466 ShowLinks(TreeRoot,user,0);
2467 WriteServ(user->fd,"365 %s * :End of /LINKS list.",user->nick);
2471 void HandleLusers(char** parameters, int pcnt, userrec* user)
2473 WriteServ(user->fd,"251 %s :There are %d users and %d invisible on %d servers",user->nick,usercnt()-usercount_invisible(),usercount_invisible(),this->CountServs());
2474 WriteServ(user->fd,"252 %s %d :operator(s) online",user->nick,usercount_opers());
2475 WriteServ(user->fd,"253 %s %d :unknown connections",user->nick,usercount_unknown());
2476 WriteServ(user->fd,"254 %s %d :channels formed",user->nick,chancount());
2477 WriteServ(user->fd,"254 %s :I have %d clients and %d servers",user->nick,local_count(),this->CountLocalServs());
2481 // WARNING: NOT THREAD SAFE - DONT GET ANY SMART IDEAS.
2483 void ShowMap(TreeServer* Current, userrec* user, int depth, char matrix[128][80])
2487 for (int t = 0; t < depth; t++)
2489 matrix[line][t] = ' ';
2492 // For Aligning, we need to work out exactly how deep this thing is, and produce
2493 // a 'Spacer' String to compensate.
2496 memset(spacer,' ',40);
2497 if ((40 - Current->GetName().length() - depth) > 1) {
2498 spacer[40 - Current->GetName().length() - depth] = '\0';
2507 if (clientlist.size() == 0) {
2508 // If there are no users, WHO THE HELL DID THE /MAP?!?!?!
2513 percent = ((float)Current->GetUserCount() / (float)clientlist.size()) * 100;
2515 snprintf(text, 80, "%s %s%5d [%5.2f%%]", Current->GetName().c_str(), spacer, Current->GetUserCount(), percent);
2516 strlcpy(&matrix[line][depth],text,80);
2518 for (unsigned int q = 0; q < Current->ChildCount(); q++)
2520 ShowMap(Current->GetChild(q),user,depth+2,matrix);
2525 // Ok, prepare to be confused.
2526 // After much mulling over how to approach this, it struck me that
2527 // the 'usual' way of doing a /MAP isnt the best way. Instead of
2528 // keeping track of a ton of ascii characters, and line by line
2529 // under recursion working out where to place them using multiplications
2530 // and divisons, we instead render the map onto a backplane of characters
2531 // (a character matrix), then draw the branches as a series of "L" shapes
2532 // from the nodes. This is not only friendlier on CPU it uses less stack.
2534 void HandleMap(char** parameters, int pcnt, userrec* user)
2536 // This array represents a virtual screen which we will
2537 // "scratch" draw to, as the console device of an irc
2538 // client does not provide for a proper terminal.
2539 char matrix[128][80];
2540 for (unsigned int t = 0; t < 128; t++)
2542 matrix[t][0] = '\0';
2545 // The only recursive bit is called here.
2546 ShowMap(TreeRoot,user,0,matrix);
2547 // Process each line one by one. The algorithm has a limit of
2548 // 128 servers (which is far more than a spanning tree should have
2549 // anyway, so we're ok). This limit can be raised simply by making
2550 // the character matrix deeper, 128 rows taking 10k of memory.
2551 for (int l = 1; l < line; l++)
2553 // scan across the line looking for the start of the
2554 // servername (the recursive part of the algorithm has placed
2555 // the servers at indented positions depending on what they
2557 int first_nonspace = 0;
2558 while (matrix[l][first_nonspace] == ' ')
2563 // Draw the `- (corner) section: this may be overwritten by
2564 // another L shape passing along the same vertical pane, becoming
2565 // a |- (branch) section instead.
2566 matrix[l][first_nonspace] = '-';
2567 matrix[l][first_nonspace-1] = '`';
2569 // Draw upwards until we hit the parent server, causing possibly
2570 // other corners (`-) to become branches (|-)
2571 while ((matrix[l2][first_nonspace-1] == ' ') || (matrix[l2][first_nonspace-1] == '`'))
2573 matrix[l2][first_nonspace-1] = '|';
2577 // dump the whole lot to the user. This is the easy bit, honest.
2578 for (int t = 0; t < line; t++)
2580 WriteServ(user->fd,"006 %s :%s",user->nick,&matrix[t][0]);
2582 WriteServ(user->fd,"007 %s :End of /MAP",user->nick);
2586 int HandleSquit(char** parameters, int pcnt, userrec* user)
2588 TreeServer* s = FindServerMask(parameters[0]);
2593 WriteServ(user->fd,"NOTICE %s :*** SQUIT: Foolish mortal, you cannot make a server SQUIT itself! (%s matches local server name)",user->nick,parameters[0]);
2596 TreeSocket* sock = s->GetSocket();
2599 log(DEBUG,"Splitting server %s",s->GetName().c_str());
2600 WriteOpers("*** SQUIT: Server \002%s\002 removed from network by %s",parameters[0],user->nick);
2601 sock->Squit(s,"Server quit by "+std::string(user->nick)+"!"+std::string(user->ident)+"@"+std::string(user->host));
2602 Srv->RemoveSocket(sock);
2606 WriteServ(user->fd,"NOTICE %s :*** SQUIT: The server \002%s\002 is not directly connected.",user->nick,parameters[0]);
2611 WriteServ(user->fd,"NOTICE %s :*** SQUIT: The server \002%s\002 does not exist on the network.",user->nick,parameters[0]);
2616 int HandleRemoteWhois(char** parameters, int pcnt, userrec* user)
2618 if ((user->fd > -1) && (pcnt > 1))
2620 userrec* remote = Srv->FindNick(parameters[1]);
2621 if ((remote) && (remote->fd < 0))
2623 std::deque<std::string> params;
2624 params.push_back(parameters[1]);
2625 DoOneToOne(user->nick,"IDLE",params,remote->server);
2630 WriteServ(user->fd,"401 %s %s :No such nick/channel",user->nick, parameters[1]);
2631 WriteServ(user->fd,"318 %s %s :End of /WHOIS list.",user->nick, parameters[1]);
2638 void DoPingChecks(time_t curtime)
2640 for (unsigned int j = 0; j < TreeRoot->ChildCount(); j++)
2642 TreeServer* serv = TreeRoot->GetChild(j);
2643 TreeSocket* sock = serv->GetSocket();
2646 if (curtime >= serv->NextPingTime())
2648 if (serv->AnsweredLastPing())
2650 sock->WriteLine(":"+Srv->GetServerName()+" PING "+serv->GetName());
2651 serv->SetNextPingTime(curtime + 120);
2655 // they didnt answer, boot them
2656 WriteOpers("*** Server \002%s\002 pinged out",serv->GetName().c_str());
2657 sock->Squit(serv,"Ping timeout");
2658 Srv->RemoveSocket(sock);
2667 void AutoConnectServers(time_t curtime)
2669 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
2671 if ((x->AutoConnect) && (curtime >= x->NextConnectTime))
2673 log(DEBUG,"Auto-Connecting %s",x->Name.c_str());
2674 x->NextConnectTime = curtime + x->AutoConnect;
2675 TreeServer* CheckDupe = FindServer(x->Name);
2678 // an autoconnected server is not connected. Check if its time to connect it
2679 WriteOpers("*** AUTOCONNECT: Auto-connecting server \002%s\002 (%lu seconds until next attempt)",x->Name.c_str(),x->AutoConnect);
2680 TreeSocket* newsocket = new TreeSocket(x->IPAddr,x->Port,false,10,x->Name);
2681 Srv->AddSocket(newsocket);
2687 int HandleVersion(char** parameters, int pcnt, userrec* user)
2689 // we've already checked if pcnt > 0, so this is safe
2690 TreeServer* found = FindServerMask(parameters[0]);
2693 std::string Version = found->GetVersion();
2694 WriteServ(user->fd,"351 %s :%s",user->nick,Version.c_str());
2695 if (found == TreeRoot)
2697 std::stringstream out(Config->data005);
2698 std::string token = "";
2699 std::string line5 = "";
2700 int token_counter = 0;
2704 line5 = line5 + token + " ";
2706 if ((token_counter >= 13) || (out.eof() == true))
2708 WriteServ(user->fd,"005 %s %s:are supported by this server",user->nick,line5.c_str());
2717 WriteServ(user->fd,"402 %s %s :No such server",user->nick,parameters[0]);
2722 int HandleConnect(char** parameters, int pcnt, userrec* user)
2724 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
2726 if (Srv->MatchText(x->Name.c_str(),parameters[0]))
2728 TreeServer* CheckDupe = FindServer(x->Name);
2731 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);
2732 TreeSocket* newsocket = new TreeSocket(x->IPAddr,x->Port,false,10,x->Name);
2733 Srv->AddSocket(newsocket);
2738 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());
2743 WriteServ(user->fd,"NOTICE %s :*** CONNECT: No server matching \002%s\002 could be found in the config file.",user->nick,parameters[0]);
2747 virtual int OnStats(char statschar, userrec* user)
2749 if (statschar == 'c')
2751 for (unsigned int i = 0; i < LinkBlocks.size(); i++)
2753 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');
2754 WriteServ(user->fd,"244 %s H * * %s",user->nick,LinkBlocks[i].Name.c_str());
2756 WriteServ(user->fd,"219 %s %c :End of /STATS report",user->nick,statschar);
2757 WriteOpers("*** Notice: Stats '%c' requested by %s (%s@%s)",statschar,user->nick,user->ident,user->host);
2763 virtual int OnPreCommand(std::string command, char **parameters, int pcnt, userrec *user, bool validated)
2765 /* If the command doesnt appear to be valid, we dont want to mess with it. */
2769 if (command == "CONNECT")
2771 return this->HandleConnect(parameters,pcnt,user);
2773 else if (command == "SQUIT")
2775 return this->HandleSquit(parameters,pcnt,user);
2777 else if (command == "MAP")
2779 this->HandleMap(parameters,pcnt,user);
2782 else if (command == "LUSERS")
2784 this->HandleLusers(parameters,pcnt,user);
2787 else if (command == "LINKS")
2789 this->HandleLinks(parameters,pcnt,user);
2792 else if (command == "WHOIS")
2797 return this->HandleRemoteWhois(parameters,pcnt,user);
2800 else if ((command == "VERSION") && (pcnt > 0))
2802 this->HandleVersion(parameters,pcnt,user);
2805 else if (Srv->IsValidModuleCommand(command, pcnt, user))
2807 // this bit of code cleverly routes all module commands
2808 // to all remote severs *automatically* so that modules
2809 // can just handle commands locally, without having
2810 // to have any special provision in place for remote
2811 // commands and linking protocols.
2812 std::deque<std::string> params;
2814 for (int j = 0; j < pcnt; j++)
2816 if (strchr(parameters[j],' '))
2818 params.push_back(":" + std::string(parameters[j]));
2822 params.push_back(std::string(parameters[j]));
2825 DoOneToMany(user->nick,command,params);
2830 virtual void OnGetServerDescription(std::string servername,std::string &description)
2832 TreeServer* s = FindServer(servername);
2835 description = s->GetDesc();
2839 virtual void OnUserInvite(userrec* source,userrec* dest,chanrec* channel)
2841 if (source->fd > -1)
2843 std::deque<std::string> params;
2844 params.push_back(dest->nick);
2845 params.push_back(channel->name);
2846 DoOneToMany(source->nick,"INVITE",params);
2850 virtual void OnPostLocalTopicChange(userrec* user, chanrec* chan, std::string topic)
2852 std::deque<std::string> params;
2853 params.push_back(chan->name);
2854 params.push_back(":"+topic);
2855 DoOneToMany(user->nick,"TOPIC",params);
2858 virtual void OnWallops(userrec* user, std::string text)
2862 std::deque<std::string> params;
2863 params.push_back(":"+text);
2864 DoOneToMany(user->nick,"WALLOPS",params);
2868 virtual void OnUserNotice(userrec* user, void* dest, int target_type, std::string text)
2870 if (target_type == TYPE_USER)
2872 userrec* d = (userrec*)dest;
2873 if ((d->fd < 0) && (user->fd > -1))
2875 std::deque<std::string> params;
2877 params.push_back(d->nick);
2878 params.push_back(":"+text);
2879 DoOneToOne(user->nick,"NOTICE",params,d->server);
2886 chanrec *c = (chanrec*)dest;
2887 std::deque<TreeServer*> list;
2888 GetListOfServersForChannel(c,list);
2889 unsigned int ucount = list.size();
2890 for (unsigned int i = 0; i < ucount; i++)
2892 TreeSocket* Sock = list[i]->GetSocket();
2894 Sock->WriteLine(":"+std::string(user->nick)+" NOTICE "+std::string(c->name)+" :"+text);
2900 virtual void OnUserMessage(userrec* user, void* dest, int target_type, std::string text)
2902 if (target_type == TYPE_USER)
2904 // route private messages which are targetted at clients only to the server
2905 // which needs to receive them
2906 userrec* d = (userrec*)dest;
2907 if ((d->fd < 0) && (user->fd > -1))
2909 std::deque<std::string> params;
2911 params.push_back(d->nick);
2912 params.push_back(":"+text);
2913 DoOneToOne(user->nick,"PRIVMSG",params,d->server);
2920 chanrec *c = (chanrec*)dest;
2921 std::deque<TreeServer*> list;
2922 GetListOfServersForChannel(c,list);
2923 unsigned int ucount = list.size();
2924 for (unsigned int i = 0; i < ucount; i++)
2926 TreeSocket* Sock = list[i]->GetSocket();
2928 Sock->WriteLine(":"+std::string(user->nick)+" PRIVMSG "+std::string(c->name)+" :"+text);
2934 virtual void OnBackgroundTimer(time_t curtime)
2936 AutoConnectServers(curtime);
2937 DoPingChecks(curtime);
2940 virtual void OnUserJoin(userrec* user, chanrec* channel)
2942 // Only do this for local users
2945 std::deque<std::string> params;
2947 params.push_back(channel->name);
2950 // if the channel has a key, force the join by emulating the key.
2951 params.push_back(channel->key);
2953 if (channel->GetUserCounter() > 1)
2955 // not the first in the channel
2956 DoOneToMany(user->nick,"JOIN",params);
2960 // first in the channel, set up their permissions
2961 // and the channel TS with FJOIN.
2963 snprintf(ts,24,"%lu",(unsigned long)channel->age);
2965 params.push_back(channel->name);
2966 params.push_back(ts);
2967 params.push_back("@"+std::string(user->nick));
2968 DoOneToMany(Srv->GetServerName(),"FJOIN",params);
2973 virtual void OnChangeHost(userrec* user, std::string newhost)
2975 // only occurs for local clients
2976 if (user->registered != 7)
2978 std::deque<std::string> params;
2979 params.push_back(newhost);
2980 DoOneToMany(user->nick,"FHOST",params);
2983 virtual void OnChangeName(userrec* user, std::string gecos)
2985 // only occurs for local clients
2986 if (user->registered != 7)
2988 std::deque<std::string> params;
2989 params.push_back(gecos);
2990 DoOneToMany(user->nick,"FNAME",params);
2993 virtual void OnUserPart(userrec* user, chanrec* channel, std::string partmessage)
2997 std::deque<std::string> params;
2998 params.push_back(channel->name);
2999 if (partmessage != "")
3000 params.push_back(":"+partmessage);
3001 DoOneToMany(user->nick,"PART",params);
3005 virtual void OnUserConnect(userrec* user)
3007 char agestr[MAXBUF];
3010 std::deque<std::string> params;
3011 snprintf(agestr,MAXBUF,"%lu",(unsigned long)user->age);
3012 params.push_back(agestr);
3013 params.push_back(user->nick);
3014 params.push_back(user->host);
3015 params.push_back(user->dhost);
3016 params.push_back(user->ident);
3017 params.push_back("+"+std::string(user->modes));
3018 params.push_back(user->ip);
3019 params.push_back(":"+std::string(user->fullname));
3020 DoOneToMany(Srv->GetServerName(),"NICK",params);
3022 // User is Local, change needs to be reflected!
3023 TreeServer* SourceServer = FindServer(user->server);
3025 SourceServer->AddUserCount();
3031 virtual void OnUserQuit(userrec* user, std::string reason)
3033 if ((user->fd > -1) && (user->registered == 7))
3035 std::deque<std::string> params;
3036 params.push_back(":"+reason);
3037 DoOneToMany(user->nick,"QUIT",params);
3039 // Regardless, We need to modify the user Counts..
3040 TreeServer* SourceServer = FindServer(user->server);
3042 SourceServer->DelUserCount();
3047 virtual void OnUserPostNick(userrec* user, std::string oldnick)
3051 std::deque<std::string> params;
3052 params.push_back(user->nick);
3053 DoOneToMany(oldnick,"NICK",params);
3057 virtual void OnUserKick(userrec* source, userrec* user, chanrec* chan, std::string reason)
3059 if ((source) && (source->fd > -1))
3061 std::deque<std::string> params;
3062 params.push_back(chan->name);
3063 params.push_back(user->nick);
3064 params.push_back(":"+reason);
3065 DoOneToMany(source->nick,"KICK",params);
3069 virtual void OnRemoteKill(userrec* source, userrec* dest, std::string reason)
3071 std::deque<std::string> params;
3072 params.push_back(dest->nick);
3073 params.push_back(":"+reason);
3074 DoOneToMany(source->nick,"KILL",params);
3077 virtual void OnRehash(std::string parameter)
3079 if (parameter != "")
3081 std::deque<std::string> params;
3082 params.push_back(parameter);
3083 DoOneToMany(Srv->GetServerName(),"REHASH",params);
3085 if (Srv->MatchText(Srv->GetServerName(),parameter))
3087 Srv->SendOpers("*** Remote rehash initiated from server \002"+Srv->GetServerName()+"\002.");
3088 Srv->RehashServer();
3091 ReadConfiguration(false);
3094 // note: the protocol does not allow direct umode +o except
3095 // via NICK with 8 params. sending OPERTYPE infers +o modechange
3097 virtual void OnOper(userrec* user, std::string opertype)
3101 std::deque<std::string> params;
3102 params.push_back(opertype);
3103 DoOneToMany(user->nick,"OPERTYPE",params);
3107 void OnLine(userrec* source, std::string host, bool adding, char linetype, long duration, std::string reason)
3109 if (source->fd > -1)
3112 snprintf(type,8,"%cLINE",linetype);
3113 std::string stype = type;
3116 char sduration[MAXBUF];
3117 snprintf(sduration,MAXBUF,"%ld",duration);
3118 std::deque<std::string> params;
3119 params.push_back(host);
3120 params.push_back(sduration);
3121 params.push_back(":"+reason);
3122 DoOneToMany(source->nick,stype,params);
3126 std::deque<std::string> params;
3127 params.push_back(host);
3128 DoOneToMany(source->nick,stype,params);
3133 virtual void OnAddGLine(long duration, userrec* source, std::string reason, std::string hostmask)
3135 OnLine(source,hostmask,true,'G',duration,reason);
3138 virtual void OnAddZLine(long duration, userrec* source, std::string reason, std::string ipmask)
3140 OnLine(source,ipmask,true,'Z',duration,reason);
3143 virtual void OnAddQLine(long duration, userrec* source, std::string reason, std::string nickmask)
3145 OnLine(source,nickmask,true,'Q',duration,reason);
3148 virtual void OnAddELine(long duration, userrec* source, std::string reason, std::string hostmask)
3150 OnLine(source,hostmask,true,'E',duration,reason);
3153 virtual void OnDelGLine(userrec* source, std::string hostmask)
3155 OnLine(source,hostmask,false,'G',0,"");
3158 virtual void OnDelZLine(userrec* source, std::string ipmask)
3160 OnLine(source,ipmask,false,'Z',0,"");
3163 virtual void OnDelQLine(userrec* source, std::string nickmask)
3165 OnLine(source,nickmask,false,'Q',0,"");
3168 virtual void OnDelELine(userrec* source, std::string hostmask)
3170 OnLine(source,hostmask,false,'E',0,"");
3173 virtual void OnMode(userrec* user, void* dest, int target_type, std::string text)
3175 if ((user->fd > -1) && (user->registered == 7))
3177 if (target_type == TYPE_USER)
3179 userrec* u = (userrec*)dest;
3180 std::deque<std::string> params;
3181 params.push_back(u->nick);
3182 params.push_back(text);
3183 DoOneToMany(user->nick,"MODE",params);
3187 chanrec* c = (chanrec*)dest;
3188 std::deque<std::string> params;
3189 params.push_back(c->name);
3190 params.push_back(text);
3191 DoOneToMany(user->nick,"MODE",params);
3196 virtual void ProtoSendMode(void* opaque, int target_type, void* target, std::string modeline)
3198 TreeSocket* s = (TreeSocket*)opaque;
3201 if (target_type == TYPE_USER)
3203 userrec* u = (userrec*)target;
3204 s->WriteLine(":"+Srv->GetServerName()+" FMODE "+u->nick+" "+modeline);
3208 chanrec* c = (chanrec*)target;
3209 s->WriteLine(":"+Srv->GetServerName()+" FMODE "+c->name+" "+modeline);
3214 virtual void ProtoSendMetaData(void* opaque, int target_type, void* target, std::string extname, std::string extdata)
3216 TreeSocket* s = (TreeSocket*)opaque;
3219 if (target_type == TYPE_USER)
3221 userrec* u = (userrec*)target;
3222 s->WriteLine(":"+Srv->GetServerName()+" METADATA "+u->nick+" "+extname+" :"+extdata);
3226 chanrec* c = (chanrec*)target;
3227 s->WriteLine(":"+Srv->GetServerName()+" METADATA "+c->name+" "+extname+" :"+extdata);
3232 virtual ~ModuleSpanningTree()
3236 virtual Version GetVersion()
3238 return Version(1,0,0,0,VF_STATIC|VF_VENDOR);
3241 void Implements(char* List)
3243 List[I_OnPreCommand] = List[I_OnGetServerDescription] = List[I_OnUserInvite] = List[I_OnPostLocalTopicChange] = 1;
3244 List[I_OnWallops] = List[I_OnUserNotice] = List[I_OnUserMessage] = List[I_OnBackgroundTimer] = 1;
3245 List[I_OnUserJoin] = List[I_OnChangeHost] = List[I_OnChangeName] = List[I_OnUserPart] = List[I_OnUserConnect] = 1;
3246 List[I_OnUserQuit] = List[I_OnUserPostNick] = List[I_OnUserKick] = List[I_OnRemoteKill] = List[I_OnRehash] = 1;
3247 List[I_OnOper] = List[I_OnAddGLine] = List[I_OnAddZLine] = List[I_OnAddQLine] = List[I_OnAddELine] = 1;
3248 List[I_OnDelGLine] = List[I_OnDelZLine] = List[I_OnDelQLine] = List[I_OnDelELine] = List[I_ProtoSendMode] = List[I_OnMode] = 1;
3249 List[I_OnStats] = List[I_ProtoSendMetaData] = 1;
3252 /* It is IMPORTANT that m_spanningtree is the last module in the chain
3253 * so that any activity it sees is FINAL, e.g. we arent going to send out
3254 * a NICK message before m_cloaking has finished putting the +x on the user,
3256 * Therefore, we return PRIORITY_LAST to make sure we end up at the END of
3257 * the module call queue.
3259 Priority Prioritize()
3261 return PRIORITY_LAST;
3266 class ModuleSpanningTreeFactory : public ModuleFactory
3269 ModuleSpanningTreeFactory()
3273 ~ModuleSpanningTreeFactory()
3277 virtual Module * CreateModule(Server* Me)
3279 TreeProtocolModule = new ModuleSpanningTree(Me);
3280 return TreeProtocolModule;
3286 extern "C" void * init_module( void )
3288 return new ModuleSpanningTreeFactory;