127 lines
3.9 KiB
C
127 lines
3.9 KiB
C
/* DBCServer_Release_x64.exe sha256 d9e4fccdf3482e50247686d4452c0b13c75a53efc4bd7320668eece8d1ce828c
|
|
* Ghidra 12.1.2 decompiler output for 0x1401a8910 FUN_1401a8910
|
|
* Pseudocode, not original source. */
|
|
|
|
void FUN_1401a8910(longlong param_1,int param_2,undefined8 param_3,undefined8 param_4)
|
|
|
|
{
|
|
longlong *plVar1;
|
|
undefined8 *puVar2;
|
|
ulonglong uVar3;
|
|
int iVar4;
|
|
int iVar5;
|
|
undefined8 *puVar6;
|
|
ulonglong uVar7;
|
|
uint uVar8;
|
|
ulonglong uVar9;
|
|
longlong lVar10;
|
|
longlong lVar11;
|
|
undefined1 local_c8 [144];
|
|
|
|
lVar11 = (longlong)param_2;
|
|
if (param_2 < 0) {
|
|
/* WARNING: Subroutine does not return */
|
|
FUN_14016d6b0();
|
|
}
|
|
iVar5 = *(int *)(param_1 + 0x18);
|
|
if (param_2 != iVar5) {
|
|
if (*(int *)(param_1 + 0x1c) < param_2) {
|
|
iVar5 = FUN_14016f8a0(param_1,param_2,param_3,param_4,0xfffffffffffffffe);
|
|
lVar10 = (longlong)iVar5;
|
|
plVar1 = *(longlong **)(param_1 + 8);
|
|
if (*(int *)(param_1 + 0x1c) == 0) {
|
|
if (plVar1 == (longlong *)0x0) {
|
|
puVar2 = (undefined8 *)FUN_14016d940(lVar10 << 3);
|
|
}
|
|
else {
|
|
puVar2 = (undefined8 *)(**(code **)(*plVar1 + 8))(plVar1,lVar10 << 3);
|
|
}
|
|
*(undefined8 **)(param_1 + 0x10) = puVar2;
|
|
if (0 < param_2) {
|
|
do {
|
|
if (puVar2 != (undefined8 *)0x0) {
|
|
*puVar2 = 0;
|
|
}
|
|
puVar2 = puVar2 + 1;
|
|
lVar11 = lVar11 + -1;
|
|
} while (lVar11 != 0);
|
|
}
|
|
}
|
|
else {
|
|
lVar11 = *(longlong *)(param_1 + 0x10);
|
|
if (plVar1 == (longlong *)0x0) {
|
|
puVar2 = (undefined8 *)FUN_14016d940(lVar10 << 3);
|
|
}
|
|
else {
|
|
puVar2 = (undefined8 *)(**(code **)(*plVar1 + 8))(plVar1,lVar10 << 3);
|
|
}
|
|
iVar4 = *(int *)(param_1 + 0x18);
|
|
uVar7 = 0;
|
|
uVar3 = uVar7;
|
|
uVar9 = uVar7;
|
|
puVar6 = puVar2;
|
|
if (0 < (longlong)iVar4) {
|
|
do {
|
|
if (puVar6 != (undefined8 *)0x0) {
|
|
*puVar6 = 0;
|
|
FUN_1401a4b40(puVar6,lVar11 + uVar3 * 8);
|
|
}
|
|
uVar8 = (int)uVar9 + 1;
|
|
uVar3 = (longlong)(int)uVar8;
|
|
uVar9 = (ulonglong)uVar8;
|
|
puVar6 = puVar6 + 1;
|
|
} while ((longlong)(int)uVar8 < (longlong)iVar4);
|
|
}
|
|
iVar4 = param_2 - *(int *)(param_1 + 0x18);
|
|
puVar6 = puVar2 + *(int *)(param_1 + 0x18);
|
|
if (0 < iVar4) {
|
|
do {
|
|
if (puVar6 != (undefined8 *)0x0) {
|
|
*puVar6 = 0;
|
|
}
|
|
uVar8 = (int)uVar7 + 1;
|
|
uVar7 = (ulonglong)uVar8;
|
|
puVar6 = puVar6 + 1;
|
|
} while ((int)uVar8 < iVar4);
|
|
}
|
|
if (puVar2 == (undefined8 *)0x0) {
|
|
FUN_14016d300(local_c8,L"Memory allocation failure!");
|
|
/* WARNING: Subroutine does not return */
|
|
_CxxThrowException(local_c8,(ThrowInfo *)&DAT_1403417f8);
|
|
}
|
|
FUN_1401a7f40(lVar11,(longlong)*(int *)(param_1 + 0x18));
|
|
plVar1 = *(longlong **)(param_1 + 8);
|
|
if (plVar1 == (longlong *)0x0) {
|
|
FUN_14016d970(lVar11);
|
|
}
|
|
else {
|
|
(**(code **)(*plVar1 + 0x18))(plVar1,lVar11);
|
|
}
|
|
*(undefined8 **)(param_1 + 0x10) = puVar2;
|
|
}
|
|
*(int *)(param_1 + 0x1c) = iVar5;
|
|
}
|
|
else if (iVar5 - param_2 < 1) {
|
|
iVar4 = param_2 - iVar5;
|
|
if (0 < iVar4) {
|
|
puVar2 = (undefined8 *)(*(longlong *)(param_1 + 0x10) + (longlong)iVar5 * 8);
|
|
iVar5 = 0;
|
|
if (0 < iVar4) {
|
|
do {
|
|
if (puVar2 != (undefined8 *)0x0) {
|
|
*puVar2 = 0;
|
|
}
|
|
iVar5 = iVar5 + 1;
|
|
puVar2 = puVar2 + 1;
|
|
} while (iVar5 < iVar4);
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
FUN_1401a7f40(*(longlong *)(param_1 + 0x10) + lVar11 * 8,(longlong)(iVar5 - param_2));
|
|
}
|
|
*(int *)(param_1 + 0x18) = param_2;
|
|
}
|
|
return;
|
|
}
|
|
|