2 * InspIRCd -- Internet Relay Chat Daemon
4 * Copyright (C) 2009 Daniel De Graaf <danieldg@inspircd.org>
5 * Copyright (C) 2007-2008 Craig Edwards <craigedwards@brainbox.cc>
6 * Copyright (C) 2008 Robin Burchell <robin+git@viroteck.net>
7 * Copyright (C) 2007 Dennis Friis <peavey@inspircd.org>
9 * This file is part of InspIRCd. InspIRCd is free software: you can
10 * redistribute it and/or modify it under the terms of the GNU General Public
11 * License as published by the Free Software Foundation, version 2.
13 * This program is distributed in the hope that it will be useful, but WITHOUT
14 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
15 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
18 * You should have received a copy of the GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
26 #include "modules/spanningtree.h"
29 #include "treeserver.h"
31 /** We use this constructor only to create the 'root' item, Utils->TreeRoot, which
32 * represents our own server. Therefore, it has no route, no parent, and
33 * no socket associated with it. Its version string is our own local version.
35 TreeServer::TreeServer()
36 : Server(ServerInstance->Config->ServerName, ServerInstance->Config->ServerDesc)
37 , Parent(NULL), Route(NULL)
38 , VersionString(ServerInstance->GetVersionString()), Socket(NULL), sid(ServerInstance->Config->GetSID()), ServerUser(ServerInstance->FakeClient)
39 , age(ServerInstance->Time()), Warned(false), bursting(false), UserCount(0), OperCount(0), rtt(0), StartBurst(0), Hidden(false)
44 /** When we create a new server, we call this constructor to initialize it.
45 * This constructor initializes the server's Route and Parent, and sets up
46 * its ping counters so that it will be pinged one minute from now.
48 TreeServer::TreeServer(const std::string& Name, const std::string& Desc, const std::string& id, TreeServer* Above, TreeSocket* Sock, bool Hide)
50 , Parent(Above), Socket(Sock), sid(id), ServerUser(new FakeUser(id, this))
51 , age(ServerInstance->Time()), Warned(false), bursting(true), UserCount(0), OperCount(0), rtt(0), Hidden(Hide)
54 SetNextPingTime(ServerInstance->Time() + Utils->PingFreq);
57 long ts = ServerInstance->Time() * 1000 + (ServerInstance->Time_ns() / 1000000);
58 this->StartBurst = ts;
59 ServerInstance->Logs->Log(MODNAME, LOG_DEBUG, "Server %s started bursting at time %lu", sid.c_str(), ts);
61 /* find the 'route' for this server (e.g. the one directly connected
62 * to the local server, which we can use to reach it)
64 * In the following example, consider we have just added a TreeServer
65 * class for server G on our network, of which we are server A.
66 * To route traffic to G (marked with a *) we must send the data to
67 * B (marked with a +) so this algorithm initializes the 'Route'
68 * value to point at whichever server traffic must be routed through
69 * to get here. If we were to try this algorithm with server B,
70 * the Route pointer would point at its own object ('this').
80 * We only run this algorithm when a server is created, as
81 * the routes remain constant while ever the server exists, and
82 * do not need to be re-calculated.
86 if (Route == Utils->TreeRoot)
92 while (this->Route->GetParent() != Utils->TreeRoot)
94 this->Route = Route->GetParent();
98 /* Because recursive code is slow and takes a lot of resources,
99 * we store two representations of the server tree. The first
100 * is a recursive structure where each server references its
101 * children and its parent, which is used for netbursts and
102 * netsplits to dump the whole dataset to the other server,
103 * and the second is used for very fast lookups when routing
104 * messages and is instead a hash_map, where each item can
105 * be referenced by its server name. The AddHashEntry()
106 * call below automatically inserts each TreeServer class
107 * into the hash_map as it is created. There is a similar
108 * maintainance call in the destructor to tidy up deleted
112 this->AddHashEntry();
115 const std::string& TreeServer::GetID()
120 void TreeServer::FinishBurstInternal()
122 this->bursting = false;
123 SetNextPingTime(ServerInstance->Time() + Utils->PingFreq);
125 for (ChildServers::const_iterator i = Children.begin(); i != Children.end(); ++i)
127 TreeServer* child = *i;
128 child->FinishBurstInternal();
132 void TreeServer::FinishBurst()
134 FinishBurstInternal();
135 ServerInstance->XLines->ApplyLines();
136 long ts = ServerInstance->Time() * 1000 + (ServerInstance->Time_ns() / 1000000);
137 unsigned long bursttime = ts - this->StartBurst;
138 ServerInstance->SNO->WriteToSnoMask(Parent == Utils->TreeRoot ? 'l' : 'L', "Received end of netburst from \2%s\2 (burst time: %lu %s)",
139 GetName().c_str(), (bursttime > 10000 ? bursttime / 1000 : bursttime), (bursttime > 10000 ? "secs" : "msecs"));
140 AddServerEvent(Utils->Creator, GetName());
143 int TreeServer::QuitUsers(const std::string &reason)
145 std::string publicreason = ServerInstance->Config->HideSplits ? "*.net *.split" : reason;
147 const user_hash& users = ServerInstance->Users->GetUsers();
148 unsigned int original_size = users.size();
149 for (user_hash::const_iterator i = users.begin(); i != users.end(); )
151 User* user = i->second;
152 // Increment the iterator now because QuitUser() removes the user from the container
154 if (user->server == this)
155 ServerInstance->Users->QuitUser(user, publicreason, &reason);
157 return original_size - users.size();
160 void TreeServer::CheckULine()
162 uline = silentuline = false;
164 ConfigTagList tags = ServerInstance->Config->ConfTags("uline");
165 for (ConfigIter i = tags.first; i != tags.second; ++i)
167 ConfigTag* tag = i->second;
168 std::string server = tag->getString("server");
169 if (!strcasecmp(server.c_str(), GetName().c_str()))
173 ServerInstance->Logs->Log(MODNAME, LOG_DEFAULT, "Servers should not uline themselves (at " + tag->getTagLocation() + ")");
178 silentuline = tag->getBool("silent");
184 /** This method is used to add the structure to the
185 * hash_map for linear searches. It is only called
186 * by the constructors.
188 void TreeServer::AddHashEntry()
190 Utils->serverlist[GetName()] = this;
191 Utils->sidlist[sid] = this;
194 /** These accessors etc should be pretty self-
197 TreeServer* TreeServer::GetRoute()
202 const std::string& TreeServer::GetVersion()
204 return VersionString;
207 void TreeServer::SetNextPingTime(time_t t)
210 LastPingWasGood = false;
213 time_t TreeServer::NextPingTime()
218 bool TreeServer::AnsweredLastPing()
220 return LastPingWasGood;
223 void TreeServer::SetPingFlag()
225 LastPingWasGood = true;
228 TreeSocket* TreeServer::GetSocket()
233 TreeServer* TreeServer::GetParent()
238 void TreeServer::SetVersion(const std::string &Version)
240 VersionString = Version;
243 void TreeServer::AddChild(TreeServer* Child)
245 Children.push_back(Child);
248 bool TreeServer::DelChild(TreeServer* Child)
250 std::vector<TreeServer*>::iterator it = std::find(Children.begin(), Children.end(), Child);
251 if (it != Children.end())
259 /** Removes child nodes of this node, and of that node, etc etc.
260 * This is used during netsplits to automatically tidy up the
261 * server tree. It is slow, we don't use it for much else.
263 void TreeServer::Tidy()
267 std::vector<TreeServer*>::iterator a = Children.begin();
268 if (a == Children.end())
278 CullResult TreeServer::cull()
282 return classbase::cull();
285 TreeServer::~TreeServer()
287 /* We'd better tidy up after ourselves, eh? */
291 Utils->sidlist.erase(sid);
292 Utils->serverlist.erase(GetName());