1 /* +------------------------------------+
2 * | Inspire Internet Relay Chat Daemon |
3 * +------------------------------------+
5 * InspIRCd: (C) 2002-2007 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 */
17 #include "commands/cmd_whois.h"
18 #include "commands/cmd_stats.h"
22 #include "transport.h"
24 #include "m_spanningtree/timesynctimer.h"
25 #include "m_spanningtree/resolvers.h"
26 #include "m_spanningtree/main.h"
27 #include "m_spanningtree/utils.h"
28 #include "m_spanningtree/treeserver.h"
29 #include "m_spanningtree/link.h"
30 #include "m_spanningtree/treesocket.h"
31 #include "m_spanningtree/rconnect.h"
32 #include "m_spanningtree/rsquit.h"
34 /* $ModDep: m_spanningtree/timesynctimer.h m_spanningtree/resolvers.h m_spanningtree/main.h m_spanningtree/utils.h m_spanningtree/treeserver.h m_spanningtree/link.h m_spanningtree/treesocket.h m_spanningtree/rconnect.h m_spanningtree/rsquit.h */
36 const std::string ModuleSpanningTree::MapOperInfo(TreeServer* Current)
38 time_t secs_up = ServerInstance->Time() - Current->age;
39 return (" [Up: " + TimeToStr(secs_up) + " Lag: "+ConvToStr(Current->rtt)+"ms]");
42 // WARNING: NOT THREAD SAFE - DONT GET ANY SMART IDEAS.
43 void ModuleSpanningTree::ShowMap(TreeServer* Current, User* user, int depth, char matrix[128][128], float &totusers, float &totservers)
47 for (int t = 0; t < depth; t++)
49 matrix[line][t] = ' ';
51 // For Aligning, we need to work out exactly how deep this thing is, and produce
52 // a 'Spacer' String to compensate.
54 memset(spacer,' ',40);
55 if ((40 - Current->GetName().length() - depth) > 1) {
56 spacer[40 - Current->GetName().length() - depth] = '\0';
64 /* Neat and tidy default values, as we're dealing with a matrix not a simple string */
67 if (ServerInstance->clientlist->size() == 0) {
68 // If there are no users, WHO THE HELL DID THE /MAP?!?!?!
73 percent = ((float)Current->GetUserCount() / (float)ServerInstance->clientlist->size()) * 100;
75 const std::string operdata = IS_OPER(user) ? MapOperInfo(Current) : "";
76 snprintf(text, 126, "%s %s%5d [%5.2f%%]%s", Current->GetName().c_str(), spacer, Current->GetUserCount(), percent, operdata.c_str());
77 totusers += Current->GetUserCount();
79 strlcpy(&matrix[line][depth],text,126);
81 for (unsigned int q = 0; q < Current->ChildCount(); q++)
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);
92 ShowMap(Current->GetChild(q),user,(Utils->FlatLinks && (!*user->oper)) ? depth : depth+2,matrix,totusers,totservers);
99 // Ok, prepare to be confused.
100 // After much mulling over how to approach this, it struck me that
101 // the 'usual' way of doing a /MAP isnt the best way. Instead of
102 // keeping track of a ton of ascii characters, and line by line
103 // under recursion working out where to place them using multiplications
104 // and divisons, we instead render the map onto a backplane of characters
105 // (a character matrix), then draw the branches as a series of "L" shapes
106 // from the nodes. This is not only friendlier on CPU it uses less stack.
107 void ModuleSpanningTree::HandleMap(const char** parameters, int pcnt, User* user)
109 // This array represents a virtual screen which we will
110 // "scratch" draw to, as the console device of an irc
111 // client does not provide for a proper terminal.
113 float totservers = 0;
114 char matrix[128][128];
115 for (unsigned int t = 0; t < 128; t++)
120 // The only recursive bit is called here.
121 ShowMap(Utils->TreeRoot,user,0,matrix,totusers,totservers);
122 // Process each line one by one. The algorithm has a limit of
123 // 128 servers (which is far more than a spanning tree should have
124 // anyway, so we're ok). This limit can be raised simply by making
125 // the character matrix deeper, 128 rows taking 10k of memory.
126 for (int l = 1; l < line; l++)
128 // scan across the line looking for the start of the
129 // servername (the recursive part of the algorithm has placed
130 // the servers at indented positions depending on what they
132 int first_nonspace = 0;
133 while (matrix[l][first_nonspace] == ' ')
138 // Draw the `- (corner) section: this may be overwritten by
139 // another L shape passing along the same vertical pane, becoming
140 // a |- (branch) section instead.
141 matrix[l][first_nonspace] = '-';
142 matrix[l][first_nonspace-1] = '`';
144 // Draw upwards until we hit the parent server, causing possibly
145 // other corners (`-) to become branches (|-)
146 while ((matrix[l2][first_nonspace-1] == ' ') || (matrix[l2][first_nonspace-1] == '`'))
148 matrix[l2][first_nonspace-1] = '|';
152 // dump the whole lot to the user. This is the easy bit, honest.
153 for (int t = 0; t < line; t++)
155 user->WriteServ("006 %s :%s",user->nick,&matrix[t][0]);
157 float avg_users = totusers / totservers;
158 user->WriteServ("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);
159 user->WriteServ("007 %s :End of /MAP",user->nick);