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 * ---------------------------------------------------
23 #include "inspircd_config.h"
25 #include <ext/hash_map>
33 #include "helperfuncs.h"
35 #include "inspstring.h"
40 #define nspace __gnu_cxx
45 enum ServerState { LISTENER, CONNECTING, WAIT_AUTH_1, WAIT_AUTH_2, CONNECTED };
47 typedef nspace::hash_map<std::string, userrec*, nspace::hash<string>, irc::StrHashComp> user_hash;
48 extern user_hash clientlist;
53 bool DoOneToOne(std::string prefix, std::string command, std::deque<std::string> params, std::string target);
54 bool DoOneToAllButSender(std::string prefix, std::string command, std::deque<std::string> params, std::string omit);
55 bool DoOneToMany(std::string prefix, std::string command, std::deque<std::string> params);
56 bool DoOneToAllButSenderRaw(std::string data,std::string omit);
61 std::vector<TreeServer*> Children;
62 std::string ServerName;
63 std::string ServerDesc;
64 std::string VersionString;
67 TreeSocket* Socket; // for directly connected servers this points at the socket object
77 UserCount = OperCount = 0;
80 TreeServer(std::string Name, std::string Desc) : ServerName(Name), ServerDesc(Desc)
84 UserCount = OperCount = 0;
87 TreeServer(std::string Name, std::string Desc, TreeServer* Above, TreeSocket* Sock) : Parent(Above), ServerName(Name), ServerDesc(Desc), Socket(Sock)
90 UserCount = OperCount = 0;
95 return this->ServerName;
100 return this->ServerDesc;
103 std::string GetVersion()
105 return this->VersionString;
110 return this->UserCount;
115 return this->OperCount;
118 TreeSocket* GetSocket()
123 TreeServer* GetParent()
128 unsigned int ChildCount()
130 return Children.size();
133 TreeServer* GetChild(unsigned int n)
135 if (n < Children.size())
145 void AddChild(TreeServer* Child)
147 Children.push_back(Child);
150 bool DelChild(TreeServer* Child)
152 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
163 // removes child nodes of this node, and of that node, etc etc
166 bool stillchildren = true;
167 while (stillchildren)
169 stillchildren = false;
170 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
172 TreeServer* s = (TreeServer*)*a;
176 stillchildren = true;
190 std::string SendPass;
191 std::string RecvPass;
194 /* $ModDesc: Povides a spanning tree server link protocol */
198 TreeServer *TreeRoot;
199 std::vector<Link> LinkBlocks;
201 TreeServer* RouteEnumerate(TreeServer* Current, std::string ServerName)
203 if (Current->GetName() == ServerName)
205 for (unsigned int q = 0; q < Current->ChildCount(); q++)
207 TreeServer* found = RouteEnumerate(Current->GetChild(q),ServerName);
216 // Returns the locally connected server we must route a
217 // message through to reach server 'ServerName'. This
218 // only applies to one-to-one and not one-to-many routing.
219 TreeServer* BestRouteTo(std::string ServerName)
221 log(DEBUG,"Finding best route to %s",ServerName.c_str());
222 // first, find the server by recursively walking the tree
223 TreeServer* Found = RouteEnumerate(TreeRoot,ServerName);
224 // did we find it? If not, they did something wrong, abort.
227 log(DEBUG,"Failed to find %s by walking tree!",ServerName.c_str());
232 // The server exists, follow its parent nodes until
233 // the parent of the current is 'TreeRoot', we know
234 // then that this is a directly-connected server.
235 while ((Found) && (Found->GetParent() != TreeRoot))
237 Found = Found->GetParent();
239 log(DEBUG,"Route to %s is via %s",ServerName.c_str(),Found->GetName().c_str());
244 bool LookForServer(TreeServer* Current, std::string ServerName)
246 if (ServerName == Current->GetName())
248 for (unsigned int q = 0; q < Current->ChildCount(); q++)
250 if (LookForServer(Current->GetChild(q),ServerName))
258 void RFindServer(TreeServer* Current, std::string ServerName)
260 if ((ServerName == Current->GetName()) && (!Found))
263 log(DEBUG,"Found server %s desc %s",Current->GetName().c_str(),Current->GetDesc().c_str());
268 for (unsigned int q = 0; q < Current->ChildCount(); q++)
271 RFindServer(Current->GetChild(q),ServerName);
277 TreeServer* FindServer(std::string ServerName)
280 RFindServer(TreeRoot,ServerName);
284 bool IsServer(std::string ServerName)
286 return LookForServer(TreeRoot,ServerName);
289 class TreeSocket : public InspSocket
292 std::string in_buffer;
293 ServerState LinkState;
294 std::string InboundServerName;
295 std::string InboundDescription;
297 int num_lost_servers;
301 TreeSocket(std::string host, int port, bool listening, unsigned long maxtime)
302 : InspSocket(host, port, listening, maxtime)
304 Srv->Log(DEBUG,"Create new listening");
306 this->LinkState = LISTENER;
309 TreeSocket(std::string host, int port, bool listening, unsigned long maxtime, std::string ServerName)
310 : InspSocket(host, port, listening, maxtime)
312 Srv->Log(DEBUG,"Create new outbound");
314 this->LinkState = CONNECTING;
317 TreeSocket(int newfd, char* ip)
318 : InspSocket(newfd, ip)
320 Srv->Log(DEBUG,"Associate new inbound");
321 this->LinkState = WAIT_AUTH_1;
324 virtual bool OnConnected()
326 if (this->LinkState == CONNECTING)
328 Srv->SendOpers("*** Connection to "+myhost+"["+this->GetIP()+"] established.");
329 // we should send our details here.
330 // if the other side is satisfied, they send theirs.
331 // we do not need to change state here.
332 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
334 if (x->Name == this->myhost)
336 // found who we're supposed to be connecting to, send the neccessary gubbins.
337 this->WriteLine("SERVER "+Srv->GetServerName()+" "+x->SendPass+" 0 :"+Srv->GetServerDescription());
342 log(DEBUG,"Outbound connection ERROR: Could not find the right link block!");
346 virtual void OnError(InspSocketError e)
350 virtual int OnDisconnect()
355 // recursively send the server tree with distances as hops
356 void SendServers(TreeServer* Current, TreeServer* s, int hops)
359 for (unsigned int q = 0; q < Current->ChildCount(); q++)
361 TreeServer* recursive_server = Current->GetChild(q);
362 if (recursive_server != s)
364 // :source.server SERVER server.name hops :Description
365 snprintf(command,1024,":%s SERVER %s * %d :%s",Current->GetName().c_str(),recursive_server->GetName().c_str(),hops,recursive_server->GetDesc().c_str());
366 this->WriteLine(command);
367 // down to next level
368 this->SendServers(recursive_server, s, hops+1);
373 void SquitServer(TreeServer* Current)
375 // recursively squit the servers attached to 'Current'
376 for (unsigned int q = 0; q < Current->ChildCount(); q++)
378 TreeServer* recursive_server = Current->GetChild(q);
379 this->SquitServer(recursive_server);
381 // Now we've whacked the kids, whack self
382 log(DEBUG,"Deleted %s",Current->GetName().c_str());
384 bool quittingpeople = true;
385 while (quittingpeople)
387 quittingpeople = false;
388 for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
390 if (!strcasecmp(u->second->server,Current->GetName().c_str()))
392 log(DEBUG,"Quitting user %s of server %s",u->second->nick,u->second->server);
393 Srv->QuitUser(u->second,Current->GetName()+" "+std::string(Srv->GetServerName()));
395 quittingpeople = true;
402 void Squit(TreeServer* Current,std::string reason)
406 std::deque<std::string> params;
407 params.push_back(Current->GetName());
408 params.push_back(":"+reason);
409 DoOneToAllButSender(Current->GetParent()->GetName(),"SQUIT",params,Current->GetName());
410 if (Current->GetParent() == TreeRoot)
412 Srv->SendOpers("Server \002"+Current->GetName()+"\002 split: "+reason);
416 Srv->SendOpers("Server \002"+Current->GetName()+"\002 split from server \002"+Current->GetParent()->GetName()+"\002 with reason: "+reason);
418 num_lost_servers = 0;
420 SquitServer(Current);
422 Current->GetParent()->DelChild(Current);
424 WriteOpers("Netsplit complete, lost \002%d\002 users on \002%d\002 servers.", num_lost_users, num_lost_servers);
428 log(DEBUG,"Squit from unknown server");
432 bool ForceJoin(std::string source, std::deque<std::string> params)
434 if (params.size() < 1)
436 for (unsigned int channelnum = 0; channelnum < params.size(); channelnum++)
438 // process one channel at a time, applying modes.
439 char* channel = (char*)params[channelnum].c_str();
440 char permissions = *channel;
457 userrec* who = Srv->FindNick(source);
461 chanrec* chan = Srv->FindChannel(channel);
462 if ((chan) && (*chan->key))
466 Srv->JoinUserToChannel(who,channel,key);
470 modelist[0] = channel;
472 modelist[2] = who->nick;
473 Srv->SendMode(modelist,3,who);
475 DoOneToAllButSender(source,"FJOIN",params,who->server);
481 bool IntroduceClient(std::string source, std::deque<std::string> params)
483 if (params.size() < 8)
485 // NICK age nick host dhost ident +modes ip :gecos
487 std::string nick = params[1];
488 std::string host = params[2];
489 std::string dhost = params[3];
490 std::string ident = params[4];
491 time_t age = atoi(params[0].c_str());
492 std::string modes = params[5];
493 std::string ip = params[6];
494 std::string gecos = params[7];
495 char* tempnick = (char*)nick.c_str();
496 log(DEBUG,"Introduce client %s!%s@%s",tempnick,ident.c_str(),host.c_str());
498 user_hash::iterator iter;
499 iter = clientlist.find(tempnick);
500 if (iter != clientlist.end())
503 log(DEBUG,"Nick collision on %s!%s@%s",tempnick,ident.c_str(),host.c_str());
507 clientlist[tempnick] = new userrec();
508 clientlist[tempnick]->fd = FD_MAGIC_NUMBER;
509 strlcpy(clientlist[tempnick]->nick, tempnick,NICKMAX);
510 strlcpy(clientlist[tempnick]->host, host.c_str(),160);
511 strlcpy(clientlist[tempnick]->dhost, dhost.c_str(),160);
512 clientlist[tempnick]->server = (char*)FindServerNamePtr(source.c_str());
513 strlcpy(clientlist[tempnick]->ident, ident.c_str(),IDENTMAX);
514 strlcpy(clientlist[tempnick]->fullname, gecos.c_str(),MAXGECOS);
515 clientlist[tempnick]->registered = 7;
516 clientlist[tempnick]->signon = age;
517 strlcpy(clientlist[tempnick]->ip,ip.c_str(),16);
518 for (int i = 0; i < MAXCHANS; i++)
520 clientlist[tempnick]->chans[i].channel = NULL;
521 clientlist[tempnick]->chans[i].uc_modes = 0;
523 DoOneToAllButSender(source,"NICK",params,source);
527 // send all users and their channels
528 void SendUsers(TreeServer* Current)
531 for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
533 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);
534 this->WriteLine(data);
535 if (strchr(u->second->modes,'o'))
537 this->WriteLine(":"+std::string(u->second->nick)+" OPERTYPE "+std::string(u->second->oper));
539 char* chl = chlist(u->second,u->second);
542 this->WriteLine(":"+std::string(u->second->nick)+" FJOIN "+std::string(chl));
547 void DoBurst(TreeServer* s)
549 log(DEBUG,"Beginning network burst");
550 Srv->SendOpers("*** Bursting to "+s->GetName()+".");
551 this->WriteLine("BURST");
553 this->SendServers(TreeRoot,s,1);
554 // Send users and their channels
556 // TODO: Send everything else (channel modes etc)
557 this->WriteLine("ENDBURST");
560 virtual bool OnDataReady()
562 char* data = this->Read();
565 this->in_buffer += data;
566 while (in_buffer.find("\n") != std::string::npos)
568 char* line = (char*)in_buffer.c_str();
569 std::string ret = "";
570 while ((*line != '\n') && (strlen(line)))
575 if ((*line == '\n') || (*line == '\r'))
578 if (!this->ProcessLine(ret))
584 return (data != NULL);
587 int WriteLine(std::string line)
589 return this->Write(line + "\r\n");
592 bool Error(std::deque<std::string> params)
594 if (params.size() < 1)
596 std::string Errmsg = params[0];
597 std::string SName = myhost;
598 if (InboundServerName != "")
600 SName = InboundServerName;
602 Srv->SendOpers("*** ERROR from "+SName+": "+Errmsg);
603 // we will return false to cause the socket to close.
607 bool RemoteServer(std::string prefix, std::deque<std::string> params)
609 if (params.size() < 4)
611 std::string servername = params[0];
612 std::string password = params[1];
613 int hops = atoi(params[2].c_str());
614 std::string description = params[3];
617 this->WriteLine("ERROR :Protocol error - Introduced remote server with incorrect hopcount!");
620 TreeServer* ParentOfThis = FindServer(prefix);
623 this->WriteLine("ERROR :Protocol error - Introduced remote server from unknown server "+prefix);
626 TreeServer* Node = new TreeServer(servername,description,ParentOfThis,NULL);
627 ParentOfThis->AddChild(Node);
628 params[3] = ":" + params[3];
629 DoOneToAllButSender(prefix,"SERVER",params,prefix);
630 Srv->SendOpers("*** Server \002"+prefix+"\002 introduced server \002"+servername+"\002 ("+description+")");
634 bool Outbound_Reply_Server(std::deque<std::string> params)
636 if (params.size() < 4)
638 std::string servername = params[0];
639 std::string password = params[1];
640 int hops = atoi(params[2].c_str());
643 this->WriteLine("ERROR :Server too far away for authentication");
646 std::string description = params[3];
647 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
649 if ((x->Name == servername) && (x->RecvPass == password))
651 // Begin the sync here. this kickstarts the
652 // other side, waiting in WAIT_AUTH_2 state,
653 // into starting their burst, as it shows
655 this->LinkState = CONNECTED;
656 // we should add the details of this server now
657 // to the servers tree, as a child of the root
659 TreeServer* Node = new TreeServer(servername,description,TreeRoot,this);
660 TreeRoot->AddChild(Node);
661 DoOneToAllButSender(TreeRoot->GetName(),"SERVER",params,servername);
666 this->WriteLine("ERROR :Invalid credentials");
670 bool Inbound_Server(std::deque<std::string> params)
672 if (params.size() < 4)
674 std::string servername = params[0];
675 std::string password = params[1];
676 int hops = atoi(params[2].c_str());
679 this->WriteLine("ERROR :Server too far away for authentication");
682 std::string description = params[3];
683 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
685 if ((x->Name == servername) && (x->RecvPass == password))
687 Srv->SendOpers("*** Verified incoming server connection from \002"+servername+"\002["+this->GetIP()+"] ("+description+")");
688 this->InboundServerName = servername;
689 this->InboundDescription = description;
690 // this is good. Send our details: Our server name and description and hopcount of 0,
691 // along with the sendpass from this block.
692 this->WriteLine("SERVER "+Srv->GetServerName()+" "+x->SendPass+" 0 :"+Srv->GetServerDescription());
693 // move to the next state, we are now waiting for THEM.
694 this->LinkState = WAIT_AUTH_2;
698 this->WriteLine("ERROR :Invalid credentials");
702 std::deque<std::string> Split(std::string line, bool stripcolon)
704 std::deque<std::string> n;
705 std::stringstream s(line);
706 std::string param = "";
712 if ((param.c_str()[0] == ':') && (item))
714 char* str = (char*)param.c_str();
724 param = param + " " + append;
734 bool ProcessLine(std::string line)
736 Srv->Log(DEBUG,"inbound-line: '"+line+"'");
737 std::deque<std::string> params = this->Split(line,true);
738 std::string command = "";
739 std::string prefix = "";
740 if (((params[0].c_str())[0] == ':') && (params.size() > 1))
744 char* pref = (char*)prefix.c_str();
756 switch (this->LinkState)
761 // Waiting for SERVER command from remote server. Server initiating
762 // the connection sends the first SERVER command, listening server
763 // replies with theirs if its happy, then if the initiator is happy,
764 // it starts to send its net sync, which starts the merge, otherwise
765 // it sends an ERROR.
766 if (command == "SERVER")
768 return this->Inbound_Server(params);
770 else if (command == "ERROR")
772 return this->Error(params);
776 // Waiting for start of other side's netmerge to say they liked our
778 if (command == "SERVER")
780 // cant do this, they sent it to us in the WAIT_AUTH_1 state!
784 else if (command == "BURST")
786 this->LinkState = CONNECTED;
787 Node = new TreeServer(InboundServerName,InboundDescription,TreeRoot,this);
788 TreeRoot->AddChild(Node);
790 params.push_back(InboundServerName);
791 params.push_back("*");
792 params.push_back("1");
793 params.push_back(":"+InboundDescription);
794 DoOneToAllButSender(TreeRoot->GetName(),"SERVER",params,InboundServerName);
797 else if (command == "ERROR")
799 return this->Error(params);
804 this->WriteLine("ERROR :Internal error -- listening socket accepted its own descriptor!!!");
808 if (command == "SERVER")
810 // another server we connected to, which was in WAIT_AUTH_1 state,
811 // has just sent us their credentials. If we get this far, theyre
812 // happy with OUR credentials, and they are now in WAIT_AUTH_2 state.
813 // if we're happy with this, we should send our netburst which
814 // kickstarts the merge.
815 return this->Outbound_Reply_Server(params);
819 // This is the 'authenticated' state, when all passwords
820 // have been exchanged and anything past this point is taken
822 std::string target = "";
823 if ((command == "NICK") && (params.size() > 1))
825 return this->IntroduceClient(prefix,params);
827 else if (command == "FJOIN")
829 return this->ForceJoin(prefix,params);
831 else if (command == "SERVER")
833 return this->RemoteServer(prefix,params);
835 else if (command == "SQUIT")
837 if (params.size() == 2)
839 this->Squit(FindServer(params[0]),params[1]);
845 // not a special inter-server command.
846 // Emulate the actual user doing the command,
847 // this saves us having a huge ugly parser.
848 userrec* who = Srv->FindNick(prefix);
849 std::string sourceserv = this->myhost;
850 if (this->InboundServerName != "")
852 sourceserv = this->InboundServerName;
857 target = who->server;
858 char* strparams[127];
859 for (unsigned int q = 0; q < params.size(); q++)
861 strparams[q] = (char*)params[q].c_str();
863 log(DEBUG,"*** CALL COMMAND HANDLER FOR %s, SOURCE: '%s'",command.c_str(),who->nick);
864 Srv->CallCommandHandler(command, strparams, params.size(), who);
868 // its not a user. Its either a server, or somethings screwed up.
869 if (IsServer(prefix))
871 target = Srv->GetServerName();
875 log(DEBUG,"Command with unknown origin '%s'",prefix.c_str());
879 return DoOneToAllButSenderRaw(line,sourceserv);
888 virtual void OnTimeout()
890 if (this->LinkState == CONNECTING)
892 Srv->SendOpers("*** CONNECT: Connection to \002"+myhost+"\002 timed out.");
896 virtual void OnClose()
898 // Connection closed.
899 // If the connection is fully up (state CONNECTED)
900 // then propogate a netsplit to all peers.
901 std::string quitserver = this->myhost;
902 if (this->InboundServerName != "")
904 quitserver = this->InboundServerName;
906 TreeServer* s = FindServer(quitserver);
909 std::deque<std::string> params;
910 params.push_back(quitserver);
911 params.push_back(":Remote host closed the connection");
912 DoOneToAllButSender(Srv->GetServerName(),"SQUIT",params,quitserver);
913 Squit(s,"Remote host closed the connection");
917 virtual int OnIncomingConnection(int newsock, char* ip)
919 TreeSocket* s = new TreeSocket(newsock, ip);
925 bool DoOneToAllButSenderRaw(std::string data,std::string omit)
927 for (unsigned int x = 0; x < TreeRoot->ChildCount(); x++)
929 TreeServer* Route = TreeRoot->GetChild(x);
930 if ((Route->GetSocket()) && (Route->GetName() != omit) && (BestRouteTo(omit) != Route))
932 TreeSocket* Sock = Route->GetSocket();
933 log(DEBUG,"Sending RAW to %s",Route->GetName().c_str());
934 Sock->WriteLine(data);
940 bool DoOneToAllButSender(std::string prefix, std::string command, std::deque<std::string> params, std::string omit)
942 log(DEBUG,"ALLBUTONE: Comes from %s SHOULD NOT go back to %s",prefix.c_str(),omit.c_str());
943 // TODO: Special stuff with privmsg and notice
944 std::string FullLine = ":" + prefix + " " + command;
945 for (unsigned int x = 0; x < params.size(); x++)
947 FullLine = FullLine + " " + params[x];
949 for (unsigned int x = 0; x < TreeRoot->ChildCount(); x++)
951 TreeServer* Route = TreeRoot->GetChild(x);
953 // The route has a socket (its a direct connection)
954 // The route isnt the one to be omitted
955 // The route isnt the path to the one to be omitted
956 if ((Route->GetSocket()) && (Route->GetName() != omit) && (BestRouteTo(omit) != Route))
958 TreeSocket* Sock = Route->GetSocket();
959 log(DEBUG,"Sending to %s",Route->GetName().c_str());
960 Sock->WriteLine(FullLine);
966 bool DoOneToMany(std::string prefix, std::string command, std::deque<std::string> params)
968 std::string FullLine = ":" + prefix + " " + command;
969 for (unsigned int x = 0; x < params.size(); x++)
971 FullLine = FullLine + " " + params[x];
973 for (unsigned int x = 0; x < TreeRoot->ChildCount(); x++)
975 TreeServer* Route = TreeRoot->GetChild(x);
976 if (Route->GetSocket())
978 TreeSocket* Sock = Route->GetSocket();
979 Sock->WriteLine(FullLine);
985 bool DoOneToOne(std::string prefix, std::string command, std::deque<std::string> params, std::string target)
987 TreeServer* Route = BestRouteTo(target);
990 std::string FullLine = ":" + prefix + " " + command;
991 for (unsigned int x = 0; x < params.size(); x++)
993 FullLine = FullLine + " " + params[x];
995 if (Route->GetSocket())
997 TreeSocket* Sock = Route->GetSocket();
998 Sock->WriteLine(FullLine);
1004 log(DEBUG,"Could not route message with target %s: %s",target.c_str(),command.c_str());
1010 class ModuleSpanningTree : public Module
1012 std::vector<TreeSocket*> Bindings;
1017 void ReadConfiguration(bool rebind)
1021 for (int j =0; j < Conf->Enumerate("bind"); j++)
1023 std::string Type = Conf->ReadValue("bind","type",j);
1024 std::string IP = Conf->ReadValue("bind","address",j);
1025 long Port = Conf->ReadInteger("bind","port",j,true);
1026 if (Type == "servers")
1032 TreeSocket* listener = new TreeSocket(IP.c_str(),Port,true,10);
1033 if (listener->GetState() == I_LISTENING)
1035 Srv->AddSocket(listener);
1036 Bindings.push_back(listener);
1040 log(DEFAULT,"m_spanningtree: Warning: Failed to bind server port %d",Port);
1048 for (int j =0; j < Conf->Enumerate("link"); j++)
1051 L.Name = Conf->ReadValue("link","name",j);
1052 L.IPAddr = Conf->ReadValue("link","ipaddr",j);
1053 L.Port = Conf->ReadInteger("link","port",j,true);
1054 L.SendPass = Conf->ReadValue("link","sendpass",j);
1055 L.RecvPass = Conf->ReadValue("link","recvpass",j);
1056 LinkBlocks.push_back(L);
1057 log(DEBUG,"m_spanningtree: Read server %s with host %s:%d",L.Name.c_str(),L.IPAddr.c_str(),L.Port);
1061 ModuleSpanningTree()
1064 Conf = new ConfigReader;
1067 // Create the root of the tree
1068 TreeRoot = new TreeServer(Srv->GetServerName(),Srv->GetServerDescription());
1070 ReadConfiguration(true);
1073 void ShowLinks(TreeServer* Current, userrec* user, int hops)
1075 std::string Parent = TreeRoot->GetName();
1076 if (Current->GetParent())
1078 Parent = Current->GetParent()->GetName();
1080 for (unsigned int q = 0; q < Current->ChildCount(); q++)
1082 ShowLinks(Current->GetChild(q),user,hops+1);
1084 WriteServ(user->fd,"364 %s %s %s :%d %s",user->nick,Current->GetName().c_str(),Parent.c_str(),hops,Current->GetDesc().c_str());
1087 void HandleLinks(char** parameters, int pcnt, userrec* user)
1089 ShowLinks(TreeRoot,user,0);
1090 WriteServ(user->fd,"365 %s * :End of /LINKS list.",user->nick);
1094 void HandleLusers(char** parameters, int pcnt, userrec* user)
1099 // WARNING: NOT THREAD SAFE - DONT GET ANY SMART IDEAS.
1101 void ShowMap(TreeServer* Current, userrec* user, int depth, char matrix[128][80])
1105 for (int t = 0; t < depth; t++)
1107 matrix[line][t] = ' ';
1109 strlcpy(&matrix[line][depth],Current->GetName().c_str(),80);
1111 for (unsigned int q = 0; q < Current->ChildCount(); q++)
1113 ShowMap(Current->GetChild(q),user,depth+2,matrix);
1118 // Ok, prepare to be confused.
1119 // After much mulling over how to approach this, it struck me that
1120 // the 'usual' way of doing a /MAP isnt the best way. Instead of
1121 // keeping track of a ton of ascii characters, and line by line
1122 // under recursion working out where to place them using multiplications
1123 // and divisons, we instead render the map onto a backplane of characters
1124 // (a character matrix), then draw the branches as a series of "L" shapes
1125 // from the nodes. This is not only friendlier on CPU it uses less stack.
1127 void HandleMap(char** parameters, int pcnt, userrec* user)
1129 // This array represents a virtual screen which we will
1130 // "scratch" draw to, as the console device of an irc
1131 // client does not provide for a proper terminal.
1132 char matrix[128][80];
1133 for (unsigned int t = 0; t < 128; t++)
1135 matrix[t][0] = '\0';
1138 // The only recursive bit is called here.
1139 ShowMap(TreeRoot,user,0,matrix);
1140 // Process each line one by one. The algorithm has a limit of
1141 // 128 servers (which is far more than a spanning tree should have
1142 // anyway, so we're ok). This limit can be raised simply by making
1143 // the character matrix deeper, 128 rows taking 10k of memory.
1144 for (int l = 1; l < line; l++)
1146 // scan across the line looking for the start of the
1147 // servername (the recursive part of the algorithm has placed
1148 // the servers at indented positions depending on what they
1150 int first_nonspace = 0;
1151 while (matrix[l][first_nonspace] == ' ')
1156 // Draw the `- (corner) section: this may be overwritten by
1157 // another L shape passing along the same vertical pane, becoming
1158 // a |- (branch) section instead.
1159 matrix[l][first_nonspace] = '-';
1160 matrix[l][first_nonspace-1] = '`';
1162 // Draw upwards until we hit the parent server, causing possibly
1163 // other corners (`-) to become branches (|-)
1164 while ((matrix[l2][first_nonspace-1] == ' ') || (matrix[l2][first_nonspace-1] == '`'))
1166 matrix[l2][first_nonspace-1] = '|';
1170 // dump the whole lot to the user. This is the easy bit, honest.
1171 for (int t = 0; t < line; t++)
1173 WriteServ(user->fd,"006 %s :%s",user->nick,&matrix[t][0]);
1175 WriteServ(user->fd,"007 %s :End of /MAP",user->nick);
1179 int HandleSquit(char** parameters, int pcnt, userrec* user)
1184 int HandleConnect(char** parameters, int pcnt, userrec* user)
1186 for (std::vector<Link>::iterator x = LinkBlocks.begin(); x < LinkBlocks.end(); x++)
1188 if (Srv->MatchText(x->Name.c_str(),parameters[0]))
1190 WriteServ(user->fd,"NOTICE %s :*** CONNECT: Connecting to server: %s (%s:%d)",user->nick,x->Name.c_str(),x->IPAddr.c_str(),x->Port);
1191 TreeSocket* newsocket = new TreeSocket(x->IPAddr,x->Port,false,10,x->Name);
1192 Srv->AddSocket(newsocket);
1196 WriteServ(user->fd,"NOTICE %s :*** CONNECT: No matching server could be found in the config file.",user->nick);
1200 virtual int OnPreCommand(std::string command, char **parameters, int pcnt, userrec *user)
1202 if (command == "CONNECT")
1204 return this->HandleConnect(parameters,pcnt,user);
1206 else if (command == "SQUIT")
1208 return this->HandleSquit(parameters,pcnt,user);
1210 else if (command == "MAP")
1212 this->HandleMap(parameters,pcnt,user);
1215 else if (command == "LUSERS")
1217 this->HandleLusers(parameters,pcnt,user);
1220 else if (command == "LINKS")
1222 this->HandleLinks(parameters,pcnt,user);
1228 virtual void OnUserNotice(userrec* user, void* dest, int target_type, std::string text)
1230 if (target_type == TYPE_USER)
1232 userrec* d = (userrec*)dest;
1233 if ((std::string(d->server) != Srv->GetServerName()) && (std::string(user->server) == Srv->GetServerName()))
1235 std::deque<std::string> params;
1237 params.push_back(d->nick);
1238 params.push_back(":"+text);
1239 DoOneToOne(user->nick,"NOTICE",params,d->server);
1244 if (std::string(user->server) == Srv->GetServerName())
1246 chanrec *c = (chanrec*)dest;
1247 std::deque<std::string> params;
1248 params.push_back(c->name);
1249 params.push_back(":"+text);
1250 DoOneToMany(user->nick,"NOTICE",params);
1255 virtual void OnUserMessage(userrec* user, void* dest, int target_type, std::string text)
1257 if (target_type == TYPE_USER)
1259 // route private messages which are targetted at clients only to the server
1260 // which needs to receive them
1261 userrec* d = (userrec*)dest;
1262 if ((std::string(d->server) != Srv->GetServerName()) && (std::string(user->server) == Srv->GetServerName()))
1264 std::deque<std::string> params;
1266 params.push_back(d->nick);
1267 params.push_back(":"+text);
1268 DoOneToOne(user->nick,"PRIVMSG",params,d->server);
1273 if (std::string(user->server) == Srv->GetServerName())
1275 chanrec *c = (chanrec*)dest;
1276 std::deque<std::string> params;
1277 params.push_back(c->name);
1278 params.push_back(":"+text);
1279 DoOneToMany(user->nick,"PRIVMSG",params);
1284 virtual void OnUserJoin(userrec* user, chanrec* channel)
1286 // Only do this for local users
1287 if (std::string(user->server) == Srv->GetServerName())
1289 log(DEBUG,"**** User on %s JOINS %s",user->server,channel->name);
1290 std::deque<std::string> params;
1292 params.push_back(channel->name);
1295 log(DEBUG,"**** With key %s",channel->key);
1296 // if the channel has a key, force the join by emulating the key.
1297 params.push_back(channel->key);
1299 DoOneToMany(user->nick,"JOIN",params);
1303 virtual void OnUserPart(userrec* user, chanrec* channel)
1305 if (std::string(user->server) == Srv->GetServerName())
1307 log(DEBUG,"**** User on %s PARTS %s",user->server,channel->name);
1308 std::deque<std::string> params;
1310 params.push_back(channel->name);
1311 DoOneToMany(user->nick,"PART",params);
1315 virtual ~ModuleSpanningTree()
1320 virtual Version GetVersion()
1322 return Version(1,0,0,0,VF_STATIC|VF_VENDOR);
1327 class ModuleSpanningTreeFactory : public ModuleFactory
1330 ModuleSpanningTreeFactory()
1334 ~ModuleSpanningTreeFactory()
1338 virtual Module * CreateModule()
1340 return new ModuleSpanningTree;
1346 extern "C" void * init_module( void )
1348 return new ModuleSpanningTreeFactory;