X-Git-Url: https://git.netwichtig.de/gitweb/?a=blobdiff_plain;f=src%2Fmodules%2Fm_spanningtree%2Foverride_map.cpp;h=ba8abecbeece1366d2e92c86f0a515f27f2c21b0;hb=38eb845f7a98a3140adcdc108abf2adab82b87c0;hp=01423b60a2a57b57c05b3f27106e0e4ee749b8e9;hpb=3699b899c0eadadaba960a3263c82894685a86c4;p=user%2Fhenk%2Fcode%2Finspircd.git diff --git a/src/modules/m_spanningtree/override_map.cpp b/src/modules/m_spanningtree/override_map.cpp index 01423b60a..ba8abecbe 100644 --- a/src/modules/m_spanningtree/override_map.cpp +++ b/src/modules/m_spanningtree/override_map.cpp @@ -1,101 +1,87 @@ -/* +------------------------------------+ - * | Inspire Internet Relay Chat Daemon | - * +------------------------------------+ +/* + * InspIRCd -- Internet Relay Chat Daemon * - * InspIRCd: (C) 2002-2008 InspIRCd Development Team - * See: http://www.inspircd.org/wiki/index.php/Credits + * Copyright (C) 2009 Daniel De Graaf + * Copyright (C) 2007-2008 Craig Edwards + * Copyright (C) 2008 Robin Burchell * - * This program is free but copyrighted software; see - * the file COPYING for details. + * This file is part of InspIRCd. InspIRCd is free software: you can + * redistribute it and/or modify it under the terms of the GNU General Public + * License as published by the Free Software Foundation, version 2. * - * --------------------------------------------------- + * This program is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS + * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more + * details. + * + * You should have received a copy of the GNU General Public License + * along with this program. If not, see . */ -/* $ModDesc: Provides a spanning tree server link protocol */ - + #include "inspircd.h" -#include "wildcard.h" -#include "m_spanningtree/main.h" -#include "m_spanningtree/utils.h" -#include "m_spanningtree/treeserver.h" -#include "m_spanningtree/treesocket.h" +#include "main.h" +#include "utils.h" +#include "treeserver.h" -/* $ModDep: m_spanningtree/main.h m_spanningtree/utils.h m_spanningtree/treeserver.h m_spanningtree/treesocket.h */ +/* $ModDep: m_spanningtree/main.h m_spanningtree/utils.h m_spanningtree/treeserver.h */ const std::string ModuleSpanningTree::MapOperInfo(TreeServer* Current) { time_t secs_up = ServerInstance->Time() - Current->age; - return (" [Up: " + TimeToStr(secs_up) + " Lag: " + (Current->rtt == 0 ? "<1" : ConvToStr(Current->rtt)) + "ms]"); + return " [Up: " + TimeToStr(secs_up) + (Current->rtt == 0 ? "]" : " Lag: " + ConvToStr(Current->rtt) + "ms]"); } - -// WARNING: NOT THREAD SAFE - DONT GET ANY SMART IDEAS. -void ModuleSpanningTree::ShowMap(TreeServer* Current, User* user, int depth, char matrix[128][128], float &totusers, float &totservers) + +void ModuleSpanningTree::ShowMap(TreeServer* Current, User* user, int depth, int &line, char* names, int &maxnamew, char* stats) { - ServerInstance->Logs->Log("map",DEBUG,"ShowMap depth %d totusers %0.2f totservers %0.2f", depth, totusers, totservers); - if (line < 128) - { - for (int t = 0; t < depth; t++) - { - ServerInstance->Logs->Log("map",DEBUG,"Zero to depth"); - matrix[line][t] = ' '; - } - - // For Aligning, we need to work out exactly how deep this thing is, and produce - // a 'Spacer' String to compensate. - char spacer[40]; - memset(spacer,' ',40); - if ((40 - Current->GetName().length() - depth) > 1) { - spacer[40 - Current->GetName().length() - depth] = '\0'; - } - else - { - spacer[5] = '\0'; - } + ServerInstance->Logs->Log("map", LOG_DEBUG, "ShowMap depth %d on line %d", depth, line); + float percent; - float percent; - char text[128]; - /* Neat and tidy default values, as we're dealing with a matrix not a simple string */ - memset(text, 0, 128); + if (ServerInstance->Users->clientlist->size() == 0) + { + // If there are no users, WHO THE HELL DID THE /MAP?!?!?! + percent = 0; + } + else + { + percent = Current->UserCount * 100.0 / ServerInstance->Users->clientlist->size(); + } - if (ServerInstance->Users->clientlist->size() == 0) - { - // If there are no users, WHO THE HELL DID THE /MAP?!?!?! - percent = 0; - } - else - { - percent = ((float)Current->GetUserCount() / (float)ServerInstance->Users->clientlist->size()) * 100; - } + const std::string operdata = user->IsOper() ? MapOperInfo(Current) : ""; - const std::string operdata = IS_OPER(user) ? MapOperInfo(Current) : ""; - 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()); - totusers += Current->GetUserCount(); - totservers++; - strlcpy(&matrix[line][depth],text,126); - line++; + char* myname = names + 100 * line; + char* mystat = stats + 50 * line; + memset(myname, ' ', depth); + int w = depth; - ServerInstance->Logs->Log("map",DEBUG,"Increment line to %d, ChildCount %d", line, Current->ChildCount()); + if (user->IsOper()) + { + w += snprintf(myname + depth, 99 - depth, "%s (%s)", Current->GetName().c_str(), Current->GetID().c_str()); + } + else + { + w += snprintf(myname + depth, 99 - depth, "%s", Current->GetName().c_str()); + } + memset(myname + w, ' ', 100 - w); + if (w > maxnamew) + maxnamew = w; + snprintf(mystat, 49, "%5d [%5.2f%%]%s", Current->UserCount, percent, operdata.c_str()); - for (unsigned int q = 0; q < Current->ChildCount(); q++) - { - ServerInstance->Logs->Log("map",DEBUG,"Hidden? %d HideULines? %d GetName %s", Current->GetChild(q)->Hidden, Utils->HideULines, Current->GetChild(q)->GetName().c_str()); - if ((Current->GetChild(q)->Hidden) || ((Utils->HideULines) && (ServerInstance->ULine(Current->GetChild(q)->GetName().c_str())))) - { - if (IS_OPER(user)) - { - ShowMap(Current->GetChild(q),user,(Utils->FlatLinks && (!IS_OPER(user))) ? depth : depth+2,matrix,totusers,totservers); - ServerInstance->Logs->Log("map",DEBUG,"Show to oper"); - } - ServerInstance->Logs->Log("map",DEBUG,"Fall through"); - } - else - { - ShowMap(Current->GetChild(q),user,(Utils->FlatLinks && (!IS_OPER(user))) ? depth : depth+2,matrix,totusers,totservers); - ServerInstance->Logs->Log("map",DEBUG,"Show to non oper"); - } + line++; + + if (user->IsOper() || !Utils->FlatLinks) + depth = depth + 2; + for (unsigned int q = 0; q < Current->ChildCount(); q++) + { + TreeServer* child = Current->GetChild(q); + if (!user->IsOper()) { + if (child->Hidden) + continue; + if ((Utils->HideULines) && (ServerInstance->ULine(child->GetName()))) + continue; } - ServerInstance->Logs->Log("map",DEBUG,"After loop"); + ShowMap(child, user, depth, line, names, maxnamew, stats); } } @@ -108,7 +94,7 @@ void ModuleSpanningTree::ShowMap(TreeServer* Current, User* user, int depth, cha // and divisons, we instead render the map onto a backplane of characters // (a character matrix), then draw the branches as a series of "L" shapes // from the nodes. This is not only friendlier on CPU it uses less stack. -int ModuleSpanningTree::HandleMap(const std::vector& parameters, User* user) +bool ModuleSpanningTree::HandleMap(const std::vector& parameters, User* user) { if (parameters.size() > 0) { @@ -117,12 +103,12 @@ int ModuleSpanningTree::HandleMap(const std::vector& parameters, Us bool ret = false; if (!s) { - user->WriteServ( "402 %s %s :No such server", user->nick.c_str(), parameters[0].c_str()); + user->WriteNumeric(ERR_NOSUCHSERVER, "%s %s :No such server", user->nick.c_str(), parameters[0].c_str()); ret = true; } else if (s && s != Utils->TreeRoot) { - std::deque params; + parameterlist params; params.push_back(parameters[0]); params[0] = s->GetName(); @@ -132,39 +118,33 @@ int ModuleSpanningTree::HandleMap(const std::vector& parameters, Us // Don't return if s == Utils->TreeRoot (us) if (ret) - return 1; + return true; } - // This array represents a virtual screen which we will + // These arrays represent a virtual screen which we will // "scratch" draw to, as the console device of an irc // client does not provide for a proper terminal. - float totusers = 0; - float totservers = 0; - static char matrix[128][128]; - - for (unsigned int t = 0; t < 128; t++) - { - matrix[t][0] = '\0'; - } - - line = 0; + int totusers = ServerInstance->Users->clientlist->size(); + int totservers = this->CountServs(); + int maxnamew = 0; + int line = 0; + char* names = new char[totservers * 100]; + char* stats = new char[totservers * 50]; // The only recursive bit is called here. - ShowMap(Utils->TreeRoot,user,0,matrix,totusers,totservers); + ShowMap(Utils->TreeRoot,user,0,line,names,maxnamew,stats); - // Process each line one by one. The algorithm has a limit of - // 128 servers (which is far more than a spanning tree should have - // anyway, so we're ok). This limit can be raised simply by making - // the character matrix deeper, 128 rows taking 10k of memory. + // Process each line one by one. for (int l = 1; l < line; l++) { + char* myname = names + 100 * l; // scan across the line looking for the start of the // servername (the recursive part of the algorithm has placed // the servers at indented positions depending on what they // are related to) int first_nonspace = 0; - while (matrix[l][first_nonspace] == ' ') + while (myname[first_nonspace] == ' ') { first_nonspace++; } @@ -175,49 +155,37 @@ int ModuleSpanningTree::HandleMap(const std::vector& parameters, Us // another L shape passing along the same vertical pane, becoming // a |- (branch) section instead. - matrix[l][first_nonspace] = '-'; - matrix[l][first_nonspace-1] = '`'; + myname[first_nonspace] = '-'; + myname[first_nonspace-1] = '`'; int l2 = l - 1; // Draw upwards until we hit the parent server, causing possibly // other corners (`-) to become branches (|-) - while ((matrix[l2][first_nonspace-1] == ' ') || (matrix[l2][first_nonspace-1] == '`')) + while ((names[l2 * 100 + first_nonspace-1] == ' ') || (names[l2 * 100 + first_nonspace-1] == '`')) { - matrix[l2][first_nonspace-1] = '|'; + names[l2 * 100 + first_nonspace-1] = '|'; l2--; } } - float avg_users = totusers / totservers; + float avg_users = totusers * 1.0 / line; - // dump the whole lot to the user. - if (IS_LOCAL(user)) + for (int t = 0; t < line; t++) { - ServerInstance->Logs->Log("map",DEBUG,"local"); - for (int t = 0; t < line; t++) - { - user->WriteNumeric(6, "%s :%s",user->nick.c_str(),&matrix[t][0]); - } - user->WriteNumeric(270, "%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); - user->WriteNumeric(7, "%s :End of /MAP",user->nick.c_str()); + // terminate the string at maxnamew characters + names[100 * t + maxnamew] = '\0'; + user->SendText(":%s %03d %s :%s %s", ServerInstance->Config->ServerName.c_str(), + RPL_MAP, user->nick.c_str(), names + 100 * t, stats + 50 * t); } - else - { - - //void SpanningTreeProtocolInterface::PushToClient(User* target, const std::string &rawline) - // - ServerInstance->Logs->Log("map", DEBUG, "remote dump lines=%d", line); + user->SendText(":%s %03d %s :%d server%s and %d user%s, average %.2f users per server", + ServerInstance->Config->ServerName.c_str(), RPL_MAPUSERS, user->nick.c_str(), + line, (line > 1 ? "s" : ""), totusers, (totusers > 1 ? "s" : ""), avg_users); + user->SendText(":%s %03d %s :End of /MAP", ServerInstance->Config->ServerName.c_str(), + RPL_ENDMAP, user->nick.c_str()); - for (int t = 0; t < line; t++) - { - ServerInstance->Logs->Log("map",DEBUG,"Dump %d", line); - ServerInstance->PI->PushToClient(user, std::string("::") + ServerInstance->Config->ServerName + " 006 " + user->nick + " :" + &matrix[t][0]); - } - - 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"); - ServerInstance->PI->PushToClient(user, std::string("::") + ServerInstance->Config->ServerName + " 007 " + user->nick + " :End of /MAP"); - } + delete[] names; + delete[] stats; - return 1; + return true; }