├── .gitignore ├── D2UberMod.sln ├── D2UberMod ├── D2UberMod.cpp ├── D2UberMod.h ├── D2UberMod.vcxproj ├── D2UberMod.vcxproj.filters ├── Diablo │ ├── D2Api.cpp │ ├── D2Api.h │ ├── D2Api113c.cpp │ ├── D2Api113c.h │ ├── D2Api113d.cpp │ ├── D2Api113d.h │ ├── D2Api114d.cpp │ ├── D2Api114d.h │ └── D2Structs.h ├── UberTristram │ ├── UberAi.cpp │ ├── UberAi.h │ ├── UberQuest.cpp │ ├── UberQuest.h │ ├── UberQuestState.cpp │ └── UberQuestState.h ├── Util │ ├── DllUtil.cpp │ ├── DllUtil.h │ ├── Func.h │ ├── FuncPtr.h │ ├── Patch.h │ ├── RNG.cpp │ ├── RNG.h │ ├── Var.h │ ├── Version.cpp │ └── Version.h ├── dllmain.cpp └── framework.h ├── LICENSE └── README.md /.gitignore: -------------------------------------------------------------------------------- 1 | # Prerequisites 2 | *.d 3 | 4 | # Compiled Object files 5 | *.slo 6 | *.lo 7 | *.o 8 | *.obj 9 | 10 | # Precompiled Headers 11 | *.gch 12 | *.pch 13 | 14 | # Compiled Dynamic libraries 15 | *.so 16 | *.dylib 17 | *.dll 18 | 19 | # Fortran module files 20 | *.mod 21 | *.smod 22 | 23 | # Compiled Static libraries 24 | *.lai 25 | *.la 26 | *.a 27 | *.lib 28 | 29 | # Executables 30 | *.exe 31 | *.out 32 | *.app 33 | 34 | # User-specific files 35 | *.rsuser 36 | *.suo 37 | *.user 38 | *.userosscache 39 | *.sln.docstates 40 | 41 | # Build results 42 | [Dd]ebug/ 43 | [Dd]ebugPublic/ 44 | [Rr]elease/ 45 | [Rr]eleases/ 46 | x64/ 47 | x86/ 48 | [Ww][Ii][Nn]32/ 49 | [Aa][Rr][Mm]/ 50 | [Aa][Rr][Mm]64/ 51 | bld/ 52 | [Bb]in/ 53 | [Oo]bj/ 54 | [Ll]og/ 55 | [Ll]ogs/ 56 | 57 | # Visual Studio cache/options directory 58 | .vs/ 59 | -------------------------------------------------------------------------------- /D2UberMod.sln: -------------------------------------------------------------------------------- 1 |  2 | Microsoft Visual Studio Solution File, Format Version 12.00 3 | # Visual Studio Version 16 4 | VisualStudioVersion = 16.0.30011.22 5 | MinimumVisualStudioVersion = 10.0.40219.1 6 | Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "D2UberMod", "D2UberMod\D2UberMod.vcxproj", "{70EFC2D8-03B7-4925-BF63-14897560A9CC}" 7 | EndProject 8 | Global 9 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 10 | Debug|x86 = Debug|x86 11 | Release|x86 = Release|x86 12 | EndGlobalSection 13 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 14 | {70EFC2D8-03B7-4925-BF63-14897560A9CC}.Debug|x86.ActiveCfg = Debug|Win32 15 | {70EFC2D8-03B7-4925-BF63-14897560A9CC}.Debug|x86.Build.0 = Debug|Win32 16 | {70EFC2D8-03B7-4925-BF63-14897560A9CC}.Release|x86.ActiveCfg = Release|Win32 17 | {70EFC2D8-03B7-4925-BF63-14897560A9CC}.Release|x86.Build.0 = Release|Win32 18 | EndGlobalSection 19 | GlobalSection(SolutionProperties) = preSolution 20 | HideSolutionNode = FALSE 21 | EndGlobalSection 22 | GlobalSection(ExtensibilityGlobals) = postSolution 23 | SolutionGuid = {EB12BC53-3EBD-44C1-B73A-5C9BF5482D9C} 24 | EndGlobalSection 25 | EndGlobal 26 | -------------------------------------------------------------------------------- /D2UberMod/D2UberMod.cpp: -------------------------------------------------------------------------------- 1 | #include "D2UberMod.h" 2 | #include "Diablo\D2Api.h" 3 | #include "Diablo\D2Api113c.h" 4 | #include "Diablo\D2Api113d.h" 5 | #include "Diablo\D2Api114d.h" 6 | #include "UberTristram\UberQuest.h" 7 | #include "Util\Version.h" 8 | 9 | namespace D2UberMod 10 | { 11 | bool initialized = false; 12 | 13 | bool InitApi() { 14 | std::string version = Version::GetVersionString(); 15 | if (version == "1.13c") { 16 | D2Api = std::make_unique(); 17 | return true; 18 | } 19 | else if (version == "1.13d") { 20 | D2Api = std::make_unique(); 21 | return true; 22 | } 23 | else if (version == "1.14d") { 24 | D2Api = std::make_unique(); 25 | return true; 26 | } 27 | else { 28 | return false; 29 | } 30 | } 31 | 32 | bool OnAttach(HMODULE pModule, LPVOID reserved) 33 | { 34 | initialized = InitApi(); 35 | if (!initialized) return false; 36 | 37 | UberQuest::Install(); 38 | return true; 39 | } 40 | 41 | bool OnDetach() 42 | { 43 | if (!initialized) return false; 44 | 45 | UberQuest::Uninstall(); 46 | return true; 47 | } 48 | } -------------------------------------------------------------------------------- /D2UberMod/D2UberMod.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include "framework.h" 3 | 4 | namespace D2UberMod { 5 | bool OnAttach(HMODULE hModule, LPVOID lpReserved); 6 | bool OnDetach(); 7 | } 8 | -------------------------------------------------------------------------------- /D2UberMod/D2UberMod.vcxproj: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | Debug 6 | Win32 7 | 8 | 9 | Release 10 | Win32 11 | 12 | 13 | 14 | 16.0 15 | {70EFC2D8-03B7-4925-BF63-14897560A9CC} 16 | Win32Proj 17 | D2UberMod 18 | 10.0 19 | D2UberMod 20 | 21 | 22 | 23 | DynamicLibrary 24 | true 25 | v142 26 | Unicode 27 | 28 | 29 | DynamicLibrary 30 | false 31 | v142 32 | true 33 | Unicode 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | true 49 | $(SolutionDir)$(Configuration)\Intermediate\ 50 | true 51 | true 52 | $(SolutionDir)$(Configuration)\ 53 | -Wno-pragma-once-outside-header 54 | 55 | 56 | false 57 | $(SolutionDir)$(Configuration)\Intermediate\ 58 | -Wno-pragma-once-outside-header 59 | 60 | 61 | 62 | NotUsing 63 | Level3 64 | true 65 | WIN32;_DEBUG;D2UBERMOD_EXPORTS;_WINDOWS;_USRDLL;%(PreprocessorDefinitions) 66 | true 67 | 68 | 69 | stdcpp17 70 | %(DisableSpecificWarnings) 71 | 72 | 73 | 74 | 75 | Windows 76 | true 77 | false 78 | 79 | 80 | version.lib 81 | 82 | 83 | 84 | 85 | NotUsing 86 | Level3 87 | true 88 | true 89 | true 90 | WIN32;NDEBUG;D2UBERMOD_EXPORTS;_WINDOWS;_USRDLL;%(PreprocessorDefinitions) 91 | true 92 | 93 | 94 | stdcpp17 95 | %(DisableSpecificWarnings) 96 | 97 | 98 | 99 | 100 | Windows 101 | true 102 | true 103 | true 104 | false 105 | 106 | 107 | version.lib 108 | 109 | 110 | 111 | 112 | 113 | 114 | 115 | 116 | 117 | 118 | 119 | 120 | 121 | 122 | 123 | 124 | 125 | 126 | 127 | 128 | 129 | 130 | 131 | 132 | 133 | 134 | 135 | 136 | 137 | 138 | 139 | 140 | 141 | 142 | 143 | 144 | 145 | 146 | -------------------------------------------------------------------------------- /D2UberMod/D2UberMod.vcxproj.filters: -------------------------------------------------------------------------------- 1 |  2 | 3 | 4 | 5 | 6 | 7 | Util 8 | 9 | 10 | UberTristram 11 | 12 | 13 | UberTristram 14 | 15 | 16 | UberTristram 17 | 18 | 19 | Util 20 | 21 | 22 | Diablo 23 | 24 | 25 | Diablo 26 | 27 | 28 | Diablo 29 | 30 | 31 | Util 32 | 33 | 34 | Diablo 35 | 36 | 37 | 38 | 39 | 40 | 41 | Util 42 | 43 | 44 | Util 45 | 46 | 47 | Util 48 | 49 | 50 | Util 51 | 52 | 53 | Util 54 | 55 | 56 | Diablo 57 | 58 | 59 | Diablo 60 | 61 | 62 | UberTristram 63 | 64 | 65 | UberTristram 66 | 67 | 68 | UberTristram 69 | 70 | 71 | Util 72 | 73 | 74 | Diablo 75 | 76 | 77 | Diablo 78 | 79 | 80 | Util 81 | 82 | 83 | Diablo 84 | 85 | 86 | 87 | 88 | {03f5d638-6537-45b0-8e69-a1743f878921} 89 | 90 | 91 | {ce62c741-0a77-4c52-a726-2cca06928731} 92 | 93 | 94 | {2556c508-e0c2-4c00-9fc1-0c45456ece25} 95 | 96 | 97 | -------------------------------------------------------------------------------- /D2UberMod/Diablo/D2Api.cpp: -------------------------------------------------------------------------------- 1 | #include "D2Api.h" 2 | 3 | int D2ApiBase::GetUnitX(Unit* unit) 4 | { 5 | return D2GetUnitX(unit); 6 | } 7 | 8 | int D2ApiBase::GetUnitY(Unit* unit) 9 | { 10 | return D2GetUnitY(unit); 11 | } 12 | 13 | Point D2ApiBase::GetUnitPosition(Unit* unit) 14 | { 15 | return { D2GetUnitX(unit), D2GetUnitY(unit) }; 16 | } 17 | 18 | BYTE D2ApiBase::GetLevelID(Room* room) 19 | { 20 | return D2GetLevelID(room); 21 | } 22 | 23 | Room* D2ApiBase::GetRoomFromUnit(Unit* unit) 24 | { 25 | return D2GetRoomFromUnit(unit); 26 | } 27 | 28 | Unit* D2ApiBase::CreateUnit(UINT32 type, UINT32 id, Point position, Room* room) 29 | { 30 | return D2CreateUnit(type, id, position.x, position.y, *game, room, 1, 1, 0); 31 | } 32 | 33 | Unit* D2ApiBase::LinkPortal(Unit* object, UINT32 levelEndID, UINT32 levelStartID) 34 | { 35 | return D2LinkPortal(*game, object, levelEndID, levelStartID); 36 | } 37 | 38 | BYTE D2ApiBase::GetObjectFlags(Unit* unit) 39 | { 40 | return D2GetObjectFlags(unit); 41 | } 42 | 43 | void D2ApiBase::SetObjectFlags(Unit* unit, BYTE flags) 44 | { 45 | D2SetObjectFlags(unit, flags); 46 | } 47 | 48 | void D2ApiBase::UpdateRoomHasPortalFlag(Room* room) 49 | { 50 | D2UpdateRoomHasPortalFlag(room, 0); 51 | } 52 | 53 | void D2ApiBase::ChangeCurrentMode(Unit* unit, UINT32 value) 54 | { 55 | D2ChangeCurrentMode(unit, value); 56 | } 57 | 58 | void D2ApiBase::MephistoAI(Game* game, Unit* monster, AIParam* aiTickArgs) 59 | { 60 | D2MephistoAI(game, monster, aiTickArgs); 61 | } 62 | 63 | void D2ApiBase::DiabloAI(Game* game, Unit* monster, AIParam* aiTickArgs) 64 | { 65 | D2DiabloAI(game, monster, aiTickArgs); 66 | } 67 | 68 | void D2ApiBase::BaalAI(Game* game, Unit* monster, AIParam* aiTickArgs) 69 | { 70 | D2BaalAI(game, monster, aiTickArgs); 71 | } 72 | 73 | Unit* D2ApiBase::SpawnSuperUnique(UINT32 id, Room* room) 74 | { 75 | return D2SpawnSuperUnique(id, 0, *game, room, 0, 0, -1); 76 | } 77 | 78 | Unit* D2ApiBase::SpawnMonster(UINT32 id, UINT32 mode, Room* room, INT32 x, INT32 y) 79 | { 80 | return D2SpawnMonster(id, mode, *game, room, x, y, 1, 0); 81 | } 82 | 83 | void D2ApiBase::MonsterMove(Unit* monster, Point position) 84 | { 85 | D2MonsterMove(*game, monster, 0, 2, position.x, position.y, 1, 0); 86 | } 87 | 88 | void D2ApiBase::MonsterUseSkill(Unit* monster, Unit* target, MonStatsTxt* monstats, UINT32 skillId) 89 | { 90 | D2MonsterUseSkill(*game, monster, monstats->SkillArg[skillId], monstats->Skill[skillId], target, 0, 0); 91 | } 92 | 93 | void D2ApiBase::MonsterUseSkill(Unit* monster, Point position, MonStatsTxt* monstats, UINT32 skillId) 94 | { 95 | D2MonsterUseSkill(*game, monster, monstats->SkillArg[skillId], monstats->Skill[skillId], 0, position.x, position.y); 96 | } 97 | 98 | D2ApiBase::~D2ApiBase() {} 99 | 100 | void GameExitCallback() { 101 | D2Api->gameExit(); 102 | } 103 | 104 | void RoomEnterCallback(Game* game, Room* room) { 105 | D2Api->roomEnter(game, room); 106 | } -------------------------------------------------------------------------------- /D2UberMod/Diablo/D2Api.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include 3 | #include "../Util/Func.h" 4 | #include "../Util/FuncPtr.h" 5 | #include "../Util/Var.h" 6 | #include "D2Structs.h" 7 | 8 | struct D2ApiBase { 9 | Game** game = nullptr; 10 | 11 | virtual int GetUnitX(Unit* unit); 12 | virtual int GetUnitY(Unit* unit); 13 | virtual Point GetUnitPosition(Unit* unit); 14 | 15 | virtual BYTE GetLevelID(Room* room); 16 | virtual Room* GetRoomFromUnit(Unit* unit); 17 | virtual Unit* CreateUnit(UINT32 type, UINT32 id, Point position, Room* room); 18 | virtual Unit* LinkPortal(Unit* unit, UINT32 levelEndID, UINT32 levelStartID); 19 | virtual BYTE GetObjectFlags(Unit* unit); 20 | virtual void SetObjectFlags(Unit* unit, BYTE flags); 21 | virtual void UpdateRoomHasPortalFlag(Room* room); 22 | virtual void ChangeCurrentMode(Unit* unit, UINT32 value); 23 | 24 | virtual void MephistoAI(Game* game, Unit* monster, AIParam* aiTickArgs); 25 | virtual void DiabloAI(Game* game, Unit* monster, AIParam* aiTickArgs); 26 | virtual void BaalAI(Game* game, Unit* monster, AIParam* aiTickArgs); 27 | 28 | virtual Unit* SpawnSuperUnique(UINT32 id, Room* room); 29 | virtual Unit* SpawnMonster(UINT32 id, UINT32 mode, Room* room, INT32 x, INT32 y); 30 | virtual void MonsterMove(Unit* monster, Point position); 31 | virtual void MonsterUseSkill(Unit* monster, Unit* target, MonStatsTxt* monstats, UINT32 skillId); 32 | virtual void MonsterUseSkill(Unit* monster, Point position, MonStatsTxt* monstats, UINT32 skillId); 33 | 34 | std::function roomEnter; 35 | std::function gameExit; 36 | 37 | FuncPtr uberPortal; 38 | FuncPtr finalUberPortal; 39 | FuncPtr uberMephistoAI; 40 | FuncPtr uberDiabloAI; 41 | FuncPtr uberBaalAI; 42 | 43 | virtual ~D2ApiBase() = 0; 44 | 45 | protected: 46 | Func D2GetUnitX; 47 | Func D2GetUnitY; 48 | 49 | Func D2GetLevelID; 50 | Func D2GetRoomFromUnit; 51 | Func D2CreateUnit; 52 | Func D2LinkPortal; 53 | Func D2GetObjectFlags; 54 | Func D2SetObjectFlags; 55 | Func D2UpdateRoomHasPortalFlag; 56 | Func D2ChangeCurrentMode; 57 | 58 | Func D2MephistoAI; 59 | Func D2DiabloAI; 60 | Func D2BaalAI; 61 | 62 | Func D2SpawnSuperUnique; 63 | Func D2SpawnMonster; 64 | Func D2MonsterMove; 65 | Func D2MonsterUseSkill; 66 | }; 67 | 68 | inline std::unique_ptr D2Api; 69 | 70 | void GameExitCallback(); 71 | void RoomEnterCallback(Game* game, Room* room); -------------------------------------------------------------------------------- /D2UberMod/Diablo/D2Api113c.cpp: -------------------------------------------------------------------------------- 1 | #include "D2Api113c.h" 2 | #include "../Util/Patch.h" 3 | 4 | void __declspec(naked) RoomEnter113c_Hook() { 5 | __asm 6 | { 7 | pushad 8 | mov ecx, [esp + 0x40] 9 | mov edx, [esp + 0x44] 10 | push edx 11 | push ecx 12 | call RoomEnterCallback 13 | add esp, 8 14 | popad 15 | pop EBP 16 | push ESI 17 | push EBP 18 | MOV EBP, DWORD PTR SS : [ESP + 0x24] 19 | ret 20 | } 21 | } 22 | 23 | void __declspec(naked) GameExit113c_Hook() 24 | { 25 | __asm 26 | { 27 | pushad 28 | call GameExitCallback 29 | popad 30 | pop EBP 31 | pop EBX 32 | add ESP, 8 33 | ret 4 34 | } 35 | } 36 | 37 | static auto roomEnterPatch = Patch<5>(&RoomEnter113c_Hook, Type::Call, D2GAME, 0x200E5); 38 | static auto gameExitPatch = Patch<5>(&GameExit113c_Hook, Type::Jump, D2CLIENT, 0x44F2A); 39 | 40 | void __fastcall D2MonsterUseSkill113c_stub(void* monsterUseSkill, Unit* monster, Game* game, Unit* target, UINT32 skillId, UINT32 skillArg, INT32 x, INT32 y) 41 | { 42 | __asm 43 | { 44 | mov eax, skillArg; 45 | mov ebx, game; 46 | mov ecx, monster; 47 | push y; 48 | push x; 49 | push target; 50 | push skillId; 51 | call monsterUseSkill; 52 | } 53 | // Game sets monsters AiControl args[0] to 0 after this call 54 | monster->monsterData->aiGeneral->args[0] = 0; 55 | }; 56 | 57 | void D2Api113c::MonsterUseSkill(Unit* monster, Unit* target, MonStatsTxt* monstats, UINT32 skillId) 58 | { 59 | D2MonsterUseSkill113c_stub(D2MonsterUseSkill.get(), monster, *game, target, monstats->Skill[skillId], monstats->SkillArg[skillId], 0, 0); 60 | } 61 | void D2Api113c::MonsterUseSkill(Unit* monster, Point position, MonStatsTxt* monstats, UINT32 skillId) 62 | { 63 | D2MonsterUseSkill113c_stub(D2MonsterUseSkill.get(), monster, *game, 0, monstats->Skill[skillId], monstats->SkillArg[skillId], position.x, position.y); 64 | } 65 | 66 | D2Api113c::D2Api113c() 67 | { 68 | game = Var{ D2CLIENT, 0x12236C }; 69 | 70 | uberPortal = { D2GAME, 0xFA5F0 }; 71 | finalUberPortal = { D2GAME, 0xFA5F4 }; 72 | 73 | uberMephistoAI = { D2GAME, 0x10F0B0 }; 74 | uberDiabloAI = { D2GAME, 0x10F0C0 }; 75 | uberBaalAI = { D2GAME, 0x10F0A0 }; 76 | 77 | D2GetUnitX = { D2CLIENT, 0x1630 }; 78 | D2GetUnitY = { D2CLIENT, 0x1660 }; 79 | 80 | D2GetLevelID = { D2COMMON, -10826 }; 81 | D2GetRoomFromUnit = { D2COMMON, -10331 }; 82 | D2CreateUnit = { D2GAME, 0xE1D90 }; 83 | D2LinkPortal = { D2GAME, 0xA22E0 }; 84 | D2GetObjectFlags = { D2COMMON, -10258 }; 85 | D2SetObjectFlags = { D2COMMON, -10111 }; 86 | D2UpdateRoomHasPortalFlag = { D2COMMON, -10346 }; 87 | D2ChangeCurrentMode = { D2COMMON, -11090 }; 88 | 89 | D2MephistoAI = { D2GAME, 0x85B60 }; 90 | D2DiabloAI = { D2GAME, 0xA9610 }; 91 | D2BaalAI = { D2GAME, 0xB8610 }; 92 | 93 | D2SpawnSuperUnique = { D2GAME, 0x24950 }; 94 | D2SpawnMonster = { D2GAME, 0xEF650 }; 95 | D2MonsterMove = { D2GAME, 0xF2540 }; 96 | D2MonsterUseSkill = { D2GAME, 0xF2380 }; 97 | 98 | gameExitPatch.Install(); 99 | roomEnterPatch.Install(); 100 | } 101 | 102 | D2Api113c::~D2Api113c() 103 | { 104 | gameExitPatch.Uninstall(); 105 | roomEnterPatch.Uninstall(); 106 | } -------------------------------------------------------------------------------- /D2UberMod/Diablo/D2Api113c.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include "D2Api.h" 3 | 4 | struct D2Api113c : D2ApiBase { 5 | void MonsterUseSkill(Unit* monster, Unit* target, MonStatsTxt* monstats, UINT32 skillId) override; 6 | void MonsterUseSkill(Unit* monster, Point position, MonStatsTxt* monstats, UINT32 skillId) override; 7 | 8 | D2Api113c(); 9 | ~D2Api113c(); 10 | }; -------------------------------------------------------------------------------- /D2UberMod/Diablo/D2Api113d.cpp: -------------------------------------------------------------------------------- 1 | #include "D2Api113d.h" 2 | #include "../Util/Patch.h" 3 | 4 | void __declspec(naked) RoomEnter113d_Hook() { 5 | __asm 6 | { 7 | pushad 8 | mov ecx, [esp + 0x40] 9 | mov edx, [esp + 0x44] 10 | push edx 11 | push ecx 12 | call RoomEnterCallback 13 | add esp, 8 14 | popad 15 | pop ebp 16 | push edi 17 | mov edi, [esp + 0x24] 18 | push ebp 19 | mov ebp, [esp + 0x8] 20 | ret 21 | } 22 | } 23 | 24 | void __declspec(naked) GameExit113d_Hook() 25 | { 26 | __asm 27 | { 28 | pushad 29 | call GameExitCallback 30 | popad 31 | pop EBP 32 | pop EBX 33 | add ESP, 8 34 | ret 4 35 | } 36 | } 37 | 38 | static auto roomEnterPatch = Patch<5>(&RoomEnter113d_Hook, Type::Call, D2GAME, 0x8D4C4); 39 | static auto gameExitPatch = Patch<5>(&GameExit113d_Hook, Type::Jump, D2CLIENT, 0x45F7A); 40 | 41 | void __fastcall D2MonsterUseSkill113d_stub(void* monsterUseSkill, Unit* monster, Game* game, Unit* target, UINT32 skillId, UINT32 skillArg, INT32 x, INT32 y) 42 | { 43 | __asm 44 | { 45 | mov eax, skillArg; 46 | mov ebx, game; 47 | mov ecx, monster; 48 | push y; 49 | push x; 50 | push target; 51 | push skillId; 52 | call monsterUseSkill; 53 | } 54 | // Game sets monsters AiControl args[0] to 0 after this call 55 | monster->monsterData->aiGeneral->args[0] = 0; 56 | }; 57 | 58 | void D2Api113d::MonsterUseSkill(Unit* monster, Unit* target, MonStatsTxt* monstats, UINT32 skillId) 59 | { 60 | D2MonsterUseSkill113d_stub(D2MonsterUseSkill.get(), monster, *game, target, monstats->Skill[skillId], monstats->SkillArg[skillId], 0, 0); 61 | } 62 | void D2Api113d::MonsterUseSkill(Unit* monster, Point position, MonStatsTxt* monstats, UINT32 skillId) 63 | { 64 | D2MonsterUseSkill113d_stub(D2MonsterUseSkill.get(), monster, *game, 0, monstats->Skill[skillId], monstats->SkillArg[skillId], position.x, position.y); 65 | } 66 | 67 | D2Api113d::D2Api113d() 68 | { 69 | game = Var{ D2CLIENT, 0x123CFC }; 70 | 71 | uberPortal = { D2GAME, 0xFA2C4 }; 72 | finalUberPortal = { D2GAME, 0xFA2C8 }; 73 | 74 | uberMephistoAI = { D2GAME, 0x10F628 }; 75 | uberDiabloAI = { D2GAME, 0x10F638 }; 76 | uberBaalAI = { D2GAME, 0x10F618 }; 77 | 78 | D2GetUnitX = { D2CLIENT, 0x1210 }; 79 | D2GetUnitY = { D2CLIENT, 0x1240 }; 80 | 81 | D2GetLevelID = { D2COMMON, -10691 }; 82 | D2GetRoomFromUnit = { D2COMMON, -10846 }; 83 | D2CreateUnit = { D2GAME, 0x6FE10 }; 84 | D2LinkPortal = { D2GAME, 0x15F40 }; 85 | D2GetObjectFlags = { D2COMMON, -10040 }; 86 | D2SetObjectFlags = { D2COMMON, -10033 }; 87 | D2UpdateRoomHasPortalFlag = { D2COMMON, -10907 }; 88 | D2ChangeCurrentMode = { D2COMMON, -10193 }; 89 | 90 | D2MephistoAI = { D2GAME, 0x4EAD0 }; 91 | D2DiabloAI = { D2GAME, 0x31920 }; 92 | D2BaalAI = { D2GAME, 0xC8850 }; 93 | 94 | D2SpawnSuperUnique = { D2GAME, 0xCDE20 }; 95 | D2SpawnMonster = { D2GAME, 0xC8D70 }; 96 | D2MonsterMove = { D2GAME, 0xF1800 }; 97 | D2MonsterUseSkill = { D2GAME, 0xF1430 }; 98 | 99 | gameExitPatch.Install(); 100 | roomEnterPatch.Install(); 101 | } 102 | 103 | D2Api113d::~D2Api113d() 104 | { 105 | gameExitPatch.Uninstall(); 106 | roomEnterPatch.Uninstall(); 107 | } -------------------------------------------------------------------------------- /D2UberMod/Diablo/D2Api113d.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include "D2Api.h" 3 | 4 | struct D2Api113d : D2ApiBase { 5 | void MonsterUseSkill(Unit* monster, Unit* target, MonStatsTxt* monstats, UINT32 skillId) override; 6 | void MonsterUseSkill(Unit* monster, Point position, MonStatsTxt* monstats, UINT32 skillId) override; 7 | 8 | D2Api113d(); 9 | ~D2Api113d(); 10 | }; 11 | -------------------------------------------------------------------------------- /D2UberMod/Diablo/D2Api114d.cpp: -------------------------------------------------------------------------------- 1 | #include "D2Api114d.h" 2 | #include "../Util/Patch.h" 3 | 4 | void __declspec(naked) RoomEnter114d_Hook() { 5 | __asm 6 | { 7 | pushad 8 | push edx 9 | push ecx 10 | call RoomEnterCallback 11 | add esp, 8 12 | popad 13 | mov edi, ebx 14 | mov[ebp - 0x14], esi 15 | ret 16 | } 17 | } 18 | 19 | void __declspec(naked) GameExit114d_Hook() 20 | { 21 | __asm 22 | { 23 | pushad 24 | call GameExitCallback 25 | popad 26 | mov eax, 0x1 27 | ret 28 | } 29 | } 30 | 31 | static auto roomEnterPatch = Patch<5>(&RoomEnter114d_Hook, Type::Call, GAME, 0x142B4E); 32 | static auto gameExitPatch = Patch<5>(&GameExit114d_Hook, Type::Call, GAME, 0x4F345); 33 | 34 | Unit* __fastcall D2LinkPortal114d_stub(void* linkPortal, Game* game, Unit* object, UINT32 levelEndID, UINT32 levelStartID) 35 | { 36 | __asm 37 | { 38 | mov ecx, game; 39 | push levelStartID; 40 | push levelEndID; 41 | push object; 42 | call linkPortal; 43 | } 44 | } 45 | 46 | Unit* __fastcall D2SpawnSuperUnique114d_stub(void* spawnSuperUnique, Game* game, UINT32 id, Room* room) 47 | { 48 | __asm 49 | { 50 | push 0; 51 | push -1; 52 | push 0; 53 | push 0; 54 | push 0; 55 | push room; 56 | mov ebx, id; 57 | mov edi, game; 58 | call spawnSuperUnique; 59 | } 60 | } 61 | 62 | Unit* D2Api114d::SpawnSuperUnique(UINT32 id, Room* room) 63 | { 64 | return D2SpawnSuperUnique114d_stub(D2SpawnSuperUnique.get(), *game, id, room); 65 | } 66 | 67 | Unit* D2Api114d::SpawnMonster(UINT32 id, UINT32 mode, Room* room, INT32 x, INT32 y) 68 | { 69 | return D2SpawnMonster(*game, room, x, y, id, mode, 1, 0); 70 | } 71 | 72 | Unit* D2Api114d::LinkPortal(Unit* object, UINT32 levelEndID, UINT32 levelStartID) 73 | { 74 | return D2LinkPortal114d_stub(D2LinkPortal.get(), *game, object, levelEndID, levelStartID); 75 | } 76 | 77 | D2Api114d::D2Api114d() 78 | { 79 | game = Var{ GAME, 0x3A069C }; 80 | 81 | uberPortal = { GAME, 0x2E11D0 }; 82 | finalUberPortal = { GAME, 0x2E11D4 }; 83 | 84 | uberMephistoAI = { GAME, 0x33D340 }; 85 | uberDiabloAI = { GAME, 0x33D350 }; 86 | uberBaalAI = { GAME, 0x33D330 }; 87 | 88 | D2GetUnitX = { GAME, 0x5ADF0 }; 89 | D2GetUnitY = { GAME, 0x5AE20 }; 90 | 91 | D2GetLevelID = { GAME, 0x21A1B0 }; 92 | D2GetRoomFromUnit = { GAME, 0x220BB0 }; 93 | D2CreateUnit = { GAME, 0x155230 }; 94 | D2LinkPortal = { GAME, 0x16CF40 }; 95 | D2GetObjectFlags = { GAME, 0x2222C0 }; 96 | D2SetObjectFlags = { GAME, 0x222300 }; 97 | D2UpdateRoomHasPortalFlag = { GAME, 0x21AED0 }; 98 | D2ChangeCurrentMode = { GAME, 0x224690 }; 99 | 100 | D2MephistoAI = { GAME, 0x1F78B0 }; 101 | D2DiabloAI = { GAME, 0x1E9170 }; 102 | D2BaalAI = { GAME, 0x1FCFE0 }; 103 | 104 | D2SpawnSuperUnique = { GAME, 0x1A09E0 }; 105 | D2SpawnMonster = { GAME, 0x1B2F20 }; 106 | D2MonsterMove = { GAME, 0x1DEB60 }; 107 | D2MonsterUseSkill = { GAME, 0x1DEAD0 }; 108 | 109 | gameExitPatch.Install(); 110 | roomEnterPatch.Install(); 111 | } 112 | 113 | D2Api114d::~D2Api114d() 114 | { 115 | gameExitPatch.Uninstall(); 116 | roomEnterPatch.Uninstall(); 117 | } -------------------------------------------------------------------------------- /D2UberMod/Diablo/D2Api114d.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include "D2Api.h" 3 | 4 | struct D2Api114d : D2ApiBase { 5 | 6 | Unit* LinkPortal(Unit* unit, UINT32 levelEndID, UINT32 levelStartID) override; 7 | Unit* SpawnSuperUnique(UINT32 id, Room* room) override; 8 | Unit* SpawnMonster(UINT32 id, UINT32 mode, Room* room, INT32 x, INT32 y) override; 9 | 10 | D2Api114d(); 11 | ~D2Api114d(); 12 | 13 | protected: 14 | Func D2SpawnMonster; 15 | }; -------------------------------------------------------------------------------- /D2UberMod/Diablo/D2Structs.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include 3 | 4 | struct Level; 5 | struct PlayerData; 6 | struct MonsterData; 7 | struct ObjectData; 8 | struct Unit; 9 | struct MonStatsTxt; 10 | struct RoomEx; 11 | struct Room; 12 | struct AIControl; 13 | 14 | #pragma pack(push) 15 | #pragma pack(1) 16 | struct Game { 17 | void* u_0x0000[0x1A]; // + 0x0000 18 | BYTE u_0x0068[0x2]; // + 0x0068 19 | BYTE gameType; // + 0x006A - GameType - whenever this is single player 20 | BYTE u_0x006B[0x2]; // + 0x006B 21 | BYTE difficultyLevel; // + 0x006D - DifficultyLevel 0 = NORMAL 1 = NIGHTMARE 2 = HELL 22 | BYTE u_0x006E[0x2]; // + 0x006E 23 | BOOL expansion; // + 0x0070 - Expansion 0 = CLASSIC 1 = EXPANSION 24 | void* u_0x0074[0xD]; // + 0x0074 - GameType - similar to + 06A, this seams to be more related to ladder vs. non ladder (single player is ladder) 25 | UINT32 gameFrame; // + 0x00A8 - GameFrame - the current frame of the game, used for timers(buff duration etc) 26 | }; 27 | 28 | struct Point { 29 | int x; 30 | int y; 31 | }; 32 | 33 | struct PlayerData { 34 | char name[0x10]; //0x00 35 | }; 36 | 37 | struct ObjectData { 38 | void* txt; //0x00 39 | BYTE type; //0x04 (0x0F would be a Exp Shrine) 40 | }; 41 | 42 | struct MonsterData { 43 | MonStatsTxt* monStats; // + 0x000 - pMonStats - record in monstats.txt 44 | BYTE components[16]; // + 0x004 - Components[16] - bytes holding the component Ids for each component; Order: HD, TR, LG, RA, LA, RH, LH, SH, S1, S2, S3, S4, S5, S6, S7, S8 45 | UINT16 nameSeed; // + 0x014 - NameSeed 46 | struct // + 0x016 - TypeFlags 47 | { 48 | BYTE OTHER : 1; // 0x00000001 - MONTYPE_OTHER(set for some champs, uniques) 49 | BYTE SUPERUNIQUE : 1; // 0x00000002 - MONTYPE_SUPERUNIQUE 50 | BYTE CHAMPION : 1; // 0x00000004 - MONTYPE_CHAMPION 51 | BYTE UNIQUE : 1; // 0x00000008 - MONTYPE_UNIQUE 52 | BYTE MINION : 1; // 0x00000010 - MONTYPE_MINION 53 | BYTE POSSESSED : 1; // 0x00000020 - MONTYPE_POSSESSED 54 | BYTE GHOSTLY : 1; // 0x00000040 - MONTYPE_GHOSTLY 55 | BYTE MULTISHOT : 1; // 0x00000080 - MONTYPE_MULTISHOT 56 | }; 57 | BYTE lastMode; // + 0x017 - eLastMode 58 | UINT32 duriel; // + 0x018 - dwDuriel - set only for duriel 59 | BYTE monUModList[10]; // + 0x01C - MonUModList[9] - nine bytes holding the Ids for each MonUMod assigned to the unit 60 | UINT16 bossNo; // + 0x026 - bossNo - hcIdx from superuniques.txt for superuniques(word) 61 | AIControl* aiGeneral; // + 0x028 - pAiGeneral 62 | }; 63 | struct Unit { 64 | UINT32 type; // + 0x000 - eType 0 = PLAYER 1 = MONSTER 2 = OBJECT 3 = MISSILE 4 = ITEM 5 = VIS_TILE 65 | UINT32 txtFileNo; // + 0x004 - eClass, unitclass, thehcIdxfromthesefiles, PlrClass.txt, MonStats.txt, Objects.txt, Missiles.txt, Items.txt(Weapons + Armor + Misc), LvlWarps.txt 66 | void* memPool; // + 0x008 - pMemPool - not used, always NULL(pGame + 1C is always NULL) 67 | UINT32 unitId; // + 0x00C - GUID - global unique identifier that links a server side unit to a client side unit 68 | UINT32 mode; // + 0x010 - eMode-3 = onthefloor, modeindexfrom-> PlrMode.txt, MonMode.txt, ObjMode.txt, Missiles, Items and VisTiles have their own modes(for missiles this holds the collision type), eItemModes 69 | union 70 | { // + 0x014 - pUnitData(union of 5 classes) 71 | PlayerData* playerData; // pPlayerData 72 | void* itemData; // pItemData 73 | MonsterData* monsterData; // pMonsterData 74 | ObjectData* objectData; // pObjectData 75 | }; 76 | UINT32 actNo; // + 0x018 - actNo(byte) 77 | void* act; // + 0x01C - pDrlgAct 78 | UINT32 seed[2]; // + 0x020 seed(inline structure) loSeed, hiSeed; 79 | UINT32 initSeed; // + 0x028 - dwInitSeed 80 | void* path; // + 0x02C - pPath(union of 2 classes), pDynamicPath(Players, Monsters, Missiles), pStaticPath(Objects, VisTiles, Items) 81 | void* u_0x030[0x2D]; // + 0x030 82 | Unit* listNext; // + 0x0E4 - pPrevUnit - previous unit in the unit - type list(the last unit is linked to pGame->pUnitList[eType][GUID & 127] 83 | Unit* roomNext; // + 0x0E8 - pPrevUnitInRoom - the previous unit in the current room 84 | }; 85 | 86 | struct MonStatsTxt 87 | { 88 | UINT32 u_0x000[0x5C]; //0x000 89 | UINT16 Skill[0x8]; //0x170 90 | BYTE SkillArg[0x8]; //0x180 91 | }; 92 | 93 | 94 | struct AIParam { 95 | void* control; //+0x00 96 | void* u_0x04; //+0x04 97 | Unit* target; //+0x08 98 | void* u_0x0C; //+0x0C 99 | void* u_0x10; //+0x10 100 | INT32 distanceToTarget; //+0x14 101 | BOOL engagedInCombat; //+0x18 102 | MonStatsTxt* monStatsRec; //+0x1C MonStatsTxt* 103 | void* monStats2Rec; //+0x20 MonStats2Txt* 104 | }; 105 | 106 | struct RoomEx { 107 | void* u_0x00[2]; //0x00 108 | RoomEx** roomExNear; //0x08 109 | void* u_0x0C[5]; //0x0C 110 | struct { 111 | INT32 roomNumber; //0x00 112 | void* u_0x04; //0x04 113 | PINT32 subNumber; //0x08 114 | } *pType2Info; //0x20 115 | RoomEx* roomExNext; //0x24 116 | UINT32 roomFlags; //0x28 117 | UINT32 roomsNearCount; //0x2C 118 | Room* room; //0x30 119 | INT32 posX; //0x34 120 | INT32 posY; //0x38 121 | INT32 sizeX; //0x3C 122 | INT32 sizeY; //0x40 123 | void* u_0x44; //0x44 124 | UINT32 presetType; //0x48 125 | void* roomTiles; //0x4C 126 | void* u_0x50[2]; //0x50 127 | Level* level; //0x58 128 | }; 129 | 130 | struct Room { 131 | Room** roomsNear; //0x00 132 | void* u_0x04[3]; //0x04 133 | RoomEx* roomEx; //0x10 134 | void* u_0x14[3]; //0x14 135 | void* coll; //0x20 136 | INT32 roomsNearCount; //0x24 137 | void* u_0x28[9]; //0x28 138 | INT32 xStart; //0x4C 139 | INT32 yStart; //0x50 140 | INT32 xSize; //0x54 141 | INT32 ySize; //0x58 142 | void* u_0x5C[6]; //0x5C 143 | Unit* unitFirst; //0x74 144 | void* u_0x78; //0x78 145 | Room* roomNext; //0x7C 146 | }; 147 | 148 | struct Level { 149 | void* u_0x00[4]; //0x00 150 | RoomEx* roomExFirst; //0x10 151 | void* u_0x14[2]; //0x14 152 | INT32 posX; //0x1C 153 | INT32 posY; //0x20 154 | INT32 sizeX; //0x24 155 | INT32 sizeY; //0x28 156 | void* u_0x2C[96]; //0x2C 157 | Level* nextLevel; //0x1AC 158 | void* u_0x1B0; //0x1B0 159 | void* misc; //0x1B4 160 | void* u_0x1B8[6]; //0x1B8 161 | UINT32 levelNo; //0x1D0 162 | }; 163 | 164 | struct AIControl 165 | { 166 | UINT32 specialState; // +00 SpecialState - stuff like terror, confusion goes here 167 | void* aiFunction; // +04 fpAiFunction(); - the primary ai function to call (void * __fastcall)(pGame,pUnit,pAiTickArgs); 168 | UINT32 aiFlags; // +08 AiFlags 169 | UINT32 ownerGUID; // +0C OwnerGUID - the global unique identifier of the boss or minion owner 170 | UINT32 ownerType; // +10 eOwnerType - the unit type of the boss or minion owner 171 | UINT32 args[3]; // +14 dwArgs[3] - three dwords holding custom data used by ai func to store counters (etc) 172 | void* cmdCurrent; // +20 pCmdCurrents 173 | void* cmdLast; // +24 pCmdLast 174 | Game* game; // +28 pGame 175 | UINT32 ownerGUID2; // +2C OwnerGUID - the same as +008 176 | UINT32 ownerType2; // +30 eOwnerType - the same as +00C 177 | void* minionList; // +34 pMinionList - list of all minions, for boss units (SetBoss in MonStats, Unique, SuperUnique etc) 178 | UINT32 trapNo; // +3C eTrapNo - used by shadows for summoning traps (so they stick to one type usually) 179 | }; 180 | 181 | #pragma pack(pop) -------------------------------------------------------------------------------- /D2UberMod/UberTristram/UberAi.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include "..\Diablo\D2Api.h" 4 | #include "..\Util\RNG.h" 5 | #include "UberAi.h" 6 | 7 | static constexpr std::array mephistoMonsters{ 725, 726, 727, 728, 729, 730 }; 8 | static constexpr int mephistoSpawnRadius = 30; 9 | static constexpr int mephistoMinionSpawnChance = 80; 10 | 11 | static constexpr std::array baalMonsters{ 731, 732 }; 12 | static constexpr int baalSpawnRadius = 18; 13 | static constexpr int baalMinionSpawnChance = 30; 14 | static UINT32 baalChillTimer = 0; 15 | 16 | static constexpr std::array diabloMonsters{ 711 }; 17 | static constexpr int diabloSpawnRadius = 25; 18 | static constexpr int diabloMinionSpawnChance = 30; 19 | 20 | int Distance(Point p1, Point p2) { 21 | auto dsqr = (p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p2.y - p2.y); 22 | return (int)sqrt(dsqr); 23 | } 24 | 25 | Point RandInCircle(Point center, int radius) { 26 | double rand1 = RNG::NextDouble(); 27 | double rand2 = RNG::NextDouble(); 28 | 29 | double a = rand1 * 6.28f; 30 | double r = radius * sqrt(rand2); 31 | return { (int)(center.x + r * cos(a)),(int)(center.y + r * sin(a)) }; 32 | } 33 | 34 | void NumberOfMonstersInArea(int& monstersInLevel, int& monstersNearby, Level* level, Point position, int radius) { 35 | for (auto room = level->roomExFirst; room; room = room->roomExNext) 36 | { 37 | if (!room->room) continue; 38 | for (Unit* unit = room->room->unitFirst; unit; unit = unit->roomNext) 39 | { 40 | if (unit->type != 1 || unit->mode == 12 || unit->txtFileNo == 711) continue; 41 | auto unitPos = D2Api->GetUnitPosition(unit); 42 | monstersInLevel++; 43 | if (Distance(unitPos, position) <= radius) monstersNearby++; 44 | } 45 | } 46 | } 47 | 48 | bool SpawnMonster(UINT32 id, UINT32 mode, Point pos, Room* room) 49 | { 50 | Unit* spawn = D2Api->SpawnMonster(id, mode, room, pos.x, pos.y); 51 | if (spawn) return spawn; 52 | 53 | //if spawn fails try to spawn in nearby rooms 54 | for (int j = 0; j < room->roomsNearCount; j++) 55 | { 56 | auto troom = room->roomsNear[j]; 57 | if (pos.x >= troom->xStart && pos.x <= troom->xStart + troom->xSize && 58 | pos.y >= troom->yStart && pos.y <= troom->yStart + troom->ySize) { 59 | spawn = D2Api->SpawnMonster(id, mode, troom, pos.x, pos.y); 60 | break; 61 | } 62 | } 63 | return spawn; 64 | } 65 | 66 | bool TrySpawnMonster(UINT32 id, UINT32 mode, Point position, Unit* unit) 67 | { 68 | auto room = D2Api->GetRoomFromUnit(unit); 69 | auto level = room->roomEx->level; 70 | int monstersInLevel = 0; 71 | int monstersNearby = 0; 72 | NumberOfMonstersInArea(monstersInLevel, monstersNearby, level, position, 25); 73 | 74 | if (monstersNearby > 16 || monstersInLevel > 100) return false; 75 | 76 | return SpawnMonster(id, mode, position, room); 77 | } 78 | 79 | void __fastcall UberMephistoAI(Game* game, Unit* unit, AIParam* aiTickArgs) 80 | { 81 | assert(aiTickArgs->target); 82 | //Spawn minions 83 | if (RNG::NextInt(100) < mephistoMinionSpawnChance && aiTickArgs->distanceToTarget <= mephistoSpawnRadius) 84 | { 85 | auto targetPos = D2Api->GetUnitPosition(aiTickArgs->target); 86 | int monsterIndx = RNG::NextInt(mephistoMonsters.size()); 87 | TrySpawnMonster(mephistoMonsters[monsterIndx], 8, targetPos, unit); 88 | } 89 | D2Api->MephistoAI(game, unit, aiTickArgs); 90 | } 91 | 92 | void __fastcall UberDiabloAI(Game* game, Unit* unit, AIParam* aiTickArgs) 93 | { 94 | assert(aiTickArgs->target); 95 | //Spawn minions 96 | if (RNG::NextInt(100) < diabloMinionSpawnChance && aiTickArgs->distanceToTarget <= diabloSpawnRadius) 97 | { 98 | auto targetPos = D2Api->GetUnitPosition(aiTickArgs->target); 99 | auto pos = RandInCircle(targetPos, 3); 100 | TrySpawnMonster(diabloMonsters[0], 1, pos, unit); 101 | } 102 | 103 | //AI tweek 104 | int chanceToRush = max(0, aiTickArgs->distanceToTarget - 10); 105 | if (chanceToRush > RNG::NextInt(100)) 106 | { 107 | auto targetPos = D2Api->GetUnitPosition(aiTickArgs->target); 108 | bool rush = RNG::NextInt(3) > 0; 109 | if (rush) 110 | { 111 | const int diabloRun = 4; 112 | D2Api->MonsterUseSkill(unit, aiTickArgs->target, aiTickArgs->monStatsRec, diabloRun); 113 | } 114 | else 115 | { 116 | D2Api->MonsterMove(unit, targetPos); 117 | } 118 | } 119 | else 120 | { 121 | D2Api->DiabloAI(game, unit, aiTickArgs); 122 | } 123 | } 124 | 125 | void __fastcall UberBaalAI(Game* game, Unit* unit, AIParam* aiTickArgs) 126 | { 127 | assert(aiTickArgs->target); 128 | //Spawn minions 129 | if (RNG::NextInt(100) < baalMinionSpawnChance && aiTickArgs->distanceToTarget <= baalSpawnRadius) 130 | { 131 | auto unitPos = D2Api->GetUnitPosition(unit); 132 | auto pos = RandInCircle(unitPos, 3); 133 | int monsterIndx = RNG::NextInt(baalMonsters.size()); 134 | TrySpawnMonster(baalMonsters[monsterIndx], 1, pos, unit);; 135 | } 136 | 137 | //AI tweek 138 | if (baalChillTimer == 0 || (game->gameFrame - baalChillTimer > 6000)) { 139 | baalChillTimer = game->gameFrame; 140 | const int chillingArmor = 7; 141 | D2Api->MonsterUseSkill(unit, {0,0}, aiTickArgs->monStatsRec, chillingArmor); 142 | return; 143 | } 144 | 145 | int chanceToApproach = max(0, aiTickArgs->distanceToTarget - 10); 146 | if (chanceToApproach > RNG::NextInt(100)) 147 | { 148 | auto targetPos = D2Api->GetUnitPosition(aiTickArgs->target); 149 | bool rush = RNG::NextInt(3) > 0; 150 | if (rush) 151 | { 152 | const int baalTeleport = 4; 153 | D2Api->MonsterUseSkill(unit, targetPos, aiTickArgs->monStatsRec, baalTeleport); 154 | } 155 | else 156 | { 157 | D2Api->MonsterMove(unit, targetPos); 158 | } 159 | } 160 | else 161 | { 162 | D2Api->BaalAI(game, unit, aiTickArgs); 163 | } 164 | } 165 | 166 | void ResetAI() 167 | { 168 | baalChillTimer = 0; 169 | } -------------------------------------------------------------------------------- /D2UberMod/UberTristram/UberAi.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include "..\Diablo\D2Structs.h" 3 | 4 | void __fastcall UberMephistoAI(Game* game, Unit* unit, AIParam* aiTickArgs); 5 | void __fastcall UberDiabloAI(Game* game, Unit* unit, AIParam* aiTickArgs); 6 | void __fastcall UberBaalAI(Game* game, Unit* unit, AIParam* aiTickArgs); 7 | void ResetAI(); 8 | -------------------------------------------------------------------------------- /D2UberMod/UberTristram/UberQuest.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include "..\Diablo\D2Api.h" 5 | #include "UberQuestState.h" 6 | #include "UberQuest.h" 7 | #include "UberAi.h" 8 | 9 | static UberQuestState questState{}; 10 | 11 | BOOL OpenPortal(Unit* unit, BYTE lvlID) { 12 | const UINT32 OBJECTPERMANENTPORTALID = 0x3c; 13 | const UINT32 OBJECT = 2; 14 | const BYTE HELL = 2; 15 | 16 | Game* game = *D2Api->game; 17 | if (game->difficultyLevel != HELL) return FALSE; 18 | 19 | auto playerLevelID = D2Api->GetLevelID(D2Api->GetRoomFromUnit(unit)); 20 | if (playerLevelID != ACT5TOWN_LEVEL) return FALSE; 21 | 22 | Point position = D2Api->GetUnitPosition(unit); 23 | Room* potalRoomOrigin = D2Api->GetRoomFromUnit(unit); 24 | Unit* portalOrigin = D2Api->CreateUnit(OBJECT, OBJECTPERMANENTPORTALID, position, potalRoomOrigin); 25 | 26 | portalOrigin->objectData->type = lvlID; 27 | D2Api->ChangeCurrentMode(portalOrigin, 1); 28 | 29 | Unit* portalDestination = D2Api->LinkPortal(portalOrigin, lvlID, ACT5TOWN_LEVEL); 30 | D2Api->SetObjectFlags(portalDestination, D2Api->GetObjectFlags(portalDestination) | 3); 31 | D2Api->UpdateRoomHasPortalFlag(potalRoomOrigin); 32 | D2Api->UpdateRoomHasPortalFlag(D2Api->GetRoomFromUnit(portalDestination)); 33 | 34 | questState.Active = true; 35 | return TRUE; 36 | } 37 | 38 | BOOL __fastcall OpenUberPortal(Game* game, Unit* unit) { 39 | auto lvlID = questState.GetNextPortalId(); 40 | if (lvlID!=0) { 41 | if (OpenPortal(unit, lvlID)) { 42 | questState.SetPortalOpen(lvlID, true); 43 | return TRUE; 44 | } 45 | } 46 | return FALSE; 47 | } 48 | BOOL __fastcall OpenFinalUberPortal(Game* game, Unit* unit) { 49 | if (!questState.TristramPortalOpen) { 50 | if (OpenPortal(unit, TRISTRAM_LEVEL)) { 51 | questState.SetPortalOpen(TRISTRAM_LEVEL, true); 52 | return TRUE; 53 | } 54 | } 55 | return FALSE; 56 | } 57 | 58 | void OnGameExit() 59 | { 60 | questState.Reset(); 61 | ResetAI(); 62 | } 63 | 64 | void OnRoomEnter(Game* game, Room* room) 65 | { 66 | auto lvlID = D2Api->GetLevelID(room); 67 | if (!questState.IsUberQuestLevel(lvlID)) { 68 | return; 69 | } 70 | 71 | auto mIDs = questState.GetNextMonsterId(lvlID); 72 | for (auto mID : mIDs) 73 | { 74 | auto spawn = D2Api->SpawnSuperUnique(mID, room); 75 | if (spawn) { 76 | questState.SetMonsterSpawned(mID, true); 77 | } 78 | } 79 | } 80 | 81 | void UberQuest::Install() 82 | { 83 | questState.Reset(); 84 | ResetAI(); 85 | 86 | D2Api->uberPortal.connect(&OpenUberPortal); 87 | D2Api->finalUberPortal.connect(&OpenFinalUberPortal); 88 | D2Api->uberBaalAI.connect(&UberBaalAI); 89 | D2Api->uberDiabloAI.connect(&UberDiabloAI); 90 | D2Api->uberMephistoAI.connect(&UberMephistoAI); 91 | 92 | D2Api->gameExit = OnGameExit; 93 | D2Api->roomEnter = OnRoomEnter; 94 | } 95 | void UberQuest::Uninstall() 96 | { 97 | questState.Reset(); 98 | ResetAI(); 99 | 100 | D2Api->uberPortal.disconnect(); 101 | D2Api->finalUberPortal.disconnect(); 102 | D2Api->uberBaalAI.disconnect(); 103 | D2Api->uberDiabloAI.disconnect(); 104 | D2Api->uberMephistoAI.disconnect(); 105 | 106 | D2Api->gameExit = nullptr; 107 | D2Api->roomEnter = nullptr; 108 | } -------------------------------------------------------------------------------- /D2UberMod/UberTristram/UberQuest.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | namespace UberQuest { 4 | void Install(); 5 | void Uninstall(); 6 | } -------------------------------------------------------------------------------- /D2UberMod/UberTristram/UberQuestState.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include "UberQuestState.h" 3 | #include "../Util/RNG.h" 4 | 5 | BYTE UberQuestState::GetNextPortalId() 6 | { 7 | BYTE lvl = 0; 8 | int priority = 0; 9 | if (!LilithPortalOpen) { 10 | priority = LilithPortalPriority; 11 | lvl = LILITH_LEVEL; 12 | } 13 | if (!DurielPortalOpen && DurielPortalPriority > priority) { 14 | priority = DurielPortalPriority; 15 | lvl = DURIEL_LEVEL; 16 | } 17 | if (!IzualPortalOpen && IzualPortalPriority > priority) { 18 | lvl = IZUAL_LEVEL; 19 | } 20 | return lvl; 21 | } 22 | 23 | std::vector UberQuestState::GetNextMonsterId(BYTE lvlID) 24 | { 25 | std::vector result; 26 | if (!LilithSpawned && lvlID == LILITH_LEVEL) { 27 | if (!LilithPriority) result.push_back(LILITH_ID); 28 | else LilithPriority--; 29 | } 30 | 31 | if (!DurielSpawned && lvlID == DURIEL_LEVEL) { 32 | if (!DurielPriority) result.push_back(DURIEL_ID); 33 | else DurielPriority--; 34 | } 35 | 36 | if (!IzualSpawned && lvlID == IZUAL_LEVEL) { 37 | if (!IzualPriority) result.push_back(IZUAL_ID); 38 | else IzualPriority--; 39 | } 40 | 41 | if (lvlID == TRISTRAM_LEVEL) { 42 | if (!UberBaalSpawned && !UberBaalPriority) result.push_back(UBER_BAAL_ID); 43 | else UberBaalPriority--; 44 | if (!UberMephistoSpawned && !UberMephistoPriority) result.push_back(UBER_MEPHISTO_ID); 45 | else UberMephistoPriority--; 46 | if (!UberDiabloSpawned && !UberDiabloPriority) result.push_back(UBER_DIABLO_ID); 47 | else UberDiabloPriority--; 48 | 49 | std::shuffle(result.begin(), result.end(), RNG::engine); 50 | } 51 | 52 | return result; 53 | } 54 | 55 | void UberQuestState::SetMonsterSpawned(UINT32 id, bool value) 56 | { 57 | if (id == LILITH_ID) LilithSpawned = value; 58 | if (id == DURIEL_ID) DurielSpawned = value; 59 | if (id == IZUAL_ID) IzualSpawned = value; 60 | if (id == UBER_MEPHISTO_ID) UberMephistoSpawned = value; 61 | if (id == UBER_DIABLO_ID) UberDiabloSpawned = value; 62 | if (id == UBER_BAAL_ID) UberBaalSpawned = value; 63 | } 64 | 65 | void UberQuestState::SetPortalOpen(BYTE lvlID, bool value) 66 | { 67 | if (lvlID == LILITH_LEVEL) LilithPortalOpen = value; 68 | if (lvlID == DURIEL_LEVEL) DurielPortalOpen = value; 69 | if (lvlID == IZUAL_LEVEL) IzualPortalOpen = value; 70 | if (lvlID == TRISTRAM_LEVEL) TristramPortalOpen = value; 71 | } 72 | 73 | bool UberQuestState::IsUberQuestLevel(BYTE lvlID) 74 | { 75 | return lvlID == LILITH_LEVEL || lvlID == DURIEL_LEVEL || lvlID == IZUAL_LEVEL || lvlID == TRISTRAM_LEVEL; 76 | } 77 | 78 | void UberQuestState::Reset() 79 | { 80 | LilithPriority = 5 + RNG::NextInt(20); 81 | DurielPriority = 10 + RNG::NextInt(30); 82 | IzualPriority = 10 + RNG::NextInt(20); 83 | 84 | UberMephistoPriority = 1; 85 | UberDiabloPriority = 1; 86 | UberBaalPriority = 1; 87 | 88 | LilithPortalPriority = 1 + RNG::NextInt(10); 89 | DurielPortalPriority = 1 + RNG::NextInt(10); 90 | IzualPortalPriority = 1 + RNG::NextInt(10); 91 | 92 | Active = false; 93 | LilithPortalOpen = false; 94 | DurielPortalOpen = false; 95 | IzualPortalOpen = false; 96 | TristramPortalOpen = false; 97 | 98 | LilithSpawned = false; 99 | DurielSpawned = false; 100 | IzualSpawned = false; 101 | UberMephistoSpawned = false; 102 | UberDiabloSpawned = false; 103 | UberBaalSpawned = false; 104 | } -------------------------------------------------------------------------------- /D2UberMod/UberTristram/UberQuestState.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #include 4 | #include 5 | 6 | const BYTE ACT5TOWN_LEVEL = 109; 7 | const BYTE LILITH_LEVEL = 133; 8 | const BYTE DURIEL_LEVEL = 134; 9 | const BYTE IZUAL_LEVEL = 135; 10 | const BYTE TRISTRAM_LEVEL = 136; 11 | 12 | const UINT32 IZUAL_ID = 706; 13 | const UINT32 LILITH_ID = 707; 14 | const UINT32 DURIEL_ID = 708; 15 | const UINT32 UBER_MEPHISTO_ID = 704; 16 | const UINT32 UBER_DIABLO_ID = 705; 17 | const UINT32 UBER_BAAL_ID = 709; 18 | 19 | class UberQuestState { 20 | private: 21 | int LilithPriority; 22 | int DurielPriority; 23 | int IzualPriority; 24 | 25 | int UberMephistoPriority; 26 | int UberDiabloPriority; 27 | int UberBaalPriority; 28 | 29 | int LilithPortalPriority; 30 | int DurielPortalPriority; 31 | int IzualPortalPriority; 32 | 33 | public: 34 | bool Active; 35 | 36 | bool LilithPortalOpen; 37 | bool DurielPortalOpen; 38 | bool IzualPortalOpen; 39 | bool TristramPortalOpen; 40 | 41 | bool LilithSpawned; 42 | bool DurielSpawned; 43 | bool IzualSpawned; 44 | bool UberMephistoSpawned; 45 | bool UberDiabloSpawned; 46 | bool UberBaalSpawned; 47 | 48 | BYTE GetNextPortalId(); 49 | std::vector GetNextMonsterId(BYTE lvlID); 50 | void SetMonsterSpawned(UINT32 mID, bool value); 51 | void SetPortalOpen(BYTE lvlID, bool value); 52 | bool IsUberQuestLevel(BYTE lvlID); 53 | void Reset(); 54 | }; -------------------------------------------------------------------------------- /D2UberMod/Util/DllUtil.cpp: -------------------------------------------------------------------------------- 1 | #include "DllUtil.h" 2 | 3 | void* DllUtil::GetAddress(const char* dllname, int offset) { 4 | HMODULE hModule = GetModuleHandleA(dllname); 5 | 6 | //If DLL hasn't been loaded, then load it up! 7 | if (!hModule) { hModule = LoadLibraryA(dllname); } 8 | //If the DLL isn't there, or failed to load, return. 9 | if (!hModule) return 0; 10 | 11 | //Check if it is an ordinal, if so, get the proper address. 12 | if (offset < 0) return (void*)GetProcAddress(hModule, (LPCSTR)(-offset)); 13 | 14 | //If just regular offset, add the two and be done! 15 | return (void*)((BYTE*)hModule + offset); 16 | } 17 | 18 | void DllUtil::WriteToReadonlyMemory(PUINT32 to, UINT32 value) { 19 | DWORD protect; 20 | VirtualProtect((VOID*)to, 4, PAGE_EXECUTE_READWRITE, &protect); 21 | *to = value; 22 | VirtualProtect((VOID*)to, 4, protect, &protect); 23 | } -------------------------------------------------------------------------------- /D2UberMod/Util/DllUtil.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include "../framework.h" 3 | 4 | constexpr auto D2CLIENT = "D2CLIENT.dll"; 5 | constexpr auto D2COMMON = "D2COMMON.dll"; 6 | constexpr auto D2GFX = "D2GFX.dll"; 7 | constexpr auto D2WIN = "D2WIN.dll"; 8 | constexpr auto GAME = "GAME.EXE"; 9 | constexpr auto D2GAME = "D2GAME.dll"; 10 | namespace DllUtil { 11 | void* GetAddress(const char* dllName, int offset); 12 | void WriteToReadonlyMemory(PUINT32 to, UINT32 value); 13 | } 14 | -------------------------------------------------------------------------------- /D2UberMod/Util/Func.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include "DllUtil.h" 3 | template< class R, class ... Args> class Func; 4 | 5 | template 6 | class Func { 7 | using func_ptr_t = R(__fastcall*)(Args...); 8 | func_ptr_t fPtr = 0; 9 | void* address = nullptr; 10 | public: 11 | Func(const char* dllName, int offset) { 12 | address = DllUtil::GetAddress(dllName, offset); 13 | fPtr = reinterpret_cast(address); 14 | } 15 | Func() {}; 16 | void* get() { 17 | return address; 18 | } 19 | R operator() (Args... args) { 20 | return fPtr(args...); 21 | }; 22 | }; 23 | 24 | template 25 | class Func { 26 | using func_ptr_t = R(__stdcall*)(Args...); 27 | func_ptr_t fPtr = 0; 28 | void* address = nullptr; 29 | public: 30 | Func(const char* dllName, int offset) { 31 | address = DllUtil::GetAddress(dllName, offset); 32 | fPtr = reinterpret_cast(address); 33 | } 34 | Func() {}; 35 | void* get() { 36 | return address; 37 | } 38 | R operator() (Args... args) { 39 | return fPtr(args...); 40 | }; 41 | }; 42 | -------------------------------------------------------------------------------- /D2UberMod/Util/FuncPtr.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include "DllUtil.h" 3 | template class FuncPtr; 4 | 5 | template 6 | class FuncPtr { 7 | using func_ptr_t = R(__fastcall*)(Args...); 8 | void* value = nullptr; 9 | void* address = nullptr; 10 | 11 | public: 12 | FuncPtr(const char* dllName, int offset) { 13 | address = DllUtil::GetAddress(dllName, offset); 14 | value = *reinterpret_cast(address); 15 | } 16 | FuncPtr() {}; 17 | void connect(func_ptr_t func) { 18 | DllUtil::WriteToReadonlyMemory((PUINT32)address, (UINT32)func); 19 | } 20 | void disconnect() { 21 | DllUtil::WriteToReadonlyMemory((PUINT32)address, (UINT32)value); 22 | } 23 | }; 24 | 25 | template 26 | class FuncPtr { 27 | using func_ptr_t = R(__stdcall*)(Args...); 28 | void* value = nullptr; 29 | void* address = nullptr; 30 | 31 | public: 32 | FuncPtr(const char* dllName, int offset) { 33 | address = DllUtil::GetAddress(dllName, offset); 34 | value = *reinterpret_cast(address); 35 | } 36 | FuncPtr() {}; 37 | void connect(func_ptr_t func) { 38 | DllUtil::WriteToReadonlyMemory((PUINT32)address, (UINT32)func); 39 | } 40 | void disconnect() { 41 | DllUtil::WriteToReadonlyMemory((PUINT32)address, (UINT32)value); 42 | } 43 | }; 44 | 45 | -------------------------------------------------------------------------------- /D2UberMod/Util/Patch.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include 3 | #include 4 | #include "DllUtil.h" 5 | 6 | enum class Type : BYTE{ Jump = 0xE9, Call = 0xE8 }; 7 | 8 | template 9 | struct Patch{ 10 | private: 11 | std::array newCode; 12 | std::array oldCode; 13 | Type type; 14 | void* address; 15 | 16 | public: 17 | Patch(void (*handler)() , Type type, const char* dll, int offset); 18 | void Install(); 19 | void Uninstall(); 20 | }; 21 | 22 | 23 | template 24 | inline Patch::Patch(void (*handler)(), Type type, const char* dll, int offset) : type(type) 25 | { 26 | constexpr BYTE nop = 0x90; 27 | assert(Size >= 5); 28 | newCode.fill(nop); 29 | oldCode.fill(nop); 30 | address = DllUtil::GetAddress(dll, offset); 31 | 32 | ReadProcessMemory(GetCurrentProcess(), address, oldCode.data(), Size, NULL); 33 | 34 | newCode[0] = static_cast(type); 35 | //near, relative, displacement relative to next instruction. 32-bit displacement sign extended to 64-bits in 64-bit mode. 36 | int32_t displacement = (BYTE*)handler - (BYTE*)address - 5; 37 | auto err = memcpy_s(&newCode[1], sizeof(int32_t), &displacement, sizeof(int32_t)); 38 | assert(err == 0); 39 | } 40 | 41 | template 42 | void Patch::Install() 43 | { 44 | DWORD protect; 45 | VirtualProtect(address, Size, PAGE_EXECUTE_READWRITE, &protect); 46 | memcpy_s(address, Size, newCode.data(), Size); 47 | VirtualProtect(address, Size, protect, &protect); 48 | } 49 | 50 | template 51 | void Patch::Uninstall() 52 | { 53 | DWORD protect; 54 | VirtualProtect(address, Size, PAGE_EXECUTE_READWRITE, &protect); 55 | memcpy_s(address, Size, oldCode.data(), Size); 56 | VirtualProtect(address, Size, protect, &protect); 57 | } -------------------------------------------------------------------------------- /D2UberMod/Util/RNG.cpp: -------------------------------------------------------------------------------- 1 | #include "RNG.h" 2 | 3 | int RNG::NextInt(int max) { 4 | return RNG::NextInt(0, max); 5 | } 6 | int RNG::NextInt(int min, int max) { 7 | std::uniform_int_distribution distr(min, max-1); 8 | return distr(RNG::engine); 9 | } 10 | double RNG::NextDouble() { 11 | std::uniform_real_distribution distr(0.0, 1.0); 12 | return distr(RNG::engine); 13 | } -------------------------------------------------------------------------------- /D2UberMod/Util/RNG.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include 3 | namespace RNG { 4 | inline std::default_random_engine engine{ std::random_device{}() }; 5 | //random int [0, max) 6 | int NextInt(int max); 7 | //random int [min, max) 8 | int NextInt(int min, int max); 9 | //random double [0, 1] 10 | double NextDouble(); 11 | } -------------------------------------------------------------------------------- /D2UberMod/Util/Var.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include "DllUtil.h" 3 | 4 | template 5 | struct Var { 6 | private: 7 | R value; 8 | 9 | public: 10 | Var(const char* dll, int offset) { 11 | auto address = DllUtil::GetAddress(dll, offset); 12 | value = reinterpret_cast(address); 13 | } 14 | operator R() { return value; } 15 | }; -------------------------------------------------------------------------------- /D2UberMod/Util/Version.cpp: -------------------------------------------------------------------------------- 1 | #include "Version.h" 2 | #include "..\framework.h" 3 | 4 | std::string D2Version(short major, short minor, short rev, short subrev) { 5 | if (major != 1) return "Unknown"; 6 | if (minor == 0 && rev == 7 && subrev == 0) return "1.07"; 7 | if (minor == 0 && rev == 8 && subrev == 28) return "1.08"; 8 | if (minor == 0 && rev == 9 && subrev == 19) return "1.09"; 9 | if (minor == 0 && rev == 9 && subrev == 20) return "1.09b"; 10 | if (minor == 0 && rev == 9 && subrev == 22) return "1.09d"; 11 | if (minor == 0 && rev == 10 && subrev == 39) return "1.10"; 12 | if (minor == 0 && rev == 11 && subrev == 45) return "1.11"; 13 | if (minor == 0 && rev == 11 && subrev == 46) return "1.11b"; 14 | if (minor == 0 && rev == 12 && subrev == 49) return "1.12"; 15 | if (minor == 0 && rev == 13 && subrev == 60) return "1.13c"; 16 | if (minor == 0 && rev == 13 && subrev == 64) return "1.13d"; 17 | if (minor == 14 && rev == 0 && subrev == 64) return "1.14a"; 18 | if (minor == 14 && rev == 1 && subrev == 68) return "1.14b"; 19 | if (minor == 14 && rev == 2 && subrev == 70) return "1.14c"; 20 | if (minor == 14 && rev == 3 && subrev == 71) return "1.14d"; 21 | return "Unknown"; 22 | } 23 | 24 | std::string Version::GetVersionString() { 25 | std::string name = "Game.exe"; 26 | LPSTR szVersionFile = name.data(); 27 | DWORD verHandle = 0; 28 | UINT size = 0; 29 | LPBYTE lpBuffer = NULL; 30 | DWORD verSize = GetFileVersionInfoSizeA(szVersionFile, &verHandle); 31 | 32 | if (verSize != NULL) 33 | { 34 | LPSTR verData = new char[verSize]; 35 | 36 | if (GetFileVersionInfoA(szVersionFile, 0, verSize, verData)) 37 | { 38 | if (VerQueryValueA(verData, "\\", (VOID FAR * FAR*) & lpBuffer, &size)) 39 | { 40 | if (size) 41 | { 42 | VS_FIXEDFILEINFO* verInfo = (VS_FIXEDFILEINFO*)lpBuffer; 43 | if (verInfo->dwSignature == 0xfeef04bd) 44 | { 45 | return D2Version( 46 | (verInfo->dwFileVersionMS >> 16) & 0xffff, 47 | (verInfo->dwFileVersionMS >> 0) & 0xffff, 48 | (verInfo->dwFileVersionLS >> 16) & 0xffff, 49 | (verInfo->dwFileVersionLS >> 0) & 0xffff 50 | ); 51 | } 52 | } 53 | } 54 | } 55 | delete[] verData; 56 | } 57 | return "Unknown"; 58 | } -------------------------------------------------------------------------------- /D2UberMod/Util/Version.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include 3 | 4 | namespace Version { 5 | std::string GetVersionString(); 6 | } -------------------------------------------------------------------------------- /D2UberMod/dllmain.cpp: -------------------------------------------------------------------------------- 1 | #include "framework.h" 2 | #include "D2UberMod.h" 3 | BOOL APIENTRY DllMain( HMODULE hModule, 4 | DWORD ul_reason_for_call, 5 | LPVOID lpReserved 6 | ) 7 | { 8 | switch (ul_reason_for_call) 9 | { 10 | case DLL_PROCESS_ATTACH: 11 | return D2UberMod::OnAttach(hModule, lpReserved); 12 | case DLL_THREAD_ATTACH: 13 | break; 14 | case DLL_THREAD_DETACH: 15 | break; 16 | case DLL_PROCESS_DETACH: 17 | return D2UberMod::OnDetach(); 18 | } 19 | return TRUE; 20 | } 21 | 22 | -------------------------------------------------------------------------------- /D2UberMod/framework.h: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #define WIN32_LEAN_AND_MEAN // Exclude rarely-used stuff from Windows headers 4 | // Windows Header Files 5 | #include 6 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # D2UberMod 2 | Enables Uber Tristram in singleplayer Diablo II v1.13c, v1.13d and v1.14d 3 | 4 | ![Mephisto](https://user-images.githubusercontent.com/71973715/97115205-26007300-16fe-11eb-9755-0f8fa927b03b.jpg) 5 | ![Diablo](https://user-images.githubusercontent.com/71973715/97115204-200a9200-16fe-11eb-9b5e-21cc0c1ab250.png) 6 | ![Baal](https://user-images.githubusercontent.com/71973715/97115213-2e58ae00-16fe-11eb-8b45-cd860e849bdb.jpg) 7 | 8 | ## Install guide: 9 | #### With PlugY: 10 | - Place `D2UberMod.dll` in the PlugY install directory 11 | - Set DllToLoad in `PlugY.ini` to: 12 | ``` 13 | DllToLoad=D2UberMod.dll 14 | ``` 15 | - Disable plugy uber quest in `PlugY.ini`: 16 | ``` 17 | [UBER QUEST] 18 | ActiveUberQuest=0 19 | ``` 20 | 21 | Plugy can load 2 dlls, setting either `DllToLoad=D2UberMod.dll` or `DllToLoad2=D2UberMod.dll` is fine.
22 | If you are using D2SE place `D2UberMod.dll` in the `D2SE\CORES\1.13c` directory. `PlugY.ini` is also found in `D2SE\CORES\1.13c` and should be modified as shown above. 23 | 24 | 25 | #### Without PlugY: 26 | - inject `D2UberMod.dll` with the injector of your choice. 27 | 28 |
29 | 30 | ### Changelog 31 | [v0.21a](https://github.com/Snapchip/D2UberMod/releases/tag/v0.21a) 32 | - Added support for Diablo II version 1.13d 33 | 34 | [v0.20a](https://github.com/Snapchip/D2UberMod/releases/tag/v0.20a) 35 | - Added support for Diablo II version 1.14d 36 | - Fixed possible crash if the dll was unloaded while the game is running. 37 | 38 | [v0.10a](https://github.com/Snapchip/D2UberMod/releases/tag/v0.10a) 39 | - Uber Baal now casts [Chilling Armor](http://classic.battle.net/diablo2exp/monsters/act5-uberbaal.shtml) 40 | - Fixed a bug where Uber Mephisto would not spawn the correct monsters 41 | - Minor changes to Uber spawn locations 42 | 43 | [v0.02a](https://github.com/Snapchip/D2UberMod/releases/tag/v0.02a) 44 | - Some Uber AI fixes 45 | - Ubers spawn minions! 46 | - Uber Baal and Uber Diablo approach more often when they are far away from the player 47 | 48 | --------------------------------------------------------------------------------