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>
8 * This file is part of InspIRCd. InspIRCd is free software: you can
9 * redistribute it and/or modify it under the terms of the GNU General Public
10 * License as published by the Free Software Foundation, version 2.
12 * This program is distributed in the hope that it will be useful, but WITHOUT
13 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
14 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
17 * You should have received a copy of the GNU General Public License
18 * along with this program. If not, see <http://www.gnu.org/licenses/>.
26 #include "treeserver.h"
29 CommandMap::CommandMap(Module* Creator)
30 : Command(Creator, "MAP", 0, 1)
35 std::string CommandMap::MapOperInfo(TreeServer* Current)
37 time_t secs_up = ServerInstance->Time() - Current->age;
38 return " [Up: " + ModuleSpanningTree::TimeToStr(secs_up) + (Current->rtt == 0 ? "]" : " Lag: " + ConvToStr(Current->rtt) + "ms]");
41 void CommandMap::ShowMap(TreeServer* Current, User* user, int depth, int &line, char* names, int &maxnamew, char* stats)
43 ServerInstance->Logs->Log(MODNAME, LOG_DEBUG, "ShowMap depth %d on line %d", depth, line);
46 if (ServerInstance->Users->clientlist->size() == 0)
48 // If there are no users, WHO THE HELL DID THE /MAP?!?!?!
53 percent = Current->UserCount * 100.0 / ServerInstance->Users->clientlist->size();
56 const std::string operdata = user->IsOper() ? MapOperInfo(Current) : "";
58 char* myname = names + 100 * line;
59 char* mystat = stats + 50 * line;
60 memset(myname, ' ', depth);
65 w += snprintf(myname + depth, 99 - depth, "%s (%s)", Current->GetName().c_str(), Current->GetID().c_str());
69 w += snprintf(myname + depth, 99 - depth, "%s", Current->GetName().c_str());
71 memset(myname + w, ' ', 100 - w);
74 snprintf(mystat, 49, "%5d [%5.2f%%]%s", Current->UserCount, percent, operdata.c_str());
78 if (user->IsOper() || !Utils->FlatLinks)
81 const TreeServer::ChildServers& servers = Current->GetChildren();
82 for (TreeServer::ChildServers::const_iterator i = servers.begin(); i != servers.end(); ++i)
84 TreeServer* child = *i;
85 if (!user->IsOper()) {
88 if ((Utils->HideULines) && (ServerInstance->ULine(child->GetName())))
91 ShowMap(child, user, depth, line, names, maxnamew, stats);
96 // Ok, prepare to be confused.
97 // After much mulling over how to approach this, it struck me that
98 // the 'usual' way of doing a /MAP isnt the best way. Instead of
99 // keeping track of a ton of ascii characters, and line by line
100 // under recursion working out where to place them using multiplications
101 // and divisons, we instead render the map onto a backplane of characters
102 // (a character matrix), then draw the branches as a series of "L" shapes
103 // from the nodes. This is not only friendlier on CPU it uses less stack.
104 CmdResult CommandMap::Handle(const std::vector<std::string>& parameters, User* user)
106 if (parameters.size() > 0)
108 /* Remote MAP, the server is within the 1st parameter */
109 TreeServer* s = Utils->FindServerMask(parameters[0]);
112 user->WriteNumeric(ERR_NOSUCHSERVER, "%s %s :No such server", user->nick.c_str(), parameters[0].c_str());
120 // These arrays represent a virtual screen which we will
121 // "scratch" draw to, as the console device of an irc
122 // client does not provide for a proper terminal.
123 int totusers = ServerInstance->Users->clientlist->size();
124 int totservers = Utils->serverlist.size();
127 char* names = new char[totservers * 100];
128 char* stats = new char[totservers * 50];
130 // The only recursive bit is called here.
131 ShowMap(Utils->TreeRoot,user,0,line,names,maxnamew,stats);
133 // Process each line one by one.
134 for (int l = 1; l < line; l++)
136 char* myname = names + 100 * l;
137 // scan across the line looking for the start of the
138 // servername (the recursive part of the algorithm has placed
139 // the servers at indented positions depending on what they
141 int first_nonspace = 0;
143 while (myname[first_nonspace] == ' ')
150 // Draw the `- (corner) section: this may be overwritten by
151 // another L shape passing along the same vertical pane, becoming
152 // a |- (branch) section instead.
154 myname[first_nonspace] = '-';
155 myname[first_nonspace-1] = '`';
158 // Draw upwards until we hit the parent server, causing possibly
159 // other corners (`-) to become branches (|-)
160 while ((names[l2 * 100 + first_nonspace-1] == ' ') || (names[l2 * 100 + first_nonspace-1] == '`'))
162 names[l2 * 100 + first_nonspace-1] = '|';
167 float avg_users = totusers * 1.0 / line;
169 for (int t = 0; t < line; t++)
171 // terminate the string at maxnamew characters
172 names[100 * t + maxnamew] = '\0';
173 user->SendText(":%s %03d %s :%s %s", ServerInstance->Config->ServerName.c_str(),
174 RPL_MAP, user->nick.c_str(), names + 100 * t, stats + 50 * t);
176 user->SendText(":%s %03d %s :%d server%s and %d user%s, average %.2f users per server",
177 ServerInstance->Config->ServerName.c_str(), RPL_MAPUSERS, user->nick.c_str(),
178 line, (line > 1 ? "s" : ""), totusers, (totusers > 1 ? "s" : ""), avg_users);
179 user->SendText(":%s %03d %s :End of /MAP", ServerInstance->Config->ServerName.c_str(),
180 RPL_ENDMAP, user->nick.c_str());
188 RouteDescriptor CommandMap::GetRouting(User* user, const std::vector<std::string>& parameters)
190 if (!parameters.empty())
191 return ROUTE_UNICAST(parameters[0]);
192 return ROUTE_LOCALONLY;