L L4D2node

CUtlDict<CUserMessage*,int>::RemoveAll

0x0057da50 · 308 bytes · __thiscall

_ZN8CUtlDictIP12CUserMessageiE9RemoveAllEv

Decompiled

undefined (1 param)

/* CUtlDict<CUserMessage*, int>::RemoveAll() */

void __thiscall CUtlDict<CUserMessage*,int>::RemoveAll(CUtlDict<CUserMessage*,int> *this)

{
  int iVar1;
  int *piVar2;
  int iVar3;
  
  iVar3 = *(int *)(this + 0x10);
  if (CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
      ::Links(int)::s_Sentinel == '\0') goto LAB_0057daae;
LAB_0057da70:
  if (iVar3 == -1) goto LAB_0057daf0;
  do {
    piVar2 = (int *)(*(int *)(this + 4) + iVar3 * 0x18);
    iVar1 = iVar3;
    while( true ) {
      if (*piVar2 == -1) {
        for (; iVar1 != -1;
            iVar1 = CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
                    ::NextInorder((CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
                                   *)this,iVar1)) {
          free(*(void **)(*(int *)(this + 4) + iVar1 * 0x18 + 0x10));
        }
        CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
        ::RemoveAll((CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
                     *)this);
        return;
      }
      if ((CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
           ::Links(int)::s_Sentinel == '\0') &&
         (iVar3 = __cxa_guard_acquire(&CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
                                       ::Links(int)::s_Sentinel), iVar3 != 0)) {
        CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
        ::Links(int)::s_Sentinel = -1;
        DAT_00f1ecf0 = 0xffffffff;
        DAT_00f1ecf4 = 0xffffffff;
        __cxa_guard_release(&CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
                             ::Links(int)::s_Sentinel);
      }
      iVar3 = CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
              ::Links(int)::s_Sentinel;
      if (iVar1 != -1) {
        iVar3 = *(int *)(*(int *)(this + 4) + iVar1 * 0x18);
      }
      if (CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
          ::Links(int)::s_Sentinel != '\0') goto LAB_0057da70;
LAB_0057daae:
      iVar1 = __cxa_guard_acquire(&CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
                                   ::Links(int)::s_Sentinel);
      if (iVar1 == 0) goto LAB_0057da70;
      CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
      ::Links(int)::s_Sentinel = -1;
      DAT_00f1ecf0 = 0xffffffff;
      DAT_00f1ecf4 = 0xffffffff;
      __cxa_guard_release(&CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
                           ::Links(int)::s_Sentinel);
      if (iVar3 != -1) break;
LAB_0057daf0:
      piVar2 = &CUtlRBTree<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int,CUtlMap<char_const*,CUserMessage*,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,CUserMessage*,int>::Node_t,int>,int>>
                ::Links(int)::s_Sentinel;
      iVar1 = iVar3;
    }
  } while( true );
}

SourceMod gamedata

paste into addons/sourcemod/gamedata/<your_plugin>.txt
used as the SourceMod key — change to fit your plugin's convention
SourceMod library name (server / engine / matchmaking)

Just a Signatures{} block, ready to drop into a gamedata file. Wire it up in your plugin however you like - SDKCall, DHooks, raw memory ops, or anything else.



        

        

          

Type inference is best-effort from the C signature - sanity-check the DHooks types before shipping.

Return-type handling cheatsheet (DHookReturn)