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"
46 #define nspace __gnu_cxx
52 * The server list in InspIRCd is maintained as two structures
53 * which hold the data in different ways. Most of the time, we
54 * want to very quicky obtain three pieces of information:
56 * (1) The information on a server
57 * (2) The information on the server we must send data through
58 * to actually REACH the server we're after
59 * (3) Potentially, the child/parent objects of this server
61 * The InspIRCd spanning protocol provides easy access to these
62 * by storing the data firstly in a recursive structure, where
63 * each item references its parent item, and a dynamic list
64 * of child items, and another structure which stores the items
65 * hashed, linearly. This means that if we want to find a server
66 * by name quickly, we can look it up in the hash, avoiding
67 * any O(n) lookups. If however, during a split or sync, we want
68 * to apply an operation to a server, and any of its child objects
69 * we can resort to recursion to walk the tree structure.
72 class ModuleSpanningTree;
73 static ModuleSpanningTree* TreeProtocolModule;
75 extern std::vector<Module*> modules;
76 extern std::vector<ircd_module*> factory;
79 /* Any socket can have one of five states at any one time.
80 * The LISTENER state indicates a socket which is listening
81 * for connections. It cannot receive data itself, only incoming
83 * The CONNECTING state indicates an outbound socket which is
84 * waiting to be writeable.
85 * The WAIT_AUTH_1 state indicates the socket is outbound and
86 * has successfully connected, but has not yet sent and received
88 * The WAIT_AUTH_2 state indicates that the socket is inbound
89 * (allocated by a LISTENER) but has not yet sent and received
91 * The CONNECTED state represents a fully authorized, fully
94 enum ServerState { LISTENER, CONNECTING, WAIT_AUTH_1, WAIT_AUTH_2, CONNECTED };
96 /* We need to import these from the core for use in netbursts */
97 /*typedef nspace::hash_map<std::string, userrec*, nspace::hash<string>, irc::StrHashComp> user_hash;
98 typedef nspace::hash_map<std::string, chanrec*, nspace::hash<string>, irc::StrHashComp> chan_hash;*/
99 extern user_hash clientlist;
100 extern chan_hash chanlist;
102 /* Foward declarations */
106 /* This variable represents the root of the server tree
107 * (for all intents and purposes, it's us)
109 TreeServer *TreeRoot;
113 /* This hash_map holds the hash equivalent of the server
114 * tree, used for rapid linear lookups.
116 typedef nspace::hash_map<std::string, TreeServer*> server_hash;
117 server_hash serverlist;
119 /* More forward declarations */
120 bool DoOneToOne(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string target);
121 bool DoOneToAllButSender(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string omit);
122 bool DoOneToMany(std::string prefix, std::string command, std::deque<std::string> ¶ms);
123 bool DoOneToAllButSenderRaw(std::string data, std::string omit, std::string prefix, std::string command, std::deque<std::string> ¶ms);
124 void ReadConfiguration(bool rebind);
126 /* Imported from xline.cpp for use during netburst */
127 extern std::vector<KLine> klines;
128 extern std::vector<GLine> glines;
129 extern std::vector<ZLine> zlines;
130 extern std::vector<QLine> qlines;
131 extern std::vector<ELine> elines;
132 extern std::vector<KLine> pklines;
133 extern std::vector<GLine> pglines;
134 extern std::vector<ZLine> pzlines;
135 extern std::vector<QLine> pqlines;
136 extern std::vector<ELine> pelines;
138 /* Each server in the tree is represented by one class of
139 * type TreeServer. A locally connected TreeServer can
140 * have a class of type TreeSocket associated with it, for
141 * remote servers, the TreeSocket entry will be NULL.
142 * Each server also maintains a pointer to its parent
143 * (NULL if this server is ours, at the top of the tree)
144 * and a pointer to its "Route" (see the comments in the
145 * constructors below), and also a dynamic list of pointers
146 * to its children which can be iterated recursively
147 * if required. Creating or deleting objects of type
148 * TreeServer automatically maintains the hash_map of
149 * TreeServer items, deleting and inserting them as they
150 * are created and destroyed.
155 TreeServer* Parent; /* Parent entry */
156 TreeServer* Route; /* Route entry */
157 std::vector<TreeServer*> Children; /* List of child objects */
158 std::string ServerName; /* Server's name */
159 std::string ServerDesc; /* Server's description */
160 std::string VersionString; /* Version string or empty string */
161 int UserCount; /* Not used in this version */
162 int OperCount; /* Not used in this version */
163 TreeSocket* Socket; /* For directly connected servers this points at the socket object */
164 time_t NextPing; /* After this time, the server should be PINGed*/
165 bool LastPingWasGood; /* True if the server responded to the last PING with a PONG */
169 /* We don't use this constructor. Its a dummy, and won't cause any insertion
170 * of the TreeServer into the hash_map. See below for the two we DO use.
178 UserCount = OperCount = 0;
179 VersionString = Srv->GetVersion();
182 /* We use this constructor only to create the 'root' item, TreeRoot, which
183 * represents our own server. Therefore, it has no route, no parent, and
184 * no socket associated with it. Its version string is our own local version.
186 TreeServer(std::string Name, std::string Desc) : ServerName(Name), ServerDesc(Desc)
190 UserCount = OperCount = 0;
191 VersionString = Srv->GetVersion();
196 /* When we create a new server, we call this constructor to initialize it.
197 * This constructor initializes the server's Route and Parent, and sets up
198 * its ping counters so that it will be pinged one minute from now.
200 TreeServer(std::string Name, std::string Desc, TreeServer* Above, TreeSocket* Sock) : Parent(Above), ServerName(Name), ServerDesc(Desc), Socket(Sock)
203 UserCount = OperCount = 0;
204 this->SetNextPingTime(time(NULL) + 60);
207 /* find the 'route' for this server (e.g. the one directly connected
208 * to the local server, which we can use to reach it)
210 * In the following example, consider we have just added a TreeServer
211 * class for server G on our network, of which we are server A.
212 * To route traffic to G (marked with a *) we must send the data to
213 * B (marked with a +) so this algorithm initializes the 'Route'
214 * value to point at whichever server traffic must be routed through
215 * to get here. If we were to try this algorithm with server B,
216 * the Route pointer would point at its own object ('this').
226 * We only run this algorithm when a server is created, as
227 * the routes remain constant while ever the server exists, and
228 * do not need to be re-calculated.
232 if (Route == TreeRoot)
238 while (this->Route->GetParent() != TreeRoot)
240 this->Route = Route->GetParent();
244 /* Because recursive code is slow and takes a lot of resources,
245 * we store two representations of the server tree. The first
246 * is a recursive structure where each server references its
247 * children and its parent, which is used for netbursts and
248 * netsplits to dump the whole dataset to the other server,
249 * and the second is used for very fast lookups when routing
250 * messages and is instead a hash_map, where each item can
251 * be referenced by its server name. The AddHashEntry()
252 * call below automatically inserts each TreeServer class
253 * into the hash_map as it is created. There is a similar
254 * maintainance call in the destructor to tidy up deleted
258 this->AddHashEntry();
261 /* This method is used to add the structure to the
262 * hash_map for linear searches. It is only called
263 * by the constructors.
267 server_hash::iterator iter;
268 iter = serverlist.find(this->ServerName);
269 if (iter == serverlist.end())
270 serverlist[this->ServerName] = this;
273 /* This method removes the reference to this object
274 * from the hash_map which is used for linear searches.
275 * It is only called by the default destructor.
279 server_hash::iterator iter;
280 iter = serverlist.find(this->ServerName);
281 if (iter != serverlist.end())
282 serverlist.erase(iter);
285 /* These accessors etc should be pretty self-
289 TreeServer* GetRoute()
294 std::string GetName()
296 return this->ServerName;
299 std::string GetDesc()
301 return this->ServerDesc;
304 std::string GetVersion()
306 return this->VersionString;
309 void SetNextPingTime(time_t t)
312 LastPingWasGood = false;
315 time_t NextPingTime()
317 return this->NextPing;
320 bool AnsweredLastPing()
322 return LastPingWasGood;
327 LastPingWasGood = true;
332 return this->UserCount;
337 return this->OperCount;
340 TreeSocket* GetSocket()
345 TreeServer* GetParent()
350 void SetVersion(std::string Version)
352 VersionString = Version;
355 unsigned int ChildCount()
357 return Children.size();
360 TreeServer* GetChild(unsigned int n)
362 if (n < Children.size())
364 /* Make sure they cant request
365 * an out-of-range object. After
366 * all we know what these programmer
367 * types are like *grin*.
377 void AddChild(TreeServer* Child)
379 Children.push_back(Child);
382 bool DelChild(TreeServer* Child)
384 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
395 /* Removes child nodes of this node, and of that node, etc etc.
396 * This is used during netsplits to automatically tidy up the
397 * server tree. It is slow, we don't use it for much else.
401 bool stillchildren = true;
402 while (stillchildren)
404 stillchildren = false;
405 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
407 TreeServer* s = (TreeServer*)*a;
411 stillchildren = true;
420 /* We'd better tidy up after ourselves, eh? */
421 this->DelHashEntry();
425 /* The Link class might as well be a struct,
426 * but this is C++ and we don't believe in structs (!).
427 * It holds the entire information of one <link>
428 * tag from the main config file. We maintain a list
429 * of them, and populate the list on rehash/load.
438 std::string SendPass;
439 std::string RecvPass;
440 unsigned long AutoConnect;
441 time_t NextConnectTime;
444 /* The usual stuff for inspircd modules,
445 * plus the vector of Link classes which we
446 * use to store the <link> tags from the config
450 std::vector<Link> LinkBlocks;
452 /* Yay for fast searches!
453 * This is hundreds of times faster than recursion
454 * or even scanning a linked list, especially when
455 * there are more than a few servers to deal with.
458 TreeServer* FindServer(std::string ServerName)
460 server_hash::iterator iter;
461 iter = serverlist.find(ServerName);
462 if (iter != serverlist.end())
472 /* Returns the locally connected server we must route a
473 * message through to reach server 'ServerName'. This
474 * only applies to one-to-one and not one-to-many routing.
475 * See the comments for the constructor of TreeServer
478 TreeServer* BestRouteTo(std::string ServerName)
480 if (ServerName.c_str() == TreeRoot->GetName())
482 TreeServer* Found = FindServer(ServerName);
485 return Found->GetRoute();
493 /* Find the first server matching a given glob mask.
494 * Theres no find-using-glob method of hash_map [awwww :-(]
495 * so instead, we iterate over the list using an iterator
496 * and match each one until we get a hit. Yes its slow,
499 TreeServer* FindServerMask(std::string ServerName)
501 for (server_hash::iterator i = serverlist.begin(); i != serverlist.end(); i++)
503 if (Srv->MatchText(i->first,ServerName))
509 /* A convenient wrapper that returns true if a server exists */
510 bool IsServer(std::string ServerName)
512 return (FindServer(ServerName) != NULL);
515 /* Every SERVER connection inbound or outbound is represented by
516 * an object of type TreeSocket.
517 * TreeSockets, being inherited from InspSocket, can be tied into
518 * the core socket engine, and we cn therefore receive activity events
519 * for them, just like activex objects on speed. (yes really, that
520 * is a technical term!) Each of these which relates to a locally
521 * connected server is assocated with it, by hooking it onto a
522 * TreeSocket class using its constructor. In this way, we can
523 * maintain a list of servers, some of which are directly connected,
524 * some of which are not.
527 class TreeSocket : public InspSocket
530 std::string in_buffer;
531 ServerState LinkState;
532 std::string InboundServerName;
533 std::string InboundDescription;
535 int num_lost_servers;
537 bool LastPingWasGood;
542 /* Because most of the I/O gubbins are encapsulated within
543 * InspSocket, we just call the superclass constructor for
544 * most of the action, and append a few of our own values
547 TreeSocket(std::string host, int port, bool listening, unsigned long maxtime)
548 : InspSocket(host, port, listening, maxtime)
551 this->LinkState = LISTENER;
554 TreeSocket(std::string host, int port, bool listening, unsigned long maxtime, std::string ServerName)
555 : InspSocket(host, port, listening, maxtime)
558 this->LinkState = CONNECTING;
561 /* When a listening socket gives us a new file descriptor,
562 * we must associate it with a socket without creating a new
563 * connection. This constructor is used for this purpose.
565 TreeSocket(int newfd, char* ip)
566 : InspSocket(newfd, ip)
568 this->LinkState = WAIT_AUTH_1;
571 /* When an outbound connection finishes connecting, we receive
572 * this event, and must send our SERVER string to the other
573 * side. If the other side is happy, as outlined in the server
574 * to server docs on the inspircd.org site, the other side
575 * will then send back its own server string.
577 virtual bool OnConnected()
579 if (this->LinkState == CONNECTING)
581 Srv->SendOpers("*** Connection to "+myhost+"["+this->GetIP()+"] established.");
582 /* we do not need to change state here. */
583 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
585 if (x->Name == this->myhost)
587 /* found who we're supposed to be connecting to, send the neccessary gubbins. */
588 this->WriteLine("SERVER "+Srv->GetServerName()+" "+x->SendPass+" 0 :"+Srv->GetServerDescription());
593 /* There is a (remote) chance that between the /CONNECT and the connection
594 * being accepted, some muppet has removed the <link> block and rehashed.
595 * If that happens the connection hangs here until it's closed. Unlikely
596 * and rather harmless.
601 virtual void OnError(InspSocketError e)
603 /* We don't handle this method, because all our
604 * dirty work is done in OnClose() (see below)
605 * which is still called on error conditions too.
609 virtual int OnDisconnect()
611 /* For the same reason as above, we don't
612 * handle OnDisconnect()
617 /* Recursively send the server tree with distances as hops.
618 * This is used during network burst to inform the other server
619 * (and any of ITS servers too) of what servers we know about.
620 * If at any point any of these servers already exist on the other
621 * end, our connection may be terminated. The hopcounts given
622 * by this function are relative, this doesn't matter so long as
623 * they are all >1, as all the remote servers re-calculate them
624 * to be relative too, with themselves as hop 0.
626 void SendServers(TreeServer* Current, TreeServer* s, int hops)
629 for (unsigned int q = 0; q < Current->ChildCount(); q++)
631 TreeServer* recursive_server = Current->GetChild(q);
632 if (recursive_server != s)
634 snprintf(command,1024,":%s SERVER %s * %d :%s",Current->GetName().c_str(),recursive_server->GetName().c_str(),hops,recursive_server->GetDesc().c_str());
635 this->WriteLine(command);
636 this->WriteLine(":"+recursive_server->GetName()+" VERSION :"+recursive_server->GetVersion());
637 /* down to next level */
638 this->SendServers(recursive_server, s, hops+1);
643 /* This function forces this server to quit, removing this server
644 * and any users on it (and servers and users below that, etc etc).
645 * It's very slow and pretty clunky, but luckily unless your network
646 * is having a REAL bad hair day, this function shouldnt be called
647 * too many times a month ;-)
649 void SquitServer(TreeServer* Current, CullList* Goners)
651 /* recursively squit the servers attached to 'Current'.
652 * We're going backwards so we don't remove users
653 * while we still need them ;)
655 for (unsigned int q = 0; q < Current->ChildCount(); q++)
657 TreeServer* recursive_server = Current->GetChild(q);
658 this->SquitServer(recursive_server,Goners);
660 /* Now we've whacked the kids, whack self */
662 quittingpeople = false;
663 for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
665 if (!strcasecmp(u->second->server,Current->GetName().c_str()))
667 std::string qreason = Current->GetName()+" "+std::string(Srv->GetServerName());
668 Goners->AddItem(u->second,qreason);
674 /* This is a wrapper function for SquitServer above, which
675 * does some validation first and passes on the SQUIT to all
676 * other remaining servers.
678 void Squit(TreeServer* Current,std::string reason)
682 std::deque<std::string> params;
683 params.push_back(Current->GetName());
684 params.push_back(":"+reason);
685 DoOneToAllButSender(Current->GetParent()->GetName(),"SQUIT",params,Current->GetName());
686 if (Current->GetParent() == TreeRoot)
688 Srv->SendOpers("Server \002"+Current->GetName()+"\002 split: "+reason);
692 Srv->SendOpers("Server \002"+Current->GetName()+"\002 split from server \002"+Current->GetParent()->GetName()+"\002 with reason: "+reason);
694 num_lost_servers = 0;
696 CullList* Goners = new CullList();
697 SquitServer(Current, Goners);
700 Current->GetParent()->DelChild(Current);
703 WriteOpers("Netsplit complete, lost \002%d\002 users on \002%d\002 servers.", num_lost_users, num_lost_servers);
707 log(DEFAULT,"Squit from unknown server");
712 bool ForceMode(std::string source, std::deque<std::string> params)
714 userrec* who = new userrec;
715 who->fd = FD_MAGIC_NUMBER;
716 if (params.size() < 2)
719 for (unsigned int q = 0; q < params.size(); q++)
721 modelist[q] = (char*)params[q].c_str();
723 Srv->SendMode(modelist,params.size(),who);
724 DoOneToAllButSender(source,"FMODE",params,source);
730 bool ForceTopic(std::string source, std::deque<std::string> params)
732 if (params.size() != 4)
734 std::string channel = params[0];
735 time_t ts = atoi(params[1].c_str());
736 std::string setby = params[2];
737 std::string topic = params[3];
739 chanrec* c = Srv->FindChannel(channel);
742 if ((ts >= c->topicset) || (!*c->topic))
744 std::string oldtopic = c->topic;
745 strlcpy(c->topic,topic.c_str(),MAXTOPIC);
746 strlcpy(c->setby,setby.c_str(),NICKMAX);
748 /* if the topic text is the same as the current topic,
749 * dont bother to send the TOPIC command out, just silently
750 * update the set time and set nick.
752 if (oldtopic != topic)
753 WriteChannelWithServ((char*)source.c_str(), c, "TOPIC %s :%s", c->name, c->topic);
758 /* all done, send it on its way */
759 params[3] = ":" + params[3];
760 DoOneToAllButSender(source,"FTOPIC",params,source);
765 /* FJOIN, similar to unreal SJOIN */
766 bool ForceJoin(std::string source, std::deque<std::string> params)
768 if (params.size() < 3)
772 char modestring[MAXBUF];
773 char* mode_users[127];
774 mode_users[0] = first;
775 mode_users[1] = modestring;
776 strcpy(mode_users[1],"+");
777 unsigned int modectr = 2;
780 std::string channel = params[0];
781 time_t TS = atoi(params[1].c_str());
784 chanrec* chan = Srv->FindChannel(channel);
789 strlcpy(mode_users[0],channel.c_str(),MAXBUF);
791 /* default is a high value, which if we dont have this
792 * channel will let the other side apply their modes.
794 time_t ourTS = time(NULL)+600;
795 chanrec* us = Srv->FindChannel(channel);
801 log(DEBUG,"FJOIN detected, our TS=%lu, their TS=%lu",ourTS,TS);
803 /* do this first, so our mode reversals are correctly received by other servers
804 * if there is a TS collision.
806 DoOneToAllButSender(source,"FJOIN",params,source);
808 for (unsigned int usernum = 2; usernum < params.size(); usernum++)
810 /* process one channel at a time, applying modes. */
811 char* usr = (char*)params[usernum].c_str();
812 char permissions = *usr;
817 mode_users[modectr++] = usr;
818 strlcat(modestring,"o",MAXBUF);
822 mode_users[modectr++] = usr;
823 strlcat(modestring,"h",MAXBUF);
827 mode_users[modectr++] = usr;
828 strlcat(modestring,"v",MAXBUF);
831 who = Srv->FindNick(usr);
834 Srv->JoinUserToChannel(who,channel,key);
835 if (modectr >= (MAXMODES-1))
837 /* theres a mode for this user. push them onto the mode queue, and flush it
838 * if there are more than MAXMODES to go.
840 if ((ourTS >= TS) || (Srv->IsUlined(who->server)))
842 /* We also always let u-lined clients win, no matter what the TS value */
843 log(DEBUG,"Our our channel newer than theirs, accepting their modes");
844 Srv->SendMode(mode_users,modectr,who);
848 log(DEBUG,"Their channel newer than ours, bouncing their modes");
850 std::deque<std::string> params;
851 /* modes are now being UNSET... */
852 *mode_users[1] = '-';
853 for (unsigned int x = 0; x < modectr; x++)
855 params.push_back(mode_users[x]);
857 // tell everyone to bounce the modes. bad modes, bad!
858 DoOneToMany(Srv->GetServerName(),"FMODE",params);
860 strcpy(mode_users[1],"+");
865 /* there werent enough modes built up to flush it during FJOIN,
866 * or, there are a number left over. flush them out.
868 if ((modectr > 2) && (who))
872 log(DEBUG,"Our our channel newer than theirs, accepting their modes");
873 Srv->SendMode(mode_users,modectr,who);
877 log(DEBUG,"Their channel newer than ours, bouncing their modes");
878 std::deque<std::string> params;
879 *mode_users[1] = '-';
880 for (unsigned int x = 0; x < modectr; x++)
882 params.push_back(mode_users[x]);
884 DoOneToMany(Srv->GetServerName(),"FMODE",params);
891 bool IntroduceClient(std::string source, std::deque<std::string> params)
893 if (params.size() < 8)
895 // NICK age nick host dhost ident +modes ip :gecos
897 std::string nick = params[1];
898 std::string host = params[2];
899 std::string dhost = params[3];
900 std::string ident = params[4];
901 time_t age = atoi(params[0].c_str());
902 std::string modes = params[5];
903 while (*(modes.c_str()) == '+')
905 char* m = (char*)modes.c_str();
909 std::string ip = params[6];
910 std::string gecos = params[7];
911 char* tempnick = (char*)nick.c_str();
912 log(DEBUG,"Introduce client %s!%s@%s",tempnick,ident.c_str(),host.c_str());
914 user_hash::iterator iter;
915 iter = clientlist.find(tempnick);
916 if (iter != clientlist.end())
919 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);
920 this->WriteLine(":"+Srv->GetServerName()+" KILL "+tempnick+" :Nickname collision");
924 clientlist[tempnick] = new userrec();
925 clientlist[tempnick]->fd = FD_MAGIC_NUMBER;
926 strlcpy(clientlist[tempnick]->nick, tempnick,NICKMAX);
927 strlcpy(clientlist[tempnick]->host, host.c_str(),160);
928 strlcpy(clientlist[tempnick]->dhost, dhost.c_str(),160);
929 clientlist[tempnick]->server = (char*)FindServerNamePtr(source.c_str());
930 strlcpy(clientlist[tempnick]->ident, ident.c_str(),IDENTMAX);
931 strlcpy(clientlist[tempnick]->fullname, gecos.c_str(),MAXGECOS);
932 clientlist[tempnick]->registered = 7;
933 clientlist[tempnick]->signon = age;
934 strlcpy(clientlist[tempnick]->modes, modes.c_str(),53);
935 strlcpy(clientlist[tempnick]->ip,ip.c_str(),16);
940 for (int i = 0; i < MAXCHANS; i++)
941 clientlist[tempnick]->chans.push_back(a);
945 WriteOpers("*** Client connecting at %s: %s!%s@%s [%s]",clientlist[tempnick]->server,clientlist[tempnick]->nick,clientlist[tempnick]->ident,clientlist[tempnick]->host,clientlist[tempnick]->ip);
947 params[7] = ":" + params[7];
948 DoOneToAllButSender(source,"NICK",params,source);
952 /* Send one or more FJOINs for a channel of users.
953 * If the length of a single line is more than 480-NICKMAX
954 * in length, it is split over multiple lines.
956 void SendFJoins(TreeServer* Current, chanrec* c)
958 log(DEBUG,"Sending FJOINs to other server for %s",c->name);
960 snprintf(list,MAXBUF,":%s FJOIN %s %lu",Srv->GetServerName().c_str(),c->name,(unsigned long)c->age);
961 std::vector<char*> *ulist = c->GetUsers();
962 for (unsigned int i = 0; i < ulist->size(); i++)
964 char* o = (*ulist)[i];
965 userrec* otheruser = (userrec*)o;
966 strlcat(list," ",MAXBUF);
967 strlcat(list,cmode(otheruser,c),MAXBUF);
968 strlcat(list,otheruser->nick,MAXBUF);
969 if (strlen(list)>(480-NICKMAX))
971 log(DEBUG,"FJOIN line wrapped");
972 this->WriteLine(list);
973 snprintf(list,MAXBUF,":%s FJOIN %s %lu",Srv->GetServerName().c_str(),c->name,(unsigned long)c->age);
976 if (list[strlen(list)-1] != ':')
978 log(DEBUG,"Final FJOIN line");
979 this->WriteLine(list);
983 /* Send G, Q, Z and E lines */
984 void SendXLines(TreeServer* Current)
987 /* Yes, these arent too nice looking, but they get the job done */
988 for (std::vector<ZLine>::iterator i = zlines.begin(); i != zlines.end(); i++)
990 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);
991 this->WriteLine(data);
993 for (std::vector<QLine>::iterator i = qlines.begin(); i != qlines.end(); i++)
995 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);
996 this->WriteLine(data);
998 for (std::vector<GLine>::iterator i = glines.begin(); i != glines.end(); i++)
1000 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);
1001 this->WriteLine(data);
1003 for (std::vector<ELine>::iterator i = elines.begin(); i != elines.end(); i++)
1005 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);
1006 this->WriteLine(data);
1008 for (std::vector<ZLine>::iterator i = pzlines.begin(); i != pzlines.end(); i++)
1010 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);
1011 this->WriteLine(data);
1013 for (std::vector<QLine>::iterator i = pqlines.begin(); i != pqlines.end(); i++)
1015 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);
1016 this->WriteLine(data);
1018 for (std::vector<GLine>::iterator i = pglines.begin(); i != pglines.end(); i++)
1020 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);
1021 this->WriteLine(data);
1023 for (std::vector<ELine>::iterator i = pelines.begin(); i != pelines.end(); i++)
1025 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);
1026 this->WriteLine(data);
1030 /* Send channel modes and topics */
1031 void SendChannelModes(TreeServer* Current)
1034 std::deque<std::string> list;
1035 for (chan_hash::iterator c = chanlist.begin(); c != chanlist.end(); c++)
1037 SendFJoins(Current, c->second);
1038 snprintf(data,MAXBUF,":%s FMODE %s +%s",Srv->GetServerName().c_str(),c->second->name,chanmodes(c->second));
1039 this->WriteLine(data);
1040 if (*c->second->topic)
1042 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);
1043 this->WriteLine(data);
1045 for (BanList::iterator b = c->second->bans.begin(); b != c->second->bans.end(); b++)
1047 snprintf(data,MAXBUF,":%s FMODE %s +b %s",Srv->GetServerName().c_str(),c->second->name,b->data);
1048 this->WriteLine(data);
1050 FOREACH_MOD OnSyncChannel(c->second,(Module*)TreeProtocolModule,(void*)this);
1052 c->second->GetExtList(list);
1053 for (unsigned int j = 0; j < list.size(); j++)
1055 FOREACH_MOD OnSyncChannelMetaData(c->second,(Module*)TreeProtocolModule,(void*)this,list[j]);
1060 /* send all users and their oper state/modes */
1061 void SendUsers(TreeServer* Current)
1064 std::deque<std::string> list;
1065 for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
1067 if (u->second->registered == 7)
1069 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);
1070 this->WriteLine(data);
1071 if (strchr(u->second->modes,'o'))
1073 this->WriteLine(":"+std::string(u->second->nick)+" OPERTYPE "+std::string(u->second->oper));
1075 FOREACH_MOD OnSyncUser(u->second,(Module*)TreeProtocolModule,(void*)this);
1077 u->second->GetExtList(list);
1078 for (unsigned int j = 0; j < list.size(); j++)
1080 FOREACH_MOD OnSyncUserMetaData(u->second,(Module*)TreeProtocolModule,(void*)this,list[j]);
1086 /* This function is called when we want to send a netburst to a local
1087 * server. There is a set order we must do this, because for example
1088 * users require their servers to exist, and channels require their
1089 * users to exist. You get the idea.
1091 void DoBurst(TreeServer* s)
1093 Srv->SendOpers("*** Bursting to \2"+s->GetName()+"\2.");
1094 this->WriteLine("BURST");
1095 /* send our version string */
1096 this->WriteLine(":"+Srv->GetServerName()+" VERSION :"+Srv->GetVersion());
1097 /* Send server tree */
1098 this->SendServers(TreeRoot,s,1);
1099 /* Send users and their oper status */
1101 /* Send everything else (channel modes, xlines etc) */
1102 this->SendChannelModes(s);
1103 this->SendXLines(s);
1104 this->WriteLine("ENDBURST");
1105 Srv->SendOpers("*** Finished bursting to \2"+s->GetName()+"\2.");
1108 /* This function is called when we receive data from a remote
1109 * server. We buffer the data in a std::string (it doesnt stay
1110 * there for long), reading using InspSocket::Read() which can
1111 * read up to 16 kilobytes in one operation.
1113 * IF THIS FUNCTION RETURNS FALSE, THE CORE CLOSES AND DELETES
1114 * THE SOCKET OBJECT FOR US.
1116 virtual bool OnDataReady()
1118 char* data = this->Read();
1121 this->in_buffer += data;
1122 /* While there is at least one new line in the buffer,
1123 * do something useful (we hope!) with it.
1125 while (in_buffer.find("\n") != std::string::npos)
1127 char* line = (char*)in_buffer.c_str();
1128 std::string ret = "";
1129 while ((*line != '\n') && (strlen(line)))
1134 if ((*line == '\n') || (*line == '\r'))
1137 /* Process this one, abort if it
1138 * didnt return true.
1140 if (!this->ProcessLine(ret))
1146 return (data != NULL);
1149 int WriteLine(std::string line)
1151 log(DEBUG,"OUT: %s",line.c_str());
1152 return this->Write(line + "\r\n");
1155 /* Handle ERROR command */
1156 bool Error(std::deque<std::string> params)
1158 if (params.size() < 1)
1160 std::string Errmsg = params[0];
1161 std::string SName = myhost;
1162 if (InboundServerName != "")
1164 SName = InboundServerName;
1166 Srv->SendOpers("*** ERROR from "+SName+": "+Errmsg);
1167 /* we will return false to cause the socket to close.
1172 /* Because the core won't let users or even SERVERS set +o,
1173 * we use the OPERTYPE command to do this.
1175 bool OperType(std::string prefix, std::deque<std::string> ¶ms)
1177 if (params.size() != 1)
1179 std::string opertype = params[0];
1180 userrec* u = Srv->FindNick(prefix);
1183 strlcpy(u->oper,opertype.c_str(),NICKMAX);
1184 if (!strchr(u->modes,'o'))
1186 strcat(u->modes,"o");
1188 DoOneToAllButSender(u->nick,"OPERTYPE",params,u->server);
1193 /* Because Andy insists that services-compatible servers must
1194 * implement SVSNICK and SVSJOIN, that's exactly what we do :p
1196 bool ForceNick(std::string prefix, std::deque<std::string> ¶ms)
1198 if (params.size() < 3)
1200 userrec* u = Srv->FindNick(params[0]);
1203 Srv->ChangeUserNick(u,params[1]);
1204 u->age = atoi(params[2].c_str());
1205 DoOneToAllButSender(prefix,"SVSNICK",params,prefix);
1210 bool ServiceJoin(std::string prefix, std::deque<std::string> ¶ms)
1212 if (params.size() < 2)
1214 userrec* u = Srv->FindNick(params[0]);
1217 Srv->JoinUserToChannel(u,params[1],"");
1218 DoOneToAllButSender(prefix,"SVSJOIN",params,prefix);
1223 bool RemoteRehash(std::string prefix, std::deque<std::string> ¶ms)
1225 if (params.size() < 1)
1227 std::string servermask = params[0];
1228 if (Srv->MatchText(Srv->GetServerName(),servermask))
1230 Srv->SendOpers("*** Remote rehash initiated from server \002"+prefix+"\002.");
1231 Srv->RehashServer();
1232 ReadConfiguration(false);
1234 DoOneToAllButSender(prefix,"REHASH",params,prefix);
1238 bool RemoteKill(std::string prefix, std::deque<std::string> ¶ms)
1240 if (params.size() != 2)
1242 std::string nick = params[0];
1243 userrec* u = Srv->FindNick(prefix);
1244 userrec* who = Srv->FindNick(nick);
1247 /* Prepend kill source, if we don't have one */
1248 std::string sourceserv = prefix;
1251 sourceserv = u->server;
1253 if (*(params[1].c_str()) != '[')
1255 params[1] = "[" + sourceserv + "] Killed (" + params[1] +")";
1257 std::string reason = params[1];
1258 params[1] = ":" + params[1];
1259 DoOneToAllButSender(prefix,"KILL",params,sourceserv);
1260 Srv->QuitUser(who,reason);
1265 bool LocalPong(std::string prefix, std::deque<std::string> ¶ms)
1267 if (params.size() < 1)
1269 TreeServer* ServerSource = FindServer(prefix);
1272 ServerSource->SetPingFlag();
1277 bool MetaData(std::string prefix, std::deque<std::string> ¶ms)
1279 if (params.size() < 3)
1281 TreeServer* ServerSource = FindServer(prefix);
1284 if (*(params[0].c_str()) == '#')
1286 chanrec* c = Srv->FindChannel(params[0]);
1289 FOREACH_MOD OnDecodeMetaData(TYPE_CHANNEL,c,params[1],params[2]);
1294 userrec* u = Srv->FindNick(params[0]);
1297 FOREACH_MOD OnDecodeMetaData(TYPE_USER,u,params[1],params[2]);
1301 params[2] = ":" + params[2];
1302 DoOneToAllButSender(prefix,"METADATA",params,prefix);
1306 bool ServerVersion(std::string prefix, std::deque<std::string> ¶ms)
1308 if (params.size() < 1)
1310 TreeServer* ServerSource = FindServer(prefix);
1313 ServerSource->SetVersion(params[0]);
1315 params[0] = ":" + params[0];
1316 DoOneToAllButSender(prefix,"VERSION",params,prefix);
1320 bool ChangeHost(std::string prefix, std::deque<std::string> ¶ms)
1322 if (params.size() < 1)
1324 userrec* u = Srv->FindNick(prefix);
1327 Srv->ChangeHost(u,params[0]);
1328 DoOneToAllButSender(prefix,"FHOST",params,u->server);
1333 bool AddLine(std::string prefix, std::deque<std::string> ¶ms)
1335 if (params.size() < 6)
1337 std::string linetype = params[0]; /* Z, Q, E, G, K */
1338 std::string mask = params[1]; /* Line type dependent */
1339 std::string source = params[2]; /* may not be online or may be a server */
1340 std::string settime = params[3]; /* EPOCH time set */
1341 std::string duration = params[4]; /* Duration secs */
1342 std::string reason = params[5];
1344 switch (*(linetype.c_str()))
1347 add_zline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1348 zline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1351 add_qline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1352 qline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1355 add_eline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1356 eline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1359 add_gline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1360 gline_set_creation_time((char*)mask.c_str(), atoi(settime.c_str()));
1363 add_kline(atoi(duration.c_str()), source.c_str(), reason.c_str(), mask.c_str());
1366 /* Just in case... */
1367 Srv->SendOpers("*** \2WARNING\2: Invalid xline type '"+linetype+"' sent by server "+prefix+", ignored!");
1370 /* Send it on its way */
1371 params[5] = ":" + params[5];
1372 DoOneToAllButSender(prefix,"ADDLINE",params,prefix);
1376 bool ChangeName(std::string prefix, std::deque<std::string> ¶ms)
1378 if (params.size() < 1)
1380 userrec* u = Srv->FindNick(prefix);
1383 Srv->ChangeGECOS(u,params[0]);
1384 params[0] = ":" + params[0];
1385 DoOneToAllButSender(prefix,"FNAME",params,u->server);
1390 bool Whois(std::string prefix, std::deque<std::string> ¶ms)
1392 if (params.size() < 1)
1394 log(DEBUG,"In IDLE command");
1395 userrec* u = Srv->FindNick(prefix);
1398 log(DEBUG,"USER EXISTS: %s",u->nick);
1399 // an incoming request
1400 if (params.size() == 1)
1402 userrec* x = Srv->FindNick(params[0]);
1405 userrec* x = Srv->FindNick(params[0]);
1406 log(DEBUG,"Got IDLE");
1407 char signon[MAXBUF];
1409 log(DEBUG,"Sending back IDLE 3");
1410 snprintf(signon,MAXBUF,"%lu",(unsigned long)x->signon);
1411 snprintf(idle,MAXBUF,"%lu",(unsigned long)abs((x->idle_lastmsg)-time(NULL)));
1412 std::deque<std::string> par;
1413 par.push_back(prefix);
1414 par.push_back(signon);
1415 par.push_back(idle);
1416 // ours, we're done, pass it BACK
1417 DoOneToOne(params[0],"IDLE",par,u->server);
1421 // not ours pass it on
1422 DoOneToOne(prefix,"IDLE",params,x->server);
1425 else if (params.size() == 3)
1427 std::string who_did_the_whois = params[0];
1428 userrec* who_to_send_to = Srv->FindNick(who_did_the_whois);
1429 if (who_to_send_to->fd > -1)
1431 log(DEBUG,"Got final IDLE");
1432 // an incoming reply to a whois we sent out
1433 std::string nick_whoised = prefix;
1434 unsigned long signon = atoi(params[1].c_str());
1435 unsigned long idle = atoi(params[2].c_str());
1436 if ((who_to_send_to) && (who_to_send_to->fd > -1))
1437 do_whois(who_to_send_to,u,signon,idle,(char*)nick_whoised.c_str());
1441 // not ours, pass it on
1442 DoOneToOne(prefix,"IDLE",params,who_to_send_to->server);
1449 bool LocalPing(std::string prefix, std::deque<std::string> ¶ms)
1451 if (params.size() < 1)
1453 std::string stufftobounce = params[0];
1454 this->WriteLine(":"+Srv->GetServerName()+" PONG "+stufftobounce);
1458 bool RemoteServer(std::string prefix, std::deque<std::string> ¶ms)
1460 if (params.size() < 4)
1462 std::string servername = params[0];
1463 std::string password = params[1];
1464 // hopcount is not used for a remote server, we calculate this ourselves
1465 std::string description = params[3];
1466 TreeServer* ParentOfThis = FindServer(prefix);
1469 this->WriteLine("ERROR :Protocol error - Introduced remote server from unknown server "+prefix);
1472 TreeServer* CheckDupe = FindServer(servername);
1475 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1478 TreeServer* Node = new TreeServer(servername,description,ParentOfThis,NULL);
1479 ParentOfThis->AddChild(Node);
1480 params[3] = ":" + params[3];
1481 DoOneToAllButSender(prefix,"SERVER",params,prefix);
1482 Srv->SendOpers("*** Server \002"+prefix+"\002 introduced server \002"+servername+"\002 ("+description+")");
1486 bool Outbound_Reply_Server(std::deque<std::string> ¶ms)
1488 if (params.size() < 4)
1490 std::string servername = params[0];
1491 std::string password = params[1];
1492 int hops = atoi(params[2].c_str());
1495 this->WriteLine("ERROR :Server too far away for authentication");
1498 std::string description = params[3];
1499 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1501 if ((x->Name == servername) && (x->RecvPass == password))
1503 TreeServer* CheckDupe = FindServer(servername);
1506 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1509 // Begin the sync here. this kickstarts the
1510 // other side, waiting in WAIT_AUTH_2 state,
1511 // into starting their burst, as it shows
1512 // that we're happy.
1513 this->LinkState = CONNECTED;
1514 // we should add the details of this server now
1515 // to the servers tree, as a child of the root
1517 TreeServer* Node = new TreeServer(servername,description,TreeRoot,this);
1518 TreeRoot->AddChild(Node);
1519 params[3] = ":" + params[3];
1520 DoOneToAllButSender(TreeRoot->GetName(),"SERVER",params,servername);
1521 this->bursting = true;
1522 this->DoBurst(Node);
1526 this->WriteLine("ERROR :Invalid credentials");
1530 bool Inbound_Server(std::deque<std::string> ¶ms)
1532 if (params.size() < 4)
1534 std::string servername = params[0];
1535 std::string password = params[1];
1536 int hops = atoi(params[2].c_str());
1539 this->WriteLine("ERROR :Server too far away for authentication");
1542 std::string description = params[3];
1543 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1545 if ((x->Name == servername) && (x->RecvPass == password))
1547 TreeServer* CheckDupe = FindServer(servername);
1550 this->WriteLine("ERROR :Server "+servername+" already exists on server "+CheckDupe->GetParent()->GetName()+"!");
1553 Srv->SendOpers("*** Verified incoming server connection from \002"+servername+"\002["+this->GetIP()+"] ("+description+")");
1554 this->InboundServerName = servername;
1555 this->InboundDescription = description;
1556 // this is good. Send our details: Our server name and description and hopcount of 0,
1557 // along with the sendpass from this block.
1558 this->WriteLine("SERVER "+Srv->GetServerName()+" "+x->SendPass+" 0 :"+Srv->GetServerDescription());
1559 // move to the next state, we are now waiting for THEM.
1560 this->LinkState = WAIT_AUTH_2;
1564 this->WriteLine("ERROR :Invalid credentials");
1568 void Split(std::string line, bool stripcolon, std::deque<std::string> &n)
1570 if (!strchr(line.c_str(),' '))
1575 std::stringstream s(line);
1576 std::string param = "";
1595 if ((param == ":") && (item > 0))
1618 bool ProcessLine(std::string line)
1620 char* l = (char*)line.c_str();
1621 while ((strlen(l)) && (l[strlen(l)-1] == '\r') || (l[strlen(l)-1] == '\n'))
1622 l[strlen(l)-1] = '\0';
1626 Srv->Log(DEBUG,"IN: '"+line+"'");
1627 std::deque<std::string> params;
1628 this->Split(line,true,params);
1629 std::string command = "";
1630 std::string prefix = "";
1631 if (((params[0].c_str())[0] == ':') && (params.size() > 1))
1634 command = params[1];
1635 char* pref = (char*)prefix.c_str();
1643 command = params[0];
1647 switch (this->LinkState)
1652 // Waiting for SERVER command from remote server. Server initiating
1653 // the connection sends the first SERVER command, listening server
1654 // replies with theirs if its happy, then if the initiator is happy,
1655 // it starts to send its net sync, which starts the merge, otherwise
1656 // it sends an ERROR.
1657 if (command == "SERVER")
1659 return this->Inbound_Server(params);
1661 else if (command == "ERROR")
1663 return this->Error(params);
1667 // Waiting for start of other side's netmerge to say they liked our
1669 if (command == "SERVER")
1671 // cant do this, they sent it to us in the WAIT_AUTH_1 state!
1675 else if (command == "BURST")
1677 this->LinkState = CONNECTED;
1678 Node = new TreeServer(InboundServerName,InboundDescription,TreeRoot,this);
1679 TreeRoot->AddChild(Node);
1681 params.push_back(InboundServerName);
1682 params.push_back("*");
1683 params.push_back("1");
1684 params.push_back(":"+InboundDescription);
1685 DoOneToAllButSender(TreeRoot->GetName(),"SERVER",params,InboundServerName);
1686 this->bursting = true;
1687 this->DoBurst(Node);
1689 else if (command == "ERROR")
1691 return this->Error(params);
1696 this->WriteLine("ERROR :Internal error -- listening socket accepted its own descriptor!!!");
1700 if (command == "SERVER")
1702 // another server we connected to, which was in WAIT_AUTH_1 state,
1703 // has just sent us their credentials. If we get this far, theyre
1704 // happy with OUR credentials, and they are now in WAIT_AUTH_2 state.
1705 // if we're happy with this, we should send our netburst which
1706 // kickstarts the merge.
1707 return this->Outbound_Reply_Server(params);
1709 else if (command == "ERROR")
1711 return this->Error(params);
1715 // This is the 'authenticated' state, when all passwords
1716 // have been exchanged and anything past this point is taken
1721 std::string direction = prefix;
1722 userrec* t = Srv->FindNick(prefix);
1725 direction = t->server;
1727 TreeServer* route_back_again = BestRouteTo(direction);
1728 if ((!route_back_again) || (route_back_again->GetSocket() != this))
1730 if (route_back_again)
1732 WriteOpers("Protocol violation: Fake direction in command '%s' from connection '%s'",line.c_str(),this->GetName().c_str());
1736 WriteOpers("Protocol violation: Invalid source '%s' in command '%s' from connection '%s'",direction.c_str(),line.c_str(),this->GetName().c_str());
1743 if (command == "SVSMODE")
1745 /* Services expects us to implement
1746 * SVSMODE. In inspircd its the same as
1751 std::string target = "";
1752 /* Yes, know, this is a mess. Its reasonably fast though as we're
1753 * working with std::string here.
1755 if ((command == "NICK") && (params.size() > 1))
1757 return this->IntroduceClient(prefix,params);
1759 else if (command == "FJOIN")
1761 return this->ForceJoin(prefix,params);
1763 else if (command == "SERVER")
1765 return this->RemoteServer(prefix,params);
1767 else if (command == "ERROR")
1769 return this->Error(params);
1771 else if (command == "OPERTYPE")
1773 return this->OperType(prefix,params);
1775 else if (command == "FMODE")
1777 return this->ForceMode(prefix,params);
1779 else if (command == "KILL")
1781 return this->RemoteKill(prefix,params);
1783 else if (command == "FTOPIC")
1785 return this->ForceTopic(prefix,params);
1787 else if (command == "REHASH")
1789 return this->RemoteRehash(prefix,params);
1791 else if (command == "METADATA")
1793 return this->MetaData(prefix,params);
1795 else if (command == "PING")
1797 return this->LocalPing(prefix,params);
1799 else if (command == "PONG")
1801 return this->LocalPong(prefix,params);
1803 else if (command == "VERSION")
1805 return this->ServerVersion(prefix,params);
1807 else if (command == "FHOST")
1809 return this->ChangeHost(prefix,params);
1811 else if (command == "FNAME")
1813 return this->ChangeName(prefix,params);
1815 else if (command == "ADDLINE")
1817 return this->AddLine(prefix,params);
1819 else if (command == "SVSNICK")
1823 prefix = this->GetName();
1825 return this->ForceNick(prefix,params);
1827 else if (command == "IDLE")
1829 return this->Whois(prefix,params);
1831 else if (command == "SVSJOIN")
1835 prefix = this->GetName();
1837 return this->ServiceJoin(prefix,params);
1839 else if (command == "SQUIT")
1841 if (params.size() == 2)
1843 this->Squit(FindServer(params[0]),params[1]);
1847 else if (command == "ENDBURST")
1849 this->bursting = false;
1854 // not a special inter-server command.
1855 // Emulate the actual user doing the command,
1856 // this saves us having a huge ugly parser.
1857 userrec* who = Srv->FindNick(prefix);
1858 std::string sourceserv = this->myhost;
1859 if (this->InboundServerName != "")
1861 sourceserv = this->InboundServerName;
1866 target = who->server;
1867 char* strparams[127];
1868 for (unsigned int q = 0; q < params.size(); q++)
1870 strparams[q] = (char*)params[q].c_str();
1872 Srv->CallCommandHandler(command, strparams, params.size(), who);
1876 // its not a user. Its either a server, or somethings screwed up.
1877 if (IsServer(prefix))
1879 target = Srv->GetServerName();
1883 log(DEBUG,"Command with unknown origin '%s'",prefix.c_str());
1887 return DoOneToAllButSenderRaw(line,sourceserv,prefix,command,params);
1896 virtual std::string GetName()
1898 std::string sourceserv = this->myhost;
1899 if (this->InboundServerName != "")
1901 sourceserv = this->InboundServerName;
1906 virtual void OnTimeout()
1908 if (this->LinkState == CONNECTING)
1910 Srv->SendOpers("*** CONNECT: Connection to \002"+myhost+"\002 timed out.");
1914 virtual void OnClose()
1916 // Connection closed.
1917 // If the connection is fully up (state CONNECTED)
1918 // then propogate a netsplit to all peers.
1919 std::string quitserver = this->myhost;
1920 if (this->InboundServerName != "")
1922 quitserver = this->InboundServerName;
1924 TreeServer* s = FindServer(quitserver);
1927 Squit(s,"Remote host closed the connection");
1931 virtual int OnIncomingConnection(int newsock, char* ip)
1933 TreeSocket* s = new TreeSocket(newsock, ip);
1939 void AddThisServer(TreeServer* server, std::deque<TreeServer*> &list)
1941 for (unsigned int c = 0; c < list.size(); c++)
1943 if (list[c] == server)
1948 list.push_back(server);
1951 // returns a list of DIRECT servernames for a specific channel
1952 void GetListOfServersForChannel(chanrec* c, std::deque<TreeServer*> &list)
1954 std::vector<char*> *ulist = c->GetUsers();
1955 unsigned int ucount = ulist->size();
1956 for (unsigned int i = 0; i < ucount; i++)
1958 char* o = (*ulist)[i];
1959 userrec* otheruser = (userrec*)o;
1960 if (otheruser->fd < 0)
1962 TreeServer* best = BestRouteTo(otheruser->server);
1964 AddThisServer(best,list);
1970 bool DoOneToAllButSenderRaw(std::string data, std::string omit, std::string prefix, std::string command, std::deque<std::string> ¶ms)
1972 TreeServer* omitroute = BestRouteTo(omit);
1973 if ((command == "NOTICE") || (command == "PRIVMSG"))
1975 if ((params.size() >= 2) && (*(params[0].c_str()) != '$'))
1977 if (*(params[0].c_str()) != '#')
1979 // special routing for private messages/notices
1980 userrec* d = Srv->FindNick(params[0]);
1983 std::deque<std::string> par;
1984 par.push_back(params[0]);
1985 par.push_back(":"+params[1]);
1986 DoOneToOne(prefix,command,par,d->server);
1992 log(DEBUG,"Channel privmsg going to chan %s",params[0].c_str());
1993 chanrec* c = Srv->FindChannel(params[0]);
1996 std::deque<TreeServer*> list;
1997 GetListOfServersForChannel(c,list);
1998 log(DEBUG,"Got a list of %d servers",list.size());
1999 unsigned int lsize = list.size();
2000 for (unsigned int i = 0; i < lsize; i++)
2002 TreeSocket* Sock = list[i]->GetSocket();
2003 if ((Sock) && (list[i]->GetName() != omit) && (omitroute != list[i]))
2005 log(DEBUG,"Writing privmsg to server %s",list[i]->GetName().c_str());
2006 Sock->WriteLine(data);
2014 unsigned int items = TreeRoot->ChildCount();
2015 for (unsigned int x = 0; x < items; x++)
2017 TreeServer* Route = TreeRoot->GetChild(x);
2018 if ((Route->GetSocket()) && (Route->GetName() != omit) && (omitroute != Route))
2020 TreeSocket* Sock = Route->GetSocket();
2021 Sock->WriteLine(data);
2027 bool DoOneToAllButSender(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string omit)
2029 TreeServer* omitroute = BestRouteTo(omit);
2030 std::string FullLine = ":" + prefix + " " + command;
2031 unsigned int words = params.size();
2032 for (unsigned int x = 0; x < words; x++)
2034 FullLine = FullLine + " " + params[x];
2036 unsigned int items = TreeRoot->ChildCount();
2037 for (unsigned int x = 0; x < items; x++)
2039 TreeServer* Route = TreeRoot->GetChild(x);
2040 // Send the line IF:
2041 // The route has a socket (its a direct connection)
2042 // The route isnt the one to be omitted
2043 // The route isnt the path to the one to be omitted
2044 if ((Route->GetSocket()) && (Route->GetName() != omit) && (omitroute != Route))
2046 TreeSocket* Sock = Route->GetSocket();
2047 Sock->WriteLine(FullLine);
2053 bool DoOneToMany(std::string prefix, std::string command, std::deque<std::string> ¶ms)
2055 std::string FullLine = ":" + prefix + " " + command;
2056 unsigned int words = params.size();
2057 for (unsigned int x = 0; x < words; x++)
2059 FullLine = FullLine + " " + params[x];
2061 unsigned int items = TreeRoot->ChildCount();
2062 for (unsigned int x = 0; x < items; x++)
2064 TreeServer* Route = TreeRoot->GetChild(x);
2065 if (Route->GetSocket())
2067 TreeSocket* Sock = Route->GetSocket();
2068 Sock->WriteLine(FullLine);
2074 bool DoOneToOne(std::string prefix, std::string command, std::deque<std::string> ¶ms, std::string target)
2076 TreeServer* Route = BestRouteTo(target);
2079 std::string FullLine = ":" + prefix + " " + command;
2080 unsigned int words = params.size();
2081 for (unsigned int x = 0; x < words; x++)
2083 FullLine = FullLine + " " + params[x];
2085 if (Route->GetSocket())
2087 TreeSocket* Sock = Route->GetSocket();
2088 Sock->WriteLine(FullLine);
2098 std::vector<TreeSocket*> Bindings;
2100 void ReadConfiguration(bool rebind)
2102 Conf = new ConfigReader;
2105 for (int j =0; j < Conf->Enumerate("bind"); j++)
2107 std::string Type = Conf->ReadValue("bind","type",j);
2108 std::string IP = Conf->ReadValue("bind","address",j);
2109 long Port = Conf->ReadInteger("bind","port",j,true);
2110 if (Type == "servers")
2116 TreeSocket* listener = new TreeSocket(IP.c_str(),Port,true,10);
2117 if (listener->GetState() == I_LISTENING)
2119 Srv->AddSocket(listener);
2120 Bindings.push_back(listener);
2124 log(DEFAULT,"m_spanningtree: Warning: Failed to bind server port %d",Port);
2132 for (int j =0; j < Conf->Enumerate("link"); j++)
2135 L.Name = Conf->ReadValue("link","name",j);
2136 L.IPAddr = Conf->ReadValue("link","ipaddr",j);
2137 L.Port = Conf->ReadInteger("link","port",j,true);
2138 L.SendPass = Conf->ReadValue("link","sendpass",j);
2139 L.RecvPass = Conf->ReadValue("link","recvpass",j);
2140 L.AutoConnect = Conf->ReadInteger("link","autoconnect",j,true);
2141 L.NextConnectTime = time(NULL) + L.AutoConnect;
2142 LinkBlocks.push_back(L);
2143 log(DEBUG,"m_spanningtree: Read server %s with host %s:%d",L.Name.c_str(),L.IPAddr.c_str(),L.Port);
2149 class ModuleSpanningTree : public Module
2151 std::vector<TreeSocket*> Bindings;
2157 ModuleSpanningTree(Server* Me)
2158 : Module::Module(Me)
2163 // Create the root of the tree
2164 TreeRoot = new TreeServer(Srv->GetServerName(),Srv->GetServerDescription());
2166 ReadConfiguration(true);
2169 void ShowLinks(TreeServer* Current, userrec* user, int hops)
2171 std::string Parent = TreeRoot->GetName();
2172 if (Current->GetParent())
2174 Parent = Current->GetParent()->GetName();
2176 for (unsigned int q = 0; q < Current->ChildCount(); q++)
2178 ShowLinks(Current->GetChild(q),user,hops+1);
2180 WriteServ(user->fd,"364 %s %s %s :%d %s",user->nick,Current->GetName().c_str(),Parent.c_str(),hops,Current->GetDesc().c_str());
2183 int CountLocalServs()
2185 return TreeRoot->ChildCount();
2190 return serverlist.size();
2193 void HandleLinks(char** parameters, int pcnt, userrec* user)
2195 ShowLinks(TreeRoot,user,0);
2196 WriteServ(user->fd,"365 %s * :End of /LINKS list.",user->nick);
2200 void HandleLusers(char** parameters, int pcnt, userrec* user)
2202 WriteServ(user->fd,"251 %s :There are %d users and %d invisible on %d servers",user->nick,usercnt()-usercount_invisible(),usercount_invisible(),this->CountServs());
2203 WriteServ(user->fd,"252 %s %d :operator(s) online",user->nick,usercount_opers());
2204 WriteServ(user->fd,"253 %s %d :unknown connections",user->nick,usercount_unknown());
2205 WriteServ(user->fd,"254 %s %d :channels formed",user->nick,chancount());
2206 WriteServ(user->fd,"254 %s :I have %d clients and %d servers",user->nick,local_count(),this->CountLocalServs());
2210 // WARNING: NOT THREAD SAFE - DONT GET ANY SMART IDEAS.
2212 void ShowMap(TreeServer* Current, userrec* user, int depth, char matrix[128][80])
2216 for (int t = 0; t < depth; t++)
2218 matrix[line][t] = ' ';
2220 strlcpy(&matrix[line][depth],Current->GetName().c_str(),80);
2222 for (unsigned int q = 0; q < Current->ChildCount(); q++)
2224 ShowMap(Current->GetChild(q),user,depth+2,matrix);
2229 // Ok, prepare to be confused.
2230 // After much mulling over how to approach this, it struck me that
2231 // the 'usual' way of doing a /MAP isnt the best way. Instead of
2232 // keeping track of a ton of ascii characters, and line by line
2233 // under recursion working out where to place them using multiplications
2234 // and divisons, we instead render the map onto a backplane of characters
2235 // (a character matrix), then draw the branches as a series of "L" shapes
2236 // from the nodes. This is not only friendlier on CPU it uses less stack.
2238 void HandleMap(char** parameters, int pcnt, userrec* user)
2240 // This array represents a virtual screen which we will
2241 // "scratch" draw to, as the console device of an irc
2242 // client does not provide for a proper terminal.
2243 char matrix[128][80];
2244 for (unsigned int t = 0; t < 128; t++)
2246 matrix[t][0] = '\0';
2249 // The only recursive bit is called here.
2250 ShowMap(TreeRoot,user,0,matrix);
2251 // Process each line one by one. The algorithm has a limit of
2252 // 128 servers (which is far more than a spanning tree should have
2253 // anyway, so we're ok). This limit can be raised simply by making
2254 // the character matrix deeper, 128 rows taking 10k of memory.
2255 for (int l = 1; l < line; l++)
2257 // scan across the line looking for the start of the
2258 // servername (the recursive part of the algorithm has placed
2259 // the servers at indented positions depending on what they
2261 int first_nonspace = 0;
2262 while (matrix[l][first_nonspace] == ' ')
2267 // Draw the `- (corner) section: this may be overwritten by
2268 // another L shape passing along the same vertical pane, becoming
2269 // a |- (branch) section instead.
2270 matrix[l][first_nonspace] = '-';
2271 matrix[l][first_nonspace-1] = '`';
2273 // Draw upwards until we hit the parent server, causing possibly
2274 // other corners (`-) to become branches (|-)
2275 while ((matrix[l2][first_nonspace-1] == ' ') || (matrix[l2][first_nonspace-1] == '`'))
2277 matrix[l2][first_nonspace-1] = '|';
2281 // dump the whole lot to the user. This is the easy bit, honest.
2282 for (int t = 0; t < line; t++)
2284 WriteServ(user->fd,"006 %s :%s",user->nick,&matrix[t][0]);
2286 WriteServ(user->fd,"007 %s :End of /MAP",user->nick);
2290 int HandleSquit(char** parameters, int pcnt, userrec* user)
2292 TreeServer* s = FindServerMask(parameters[0]);
2295 TreeSocket* sock = s->GetSocket();
2298 WriteOpers("*** SQUIT: Server \002%s\002 removed from network by %s",parameters[0],user->nick);
2299 sock->Squit(s,"Server quit by "+std::string(user->nick)+"!"+std::string(user->ident)+"@"+std::string(user->host));
2304 WriteServ(user->fd,"NOTICE %s :*** SQUIT: The server \002%s\002 is not directly connected.",user->nick,parameters[0]);
2309 WriteServ(user->fd,"NOTICE %s :*** SQUIT: The server \002%s\002 does not exist on the network.",user->nick,parameters[0]);
2314 int HandleRemoteWhois(char** parameters, int pcnt, userrec* user)
2316 if ((user->fd > -1) && (pcnt > 1))
2318 userrec* remote = Srv->FindNick(parameters[1]);
2319 if ((remote) && (remote->fd < 0))
2321 std::deque<std::string> params;
2322 params.push_back(parameters[1]);
2323 DoOneToOne(user->nick,"IDLE",params,remote->server);
2328 WriteServ(user->fd,"401 %s %s :No such nick/channel",user->nick, parameters[1]);
2329 WriteServ(user->fd,"318 %s %s :End of /WHOIS list.",user->nick, parameters[1]);
2336 void DoPingChecks(time_t curtime)
2338 for (unsigned int j = 0; j < TreeRoot->ChildCount(); j++)
2340 TreeServer* serv = TreeRoot->GetChild(j);
2341 TreeSocket* sock = serv->GetSocket();
2344 if (curtime >= serv->NextPingTime())
2346 if (serv->AnsweredLastPing())
2348 sock->WriteLine(":"+Srv->GetServerName()+" PING "+serv->GetName());
2349 serv->SetNextPingTime(curtime + 60);
2353 // they didnt answer, boot them
2354 WriteOpers("*** Server \002%s\002 pinged out",serv->GetName().c_str());
2355 sock->Squit(serv,"Ping timeout");
2364 void AutoConnectServers(time_t curtime)
2366 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
2368 if ((x->AutoConnect) && (curtime >= x->NextConnectTime))
2370 log(DEBUG,"Auto-Connecting %s",x->Name.c_str());
2371 x->NextConnectTime = curtime + x->AutoConnect;
2372 TreeServer* CheckDupe = FindServer(x->Name);
2375 // an autoconnected server is not connected. Check if its time to connect it
2376 WriteOpers("*** AUTOCONNECT: Auto-connecting server \002%s\002 (%lu seconds until next attempt)",x->Name.c_str(),x->AutoConnect);
2377 TreeSocket* newsocket = new TreeSocket(x->IPAddr,x->Port,false,10,x->Name);
2378 Srv->AddSocket(newsocket);
2384 int HandleVersion(char** parameters, int pcnt, userrec* user)
2386 // we've already checked if pcnt > 0, so this is safe
2387 TreeServer* found = FindServerMask(parameters[0]);
2390 std::string Version = found->GetVersion();
2391 WriteServ(user->fd,"351 %s :%s",user->nick,Version.c_str());
2395 WriteServ(user->fd,"402 %s %s :No such server",user->nick,parameters[0]);
2400 int HandleConnect(char** parameters, int pcnt, userrec* user)
2402 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
2404 if (Srv->MatchText(x->Name.c_str(),parameters[0]))
2406 TreeServer* CheckDupe = FindServer(x->Name);
2409 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);
2410 TreeSocket* newsocket = new TreeSocket(x->IPAddr,x->Port,false,10,x->Name);
2411 Srv->AddSocket(newsocket);
2416 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());
2421 WriteServ(user->fd,"NOTICE %s :*** CONNECT: No server matching \002%s\002 could be found in the config file.",user->nick,parameters[0]);
2425 virtual bool HandleStats(char ** parameters, int pcnt, userrec* user)
2427 if (*parameters[0] == 'c')
2429 for (unsigned int i = 0; i < LinkBlocks.size(); i++)
2431 WriteServ(user->fd,"213 %s C *@%s * %s %d 0 M",user->nick,LinkBlocks[i].IPAddr.c_str(),LinkBlocks[i].Name.c_str(),LinkBlocks[i].Port);
2432 WriteServ(user->fd,"244 %s H * * %s",user->nick,LinkBlocks[i].Name.c_str());
2434 WriteServ(user->fd,"219 %s %s :End of /STATS report",user->nick,parameters[0]);
2435 WriteOpers("*** Notice: Stats '%s' requested by %s (%s@%s)",parameters[0],user->nick,user->ident,user->host);
2441 virtual int OnPreCommand(std::string command, char **parameters, int pcnt, userrec *user)
2443 if (command == "CONNECT")
2445 return this->HandleConnect(parameters,pcnt,user);
2447 else if (command == "SQUIT")
2449 return this->HandleSquit(parameters,pcnt,user);
2451 else if (command == "STATS")
2453 return this->HandleStats(parameters,pcnt,user);
2455 else if (command == "MAP")
2457 this->HandleMap(parameters,pcnt,user);
2460 else if (command == "LUSERS")
2462 this->HandleLusers(parameters,pcnt,user);
2465 else if (command == "LINKS")
2467 this->HandleLinks(parameters,pcnt,user);
2470 else if (command == "WHOIS")
2475 return this->HandleRemoteWhois(parameters,pcnt,user);
2478 else if ((command == "VERSION") && (pcnt > 0))
2480 this->HandleVersion(parameters,pcnt,user);
2483 else if (Srv->IsValidModuleCommand(command, pcnt, user))
2485 // this bit of code cleverly routes all module commands
2486 // to all remote severs *automatically* so that modules
2487 // can just handle commands locally, without having
2488 // to have any special provision in place for remote
2489 // commands and linking protocols.
2490 std::deque<std::string> params;
2492 for (int j = 0; j < pcnt; j++)
2494 if (strchr(parameters[j],' '))
2496 params.push_back(":" + std::string(parameters[j]));
2500 params.push_back(std::string(parameters[j]));
2503 DoOneToMany(user->nick,command,params);
2508 virtual void OnGetServerDescription(std::string servername,std::string &description)
2510 TreeServer* s = FindServer(servername);
2513 description = s->GetDesc();
2517 virtual void OnUserInvite(userrec* source,userrec* dest,chanrec* channel)
2519 if (source->fd > -1)
2521 std::deque<std::string> params;
2522 params.push_back(dest->nick);
2523 params.push_back(channel->name);
2524 DoOneToMany(source->nick,"INVITE",params);
2528 virtual void OnPostLocalTopicChange(userrec* user, chanrec* chan, std::string topic)
2530 std::deque<std::string> params;
2531 params.push_back(chan->name);
2532 params.push_back(":"+topic);
2533 DoOneToMany(user->nick,"TOPIC",params);
2536 virtual void OnWallops(userrec* user, std::string text)
2540 std::deque<std::string> params;
2541 params.push_back(":"+text);
2542 DoOneToMany(user->nick,"WALLOPS",params);
2546 virtual void OnUserNotice(userrec* user, void* dest, int target_type, std::string text)
2548 if (target_type == TYPE_USER)
2550 userrec* d = (userrec*)dest;
2551 if ((d->fd < 0) && (user->fd > -1))
2553 std::deque<std::string> params;
2555 params.push_back(d->nick);
2556 params.push_back(":"+text);
2557 DoOneToOne(user->nick,"NOTICE",params,d->server);
2564 chanrec *c = (chanrec*)dest;
2565 std::deque<TreeServer*> list;
2566 GetListOfServersForChannel(c,list);
2567 unsigned int ucount = list.size();
2568 for (unsigned int i = 0; i < ucount; i++)
2570 TreeSocket* Sock = list[i]->GetSocket();
2572 Sock->WriteLine(":"+std::string(user->nick)+" NOTICE "+std::string(c->name)+" :"+text);
2578 virtual void OnUserMessage(userrec* user, void* dest, int target_type, std::string text)
2580 if (target_type == TYPE_USER)
2582 // route private messages which are targetted at clients only to the server
2583 // which needs to receive them
2584 userrec* d = (userrec*)dest;
2585 if ((d->fd < 0) && (user->fd > -1))
2587 std::deque<std::string> params;
2589 params.push_back(d->nick);
2590 params.push_back(":"+text);
2591 DoOneToOne(user->nick,"PRIVMSG",params,d->server);
2598 chanrec *c = (chanrec*)dest;
2599 std::deque<TreeServer*> list;
2600 GetListOfServersForChannel(c,list);
2601 unsigned int ucount = list.size();
2602 for (unsigned int i = 0; i < ucount; i++)
2604 TreeSocket* Sock = list[i]->GetSocket();
2606 Sock->WriteLine(":"+std::string(user->nick)+" PRIVMSG "+std::string(c->name)+" :"+text);
2612 virtual void OnBackgroundTimer(time_t curtime)
2614 AutoConnectServers(curtime);
2615 DoPingChecks(curtime);
2618 virtual void OnUserJoin(userrec* user, chanrec* channel)
2620 // Only do this for local users
2623 std::deque<std::string> params;
2625 params.push_back(channel->name);
2628 // if the channel has a key, force the join by emulating the key.
2629 params.push_back(channel->key);
2631 if (channel->GetUserCounter() > 1)
2633 // not the first in the channel
2634 DoOneToMany(user->nick,"JOIN",params);
2638 // first in the channel, set up their permissions
2639 // and the channel TS with FJOIN.
2641 snprintf(ts,24,"%lu",(unsigned long)channel->age);
2643 params.push_back(channel->name);
2644 params.push_back(ts);
2645 params.push_back("@"+std::string(user->nick));
2646 DoOneToMany(Srv->GetServerName(),"FJOIN",params);
2651 virtual void OnChangeHost(userrec* user, std::string newhost)
2653 // only occurs for local clients
2654 if (user->registered != 7)
2656 std::deque<std::string> params;
2657 params.push_back(newhost);
2658 DoOneToMany(user->nick,"FHOST",params);
2661 virtual void OnChangeName(userrec* user, std::string gecos)
2663 // only occurs for local clients
2664 if (user->registered != 7)
2666 std::deque<std::string> params;
2667 params.push_back(gecos);
2668 DoOneToMany(user->nick,"FNAME",params);
2671 virtual void OnUserPart(userrec* user, chanrec* channel)
2675 std::deque<std::string> params;
2676 params.push_back(channel->name);
2677 DoOneToMany(user->nick,"PART",params);
2681 virtual void OnUserConnect(userrec* user)
2683 char agestr[MAXBUF];
2686 std::deque<std::string> params;
2687 snprintf(agestr,MAXBUF,"%lu",(unsigned long)user->age);
2688 params.push_back(agestr);
2689 params.push_back(user->nick);
2690 params.push_back(user->host);
2691 params.push_back(user->dhost);
2692 params.push_back(user->ident);
2693 params.push_back("+"+std::string(user->modes));
2694 params.push_back(user->ip);
2695 params.push_back(":"+std::string(user->fullname));
2696 DoOneToMany(Srv->GetServerName(),"NICK",params);
2700 virtual void OnUserQuit(userrec* user, std::string reason)
2702 if ((user->fd > -1) && (user->registered == 7))
2704 std::deque<std::string> params;
2705 params.push_back(":"+reason);
2706 DoOneToMany(user->nick,"QUIT",params);
2710 virtual void OnUserPostNick(userrec* user, std::string oldnick)
2714 std::deque<std::string> params;
2715 params.push_back(user->nick);
2716 DoOneToMany(oldnick,"NICK",params);
2720 virtual void OnUserKick(userrec* source, userrec* user, chanrec* chan, std::string reason)
2722 if (source->fd > -1)
2724 std::deque<std::string> params;
2725 params.push_back(chan->name);
2726 params.push_back(user->nick);
2727 params.push_back(":"+reason);
2728 DoOneToMany(source->nick,"KICK",params);
2732 virtual void OnRemoteKill(userrec* source, userrec* dest, std::string reason)
2734 std::deque<std::string> params;
2735 params.push_back(dest->nick);
2736 params.push_back(":"+reason);
2737 DoOneToMany(source->nick,"KILL",params);
2740 virtual void OnRehash(std::string parameter)
2742 if (parameter != "")
2744 std::deque<std::string> params;
2745 params.push_back(parameter);
2746 DoOneToMany(Srv->GetServerName(),"REHASH",params);
2748 if (Srv->MatchText(Srv->GetServerName(),parameter))
2750 Srv->SendOpers("*** Remote rehash initiated from server \002"+Srv->GetServerName()+"\002.");
2751 Srv->RehashServer();
2754 ReadConfiguration(false);
2757 // note: the protocol does not allow direct umode +o except
2758 // via NICK with 8 params. sending OPERTYPE infers +o modechange
2760 virtual void OnOper(userrec* user, std::string opertype)
2764 std::deque<std::string> params;
2765 params.push_back(opertype);
2766 DoOneToMany(user->nick,"OPERTYPE",params);
2770 void OnLine(userrec* source, std::string host, bool adding, char linetype, long duration, std::string reason)
2772 if (source->fd > -1)
2775 snprintf(type,8,"%cLINE",linetype);
2776 std::string stype = type;
2779 char sduration[MAXBUF];
2780 snprintf(sduration,MAXBUF,"%ld",duration);
2781 std::deque<std::string> params;
2782 params.push_back(host);
2783 params.push_back(sduration);
2784 params.push_back(":"+reason);
2785 DoOneToMany(source->nick,stype,params);
2789 std::deque<std::string> params;
2790 params.push_back(host);
2791 DoOneToMany(source->nick,stype,params);
2796 virtual void OnAddGLine(long duration, userrec* source, std::string reason, std::string hostmask)
2798 OnLine(source,hostmask,true,'G',duration,reason);
2801 virtual void OnAddZLine(long duration, userrec* source, std::string reason, std::string ipmask)
2803 OnLine(source,ipmask,true,'Z',duration,reason);
2806 virtual void OnAddQLine(long duration, userrec* source, std::string reason, std::string nickmask)
2808 OnLine(source,nickmask,true,'Q',duration,reason);
2811 virtual void OnAddELine(long duration, userrec* source, std::string reason, std::string hostmask)
2813 OnLine(source,hostmask,true,'E',duration,reason);
2816 virtual void OnDelGLine(userrec* source, std::string hostmask)
2818 OnLine(source,hostmask,false,'G',0,"");
2821 virtual void OnDelZLine(userrec* source, std::string ipmask)
2823 OnLine(source,ipmask,false,'Z',0,"");
2826 virtual void OnDelQLine(userrec* source, std::string nickmask)
2828 OnLine(source,nickmask,false,'Q',0,"");
2831 virtual void OnDelELine(userrec* source, std::string hostmask)
2833 OnLine(source,hostmask,false,'E',0,"");
2836 virtual void OnMode(userrec* user, void* dest, int target_type, std::string text)
2838 if ((user->fd > -1) && (user->registered == 7))
2840 if (target_type == TYPE_USER)
2842 userrec* u = (userrec*)dest;
2843 std::deque<std::string> params;
2844 params.push_back(u->nick);
2845 params.push_back(text);
2846 DoOneToMany(user->nick,"MODE",params);
2850 chanrec* c = (chanrec*)dest;
2851 std::deque<std::string> params;
2852 params.push_back(c->name);
2853 params.push_back(text);
2854 DoOneToMany(user->nick,"MODE",params);
2859 virtual void ProtoSendMode(void* opaque, int target_type, void* target, std::string modeline)
2861 TreeSocket* s = (TreeSocket*)opaque;
2864 if (target_type == TYPE_USER)
2866 userrec* u = (userrec*)target;
2867 s->WriteLine(":"+Srv->GetServerName()+" FMODE "+u->nick+" "+modeline);
2871 chanrec* c = (chanrec*)target;
2872 s->WriteLine(":"+Srv->GetServerName()+" FMODE "+c->name+" "+modeline);
2877 virtual void ProtoSendMetaData(void* opaque, int target_type, void* target, std::string extname, std::string extdata)
2879 TreeSocket* s = (TreeSocket*)opaque;
2882 if (target_type == TYPE_USER)
2884 userrec* u = (userrec*)target;
2885 s->WriteLine(":"+Srv->GetServerName()+" METADATA "+u->nick+" "+extname+" :"+extdata);
2889 chanrec* c = (chanrec*)target;
2890 s->WriteLine(":"+Srv->GetServerName()+" METADATA "+c->name+" "+extname+" :"+extdata);
2895 virtual ~ModuleSpanningTree()
2899 virtual Version GetVersion()
2901 return Version(1,0,0,0,VF_STATIC|VF_VENDOR);
2906 class ModuleSpanningTreeFactory : public ModuleFactory
2909 ModuleSpanningTreeFactory()
2913 ~ModuleSpanningTreeFactory()
2917 virtual Module * CreateModule(Server* Me)
2919 TreeProtocolModule = new ModuleSpanningTree(Me);
2920 return TreeProtocolModule;
2926 extern "C" void * init_module( void )
2928 return new ModuleSpanningTreeFactory;