1 /* +------------------------------------+
2 * | Inspire Internet Relay Chat Daemon |
3 * +------------------------------------+
5 * InspIRCd: (C) 2002-2008 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 "commands/cmd_whois.h"
16 #include "commands/cmd_stats.h"
20 #include "transport.h"
22 #include "m_spanningtree/utils.h"
23 #include "m_spanningtree/treeserver.h"
25 /* $ModDep: m_spanningtree/utils.h m_spanningtree/treeserver.h */
27 TreeServer::TreeServer(SpanningTreeUtilities* Util, InspIRCd* Instance, const std::string &id) : ServerInstance(Instance), Utils(Util)
33 VersionString.clear();
34 ServerUserCount = ServerOperCount = 0;
36 Warned = Hidden = DupError = false;
37 VersionString = ServerInstance->GetVersionString();
41 /** We use this constructor only to create the 'root' item, Utils->TreeRoot, which
42 * represents our own server. Therefore, it has no route, no parent, and
43 * no socket associated with it. Its version string is our own local version.
45 TreeServer::TreeServer(SpanningTreeUtilities* Util, InspIRCd* Instance, std::string Name, std::string Desc, const std::string &id)
46 : ServerInstance(Instance), ServerName(Name.c_str()), ServerDesc(Desc), Utils(Util)
50 VersionString.clear();
51 ServerUserCount = ServerOperCount = 0;
52 VersionString = ServerInstance->GetVersionString();
54 Socket = NULL; /* Fix by brain */
56 Warned = Hidden = DupError = false;
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, const std::string &id, TreeServer* Above, TreeSocket* Sock, bool Hide)
66 : ServerInstance(Instance), Parent(Above), ServerName(Name.c_str()), ServerDesc(Desc), Socket(Sock), Utils(Util), Hidden(Hide)
69 VersionString.clear();
70 ServerUserCount = ServerOperCount = 0;
71 this->SetNextPingTime(time(NULL) + Utils->PingFreq);
73 Warned = DupError = false;
77 gettimeofday(&t, NULL);
78 long ts = (t.tv_sec * 1000) + (t.tv_usec / 1000);
79 this->StartBurst = ts;
80 Instance->Logs->Log("m_spanningtree",DEBUG, "Started bursting at time %lu", ts);
82 /* find the 'route' for this server (e.g. the one directly connected
83 * to the local server, which we can use to reach it)
85 * In the following example, consider we have just added a TreeServer
86 * class for server G on our network, of which we are server A.
87 * To route traffic to G (marked with a *) we must send the data to
88 * B (marked with a +) so this algorithm initializes the 'Route'
89 * value to point at whichever server traffic must be routed through
90 * to get here. If we were to try this algorithm with server B,
91 * the Route pointer would point at its own object ('this').
101 * We only run this algorithm when a server is created, as
102 * the routes remain constant while ever the server exists, and
103 * do not need to be re-calculated.
107 if (Route == Utils->TreeRoot)
113 while (this->Route->GetParent() != Utils->TreeRoot)
115 this->Route = Route->GetParent();
119 /* Because recursive code is slow and takes a lot of resources,
120 * we store two representations of the server tree. The first
121 * is a recursive structure where each server references its
122 * children and its parent, which is used for netbursts and
123 * netsplits to dump the whole dataset to the other server,
124 * and the second is used for very fast lookups when routing
125 * messages and is instead a hash_map, where each item can
126 * be referenced by its server name. The AddHashEntry()
127 * call below automatically inserts each TreeServer class
128 * into the hash_map as it is created. There is a similar
129 * maintainance call in the destructor to tidy up deleted
133 this->AddHashEntry();
138 std::string& TreeServer::GetID()
143 void TreeServer::FinishBurst()
145 this->bursting = false;
146 ServerInstance->XLines->ApplyLines();
148 gettimeofday(&t, NULL);
149 long ts = (t.tv_sec * 1000) + (t.tv_usec / 1000);
150 unsigned long bursttime = ts - this->StartBurst;
151 ServerInstance->SNO->WriteToSnoMask('l', "Received end of netburst from \2%s\2 (burst time: %lu %s)", ServerName.c_str(), (bursttime > 1000 ? bursttime / 1000 : bursttime), (bursttime > 1000 ? "secs" : "msecs"));
152 Event rmode((char*)ServerName.c_str(), (Module*)Utils->Creator, "new_server");
153 rmode.Send(ServerInstance);
156 void TreeServer::SetID(const std::string &id)
158 ServerInstance->Logs->Log("m_spanningtree",DEBUG, "Setting SID to " + id);
160 server_hash::iterator iter = Utils->sidlist.find(sid);
161 if (iter == Utils->sidlist.end())
162 Utils->sidlist[sid] = this;
167 bool TreeServer::DuplicateID()
172 int TreeServer::QuitUsers(const std::string &reason)
174 const char* reason_s = reason.c_str();
175 std::vector<User*> time_to_die;
176 for (user_hash::iterator n = ServerInstance->Users->clientlist->begin(); n != ServerInstance->Users->clientlist->end(); n++)
178 if (!strcmp(n->second->server, this->ServerName.c_str()))
180 time_to_die.push_back(n->second);
183 for (std::vector<User*>::iterator n = time_to_die.begin(); n != time_to_die.end(); n++)
188 if (ServerInstance->Config->HideSplits)
189 User::QuitUser(ServerInstance, a, "*.net *.split", reason_s);
191 User::QuitUser(ServerInstance, a, reason_s);
193 if (this->Utils->quiet_bursts)
194 ServerInstance->GlobalCulls.MakeSilent(a);
197 return time_to_die.size();
200 /** This method is used to add the structure to the
201 * hash_map for linear searches. It is only called
202 * by the constructors.
204 void TreeServer::AddHashEntry()
206 server_hash::iterator iter = Utils->serverlist.find(this->ServerName.c_str());
207 if (iter == Utils->serverlist.end())
208 Utils->serverlist[this->ServerName.c_str()] = this;
211 /** This method removes the reference to this object
212 * from the hash_map which is used for linear searches.
213 * It is only called by the default destructor.
215 void TreeServer::DelHashEntry()
217 server_hash::iterator iter = Utils->serverlist.find(this->ServerName.c_str());
218 if (iter != Utils->serverlist.end())
219 Utils->serverlist.erase(iter);
222 /** These accessors etc should be pretty self-
225 TreeServer* TreeServer::GetRoute()
230 std::string TreeServer::GetName()
232 return ServerName.c_str();
235 std::string TreeServer::GetDesc()
240 std::string TreeServer::GetVersion()
242 return VersionString;
245 void TreeServer::SetNextPingTime(time_t t)
248 LastPingWasGood = false;
251 time_t TreeServer::NextPingTime()
256 bool TreeServer::AnsweredLastPing()
258 return LastPingWasGood;
261 void TreeServer::SetPingFlag()
263 LastPingWasGood = true;
266 unsigned int TreeServer::GetUserCount()
268 return ServerUserCount;
271 void TreeServer::SetUserCount(int diff)
273 ServerUserCount += diff;
276 void TreeServer::SetOperCount(int diff)
278 ServerOperCount += diff;
281 unsigned int TreeServer::GetOperCount()
283 return ServerOperCount;
286 TreeSocket* TreeServer::GetSocket()
291 TreeServer* TreeServer::GetParent()
296 void TreeServer::SetVersion(const std::string &Version)
298 VersionString = Version;
301 unsigned int TreeServer::ChildCount()
303 return Children.size();
306 TreeServer* TreeServer::GetChild(unsigned int n)
308 if (n < Children.size())
310 /* Make sure they cant request
311 * an out-of-range object. After
312 * all we know what these programmer
313 * types are like *grin*.
323 void TreeServer::AddChild(TreeServer* Child)
325 Children.push_back(Child);
328 bool TreeServer::DelChild(TreeServer* Child)
330 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
341 /** Removes child nodes of this node, and of that node, etc etc.
342 * This is used during netsplits to automatically tidy up the
343 * server tree. It is slow, we don't use it for much else.
345 bool TreeServer::Tidy()
347 bool stillchildren = true;
348 while (stillchildren)
350 stillchildren = false;
351 for (std::vector<TreeServer*>::iterator a = Children.begin(); a < Children.end(); a++)
353 TreeServer* s = (TreeServer*)*a;
357 stillchildren = true;
364 TreeServer::~TreeServer()
366 /* We'd better tidy up after ourselves, eh? */
367 this->DelHashEntry();
369 server_hash::iterator iter = Utils->sidlist.find(GetID());
370 if (iter != Utils->sidlist.end())
371 Utils->sidlist.erase(iter);