]> git.netwichtig.de Git - user/henk/code/inspircd.git/blobdiff - src/modules.cpp
Allow static initialization of dynamic_reference objects
[user/henk/code/inspircd.git] / src / modules.cpp
index bfe0deecb812abec95498ab1bde4808489b00900..bf5506d6876c23ad5e0157df2b6740ad0b4783ae 100644 (file)
        #include <dirent.h>
 #endif
 
+static std::vector<dynamic_reference_base*>* dynrefs = NULL;
+
+void dynamic_reference_base::reset_all()
+{
+       if (!dynrefs)
+               return;
+       for(unsigned int i = 0; i < dynrefs->size(); i++)
+               (*dynrefs)[i]->ClearCache();
+}
 
 // Version is a simple class for holding a modules version number
 template<>
@@ -101,6 +110,7 @@ void                Module::OnUnloadModule(Module*) { }
 void           Module::OnBackgroundTimer(time_t) { }
 ModResult      Module::OnPreCommand(std::string&, std::vector<std::string>&, LocalUser*, bool, const std::string&) { return MOD_RES_PASSTHRU; }
 void           Module::OnPostCommand(const std::string&, const std::vector<std::string>&, LocalUser*, CmdResult, const std::string&) { }
+void           Module::OnUserInit(LocalUser*) { }
 ModResult      Module::OnCheckReady(LocalUser*) { return MOD_RES_PASSTHRU; }
 ModResult      Module::OnUserRegister(LocalUser*) { return MOD_RES_PASSTHRU; }
 ModResult      Module::OnUserPreKick(User*, Membership*, const std::string&) { return MOD_RES_PASSTHRU; }
@@ -151,7 +161,6 @@ void                Module::OnCleanup(int, void*) { }
 ModResult      Module::OnChannelPreDelete(Channel*) { return MOD_RES_PASSTHRU; }
 void           Module::OnChannelDelete(Channel*) { }
 ModResult      Module::OnSetAway(User*, const std::string &) { return MOD_RES_PASSTHRU; }
-ModResult      Module::OnUserList(User*, Channel*) { return MOD_RES_PASSTHRU; }
 ModResult      Module::OnWhoisLine(User*, User*, int&, std::string&) { return MOD_RES_PASSTHRU; }
 void           Module::OnBuildNeighborList(User*, UserChanList&, std::map<User*,bool>&) { }
 void           Module::OnGarbageCollect() { }
@@ -163,7 +172,6 @@ ModResult   Module::OnNumeric(User*, unsigned int, const std::string&) { return MO
 void           Module::OnHookIO(StreamSocket*, ListenSocket*) { }
 ModResult   Module::OnAcceptConnection(int, ListenSocket*, irc::sockets::sockaddrs*, irc::sockets::sockaddrs*) { return MOD_RES_PASSTHRU; }
 void           Module::OnSendWhoLine(User*, const std::vector<std::string>&, User*, Channel*, std::string&) { }
-ModResult      Module::OnChannelRestrictionApply(User*, Channel*, const char*) { return MOD_RES_PASSTHRU; }
 
 ModuleManager::ModuleManager() : ModCount(0)
 {
@@ -216,7 +224,7 @@ bool ModuleManager::SetPriority(Module* mod, Priority s)
        return true;
 }
 
-bool ModuleManager::SetPriority(Module* mod, Implementation i, Priority s, Module** modules, size_t sz)
+bool ModuleManager::SetPriority(Module* mod, Implementation i, Priority s, Module* which)
 {
        /** To change the priority of a module, we first find its position in the vector,
         * then we find the position of the other modules in the vector that this module
@@ -224,10 +232,7 @@ bool ModuleManager::SetPriority(Module* mod, Implementation i, Priority s, Modul
         * on which they want, and we make sure our module is *at least* before or after
         * the first or last of this subset, depending again on the type of priority.
         */
-       size_t swap_pos = 0;
-       size_t source = 0;
-       bool swap = true;
-       bool found = false;
+       size_t my_pos = 0;
 
        /* Locate our module. This is O(n) but it only occurs on module load so we're
         * not too bothered about it
@@ -236,81 +241,65 @@ bool ModuleManager::SetPriority(Module* mod, Implementation i, Priority s, Modul
        {
                if (EventHandlers[i][x] == mod)
                {
-                       source = x;
-                       found = true;
-                       break;
+                       my_pos = x;
+                       goto found_src;
                }
        }
 
        /* Eh? this module doesnt exist, probably trying to set priority on an event
         * theyre not attached to.
         */
-       if (!found)
-               return false;
+       return false;
 
+found_src:
+       size_t swap_pos = my_pos;
        switch (s)
        {
-               /* Dummy value */
-               case PRIORITY_DONTCARE:
-                       swap = false;
-               break;
-               /* Module wants to be first, sod everything else */
                case PRIORITY_FIRST:
                        if (prioritizationState != PRIO_STATE_FIRST)
-                               swap = false;
+                               return true;
                        else
                                swap_pos = 0;
-               break;
-               /* Module wants to be last. */
+                       break;
                case PRIORITY_LAST:
                        if (prioritizationState != PRIO_STATE_FIRST)
-                               swap = false;
-                       else if (EventHandlers[i].empty())
-                               swap_pos = 0;
+                               return true;
                        else
                                swap_pos = EventHandlers[i].size() - 1;
-               break;
-               /* Place this module after a set of other modules */
+                       break;
                case PRIORITY_AFTER:
                {
-                       /* Find the latest possible position */
-                       swap_pos = 0;
-                       swap = false;
-                       for (size_t x = 0; x != EventHandlers[i].size(); ++x)
+                       /* Find the latest possible position, only searching AFTER our position */
+                       for (size_t x = EventHandlers[i].size() - 1; x > my_pos; --x)
                        {
-                               for (size_t n = 0; n < sz; ++n)
+                               if (EventHandlers[i][x] == which)
                                {
-                                       if ((modules[n]) && (EventHandlers[i][x] == modules[n]) && (x >= swap_pos) && (source <= swap_pos))
-                                       {
-                                               swap_pos = x;
-                                               swap = true;
-                                       }
+                                       swap_pos = x;
+                                       goto swap_now;
                                }
                        }
+                       // didn't find it - either not loaded or we're already after
+                       return true;
                }
-               break;
                /* Place this module before a set of other modules */
                case PRIORITY_BEFORE:
                {
-                       swap_pos = EventHandlers[i].size() - 1;
-                       swap = false;
-                       for (size_t x = 0; x != EventHandlers[i].size(); ++x)
+                       for (size_t x = 0; x < my_pos; ++x)
                        {
-                               for (size_t n = 0; n < sz; ++n)
+                               if (EventHandlers[i][x] == which)
                                {
-                                       if ((modules[n]) && (EventHandlers[i][x] == modules[n]) && (x <= swap_pos) && (source >= swap_pos))
-                                       {
-                                               swap = true;
-                                               swap_pos = x;
-                                       }
+                                       swap_pos = x;
+                                       goto swap_now;
                                }
                        }
+                       // didn't find it - either not loaded or we're already before
+                       return true;
                }
-               break;
        }
 
+swap_now:
        /* Do we need to swap? */
-       if (swap && (swap_pos != source))
+       if (swap_pos != my_pos)
        {
                // We are going to change positions; we'll need to run again to verify all requirements
                if (prioritizationState == PRIO_STATE_LAST)
@@ -318,10 +307,10 @@ bool ModuleManager::SetPriority(Module* mod, Implementation i, Priority s, Modul
                /* Suggestion from Phoenix, "shuffle" the modules to better retain call order */
                int incrmnt = 1;
 
-               if (source > swap_pos)
+               if (my_pos > swap_pos)
                        incrmnt = -1;
 
-               for (unsigned int j = source; j != swap_pos; j += incrmnt)
+               for (unsigned int j = my_pos; j != swap_pos; j += incrmnt)
                {
                        if (( j + incrmnt > EventHandlers[i].size() - 1) || (j + incrmnt < 0))
                                continue;
@@ -388,8 +377,8 @@ void ModuleManager::DoSafeUnload(Module* mod)
                if (curr->second->creator == mod)
                        DataProviders.erase(curr);
        }
-       for(unsigned int i = 0; i < ServerInstance->Modules->ActiveDynrefs.size(); i++)
-               ServerInstance->Modules->ActiveDynrefs[i]->ClearCache();
+
+       dynamic_reference_base::reset_all();
 
        /* Tidy up any dangling resolvers */
        ServerInstance->Res->CleanResolvers(mod);
@@ -457,6 +446,31 @@ void ModuleManager::AddService(ServiceProvider& item)
        }
 }
 
+void ModuleManager::DelService(ServiceProvider& item)
+{
+       switch (item.service)
+       {
+               case SERVICE_MODE:
+                       if (!ServerInstance->Modes->DelMode(static_cast<ModeHandler*>(&item)))
+                               throw ModuleException("Mode "+std::string(item.name)+" does not exist.");
+                       return;
+               case SERVICE_DATA:
+               case SERVICE_IOHOOK:
+               {
+                       for(std::multimap<std::string, ServiceProvider*>::iterator i = DataProviders.begin(); i != DataProviders.end(); )
+                       {
+                               std::multimap<std::string, ServiceProvider*>::iterator curr = i++;
+                               if (curr->second == &item)
+                                       DataProviders.erase(curr);
+                       }
+                       dynamic_reference_base::reset_all();
+                       return;
+               }
+               default:
+                       throw ModuleException("Cannot delete unknown service type");
+       }
+}
+
 ServiceProvider* ModuleManager::FindService(ServiceType type, const std::string& name)
 {
        switch (type)
@@ -478,19 +492,26 @@ ServiceProvider* ModuleManager::FindService(ServiceType type, const std::string&
 dynamic_reference_base::dynamic_reference_base(Module* Creator, const std::string& Name)
        : name(Name), value(NULL), creator(Creator)
 {
-       ServerInstance->Modules->ActiveDynrefs.push_back(this);
+       if (!dynrefs)
+               dynrefs = new std::vector<dynamic_reference_base*>;
+       dynrefs->push_back(this);
 }
 
 dynamic_reference_base::~dynamic_reference_base()
 {
-       for(unsigned int i = 0; i < ServerInstance->Modules->ActiveDynrefs.size(); i++)
+       for(unsigned int i = 0; i < dynrefs->size(); i++)
        {
-               if (ServerInstance->Modules->ActiveDynrefs[i] == this)
+               if (dynrefs->at(i) == this)
                {
-                       unsigned int last = ServerInstance->Modules->ActiveDynrefs.size() - 1;
+                       unsigned int last = dynrefs->size() - 1;
                        if (i != last)
-                               ServerInstance->Modules->ActiveDynrefs[i] = ServerInstance->Modules->ActiveDynrefs[last];
-                       ServerInstance->Modules->ActiveDynrefs.erase(ServerInstance->Modules->ActiveDynrefs.begin() + last);
+                               dynrefs->at(i) = dynrefs->at(last);
+                       dynrefs->erase(dynrefs->begin() + last);
+                       if (dynrefs->empty())
+                       {
+                               delete dynrefs;
+                               dynrefs = NULL;
+                       }
                        return;
                }
        }