CUtlVector<CBSPTreeData::Leaf_t,CUtlMemory<CBSPTreeData::Leaf_t,int>>::InsertBefore

/* CUtlVector<CBSPTreeData::Leaf_t, CUtlMemory<CBSPTreeData::Leaf_t, int> >::InsertBefore(int,
   CBSPTreeData::Leaf_t const&) */

int __thiscall
CUtlVector<CBSPTreeData::Leaf_t,CUtlMemory<CBSPTreeData::Leaf_t,int>>::InsertBefore
          (CUtlVector<CBSPTreeData::Leaf_t,CUtlMemory<CBSPTreeData::Leaf_t,int>> *this,int param_1,
          Leaf_t *param_2)

{
  void *pvVar1;
  int iVar2;
  int iVar3;
  int iVar4;
  
  iVar3 = *(int *)(this + 4);
  iVar4 = *(int *)(this + 0xc) + 1;
  if (iVar3 < iVar4) {
    iVar2 = *(int *)(this + 8);
    if (-1 < iVar2) {
      if (iVar2 == 0) {
        if (iVar3 == 0) {
          if (iVar4 < 0x11) {
            iVar2 = 0x10;
            goto LAB_000bc6df;
          }
          iVar3 = 0x10;
        }
        do {
          iVar2 = iVar3 * 2;
          if (iVar4 <= iVar2) break;
          iVar2 = iVar3 * 4;
          iVar3 = iVar2;
        } while (iVar2 < iVar4);
      }
      else {
        for (iVar2 = iVar2 * (*(int *)(this + 0xc) / iVar2 + 1); iVar2 < iVar4;
            iVar2 = (iVar2 + iVar4) / 2) {
        }
      }
LAB_000bc6df:
      *(int *)(this + 4) = iVar2;
      if (*(void **)this == (void *)0x0) {
        pvVar1 = malloc(iVar2 * 2);
        *(void **)this = pvVar1;
      }
      else {
        pvVar1 = realloc(*(void **)this,iVar2 * 2);
        *(void **)this = pvVar1;
        iVar4 = *(int *)(this + 0xc) + 1;
      }
      goto LAB_000bc66e;
    }
  }
  pvVar1 = *(void **)this;
LAB_000bc66e:
  *(int *)(this + 0xc) = iVar4;
  iVar4 = (iVar4 - param_1) + -1;
  *(void **)(this + 0x10) = pvVar1;
  iVar3 = param_1 * 2;
  if (0 < iVar4) {
    _V_memmove((void *)((int)pvVar1 + iVar3 + 2),(void *)((int)pvVar1 + iVar3),iVar4 * 2);
    pvVar1 = *(void **)this;
  }
  if ((undefined2 *)((int)pvVar1 + iVar3) != (undefined2 *)0x0) {
    *(undefined2 *)((int)pvVar1 + iVar3) = *(undefined2 *)param_2;
  }
  return param_1;
}