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 * ---------------------------------------------------
14 /* $ModDesc: Provides a spanning tree server link protocol */
19 #include "m_spanningtree/main.h"
20 #include "m_spanningtree/utils.h"
21 #include "m_spanningtree/treeserver.h"
22 #include "m_spanningtree/treesocket.h"
24 /* $ModDep: m_spanningtree/main.h m_spanningtree/utils.h m_spanningtree/treeserver.h m_spanningtree/treesocket.h */
26 const std::string ModuleSpanningTree::MapOperInfo(TreeServer* Current)
28 time_t secs_up = ServerInstance->Time() - Current->age;
29 return (" [Up: " + TimeToStr(secs_up) + " Lag: " + (Current->rtt == 0 ? "<1" : ConvToStr(Current->rtt)) + "ms]");
32 // WARNING: NOT THREAD SAFE - DONT GET ANY SMART IDEAS.
33 void ModuleSpanningTree::ShowMap(TreeServer* Current, User* user, int depth, char matrix[128][128], float &totusers, float &totservers)
35 ServerInstance->Logs->Log("map",DEBUG,"ShowMap depth %d totusers %0.2f totservers %0.2f", depth, totusers, totservers);
38 for (int t = 0; t < depth; t++)
40 matrix[line][t] = ' ';
43 // For Aligning, we need to work out exactly how deep this thing is, and produce
44 // a 'Spacer' String to compensate.
46 memset(spacer,' ',40);
47 if ((40 - Current->GetName().length() - depth) > 1) {
48 spacer[40 - Current->GetName().length() - depth] = '\0';
57 /* Neat and tidy default values, as we're dealing with a matrix not a simple string */
60 if (ServerInstance->Users->clientlist->size() == 0)
62 // If there are no users, WHO THE HELL DID THE /MAP?!?!?!
67 percent = ((float)Current->GetUserCount() / (float)ServerInstance->Users->clientlist->size()) * 100;
70 const std::string operdata = IS_OPER(user) ? MapOperInfo(Current) : "";
71 snprintf(text, 126, "%s (%s)%s%5d [%5.2f%%]%s", Current->GetName().c_str(), Current->GetID().c_str(), spacer, Current->GetUserCount(), percent, operdata.c_str());
72 totusers += Current->GetUserCount();
74 strlcpy(&matrix[line][depth],text,126);
77 for (unsigned int q = 0; q < Current->ChildCount(); q++)
79 if ((Current->GetChild(q)->Hidden) || ((Utils->HideULines) && (ServerInstance->ULine(Current->GetChild(q)->GetName().c_str()))))
83 ShowMap(Current->GetChild(q),user,(Utils->FlatLinks && (!IS_OPER(user))) ? depth : depth+2,matrix,totusers,totservers);
88 ShowMap(Current->GetChild(q),user,(Utils->FlatLinks && (!IS_OPER(user))) ? depth : depth+2,matrix,totusers,totservers);
95 // Ok, prepare to be confused.
96 // After much mulling over how to approach this, it struck me that
97 // the 'usual' way of doing a /MAP isnt the best way. Instead of
98 // keeping track of a ton of ascii characters, and line by line
99 // under recursion working out where to place them using multiplications
100 // and divisons, we instead render the map onto a backplane of characters
101 // (a character matrix), then draw the branches as a series of "L" shapes
102 // from the nodes. This is not only friendlier on CPU it uses less stack.
103 int ModuleSpanningTree::HandleMap(const std::vector<std::string>& parameters, User* user)
105 if (parameters.size() > 0)
107 /* Remote MAP, the server is within the 1st parameter */
108 TreeServer* s = Utils->FindServerMask(parameters[0]);
112 user->WriteNumeric(ERR_NOSUCHSERVER, "%s %s :No such server", user->nick.c_str(), parameters[0].c_str());
115 else if (s && s != Utils->TreeRoot)
117 std::deque<std::string> params;
118 params.push_back(parameters[0]);
120 params[0] = s->GetName();
121 Utils->DoOneToOne(user->uuid, "MAP", params, s->GetName());
125 // Don't return if s == Utils->TreeRoot (us)
130 // This array represents a virtual screen which we will
131 // "scratch" draw to, as the console device of an irc
132 // client does not provide for a proper terminal.
134 float totservers = 0;
135 static char matrix[128][128];
137 for (unsigned int t = 0; t < 128; t++)
144 // The only recursive bit is called here.
145 ShowMap(Utils->TreeRoot,user,0,matrix,totusers,totservers);
147 // Process each line one by one. The algorithm has a limit of
148 // 128 servers (which is far more than a spanning tree should have
149 // anyway, so we're ok). This limit can be raised simply by making
150 // the character matrix deeper, 128 rows taking 10k of memory.
151 for (int l = 1; l < line; l++)
153 // scan across the line looking for the start of the
154 // servername (the recursive part of the algorithm has placed
155 // the servers at indented positions depending on what they
157 int first_nonspace = 0;
159 while (matrix[l][first_nonspace] == ' ')
166 // Draw the `- (corner) section: this may be overwritten by
167 // another L shape passing along the same vertical pane, becoming
168 // a |- (branch) section instead.
170 matrix[l][first_nonspace] = '-';
171 matrix[l][first_nonspace-1] = '`';
174 // Draw upwards until we hit the parent server, causing possibly
175 // other corners (`-) to become branches (|-)
176 while ((matrix[l2][first_nonspace-1] == ' ') || (matrix[l2][first_nonspace-1] == '`'))
178 matrix[l2][first_nonspace-1] = '|';
183 float avg_users = totusers / totservers;
185 // dump the whole lot to the user.
188 ServerInstance->Logs->Log("map",DEBUG,"local");
189 for (int t = 0; t < line; t++)
191 user->WriteNumeric(RPL_MAP, "%s :%s",user->nick.c_str(),&matrix[t][0]);
193 user->WriteNumeric(RPL_MAPUSERS, "%s :%.0f server%s and %.0f user%s, average %.2f users per server",user->nick.c_str(),totservers,(totservers > 1 ? "s" : ""),totusers,(totusers > 1 ? "s" : ""),avg_users);
194 user->WriteNumeric(RPL_ENDMAP, "%s :End of /MAP",user->nick.c_str());
198 ServerInstance->Logs->Log("map", DEBUG, "remote dump lines=%d", line);
200 // XXX: annoying that we have to use hardcoded numerics here..
201 for (int t = 0; t < line; t++)
203 ServerInstance->PI->PushToClient(user, std::string("::") + ServerInstance->Config->ServerName + " 006 " + user->nick + " :" + &matrix[t][0]);
206 ServerInstance->PI->PushToClient(user, std::string("::") + ServerInstance->Config->ServerName + " 270 " + user->nick + " :" + ConvToStr(totservers) + " server"+(totservers > 1 ? "s" : "") + " and " + ConvToStr(totusers) + " user"+(totusers > 1 ? "s" : "") + ", average " + ConvToStr(avg_users) + " users per server");
207 ServerInstance->PI->PushToClient(user, std::string("::") + ServerInstance->Config->ServerName + " 007 " + user->nick + " :End of /MAP");