L L4D2node

CUtlRBTree<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char,CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>>::NewNode

0x008b1060 · 268 bytes · __thiscall

_ZN10CUtlRBTreeIN7CUtlMapI7CHandleI11CBaseEntityE22scavenge_cache_entry_thE6Node_tEhNS5_8CKeyLessE10CUtlMemoryI15UtlRBTreeNode_tIS6_hEhEE7NewNodeEv

Decompiled

undefined (1 param)

/* CUtlRBTree<CUtlMap<CHandle<CBaseEntity>, scavenge_cache_entry_t, unsigned char>::Node_t, unsigned
   char, CUtlMap<CHandle<CBaseEntity>, scavenge_cache_entry_t, unsigned char>::CKeyLess,
   CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>, scavenge_cache_entry_t, unsigned
   char>::Node_t, unsigned char>, unsigned char> >::NewNode() */

void __thiscall
CUtlRBTree<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char,CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>>
::NewNode(CUtlRBTree<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char,CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>>
          *this)

{
  int iVar1;
  uint uVar2;
  int iVar3;
  CUtlRBTree<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char,CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>>
  CVar4;
  uint uVar5;
  
  if (this[0x12] !=
      (CUtlRBTree<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char,CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>>
       )0xff) {
    iVar3 = *(int *)(this + 4);
    iVar1 = (uint)(byte)this[0x12] * 0x10 + iVar3;
    this[0x12] = *(CUtlRBTree<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char,CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>>
                   *)(iVar1 + 1);
    goto LAB_008b1086;
  }
  iVar1 = *(int *)(this + 8);
  if ((int)(uint)(byte)this[0x13] < iVar1) {
    uVar5 = (byte)this[0x13] + 1;
    uVar2 = uVar5 & 0xff;
    if (iVar1 <= (int)uVar2) {
      uVar2 = 0xff;
      uVar5 = 0xff;
    }
    if (iVar1 <= (int)uVar2) goto LAB_008b10f9;
LAB_008b10c6:
    CVar4 = SUB41(uVar5,0);
    iVar1 = (uVar5 & 0xff) << 4;
  }
  else {
    iVar3 = 0xff;
    if (0 < iVar1) {
      iVar3 = 0;
    }
    uVar5 = (0 < iVar1) - 1;
    if (iVar3 < iVar1) goto LAB_008b10c6;
LAB_008b10f9:
    CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>
    ::Grow((CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>
            *)(this + 4),1);
    iVar3 = *(int *)(this + 8);
    CVar4 = (CUtlRBTree<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char,CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>>
             )0xff;
    if ((int)(uint)(byte)this[0x13] < iVar3) {
      uVar2 = (byte)this[0x13] + 1;
      CVar4 = SUB41(uVar2,0);
      uVar2 = uVar2 & 0xff;
      if ((int)uVar2 < iVar3) {
        iVar1 = uVar2 << 4;
      }
      else {
        iVar1 = 0xff0;
        uVar2 = 0xff;
        CVar4 = (CUtlRBTree<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char,CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>>
                 )0xff;
      }
    }
    else {
      uVar2 = 0;
      iVar1 = 0xff0;
      if (iVar3 < 1) {
        uVar2 = 0xff;
      }
      else {
        iVar1 = 0;
        CVar4 = (CUtlRBTree<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char,CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<CHandle<CBaseEntity>,scavenge_cache_entry_t,unsigned_char>::Node_t,unsigned_char>,unsigned_char>>
                 )0x0;
      }
    }
    if (iVar3 <= (int)uVar2) {
      Error("CUtlRBTree overflow!\n");
    }
  }
  iVar3 = *(int *)(this + 4);
  this[0x13] = CVar4;
  iVar1 = iVar3 + iVar1;
LAB_008b1086:
  if (iVar1 != -4) {
    *(undefined4 *)(iVar1 + 4) = 0xffffffff;
    iVar3 = *(int *)(this + 4);
  }
  *(int *)(this + 0x14) = iVar3;
  return;
}

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)