CUtlMemory<UtlRBTreeNode_t<CUtlMap<int,CBaseAchievement*,unsigned_short>::Node_t,unsigned_short>,unsigned_short>::Grow

/* CUtlMemory<UtlRBTreeNode_t<CUtlMap<int, CBaseAchievement*, unsigned short>::Node_t, unsigned
   short>, unsigned short>::Grow(int) */

void __thiscall
CUtlMemory<UtlRBTreeNode_t<CUtlMap<int,CBaseAchievement*,unsigned_short>::Node_t,unsigned_short>,unsigned_short>
::Grow(CUtlMemory<UtlRBTreeNode_t<CUtlMap<int,CBaseAchievement*,unsigned_short>::Node_t,unsigned_short>,unsigned_short>
       *this,int param_1)

{
  int iVar1;
  uint uVar2;
  void *pvVar3;
  uint uVar4;
  uint uVar5;
  
  iVar1 = *(int *)(this + 8);
  if (iVar1 < 0) {
    return;
  }
  uVar2 = *(uint *)(this + 4);
  uVar4 = param_1 + uVar2;
  if (iVar1 == 0) {
    if (uVar2 == 0) {
      uVar2 = 2;
    }
    for (; (int)uVar2 < (int)uVar4; uVar2 = uVar2 * 2) {
    }
  }
  else {
    uVar2 = ((int)(uVar4 - 1) / iVar1 + 1) * iVar1;
  }
  if ((int)(uVar2 & 0xffff) < (int)uVar4) {
    if ((short)uVar2 == 0) {
      uVar2 = uVar2 - 1;
      if (0xffff < (int)uVar4) {
        return;
      }
    }
    else {
      uVar5 = uVar4 & 0xffff;
      if (uVar5 != uVar4) {
        return;
      }
      if ((int)(uVar2 & 0xffff) < (int)uVar4) {
        do {
          uVar2 = (int)(uVar2 + uVar5) / 2;
        } while ((uVar2 & 0xffff) < uVar5);
      }
    }
  }
  *(uint *)(this + 4) = uVar2;
  if (*(void **)this != (void *)0x0) {
    pvVar3 = realloc(*(void **)this,uVar2 << 4);
    *(void **)this = pvVar3;
    return;
  }
  pvVar3 = malloc(uVar2 << 4);
  *(void **)this = pvVar3;
  return;
}