38 lines
925 B
C
38 lines
925 B
C
/* MessageServer_Release_x64.exe sha256 7911b15c4379625eaa12ff227708aa3a033bc6ac2cf6b34283136e3a62df25f1
|
|
* Ghidra 12.1.2 decompiler output for 0x140051b70 FUN_140051b70
|
|
* Pseudocode, not original source. */
|
|
|
|
void FUN_140051b70(longlong *param_1,longlong param_2)
|
|
|
|
{
|
|
code *pcVar1;
|
|
ulonglong uVar2;
|
|
ulonglong uVar3;
|
|
|
|
uVar3 = param_1[1] - *param_1 >> 2;
|
|
if (0x3fffffffffffffffU - param_2 < uVar3) {
|
|
std::_Xlength_error("vector<T> too long");
|
|
pcVar1 = (code *)swi(3);
|
|
(*pcVar1)();
|
|
return;
|
|
}
|
|
uVar3 = uVar3 + param_2;
|
|
uVar2 = param_1[2] - *param_1 >> 2;
|
|
if (uVar2 < uVar3) {
|
|
if (0x3fffffffffffffff - (uVar2 >> 1) < uVar2) {
|
|
uVar2 = 0;
|
|
if (uVar3 != 0) {
|
|
uVar2 = uVar3;
|
|
}
|
|
FUN_14004e7d0(param_1,uVar2);
|
|
return;
|
|
}
|
|
uVar2 = uVar2 + (uVar2 >> 1);
|
|
if (uVar2 < uVar3) {
|
|
uVar2 = uVar3;
|
|
}
|
|
FUN_14004e7d0(param_1,uVar2);
|
|
}
|
|
return;
|
|
}
|
|
|