1 /* +------------------------------------+
2 * | Inspire Internet Relay Chat Daemon |
3 * +------------------------------------+
5 * Inspire is copyright (C) 2002-2005 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) + 60);
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;
457 /* The usual stuff for inspircd modules,
458 * plus the vector of Link classes which we
459 * use to store the <link> tags from the config
463 std::vector<Link> LinkBlocks;
465 /* Yay for fast searches!
466 * This is hundreds of times faster than recursion
467 * or even scanning a linked list, especially when
468 * there are more than a few servers to deal with.
471 TreeServer* FindServer(std::string ServerName)
473 server_hash::iterator iter;
474 iter = serverlist.find(ServerName);
475 if (iter != serverlist.end())
485 /* Returns the locally connected server we must route a
486 * message through to reach server 'ServerName'. This
487 * only applies to one-to-one and not one-to-many routing.
488 * See the comments for the constructor of TreeServer
491 TreeServer* BestRouteTo(std::string ServerName)
493 if (ServerName.c_str() == TreeRoot->GetName())
495 TreeServer* Found = FindServer(ServerName);
498 return Found->GetRoute();
506 /* Find the first server matching a given glob mask.
507 * Theres no find-using-glob method of hash_map [awwww :-(]
508 * so instead, we iterate over the list using an iterator
509 * and match each one until we get a hit. Yes its slow,
512 TreeServer* FindServerMask(std::string ServerName)
514 for (server_hash::iterator i = serverlist.begin(); i != serverlist.end(); i++)
516 if (Srv->MatchText(i->first,ServerName))
522 /* A convenient wrapper that returns true if a server exists */
523 bool IsServer(std::string ServerName)
525 return (FindServer(ServerName) != NULL);
528 /* Every SERVER connection inbound or outbound is represented by
529 * an object of type TreeSocket.
530 * TreeSockets, being inherited from InspSocket, can be tied into
531 * the core socket engine, and we cn therefore receive activity events
532 * for them, just like activex objects on speed. (yes really, that
533 * is a technical term!) Each of these which relates to a locally
534 * connected server is assocated with it, by hooking it onto a
535 * TreeSocket class using its constructor. In this way, we can
536 * maintain a list of servers, some of which are directly connected,
537 * some of which are not.
540 class TreeSocket : public InspSocket
543 std::string in_buffer;
544 ServerState LinkState;
545 std::string InboundServerName;
546 std::string InboundDescription;
548 int num_lost_servers;
550 bool LastPingWasGood;
554 unsigned int keylength;
558 /* Because most of the I/O gubbins are encapsulated within
559 * InspSocket, we just call the superclass constructor for
560 * most of the action, and append a few of our own values
563 TreeSocket(std::string host, int port, bool listening, unsigned long maxtime)
564 : InspSocket(host, port, listening, maxtime)
567 this->LinkState = LISTENER;
569 this->ctx_out = NULL;
572 TreeSocket(std::string host, int port, bool listening, unsigned long maxtime, std::string ServerName)
573 : InspSocket(host, port, listening, maxtime)
576 this->LinkState = CONNECTING;
578 this->ctx_out = NULL;
581 /* When a listening socket gives us a new file descriptor,
582 * we must associate it with a socket without creating a new
583 * connection. This constructor is used for this purpose.
585 TreeSocket(int newfd, char* ip)
586 : InspSocket(newfd, ip)
588 this->LinkState = WAIT_AUTH_1;
590 this->ctx_out = NULL;
591 this->SendCapabilities();
602 void InitAES(std::string key,std::string SName)
609 log(DEBUG,"Initialized AES key %s",key.c_str());
610 // key must be 16, 24, 32 etc bytes (multiple of 8)
611 keylength = key.length();
612 if (!(keylength == 16 || keylength == 24 || keylength == 32))
614 WriteOpers("*** \2ERROR\2: Key length for encryptionkey is not 16, 24 or 32 bytes in length!");
615 log(DEBUG,"Key length not 16, 24 or 32 characters!");
619 WriteOpers("*** \2AES\2: Initialized %d bit encryption to server %s",keylength*8,SName.c_str());
620 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\
621 \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);
622 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\
623 \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);
627 /* When an outbound connection finishes connecting, we receive
628 * this event, and must send our SERVER string to the other
629 * side. If the other side is happy, as outlined in the server
630 * to server docs on the inspircd.org site, the other side
631 * will then send back its own server string.
633 virtual bool OnConnected()
635 if (this->LinkState == CONNECTING)
637 Srv->SendOpers("*** Connection to "+myhost+"["+this->GetIP()+"] established.");
638 /* we do not need to change state here. */
639 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
641 if (x->Name == this->myhost)
643 this->SendCapabilities();
644 if (x->EncryptionKey != "")
646 if (!(x->EncryptionKey.length() == 16 || x->EncryptionKey.length() == 24 || x->EncryptionKey.length() == 32))
648 WriteOpers("\2WARNING\2: Your encryption key is NOT 16, 24 or 32 characters in length, encryption will \2NOT\2 be enabled.");
652 this->WriteLine("AES "+Srv->GetServerName());
653 this->InitAES(x->EncryptionKey,x->Name);
656 /* found who we're supposed to be connecting to, send the neccessary gubbins. */
657 this->WriteLine("SERVER "+Srv->GetServerName()+" "+x->SendPass+" 0 :"+Srv->GetServerDescription());
662 /* There is a (remote) chance that between the /CONNECT and the connection
663 * being accepted, some muppet has removed the <link> block and rehashed.
664 * If that happens the connection hangs here until it's closed. Unlikely
665 * and rather harmless.
670 virtual void OnError(InspSocketError e)
672 /* We don't handle this method, because all our
673 * dirty work is done in OnClose() (see below)
674 * which is still called on error conditions too.
678 virtual int OnDisconnect()
680 /* For the same reason as above, we don't
681 * handle OnDisconnect()
686 /* Recursively send the server tree with distances as hops.
687 * This is used during network burst to inform the other server
688 * (and any of ITS servers too) of what servers we know about.
689 * If at any point any of these servers already exist on the other
690 * end, our connection may be terminated. The hopcounts given
691 * by this function are relative, this doesn't matter so long as
692 * they are all >1, as all the remote servers re-calculate them
693 * to be relative too, with themselves as hop 0.
695 void SendServers(TreeServer* Current, TreeServer* s, int hops)
698 for (unsigned int q = 0; q < Current->ChildCount(); q++)
700 TreeServer* recursive_server = Current->GetChild(q);
701 if (recursive_server != s)
703 snprintf(command,1024,":%s SERVER %s * %d :%s",Current->GetName().c_str(),recursive_server->GetName().c_str(),hops,recursive_server->GetDesc().c_str());
704 this->WriteLine(command);
705 this->WriteLine(":"+recursive_server->GetName()+" VERSION :"+recursive_server->GetVersion());
706 /* down to next level */
707 this->SendServers(recursive_server, s, hops+1);
712 std::string MyCapabilities()
714 ServerConfig* Config = Srv->GetConfig();
715 std::vector<std::string> modlist;
716 std::string capabilities = "";
718 for (int i = 0; i <= MODCOUNT; i++)
720 if ((modules[i]->GetVersion().Flags & VF_STATIC) || (modules[i]->GetVersion().Flags & VF_COMMON))
721 modlist.push_back(Config->module_names[i]);
723 sort(modlist.begin(),modlist.end());
724 for (unsigned int i = 0; i < modlist.size(); i++)
727 capabilities = capabilities + ",";
728 capabilities = capabilities + modlist[i];
733 void SendCapabilities()
735 this->WriteLine("CAPAB "+MyCapabilities());
738 bool Capab(std::deque<std::string> params)
740 if (params.size() != 1)
742 this->WriteLine("ERROR :Invalid number of parameters for CAPAB");
745 if (params[0] != this->MyCapabilities())
747 std::string quitserver = this->myhost;
748 if (this->InboundServerName != "")
750 quitserver = this->InboundServerName;
752 WriteOpers("*** \2ERROR\2: Server '%s' does not have the same set of modules loaded, cannot link!",quitserver.c_str());
753 WriteOpers("*** Our networked module set is: '%s'",this->MyCapabilities().c_str());
754 WriteOpers("*** Other server's networked module set is: '%s'",params[0].c_str());
755 WriteOpers("*** These lists must match exactly on both servers. Please correct these errors, and try again.");
756 this->WriteLine("ERROR :CAPAB mismatch; My capabilities: '"+this->MyCapabilities()+"'");
762 /* This function forces this server to quit, removing this server
763 * and any users on it (and servers and users below that, etc etc).
764 * It's very slow and pretty clunky, but luckily unless your network
765 * is having a REAL bad hair day, this function shouldnt be called
766 * too many times a month ;-)
768 void SquitServer(TreeServer* Current, CullList* Goners)
770 /* recursively squit the servers attached to 'Current'.
771 * We're going backwards so we don't remove users
772 * while we still need them ;)
774 for (unsigned int q = 0; q < Current->ChildCount(); q++)
776 TreeServer* recursive_server = Current->GetChild(q);
777 this->SquitServer(recursive_server,Goners);
779 /* Now we've whacked the kids, whack self */
781 for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
783 if (!strcasecmp(u->second->server,Current->GetName().c_str()))
785 std::string qreason = Current->GetName()+" "+std::string(Srv->GetServerName());
786 Goners->AddItem(u->second,qreason);
792 /* This is a wrapper function for SquitServer above, which
793 * does some validation first and passes on the SQUIT to all
794 * other remaining servers.
796 void Squit(TreeServer* Current,std::string reason)
798 if ((Current) && (Current != TreeRoot))
800 std::deque<std::string> params;
801 params.push_back(Current->GetName());
802 params.push_back(":"+reason);
803 DoOneToAllButSender(Current->GetParent()->GetName(),"SQUIT",params,Current->GetName());
804 if (Current->GetParent() == TreeRoot)
806 Srv->SendOpers("Server \002"+Current->GetName()+"\002 split: "+reason);
810 Srv->SendOpers("Server \002"+Current->GetName()+"\002 split from server \002"+Current->GetParent()->GetName()+"\002 with reason: "+reason);
812 num_lost_servers = 0;
814 CullList* Goners = new CullList();
815 SquitServer(Current, Goners);
818 Current->GetParent()->DelChild(Current);
821 WriteOpers("Netsplit complete, lost \002%d\002 users on \002%d\002 servers.", num_lost_users, num_lost_servers);
825 log(DEFAULT,"Squit from unknown server");
830 bool ForceMode(std::string source, std::deque<std::string> params)
832 userrec* who = new userrec;
833 who->fd = FD_MAGIC_NUMBER;
834 if (params.size() < 2)
837 for (unsigned int q = 0; q < params.size(); q++)
839 modelist[q] = (char*)params[q].c_str();
841 Srv->SendMode(modelist,params.size(),who);
842 DoOneToAllButSender(source,"FMODE",params,source);
848 bool ForceTopic(std::string source, std::deque<std::string> params)
850 if (params.size() != 4)
852 std::string channel = params[0];
853 time_t ts = atoi(params[1].c_str());
854 std::string setby = params[2];
855 std::string topic = params[3];
857 chanrec* c = Srv->FindChannel(channel);
860 if ((ts >= c->topicset) || (!*c->topic))
862 std::string oldtopic = c->topic;
863 strlcpy(c->topic,topic.c_str(),MAXTOPIC);
864 strlcpy(c->setby,setby.c_str(),NICKMAX);
866 /* if the topic text is the same as the current topic,
867 * dont bother to send the TOPIC command out, just silently
868 * update the set time and set nick.
870 if (oldtopic != topic)
871 WriteChannelWithServ((char*)source.c_str(), c, "TOPIC %s :%s", c->name, c->topic);
876 /* all done, send it on its way */
877 params[3] = ":" + params[3];
878 DoOneToAllButSender(source,"FTOPIC",params,source);
883 /* FJOIN, similar to unreal SJOIN */
884 bool ForceJoin(std::string source, std::deque<std::string> params)
886 if (params.size() < 3)
890 char modestring[MAXBUF];
891 char* mode_users[127];
892 mode_users[0] = first;
893 mode_users[1] = modestring;
894 strcpy(mode_users[1],"+");
895 unsigned int modectr = 2;
898 std::string channel = params[0];
899 time_t TS = atoi(params[1].c_str());
902 chanrec* chan = Srv->FindChannel(channel);
907 strlcpy(mode_users[0],channel.c_str(),MAXBUF);
909 /* default is a high value, which if we dont have this
910 * channel will let the other side apply their modes.
912 time_t ourTS = time(NULL)+600;
913 chanrec* us = Srv->FindChannel(channel);
919 log(DEBUG,"FJOIN detected, our TS=%lu, their TS=%lu",ourTS,TS);
921 /* do this first, so our mode reversals are correctly received by other servers
922 * if there is a TS collision.
924 DoOneToAllButSender(source,"FJOIN",params,source);
926 for (unsigned int usernum = 2; usernum < params.size(); usernum++)
928 /* process one channel at a time, applying modes. */
929 char* usr = (char*)params[usernum].c_str();
930 char permissions = *usr;
935 mode_users[modectr++] = usr;
936 strlcat(modestring,"o",MAXBUF);
940 mode_users[modectr++] = usr;
941 strlcat(modestring,"h",MAXBUF);
945 mode_users[modectr++] = usr;
946 strlcat(modestring,"v",MAXBUF);
949 who = Srv->FindNick(usr);
952 Srv->JoinUserToChannel(who,channel,key);
953 if (modectr >= (MAXMODES-1))
955 /* theres a mode for this user. push them onto the mode queue, and flush it
956 * if there are more than MAXMODES to go.
958 if ((ourTS >= TS) || (Srv->IsUlined(who->server)))
960 /* We also always let u-lined clients win, no matter what the TS value */
961 log(DEBUG,"Our our channel newer than theirs, accepting their modes");
962 Srv->SendMode(mode_users,modectr,who);
966 log(DEBUG,"Their channel newer than ours, bouncing their modes");
968 std::deque<std::string> params;
969 /* modes are now being UNSET... */
970 *mode_users[1] = '-';
971 for (unsigned int x = 0; x < modectr; x++)
973 params.push_back(mode_users[x]);
975 // tell everyone to bounce the modes. bad modes, bad!
976 DoOneToMany(Srv->GetServerName(),"FMODE",params);
978 strcpy(mode_users[1],"+");
983 /* there werent enough modes built up to flush it during FJOIN,
984 * or, there are a number left over. flush them out.
986 if ((modectr > 2) && (who))
990 log(DEBUG,"Our our channel newer than theirs, accepting their modes");
991 Srv->SendMode(mode_users,modectr,who);
995 log(DEBUG,"Their channel newer than ours, bouncing their modes");
996 std::deque<std::string> params;
997 *mode_users[1] = '-';
998 for (unsigned int x = 0; x < modectr; x++)
1000 params.push_back(mode_users[x]);
1002 DoOneToMany(Srv->GetServerName(),"FMODE",params);
1009 bool IntroduceClient(std::string source, std::deque<std::string> params)
1011 if (params.size() < 8)
1013 // NICK age nick host dhost ident +modes ip :gecos
1015 std::string nick = params[1];
1016 std::string host = params[2];
1017 std::string dhost = params[3];
1018 std::string ident = params[4];
1019 time_t age = atoi(params[0].c_str());
1020 std::string modes = params[5];
1021 while (*(modes.c_str()) == '+')
1023 char* m = (char*)modes.c_str();
1027 std::string ip = params[6];
1028 std::string gecos = params[7];
1029 char* tempnick = (char*)nick.c_str();
1030 log(DEBUG,"Introduce client %s!%s@%s",tempnick,ident.c_str(),host.c_str());
1032 user_hash::iterator iter;
1033 iter = clientlist.find(tempnick);
1034 if (iter != clientlist.end())
1037 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);
1038 this->WriteLine(":"+Srv->GetServerName()+" KILL "+tempnick+" :Nickname collision");
1042 clientlist[tempnick] = new userrec();
1043 clientlist[tempnick]->fd = FD_MAGIC_NUMBER;
1044 strlcpy(clientlist[tempnick]->nick, tempnick,NICKMAX);
1045 strlcpy(clientlist[tempnick]->host, host.c_str(),160);
1046 strlcpy(clientlist[tempnick]->dhost, dhost.c_str(),160);
1047 clientlist[tempnick]->server = (char*)FindServerNamePtr(source.c_str());
1048 strlcpy(clientlist[tempnick]->ident, ident.c_str(),IDENTMAX);
1049 strlcpy(clientlist[tempnick]->fullname, gecos.c_str(),MAXGECOS);
1050 clientlist[tempnick]->registered = 7;
1051 clientlist[tempnick]->signon = age;
1052 strlcpy(clientlist[tempnick]->modes, modes.c_str(),53);
1053 strlcpy(clientlist[tempnick]->ip,ip.c_str(),16);
1058 for (int i = 0; i < MAXCHANS; i++)
1059 clientlist[tempnick]->chans.push_back(a);
1061 if (!this->bursting)
1063 WriteOpers("*** Client connecting at %s: %s!%s@%s [%s]",clientlist[tempnick]->server,clientlist[tempnick]->nick,clientlist[tempnick]->ident,clientlist[tempnick]->host,clientlist[tempnick]->ip);
1065 params[7] = ":" + params[7];
1066 DoOneToAllButSender(source,"NICK",params,source);
1068 // Increment the Source Servers User Count..
1069 TreeServer* SourceServer = FindServer(source);
1071 SourceServer->AddUserCount();
1077 /* Send one or more FJOINs for a channel of users.
1078 * If the length of a single line is more than 480-NICKMAX
1079 * in length, it is split over multiple lines.
1081 void SendFJoins(TreeServer* Current, chanrec* c)
1083 log(DEBUG,"Sending FJOINs to other server for %s",c->name);
1085 snprintf(list,MAXBUF,":%s FJOIN %s %lu",Srv->GetServerName().c_str(),c->name,(unsigned long)c->age);
1086 std::vector<char*> *ulist = c->GetUsers();
1087 for (unsigned int i = 0; i < ulist->size(); i++)
1089 char* o = (*ulist)[i];
1090 userrec* otheruser = (userrec*)o;
1091 strlcat(list," ",MAXBUF);
1092 strlcat(list,cmode(otheruser,c),MAXBUF);
1093 strlcat(list,otheruser->nick,MAXBUF);
1094 if (strlen(list)>(480-NICKMAX))
1096 log(DEBUG,"FJOIN line wrapped");
1097 this->WriteLine(list);
1098 snprintf(list,MAXBUF,":%s FJOIN %s %lu",Srv->GetServerName().c_str(),c->name,(unsigned long)c->age);
1101 if (list[strlen(list)-1] != ':')
1103 log(DEBUG,"Final FJOIN line");
1104 this->WriteLine(list);
1108 /* Send G, Q, Z and E lines */
1109 void SendXLines(TreeServer* Current)
1112 /* Yes, these arent too nice looking, but they get the job done */
1113 for (std::vector<ZLine>::iterator i = zlines.begin(); i != zlines.end(); i++)
1115 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);
1116 this->WriteLine(data);
1118 for (std::vector<QLine>::iterator i = qlines.begin(); i != qlines.end(); i++)
1120 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);
1121 this->WriteLine(data);
1123 for (std::vector<GLine>::iterator i = glines.begin(); i != glines.end(); i++)
1125 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);
1126 this->WriteLine(data);
1128 for (std::vector<ELine>::iterator i = elines.begin(); i != elines.end(); i++)
1130 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);
1131 this->WriteLine(data);
1133 for (std::vector<ZLine>::iterator i = pzlines.begin(); i != pzlines.end(); i++)
1135 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);
1136 this->WriteLine(data);
1138 for (std::vector<QLine>::iterator i = pqlines.begin(); i != pqlines.end(); i++)
1140 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);
1141 this->WriteLine(data);
1143 for (std::vector<GLine>::iterator i = pglines.begin(); i != pglines.end(); i++)
1145 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);
1146 this->WriteLine(data);
1148 for (std::vector<ELine>::iterator i = pelines.begin(); i != pelines.end(); i++)
1150 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);
1151 this->WriteLine(data);
1155 /* Send channel modes and topics */
1156 void SendChannelModes(TreeServer* Current)
1159 std::deque<std::string> list;
1160 for (chan_hash::iterator c = chanlist.begin(); c != chanlist.end(); c++)
1162 SendFJoins(Current, c->second);
1163 snprintf(data,MAXBUF,":%s FMODE %s +%s",Srv->GetServerName().c_str(),c->second->name,chanmodes(c->second));
1164 this->WriteLine(data);
1165 if (*c->second->topic)
1167 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);
1168 this->WriteLine(data);
1170 for (BanList::iterator b = c->second->bans.begin(); b != c->second->bans.end(); b++)
1172 snprintf(data,MAXBUF,":%s FMODE %s +b %s",Srv->GetServerName().c_str(),c->second->name,b->data);
1173 this->WriteLine(data);
1175 FOREACH_MOD(I_OnSyncChannel,OnSyncChannel(c->second,(Module*)TreeProtocolModule,(void*)this));
1177 c->second->GetExtList(list);
1178 for (unsigned int j = 0; j < list.size(); j++)
1180 FOREACH_MOD(I_OnSyncChannelMetaData,OnSyncChannelMetaData(c->second,(Module*)TreeProtocolModule,(void*)this,list[j]));
1185 /* send all users and their oper state/modes */
1186 void SendUsers(TreeServer* Current)
1189 std::deque<std::string> list;
1190 for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
1192 if (u->second->registered == 7)
1194 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);
1195 this->WriteLine(data);
1196 if (strchr(u->second->modes,'o'))
1198 this->WriteLine(":"+std::string(u->second->nick)+" OPERTYPE "+std::string(u->second->oper));
1200 FOREACH_MOD(I_OnSyncUser,OnSyncUser(u->second,(Module*)TreeProtocolModule,(void*)this));
1202 u->second->GetExtList(list);
1203 for (unsigned int j = 0; j < list.size(); j++)
1205 FOREACH_MOD(I_OnSyncUserMetaData,OnSyncUserMetaData(u->second,(Module*)TreeProtocolModule,(void*)this,list[j]));
1211 /* This function is called when we want to send a netburst to a local
1212 * server. There is a set order we must do this, because for example
1213 * users require their servers to exist, and channels require their
1214 * users to exist. You get the idea.
1216 void DoBurst(TreeServer* s)
1218 Srv->SendOpers("*** Bursting to \2"+s->GetName()+"\2.");
1219 this->WriteLine("BURST");
1220 /* send our version string */
1221 this->WriteLine(":"+Srv->GetServerName()+" VERSION :"+Srv->GetVersion());
1222 /* Send server tree */
1223 this->SendServers(TreeRoot,s,1);
1224 /* Send users and their oper status */
1226 /* Send everything else (channel modes, xlines etc) */
1227 this->SendChannelModes(s);
1228 this->SendXLines(s);
1229 this->WriteLine("ENDBURST");
1230 Srv->SendOpers("*** Finished bursting to \2"+s->GetName()+"\2.");
1233 /* This function is called when we receive data from a remote
1234 * server. We buffer the data in a std::string (it doesnt stay
1235 * there for long), reading using InspSocket::Read() which can
1236 * read up to 16 kilobytes in one operation.
1238 * IF THIS FUNCTION RETURNS FALSE, THE CORE CLOSES AND DELETES
1239 * THE SOCKET OBJECT FOR US.
1241 virtual bool OnDataReady()
1243 char* data = this->Read();
1246 this->in_buffer += data;
1247 /* While there is at least one new line in the buffer,
1248 * do something useful (we hope!) with it.
1250 while (in_buffer.find("\n") != std::string::npos)
1252 char* line = (char*)in_buffer.c_str();
1253 std::string ret = "";
1254 while ((*line != '\n') && (strlen(line)))
1256 if ((*line != '\r') && (*line != '\n'))
1260 if ((*line == '\n') || (*line == '\r'))
1263 /* Process this one, abort if it
1264 * didnt return true.
1270 memset(result,0,1024);
1272 log(DEBUG,"Original string '%s'",ret.c_str());
1273 /* ERROR + CAPAB is still allowed unencryped */
1274 if ((ret.substr(0,7) != "ERROR :") && (ret.substr(0,6) != "CAPAB "))
1276 int nbytes = from64tobits(out, ret.c_str(), 1024);
1277 if ((nbytes > 0) && (nbytes < 1024))
1279 log(DEBUG,"m_spanningtree: decrypt %d bytes",nbytes);
1280 ctx_in->Decrypt(out, result, nbytes, 1);
1281 for (int t = 0; t < nbytes; t++)
1282 if (result[t] == '\7') result[t] = 0;
1287 if (!this->ProcessLine(ret))
1293 return (data != NULL);
1296 int WriteLine(std::string line)
1298 log(DEBUG,"OUT: %s",line.c_str());
1301 log(DEBUG,"AES context");
1303 char result64[10240];
1304 if (this->keylength)
1306 while (line.length() % this->keylength != 0)
1308 // pad it to be a multiple of the key length
1312 unsigned int ll = line.length();
1313 log(DEBUG,"Plaintext line with padding = %d chars",ll);
1314 ctx_out->Encrypt(line.c_str(), result, ll, 1);
1315 log(DEBUG,"Encrypted.");
1316 to64frombits((unsigned char*)result64,(unsigned char*)result,ll);
1318 log(DEBUG,"Encrypted: %s",line.c_str());
1319 //int from64tobits(char *out, const char *in, int maxlen);
1321 return this->Write(line + "\r\n");
1324 /* Handle ERROR command */
1325 bool Error(std::deque<std::string> params)
1327 if (params.size() < 1)
1329 std::string Errmsg = params[0];
1330 std::string SName = myhost;
1331 if (InboundServerName != "")
1333 SName = InboundServerName;
1335 Srv->SendOpers("*** ERROR from "+SName+": "+Errmsg);
1336 /* we will return false to cause the socket to close.
1341 /* Because the core won't let users or even SERVERS set +o,
1342 * we use the OPERTYPE command to do this.
1344 bool OperType(std::string prefix, std::deque<std::string> ¶ms)
1346 if (params.size() != 1)
1348 std::string opertype = params[0];
1349 userrec* u = Srv->FindNick(prefix);
1352 strlcpy(u->oper,opertype.c_str(),NICKMAX);
1353 if (!strchr(u->modes,'o'))
1355 strcat(u->modes,"o");
1357 DoOneToAllButSender(u->nick,"OPERTYPE",params,u->server);
1362 /* Because Andy insists that services-compatible servers must
1363 * implement SVSNICK and SVSJOIN, that's exactly what we do :p
1365 bool ForceNick(std::string prefix, std::deque<std::string> ¶ms)
1367 if (params.size() < 3)
1369 userrec* u = Srv->FindNick(params[0]);
1372 Srv->ChangeUserNick(u,params[1]);
1373 u->age = atoi(params[2].c_str());
1374 DoOneToAllButSender(prefix,"SVSNICK",params,prefix);
1379 bool ServiceJoin(std::string prefix, std::deque<std::string> ¶ms)
1381 if (params.size() < 2)
1383 userrec* u = Srv->FindNick(params[0]);
1386 Srv->JoinUserToChannel(u,params[1],"");
1387 DoOneToAllButSender(prefix,"SVSJOIN",params,prefix);
1392 bool RemoteRehash(std::string prefix, std::deque<std::string> ¶ms)
1394 if (params.size() < 1)
1396 std::string servermask = params[0];
1397 if (Srv->MatchText(Srv->GetServerName(),servermask))
1399 Srv->SendOpers("*** Remote rehash initiated from server \002"+prefix+"\002.");
1400 Srv->RehashServer();
1401 ReadConfiguration(false);
1403 DoOneToAllButSender(prefix,"REHASH",params,prefix);
1407 bool RemoteKill(std::string prefix, std::deque<std::string> ¶ms)
1409 if (params.size() != 2)
1411 std::string nick = params[0];
1412 userrec* u = Srv->FindNick(prefix);
1413 userrec* who = Srv->FindNick(nick);
1416 /* Prepend kill source, if we don't have one */
1417 std::string sourceserv = prefix;
1420 sourceserv = u->server;
1422 if (*(params[1].c_str()) != '[')
1424 params[1] = "[" + sourceserv + "] Killed (" + params[1] +")";
1426 std::string reason = params[1];
1427 params[1] = ":" + params[1];
1428 DoOneToAllButSender(prefix,"KILL",params,sourceserv);
1429 Srv->QuitUser(who,reason);
1434 bool LocalPong(std::string prefix, std::deque<std::string> ¶ms)
1436 if (params.size() < 1)
1438 TreeServer* ServerSource = FindServer(prefix);
1441 ServerSource->SetPingFlag();
1446 bool MetaData(std::string prefix, std::deque<std::string> ¶ms)
1448 if (params.size() < 3)
1450 TreeServer* ServerSource = FindServer(prefix);
1453 if (*(params[0].c_str()) == '#')
1455 chanrec* c = Srv->FindChannel(params[0]);
1458 FOREACH_MOD(I_OnDecodeMetaData,OnDecodeMetaData(TYPE_CHANNEL,c,params[1],params[2]));
1463 userrec* u = Srv->FindNick(params[0]);
1466 FOREACH_MOD(I_OnDecodeMetaData,OnDecodeMetaData(TYPE_USER,u,params[1],params[2]));
1470 params[2] = ":" + params[2];
1471 DoOneToAllButSender(prefix,"METADATA",params,prefix);
1475 bool ServerVersion(std::string prefix, std::deque<std::string> ¶ms)
1477 if (params.size() < 1)
1479 TreeServer* ServerSource = FindServer(prefix);
1482 ServerSource->SetVersion(params[0]);
1484 params[0] = ":" + params[0];
1485 DoOneToAllButSender(prefix,"VERSION",params,prefix);
1489 bool ChangeHost(std::string prefix, std::deque<std::string> ¶ms)
1491 if (params.size() < 1)
1493 userrec* u = Srv->FindNick(prefix);
1496 Srv->ChangeHost(u,params[0]);
1497 DoOneToAllButSender(prefix,"FHOST",params,u->server);
1502 bool AddLine(std::string prefix, std::deque<std::string> ¶ms)
1504 if (params.size() < 6)
1506 std::string linetype = params[0]; /* Z, Q, E, G, K */
1507 std::string mask = params[1]; /* Line type dependent */
1508 std::string source = params[2]; /* may not be online or may be a server */
1509 std::string settime = params[3]; /* EPOCH time set */
1510 std::string duration = params[4]; /* Duration secs */
1511 std::string reason = params[5];
1513 switch (*(linetype.c_str()))
1516 add_zline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1517 zline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1520 add_qline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1521 qline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1524 add_eline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1525 eline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1528 add_gline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1529 gline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1532 add_kline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1535 /* Just in case... */
1536 Srv->SendOpers("*** \2WARNING\2: Invalid xline type '"+linetype+"' sent by server "+prefix+", ignored!");
1539 /* Send it on its way */
1540 params[5] = ":" + params[5];
1541 DoOneToAllButSender(prefix,"ADDLINE",params,prefix);
1545 bool ChangeName(std::string prefix, std::deque<std::string> ¶ms)
1547 if (params.size() < 1)
1549 userrec* u = Srv->FindNick(prefix);
1552 Srv->ChangeGECOS(u,params[0]);
1553 params[0] = ":" + params[0];
1554 DoOneToAllButSender(prefix,"FNAME",params,u->server);
1559 bool Whois(std::string prefix, std::deque<std::string> ¶ms)
1561 if (params.size() < 1)
1563 log(DEBUG,"In IDLE command");
1564 userrec* u = Srv->FindNick(prefix);
1567 log(DEBUG,"USER EXISTS: %s",u->nick);
1568 // an incoming request
1569 if (params.size() == 1)
1571 userrec* x = Srv->FindNick(params[0]);
1572 if ((x) && (x->fd > -1))
1574 userrec* x = Srv->FindNick(params[0]);
1575 log(DEBUG,"Got IDLE");
1576 char signon[MAXBUF];
1578 log(DEBUG,"Sending back IDLE 3");
1579 snprintf(signon,MAXBUF,"%lu",(unsigned long)x->signon);
1580 snprintf(idle,MAXBUF,"%lu",(unsigned long)abs((x->idle_lastmsg)-time(NULL)));
1581 std::deque<std::string> par;
1582 par.push_back(prefix);
1583 par.push_back(signon);
1584 par.push_back(idle);
1585 // ours, we're done, pass it BACK
1586 DoOneToOne(params[0],"IDLE",par,u->server);
1590 // not ours pass it on
1591 DoOneToOne(prefix,"IDLE",params,x->server);
1594 else if (params.size() == 3)
1596 std::string who_did_the_whois = params[0];
1597 userrec* who_to_send_to = Srv->FindNick(who_did_the_whois);
1598 if ((who_to_send_to) && (who_to_send_to->fd > -1))
1600 log(DEBUG,"Got final IDLE");
1601 // an incoming reply to a whois we sent out
1602 std::string nick_whoised = prefix;
1603 unsigned long signon = atoi(params[1].c_str());
1604 unsigned long idle = atoi(params[2].c_str());
1605 if ((who_to_send_to) && (who_to_send_to->fd > -1))
1606 do_whois(who_to_send_to,u,signon,idle,(char*)nick_whoised.c_str());
1610 // not ours, pass it on
1611 DoOneToOne(prefix,"IDLE",params,who_to_send_to->server);
1618 bool LocalPing(std::string prefix, std::deque<std::string> ¶ms)
1620 if (params.size() < 1)
1622 std::string stufftobounce = params[0];
1623 this->WriteLine(":"+Srv->GetServerName()+" PONG "+stufftobounce);
1627 bool RemoteServer(std::string prefix, std::deque<std::string> ¶ms)
1629 if (params.size() < 4)
1631 std::string servername = params[0];
1632 std::string password = params[1];
1633 // hopcount is not used for a remote server, we calculate this ourselves
1634 std::string description = params[3];
1635 TreeServer* ParentOfThis = FindServer(prefix);
1638 this->WriteLine("ERROR :Protocol error - Introduced remote server from unknown server "+prefix);
1641 TreeServer* CheckDupe = FindServer(servername);
1644 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1645 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, already exists on server "+CheckDupe->GetParent()->GetName());
1648 TreeServer* Node = new TreeServer(servername,description,ParentOfThis,NULL);
1649 ParentOfThis->AddChild(Node);
1650 params[3] = ":" + params[3];
1651 DoOneToAllButSender(prefix,"SERVER",params,prefix);
1652 Srv->SendOpers("*** Server \002"+prefix+"\002 introduced server \002"+servername+"\002 ("+description+")");
1656 bool Outbound_Reply_Server(std::deque<std::string> ¶ms)
1658 if (params.size() < 4)
1660 std::string servername = params[0];
1661 std::string password = params[1];
1662 int hops = atoi(params[2].c_str());
1665 this->WriteLine("ERROR :Server too far away for authentication");
1666 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, server is too far away for authentication");
1669 std::string description = params[3];
1670 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1672 if ((x->Name == servername) && (x->RecvPass == password))
1674 TreeServer* CheckDupe = FindServer(servername);
1677 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1678 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, already exists on server "+CheckDupe->GetParent()->GetName());
1681 // Begin the sync here. this kickstarts the
1682 // other side, waiting in WAIT_AUTH_2 state,
1683 // into starting their burst, as it shows
1684 // that we're happy.
1685 this->LinkState = CONNECTED;
1686 // we should add the details of this server now
1687 // to the servers tree, as a child of the root
1689 TreeServer* Node = new TreeServer(servername,description,TreeRoot,this);
1690 TreeRoot->AddChild(Node);
1691 params[3] = ":" + params[3];
1692 DoOneToAllButSender(TreeRoot->GetName(),"SERVER",params,servername);
1693 this->bursting = true;
1694 this->DoBurst(Node);
1698 this->WriteLine("ERROR :Invalid credentials");
1699 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, invalid link credentials");
1703 bool Inbound_Server(std::deque<std::string> ¶ms)
1705 if (params.size() < 4)
1707 std::string servername = params[0];
1708 std::string password = params[1];
1709 int hops = atoi(params[2].c_str());
1712 this->WriteLine("ERROR :Server too far away for authentication");
1713 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, server is too far away for authentication");
1716 std::string description = params[3];
1717 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1719 if ((x->Name == servername) && (x->RecvPass == password))
1721 TreeServer* CheckDupe = FindServer(servername);
1724 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1725 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, already exists on server "+CheckDupe->GetParent()->GetName());
1728 /* If the config says this link is encrypted, but the remote side
1729 * hasnt bothered to send the AES command before SERVER, then we
1730 * boot them off as we MUST have this connection encrypted.
1732 if ((x->EncryptionKey != "") && (!this->ctx_in))
1734 this->WriteLine("ERROR :This link requires AES encryption to be enabled. Plaintext connection refused.");
1735 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, remote server did not enable AES.");
1738 Srv->SendOpers("*** Verified incoming server connection from \002"+servername+"\002["+this->GetIP()+"] ("+description+")");
1739 this->InboundServerName = servername;
1740 this->InboundDescription = description;
1741 // this is good. Send our details: Our server name and description and hopcount of 0,
1742 // along with the sendpass from this block.
1743 this->WriteLine("SERVER "+Srv->GetServerName()+" "+x->SendPass+" 0 :"+Srv->GetServerDescription());
1744 // move to the next state, we are now waiting for THEM.
1745 this->LinkState = WAIT_AUTH_2;
1749 this->WriteLine("ERROR :Invalid credentials");
1750 Srv->SendOpers("*** Server connection from \2"+servername+"\2 denied, invalid link credentials");
1754 void Split(std::string line, bool stripcolon, std::deque<std::string> &n)
1756 if (!strchr(line.c_str(),' '))
1761 std::stringstream s(line);
1762 std::string param = "";
1781 if ((param == ":") && (item > 0))
1804 bool ProcessLine(std::string line)
1806 char* l = (char*)line.c_str();
1807 while ((strlen(l)) && (l[strlen(l)-1] == '\r') || (l[strlen(l)-1] == '\n'))
1808 l[strlen(l)-1] = '\0';
1812 Srv->Log(DEBUG,"IN: "+line);
1813 std::deque<std::string> params;
1814 this->Split(line,true,params);
1815 std::string command = "";
1816 std::string prefix = "";
1817 if (((params[0].c_str())[0] == ':') && (params.size() > 1))
1820 command = params[1];
1821 char* pref = (char*)prefix.c_str();
1829 command = params[0];
1833 if ((!this->ctx_in) && (command == "AES"))
1835 std::string sserv = params[0];
1836 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1838 if ((x->EncryptionKey != "") && (x->Name == sserv))
1840 this->InitAES(x->EncryptionKey,sserv);
1845 else if ((this->ctx_in) && (command == "AES"))
1847 WriteOpers("*** \2AES\2: Encryption already enabled on this connection yet %s is trying to enable it twice!",params[0].c_str());
1850 switch (this->LinkState)
1855 // Waiting for SERVER command from remote server. Server initiating
1856 // the connection sends the first SERVER command, listening server
1857 // replies with theirs if its happy, then if the initiator is happy,
1858 // it starts to send its net sync, which starts the merge, otherwise
1859 // it sends an ERROR.
1860 if (command == "PASS")
1862 /* Silently ignored */
1864 else if (command == "SERVER")
1866 return this->Inbound_Server(params);
1868 else if (command == "ERROR")
1870 return this->Error(params);
1872 else if (command == "USER")
1874 this->WriteLine("ERROR :Client connections to this port are prohibited.");
1877 else if (command == "CAPAB")
1879 return this->Capab(params);
1881 else if ((command == "U") || (command == "S"))
1883 this->WriteLine("ERROR :Cannot use the old-style mesh linking protocol with m_spanningtree.so!");
1888 this->WriteLine("ERROR :Invalid command in negotiation phase.");
1893 // Waiting for start of other side's netmerge to say they liked our
1895 if (command == "SERVER")
1897 // cant do this, they sent it to us in the WAIT_AUTH_1 state!
1901 else if ((command == "U") || (command == "S"))
1903 this->WriteLine("ERROR :Cannot use the old-style mesh linking protocol with m_spanningtree.so!");
1906 else if (command == "BURST")
1908 this->LinkState = CONNECTED;
1909 Node = new TreeServer(InboundServerName,InboundDescription,TreeRoot,this);
1910 TreeRoot->AddChild(Node);
1912 params.push_back(InboundServerName);
1913 params.push_back("*");
1914 params.push_back("1");
1915 params.push_back(":"+InboundDescription);
1916 DoOneToAllButSender(TreeRoot->GetName(),"SERVER",params,InboundServerName);
1917 this->bursting = true;
1918 this->DoBurst(Node);
1920 else if (command == "ERROR")
1922 return this->Error(params);
1924 else if (command == "CAPAB")
1926 return this->Capab(params);
1931 this->WriteLine("ERROR :Internal error -- listening socket accepted its own descriptor!!!");
1935 if (command == "SERVER")
1937 // another server we connected to, which was in WAIT_AUTH_1 state,
1938 // has just sent us their credentials. If we get this far, theyre
1939 // happy with OUR credentials, and they are now in WAIT_AUTH_2 state.
1940 // if we're happy with this, we should send our netburst which
1941 // kickstarts the merge.
1942 return this->Outbound_Reply_Server(params);
1944 else if (command == "ERROR")
1946 return this->Error(params);
1950 // This is the 'authenticated' state, when all passwords
1951 // have been exchanged and anything past this point is taken
1956 std::string direction = prefix;
1957 userrec* t = Srv->FindNick(prefix);
1960 direction = t->server;
1962 TreeServer* route_back_again = BestRouteTo(direction);
1963 if ((!route_back_again) || (route_back_again->GetSocket() != this))
1965 if (route_back_again)
1966 log(DEBUG,"Protocol violation: Fake direction in command '%s' from connection '%s'",line.c_str(),this->GetName().c_str());
1971 if (command == "SVSMODE")
1973 /* Services expects us to implement
1974 * SVSMODE. In inspircd its the same as
1979 std::string target = "";
1980 /* Yes, know, this is a mess. Its reasonably fast though as we're
1981 * working with std::string here.
1983 if ((command == "NICK") && (params.size() > 1))
1985 return this->IntroduceClient(prefix,params);
1987 else if (command == "FJOIN")
1989 return this->ForceJoin(prefix,params);
1991 else if (command == "SERVER")
1993 return this->RemoteServer(prefix,params);
1995 else if (command == "ERROR")
1997 return this->Error(params);
1999 else if (command == "OPERTYPE")
2001 return this->OperType(prefix,params);
2003 else if (command == "FMODE")
2005 return this->ForceMode(prefix,params);
2007 else if (command == "KILL")
2009 return this->RemoteKill(prefix,params);
2011 else if (command == "FTOPIC")
2013 return this->ForceTopic(prefix,params);
2015 else if (command == "REHASH")
2017 return this->RemoteRehash(prefix,params);
2019 else if (command == "METADATA")
2021 return this->MetaData(prefix,params);
2023 else if (command == "PING")
2025 return this->LocalPing(prefix,params);
2027 else if (command == "PONG")
2029 return this->LocalPong(prefix,params);
2031 else if (command == "VERSION")
2033 return this->ServerVersion(prefix,params);
2035 else if (command == "FHOST")
2037 return this->ChangeHost(prefix,params);
2039 else if (command == "FNAME")
2041 return this->ChangeName(prefix,params);
2043 else if (command == "ADDLINE")
2045 return this->AddLine(prefix,params);
2047 else if (command == "SVSNICK")
2051 prefix = this->GetName();
2053 return this->ForceNick(prefix,params);
2055 else if (command == "IDLE")
2057 return this->Whois(prefix,params);
2059 else if (command == "SVSJOIN")
2063 prefix = this->GetName();
2065 return this->ServiceJoin(prefix,params);
2067 else if (command == "SQUIT")
2069 if (params.size() == 2)
2071 this->Squit(FindServer(params[0]),params[1]);
2075 else if (command == "ENDBURST")
2077 this->bursting = false;
2082 // not a special inter-server command.
2083 // Emulate the actual user doing the command,
2084 // this saves us having a huge ugly parser.
2085 userrec* who = Srv->FindNick(prefix);
2086 std::string sourceserv = this->myhost;
2087 if (this->InboundServerName != "")
2089 sourceserv = this->InboundServerName;
2094 target = who->server;
2095 char* strparams[127];
2096 for (unsigned int q = 0; q < params.size(); q++)
2098 strparams[q] = (char*)params[q].c_str();
2100 Srv->CallCommandHandler(command, strparams, params.size(), who);
2104 // its not a user. Its either a server, or somethings screwed up.
2105 if (IsServer(prefix))
2107 target = Srv->GetServerName();
2111 log(DEBUG,"Command with unknown origin '%s'",prefix.c_str());
2115 return DoOneToAllButSenderRaw(line,sourceserv,prefix,command,params);
2124 virtual std::string GetName()
2126 std::string sourceserv = this->myhost;
2127 if (this->InboundServerName != "")
2129 sourceserv = this->InboundServerName;
2134 virtual void OnTimeout()
2136 if (this->LinkState == CONNECTING)
2138 Srv->SendOpers("*** CONNECT: Connection to \002"+myhost+"\002 timed out.");
2142 virtual void OnClose()
2144 // Connection closed.
2145 // If the connection is fully up (state CONNECTED)
2146 // then propogate a netsplit to all peers.
2147 std::string quitserver = this->myhost;
2148 if (this->InboundServerName != "")
2150 quitserver = this->InboundServerName;
2152 TreeServer* s = FindServer(quitserver);
2155 Squit(s,"Remote host closed the connection");
2157 WriteOpers("Server '\2%s\2[%s]' closed the connection.",quitserver.c_str(),this->GetIP().c_str());
2160 virtual int OnIncomingConnection(int newsock, char* ip)
2162 TreeSocket* s = new TreeSocket(newsock, ip);
2168 void AddThisServer(TreeServer* server, std::deque<TreeServer*> &list)
2170 for (unsigned int c = 0; c < list.size(); c++)
2172 if (list[c] == server)
2177 list.push_back(server);
2180 // returns a list of DIRECT servernames for a specific channel
2181 void GetListOfServersForChannel(chanrec* c, std::deque<TreeServer*> &list)
2183 std::vector<char*> *ulist = c->GetUsers();
2184 unsigned int ucount = ulist->size();
2185 for (unsigned int i = 0; i < ucount; i++)
2187 char* o = (*ulist)[i];
2188 userrec* otheruser = (userrec*)o;
2189 if (otheruser->fd < 0)
2191 TreeServer* best = BestRouteTo(otheruser->server);
2193 AddThisServer(best,list);
2199 bool DoOneToAllButSenderRaw(std::string data, std::string omit, std::string prefix, std::string command, std::deque<std::string> ¶ms)
2201 TreeServer* omitroute = BestRouteTo(omit);
2202 if ((command == "NOTICE") || (command == "PRIVMSG"))
2204 if ((params.size() >= 2) && (*(params[0].c_str()) != '$'))
2206 if (*(params[0].c_str()) != '#')
2208 // special routing for private messages/notices
2209 userrec* d = Srv->FindNick(params[0]);
2212 std::deque<std::string> par;
2213 par.push_back(params[0]);
2214 par.push_back(":"+params[1]);
2215 DoOneToOne(prefix,command,par,d->server);
2221 log(DEBUG,"Channel privmsg going to chan %s",params[0].c_str());
2222 chanrec* c = Srv->FindChannel(params[0]);
2225 std::deque<TreeServer*> list;
2226 GetListOfServersForChannel(c,list);
2227 log(DEBUG,"Got a list of %d servers",list.size());
2228 unsigned int lsize = list.size();
2229 for (unsigned int i = 0; i < lsize; i++)
2231 TreeSocket* Sock = list[i]->GetSocket();
2232 if ((Sock) && (list[i]->GetName() != omit) && (omitroute != list[i]))
2234 log(DEBUG,"Writing privmsg to server %s",list[i]->GetName().c_str());
2235 Sock->WriteLine(data);
2243 unsigned int items = TreeRoot->ChildCount();
2244 for (unsigned int x = 0; x < items; x++)
2246 TreeServer* Route = TreeRoot->GetChild(x);
2247 if ((Route->GetSocket()) && (Route->GetName() != omit) && (omitroute != Route))
2249 TreeSocket* Sock = Route->GetSocket();
2250 Sock->WriteLine(data);
2256 bool DoOneToAllButSender(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string omit)
2258 TreeServer* omitroute = BestRouteTo(omit);
2259 std::string FullLine = ":" + prefix + " " + command;
2260 unsigned int words = params.size();
2261 for (unsigned int x = 0; x < words; x++)
2263 FullLine = FullLine + " " + params[x];
2265 unsigned int items = TreeRoot->ChildCount();
2266 for (unsigned int x = 0; x < items; x++)
2268 TreeServer* Route = TreeRoot->GetChild(x);
2269 // Send the line IF:
2270 // The route has a socket (its a direct connection)
2271 // The route isnt the one to be omitted
2272 // The route isnt the path to the one to be omitted
2273 if ((Route->GetSocket()) && (Route->GetName() != omit) && (omitroute != Route))
2275 TreeSocket* Sock = Route->GetSocket();
2276 Sock->WriteLine(FullLine);
2282 bool DoOneToMany(std::string prefix, std::string command, std::deque<std::string> ¶ms)
2284 std::string FullLine = ":" + prefix + " " + command;
2285 unsigned int words = params.size();
2286 for (unsigned int x = 0; x < words; x++)
2288 FullLine = FullLine + " " + params[x];
2290 unsigned int items = TreeRoot->ChildCount();
2291 for (unsigned int x = 0; x < items; x++)
2293 TreeServer* Route = TreeRoot->GetChild(x);
2294 if (Route->GetSocket())
2296 TreeSocket* Sock = Route->GetSocket();
2297 Sock->WriteLine(FullLine);
2303 bool DoOneToOne(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string target)
2305 TreeServer* Route = BestRouteTo(target);
2308 std::string FullLine = ":" + prefix + " " + command;
2309 unsigned int words = params.size();
2310 for (unsigned int x = 0; x < words; x++)
2312 FullLine = FullLine + " " + params[x];
2314 if (Route->GetSocket())
2316 TreeSocket* Sock = Route->GetSocket();
2317 Sock->WriteLine(FullLine);
2327 std::vector<TreeSocket*> Bindings;
2329 void ReadConfiguration(bool rebind)
2331 Conf = new ConfigReader;
2334 for (int j =0; j < Conf->Enumerate("bind"); j++)
2336 std::string Type = Conf->ReadValue("bind","type",j);
2337 std::string IP = Conf->ReadValue("bind","address",j);
2338 long Port = Conf->ReadInteger("bind","port",j,true);
2339 if (Type == "servers")
2345 TreeSocket* listener = new TreeSocket(IP.c_str(),Port,true,10);
2346 if (listener->GetState() == I_LISTENING)
2348 Srv->AddSocket(listener);
2349 Bindings.push_back(listener);
2353 log(DEFAULT,"m_spanningtree: Warning: Failed to bind server port %d",Port);
2361 for (int j =0; j < Conf->Enumerate("link"); j++)
2364 L.Name = Conf->ReadValue("link","name",j);
2365 L.IPAddr = Conf->ReadValue("link","ipaddr",j);
2366 L.Port = Conf->ReadInteger("link","port",j,true);
2367 L.SendPass = Conf->ReadValue("link","sendpass",j);
2368 L.RecvPass = Conf->ReadValue("link","recvpass",j);
2369 L.AutoConnect = Conf->ReadInteger("link","autoconnect",j,true);
2370 L.EncryptionKey = Conf->ReadValue("link","encryptionkey",j);
2371 L.NextConnectTime = time(NULL) + L.AutoConnect;
2372 /* Bugfix by brain, do not allow people to enter bad configurations */
2373 if ((L.RecvPass != "") && (L.SendPass != "") && (L.Name != "") && (L.Port))
2375 LinkBlocks.push_back(L);
2376 log(DEBUG,"m_spanningtree: Read server %s with host %s:%d",L.Name.c_str(),L.IPAddr.c_str(),L.Port);
2380 if (L.RecvPass == "")
2382 log(DEFAULT,"Invalid configuration for server '%s', recvpass not defined!",L.Name.c_str());
2384 else if (L.SendPass == "")
2386 log(DEFAULT,"Invalid configuration for server '%s', sendpass not defined!",L.Name.c_str());
2388 else if (L.Name == "")
2390 log(DEFAULT,"Invalid configuration, link tag without a name!");
2394 log(DEFAULT,"Invalid configuration for server '%s', no port specified!",L.Name.c_str());
2402 class ModuleSpanningTree : public Module
2404 std::vector<TreeSocket*> Bindings;
2410 ModuleSpanningTree(Server* Me)
2411 : Module::Module(Me)
2416 // Create the root of the tree
2417 TreeRoot = new TreeServer(Srv->GetServerName(),Srv->GetServerDescription());
2419 ReadConfiguration(true);
2422 void ShowLinks(TreeServer* Current, userrec* user, int hops)
2424 std::string Parent = TreeRoot->GetName();
2425 if (Current->GetParent())
2427 Parent = Current->GetParent()->GetName();
2429 for (unsigned int q = 0; q < Current->ChildCount(); q++)
2431 ShowLinks(Current->GetChild(q),user,hops+1);
2433 WriteServ(user->fd,"364 %s %s %s :%d %s",user->nick,Current->GetName().c_str(),Parent.c_str(),hops,Current->GetDesc().c_str());
2436 int CountLocalServs()
2438 return TreeRoot->ChildCount();
2443 return serverlist.size();
2446 void HandleLinks(char** parameters, int pcnt, userrec* user)
2448 ShowLinks(TreeRoot,user,0);
2449 WriteServ(user->fd,"365 %s * :End of /LINKS list.",user->nick);
2453 void HandleLusers(char** parameters, int pcnt, userrec* user)
2455 WriteServ(user->fd,"251 %s :There are %d users and %d invisible on %d servers",user->nick,usercnt()-usercount_invisible(),usercount_invisible(),this->CountServs());
2456 WriteServ(user->fd,"252 %s %d :operator(s) online",user->nick,usercount_opers());
2457 WriteServ(user->fd,"253 %s %d :unknown connections",user->nick,usercount_unknown());
2458 WriteServ(user->fd,"254 %s %d :channels formed",user->nick,chancount());
2459 WriteServ(user->fd,"254 %s :I have %d clients and %d servers",user->nick,local_count(),this->CountLocalServs());
2463 // WARNING: NOT THREAD SAFE - DONT GET ANY SMART IDEAS.
2465 void ShowMap(TreeServer* Current, userrec* user, int depth, char matrix[128][80])
2469 for (int t = 0; t < depth; t++)
2471 matrix[line][t] = ' ';
2474 // For Aligning, we need to work out exactly how deep this thing is, and produce
2475 // a 'Spacer' String to compensate.
2478 memset(spacer,' ',40);
2479 if ((40 - Current->GetName().length() - depth) > 1) {
2480 spacer[40 - Current->GetName().length() - depth] = '\0';
2489 if (clientlist.size() == 0) {
2490 // If there are no users, WHO THE HELL DID THE /MAP?!?!?!
2495 percent = ((float)Current->GetUserCount() / (float)clientlist.size()) * 100;
2497 snprintf(text, 80, "%s %s%5d [%5.2f%%]", Current->GetName().c_str(), spacer, Current->GetUserCount(), percent);
2498 strlcpy(&matrix[line][depth],text,80);
2500 for (unsigned int q = 0; q < Current->ChildCount(); q++)
2502 ShowMap(Current->GetChild(q),user,depth+2,matrix);
2507 // Ok, prepare to be confused.
2508 // After much mulling over how to approach this, it struck me that
2509 // the 'usual' way of doing a /MAP isnt the best way. Instead of
2510 // keeping track of a ton of ascii characters, and line by line
2511 // under recursion working out where to place them using multiplications
2512 // and divisons, we instead render the map onto a backplane of characters
2513 // (a character matrix), then draw the branches as a series of "L" shapes
2514 // from the nodes. This is not only friendlier on CPU it uses less stack.
2516 void HandleMap(char** parameters, int pcnt, userrec* user)
2518 // This array represents a virtual screen which we will
2519 // "scratch" draw to, as the console device of an irc
2520 // client does not provide for a proper terminal.
2521 char matrix[128][80];
2522 for (unsigned int t = 0; t < 128; t++)
2524 matrix[t][0] = '\0';
2527 // The only recursive bit is called here.
2528 ShowMap(TreeRoot,user,0,matrix);
2529 // Process each line one by one. The algorithm has a limit of
2530 // 128 servers (which is far more than a spanning tree should have
2531 // anyway, so we're ok). This limit can be raised simply by making
2532 // the character matrix deeper, 128 rows taking 10k of memory.
2533 for (int l = 1; l < line; l++)
2535 // scan across the line looking for the start of the
2536 // servername (the recursive part of the algorithm has placed
2537 // the servers at indented positions depending on what they
2539 int first_nonspace = 0;
2540 while (matrix[l][first_nonspace] == ' ')
2545 // Draw the `- (corner) section: this may be overwritten by
2546 // another L shape passing along the same vertical pane, becoming
2547 // a |- (branch) section instead.
2548 matrix[l][first_nonspace] = '-';
2549 matrix[l][first_nonspace-1] = '`';
2551 // Draw upwards until we hit the parent server, causing possibly
2552 // other corners (`-) to become branches (|-)
2553 while ((matrix[l2][first_nonspace-1] == ' ') || (matrix[l2][first_nonspace-1] == '`'))
2555 matrix[l2][first_nonspace-1] = '|';
2559 // dump the whole lot to the user. This is the easy bit, honest.
2560 for (int t = 0; t < line; t++)
2562 WriteServ(user->fd,"006 %s :%s",user->nick,&matrix[t][0]);
2564 WriteServ(user->fd,"007 %s :End of /MAP",user->nick);
2568 int HandleSquit(char** parameters, int pcnt, userrec* user)
2570 TreeServer* s = FindServerMask(parameters[0]);
2575 WriteServ(user->fd,"NOTICE %s :*** SQUIT: Foolish mortal, you cannot make a server SQUIT itself! (%s matches local server name)",user->nick,parameters[0]);
2578 TreeSocket* sock = s->GetSocket();
2581 log(DEBUG,"Splitting server %s",s->GetName().c_str());
2582 WriteOpers("*** SQUIT: Server \002%s\002 removed from network by %s",parameters[0],user->nick);
2583 sock->Squit(s,"Server quit by "+std::string(user->nick)+"!"+std::string(user->ident)+"@"+std::string(user->host));
2588 WriteServ(user->fd,"NOTICE %s :*** SQUIT: The server \002%s\002 is not directly connected.",user->nick,parameters[0]);
2593 WriteServ(user->fd,"NOTICE %s :*** SQUIT: The server \002%s\002 does not exist on the network.",user->nick,parameters[0]);
2598 int HandleRemoteWhois(char** parameters, int pcnt, userrec* user)
2600 if ((user->fd > -1) && (pcnt > 1))
2602 userrec* remote = Srv->FindNick(parameters[1]);
2603 if ((remote) && (remote->fd < 0))
2605 std::deque<std::string> params;
2606 params.push_back(parameters[1]);
2607 DoOneToOne(user->nick,"IDLE",params,remote->server);
2612 WriteServ(user->fd,"401 %s %s :No such nick/channel",user->nick, parameters[1]);
2613 WriteServ(user->fd,"318 %s %s :End of /WHOIS list.",user->nick, parameters[1]);
2620 void DoPingChecks(time_t curtime)
2622 for (unsigned int j = 0; j < TreeRoot->ChildCount(); j++)
2624 TreeServer* serv = TreeRoot->GetChild(j);
2625 TreeSocket* sock = serv->GetSocket();
2628 if (curtime >= serv->NextPingTime())
2630 if (serv->AnsweredLastPing())
2632 sock->WriteLine(":"+Srv->GetServerName()+" PING "+serv->GetName());
2633 serv->SetNextPingTime(curtime + 60);
2637 // they didnt answer, boot them
2638 WriteOpers("*** Server \002%s\002 pinged out",serv->GetName().c_str());
2639 sock->Squit(serv,"Ping timeout");
2648 void AutoConnectServers(time_t curtime)
2650 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
2652 if ((x->AutoConnect) && (curtime >= x->NextConnectTime))
2654 log(DEBUG,"Auto-Connecting %s",x->Name.c_str());
2655 x->NextConnectTime = curtime + x->AutoConnect;
2656 TreeServer* CheckDupe = FindServer(x->Name);
2659 // an autoconnected server is not connected. Check if its time to connect it
2660 WriteOpers("*** AUTOCONNECT: Auto-connecting server \002%s\002 (%lu seconds until next attempt)",x->Name.c_str(),x->AutoConnect);
2661 TreeSocket* newsocket = new TreeSocket(x->IPAddr,x->Port,false,10,x->Name);
2662 Srv->AddSocket(newsocket);
2668 int HandleVersion(char** parameters, int pcnt, userrec* user)
2670 // we've already checked if pcnt > 0, so this is safe
2671 TreeServer* found = FindServerMask(parameters[0]);
2674 std::string Version = found->GetVersion();
2675 WriteServ(user->fd,"351 %s :%s",user->nick,Version.c_str());
2676 if (found == TreeRoot)
2678 std::stringstream out(Config->data005);
2679 std::string token = "";
2680 std::string line5 = "";
2681 int token_counter = 0;
2685 line5 = line5 + token + " ";
2687 if ((token_counter >= 13) || (out.eof() == true))
2689 WriteServ(user->fd,"005 %s %s:are supported by this server",user->nick,line5.c_str());
2698 WriteServ(user->fd,"402 %s %s :No such server",user->nick,parameters[0]);
2703 int HandleConnect(char** parameters, int pcnt, userrec* user)
2705 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
2707 if (Srv->MatchText(x->Name.c_str(),parameters[0]))
2709 TreeServer* CheckDupe = FindServer(x->Name);
2712 WriteServ(user->fd,"NOTICE %s :*** CONNECT: Connecting to server: \002%s\002 (%s:%d)",user->nick,x->Name.c_str(),x->IPAddr.c_str(),x->Port);
2713 TreeSocket* newsocket = new TreeSocket(x->IPAddr,x->Port,false,10,x->Name);
2714 Srv->AddSocket(newsocket);
2719 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());
2724 WriteServ(user->fd,"NOTICE %s :*** CONNECT: No server matching \002%s\002 could be found in the config file.",user->nick,parameters[0]);
2728 virtual int OnStats(char statschar, userrec* user)
2730 if (statschar == 'c')
2732 for (unsigned int i = 0; i < LinkBlocks.size(); i++)
2734 WriteServ(user->fd,"213 %s C *@%s * %s %d 0 %c%c%c",user->nick,LinkBlocks[i].IPAddr.c_str(),LinkBlocks[i].Name.c_str(),LinkBlocks[i].Port,(LinkBlocks[i].EncryptionKey != "" ? 'e' : '-'),(LinkBlocks[i].AutoConnect ? 'a' : '-'),'s');
2735 WriteServ(user->fd,"244 %s H * * %s",user->nick,LinkBlocks[i].Name.c_str());
2737 WriteServ(user->fd,"219 %s %c :End of /STATS report",user->nick,statschar);
2738 WriteOpers("*** Notice: Stats '%c' requested by %s (%s@%s)",statschar,user->nick,user->ident,user->host);
2744 virtual int OnPreCommand(std::string command, char **parameters, int pcnt, userrec *user, bool validated)
2746 /* If the command doesnt appear to be valid, we dont want to mess with it. */
2750 if (command == "CONNECT")
2752 return this->HandleConnect(parameters,pcnt,user);
2754 else if (command == "SQUIT")
2756 return this->HandleSquit(parameters,pcnt,user);
2758 else if (command == "MAP")
2760 this->HandleMap(parameters,pcnt,user);
2763 else if (command == "LUSERS")
2765 this->HandleLusers(parameters,pcnt,user);
2768 else if (command == "LINKS")
2770 this->HandleLinks(parameters,pcnt,user);
2773 else if (command == "WHOIS")
2778 return this->HandleRemoteWhois(parameters,pcnt,user);
2781 else if ((command == "VERSION") && (pcnt > 0))
2783 this->HandleVersion(parameters,pcnt,user);
2786 else if (Srv->IsValidModuleCommand(command, pcnt, user))
2788 // this bit of code cleverly routes all module commands
2789 // to all remote severs *automatically* so that modules
2790 // can just handle commands locally, without having
2791 // to have any special provision in place for remote
2792 // commands and linking protocols.
2793 std::deque<std::string> params;
2795 for (int j = 0; j < pcnt; j++)
2797 if (strchr(parameters[j],' '))
2799 params.push_back(":" + std::string(parameters[j]));
2803 params.push_back(std::string(parameters[j]));
2806 DoOneToMany(user->nick,command,params);
2811 virtual void OnGetServerDescription(std::string servername,std::string &description)
2813 TreeServer* s = FindServer(servername);
2816 description = s->GetDesc();
2820 virtual void OnUserInvite(userrec* source,userrec* dest,chanrec* channel)
2822 if (source->fd > -1)
2824 std::deque<std::string> params;
2825 params.push_back(dest->nick);
2826 params.push_back(channel->name);
2827 DoOneToMany(source->nick,"INVITE",params);
2831 virtual void OnPostLocalTopicChange(userrec* user, chanrec* chan, std::string topic)
2833 std::deque<std::string> params;
2834 params.push_back(chan->name);
2835 params.push_back(":"+topic);
2836 DoOneToMany(user->nick,"TOPIC",params);
2839 virtual void OnWallops(userrec* user, std::string text)
2843 std::deque<std::string> params;
2844 params.push_back(":"+text);
2845 DoOneToMany(user->nick,"WALLOPS",params);
2849 virtual void OnUserNotice(userrec* user, void* dest, int target_type, std::string text)
2851 if (target_type == TYPE_USER)
2853 userrec* d = (userrec*)dest;
2854 if ((d->fd < 0) && (user->fd > -1))
2856 std::deque<std::string> params;
2858 params.push_back(d->nick);
2859 params.push_back(":"+text);
2860 DoOneToOne(user->nick,"NOTICE",params,d->server);
2867 chanrec *c = (chanrec*)dest;
2868 std::deque<TreeServer*> list;
2869 GetListOfServersForChannel(c,list);
2870 unsigned int ucount = list.size();
2871 for (unsigned int i = 0; i < ucount; i++)
2873 TreeSocket* Sock = list[i]->GetSocket();
2875 Sock->WriteLine(":"+std::string(user->nick)+" NOTICE "+std::string(c->name)+" :"+text);
2881 virtual void OnUserMessage(userrec* user, void* dest, int target_type, std::string text)
2883 if (target_type == TYPE_USER)
2885 // route private messages which are targetted at clients only to the server
2886 // which needs to receive them
2887 userrec* d = (userrec*)dest;
2888 if ((d->fd < 0) && (user->fd > -1))
2890 std::deque<std::string> params;
2892 params.push_back(d->nick);
2893 params.push_back(":"+text);
2894 DoOneToOne(user->nick,"PRIVMSG",params,d->server);
2901 chanrec *c = (chanrec*)dest;
2902 std::deque<TreeServer*> list;
2903 GetListOfServersForChannel(c,list);
2904 unsigned int ucount = list.size();
2905 for (unsigned int i = 0; i < ucount; i++)
2907 TreeSocket* Sock = list[i]->GetSocket();
2909 Sock->WriteLine(":"+std::string(user->nick)+" PRIVMSG "+std::string(c->name)+" :"+text);
2915 virtual void OnBackgroundTimer(time_t curtime)
2917 AutoConnectServers(curtime);
2918 DoPingChecks(curtime);
2921 virtual void OnUserJoin(userrec* user, chanrec* channel)
2923 // Only do this for local users
2926 std::deque<std::string> params;
2928 params.push_back(channel->name);
2931 // if the channel has a key, force the join by emulating the key.
2932 params.push_back(channel->key);
2934 if (channel->GetUserCounter() > 1)
2936 // not the first in the channel
2937 DoOneToMany(user->nick,"JOIN",params);
2941 // first in the channel, set up their permissions
2942 // and the channel TS with FJOIN.
2944 snprintf(ts,24,"%lu",(unsigned long)channel->age);
2946 params.push_back(channel->name);
2947 params.push_back(ts);
2948 params.push_back("@"+std::string(user->nick));
2949 DoOneToMany(Srv->GetServerName(),"FJOIN",params);
2954 virtual void OnChangeHost(userrec* user, std::string newhost)
2956 // only occurs for local clients
2957 if (user->registered != 7)
2959 std::deque<std::string> params;
2960 params.push_back(newhost);
2961 DoOneToMany(user->nick,"FHOST",params);
2964 virtual void OnChangeName(userrec* user, std::string gecos)
2966 // only occurs for local clients
2967 if (user->registered != 7)
2969 std::deque<std::string> params;
2970 params.push_back(gecos);
2971 DoOneToMany(user->nick,"FNAME",params);
2974 virtual void OnUserPart(userrec* user, chanrec* channel)
2978 std::deque<std::string> params;
2979 params.push_back(channel->name);
2980 DoOneToMany(user->nick,"PART",params);
2984 virtual void OnUserConnect(userrec* user)
2986 char agestr[MAXBUF];
2989 std::deque<std::string> params;
2990 snprintf(agestr,MAXBUF,"%lu",(unsigned long)user->age);
2991 params.push_back(agestr);
2992 params.push_back(user->nick);
2993 params.push_back(user->host);
2994 params.push_back(user->dhost);
2995 params.push_back(user->ident);
2996 params.push_back("+"+std::string(user->modes));
2997 params.push_back(user->ip);
2998 params.push_back(":"+std::string(user->fullname));
2999 DoOneToMany(Srv->GetServerName(),"NICK",params);
3001 // User is Local, change needs to be reflected!
3002 TreeServer* SourceServer = FindServer(user->server);
3004 SourceServer->AddUserCount();
3010 virtual void OnUserQuit(userrec* user, std::string reason)
3012 if ((user->fd > -1) && (user->registered == 7))
3014 std::deque<std::string> params;
3015 params.push_back(":"+reason);
3016 DoOneToMany(user->nick,"QUIT",params);
3018 // Regardless, We need to modify the user Counts..
3019 TreeServer* SourceServer = FindServer(user->server);
3021 SourceServer->DelUserCount();
3026 virtual void OnUserPostNick(userrec* user, std::string oldnick)
3030 std::deque<std::string> params;
3031 params.push_back(user->nick);
3032 DoOneToMany(oldnick,"NICK",params);
3036 virtual void OnUserKick(userrec* source, userrec* user, chanrec* chan, std::string reason)
3038 if (source->fd > -1)
3040 std::deque<std::string> params;
3041 params.push_back(chan->name);
3042 params.push_back(user->nick);
3043 params.push_back(":"+reason);
3044 DoOneToMany(source->nick,"KICK",params);
3048 virtual void OnRemoteKill(userrec* source, userrec* dest, std::string reason)
3050 std::deque<std::string> params;
3051 params.push_back(dest->nick);
3052 params.push_back(":"+reason);
3053 DoOneToMany(source->nick,"KILL",params);
3056 virtual void OnRehash(std::string parameter)
3058 if (parameter != "")
3060 std::deque<std::string> params;
3061 params.push_back(parameter);
3062 DoOneToMany(Srv->GetServerName(),"REHASH",params);
3064 if (Srv->MatchText(Srv->GetServerName(),parameter))
3066 Srv->SendOpers("*** Remote rehash initiated from server \002"+Srv->GetServerName()+"\002.");
3067 Srv->RehashServer();
3070 ReadConfiguration(false);
3073 // note: the protocol does not allow direct umode +o except
3074 // via NICK with 8 params. sending OPERTYPE infers +o modechange
3076 virtual void OnOper(userrec* user, std::string opertype)
3080 std::deque<std::string> params;
3081 params.push_back(opertype);
3082 DoOneToMany(user->nick,"OPERTYPE",params);
3086 void OnLine(userrec* source, std::string host, bool adding, char linetype, long duration, std::string reason)
3088 if (source->fd > -1)
3091 snprintf(type,8,"%cLINE",linetype);
3092 std::string stype = type;
3095 char sduration[MAXBUF];
3096 snprintf(sduration,MAXBUF,"%ld",duration);
3097 std::deque<std::string> params;
3098 params.push_back(host);
3099 params.push_back(sduration);
3100 params.push_back(":"+reason);
3101 DoOneToMany(source->nick,stype,params);
3105 std::deque<std::string> params;
3106 params.push_back(host);
3107 DoOneToMany(source->nick,stype,params);
3112 virtual void OnAddGLine(long duration, userrec* source, std::string reason, std::string hostmask)
3114 OnLine(source,hostmask,true,'G',duration,reason);
3117 virtual void OnAddZLine(long duration, userrec* source, std::string reason, std::string ipmask)
3119 OnLine(source,ipmask,true,'Z',duration,reason);
3122 virtual void OnAddQLine(long duration, userrec* source, std::string reason, std::string nickmask)
3124 OnLine(source,nickmask,true,'Q',duration,reason);
3127 virtual void OnAddELine(long duration, userrec* source, std::string reason, std::string hostmask)
3129 OnLine(source,hostmask,true,'E',duration,reason);
3132 virtual void OnDelGLine(userrec* source, std::string hostmask)
3134 OnLine(source,hostmask,false,'G',0,"");
3137 virtual void OnDelZLine(userrec* source, std::string ipmask)
3139 OnLine(source,ipmask,false,'Z',0,"");
3142 virtual void OnDelQLine(userrec* source, std::string nickmask)
3144 OnLine(source,nickmask,false,'Q',0,"");
3147 virtual void OnDelELine(userrec* source, std::string hostmask)
3149 OnLine(source,hostmask,false,'E',0,"");
3152 virtual void OnMode(userrec* user, void* dest, int target_type, std::string text)
3154 if ((user->fd > -1) && (user->registered == 7))
3156 if (target_type == TYPE_USER)
3158 userrec* u = (userrec*)dest;
3159 std::deque<std::string> params;
3160 params.push_back(u->nick);
3161 params.push_back(text);
3162 DoOneToMany(user->nick,"MODE",params);
3166 chanrec* c = (chanrec*)dest;
3167 std::deque<std::string> params;
3168 params.push_back(c->name);
3169 params.push_back(text);
3170 DoOneToMany(user->nick,"MODE",params);
3175 virtual void ProtoSendMode(void* opaque, int target_type, void* target, std::string modeline)
3177 TreeSocket* s = (TreeSocket*)opaque;
3180 if (target_type == TYPE_USER)
3182 userrec* u = (userrec*)target;
3183 s->WriteLine(":"+Srv->GetServerName()+" FMODE "+u->nick+" "+modeline);
3187 chanrec* c = (chanrec*)target;
3188 s->WriteLine(":"+Srv->GetServerName()+" FMODE "+c->name+" "+modeline);
3193 virtual void ProtoSendMetaData(void* opaque, int target_type, void* target, std::string extname, std::string extdata)
3195 TreeSocket* s = (TreeSocket*)opaque;
3198 if (target_type == TYPE_USER)
3200 userrec* u = (userrec*)target;
3201 s->WriteLine(":"+Srv->GetServerName()+" METADATA "+u->nick+" "+extname+" :"+extdata);
3205 chanrec* c = (chanrec*)target;
3206 s->WriteLine(":"+Srv->GetServerName()+" METADATA "+c->name+" "+extname+" :"+extdata);
3211 virtual ~ModuleSpanningTree()
3215 virtual Version GetVersion()
3217 return Version(1,0,0,0,VF_STATIC|VF_VENDOR);
3220 void Implements(char* List)
3222 List[I_OnPreCommand] = List[I_OnGetServerDescription] = List[I_OnUserInvite] = List[I_OnPostLocalTopicChange] = 1;
3223 List[I_OnWallops] = List[I_OnUserNotice] = List[I_OnUserMessage] = List[I_OnBackgroundTimer] = 1;
3224 List[I_OnUserJoin] = List[I_OnChangeHost] = List[I_OnChangeName] = List[I_OnUserPart] = List[I_OnUserConnect] = 1;
3225 List[I_OnUserQuit] = List[I_OnUserPostNick] = List[I_OnUserKick] = List[I_OnRemoteKill] = List[I_OnRehash] = 1;
3226 List[I_OnOper] = List[I_OnAddGLine] = List[I_OnAddZLine] = List[I_OnAddQLine] = List[I_OnAddELine] = 1;
3227 List[I_OnDelGLine] = List[I_OnDelZLine] = List[I_OnDelQLine] = List[I_OnDelELine] = List[I_ProtoSendMode] = List[I_OnMode] = 1;
3228 List[I_OnStats] = List[I_ProtoSendMetaData] = 1;
3231 /* It is IMPORTANT that m_spanningtree is the last module in the chain
3232 * so that any activity it sees is FINAL, e.g. we arent going to send out
3233 * a NICK message before m_cloaking has finished putting the +x on the user,
3235 * Therefore, we return PRIORITY_LAST to make sure we end up at the END of
3236 * the module call queue.
3238 Priority Prioritize()
3240 return PRIORITY_LAST;
3245 class ModuleSpanningTreeFactory : public ModuleFactory
3248 ModuleSpanningTreeFactory()
3252 ~ModuleSpanningTreeFactory()
3256 virtual Module * CreateModule(Server* Me)
3258 TreeProtocolModule = new ModuleSpanningTree(Me);
3259 return TreeProtocolModule;
3265 extern "C" void * init_module( void )
3267 return new ModuleSpanningTreeFactory;