├── vendor.yml ├── .gitmodules ├── src ├── ENetWrapper │ ├── README.md │ ├── PeersIterator.cpp │ ├── ENetWrapper.hpp │ ├── ENetServerRemote.hpp │ ├── ENetServerRemote.cpp │ ├── Peer.hpp │ ├── ENetServer.hpp │ ├── PeersIterator.hpp │ ├── Peer.cpp │ └── ENetServer.cpp ├── Packets │ ├── PacketsEncoder │ │ ├── README.md │ │ ├── VariantList │ │ │ ├── VariantList.hpp │ │ │ └── VariantList.cpp │ │ └── PacketsEncoder.hpp │ ├── README.md │ ├── PacketsCommon │ │ └── PacketsCommon.hpp │ └── PacketsDecoder │ │ └── PacketsDecoder.hpp ├── main.cpp ├── Server.hpp ├── Events │ ├── EventsHandler.cpp │ ├── Event.cpp │ ├── EventsHandler.h │ └── Event.h └── Server.cpp ├── .gitignore ├── README.md ├── CMakeLists.txt ├── appveyor.yml ├── libs └── json │ └── LICENSE.md └── LICENSE /vendor.yml: -------------------------------------------------------------------------------- 1 | - third_party/ 2 | - *.vcxproj 3 | - .vcxproj.filters 4 | - json.hpp 5 | - libs/ 6 | -------------------------------------------------------------------------------- /.gitmodules: -------------------------------------------------------------------------------- 1 | [submodule "libs/enet"] 2 | path = libs/enet 3 | url = https://github.com/GrowtopiaNoobs/enet 4 | -------------------------------------------------------------------------------- /src/ENetWrapper/README.md: -------------------------------------------------------------------------------- 1 | # ENetWrapper 2 | 3 | This is abstraction layer for library ENet. ENet should be only included in those files and shouldn't be ever used directly in any others. -------------------------------------------------------------------------------- /src/Packets/PacketsEncoder/README.md: -------------------------------------------------------------------------------- 1 | # PacketsEncoder 2 | 3 | This is the only one header (and subheaders), which should call `Peer->sendPacket()`. If there is need for `SomePacket->send(OtherClassThanPeer x)`, then please implement `Peer operator=(OtherClassThanPeer rhs)` for your class. -------------------------------------------------------------------------------- /src/Packets/README.md: -------------------------------------------------------------------------------- 1 | # Packets 2 | 3 | This set of header implements functions, structures and classes for decoding, encoding and encoding of packets. 4 | 5 | Use of different files is described here: 6 | - `PacketsCommon` contains files, which should be included only by `PacketsEncoder` and `PacketsDeoder`. It is used for stuff which is needed for both of them. 7 | - `PacketsDecoder` contains files for decoding packet. 8 | - `PacketsEncoder` contains files for encoding packet and sending it to Peer. -------------------------------------------------------------------------------- /.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 | # Directories 35 | .idea/ 36 | bin/ 37 | build/ 38 | cmake-build-debug/ 39 | -------------------------------------------------------------------------------- /src/ENetWrapper/PeersIterator.cpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #include "PeersIterator.hpp" 18 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Growtopia Server 2 [![Build status](https://ci.appveyor.com/api/projects/status/9ofy5h4f4xhoncip?svg=true)](https://ci.appveyor.com/project/GrowtopiaNoobs/growtopiaserver2) 2 | 3 | This code has been tested to compile under Ubuntu 18.04 with CLion 19.3. Windows build should work with Visual Studio, but it isn't tested. 4 | 5 | All functionality of server should be added via modules. Modules should be placed into directory `modules`, which should be placed into same directory as server. Modules should be created using [module API](https://github.com/GrowtopiaNoobs/GrowtopiaServer2-Module). 6 | 7 | This project has been published under GNU AFFERO GPL license, so you need to **publish whole source code and citate orginal authors name, even if you are using your server as service**! 8 | 9 | If you want to support development of this server, then make sure you contribute to this repo! 10 | 11 | Make that sure that you subscribe my channel https://www.youtube.com/channel/UCLXtuoBlrXFDRtFU8vPy35g and enjoy :+1: 12 | -------------------------------------------------------------------------------- /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.10.2) 2 | 3 | project(GrowtopiaServer CXX) 4 | 5 | set(CMAKE_CXX_STANDARD 14) 6 | set(LIBS ${CMAKE_SOURCE_DIR}/libs) 7 | set(EXECUTABLE_OUTPUT_PATH ${CMAKE_SOURCE_DIR}/bin) 8 | set(INCLUDED_LIBS enet pthread) 9 | 10 | if (MSVC) 11 | set(INCLUDED_LIBS enet winmm ws2_32) 12 | endif() 13 | 14 | include_directories(GrowtopiaServer PRIVATE ${LIBS}/enet/include) 15 | include_directories(GrowtopiaServer PRIVATE ${LIBS}/json) 16 | add_subdirectory(${LIBS}/enet) 17 | 18 | file (GLOB srcfiles 19 | src/*.c* s/*.h* 20 | src/*/*.c* s/*/*.h* 21 | src/*/*/*.c* s/*/*/*.h* 22 | src/*/*/*/*.c* s/*/*/*/*.h* 23 | src/*/*/*/*/*.c* s/*/*/*/*/*.h* 24 | src/*/*/*/*/*/*.c* s/*/*/*/*/*/*.h* 25 | src/*/*/*/*/*/*/*.c* s/*/*/*/*/*/*/*.h*) 26 | 27 | list(INSERT CMAKE_MODULE_PATH 0 ${CMAKE_CURRENT_SOURCE_DIR}/CMake) 28 | 29 | add_executable(GrowtopiaServer ${srcfiles}) 30 | 31 | target_compile_options(GrowtopiaServer PRIVATE -shared-libgcc) 32 | 33 | target_link_libraries(GrowtopiaServer ${INCLUDED_LIBS} ${CMAKE_DL_LIBS}) 34 | -------------------------------------------------------------------------------- /src/ENetWrapper/ENetWrapper.hpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | #include 20 | #include 21 | #include 22 | 23 | #include "Peer.hpp" 24 | #include "ENetServer.hpp" 25 | -------------------------------------------------------------------------------- /appveyor.yml: -------------------------------------------------------------------------------- 1 | version: 1.0.{build} 2 | image: 3 | - ubuntu1804 4 | - Visual Studio 2015 5 | - Visual Studio 2017 6 | - Visual Studio 2019 7 | 8 | for: 9 | - 10 | matrix: 11 | only: 12 | - image: ubuntu1804 13 | 14 | build_script: 15 | - sh build.sh 16 | 17 | artifacts: 18 | - path: bin 19 | name: GrowtopiaServer-Ubuntu1804 20 | 21 | - 22 | matrix: 23 | only: 24 | - image: Visual Studio 2015 25 | 26 | build_script: 27 | - build.bat 28 | 29 | artifacts: 30 | - path: bin 31 | name: GrowtopiaServer-WIN-VS15 32 | 33 | - 34 | matrix: 35 | only: 36 | - image: Visual Studio 2017 37 | 38 | build_script: 39 | - build.bat 40 | 41 | artifacts: 42 | - path: bin 43 | name: GrowtopiaServer-WIN-VS17 44 | 45 | - 46 | matrix: 47 | only: 48 | - image: Visual Studio 2019 49 | 50 | build_script: 51 | - build.bat 52 | 53 | artifacts: 54 | - path: bin 55 | name: GrowtopiaServer-WIN-VS19 56 | 57 | deploy: 58 | - provider: GitHub 59 | description: GrowtopiaServer CI Build 60 | auth_token: 61 | secure: 5OeKL0BpXE39SdxcoJ6mZH7EcELGBCnKLHavhELhYtQxuVmt9ZnQu5GzsAOh1rM+ 62 | -------------------------------------------------------------------------------- /src/ENetWrapper/ENetServerRemote.hpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | #include "Peer.hpp" 20 | #include "PeersIterator.hpp" 21 | #include 22 | 23 | class ENetServerRemote { 24 | std::string id; 25 | ENetHost* server; 26 | 27 | public: 28 | PeersIterator getPeers(); 29 | Peer getPeer(std::string id); 30 | std::string getServerID(); 31 | void* getPtr(); 32 | 33 | ENetServerRemote(char* id, void* server) { 34 | this->id = id; 35 | this->server = (ENetHost*)server; 36 | } 37 | }; 38 | -------------------------------------------------------------------------------- /src/Packets/PacketsCommon/PacketsCommon.hpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | struct TankPacketStruct { 20 | uint32_t packetType = 0; 21 | int32_t netID = 0; 22 | uint32_t padding1 = 0; 23 | uint32_t characterState = 0; 24 | uint32_t padding2 = 0; 25 | uint32_t plantingTree = 0; 26 | float x = 0; 27 | float y = 0; 28 | float XSpeed = 0; 29 | float YSpeed = 0; 30 | uint32_t padding3 = 0; 31 | uint32_t punchX = 0; 32 | uint32_t punchY = 0; 33 | uint32_t packetLenght = 0; 34 | }; 35 | 36 | static_assert(sizeof(TankPacketStruct) == 56, "Ivalid size of TankPacketStruct, maybe your compiler isnt supported"); 37 | -------------------------------------------------------------------------------- /libs/json/LICENSE.md: -------------------------------------------------------------------------------- 1 | The class is licensed under the MIT License: 2 | 3 | Copyright © 2013-2019 Niels Lohmann 4 | 5 | Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: 6 | 7 | The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. 8 | 9 | THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 10 | 11 | The class contains the UTF-8 Decoder from Bjoern Hoehrmann which is licensed under the MIT License (see above). Copyright © 2008-2009 Björn Hoehrmann bjoern@hoehrmann.de 12 | 13 | The class contains a slightly modified version of the Grisu2 algorithm from Florian Loitsch which is licensed under the MIT License (see above). Copyright © 2009 Florian Loitsch 14 | 15 | The class contains a copy of Hedley from Evan Nemerson which is licensed as CC0-1.0. 16 | -------------------------------------------------------------------------------- /src/ENetWrapper/ENetServerRemote.cpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #include "ENetServerRemote.hpp" 18 | 19 | PeersIterator ENetServerRemote::getPeers() { 20 | PeersIterator it(this->server->peers, this->server->peerCount, id); 21 | return it; 22 | } 23 | 24 | Peer ENetServerRemote::getPeer(std::string peerID) { 25 | for(int i=0; iserver->peerCount; i++) { 26 | if(this->server->peers[i].state == ENET_PEER_STATE_CONNECTED) { 27 | if(peerID == Peer(&this->server->peers[i], id).getUID()) { 28 | return Peer(&this->server->peers[i], id); 29 | } 30 | } 31 | } 32 | return Peer(NULL, ""); 33 | } 34 | 35 | std::string ENetServerRemote::getServerID() { 36 | return id; 37 | } 38 | 39 | void* ENetServerRemote::getPtr() { 40 | return (void*)this; 41 | } 42 | -------------------------------------------------------------------------------- /src/ENetWrapper/Peer.hpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | #include 20 | #include 21 | #include 22 | 23 | class Peer { 24 | private: 25 | ENetPeer* peer; 26 | std::string serverID = ""; 27 | public: 28 | std::string getIP(); 29 | uint32_t getIPasInt(); 30 | uint32_t getPing(); 31 | std::string getUID(); 32 | uint32_t getIncomingBandwidth(); 33 | uint32_t getOutgoingBandwidth(); 34 | void requestDisconnect(); 35 | //void forceDisconnect(); 36 | void sendPacket(int packetType, char* data, int dataLeght); 37 | 38 | operator std::string() { 39 | return getUID(); 40 | } 41 | 42 | char* getData(); 43 | void setData(char* data); 44 | 45 | bool exists(); 46 | 47 | Peer(ENetPeer* peer, std::string serverID); 48 | Peer(); 49 | }; 50 | -------------------------------------------------------------------------------- /src/Packets/PacketsEncoder/VariantList/VariantList.hpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | #include 20 | #include 21 | #include 22 | #include 23 | 24 | class VariantList 25 | { 26 | private: 27 | std::vector data; 28 | int indexes = 0; 29 | 30 | template 31 | void appendValue(t val); 32 | public: 33 | VariantList& appendFloat(float val); 34 | VariantList& appendFloat(float val1, float val2); 35 | VariantList& appendFloat(float val1, float val2, float val3); 36 | VariantList& appendInt(int val); 37 | VariantList& appendIntx(int val); 38 | VariantList& appendString(std::string str); 39 | std::vector getData(); 40 | 41 | VariantList(); 42 | VariantList(std::string packetName); 43 | ~VariantList(); 44 | }; 45 | -------------------------------------------------------------------------------- /src/ENetWrapper/ENetServer.hpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | #include 20 | #include 21 | #include 22 | #include 23 | 24 | #include "Peer.hpp" 25 | #include "PeersIterator.hpp" 26 | 27 | void ENet_Init(); 28 | 29 | class ENetServer { 30 | protected: 31 | std::thread& getThread(); 32 | void init(int port, int maxPeers); 33 | void execute(); 34 | ENetServer(); 35 | ENetServer(int port, int maxPeers = 256); 36 | ~ENetServer(); 37 | private: 38 | static short id_generator; 39 | std::thread t; 40 | ENetHost * server; 41 | std::string id; 42 | 43 | virtual void OnConnect(Peer peer); 44 | virtual void OnRecievedPacket(Peer peer, uint8_t* data, uint32_t dataLen); 45 | virtual void OnDisconnect(Peer peer); 46 | virtual void OnPeriodicEvent(); 47 | 48 | void run(); 49 | public: 50 | PeersIterator getPeers(); 51 | Peer getPeer(std::string id); 52 | void* getServerPtr(); 53 | std::string getServerID(); 54 | void setServerData(uint8_t* data); 55 | uint8_t* getServerData(); 56 | }; 57 | -------------------------------------------------------------------------------- /src/main.cpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #include 18 | #include 19 | #include 20 | #include 21 | 22 | #include "ENetWrapper/ENetServer.hpp" 23 | #include "Server.hpp" 24 | 25 | void sigint(int) { 26 | std::cout << "Caught SIGINT signal! Stopping server..." << std::endl; 27 | enet_deinitialize(); 28 | exit(0); 29 | } 30 | 31 | void sigterm(int) { 32 | std::cout << "Caught SIGTERM signal! Stopping server..." << std::endl; 33 | enet_deinitialize(); 34 | exit(0); 35 | } 36 | 37 | // TODO: catch other signals too and execute stop event, before server is terminated 38 | 39 | int main () { 40 | std::cout << "GrowServer v0.0.1 starting..." << std::endl; 41 | try { 42 | ENet_Init(); 43 | } catch (...) { 44 | std::cout << "An error occurred while initializing ENet." << std::endl; 45 | return EXIT_FAILURE; 46 | } 47 | registerEventPools(); 48 | modulesLoader.execute(); 49 | registerServerEvents(); 50 | std::vector servers; 51 | for(int i=0; i<4; i++) { 52 | Server* s = new Server(); 53 | servers.push_back(s); 54 | } 55 | int serverOffset = 0; 56 | const int serverBeginPort = 17091; 57 | for(Server* server: servers) { 58 | try { 59 | server->init(serverBeginPort + serverOffset, 128, "127.0.0.1"); 60 | serverOffset++; 61 | } catch(...) { 62 | std::cout << "Error while initializing server " << serverOffset << ", port " << serverBeginPort + serverOffset << " is busy..." << std::endl; 63 | return 1; 64 | } 65 | } 66 | for(Server* server: servers) { 67 | server->execute(); 68 | } 69 | signal(SIGINT, sigint); 70 | signal(SIGTERM, sigterm); 71 | while (true) { 72 | std::this_thread::sleep_for(std::chrono::seconds(10)); 73 | } 74 | } 75 | -------------------------------------------------------------------------------- /src/Server.hpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | #define _X_ (this->events.currentDataPtr) 20 | 21 | #include 22 | #include 23 | #include 24 | 25 | #include "ENetWrapper/ENetServer.hpp" 26 | #include "Packets/PacketsDecoder/PacketsDecoder.hpp" 27 | #include "Packets/PacketsEncoder/PacketsEncoder.hpp" 28 | #include "Events/EventsHandler.h" 29 | 30 | void registerServerEvents(); 31 | 32 | struct ServerData { // add variables under existing ones, so compatibility isn't broken 33 | char* serverUrl; 34 | int serverPort; 35 | }; 36 | 37 | class Server : public ENetServer, private PacketDecoder { 38 | private: 39 | EventsGlobalPool events; 40 | void OnConnect(Peer peer) override; 41 | void OnRecievedPacket(Peer peer, uint8_t* data, uint32_t dataLen) override; 42 | void OnDisconnect(Peer peer) override; 43 | void OnPeriodicEvent() override; 44 | 45 | void OnPlayerActionPacket(Peer peer, std::string data) override; 46 | void OnServerActionPacket(Peer peer, std::string data) override; 47 | void OnTankPacket(Peer peer, TankPacketStruct data, uint8_t* additionalData, uint32_t additionalDataSize) override; 48 | void OnUnknownPacket(Peer peer, int type) override; 49 | public: 50 | Server() {}; 51 | 52 | void init(int port, int peerCount, std::string url) { 53 | uint8_t* tmp = *events.currentDataPtr; 54 | ENetServer::init(port, peerCount); 55 | ServerData* data = new ServerData; 56 | char* name = new char[url.length()+1]; 57 | memcpy(name, url.c_str(), url.length()+1); 58 | data->serverUrl = name; 59 | data->serverPort = port; 60 | setServerData((uint8_t*)data); 61 | EventPack pack(_X_); 62 | events.create_event_self("__MallocServer", pack); 63 | OnPeriodicEvent(); 64 | *events.currentDataPtr = tmp; 65 | } 66 | 67 | void execute() { 68 | ENetServer::execute(); 69 | } 70 | }; 71 | -------------------------------------------------------------------------------- /src/ENetWrapper/PeersIterator.hpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | #include "Peer.hpp" 20 | 21 | class PeersIterator { // https://gist.github.com/jeetsukumaran/307264 22 | 23 | ENetPeer* peersBegin = NULL; 24 | int size = 0; 25 | std::string serverID = ""; 26 | 27 | class iterator 28 | { 29 | public: 30 | typedef iterator self_type; 31 | typedef ENetPeer* value_type; 32 | typedef ENetPeer& reference; 33 | typedef ENetPeer* pointer; 34 | typedef std::forward_iterator_tag iterator_category; 35 | typedef int difference_type; 36 | iterator(pointer ptr, pointer begin, int size, std::string serverID) : ptr_(ptr), serverID(std::move(serverID)) { begin_ = begin; size_ = size; } 37 | self_type operator++() { 38 | self_type i = *this; 39 | ptr_++; 40 | while (ptr_ < &begin_[size_] && ptr_->state != ENET_PEER_STATE_CONNECTED) 41 | ptr_++; 42 | return i; 43 | } 44 | self_type operator++(int junk) { 45 | ptr_++; 46 | while (ptr_ < &begin_[size_] && ptr_->state != ENET_PEER_STATE_CONNECTED) 47 | ptr_++; 48 | return *this; 49 | } 50 | Peer operator*() { Peer p(ptr_, serverID); return p; } 51 | Peer operator->() { Peer p(ptr_, serverID); return p; } 52 | bool operator==(const self_type& rhs) { return ptr_ == rhs.ptr_; } 53 | bool operator!=(const self_type& rhs) { return ptr_ != rhs.ptr_; } 54 | private: 55 | pointer ptr_; 56 | pointer begin_; 57 | int size_; 58 | std::string serverID = ""; 59 | }; 60 | public: 61 | iterator begin() const 62 | { 63 | int i = 0; 64 | while (true) 65 | { 66 | if (peersBegin[i].state != ENET_PEER_STATE_CONNECTED && ipeersBegin = peers; 85 | this->size = size; 86 | } 87 | 88 | PeersIterator() { 89 | this->peersBegin = 0; 90 | this->size = 0; 91 | } 92 | 93 | }; 94 | -------------------------------------------------------------------------------- /src/Events/EventsHandler.cpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #include "EventsHandler.h" 18 | 19 | EventRegistrator eventRegistrator; 20 | FuncitonRegistrator functionRegistrator; 21 | std::list pools; 22 | std::list> othersHandlerSyncer; 23 | 24 | void registerEventPools() { 25 | pools = std::list(); 26 | othersHandlerSyncer = std::list>(); 27 | } 28 | 29 | bool ModulesLoaderUtils::hasEnding(std::string const &fullString, std::string const &ending) { 30 | if (fullString.length() >= ending.length()) { 31 | return (0 == fullString.compare(fullString.length() - ending.length(), ending.length(), ending)); 32 | } else { 33 | return false; 34 | } 35 | } 36 | 37 | void moduleRegisterEvent(char* name, void* event) { 38 | std::string nameS = name; 39 | eventRegistrator.register_function(name, (EventHandler)event); 40 | } 41 | 42 | void moduleRegisterEventGuard(char* name, void* event) { 43 | std::string nameS = name; 44 | eventRegistrator.register_guard(name, (GuardHandler)event); 45 | } 46 | 47 | void moduleRegisterFunction(char* name, void* event) { 48 | std::string nameS = name; 49 | functionRegistrator.register_function(name, (FucntionHandler)event); 50 | } 51 | 52 | void module_create_event_self(void* ptr, char* name, uint8_t* data, long long int msTime) { 53 | EventsGlobalPool* pool = (EventsGlobalPool*)ptr; 54 | pool->create_event_self(name, data, msTime); 55 | } 56 | 57 | void module_create_event_global(void* ptr, char* name, uint8_t* data, long long int msTime) { 58 | EventsGlobalPool* pool = (EventsGlobalPool*)ptr; 59 | pool->create_event_global(name, data, msTime); 60 | } 61 | 62 | void module_create_event_self_and_global(void* ptr, char* name, uint8_t* data, long long int msTime) { 63 | EventsGlobalPool* pool = (EventsGlobalPool*)ptr; 64 | pool->create_event_self_and_global(name, data, msTime); 65 | } 66 | 67 | uint8_t* module_call_function(void* eventGeneratorPtr, char* name, uint8_t* data, char* serverName, void* serverPtr, uint8_t** memPtr) { 68 | return functionRegistrator.execute(name, data, serverName, serverPtr, eventGeneratorPtr, memPtr).getData(); 69 | } 70 | 71 | ModulesLoader modulesLoader; 72 | -------------------------------------------------------------------------------- /src/Packets/PacketsEncoder/VariantList/VariantList.cpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #include "VariantList.hpp" 18 | 19 | template 20 | void VariantList::appendValue(t val) { 21 | static_assert(sizeof(val) == exceptedSize, "Invalid VariantList data size (probably compiler issue)"); 22 | this->data.insert(this->data.end(), sizeof(val), 0); 23 | memcpy(this->data.data() + this->data.size() - sizeof(val), &val, sizeof(val)); 24 | } 25 | 26 | VariantList& VariantList::appendFloat(float val) { 27 | this->data.push_back(this->indexes); 28 | this->data.push_back(1); 29 | this->appendValue(val); 30 | this->indexes++; 31 | return *this; 32 | } 33 | 34 | VariantList& VariantList::appendFloat(float val, float val2) 35 | { 36 | this->data.push_back(this->indexes); 37 | this->data.push_back(3); 38 | this->appendValue(val); 39 | this->appendValue(val2); 40 | this->indexes++; 41 | return *this; 42 | } 43 | 44 | VariantList& VariantList::appendFloat(float val, float val2, float val3) 45 | { 46 | this->data.push_back(this->indexes); 47 | this->data.push_back(4); 48 | this->appendValue(val); 49 | this->appendValue(val2); 50 | this->appendValue(val3); 51 | this->indexes++; 52 | return *this; 53 | } 54 | 55 | VariantList& VariantList::appendInt(int val) 56 | { 57 | this->data.push_back(this->indexes); 58 | this->data.push_back(9); 59 | this->appendValue(val); 60 | this->indexes++; 61 | return *this; 62 | } 63 | 64 | VariantList& VariantList::appendIntx(int val) 65 | { 66 | this->data.push_back(this->indexes); 67 | this->data.push_back(5); 68 | this->appendValue(val); 69 | this->indexes++; 70 | return *this; 71 | } 72 | 73 | VariantList& VariantList::appendString(std::string str) 74 | { 75 | this->data.push_back(this->indexes); 76 | this->data.push_back(2); 77 | int sLen = str.length(); 78 | this->appendValue(sLen); 79 | for (int i = 0; i < sLen; i++) { 80 | this->data.push_back(str[i]); 81 | } 82 | this->indexes++; 83 | return *this; 84 | } 85 | 86 | std::vector VariantList::getData() { 87 | std::vector Tdata = this->data; 88 | Tdata.insert(Tdata.begin(), this->indexes); 89 | return Tdata; 90 | } 91 | 92 | VariantList::VariantList() { 93 | indexes = 0; 94 | } 95 | 96 | VariantList::VariantList(std::string packetName) { 97 | VariantList(); 98 | this->appendString(packetName); 99 | } 100 | 101 | VariantList::~VariantList() { 102 | 103 | } 104 | -------------------------------------------------------------------------------- /src/Packets/PacketsEncoder/PacketsEncoder.hpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | #include "../PacketsCommon/PacketsCommon.hpp" 20 | #include "VariantList/VariantList.hpp" 21 | 22 | #include "../../ENetWrapper/ENetServer.hpp" 23 | 24 | 25 | class Packet { 26 | public: 27 | virtual void send(Peer peer) { 28 | std::cout << "Please implement send method for Packet" << std::endl; 29 | } 30 | }; 31 | 32 | class TankPacket : public TankPacketStruct, public Packet { 33 | private: 34 | uint8_t* data = NULL; 35 | int dataLenght = 0; 36 | public: 37 | void setAdditionalData(uint8_t* data, int dataLenght) { 38 | this->data = data; 39 | this->dataLenght = dataLenght; 40 | 41 | } 42 | 43 | void send(Peer peer) override { 44 | if (data == NULL || dataLenght == 0) { 45 | TankPacketStruct data = *this; 46 | this->packetLenght = 0; 47 | peer.sendPacket(4, (char*)&data, sizeof(TankPacketStruct)); 48 | } else { 49 | int sizeOfDataToSend = sizeof(TankPacketStruct) + dataLenght; 50 | this->packetLenght = dataLenght; 51 | uint8_t* dataToSend = new uint8_t[sizeOfDataToSend]; 52 | TankPacketStruct dataStruct = *this; 53 | memcpy(dataToSend, &dataStruct, sizeof(TankPacketStruct)); 54 | memcpy(dataToSend + sizeof(TankPacketStruct), this->data, dataLenght); 55 | peer.sendPacket(4, (char*)dataToSend, sizeOfDataToSend); 56 | delete dataToSend; 57 | } 58 | } 59 | }; 60 | 61 | class VariantPacket : public VariantList, public TankPacket { 62 | private: 63 | void setAdditionalData(uint8_t* data, int dataLenght); 64 | public: 65 | VariantPacket() : VariantList() { 66 | packetType = 1; 67 | netID = -1; 68 | characterState = 8; 69 | } 70 | 71 | VariantPacket(std::string name, int netID = -1) : VariantList(name) { 72 | VariantPacket(); 73 | this->netID = netID; 74 | packetType = 1; 75 | characterState = 8; 76 | } 77 | 78 | void send(Peer peer) override { 79 | std::vector tempData = getData(); 80 | TankPacket::setAdditionalData(tempData.data(), tempData.size()); 81 | TankPacket::send(peer); 82 | } 83 | }; 84 | 85 | class TextPacket : public Packet { 86 | private: 87 | std::string data; 88 | public: 89 | TextPacket(std::string text = "") { 90 | this->data = text; 91 | } 92 | 93 | void setText(std::string text) { 94 | this->data = text; 95 | } 96 | 97 | void send(Peer peer) override { 98 | peer.sendPacket(3, (char*)data.c_str(), data.length()); 99 | } 100 | }; 101 | 102 | class LoginRequestPacket : public Packet { 103 | public: 104 | void send(Peer peer) override { 105 | peer.sendPacket(1, 0, 0); 106 | } 107 | }; 108 | -------------------------------------------------------------------------------- /src/ENetWrapper/Peer.cpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #include "Peer.hpp" 18 | 19 | std::string Peer::getIP() { 20 | if(this->peer==NULL) return ""; 21 | std::string ret; 22 | int ipint = this->peer->address.host; 23 | 24 | ret += std::to_string(ipint & 0xFF) + "."; 25 | ret += std::to_string((ipint >> 8) & 0xFF) + "."; 26 | ret += std::to_string((ipint >> 16) & 0xFF) + "."; 27 | ret += std::to_string((ipint >> 24) & 0xFF); 28 | 29 | return ret; 30 | } 31 | 32 | uint32_t Peer::getIPasInt() { 33 | if(this->peer==NULL) return 0; 34 | return this->peer->address.host; 35 | } 36 | 37 | uint32_t Peer::getPing() { // returns ping in miliseconds 38 | if(this->peer==NULL) return 0; 39 | return this->peer->roundTripTime; 40 | } 41 | 42 | std::string Peer::getUID() { 43 | if(this->peer==NULL) return 0; 44 | std::string ret; 45 | int serverIDSize = serverID.size(); 46 | ret.resize(serverIDSize + 8); 47 | unsigned int id = this->peer->connectID; 48 | static const char* digits = "0123456789ABCDEF"; 49 | for (unsigned int i=0; i>(i<<2)) & 0x0f]; 53 | return ret; 54 | } 55 | 56 | uint32_t Peer::getIncomingBandwidth() { 57 | if(this->peer==NULL) return 0; 58 | return this->peer->incomingBandwidth; 59 | } 60 | 61 | uint32_t Peer::getOutgoingBandwidth() { 62 | if(this->peer==NULL) return 0; 63 | return this->peer->outgoingBandwidth; 64 | } 65 | 66 | void Peer::requestDisconnect() { 67 | if(this->peer==NULL) return; 68 | enet_host_flush(peer->host); 69 | enet_peer_disconnect(this->peer, 0); 70 | } 71 | 72 | void Peer::sendPacket(int packetType, char* data, int dataLeght) { 73 | if(this->peer==NULL) return; 74 | int dataLength = dataLeght + ((data != NULL && dataLeght > 0 && data[0] == 4) ? 0 : 1); 75 | ENetPacket* packet = enet_packet_create(0, dataLength + 4, 1); 76 | *(int*)packet->data = packetType; 77 | if(data!=NULL) 78 | std::memcpy(packet->data + 4, data, dataLength); 79 | enet_peer_send(peer, 0, packet); 80 | } 81 | 82 | char* Peer::getData() { // TODO: change to uint8_t 83 | if(this->peer==NULL) return NULL; 84 | return (char*)this->peer->data; 85 | } 86 | 87 | void Peer::setData(char* data) { 88 | if(this->peer==NULL) return; 89 | this->peer->data = data; 90 | } 91 | 92 | bool Peer::exists() { 93 | if(this->peer) { 94 | return true; 95 | } else { 96 | return false; 97 | } 98 | } 99 | 100 | Peer::Peer(ENetPeer* peer, std::string serverID) { 101 | this->peer = peer; 102 | this->serverID = std::move(serverID); 103 | } 104 | 105 | Peer::Peer() { 106 | this->peer = NULL; 107 | } 108 | -------------------------------------------------------------------------------- /src/Packets/PacketsDecoder/PacketsDecoder.hpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | #include 20 | #include "../PacketsCommon/PacketsCommon.hpp" 21 | #include "../../ENetWrapper/Peer.hpp" 22 | 23 | class PacketDecoder { 24 | private: 25 | std::string dataToString(uint8_t* data, uint32_t dataLen) { 26 | std::string ret; 27 | ret.resize(dataLen-1); 28 | std::memcpy((void*)ret.data(), data, dataLen - 1); 29 | return ret; 30 | } 31 | 32 | uint8_t* dataToTankData(uint8_t* data, uint32_t len) { 33 | uint8_t* ret = NULL; 34 | if (len >= 56) 35 | { 36 | TankPacketStruct* tankData = (TankPacketStruct*)data; 37 | if (tankData->characterState & 8) 38 | { 39 | if (len < tankData->packetLenght + 56) 40 | { 41 | ret = 0; 42 | } 43 | } 44 | else { 45 | tankData->packetLenght = 0; 46 | } 47 | } 48 | return ret; 49 | } 50 | 51 | protected: 52 | virtual void OnPlayerActionPacket(Peer peer, std::string data); 53 | virtual void OnServerActionPacket(Peer peer, std::string data); 54 | virtual void OnTankPacket(Peer peer, TankPacketStruct data, uint8_t* additionalData, uint32_t additionalDataSize); 55 | virtual void OnUnknownPacket(Peer peer, int type); 56 | 57 | public: 58 | void decode(Peer peer, uint8_t* data, uint32_t length) { 59 | if (length < 5) throw; 60 | int packetType = *(int*)data; 61 | data += 4; 62 | length -= 4; 63 | switch (packetType) { 64 | case 2: 65 | { 66 | OnPlayerActionPacket(peer, dataToString(data, length)); 67 | break; 68 | } 69 | case 3: 70 | { 71 | OnServerActionPacket(peer, dataToString(data, length)); 72 | break; 73 | } 74 | case 4: 75 | { 76 | if (length < 56) throw; 77 | uint8_t* tankUpdatePacket = dataToTankData(data, length); 78 | TankPacketStruct tankData = *(TankPacketStruct*)data; 79 | if (tankUpdatePacket) { 80 | 81 | uint8_t* dataPtr; 82 | if (length > sizeof(TankPacketStruct)) { 83 | dataPtr = tankUpdatePacket + sizeof(TankPacketStruct); 84 | } else { 85 | dataPtr = NULL; 86 | } 87 | OnTankPacket(peer, tankData, dataPtr, length - sizeof(TankPacketStruct)); 88 | } else { 89 | OnTankPacket(peer, tankData, 0, 0); 90 | } 91 | break; 92 | } 93 | /*case 5: 94 | { 95 | 96 | break; 97 | } 98 | case 6: 99 | { 100 | std::cout << "Got packet type 6 with content: " << PacketHandler::GetTextPointerFromPacket(packet)) << std::endl; 101 | break; 102 | }*/ 103 | default: 104 | { 105 | OnUnknownPacket(peer, packetType); 106 | break; 107 | } 108 | } 109 | } 110 | }; 111 | 112 | inline void PacketDecoder::OnPlayerActionPacket(Peer peer, std::string data) 113 | { 114 | std::cout << "OnPlayerActionPacket is not set! forgot to override?" << std::endl; 115 | } 116 | 117 | inline void PacketDecoder::OnServerActionPacket(Peer peer, std::string data) 118 | { 119 | std::cout << "OnServerActionPacket is not set! forgot to override?" << std::endl; 120 | } 121 | 122 | inline void PacketDecoder::OnTankPacket(Peer peer, TankPacketStruct data, uint8_t* additionalData, 123 | uint32_t additionalDataSize) 124 | { 125 | std::cout << "OnTankPacket is not set! forgot to override?" << std::endl; 126 | } 127 | 128 | inline void PacketDecoder::OnUnknownPacket(Peer peer, int type) 129 | { 130 | std::cout << "OnUnknownPacket is not set! forgot to override?" << std::endl; 131 | } 132 | -------------------------------------------------------------------------------- /src/Events/Event.cpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #include "Event.h" 18 | 19 | 20 | void EventPackData::operator=(int arg) { 21 | int sizePos = push_header(EventPackDataType::INTEGER_T); 22 | this->push_back(arg); 23 | add_data_size(sizePos, sizeof(int)); 24 | } 25 | 26 | void EventPackData::operator=(std::vector arg) { 27 | int sizePos = push_header(EventPackDataType::VECTOR_INTEGER_T); 28 | for(int val: arg) { 29 | this->push_back(val); 30 | } 31 | add_data_size(sizePos, sizeof(int)*arg.size()); 32 | } 33 | 34 | 35 | void EventPackData::operator=(long long int arg) { 36 | int sizePos = push_header(EventPackDataType::LONG_INTEGER_T); 37 | this->push_back(arg); 38 | add_data_size(sizePos, sizeof(long long int)); 39 | } 40 | 41 | void EventPackData::operator=(std::vector arg) { 42 | int sizePos = push_header(EventPackDataType::VECTOR_LONG_INTEGER_T); 43 | for(long long int val: arg) { 44 | this->push_back(val); 45 | } 46 | add_data_size(sizePos, sizeof(long long int)*arg.size()); 47 | } 48 | 49 | void EventPackData::operator=(float arg) { 50 | int sizePos = push_header(EventPackDataType::FLOAT_T); 51 | this->push_back(arg); 52 | add_data_size(sizePos, sizeof(int)); 53 | } 54 | 55 | void EventPackData::operator=(std::vector arg) { 56 | int sizePos = push_header(EventPackDataType::VECTOR_FLOAT_T); 57 | for(int val: arg) { 58 | this->push_back(val); 59 | } 60 | add_data_size(sizePos, sizeof(int)*arg.size()); 61 | } 62 | 63 | void EventPackData::operator=(std::string arg) { 64 | int sizePos = push_header(EventPackDataType::STRING_T); 65 | this->push_back(arg.c_str(), arg.length()); 66 | add_data_size(sizePos, arg.length()); 67 | } 68 | 69 | void EventPackData::operator=(std::vector arg) { 70 | int sizePos = push_header(EventPackDataType::VECTOR_STRING_T); 71 | int length_final = 0; 72 | for(std::string val: arg) { 73 | int len = val.length(); 74 | this->push_back(len); 75 | this->push_back(val.c_str(), len); 76 | length_final += len + sizeof(int); 77 | } 78 | add_data_size(sizePos, length_final); 79 | } 80 | 81 | void EventPackData::operator=(EventPack arg) { 82 | int sizePos = push_header(EventPackDataType::EVENT_PACK_T); 83 | int dataSize; 84 | uint8_t *data = arg.serialize(&dataSize); 85 | this->push_back(data, dataSize); 86 | add_data_size(sizePos, dataSize); 87 | } 88 | 89 | void EventPackData::operator=(std::vector arg) { 90 | int sizePos = push_header(EventPackDataType::VECTOR_EVENT_PACK_T); 91 | int length_final = 0; 92 | for(EventPack& pack: arg) { 93 | int dataSize; 94 | uint8_t *data = pack.serialize(&dataSize); 95 | this->push_back(dataSize); 96 | this->push_back(data, dataSize); 97 | length_final += dataSize + sizeof(int); 98 | } 99 | add_data_size(sizePos, length_final); 100 | } 101 | 102 | void EventPackData::operator=(EventUnpack arg) { 103 | int sizePos = push_header(EventPackDataType::EVENT_PACK_T); 104 | int dataSize; 105 | if(arg.getData() == NULL) { 106 | dataSize = 0; 107 | } else { 108 | dataSize = *(int*)arg.getData(); 109 | } 110 | uint8_t *data = arg.getData(); 111 | this->push_back(data, dataSize+sizeof(int)); 112 | add_data_size(sizePos, dataSize+sizeof(int)); 113 | } 114 | 115 | void EventUnpackRequest::resolve_value(uint8_t* ptr, EventUnpack& ret) { 116 | if(*(short*)ptr!=EventPackDataType::EVENT_PACK_T) throw; 117 | ptr+=sizeof(short); 118 | if(*(int*)ptr == 0) { 119 | ret = EventUnpack(NULL); 120 | } else { 121 | ptr+=sizeof(int); 122 | ret = EventUnpack(ptr); 123 | } 124 | } 125 | 126 | void EventUnpackRequest::resolve_value(uint8_t* ptr, std::vector& ret) { 127 | if(*(short*)ptr!=EventPackDataType::VECTOR_EVENT_PACK_T) throw; 128 | ptr+=sizeof(short); 129 | int size=*(int*)ptr; 130 | ptr+=sizeof(int); 131 | for(int i=0; i. 14 | **********************************************************************************/ 15 | 16 | 17 | #include "ENetServer.hpp" 18 | 19 | short ENetServer::id_generator = 0; 20 | 21 | void ENet_Init() { 22 | if (enet_initialize() != 0) 23 | { 24 | throw; 25 | } 26 | atexit(enet_deinitialize); 27 | } 28 | 29 | std::thread& ENetServer::getThread() { 30 | return this->t; 31 | } 32 | 33 | void ENetServer::run() { 34 | ENetEvent event; 35 | /* Wait up to 1000 milliseconds for an event. */ 36 | while (true) { 37 | while (enet_host_service(server, &event, 10) > 0) { 38 | Peer peer(event.peer, id); 39 | switch (event.type) { 40 | case ENET_EVENT_TYPE_CONNECT: 41 | event.peer->data = NULL; 42 | /* Store any relevant client information here. */ 43 | OnConnect(peer); 44 | break; 45 | case ENET_EVENT_TYPE_RECEIVE: 46 | OnRecievedPacket(peer, event.packet->data, event.packet->dataLength); 47 | /* Clean up the packet now that we're done using it. */ 48 | enet_packet_destroy(event.packet); 49 | break; 50 | 51 | case ENET_EVENT_TYPE_DISCONNECT: 52 | OnDisconnect(peer); 53 | /* Reset the peer's client information. */ 54 | if((char *)event.peer->data != NULL) { 55 | delete (char *)event.peer->data; 56 | event.peer->data = NULL; 57 | } 58 | } 59 | } 60 | OnPeriodicEvent(); 61 | } 62 | } 63 | 64 | void ENetServer::init(int port, int maxPeers) { 65 | if (this->server != NULL) throw; 66 | ENetAddress address; 67 | 68 | address.host = ENET_HOST_ANY; 69 | address.port = port; 70 | server = enet_host_create(&address /* the address to bind the server host to */, 71 | maxPeers /* allow up to maxPeers clients and/or outgoing connections */, 72 | 2 /* allow up to 2 channels to be used, 0 and 1 */, 73 | 0 /* assume any amount of incoming bandwidth */, 74 | 0 /* assume any amount of outgoing bandwidth */); 75 | if (server == NULL) 76 | { 77 | throw; 78 | } 79 | server->checksum = enet_crc32; 80 | enet_host_compress_with_range_coder(server); 81 | } 82 | 83 | void ENetServer::execute() { 84 | std::thread t(&ENetServer::run, this); 85 | this->t = move(t); 86 | } 87 | 88 | ENetServer::ENetServer() { 89 | this->server = NULL; 90 | auto id_tpm = id_generator++; 91 | int str_len = sizeof(id_generator)*2; 92 | id.resize(str_len); 93 | static const char* digits = "0123456789ABCDEF"; 94 | for (unsigned int i=0; i>(i<<2)) & 0x0f]; 96 | } 97 | 98 | ENetServer::ENetServer(int port, int maxPeers) : ENetServer() { 99 | init(port, maxPeers); 100 | } 101 | 102 | ENetServer::~ENetServer() { 103 | enet_host_destroy(server); 104 | } 105 | 106 | void ENetServer::OnConnect(Peer peer) 107 | { 108 | std::cout << "OnConnect is not set! forgot to override?" << std::endl; 109 | } 110 | 111 | void ENetServer::OnRecievedPacket(Peer peer, uint8_t* data, uint32_t dataLen) 112 | { 113 | std::cout << "OnRecievedPacket is not set! forgot to override?" << std::endl; 114 | } 115 | 116 | void ENetServer::OnDisconnect(Peer peer) 117 | { 118 | std::cout << "OnDisconnect is not set! forgot to override?" << std::endl; 119 | } 120 | 121 | void ENetServer::OnPeriodicEvent() { 122 | std::cout << "OnPeriodicEvent is not set! forgot to override?" << std::endl; 123 | } 124 | 125 | 126 | PeersIterator ENetServer::getPeers() { 127 | PeersIterator it(this->server->peers, this->server->peerCount, id); 128 | return it; 129 | } 130 | 131 | Peer ENetServer::getPeer(std::string peerID) { 132 | for(int i=0; iserver->peerCount; i++) { 133 | if(this->server->peers[i].state == ENET_PEER_STATE_CONNECTED) { 134 | if(peerID == Peer(&this->server->peers[i], id).getUID()) { 135 | return Peer(&this->server->peers[i], id); 136 | } 137 | } 138 | } 139 | return Peer(NULL, ""); 140 | } 141 | 142 | void* ENetServer::getServerPtr() { 143 | return (void*)server; 144 | } 145 | 146 | std::string ENetServer::getServerID() { 147 | return id; 148 | } 149 | 150 | void ENetServer::setServerData(uint8_t* data) { 151 | server->data = (void*) data; 152 | } 153 | uint8_t* ENetServer::getServerData() { 154 | return (uint8_t*)server->data; 155 | } 156 | -------------------------------------------------------------------------------- /src/Server.cpp: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #include "Server.hpp" 18 | 19 | EVENT(SendLoginRequestPacket) { 20 | try { 21 | LoginRequestPacket p; 22 | auto peer = pack["peer"]; 23 | if(peer.getType() == EventPackDataType::STRING_T) { 24 | p.send(server.getPeer(peer)); 25 | } else { 26 | std::vector peers = peer; 27 | for(auto x: peers) { 28 | p.send(server.getPeer(x)); 29 | } 30 | } 31 | } catch(...) { 32 | std::cout << "Missing peer for LoginReuqestPacket" << std::endl; 33 | } 34 | } 35 | 36 | EVENT(SendTankPacket) { 37 | std::string data; 38 | try { 39 | TankPacket p; 40 | try { 41 | p.packetType = (int)pack["packetType"]; 42 | } catch(...) {} 43 | try { 44 | p.netID = (int)pack["netID"]; 45 | } catch(...) {} 46 | try { 47 | p.padding1 = pack["padding1"]; 48 | } catch(...) {} 49 | try { 50 | p.characterState = (int)pack["characterState"]; 51 | } catch(...) {} 52 | try { 53 | p.padding2 = pack["padding2"]; 54 | } catch(...) {} 55 | try { 56 | p.plantingTree = (int)pack["plantingTree"]; 57 | } catch(...) {} 58 | try { 59 | p.x = (float)pack["x"]; 60 | } catch(...) {} 61 | try { 62 | p.y = (float)pack["y"]; 63 | } catch(...) {} 64 | try { 65 | p.XSpeed = (float)pack["XSpeed"]; 66 | } catch(...) {} 67 | try { 68 | p.YSpeed = (float)pack["YSpeed"]; 69 | } catch(...) {} 70 | try { 71 | p.padding3 = pack["padding3"]; 72 | } catch(...) {} 73 | try { 74 | p.punchX = (int)pack["punchX"]; 75 | } catch(...) {} 76 | try { 77 | p.punchY = (int)pack["punchY"]; 78 | } catch(...) {} 79 | try { 80 | std::string data_tmp = pack["data"]; 81 | data = std::move(data_tmp); 82 | p.setAdditionalData((uint8_t*)data.c_str(), data.length()); 83 | } catch(...) {} 84 | auto peer = pack["peer"]; 85 | if(peer.getType() == EventPackDataType::STRING_T) { 86 | p.send(server.getPeer(peer)); 87 | } else { 88 | std::vector peers = peer; 89 | for(auto x: peers) { 90 | p.send(server.getPeer(x)); 91 | } 92 | } 93 | } catch(...) { 94 | std::cout << "Missing peer for TankPacket" << std::endl; 95 | } 96 | } 97 | 98 | EVENT(SendVariantPacket) { 99 | try { 100 | VariantPacket p; 101 | std::string packetName = pack["name"]; 102 | p.appendString(packetName); 103 | try { 104 | for(int i=1; ; i++) { 105 | EventUnpackRequest item = pack[std::to_string(i)]; 106 | switch(item.getType()) { 107 | case INTEGER_T: { 108 | p.appendIntx(item); 109 | break; 110 | } 111 | case FLOAT_T: { 112 | p.appendFloat(item); 113 | break; 114 | } 115 | case VECTOR_FLOAT_T: { 116 | std::vector val = item; 117 | switch(val.size()) { 118 | case 1: { 119 | p.appendFloat(val[0]); 120 | break; 121 | } 122 | case 2: { 123 | p.appendFloat(val[0], val[1]); 124 | break; 125 | } 126 | case 3: { 127 | p.appendFloat(val[0], val[1], val[2]); 128 | break; 129 | } 130 | default: { 131 | std::cout << "Unsupported float vector size for VariantList " << packetName << "!" << std::endl; 132 | } 133 | } 134 | break; 135 | } 136 | case STRING_T: { 137 | p.appendString(item); 138 | break; 139 | } 140 | default: { 141 | std::cout << "Unsupported VarianList type for " << packetName << "!" << std::endl; 142 | break; 143 | } 144 | } 145 | } 146 | } catch(...) { 147 | 148 | } 149 | auto peer = pack["peer"]; 150 | if(peer.getType() == EventPackDataType::STRING_T) { 151 | p.send(server.getPeer(pack["peer"])); 152 | } else { 153 | std::vector peers = peer; 154 | for(auto x: peers) { 155 | p.send(server.getPeer(x)); 156 | } 157 | } 158 | } catch(...) { 159 | std::cout << "Missing peer or packet name for VariantPacket" << std::endl; 160 | } 161 | } 162 | 163 | EVENT(SendDisconnect) { 164 | try { 165 | auto peer = pack["peer"]; 166 | if(peer.getType() == EventPackDataType::STRING_T) { 167 | server.getPeer(peer).requestDisconnect(); 168 | } else { 169 | std::vector peers = peer; 170 | for(auto x: peers) { 171 | server.getPeer(x).requestDisconnect(); 172 | } 173 | } 174 | } catch(...) { 175 | std::cout << "Missing peer for SendDisconnect" << std::endl; 176 | } 177 | } 178 | 179 | void registerServerEvents() { 180 | eventRegistrator.register_function("SendLoginRequestPacket", SendLoginRequestPacket); 181 | eventRegistrator.register_function("SendTankPacket", SendTankPacket); 182 | eventRegistrator.register_function("SendVariantPacket", SendVariantPacket); 183 | eventRegistrator.register_function("SendDisconnect", SendDisconnect); 184 | } 185 | 186 | void Server::OnConnect(Peer peer) { 187 | uint8_t* tmp = *events.currentDataPtr; 188 | std::string id = peer.getUID(); 189 | { 190 | EventPack pack(_X_); 191 | pack["peer"] = peer.getUID(); 192 | events.create_event_self("__MallocPeer", pack); 193 | } 194 | { 195 | EventPack pack(_X_); 196 | pack["peer"] = peer.getUID(); 197 | events.create_event_self("OnPlayerConnect", pack); 198 | } 199 | *events.currentDataPtr = tmp; 200 | } 201 | 202 | void Server::OnPlayerActionPacket(Peer peer, std::string data) { 203 | EventPack pack(_X_); 204 | pack["peer"] = peer.getUID(); 205 | pack["data"] = data; 206 | events.create_event_self("OnPlayerActionPacket", pack); 207 | } 208 | 209 | void Server::OnServerActionPacket(Peer peer, std::string data) { 210 | EventPack pack(_X_); 211 | pack["peer"] = peer.getUID(); 212 | pack["data"] = data; 213 | events.create_event_self("OnServerActionPacket", pack); 214 | } 215 | 216 | void Server::OnTankPacket(Peer peer, TankPacketStruct data, uint8_t* additionalData, uint32_t additionalDataSize) { 217 | { 218 | EventPack pack(_X_); 219 | pack["peer"] = peer.getUID(); 220 | pack["packetType"] = (int)data.packetType; 221 | pack["netID"] = (int)data.netID; 222 | pack["plantingTree"] = (int)data.plantingTree; 223 | pack["characterState"] = (int)data.characterState; 224 | pack["x"] = (float)data.x; 225 | pack["y"] = (float)data.y; 226 | pack["xSpeed"] = (float)data.XSpeed; 227 | pack["ySpeed"] = (float)data.YSpeed; 228 | pack["punchX"] = (int)data.punchX; 229 | pack["punchY"] = (int)data.punchY; 230 | std::string data; 231 | data.resize(additionalDataSize); 232 | memcpy((void*)data.c_str(), (void*)additionalData, additionalDataSize); 233 | pack["data"] = data; 234 | events.create_event_self("OnTankPacket", pack); 235 | } 236 | } 237 | 238 | void Server::OnUnknownPacket(Peer peer, int type) { 239 | EventPack pack(_X_); 240 | pack["text"] = "Please implement packet type: " + std::to_string(type); 241 | events.create_event_self("ConsoleLog", pack); 242 | } 243 | 244 | void Server::OnRecievedPacket(Peer peer, uint8_t* data, uint32_t dataLen) { 245 | uint8_t* tmp = *events.currentDataPtr; 246 | decode(peer, data, dataLen); 247 | *events.currentDataPtr = tmp; 248 | } 249 | 250 | void Server::OnDisconnect(Peer peer) { 251 | uint8_t* tmp = *events.currentDataPtr; 252 | EventPack pack(_X_); 253 | pack["peer"] = peer.getUID(); 254 | events.create_event_self("OnPlayerDisconnect", pack); 255 | *events.currentDataPtr = tmp; 256 | } 257 | 258 | void Server::OnPeriodicEvent() { 259 | events.execute(*this); 260 | } 261 | -------------------------------------------------------------------------------- /src/Events/EventsHandler.h: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #ifndef __EVENTS_HANDLER_H__ 18 | #define __EVENTS_HANDLER_H__ 19 | 20 | #include "Event.h" 21 | #include 22 | #include 23 | #include 24 | #include "../ENetWrapper/ENetServer.hpp" 25 | 26 | struct EventRunnableStuff { 27 | std::vector events; 28 | std::vector guards; 29 | }; 30 | 31 | class EventRegistrator { 32 | private: 33 | std::unordered_map map; 34 | public: 35 | void register_function(const std::string& key, EventHandler handler) { 36 | if(map.find(key) == map.end()) { // key not found 37 | EventRunnableStuff x; 38 | x.events.push_back(handler); 39 | map.insert({key, x}); 40 | } else { // key found 41 | map.find(key)->second.events.push_back(handler); 42 | } 43 | } 44 | 45 | void register_guard(const std::string& key, GuardHandler handler) { 46 | auto item = map.find(key); 47 | if(item == map.end()) { // key not found 48 | EventRunnableStuff x; 49 | x.guards.push_back(handler); 50 | map.insert({key, x}); 51 | } else { // key found 52 | item->second.guards.push_back(handler); 53 | } 54 | } 55 | 56 | inline int serverIDtoInt(const char* name) { 57 | int ret = 0; 58 | uint32_t inc = 0; 59 | while(*name) { 60 | uint8_t retTmp = *(name++); 61 | if(retTmp>'9') { 62 | ret += ((uint32_t)(retTmp-'A'))<second.guards) { 80 | try { 81 | bool x = (*handler)(pack.getData(), (char*)server.getServerID().c_str(), serverPtr, pool_ptr, currentDataPtr); 82 | if(!x) { 83 | canBeLaunched = false; 84 | } 85 | } catch(...) { 86 | std::cout << "Uncought exception in event-guard " << handlers->first << std::endl; 87 | } 88 | } 89 | if(handlersAny != map.end() && !handlersAny->second.guards.empty()) { 90 | EventPack anyPack(currentDataPtr); 91 | anyPack["name"] = key; 92 | anyPack["data"] = (EventUnpack)pack; 93 | EventUnpack anyUnpack(anyPack.serialize()); 94 | for(GuardHandler handler: handlersAny->second.guards) { 95 | try { 96 | bool x = (*handler)(anyUnpack.getData(), (char*)server.getServerID().c_str(), serverPtr, pool_ptr, currentDataPtr); 97 | if(!x) { 98 | canBeLaunched = false; 99 | } 100 | } catch(...) { 101 | std::cout << "Uncought exception in event-guard " << handlersAny->first << std::endl; 102 | } 103 | } 104 | } 105 | *currentDataPtr = tmp; 106 | if(canBeLaunched) { 107 | if(handlers != map.end()) 108 | for (EventHandler handler: handlers->second.events) { 109 | try { 110 | (*handler)(pack.getData(), (char*)server.getServerID().c_str(), serverPtr, pool_ptr, currentDataPtr); 111 | } catch (...) { 112 | std::cout << "Uncought exception in event " << handlers->first << std::endl; 113 | } 114 | } 115 | if(handlersAny != map.end() && !handlersAny->second.events.empty()) { 116 | EventPack anyPack(currentDataPtr); 117 | anyPack["name"] = key; 118 | anyPack["data"] = (EventUnpack)pack; 119 | EventUnpack anyUnpack(anyPack.serialize()); 120 | for (EventHandler handler: handlersAny->second.events) { 121 | try { 122 | (*handler)(anyUnpack.getData(), (char*)server.getServerID().c_str(), serverPtr, pool_ptr, currentDataPtr); 123 | } catch (...) { 124 | std::cout << "Uncought exception in event " << handlersAny->first << std::endl; 125 | } 126 | } 127 | } 128 | } 129 | *currentDataPtr = tmp; 130 | } 131 | }; 132 | 133 | class FuncitonRegistrator { 134 | private: 135 | std::unordered_map> map; 136 | public: 137 | void register_function(std::string key, FucntionHandler handler) { 138 | if(map.find(key) == map.end()) { // key not found 139 | std::vector vec; 140 | vec.push_back(handler); 141 | map.insert({key, vec}); 142 | } else { // key found 143 | map.find(key)->second.push_back(handler); 144 | } 145 | } 146 | 147 | EventUnpack execute(const std::string& key, uint8_t* pack, char* serverName, void* serverPtr, void* pool_ptr, uint8_t** currentDataPtr) { 148 | uint8_t* ret; 149 | auto mapFuncs = map.find(key); 150 | auto anyFuncs = map.find("*"); 151 | if(mapFuncs == map.end() && anyFuncs == map.end()) return EventUnpack(NULL); 152 | if(mapFuncs != map.end()) 153 | for(FucntionHandler handler: mapFuncs->second) { 154 | ret = (*handler)(pack, serverName, serverPtr, pool_ptr, currentDataPtr); 155 | if(!EventUnpack(ret).isEmpty()) return EventUnpack(ret); 156 | } 157 | if(anyFuncs != map.end()) { 158 | EventPack anyPack(currentDataPtr); 159 | anyPack["name"] = key; 160 | anyPack["data"] = (EventUnpack) pack; 161 | EventUnpack anyUnpack(anyPack.serialize()); 162 | for (FucntionHandler handler: anyFuncs->second) { 163 | ret = (*handler)(anyUnpack.getData(), serverName, serverPtr, pool_ptr, currentDataPtr); 164 | if (!EventUnpack(ret).isEmpty()) return EventUnpack(ret); 165 | } 166 | } 167 | return EventUnpack(ret); 168 | } 169 | 170 | EventUnpack execute(const std::string& key, EventUnpack pack, ENetServer& server, void* pool_ptr, uint8_t** currentDataPtr) { 171 | uint8_t* ret; 172 | auto mapFuncs = map.find(key); 173 | if(mapFuncs == map.end()) return EventUnpack(NULL); 174 | for(FucntionHandler handler: mapFuncs->second) { 175 | ret = (*handler)(pack.getData(), (char *) server.getServerID().c_str(), server.getServerPtr(), pool_ptr, currentDataPtr); 176 | if(!EventUnpack(ret).isEmpty()) return EventUnpack(ret); 177 | } 178 | return EventUnpack(ret); 179 | } 180 | }; 181 | 182 | extern EventRegistrator eventRegistrator; 183 | extern FuncitonRegistrator functionRegistrator; 184 | 185 | struct Event { 186 | std::string name; 187 | EventUnpack data; 188 | long long int time = 0; 189 | public: 190 | Event(std::string name, EventUnpack data) : name(std::move(name)), data(data) {}; 191 | }; 192 | 193 | class EventsHandler { 194 | std::list& events; 195 | public: 196 | void create_event(std::string name, EventUnpack data, long long int msTime=0) { 197 | void* data_copy; 198 | if(data.isEmpty()) { 199 | data_copy = malloc(4); 200 | *(int*)data_copy = 0; 201 | } else { 202 | int size = (*(int*)data.getData()) + 4; 203 | data_copy = malloc(size); 204 | memcpy(data_copy, data.getData(), size); 205 | } 206 | Event event(std::move(name), (uint8_t*)data_copy); 207 | if(msTime!=0) { 208 | event.time = std::chrono::duration_cast( 209 | std::chrono::system_clock::now().time_since_epoch()).count() + msTime; 210 | } else { 211 | event.time = 0; 212 | } 213 | events.push_back(event); 214 | } 215 | 216 | bool operator==(std::list& x) { 217 | return addressof(x) == addressof(events); 218 | } 219 | 220 | explicit EventsHandler(std::list &events) : events(events) {} 221 | }; 222 | 223 | class EventsHandlerPool { 224 | std::list> pool; 225 | public: 226 | void execute(ENetServer& server, void* pool_ptr, uint8_t** currentDataPtr) { 227 | for(std::list& events: pool) { 228 | long long int time = std::chrono::duration_cast( 229 | std::chrono::system_clock::now().time_since_epoch()).count(); 230 | auto i = events.begin(); 231 | while (i != events.end()) { 232 | if (i->time == 0 || i->time <= time) { 233 | eventRegistrator.execute(i->name, i->data, server, pool_ptr, currentDataPtr); 234 | free(i->data.getData()); 235 | events.erase(i++); 236 | } else { 237 | ++i; 238 | } 239 | } 240 | } 241 | } 242 | 243 | EventsHandler requestHandler() { 244 | std::list v; 245 | pool.push_back(v); 246 | EventsHandler e(pool.back()); 247 | return e; 248 | } 249 | 250 | bool isChild(EventsHandler x) { 251 | for(std::list& y: pool) { 252 | if (x==y) return true; 253 | } 254 | return false; 255 | } 256 | }; 257 | 258 | extern std::list pools; 259 | extern std::list> othersHandlerSyncer; 260 | 261 | void registerEventPools(); 262 | 263 | class EventsGlobalPool { 264 | private: 265 | EventsHandlerPool& pool; 266 | EventsHandler selfHandler; 267 | std::vector& othersHandler; 268 | uint8_t* temporaryData; 269 | 270 | static EventsHandlerPool& generateSelfHandler() { 271 | pools.emplace_back(EventsHandlerPool()); 272 | return pools.back(); 273 | } 274 | 275 | static std::vector& generateOthersHandlerSyncer() { 276 | othersHandlerSyncer.emplace_back(std::vector()); 277 | return othersHandlerSyncer.back(); 278 | } 279 | 280 | public: 281 | uint8_t** currentDataPtr; 282 | void create_event_self(const std::string& name, EventUnpack data, long long int msTime=0) { 283 | selfHandler.create_event(std::move(name), data, msTime); 284 | } 285 | 286 | void create_event_global(const std::string& name, const EventUnpack& data, long long int msTime=0) { 287 | for(EventsHandler handler: othersHandler) { 288 | handler.create_event(name, data, msTime); 289 | } 290 | } 291 | 292 | void create_event_self_and_global(const std::string& name, const EventUnpack& data, long long int msTime=0) { 293 | create_event_self(name, data, msTime); 294 | create_event_global(name, data, msTime); 295 | } 296 | 297 | EventUnpack call_function(const std::string& key, EventUnpack pack, ENetServer& server) { 298 | return functionRegistrator.execute(key, pack, server, (void*)this, currentDataPtr); 299 | } 300 | 301 | void execute(ENetServer& server) { 302 | pool.execute(server, (void*)this, currentDataPtr); 303 | } 304 | 305 | EventsGlobalPool() : pool(generateSelfHandler()), selfHandler(pool.requestHandler()), othersHandler(generateOthersHandlerSyncer()) { 306 | for(EventsHandlerPool& p: pools) { 307 | if(!p.isChild(selfHandler)) { 308 | othersHandler.emplace_back(p.requestHandler()); 309 | } 310 | } 311 | for(std::vector& x: othersHandlerSyncer) { 312 | if(addressof(x)!=addressof(othersHandler)) { 313 | x.emplace_back(pool.requestHandler()); 314 | } 315 | } 316 | temporaryData = new uint8_t[16000000]; 317 | currentDataPtr = new uint8_t*; 318 | *currentDataPtr = temporaryData; 319 | } 320 | }; 321 | 322 | #include 323 | 324 | 325 | namespace ModulesLoaderUtils { 326 | bool hasEnding(std::string const &fullString, std::string const &ending); 327 | } 328 | 329 | #define MODULE_API_VERSION 1 330 | 331 | void moduleRegisterEvent(char* name, void* event); 332 | void moduleRegisterEventGuard(char* name, void* event); 333 | void moduleRegisterFunction(char* name, void* event); 334 | 335 | void module_create_event_self(void* ptr, char* name, uint8_t* data, long long int msTime); 336 | void module_create_event_global(void* ptr, char* name, uint8_t* data, long long int msTime); 337 | void module_create_event_self_and_global(void* ptr, char* name, uint8_t* data, long long int msTime); 338 | uint8_t* module_call_function(void* eventGeneratorPtr, char* name, uint8_t* data, char* serverName, void* serverPtr, uint8_t** memPtr); 339 | 340 | #ifdef _WIN32 341 | #include 342 | #else 343 | #include 344 | #include 345 | #endif 346 | 347 | class ModulesLoader { 348 | public: 349 | void execute() { 350 | #ifdef _WIN32 351 | HANDLE hFind; 352 | WIN32_FIND_DATA data; 353 | 354 | hFind = FindFirstFile("./modules/*", &data); 355 | if (hFind != INVALID_HANDLE_VALUE) { 356 | do { 357 | if (ModulesLoaderUtils::hasEnding(data.cFileName, ".dll")) { 358 | std::string totalPath = "./modules/"; 359 | totalPath += data.cFileName; 360 | HINSTANCE handle = LoadLibrary(totalPath.c_str()); 361 | if(handle == NULL) { 362 | std::cout << "DLL open error: " << GetLastError() << std::endl; 363 | continue; 364 | } 365 | int (*moduleVerFunction)() = (int (*)()) GetProcAddress(handle, "ModuleGetVersion"); 366 | if (moduleVerFunction == NULL) { 367 | std::cout << "Dynamic library " << data.cFileName << " isn't valid server module!" << std::endl; 368 | continue; 369 | } 370 | int moduleVer = moduleVerFunction(); 371 | if (moduleVer == MODULE_API_VERSION) { 372 | std::cout << "Loading module " << data.cFileName << "..." << std::endl; 373 | ((void (*)(void *, void *, void *, void *, void *, void*, void*)) GetProcAddress(handle, "ModuleExecuteSetup"))((void*)moduleRegisterEvent, (void*)moduleRegisterEventGuard, (void*)moduleRegisterFunction, (void*)module_create_event_self, (void*)module_create_event_global, (void*)module_create_event_self_and_global, (void*)module_call_function); 374 | } else { 375 | std::cout << "Module " << data.cFileName << " (" << moduleVer <<") have different API version than server (" << MODULE_API_VERSION << ")." << std::endl; 376 | } 377 | } 378 | } while (FindNextFile(hFind, &data)); 379 | FindClose(hFind); 380 | std::cout << "All modules were loaded!" << std::endl; 381 | } else { 382 | std::cout << "Error opening ./modules/ directory" << std::endl; 383 | } 384 | #else 385 | DIR *dir; 386 | struct dirent *ent; 387 | if ((dir = opendir("./modules/")) != NULL) { 388 | /* print all the files and directories within directory */ 389 | while ((ent = readdir(dir)) != NULL) { 390 | if (ModulesLoaderUtils::hasEnding(ent->d_name, ".so")) { 391 | std::string totalPath = "./modules/"; 392 | totalPath += ent->d_name; 393 | void *handle = dlopen(totalPath.c_str(), RTLD_LAZY); 394 | if(handle == NULL) { 395 | std::cout << dlerror() << std::endl; 396 | continue; 397 | } 398 | int (*moduleVerFunction)() = (int (*)()) dlsym(handle, "ModuleGetVersion"); 399 | if (moduleVerFunction == NULL) { 400 | std::cout << "Dynamic library " << ent->d_name << " isn't valid server module!" << std::endl; 401 | continue; 402 | } 403 | int moduleVer = moduleVerFunction(); 404 | if (moduleVer == MODULE_API_VERSION) { 405 | std::cout << "Loading module " << ent->d_name << "..." << std::endl; 406 | ((void (*)(void *, void *, void *, void *, void *, void*, void*)) dlsym(handle, "ModuleExecuteSetup"))((void*)moduleRegisterEvent, (void*)moduleRegisterEventGuard, (void*)moduleRegisterFunction, (void*)module_create_event_self, (void*)module_create_event_global, (void*)module_create_event_self_and_global, (void*)module_call_function); 407 | } else { 408 | std::cout << "Module " << ent->d_name << " (" << moduleVer <<") have different API version than server (" << MODULE_API_VERSION << ")." << std::endl; 409 | } 410 | 411 | } 412 | } 413 | closedir(dir); 414 | std::cout << "All modules were loaded!" << std::endl; 415 | } else { 416 | std::cout << "Error opening ./modules/ directory" << std::endl; 417 | } 418 | #endif 419 | } 420 | }; 421 | 422 | extern ModulesLoader modulesLoader; 423 | #endif 424 | -------------------------------------------------------------------------------- /src/Events/Event.h: -------------------------------------------------------------------------------- 1 | /********************************************************************************** 2 | New Growtopia Private Server 3 | Copyright (C) 2019 Growtopia Noobs 4 | This program is free software: you can redistribute it and/or modify 5 | it under the terms of the GNU Affero General Public License as published 6 | by the Free Software Foundation, either version 3 of the License, or 7 | (at your option) any later version. 8 | This program is distributed in the hope that it will be useful, 9 | but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | GNU Affero General Public License for more details. 12 | You should have received a copy of the GNU Affero General Public License 13 | along with this program. If not, see . 14 | **********************************************************************************/ 15 | 16 | 17 | #pragma once 18 | 19 | #include 20 | #include 21 | #include 22 | #include 23 | #include 24 | 25 | enum EventPackDataType : short { 26 | INTEGER_T, 27 | VECTOR_INTEGER_T, 28 | LONG_INTEGER_T, 29 | VECTOR_LONG_INTEGER_T, 30 | FLOAT_T, 31 | VECTOR_FLOAT_T, 32 | STRING_T, 33 | VECTOR_STRING_T, 34 | EVENT_PACK_T, 35 | VECTOR_EVENT_PACK_T 36 | }; 37 | 38 | class EventPack; 39 | class EventUnpack; 40 | 41 | class EventPackData { 42 | private: 43 | std::string name; 44 | std::vector data; 45 | 46 | template 47 | void push_back(T item, unsigned int *pushed_size = NULL) { 48 | if(pushed_size) *pushed_size += sizeof(item); 49 | for(int i=0; i 55 | void push_back(T *item, unsigned int size) { 56 | for(int i=0; iname.length(); 63 | this->push_back(nameLen); 64 | this->push_back(name.c_str(), nameLen); 65 | this->push_back(type); 66 | int ret = data.size(); 67 | unsigned int size = 0; 68 | this->push_back(size); 69 | return ret; 70 | } 71 | 72 | inline void add_data_size(unsigned int pos, unsigned int data_size) { 73 | ((unsigned int*)(this->data.data()+pos))[0] += data_size; 74 | } 75 | public: 76 | void operator=(int arg); 77 | void operator=(std::vector arg); 78 | void operator=(long long int arg); 79 | void operator=(std::vector arg); 80 | void operator=(float arg); 81 | void operator=(std::vector arg); 82 | void operator=(std::string arg); 83 | void operator=(std::vector arg); 84 | void operator=(EventPack arg); 85 | void operator=(std::vector arg); 86 | void operator=(EventUnpack arg); 87 | 88 | std::vector getData() { 89 | return data; 90 | } 91 | 92 | EventPackData(std::string name) { 93 | this->name = name; 94 | } 95 | }; 96 | 97 | class EventPack { 98 | private: 99 | std::list data; 100 | uint8_t** ptr; 101 | 102 | public: 103 | bool isEmpty() { 104 | if(data.size()==0) return true; 105 | return false; 106 | } 107 | 108 | uint8_t* serialize(int* size = NULL) { 109 | int s = 0; 110 | for(EventPackData& pack: data) { 111 | s += pack.getData().size(); 112 | } 113 | if(size) *size = s + sizeof(int); 114 | uint8_t* ret = *ptr; 115 | *ptr += s + sizeof(int); 116 | uint8_t* ptr = ret + sizeof(int); 117 | memcpy(ret, &s, sizeof(int)); 118 | for(EventPackData& pack: data) { 119 | int dataSize = pack.getData().size(); 120 | std::memcpy(ptr, pack.getData().data(), dataSize); 121 | ptr += dataSize; 122 | } 123 | return ret; 124 | } 125 | 126 | EventPackData& operator[](std::string name) { 127 | EventPackData dat(std::move(name)); 128 | data.emplace_back(dat); 129 | return data.back(); 130 | } 131 | 132 | EventPack(uint8_t** ptr) { 133 | this->ptr = ptr; 134 | } 135 | }; 136 | 137 | class EventUnpack; 138 | 139 | class EventUnpackRequest { 140 | private: 141 | std::string parName; 142 | uint8_t* data; 143 | 144 | uint8_t* getPtrByName(std::string name) { 145 | if(data == NULL) return NULL; 146 | int nameLen = name.length(); 147 | uint8_t* data_ptr = data; 148 | int length = *(int*)data_ptr; 149 | for(uint8_t* ptr = data_ptr+4; ptr& ret) { 185 | if(*(short*)ptr!=EventPackDataType::VECTOR_INTEGER_T) throw; 186 | ptr+=sizeof(short); 187 | unsigned int var_count = (*(unsigned int*)ptr) >> 2; 188 | ptr+=sizeof(int); 189 | for(int i=0; i& ret) { 202 | if(*(short*)ptr!=EventPackDataType::VECTOR_INTEGER_T) throw; 203 | ptr+=sizeof(short); 204 | unsigned int var_count = (*(unsigned int*)ptr) >> 2; 205 | ptr+=sizeof(int); 206 | for(int i=0; i& ret) { 219 | if(*(short*)ptr!=EventPackDataType::VECTOR_LONG_INTEGER_T) throw; 220 | ptr+=sizeof(short); 221 | unsigned int var_count = (*(unsigned int*)ptr) >> 3; 222 | ptr+=sizeof(int); 223 | for(int i=0; i& ret) { 236 | if(*(short*)ptr!=EventPackDataType::VECTOR_FLOAT_T) throw; 237 | ptr+=sizeof(short); 238 | unsigned int var_count = (*(unsigned int*)ptr) >> 2; 239 | ptr+=sizeof(int); 240 | for(int i=0; i& ret) { 258 | if(*(short*)ptr!=EventPackDataType::VECTOR_STRING_T) throw; 259 | ptr+=sizeof(short); 260 | int data_size = *(int *) ptr; 261 | ptr += sizeof(int); 262 | for(int i=0; i& ret); 277 | 278 | template 279 | operator T() { 280 | uint8_t* ptr = getPtrByName(parName); 281 | if(ptr==NULL) throw 1; 282 | T ret; 283 | resolve_value(ptr, ret); 284 | return ret; 285 | } 286 | 287 | EventPackDataType getType() { 288 | uint8_t* ptr = getPtrByName(parName); 289 | if(ptr==NULL) throw 1; 290 | return *(EventPackDataType*)ptr; 291 | } 292 | 293 | EventUnpackRequest(std::string parName, uint8_t* data) : parName(std::move(parName)), data(std::move(data)) {} 294 | }; 295 | 296 | #include 297 | 298 | class EventUnpack { 299 | private: 300 | uint8_t* data; 301 | 302 | 303 | 304 | public: 305 | EventUnpackRequest operator[](std::string name) { 306 | return EventUnpackRequest(name, data); 307 | } 308 | 309 | uint8_t* getData() { 310 | return data; 311 | } 312 | 313 | bool isEmpty() { 314 | if(data == NULL) return true; 315 | if(*(int*)data<4) return true; 316 | return false; 317 | } 318 | 319 | std::string to_string() { 320 | if(data == NULL) { 321 | return "NULL EventPack"; 322 | } 323 | std::string ret = ""; 324 | uint8_t* data_ptr = data; 325 | int length = *(int*)data_ptr; 326 | for(uint8_t* ptr = data_ptr+4; ptr val; 361 | EventUnpackRequest::resolve_value(ptr, val); 362 | for(int i=0; i val; 375 | EventUnpackRequest::resolve_value(ptr, val); 376 | for(int i=0; i val; 389 | EventUnpackRequest::resolve_value(ptr, val); 390 | for(int i=0; i val; 403 | EventUnpackRequest::resolve_value(ptr, val); 404 | for(int i=0; i val; 417 | EventUnpackRequest::resolve_value(ptr, val); 418 | for(int i=0; i 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 Affero General Public License is a free, copyleft license for 11 | software and other kinds of works, specifically designed to ensure 12 | cooperation with the community in the case of network server software. 13 | 14 | The licenses for most software and other practical works are designed 15 | to take away your freedom to share and change the works. By contrast, 16 | our General Public Licenses are intended to guarantee your freedom to 17 | share and change all versions of a program--to make sure it remains free 18 | software for all its users. 19 | 20 | When we speak of free software, we are referring to freedom, not 21 | price. Our General Public Licenses are designed to make sure that you 22 | have the freedom to distribute copies of free software (and charge for 23 | them if you wish), that you receive source code or can get it if you 24 | want it, that you can change the software or use pieces of it in new 25 | free programs, and that you know you can do these things. 26 | 27 | Developers that use our General Public Licenses protect your rights 28 | with two steps: (1) assert copyright on the software, and (2) offer 29 | you this License which gives you legal permission to copy, distribute 30 | and/or modify the software. 31 | 32 | A secondary benefit of defending all users' freedom is that 33 | improvements made in alternate versions of the program, if they 34 | receive widespread use, become available for other developers to 35 | incorporate. Many developers of free software are heartened and 36 | encouraged by the resulting cooperation. However, in the case of 37 | software used on network servers, this result may fail to come about. 38 | The GNU General Public License permits making a modified version and 39 | letting the public access it on a server without ever releasing its 40 | source code to the public. 41 | 42 | The GNU Affero General Public License is designed specifically to 43 | ensure that, in such cases, the modified source code becomes available 44 | to the community. It requires the operator of a network server to 45 | provide the source code of the modified version running there to the 46 | users of that server. Therefore, public use of a modified version, on 47 | a publicly accessible server, gives the public access to the source 48 | code of the modified version. 49 | 50 | An older license, called the Affero General Public License and 51 | published by Affero, was designed to accomplish similar goals. This is 52 | a different license, not a version of the Affero GPL, but Affero has 53 | released a new version of the Affero GPL which permits relicensing under 54 | this license. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | TERMS AND CONDITIONS 60 | 61 | 0. Definitions. 62 | 63 | "This License" refers to version 3 of the GNU Affero General Public License. 64 | 65 | "Copyright" also means copyright-like laws that apply to other kinds of 66 | works, such as semiconductor masks. 67 | 68 | "The Program" refers to any copyrightable work licensed under this 69 | License. Each licensee is addressed as "you". "Licensees" and 70 | "recipients" may be individuals or organizations. 71 | 72 | To "modify" a work means to copy from or adapt all or part of the work 73 | in a fashion requiring copyright permission, other than the making of an 74 | exact copy. The resulting work is called a "modified version" of the 75 | earlier work or a work "based on" the earlier work. 76 | 77 | A "covered work" means either the unmodified Program or a work based 78 | on the Program. 79 | 80 | To "propagate" a work means to do anything with it that, without 81 | permission, would make you directly or secondarily liable for 82 | infringement under applicable copyright law, except executing it on a 83 | computer or modifying a private copy. Propagation includes copying, 84 | distribution (with or without modification), making available to the 85 | public, and in some countries other activities as well. 86 | 87 | To "convey" a work means any kind of propagation that enables other 88 | parties to make or receive copies. Mere interaction with a user through 89 | a computer network, with no transfer of a copy, is not conveying. 90 | 91 | An interactive user interface displays "Appropriate Legal Notices" 92 | to the extent that it includes a convenient and prominently visible 93 | feature that (1) displays an appropriate copyright notice, and (2) 94 | tells the user that there is no warranty for the work (except to the 95 | extent that warranties are provided), that licensees may convey the 96 | work under this License, and how to view a copy of this License. If 97 | the interface presents a list of user commands or options, such as a 98 | menu, a prominent item in the list meets this criterion. 99 | 100 | 1. Source Code. 101 | 102 | The "source code" for a work means the preferred form of the work 103 | for making modifications to it. "Object code" means any non-source 104 | form of a work. 105 | 106 | A "Standard Interface" means an interface that either is an official 107 | standard defined by a recognized standards body, or, in the case of 108 | interfaces specified for a particular programming language, one that 109 | is widely used among developers working in that language. 110 | 111 | The "System Libraries" of an executable work include anything, other 112 | than the work as a whole, that (a) is included in the normal form of 113 | packaging a Major Component, but which is not part of that Major 114 | Component, and (b) serves only to enable use of the work with that 115 | Major Component, or to implement a Standard Interface for which an 116 | implementation is available to the public in source code form. A 117 | "Major Component", in this context, means a major essential component 118 | (kernel, window system, and so on) of the specific operating system 119 | (if any) on which the executable work runs, or a compiler used to 120 | produce the work, or an object code interpreter used to run it. 121 | 122 | The "Corresponding Source" for a work in object code form means all 123 | the source code needed to generate, install, and (for an executable 124 | work) run the object code and to modify the work, including scripts to 125 | control those activities. However, it does not include the work's 126 | System Libraries, or general-purpose tools or generally available free 127 | programs which are used unmodified in performing those activities but 128 | which are not part of the work. For example, Corresponding Source 129 | includes interface definition files associated with source files for 130 | the work, and the source code for shared libraries and dynamically 131 | linked subprograms that the work is specifically designed to require, 132 | such as by intimate data communication or control flow between those 133 | subprograms and other parts of the work. 134 | 135 | The Corresponding Source need not include anything that users 136 | can regenerate automatically from other parts of the Corresponding 137 | Source. 138 | 139 | The Corresponding Source for a work in source code form is that 140 | same work. 141 | 142 | 2. Basic Permissions. 143 | 144 | All rights granted under this License are granted for the term of 145 | copyright on the Program, and are irrevocable provided the stated 146 | conditions are met. This License explicitly affirms your unlimited 147 | permission to run the unmodified Program. The output from running a 148 | covered work is covered by this License only if the output, given its 149 | content, constitutes a covered work. This License acknowledges your 150 | rights of fair use or other equivalent, as provided by copyright law. 151 | 152 | You may make, run and propagate covered works that you do not 153 | convey, without conditions so long as your license otherwise remains 154 | in force. You may convey covered works to others for the sole purpose 155 | of having them make modifications exclusively for you, or provide you 156 | with facilities for running those works, provided that you comply with 157 | the terms of this License in conveying all material for which you do 158 | not control copyright. Those thus making or running the covered works 159 | for you must do so exclusively on your behalf, under your direction 160 | and control, on terms that prohibit them from making any copies of 161 | your copyrighted material outside their relationship with you. 162 | 163 | Conveying under any other circumstances is permitted solely under 164 | the conditions stated below. Sublicensing is not allowed; section 10 165 | makes it unnecessary. 166 | 167 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 168 | 169 | No covered work shall be deemed part of an effective technological 170 | measure under any applicable law fulfilling obligations under article 171 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 172 | similar laws prohibiting or restricting circumvention of such 173 | measures. 174 | 175 | When you convey a covered work, you waive any legal power to forbid 176 | circumvention of technological measures to the extent such circumvention 177 | is effected by exercising rights under this License with respect to 178 | the covered work, and you disclaim any intention to limit operation or 179 | modification of the work as a means of enforcing, against the work's 180 | users, your or third parties' legal rights to forbid circumvention of 181 | technological measures. 182 | 183 | 4. Conveying Verbatim Copies. 184 | 185 | You may convey verbatim copies of the Program's source code as you 186 | receive it, in any medium, provided that you conspicuously and 187 | appropriately publish on each copy an appropriate copyright notice; 188 | keep intact all notices stating that this License and any 189 | non-permissive terms added in accord with section 7 apply to the code; 190 | keep intact all notices of the absence of any warranty; and give all 191 | recipients a copy of this License along with the Program. 192 | 193 | You may charge any price or no price for each copy that you convey, 194 | and you may offer support or warranty protection for a fee. 195 | 196 | 5. Conveying Modified Source Versions. 197 | 198 | You may convey a work based on the Program, or the modifications to 199 | produce it from the Program, in the form of source code under the 200 | terms of section 4, provided that you also meet all of these conditions: 201 | 202 | a) The work must carry prominent notices stating that you modified 203 | it, and giving a relevant date. 204 | 205 | b) The work must carry prominent notices stating that it is 206 | released under this License and any conditions added under section 207 | 7. This requirement modifies the requirement in section 4 to 208 | "keep intact all notices". 209 | 210 | c) You must license the entire work, as a whole, under this 211 | License to anyone who comes into possession of a copy. This 212 | License will therefore apply, along with any applicable section 7 213 | additional terms, to the whole of the work, and all its parts, 214 | regardless of how they are packaged. This License gives no 215 | permission to license the work in any other way, but it does not 216 | invalidate such permission if you have separately received it. 217 | 218 | d) If the work has interactive user interfaces, each must display 219 | Appropriate Legal Notices; however, if the Program has interactive 220 | interfaces that do not display Appropriate Legal Notices, your 221 | work need not make them do so. 222 | 223 | A compilation of a covered work with other separate and independent 224 | works, which are not by their nature extensions of the covered work, 225 | and which are not combined with it such as to form a larger program, 226 | in or on a volume of a storage or distribution medium, is called an 227 | "aggregate" if the compilation and its resulting copyright are not 228 | used to limit the access or legal rights of the compilation's users 229 | beyond what the individual works permit. Inclusion of a covered work 230 | in an aggregate does not cause this License to apply to the other 231 | parts of the aggregate. 232 | 233 | 6. Conveying Non-Source Forms. 234 | 235 | You may convey a covered work in object code form under the terms 236 | of sections 4 and 5, provided that you also convey the 237 | machine-readable Corresponding Source under the terms of this License, 238 | in one of these ways: 239 | 240 | a) Convey the object code in, or embodied in, a physical product 241 | (including a physical distribution medium), accompanied by the 242 | Corresponding Source fixed on a durable physical medium 243 | customarily used for software interchange. 244 | 245 | b) Convey the object code in, or embodied in, a physical product 246 | (including a physical distribution medium), accompanied by a 247 | written offer, valid for at least three years and valid for as 248 | long as you offer spare parts or customer support for that product 249 | model, to give anyone who possesses the object code either (1) a 250 | copy of the Corresponding Source for all the software in the 251 | product that is covered by this License, on a durable physical 252 | medium customarily used for software interchange, for a price no 253 | more than your reasonable cost of physically performing this 254 | conveying of source, or (2) access to copy the 255 | Corresponding Source from a network server at no charge. 256 | 257 | c) Convey individual copies of the object code with a copy of the 258 | written offer to provide the Corresponding Source. This 259 | alternative is allowed only occasionally and noncommercially, and 260 | only if you received the object code with such an offer, in accord 261 | with subsection 6b. 262 | 263 | d) Convey the object code by offering access from a designated 264 | place (gratis or for a charge), and offer equivalent access to the 265 | Corresponding Source in the same way through the same place at no 266 | further charge. You need not require recipients to copy the 267 | Corresponding Source along with the object code. If the place to 268 | copy the object code is a network server, the Corresponding Source 269 | may be on a different server (operated by you or a third party) 270 | that supports equivalent copying facilities, provided you maintain 271 | clear directions next to the object code saying where to find the 272 | Corresponding Source. Regardless of what server hosts the 273 | Corresponding Source, you remain obligated to ensure that it is 274 | available for as long as needed to satisfy these requirements. 275 | 276 | e) Convey the object code using peer-to-peer transmission, provided 277 | you inform other peers where the object code and Corresponding 278 | Source of the work are being offered to the general public at no 279 | charge under subsection 6d. 280 | 281 | A separable portion of the object code, whose source code is excluded 282 | from the Corresponding Source as a System Library, need not be 283 | included in conveying the object code work. 284 | 285 | A "User Product" is either (1) a "consumer product", which means any 286 | tangible personal property which is normally used for personal, family, 287 | or household purposes, or (2) anything designed or sold for incorporation 288 | into a dwelling. In determining whether a product is a consumer product, 289 | doubtful cases shall be resolved in favor of coverage. For a particular 290 | product received by a particular user, "normally used" refers to a 291 | typical or common use of that class of product, regardless of the status 292 | of the particular user or of the way in which the particular user 293 | actually uses, or expects or is expected to use, the product. A product 294 | is a consumer product regardless of whether the product has substantial 295 | commercial, industrial or non-consumer uses, unless such uses represent 296 | the only significant mode of use of the product. 297 | 298 | "Installation Information" for a User Product means any methods, 299 | procedures, authorization keys, or other information required to install 300 | and execute modified versions of a covered work in that User Product from 301 | a modified version of its Corresponding Source. The information must 302 | suffice to ensure that the continued functioning of the modified object 303 | code is in no case prevented or interfered with solely because 304 | modification has been made. 305 | 306 | If you convey an object code work under this section in, or with, or 307 | specifically for use in, a User Product, and the conveying occurs as 308 | part of a transaction in which the right of possession and use of the 309 | User Product is transferred to the recipient in perpetuity or for a 310 | fixed term (regardless of how the transaction is characterized), the 311 | Corresponding Source conveyed under this section must be accompanied 312 | by the Installation Information. But this requirement does not apply 313 | if neither you nor any third party retains the ability to install 314 | modified object code on the User Product (for example, the work has 315 | been installed in ROM). 316 | 317 | The requirement to provide Installation Information does not include a 318 | requirement to continue to provide support service, warranty, or updates 319 | for a work that has been modified or installed by the recipient, or for 320 | the User Product in which it has been modified or installed. Access to a 321 | network may be denied when the modification itself materially and 322 | adversely affects the operation of the network or violates the rules and 323 | protocols for communication across the network. 324 | 325 | Corresponding Source conveyed, and Installation Information provided, 326 | in accord with this section must be in a format that is publicly 327 | documented (and with an implementation available to the public in 328 | source code form), and must require no special password or key for 329 | unpacking, reading or copying. 330 | 331 | 7. Additional Terms. 332 | 333 | "Additional permissions" are terms that supplement the terms of this 334 | License by making exceptions from one or more of its conditions. 335 | Additional permissions that are applicable to the entire Program shall 336 | be treated as though they were included in this License, to the extent 337 | that they are valid under applicable law. If additional permissions 338 | apply only to part of the Program, that part may be used separately 339 | under those permissions, but the entire Program remains governed by 340 | this License without regard to the additional permissions. 341 | 342 | When you convey a copy of a covered work, you may at your option 343 | remove any additional permissions from that copy, or from any part of 344 | it. (Additional permissions may be written to require their own 345 | removal in certain cases when you modify the work.) You may place 346 | additional permissions on material, added by you to a covered work, 347 | for which you have or can give appropriate copyright permission. 348 | 349 | Notwithstanding any other provision of this License, for material you 350 | add to a covered work, you may (if authorized by the copyright holders of 351 | that material) supplement the terms of this License with terms: 352 | 353 | a) Disclaiming warranty or limiting liability differently from the 354 | terms of sections 15 and 16 of this License; or 355 | 356 | b) Requiring preservation of specified reasonable legal notices or 357 | author attributions in that material or in the Appropriate Legal 358 | Notices displayed by works containing it; or 359 | 360 | c) Prohibiting misrepresentation of the origin of that material, or 361 | requiring that modified versions of such material be marked in 362 | reasonable ways as different from the original version; or 363 | 364 | d) Limiting the use for publicity purposes of names of licensors or 365 | authors of the material; or 366 | 367 | e) Declining to grant rights under trademark law for use of some 368 | trade names, trademarks, or service marks; or 369 | 370 | f) Requiring indemnification of licensors and authors of that 371 | material by anyone who conveys the material (or modified versions of 372 | it) with contractual assumptions of liability to the recipient, for 373 | any liability that these contractual assumptions directly impose on 374 | those licensors and authors. 375 | 376 | All other non-permissive additional terms are considered "further 377 | restrictions" within the meaning of section 10. If the Program as you 378 | received it, or any part of it, contains a notice stating that it is 379 | governed by this License along with a term that is a further 380 | restriction, you may remove that term. If a license document contains 381 | a further restriction but permits relicensing or conveying under this 382 | License, you may add to a covered work material governed by the terms 383 | of that license document, provided that the further restriction does 384 | not survive such relicensing or conveying. 385 | 386 | If you add terms to a covered work in accord with this section, you 387 | must place, in the relevant source files, a statement of the 388 | additional terms that apply to those files, or a notice indicating 389 | where to find the applicable terms. 390 | 391 | Additional terms, permissive or non-permissive, may be stated in the 392 | form of a separately written license, or stated as exceptions; 393 | the above requirements apply either way. 394 | 395 | 8. Termination. 396 | 397 | You may not propagate or modify a covered work except as expressly 398 | provided under this License. Any attempt otherwise to propagate or 399 | modify it is void, and will automatically terminate your rights under 400 | this License (including any patent licenses granted under the third 401 | paragraph of section 11). 402 | 403 | However, if you cease all violation of this License, then your 404 | license from a particular copyright holder is reinstated (a) 405 | provisionally, unless and until the copyright holder explicitly and 406 | finally terminates your license, and (b) permanently, if the copyright 407 | holder fails to notify you of the violation by some reasonable means 408 | prior to 60 days after the cessation. 409 | 410 | Moreover, your license from a particular copyright holder is 411 | reinstated permanently if the copyright holder notifies you of the 412 | violation by some reasonable means, this is the first time you have 413 | received notice of violation of this License (for any work) from that 414 | copyright holder, and you cure the violation prior to 30 days after 415 | your receipt of the notice. 416 | 417 | Termination of your rights under this section does not terminate the 418 | licenses of parties who have received copies or rights from you under 419 | this License. If your rights have been terminated and not permanently 420 | reinstated, you do not qualify to receive new licenses for the same 421 | material under section 10. 422 | 423 | 9. Acceptance Not Required for Having Copies. 424 | 425 | You are not required to accept this License in order to receive or 426 | run a copy of the Program. Ancillary propagation of a covered work 427 | occurring solely as a consequence of using peer-to-peer transmission 428 | to receive a copy likewise does not require acceptance. However, 429 | nothing other than this License grants you permission to propagate or 430 | modify any covered work. These actions infringe copyright if you do 431 | not accept this License. Therefore, by modifying or propagating a 432 | covered work, you indicate your acceptance of this License to do so. 433 | 434 | 10. Automatic Licensing of Downstream Recipients. 435 | 436 | Each time you convey a covered work, the recipient automatically 437 | receives a license from the original licensors, to run, modify and 438 | propagate that work, subject to this License. You are not responsible 439 | for enforcing compliance by third parties with this License. 440 | 441 | An "entity transaction" is a transaction transferring control of an 442 | organization, or substantially all assets of one, or subdividing an 443 | organization, or merging organizations. If propagation of a covered 444 | work results from an entity transaction, each party to that 445 | transaction who receives a copy of the work also receives whatever 446 | licenses to the work the party's predecessor in interest had or could 447 | give under the previous paragraph, plus a right to possession of the 448 | Corresponding Source of the work from the predecessor in interest, if 449 | the predecessor has it or can get it with reasonable efforts. 450 | 451 | You may not impose any further restrictions on the exercise of the 452 | rights granted or affirmed under this License. For example, you may 453 | not impose a license fee, royalty, or other charge for exercise of 454 | rights granted under this License, and you may not initiate litigation 455 | (including a cross-claim or counterclaim in a lawsuit) alleging that 456 | any patent claim is infringed by making, using, selling, offering for 457 | sale, or importing the Program or any portion of it. 458 | 459 | 11. Patents. 460 | 461 | A "contributor" is a copyright holder who authorizes use under this 462 | License of the Program or a work on which the Program is based. The 463 | work thus licensed is called the contributor's "contributor version". 464 | 465 | A contributor's "essential patent claims" are all patent claims 466 | owned or controlled by the contributor, whether already acquired or 467 | hereafter acquired, that would be infringed by some manner, permitted 468 | by this License, of making, using, or selling its contributor version, 469 | but do not include claims that would be infringed only as a 470 | consequence of further modification of the contributor version. For 471 | purposes of this definition, "control" includes the right to grant 472 | patent sublicenses in a manner consistent with the requirements of 473 | this License. 474 | 475 | Each contributor grants you a non-exclusive, worldwide, royalty-free 476 | patent license under the contributor's essential patent claims, to 477 | make, use, sell, offer for sale, import and otherwise run, modify and 478 | propagate the contents of its contributor version. 479 | 480 | In the following three paragraphs, a "patent license" is any express 481 | agreement or commitment, however denominated, not to enforce a patent 482 | (such as an express permission to practice a patent or covenant not to 483 | sue for patent infringement). To "grant" such a patent license to a 484 | party means to make such an agreement or commitment not to enforce a 485 | patent against the party. 486 | 487 | If you convey a covered work, knowingly relying on a patent license, 488 | and the Corresponding Source of the work is not available for anyone 489 | to copy, free of charge and under the terms of this License, through a 490 | publicly available network server or other readily accessible means, 491 | then you must either (1) cause the Corresponding Source to be so 492 | available, or (2) arrange to deprive yourself of the benefit of the 493 | patent license for this particular work, or (3) arrange, in a manner 494 | consistent with the requirements of this License, to extend the patent 495 | license to downstream recipients. "Knowingly relying" means you have 496 | actual knowledge that, but for the patent license, your conveying the 497 | covered work in a country, or your recipient's use of the covered work 498 | in a country, would infringe one or more identifiable patents in that 499 | country that you have reason to believe are valid. 500 | 501 | If, pursuant to or in connection with a single transaction or 502 | arrangement, you convey, or propagate by procuring conveyance of, a 503 | covered work, and grant a patent license to some of the parties 504 | receiving the covered work authorizing them to use, propagate, modify 505 | or convey a specific copy of the covered work, then the patent license 506 | you grant is automatically extended to all recipients of the covered 507 | work and works based on it. 508 | 509 | A patent license is "discriminatory" if it does not include within 510 | the scope of its coverage, prohibits the exercise of, or is 511 | conditioned on the non-exercise of one or more of the rights that are 512 | specifically granted under this License. You may not convey a covered 513 | work if you are a party to an arrangement with a third party that is 514 | in the business of distributing software, under which you make payment 515 | to the third party based on the extent of your activity of conveying 516 | the work, and under which the third party grants, to any of the 517 | parties who would receive the covered work from you, a discriminatory 518 | patent license (a) in connection with copies of the covered work 519 | conveyed by you (or copies made from those copies), or (b) primarily 520 | for and in connection with specific products or compilations that 521 | contain the covered work, unless you entered into that arrangement, 522 | or that patent license was granted, prior to 28 March 2007. 523 | 524 | Nothing in this License shall be construed as excluding or limiting 525 | any implied license or other defenses to infringement that may 526 | otherwise be available to you under applicable patent law. 527 | 528 | 12. No Surrender of Others' Freedom. 529 | 530 | If conditions are imposed on you (whether by court order, agreement or 531 | otherwise) that contradict the conditions of this License, they do not 532 | excuse you from the conditions of this License. If you cannot convey a 533 | covered work so as to satisfy simultaneously your obligations under this 534 | License and any other pertinent obligations, then as a consequence you may 535 | not convey it at all. For example, if you agree to terms that obligate you 536 | to collect a royalty for further conveying from those to whom you convey 537 | the Program, the only way you could satisfy both those terms and this 538 | License would be to refrain entirely from conveying the Program. 539 | 540 | 13. Remote Network Interaction; Use with the GNU General Public License. 541 | 542 | Notwithstanding any other provision of this License, if you modify the 543 | Program, your modified version must prominently offer all users 544 | interacting with it remotely through a computer network (if your version 545 | supports such interaction) an opportunity to receive the Corresponding 546 | Source of your version by providing access to the Corresponding Source 547 | from a network server at no charge, through some standard or customary 548 | means of facilitating copying of software. This Corresponding Source 549 | shall include the Corresponding Source for any work covered by version 3 550 | of the GNU General Public License that is incorporated pursuant to the 551 | following paragraph. 552 | 553 | Notwithstanding any other provision of this License, you have 554 | permission to link or combine any covered work with a work licensed 555 | under version 3 of the GNU General Public License into a single 556 | combined work, and to convey the resulting work. The terms of this 557 | License will continue to apply to the part which is the covered work, 558 | but the work with which it is combined will remain governed by version 559 | 3 of the GNU General Public License. 560 | 561 | 14. Revised Versions of this License. 562 | 563 | The Free Software Foundation may publish revised and/or new versions of 564 | the GNU Affero General Public License from time to time. Such new versions 565 | will be similar in spirit to the present version, but may differ in detail to 566 | address new problems or concerns. 567 | 568 | Each version is given a distinguishing version number. If the 569 | Program specifies that a certain numbered version of the GNU Affero General 570 | Public License "or any later version" applies to it, you have the 571 | option of following the terms and conditions either of that numbered 572 | version or of any later version published by the Free Software 573 | Foundation. If the Program does not specify a version number of the 574 | GNU Affero General Public License, you may choose any version ever published 575 | by the Free Software Foundation. 576 | 577 | If the Program specifies that a proxy can decide which future 578 | versions of the GNU Affero General Public License can be used, that proxy's 579 | public statement of acceptance of a version permanently authorizes you 580 | to choose that version for the Program. 581 | 582 | Later license versions may give you additional or different 583 | permissions. However, no additional obligations are imposed on any 584 | author or copyright holder as a result of your choosing to follow a 585 | later version. 586 | 587 | 15. Disclaimer of Warranty. 588 | 589 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 590 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 591 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 592 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 593 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 594 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 595 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 596 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 597 | 598 | 16. Limitation of Liability. 599 | 600 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 601 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 602 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 603 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 604 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 605 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 606 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 607 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 608 | SUCH DAMAGES. 609 | 610 | 17. Interpretation of Sections 15 and 16. 611 | 612 | If the disclaimer of warranty and limitation of liability provided 613 | above cannot be given local legal effect according to their terms, 614 | reviewing courts shall apply local law that most closely approximates 615 | an absolute waiver of all civil liability in connection with the 616 | Program, unless a warranty or assumption of liability accompanies a 617 | copy of the Program in return for a fee. 618 | 619 | END OF TERMS AND CONDITIONS 620 | 621 | How to Apply These Terms to Your New Programs 622 | 623 | If you develop a new program, and you want it to be of the greatest 624 | possible use to the public, the best way to achieve this is to make it 625 | free software which everyone can redistribute and change under these terms. 626 | 627 | To do so, attach the following notices to the program. It is safest 628 | to attach them to the start of each source file to most effectively 629 | state the exclusion of warranty; and each file should have at least 630 | the "copyright" line and a pointer to where the full notice is found. 631 | 632 | 633 | Copyright (C) 634 | 635 | This program is free software: you can redistribute it and/or modify 636 | it under the terms of the GNU Affero General Public License as published 637 | by the Free Software Foundation, either version 3 of the License, or 638 | (at your option) any later version. 639 | 640 | This program is distributed in the hope that it will be useful, 641 | but WITHOUT ANY WARRANTY; without even the implied warranty of 642 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 643 | GNU Affero General Public License for more details. 644 | 645 | You should have received a copy of the GNU Affero General Public License 646 | along with this program. If not, see . 647 | 648 | Also add information on how to contact you by electronic and paper mail. 649 | 650 | If your software can interact with users remotely through a computer 651 | network, you should also make sure that it provides a way for users to 652 | get its source. For example, if your program is a web application, its 653 | interface could display a "Source" link that leads users to an archive 654 | of the code. There are many ways you could offer source, and different 655 | solutions will be better for different programs; see section 13 for the 656 | specific requirements. 657 | 658 | You should also get your employer (if you work as a programmer) or school, 659 | if any, to sign a "copyright disclaimer" for the program, if necessary. 660 | For more information on this, and how to apply and follow the GNU AGPL, see 661 | . 662 | --------------------------------------------------------------------------------