Made it compile :p

[user/henk/code/inspircd.git] / src / cull_list.cpp

diff --git a/src/cull_list.cpp b/src/cull_list.cpp
index f1dd5b4d99e83070b3dda074dbba6ea83af9ccff..74400ef1badfc3881f71f597d6e12f7b04560fed 100644 (file)
--- a/src/cull_list.cpp
+++ b/src/cull_list.cpp
@@ -50,19 +50,59 @@ using namespace std;
 #include "cull_list.h"
 
 extern InspIRCd* ServerInstance;
+extern user_hash clientlist;
 
-CullItem::CullItem(userrec* u, std::string r)
+bool CullList::IsValid(userrec* user)
+{
+       time_t esignon = 0;
+       std::map<userrec*,time_t>::iterator es = exempt.find(user);
+       if (es != exempt.end())
+               esignon = es->second;
+
+       for (user_hash::iterator u = clientlist.begin(); u != clientlist.end(); u++)
+       {
+               /*
+                * BUGFIX
+                *
+                * Because there is an undetermined period of time between a user existing,
+                * and this function being called, we have to check for the following condition:
+                *
+                * Between CullList::AddItem(u) being called, and CullList::IsValid(u) being called,
+                * the user with the pointer u has quit, but only to be REPLACED WITH A NEW USER WHO
+                * BECAUSE OF ALLOCATION RULES, HAS THE SAME MEMORY ADDRESS! To prevent this, we
+                * cross reference each pointer to the user's signon time, and if the signon times
+                * do not match, we return false here to indicate this user is NOT valid as it
+                * seems to differ from the pointer snapshot we got a few seconds earlier. Should
+                * prevent a few random crashes during netsplits.
+                */
+               if (user == u->second)
+                       return (u->second->signon == esignon);
+       }
+       return false;
+}
+
+CullItem::CullItem(userrec* u, std::string &r)
 {
         this->user = u;
         this->reason = r;
 }
 
+CullItem::CullItem(userrec* u, const char* r)
+{
+       this->user = u;
+       this->reason = r;
+}
+
+CullItem::~CullItem()
+{
+}
+
 userrec* CullItem::GetUser()
 {
         return this->user;
 }
 
-std::string CullItem::GetReason()
+std::string& CullItem::GetReason()
 {
         return this->reason;
 }
@@ -73,13 +113,23 @@ CullList::CullList()
         exempt.clear();
 }
 
-void CullList::AddItem(userrec* user, std::string reason)
+void CullList::AddItem(userrec* user, std::string &reason)
 {
        if (exempt.find(user) == exempt.end())
        {
                CullItem item(user,reason);
                list.push_back(item);
-               exempt[user] = 1;
+               exempt[user] = user->signon;
+       }
+}
+
+void CullList::AddItem(userrec* user, const char* reason)
+{
+       if (exempt.find(user) == exempt.end())
+       {
+               CullItem item(user,reason);
+               list.push_back(item);
+               exempt[user] = user->signon;
        }
 }
 
@@ -90,17 +140,27 @@ int CullList::Apply()
         {
                std::vector<CullItem>::iterator a = list.begin();
                userrec* u = a->GetUser();
-               kill_link(u,a->GetReason().c_str());
-               list.erase(list.begin());
-               /* So that huge numbers of quits dont block,
-                * we yield back to our mainloop every 15
-                * iterations.
-                * The DoOneIteration call basically acts
-                * like a software threading mechanism.
+               /* Because ServerInstance->DoOneIteration can
+                * take the user away from us in the middle of
+                * our operation, we should check to see if this
+                * pointer is still valid by iterating the hash.
+                * It's expensive, yes, but the DoOneIteration
+                * call stops it being horrendously bad.
                 */
-               if ((n++ % 15) == 0)
+               if (IsValid(u))
                {
-                       ServerInstance->DoOneIteration(false);
+                       kill_link(u,a->GetReason().c_str());
+                       list.erase(list.begin());
+                       /* So that huge numbers of quits dont block,
+                        * we yield back to our mainloop every 15
+                        * iterations.
+                        * The DoOneIteration call basically acts
+                        * like a software threading mechanism.
+                        */
+                       if (((n++) % 15) == 0)
+                       {
+                               ServerInstance->DoOneIteration(false);
+                       }
                }
         }
         return n;