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 ServerInstance->Logs->Log("map",DEBUG,"Zero to depth");
41 matrix[line][t] = ' ';
44 // For Aligning, we need to work out exactly how deep this thing is, and produce
45 // a 'Spacer' String to compensate.
47 memset(spacer,' ',40);
48 if ((40 - Current->GetName().length() - depth) > 1) {
49 spacer[40 - Current->GetName().length() - depth] = '\0';
58 /* Neat and tidy default values, as we're dealing with a matrix not a simple string */
61 if (ServerInstance->Users->clientlist->size() == 0)
63 // If there are no users, WHO THE HELL DID THE /MAP?!?!?!
68 percent = ((float)Current->GetUserCount() / (float)ServerInstance->Users->clientlist->size()) * 100;
71 const std::string operdata = IS_OPER(user) ? MapOperInfo(Current) : "";
72 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());
73 totusers += Current->GetUserCount();
75 strlcpy(&matrix[line][depth],text,126);
78 ServerInstance->Logs->Log("map",DEBUG,"Increment line to %d, ChildCount %d", line, Current->ChildCount());
80 for (unsigned int q = 0; q < Current->ChildCount(); q++)
82 ServerInstance->Logs->Log("map",DEBUG,"Hidden? %d HideULines? %d GetName %s", Current->GetChild(q)->Hidden, Utils->HideULines, Current->GetChild(q)->GetName().c_str());
83 if ((Current->GetChild(q)->Hidden) || ((Utils->HideULines) && (ServerInstance->ULine(Current->GetChild(q)->GetName().c_str()))))
87 ShowMap(Current->GetChild(q),user,(Utils->FlatLinks && (!*user->oper)) ? depth : depth+2,matrix,totusers,totservers);
88 ServerInstance->Logs->Log("map",DEBUG,"Show to oper");
90 ServerInstance->Logs->Log("map",DEBUG,"Fall through");
94 ShowMap(Current->GetChild(q),user,(Utils->FlatLinks && (!*user->oper)) ? depth : depth+2,matrix,totusers,totservers);
95 ServerInstance->Logs->Log("map",DEBUG,"Show to non oper");
98 ServerInstance->Logs->Log("map",DEBUG,"After loop");
103 // Ok, prepare to be confused.
104 // After much mulling over how to approach this, it struck me that
105 // the 'usual' way of doing a /MAP isnt the best way. Instead of
106 // keeping track of a ton of ascii characters, and line by line
107 // under recursion working out where to place them using multiplications
108 // and divisons, we instead render the map onto a backplane of characters
109 // (a character matrix), then draw the branches as a series of "L" shapes
110 // from the nodes. This is not only friendlier on CPU it uses less stack.
111 int ModuleSpanningTree::HandleMap(const std::vector<std::string>& parameters, User* user)
113 if (parameters.size() > 0)
115 /* Remote MAP, the server is within the 1st parameter */
116 TreeServer* s = Utils->FindServerMask(parameters[0]);
120 user->WriteServ( "402 %s %s :No such server", user->nick, parameters[0].c_str());
123 else if (s && s != Utils->TreeRoot)
125 std::deque<std::string> params;
126 params.push_back(parameters[0]);
128 params[0] = s->GetName();
129 Utils->DoOneToOne(user->uuid, "MAP", params, s->GetName());
133 // Don't return if s == Utils->TreeRoot (us)
138 // This array represents a virtual screen which we will
139 // "scratch" draw to, as the console device of an irc
140 // client does not provide for a proper terminal.
142 float totservers = 0;
143 static char matrix[128][128];
145 for (unsigned int t = 0; t < 128; t++)
152 // The only recursive bit is called here.
153 ShowMap(Utils->TreeRoot,user,0,matrix,totusers,totservers);
155 // Process each line one by one. The algorithm has a limit of
156 // 128 servers (which is far more than a spanning tree should have
157 // anyway, so we're ok). This limit can be raised simply by making
158 // the character matrix deeper, 128 rows taking 10k of memory.
159 for (int l = 1; l < line; l++)
161 // scan across the line looking for the start of the
162 // servername (the recursive part of the algorithm has placed
163 // the servers at indented positions depending on what they
165 int first_nonspace = 0;
167 while (matrix[l][first_nonspace] == ' ')
174 // Draw the `- (corner) section: this may be overwritten by
175 // another L shape passing along the same vertical pane, becoming
176 // a |- (branch) section instead.
178 matrix[l][first_nonspace] = '-';
179 matrix[l][first_nonspace-1] = '`';
182 // Draw upwards until we hit the parent server, causing possibly
183 // other corners (`-) to become branches (|-)
184 while ((matrix[l2][first_nonspace-1] == ' ') || (matrix[l2][first_nonspace-1] == '`'))
186 matrix[l2][first_nonspace-1] = '|';
191 float avg_users = totusers / totservers;
193 // dump the whole lot to the user.
196 ServerInstance->Logs->Log("map",DEBUG,"local");
197 for (int t = 0; t < line; t++)
199 user->WriteNumeric(6, "%s :%s",user->nick,&matrix[t][0]);
201 user->WriteNumeric(270, "%s :%.0f server%s and %.0f user%s, average %.2f users per server",user->nick,totservers,(totservers > 1 ? "s" : ""),totusers,(totusers > 1 ? "s" : ""),avg_users);
202 user->WriteNumeric(7, "%s :End of /MAP",user->nick);
207 //void SpanningTreeProtocolInterface::PushToClient(User* target, const std::string &rawline)
209 ServerInstance->Logs->Log("map", DEBUG, "remote dump lines=%d", line);
211 for (int t = 0; t < line; t++)
213 ServerInstance->Logs->Log("map",DEBUG,"Dump %d", line);
214 ServerInstance->PI->PushToClient(user, std::string("::") + ServerInstance->Config->ServerName + " 006 " + user->nick + " :" + &matrix[t][0]);
217 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");
218 ServerInstance->PI->PushToClient(user, std::string("::") + ServerInstance->Config->ServerName + " 007 " + user->nick + " :End of /MAP");