1 /* +------------------------------------+
2 * | Inspire Internet Relay Chat Daemon |
3 * +------------------------------------+
5 * InspIRCd: (C) 2002-2007 InspIRCd Development Team
6 * See: http://www.inspircd.org/wiki/index.php/Credits
8 * This program is free but copyrighted software; see
9 * the file COPYING for details.
11 * ---------------------------------------------------
15 #include "configreader.h"
19 #include "commands/cmd_whois.h"
20 #include "commands/cmd_stats.h"
24 #include "transport.h"
26 #include "m_spanningtree/utils.h"
27 #include "m_spanningtree/treeserver.h"
29 /* $ModDep: m_spanningtree/utils.h m_spanningtree/treeserver.h */
31 TreeServer::TreeServer(SpanningTreeUtilities* Util, InspIRCd* Instance) : ServerInstance(Instance), Utils(Util)
36 VersionString.clear();
37 UserCount = OperCount = 0;
40 VersionString = ServerInstance->GetVersionString();
43 /** We use this constructor only to create the 'root' item, Utils->TreeRoot, which
44 * represents our own server. Therefore, it has no route, no parent, and
45 * no socket associated with it. Its version string is our own local version.
47 TreeServer::TreeServer(SpanningTreeUtilities* Util, InspIRCd* Instance, std::string Name, std::string Desc) : ServerInstance(Instance), ServerName(Name.c_str()), ServerDesc(Desc), Utils(Util)
50 VersionString.clear();
51 UserCount = ServerInstance->UserCount();
52 OperCount = ServerInstance->OperCount();
53 VersionString = ServerInstance->GetVersionString();
55 Socket = NULL; /* Fix by brain */
61 /** When we create a new server, we call this constructor to initialize it.
62 * This constructor initializes the server's Route and Parent, and sets up
63 * its ping counters so that it will be pinged one minute from now.
65 TreeServer::TreeServer(SpanningTreeUtilities* Util, InspIRCd* Instance, std::string Name, std::string Desc, TreeServer* Above, TreeSocket* Sock, bool Hide)
66 : ServerInstance(Instance), Parent(Above), ServerName(Name.c_str()), ServerDesc(Desc), Socket(Sock), Utils(Util), Hidden(Hide)
68 VersionString.clear();
69 UserCount = OperCount = 0;
70 this->SetNextPingTime(time(NULL) + Utils->PingFreq);
73 /* find the 'route' for this server (e.g. the one directly connected
74 * to the local server, which we can use to reach it)
76 * In the following example, consider we have just added a TreeServer
77 * class for server G on our network, of which we are server A.
78 * To route traffic to G (marked with a *) we must send the data to
79 * B (marked with a +) so this algorithm initializes the 'Route'
80 * value to point at whichever server traffic must be routed through
81 * to get here. If we were to try this algorithm with server B,
82 * the Route pointer would point at its own object ('this').
92 * We only run this algorithm when a server is created, as
93 * the routes remain constant while ever the server exists, and
94 * do not need to be re-calculated.
98 if (Route == Utils->TreeRoot)
104 while (this->Route->GetParent() != Utils->TreeRoot)
106 this->Route = Route->GetParent();
110 /* Because recursive code is slow and takes a lot of resources,
111 * we store two representations of the server tree. The first
112 * is a recursive structure where each server references its
113 * children and its parent, which is used for netbursts and
114 * netsplits to dump the whole dataset to the other server,
115 * and the second is used for very fast lookups when routing
116 * messages and is instead a hash_map, where each item can
117 * be referenced by its server name. The AddHashEntry()
118 * call below automatically inserts each TreeServer class
119 * into the hash_map as it is created. There is a similar
120 * maintainance call in the destructor to tidy up deleted
124 this->AddHashEntry();
127 std::string& TreeServer::GetID()
132 void TreeServer::SetID(const std::string &id)
135 server_hash::iterator iter = Utils->sidlist.find(sid);
136 if (iter == Utils->sidlist.end())
137 Utils->sidlist[sid] = this;
139 throw CoreException("Server ID '"+id+"' already exists!");
142 int TreeServer::QuitUsers(const std::string &reason)
144 const char* reason_s = reason.c_str();
145 std::vector<userrec*> time_to_die;
146 for (user_hash::iterator n = ServerInstance->clientlist->begin(); n != ServerInstance->clientlist->end(); n++)
148 if (!strcmp(n->second->server, this->ServerName.c_str()))
150 time_to_die.push_back(n->second);
153 for (std::vector<userrec*>::iterator n = time_to_die.begin(); n != time_to_die.end(); n++)
155 userrec* a = (userrec*)*n;
158 if (ServerInstance->Config->HideSplits)
159 userrec::QuitUser(ServerInstance, a, "*.net *.split", reason_s);
161 userrec::QuitUser(ServerInstance, a, reason_s);
163 if (this->Utils->quiet_bursts)
164 ServerInstance->GlobalCulls.MakeSilent(a);
167 return time_to_die.size();
170 /** This method is used to add the structure to the
171 * hash_map for linear searches. It is only called
172 * by the constructors.
174 void TreeServer::AddHashEntry()
176 server_hash::iterator iter = Utils->serverlist.find(this->ServerName.c_str());
177 if (iter == Utils->serverlist.end())
178 Utils->serverlist[this->ServerName.c_str()] = this;
181 /** This method removes the reference to this object
182 * from the hash_map which is used for linear searches.
183 * It is only called by the default destructor.
185 void TreeServer::DelHashEntry()
187 server_hash::iterator iter = Utils->serverlist.find(this->ServerName.c_str());
188 if (iter != Utils->serverlist.end())
189 Utils->serverlist.erase(iter);
192 /** These accessors etc should be pretty self-
195 TreeServer* TreeServer::GetRoute()
200 std::string TreeServer::GetName()
202 return ServerName.c_str();
205 std::string TreeServer::GetDesc()
210 std::string TreeServer::GetVersion()
212 return VersionString;
215 void TreeServer::SetNextPingTime(time_t t)
218 LastPingWasGood = false;
221 time_t TreeServer::NextPingTime()
226 bool TreeServer::AnsweredLastPing()
228 return LastPingWasGood;
231 void TreeServer::SetPingFlag()
233 LastPingWasGood = true;
236 int TreeServer::GetUserCount()
241 void TreeServer::AddUserCount()
246 void TreeServer::DelUserCount()
251 int TreeServer::GetOperCount()
256 TreeSocket* TreeServer::GetSocket()
261 TreeServer* TreeServer::GetParent()
266 void TreeServer::SetVersion(const std::string &Version)
268 VersionString = Version;
271 unsigned int TreeServer::ChildCount()
273 return Children.size();
276 TreeServer* TreeServer::GetChild(unsigned int n)
278 if (n < Children.size())
280 /* Make sure they cant request
281 * an out-of-range object. After
282 * all we know what these programmer
283 * types are like *grin*.
293 void TreeServer::AddChild(TreeServer* Child)
295 Children.push_back(Child);
298 bool TreeServer::DelChild(TreeServer* Child)
300 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
311 /** Removes child nodes of this node, and of that node, etc etc.
312 * This is used during netsplits to automatically tidy up the
313 * server tree. It is slow, we don't use it for much else.
315 bool TreeServer::Tidy()
317 bool stillchildren = true;
318 while (stillchildren)
320 stillchildren = false;
321 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
323 TreeServer* s = (TreeServer*)*a;
327 stillchildren = true;
334 TreeServer::~TreeServer()
336 /* We'd better tidy up after ourselves, eh? */
337 this->DelHashEntry();
339 server_hash::iterator iter = Utils->sidlist.find(GetID());
340 if (iter != Utils->sidlist.end())
341 Utils->sidlist.erase(iter);