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/>.
22 /* $ModDesc: Provides a spanning tree server link protocol */
28 #include "treeserver.h"
29 #include "treesocket.h"
31 /* $ModDep: m_spanningtree/main.h m_spanningtree/utils.h m_spanningtree/treeserver.h m_spanningtree/treesocket.h */
33 const std::string ModuleSpanningTree::MapOperInfo(TreeServer* Current)
35 time_t secs_up = ServerInstance->Time() - Current->age;
36 return " [Up: " + TimeToStr(secs_up) + (Current->rtt == 0 ? "]" : " Lag: " + ConvToStr(Current->rtt) + "ms]");
39 void ModuleSpanningTree::ShowMap(TreeServer* Current, User* user, int depth, int &line, char* names, int &maxnamew, char* stats)
41 ServerInstance->Logs->Log("map",DEBUG,"ShowMap depth %d on line %d", depth, line);
44 if (ServerInstance->Users->clientlist->size() == 0)
46 // If there are no users, WHO THE HELL DID THE /MAP?!?!?!
51 percent = Current->GetUserCount() * 100.0 / ServerInstance->Users->clientlist->size();
54 const std::string operdata = IS_OPER(user) ? MapOperInfo(Current) : "";
56 char* myname = names + 100 * line;
57 char* mystat = stats + 50 * line;
58 memset(myname, ' ', depth);
63 w += snprintf(myname + depth, 99 - depth, "%s (%s)", Current->GetName().c_str(), Current->GetID().c_str());
67 w += snprintf(myname + depth, 99 - depth, "%s", Current->GetName().c_str());
69 memset(myname + w, ' ', 100 - w);
72 snprintf(mystat, 49, "%5d [%5.2f%%]%s", Current->GetUserCount(), percent, operdata.c_str());
76 if (IS_OPER(user) || !Utils->FlatLinks)
78 for (unsigned int q = 0; q < Current->ChildCount(); q++)
80 TreeServer* child = Current->GetChild(q);
84 if ((Utils->HideULines) && (ServerInstance->ULine(child->GetName().c_str())))
87 ShowMap(child, user, depth, line, names, maxnamew, stats);
92 // Ok, prepare to be confused.
93 // After much mulling over how to approach this, it struck me that
94 // the 'usual' way of doing a /MAP isnt the best way. Instead of
95 // keeping track of a ton of ascii characters, and line by line
96 // under recursion working out where to place them using multiplications
97 // and divisons, we instead render the map onto a backplane of characters
98 // (a character matrix), then draw the branches as a series of "L" shapes
99 // from the nodes. This is not only friendlier on CPU it uses less stack.
100 bool ModuleSpanningTree::HandleMap(const std::vector<std::string>& parameters, User* user)
102 if (parameters.size() > 0)
104 /* Remote MAP, the server is within the 1st parameter */
105 TreeServer* s = Utils->FindServerMask(parameters[0]);
109 user->WriteNumeric(ERR_NOSUCHSERVER, "%s %s :No such server", user->nick.c_str(), parameters[0].c_str());
112 else if (s && s != Utils->TreeRoot)
114 parameterlist params;
115 params.push_back(parameters[0]);
117 params[0] = s->GetName();
118 Utils->DoOneToOne(user->uuid, "MAP", params, s->GetName());
122 // Don't return if s == Utils->TreeRoot (us)
127 // These arrays represent a virtual screen which we will
128 // "scratch" draw to, as the console device of an irc
129 // client does not provide for a proper terminal.
130 int totusers = ServerInstance->Users->clientlist->size();
131 int totservers = this->CountServs();
134 char* names = new char[totservers * 100];
135 char* stats = new char[totservers * 50];
137 // The only recursive bit is called here.
138 ShowMap(Utils->TreeRoot,user,0,line,names,maxnamew,stats);
140 // Process each line one by one.
141 for (int l = 1; l < line; l++)
143 char* myname = names + 100 * l;
144 // scan across the line looking for the start of the
145 // servername (the recursive part of the algorithm has placed
146 // the servers at indented positions depending on what they
148 int first_nonspace = 0;
150 while (myname[first_nonspace] == ' ')
157 // Draw the `- (corner) section: this may be overwritten by
158 // another L shape passing along the same vertical pane, becoming
159 // a |- (branch) section instead.
161 myname[first_nonspace] = '-';
162 myname[first_nonspace-1] = '`';
165 // Draw upwards until we hit the parent server, causing possibly
166 // other corners (`-) to become branches (|-)
167 while ((names[l2 * 100 + first_nonspace-1] == ' ') || (names[l2 * 100 + first_nonspace-1] == '`'))
169 names[l2 * 100 + first_nonspace-1] = '|';
174 float avg_users = totusers * 1.0 / line;
176 ServerInstance->Logs->Log("map",DEBUG,"local");
177 for (int t = 0; t < line; t++)
179 // terminate the string at maxnamew characters
180 names[100 * t + maxnamew] = '\0';
181 user->SendText(":%s %03d %s :%s %s", ServerInstance->Config->ServerName.c_str(),
182 RPL_MAP, user->nick.c_str(), names + 100 * t, stats + 50 * t);
184 user->SendText(":%s %03d %s :%d server%s and %d user%s, average %.2f users per server",
185 ServerInstance->Config->ServerName.c_str(), RPL_MAPUSERS, user->nick.c_str(),
186 line, (line > 1 ? "s" : ""), totusers, (totusers > 1 ? "s" : ""), avg_users);
187 user->SendText(":%s %03d %s :End of /MAP", ServerInstance->Config->ServerName.c_str(),
188 RPL_ENDMAP, user->nick.c_str());