mirror of
https://github.com/ScrelliCopter/tmx2gba.git
synced 2025-02-21 03:29:25 +11:00
Compare commits
21 Commits
v0.3
...
b43b39b8b8
| Author | SHA1 | Date | |
|---|---|---|---|
| b43b39b8b8 | |||
| 271caa07b0 | |||
| 7abf556f68 | |||
| 78997a9529 | |||
| 73b5d44b46 | |||
| 59e36125f5 | |||
| 35abaf7121 | |||
| 7b0979e020 | |||
| b9c56ce5a7 | |||
| 0b635ebe87 | |||
| 5d5dda81c9 | |||
| 417bc11fae | |||
| 696057b5e6 | |||
| 17de8ac3ec | |||
| db1de4ba8e | |||
| f4930668ee | |||
| 5e466598ea | |||
| e2a69bf433 | |||
| 57455e0b73 | |||
| c3bbe8135d | |||
| 5c164b239d |
17
.editorconfig
Normal file
17
.editorconfig
Normal file
@@ -0,0 +1,17 @@
|
||||
root = true
|
||||
|
||||
[*]
|
||||
charset = utf-8
|
||||
|
||||
[*.yml]
|
||||
end_of_line = lf
|
||||
insert_final_newline = true
|
||||
indent_size = 2
|
||||
indent_style = space
|
||||
|
||||
[{*.c,*.cpp,*.h,*.hpp,*.cmake,CMakeLists.txt}]
|
||||
end_of_line = lf
|
||||
insert_final_newline = true
|
||||
indent_size = tab
|
||||
indent_style = tab
|
||||
tab_width = 4
|
||||
52
.github/workflows/cmake.yml
vendored
52
.github/workflows/cmake.yml
vendored
@@ -2,36 +2,50 @@ name: CMake
|
||||
|
||||
on:
|
||||
push:
|
||||
branches: [ "master" ]
|
||||
paths:
|
||||
- "src/**"
|
||||
- "ext/**"
|
||||
- "CMakeLists.txt"
|
||||
pull_request:
|
||||
branches: [ "master" ]
|
||||
|
||||
env:
|
||||
# Customize the CMake build type here (Release, Debug, RelWithDebInfo, etc.)
|
||||
BUILD_TYPE: Release
|
||||
ARTIFACT_NAME: tmx2gba
|
||||
BUILD_TYPE: RelWithDebInfo
|
||||
|
||||
jobs:
|
||||
build:
|
||||
# The CMake configure and build commands are platform agnostic and should work equally well on Windows or Mac.
|
||||
# You can convert this to a matrix build if you need cross-platform coverage.
|
||||
# See: https://docs.github.com/en/free-pro-team@latest/actions/learn-github-actions/managing-complex-workflows#using-a-build-matrix
|
||||
runs-on: ubuntu-latest
|
||||
strategy:
|
||||
matrix:
|
||||
config:
|
||||
- { name: "MacOS 13.0 Universal", os: macos-13, artifact: macos-universal, arch: arm64;x86_64 }
|
||||
- { name: "Windows MSVC x86", os: windows-latest, artifact: windows-x86, arch: x86 }
|
||||
- { name: "Windows MSVC x64", os: windows-latest, artifact: windows-x64 }
|
||||
- { name: "Windows MSVC ARM64", os: windows-latest, artifact: windows-arm64, arch: amd64_arm64 }
|
||||
- { name: "Ubuntu", artifact: "linux", os: ubuntu-latest }
|
||||
runs-on: ${{matrix.config.os}}
|
||||
|
||||
steps:
|
||||
- uses: actions/checkout@v3
|
||||
- uses: actions/checkout@v4
|
||||
# Since ninja isn't used it will take less time if this step is skipped
|
||||
- uses: lukka/get-cmake@latest
|
||||
if: ${{!startsWith(matrix.config.os, 'windows')}}
|
||||
- uses: TheMrMilchmann/setup-msvc-dev@v3
|
||||
if: ${{startsWith(matrix.config.os, 'windows')}}
|
||||
with:
|
||||
arch: ${{matrix.config.arch && matrix.config.arch || 'x64'}}
|
||||
|
||||
- name: Configure CMake
|
||||
# Configure CMake in a 'build' subdirectory. `CMAKE_BUILD_TYPE` is only required if you are using a single-configuration generator such as make.
|
||||
# See https://cmake.org/cmake/help/latest/variable/CMAKE_BUILD_TYPE.html?highlight=cmake_build_type
|
||||
run: cmake -B ${{github.workspace}}/build -DCMAKE_BUILD_TYPE=${{env.BUILD_TYPE}}
|
||||
run: >-
|
||||
cmake -B build
|
||||
-G "${{startsWith(matrix.config.os, 'windows') && 'NMake Makefiles' || 'Ninja'}}"
|
||||
${{(startsWith(matrix.config.os, 'macos') && matrix.config.arch) && format('-DCMAKE_OSX_ARCHITECTURES="{0}"', matrix.config.arch) || ''}}
|
||||
${{matrix.config.extra}} -DCMAKE_BUILD_TYPE=${{env.BUILD_TYPE}}
|
||||
|
||||
- name: Build
|
||||
# Build your program with the given configuration
|
||||
run: cmake --build ${{github.workspace}}/build --config ${{env.BUILD_TYPE}}
|
||||
|
||||
- name: Test
|
||||
working-directory: ${{github.workspace}}/build
|
||||
# Execute tests defined by the CMake configuration.
|
||||
# See https://cmake.org/cmake/help/latest/manual/ctest.1.html for more detail
|
||||
run: ctest -C ${{env.BUILD_TYPE}}
|
||||
run: cmake --build build --config ${{env.BUILD_TYPE}}
|
||||
|
||||
- uses: actions/upload-artifact@v4
|
||||
with:
|
||||
name: ${{env.ARTIFACT_NAME}}-${{matrix.config.artifact}}
|
||||
path: build/src/${{env.ARTIFACT_NAME}}${{startsWith(matrix.config.os, 'windows') && '.exe' || ''}}
|
||||
|
||||
15
.gitignore
vendored
15
.gitignore
vendored
@@ -1,23 +1,13 @@
|
||||
# Compiled Object files
|
||||
*.slo
|
||||
*.lo
|
||||
*.o
|
||||
*.obj
|
||||
|
||||
# Precompiled Headers
|
||||
*.gch
|
||||
*.pch
|
||||
|
||||
# Compiled Dynamic libraries
|
||||
*.so
|
||||
*.dylib
|
||||
*.dll
|
||||
|
||||
# Fortran module files
|
||||
*.mod
|
||||
|
||||
# Compiled Static libraries
|
||||
*.lai
|
||||
*.la
|
||||
*.a
|
||||
*.lib
|
||||
@@ -41,6 +31,11 @@ Release/
|
||||
# CMake Rubbish
|
||||
build/
|
||||
cmake-build-*/
|
||||
xcode/
|
||||
|
||||
# OS Rubbish
|
||||
.DS_Store
|
||||
Thumbs.db
|
||||
|
||||
# Some files I used for testing
|
||||
*.tmx
|
||||
|
||||
@@ -1,32 +1,23 @@
|
||||
cmake_minimum_required(VERSION "3.5" FATAL_ERROR)
|
||||
project(tmx2gba VERSION "0.3")
|
||||
cmake_minimum_required(VERSION "3.15" FATAL_ERROR)
|
||||
project(tmx2gba
|
||||
VERSION "0.7"
|
||||
DESCRIPTION "Simple CLI utility for converting Tiled (.tmx) maps to GBA-friendly charmaps."
|
||||
HOMEPAGE_URL "https://github.com/ScrelliCopter/tmx2gba")
|
||||
|
||||
# Options
|
||||
option(TMX2GBA_DKP_INSTALL "Install into DEVKITPRO prefix" OFF)
|
||||
option(ASAN "Enable address sanitiser" OFF)
|
||||
|
||||
# C++11 & C99
|
||||
set(CMAKE_CXX_STANDARD 11)
|
||||
set(CMAKE_C_STANDARD 99)
|
||||
|
||||
# Enable strong warnings
|
||||
if (MSVC)
|
||||
string(REPLACE "/W3" "/W4" CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS}")
|
||||
string(REPLACE "/W3" "/W4" CMAKE_C_FLAGS "${CMAKE_C_FLAGS}")
|
||||
else()
|
||||
add_compile_options(-Wall)
|
||||
endif()
|
||||
|
||||
if (ASAN)
|
||||
add_compile_options(-fsanitize=address -fno-omit-frame-pointer)
|
||||
add_link_options(-fsanitize=address -shared-libasan)
|
||||
endif()
|
||||
|
||||
# Libraries
|
||||
add_subdirectory(ext/base64)
|
||||
set(TMXLITE_STATIC_LIB ON)
|
||||
add_subdirectory(ext/miniz)
|
||||
add_subdirectory(ext/rapidxml)
|
||||
add_subdirectory(ext/ultragetopt)
|
||||
add_subdirectory(ext/pugixml)
|
||||
add_subdirectory(ext/tmxlite)
|
||||
|
||||
# Main tmx2gba sources
|
||||
add_subdirectory(src)
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
Copyright (C) 2015-2022 a dinosaur
|
||||
Copyright (C) 2015-2024 a dinosaur
|
||||
|
||||
This software is provided 'as-is', without any express or implied
|
||||
warranty. In no event will the authors be held liable for any damages
|
||||
|
||||
@@ -1,5 +0,0 @@
|
||||
add_library(base64
|
||||
base64.cpp base64.h)
|
||||
add_library(External::base64 ALIAS base64)
|
||||
target_include_directories(base64
|
||||
PUBLIC ${CMAKE_CURRENT_SOURCE_DIR})
|
||||
@@ -1,282 +0,0 @@
|
||||
/*
|
||||
base64.cpp and base64.h
|
||||
|
||||
base64 encoding and decoding with C++.
|
||||
More information at
|
||||
https://renenyffenegger.ch/notes/development/Base64/Encoding-and-decoding-base-64-with-cpp
|
||||
|
||||
Version: 2.rc.08 (release candidate)
|
||||
|
||||
Copyright (C) 2004-2017, 2020, 2021 René Nyffenegger
|
||||
|
||||
This source code is provided 'as-is', without any express or implied
|
||||
warranty. In no event will the author be held liable for any damages
|
||||
arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute it
|
||||
freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this source code must not be misrepresented; you must not
|
||||
claim that you wrote the original source code. If you use this source code
|
||||
in a product, an acknowledgment in the product documentation would be
|
||||
appreciated but is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such, and must not be
|
||||
misrepresented as being the original source code.
|
||||
|
||||
3. This notice may not be removed or altered from any source distribution.
|
||||
|
||||
René Nyffenegger rene.nyffenegger@adp-gmbh.ch
|
||||
|
||||
*/
|
||||
|
||||
#include "base64.h"
|
||||
|
||||
#include <algorithm>
|
||||
#include <stdexcept>
|
||||
|
||||
//
|
||||
// Depending on the url parameter in base64_chars, one of
|
||||
// two sets of base64 characters needs to be chosen.
|
||||
// They differ in their last two characters.
|
||||
//
|
||||
static const char* base64_chars[2] = {
|
||||
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
|
||||
"abcdefghijklmnopqrstuvwxyz"
|
||||
"0123456789"
|
||||
"+/",
|
||||
|
||||
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
|
||||
"abcdefghijklmnopqrstuvwxyz"
|
||||
"0123456789"
|
||||
"-_"};
|
||||
|
||||
static unsigned int pos_of_char(const unsigned char chr) {
|
||||
//
|
||||
// Return the position of chr within base64_encode()
|
||||
//
|
||||
|
||||
if (chr >= 'A' && chr <= 'Z') return chr - 'A';
|
||||
else if (chr >= 'a' && chr <= 'z') return chr - 'a' + ('Z' - 'A') + 1;
|
||||
else if (chr >= '0' && chr <= '9') return chr - '0' + ('Z' - 'A') + ('z' - 'a') + 2;
|
||||
else if (chr == '+' || chr == '-') return 62; // Be liberal with input and accept both url ('-') and non-url ('+') base 64 characters (
|
||||
else if (chr == '/' || chr == '_') return 63; // Ditto for '/' and '_'
|
||||
else
|
||||
//
|
||||
// 2020-10-23: Throw std::exception rather than const char*
|
||||
//(Pablo Martin-Gomez, https://github.com/Bouska)
|
||||
//
|
||||
throw std::runtime_error("Input is not valid base64-encoded data.");
|
||||
}
|
||||
|
||||
static std::string insert_linebreaks(std::string str, size_t distance) {
|
||||
//
|
||||
// Provided by https://github.com/JomaCorpFX, adapted by me.
|
||||
//
|
||||
if (!str.length()) {
|
||||
return "";
|
||||
}
|
||||
|
||||
size_t pos = distance;
|
||||
|
||||
while (pos < str.size()) {
|
||||
str.insert(pos, "\n");
|
||||
pos += distance + 1;
|
||||
}
|
||||
|
||||
return str;
|
||||
}
|
||||
|
||||
template <typename String, unsigned int line_length>
|
||||
static std::string encode_with_line_breaks(String s) {
|
||||
return insert_linebreaks(base64_encode(s, false), line_length);
|
||||
}
|
||||
|
||||
template <typename String>
|
||||
static std::string encode_pem(String s) {
|
||||
return encode_with_line_breaks<String, 64>(s);
|
||||
}
|
||||
|
||||
template <typename String>
|
||||
static std::string encode_mime(String s) {
|
||||
return encode_with_line_breaks<String, 76>(s);
|
||||
}
|
||||
|
||||
template <typename String>
|
||||
static std::string encode(String s, bool url) {
|
||||
return base64_encode(reinterpret_cast<const unsigned char*>(s.data()), s.length(), url);
|
||||
}
|
||||
|
||||
std::string base64_encode(unsigned char const* bytes_to_encode, size_t in_len, bool url) {
|
||||
|
||||
size_t len_encoded = (in_len +2) / 3 * 4;
|
||||
|
||||
unsigned char trailing_char = url ? '.' : '=';
|
||||
|
||||
//
|
||||
// Choose set of base64 characters. They differ
|
||||
// for the last two positions, depending on the url
|
||||
// parameter.
|
||||
// A bool (as is the parameter url) is guaranteed
|
||||
// to evaluate to either 0 or 1 in C++ therefore,
|
||||
// the correct character set is chosen by subscripting
|
||||
// base64_chars with url.
|
||||
//
|
||||
const char* base64_chars_ = base64_chars[url];
|
||||
|
||||
std::string ret;
|
||||
ret.reserve(len_encoded);
|
||||
|
||||
unsigned int pos = 0;
|
||||
|
||||
while (pos < in_len) {
|
||||
ret.push_back(base64_chars_[(bytes_to_encode[pos + 0] & 0xfc) >> 2]);
|
||||
|
||||
if (pos+1 < in_len) {
|
||||
ret.push_back(base64_chars_[((bytes_to_encode[pos + 0] & 0x03) << 4) + ((bytes_to_encode[pos + 1] & 0xf0) >> 4)]);
|
||||
|
||||
if (pos+2 < in_len) {
|
||||
ret.push_back(base64_chars_[((bytes_to_encode[pos + 1] & 0x0f) << 2) + ((bytes_to_encode[pos + 2] & 0xc0) >> 6)]);
|
||||
ret.push_back(base64_chars_[ bytes_to_encode[pos + 2] & 0x3f]);
|
||||
}
|
||||
else {
|
||||
ret.push_back(base64_chars_[(bytes_to_encode[pos + 1] & 0x0f) << 2]);
|
||||
ret.push_back(trailing_char);
|
||||
}
|
||||
}
|
||||
else {
|
||||
|
||||
ret.push_back(base64_chars_[(bytes_to_encode[pos + 0] & 0x03) << 4]);
|
||||
ret.push_back(trailing_char);
|
||||
ret.push_back(trailing_char);
|
||||
}
|
||||
|
||||
pos += 3;
|
||||
}
|
||||
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
template <typename String>
|
||||
static std::string decode(String encoded_string, bool remove_linebreaks) {
|
||||
//
|
||||
// decode(…) is templated so that it can be used with String = const std::string&
|
||||
// or std::string_view (requires at least C++17)
|
||||
//
|
||||
|
||||
if (encoded_string.empty()) return std::string();
|
||||
|
||||
if (remove_linebreaks) {
|
||||
|
||||
std::string copy(encoded_string);
|
||||
|
||||
copy.erase(std::remove(copy.begin(), copy.end(), '\n'), copy.end());
|
||||
|
||||
return base64_decode(copy, false);
|
||||
}
|
||||
|
||||
size_t length_of_string = encoded_string.length();
|
||||
size_t pos = 0;
|
||||
|
||||
//
|
||||
// The approximate length (bytes) of the decoded string might be one or
|
||||
// two bytes smaller, depending on the amount of trailing equal signs
|
||||
// in the encoded string. This approximation is needed to reserve
|
||||
// enough space in the string to be returned.
|
||||
//
|
||||
size_t approx_length_of_decoded_string = length_of_string / 4 * 3;
|
||||
std::string ret;
|
||||
ret.reserve(approx_length_of_decoded_string);
|
||||
|
||||
while (pos < length_of_string) {
|
||||
//
|
||||
// Iterate over encoded input string in chunks. The size of all
|
||||
// chunks except the last one is 4 bytes.
|
||||
//
|
||||
// The last chunk might be padded with equal signs or dots
|
||||
// in order to make it 4 bytes in size as well, but this
|
||||
// is not required as per RFC 2045.
|
||||
//
|
||||
// All chunks except the last one produce three output bytes.
|
||||
//
|
||||
// The last chunk produces at least one and up to three bytes.
|
||||
//
|
||||
|
||||
size_t pos_of_char_1 = pos_of_char(encoded_string[pos+1] );
|
||||
|
||||
//
|
||||
// Emit the first output byte that is produced in each chunk:
|
||||
//
|
||||
ret.push_back(static_cast<std::string::value_type>( ( (pos_of_char(encoded_string[pos+0]) ) << 2 ) + ( (pos_of_char_1 & 0x30 ) >> 4)));
|
||||
|
||||
if ( ( pos + 2 < length_of_string ) && // Check for data that is not padded with equal signs (which is allowed by RFC 2045)
|
||||
encoded_string[pos+2] != '=' &&
|
||||
encoded_string[pos+2] != '.' // accept URL-safe base 64 strings, too, so check for '.' also.
|
||||
)
|
||||
{
|
||||
//
|
||||
// Emit a chunk's second byte (which might not be produced in the last chunk).
|
||||
//
|
||||
unsigned int pos_of_char_2 = pos_of_char(encoded_string[pos+2] );
|
||||
ret.push_back(static_cast<std::string::value_type>( (( pos_of_char_1 & 0x0f) << 4) + (( pos_of_char_2 & 0x3c) >> 2)));
|
||||
|
||||
if ( ( pos + 3 < length_of_string ) &&
|
||||
encoded_string[pos+3] != '=' &&
|
||||
encoded_string[pos+3] != '.'
|
||||
)
|
||||
{
|
||||
//
|
||||
// Emit a chunk's third byte (which might not be produced in the last chunk).
|
||||
//
|
||||
ret.push_back(static_cast<std::string::value_type>( ( (pos_of_char_2 & 0x03 ) << 6 ) + pos_of_char(encoded_string[pos+3]) ));
|
||||
}
|
||||
}
|
||||
|
||||
pos += 4;
|
||||
}
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
std::string base64_decode(std::string const& s, bool remove_linebreaks) {
|
||||
return decode(s, remove_linebreaks);
|
||||
}
|
||||
|
||||
std::string base64_encode(std::string const& s, bool url) {
|
||||
return encode(s, url);
|
||||
}
|
||||
|
||||
std::string base64_encode_pem (std::string const& s) {
|
||||
return encode_pem(s);
|
||||
}
|
||||
|
||||
std::string base64_encode_mime(std::string const& s) {
|
||||
return encode_mime(s);
|
||||
}
|
||||
|
||||
#if __cplusplus >= 201703L
|
||||
//
|
||||
// Interface with std::string_view rather than const std::string&
|
||||
// Requires C++17
|
||||
// Provided by Yannic Bonenberger (https://github.com/Yannic)
|
||||
//
|
||||
|
||||
std::string base64_encode(std::string_view s, bool url) {
|
||||
return encode(s, url);
|
||||
}
|
||||
|
||||
std::string base64_encode_pem(std::string_view s) {
|
||||
return encode_pem(s);
|
||||
}
|
||||
|
||||
std::string base64_encode_mime(std::string_view s) {
|
||||
return encode_mime(s);
|
||||
}
|
||||
|
||||
std::string base64_decode(std::string_view s, bool remove_linebreaks) {
|
||||
return decode(s, remove_linebreaks);
|
||||
}
|
||||
|
||||
#endif // __cplusplus >= 201703L
|
||||
@@ -1,35 +0,0 @@
|
||||
//
|
||||
// base64 encoding and decoding with C++.
|
||||
// Version: 2.rc.08 (release candidate)
|
||||
//
|
||||
|
||||
#ifndef BASE64_H_C0CE2A47_D10E_42C9_A27C_C883944E704A
|
||||
#define BASE64_H_C0CE2A47_D10E_42C9_A27C_C883944E704A
|
||||
|
||||
#include <string>
|
||||
|
||||
#if __cplusplus >= 201703L
|
||||
#include <string_view>
|
||||
#endif // __cplusplus >= 201703L
|
||||
|
||||
std::string base64_encode (std::string const& s, bool url = false);
|
||||
std::string base64_encode_pem (std::string const& s);
|
||||
std::string base64_encode_mime(std::string const& s);
|
||||
|
||||
std::string base64_decode(std::string const& s, bool remove_linebreaks = false);
|
||||
std::string base64_encode(unsigned char const*, size_t len, bool url = false);
|
||||
|
||||
#if __cplusplus >= 201703L
|
||||
//
|
||||
// Interface with std::string_view rather than const std::string&
|
||||
// Requires C++17
|
||||
// Provided by Yannic Bonenberger (https://github.com/Yannic)
|
||||
//
|
||||
std::string base64_encode (std::string_view s, bool url = false);
|
||||
std::string base64_encode_pem (std::string_view s);
|
||||
std::string base64_encode_mime(std::string_view s);
|
||||
|
||||
std::string base64_decode(std::string_view s, bool remove_linebreaks = false);
|
||||
#endif // __cplusplus >= 201703L
|
||||
|
||||
#endif /* BASE64_H_C0CE2A47_D10E_42C9_A27C_C883944E704A */
|
||||
22
ext/miniz/LICENSE
Normal file
22
ext/miniz/LICENSE
Normal file
@@ -0,0 +1,22 @@
|
||||
Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
|
||||
|
||||
All Rights Reserved.
|
||||
|
||||
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:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in
|
||||
all copies or substantial portions of the Software.
|
||||
|
||||
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.
|
||||
@@ -187,6 +187,8 @@ const char *mz_version(void)
|
||||
|
||||
#ifndef MINIZ_NO_ZLIB_APIS
|
||||
|
||||
#ifndef MINIZ_NO_DEFLATE_APIS
|
||||
|
||||
int mz_deflateInit(mz_streamp pStream, int level)
|
||||
{
|
||||
return mz_deflateInit2(pStream, level, MZ_DEFLATED, MZ_DEFAULT_WINDOW_BITS, 9, MZ_DEFAULT_STRATEGY);
|
||||
@@ -321,7 +323,7 @@ int mz_compress2(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char
|
||||
memset(&stream, 0, sizeof(stream));
|
||||
|
||||
/* In case mz_ulong is 64-bits (argh I hate longs). */
|
||||
if ((source_len | *pDest_len) > 0xFFFFFFFFU)
|
||||
if ((mz_uint64)(source_len | *pDest_len) > 0xFFFFFFFFU)
|
||||
return MZ_PARAM_ERROR;
|
||||
|
||||
stream.next_in = pSource;
|
||||
@@ -354,6 +356,10 @@ mz_ulong mz_compressBound(mz_ulong source_len)
|
||||
return mz_deflateBound(NULL, source_len);
|
||||
}
|
||||
|
||||
#endif /*#ifndef MINIZ_NO_DEFLATE_APIS*/
|
||||
|
||||
#ifndef MINIZ_NO_INFLATE_APIS
|
||||
|
||||
typedef struct
|
||||
{
|
||||
tinfl_decompressor m_decomp;
|
||||
@@ -560,7 +566,7 @@ int mz_uncompress2(unsigned char *pDest, mz_ulong *pDest_len, const unsigned cha
|
||||
memset(&stream, 0, sizeof(stream));
|
||||
|
||||
/* In case mz_ulong is 64-bits (argh I hate longs). */
|
||||
if ((*pSource_len | *pDest_len) > 0xFFFFFFFFU)
|
||||
if ((mz_uint64)(*pSource_len | *pDest_len) > 0xFFFFFFFFU)
|
||||
return MZ_PARAM_ERROR;
|
||||
|
||||
stream.next_in = pSource;
|
||||
@@ -589,6 +595,8 @@ int mz_uncompress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char
|
||||
return mz_uncompress2(pDest, pDest_len, pSource, &source_len);
|
||||
}
|
||||
|
||||
#endif /*#ifndef MINIZ_NO_INFLATE_APIS*/
|
||||
|
||||
const char *mz_error(int err)
|
||||
{
|
||||
static struct
|
||||
@@ -666,6 +674,8 @@ const char *mz_error(int err)
|
||||
|
||||
|
||||
|
||||
#ifndef MINIZ_NO_DEFLATE_APIS
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
@@ -744,7 +754,7 @@ static tdefl_sym_freq *tdefl_radix_sort_syms(mz_uint num_syms, tdefl_sym_freq *p
|
||||
{
|
||||
mz_uint32 total_passes = 2, pass_shift, pass, i, hist[256 * 2];
|
||||
tdefl_sym_freq *pCur_syms = pSyms0, *pNew_syms = pSyms1;
|
||||
MZ_CLEAR_OBJ(hist);
|
||||
MZ_CLEAR_ARR(hist);
|
||||
for (i = 0; i < num_syms; i++)
|
||||
{
|
||||
mz_uint freq = pSyms0[i].m_key;
|
||||
@@ -862,7 +872,7 @@ static void tdefl_optimize_huffman_table(tdefl_compressor *d, int table_num, int
|
||||
{
|
||||
int i, j, l, num_codes[1 + TDEFL_MAX_SUPPORTED_HUFF_CODESIZE];
|
||||
mz_uint next_code[TDEFL_MAX_SUPPORTED_HUFF_CODESIZE + 1];
|
||||
MZ_CLEAR_OBJ(num_codes);
|
||||
MZ_CLEAR_ARR(num_codes);
|
||||
if (static_table)
|
||||
{
|
||||
for (i = 0; i < table_len; i++)
|
||||
@@ -888,8 +898,8 @@ static void tdefl_optimize_huffman_table(tdefl_compressor *d, int table_num, int
|
||||
|
||||
tdefl_huffman_enforce_max_code_size(num_codes, num_used_syms, code_size_limit);
|
||||
|
||||
MZ_CLEAR_OBJ(d->m_huff_code_sizes[table_num]);
|
||||
MZ_CLEAR_OBJ(d->m_huff_codes[table_num]);
|
||||
MZ_CLEAR_ARR(d->m_huff_code_sizes[table_num]);
|
||||
MZ_CLEAR_ARR(d->m_huff_codes[table_num]);
|
||||
for (i = 1, j = num_used_syms; i <= code_size_limit; i++)
|
||||
for (l = num_codes[i]; l > 0; l--)
|
||||
d->m_huff_code_sizes[table_num][pSyms[--j].m_sym_index] = (mz_uint8)(i);
|
||||
@@ -975,7 +985,7 @@ static void tdefl_optimize_huffman_table(tdefl_compressor *d, int table_num, int
|
||||
} \
|
||||
}
|
||||
|
||||
static mz_uint8 s_tdefl_packed_code_size_syms_swizzle[] = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
|
||||
static const mz_uint8 s_tdefl_packed_code_size_syms_swizzle[] = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
|
||||
|
||||
static void tdefl_start_dynamic_block(tdefl_compressor *d)
|
||||
{
|
||||
@@ -1113,7 +1123,8 @@ static mz_bool tdefl_compress_lz_codes(tdefl_compressor *d)
|
||||
if (flags & 1)
|
||||
{
|
||||
mz_uint s0, s1, n0, n1, sym, num_extra_bits;
|
||||
mz_uint match_len = pLZ_codes[0], match_dist = *(const mz_uint16 *)(pLZ_codes + 1);
|
||||
mz_uint match_len = pLZ_codes[0];
|
||||
mz_uint match_dist = (pLZ_codes[1] | (pLZ_codes[2] << 8));
|
||||
pLZ_codes += 3;
|
||||
|
||||
MZ_ASSERT(d->m_huff_code_sizes[0][s_tdefl_len_sym[match_len]]);
|
||||
@@ -1158,7 +1169,7 @@ static mz_bool tdefl_compress_lz_codes(tdefl_compressor *d)
|
||||
if (pOutput_buf >= d->m_pOutput_buf_end)
|
||||
return MZ_FALSE;
|
||||
|
||||
*(mz_uint64 *)pOutput_buf = bit_buffer;
|
||||
memcpy(pOutput_buf, &bit_buffer, sizeof(mz_uint64));
|
||||
pOutput_buf += (bits_in >> 3);
|
||||
bit_buffer >>= (bits_in & ~7);
|
||||
bits_in &= 7;
|
||||
@@ -1240,6 +1251,8 @@ static mz_bool tdefl_compress_block(tdefl_compressor *d, mz_bool static_block)
|
||||
return tdefl_compress_lz_codes(d);
|
||||
}
|
||||
|
||||
static const mz_uint s_tdefl_num_probes[11];
|
||||
|
||||
static int tdefl_flush_block(tdefl_compressor *d, int flush)
|
||||
{
|
||||
mz_uint saved_bit_buf, saved_bits_in;
|
||||
@@ -1260,8 +1273,27 @@ static int tdefl_flush_block(tdefl_compressor *d, int flush)
|
||||
|
||||
if ((d->m_flags & TDEFL_WRITE_ZLIB_HEADER) && (!d->m_block_index))
|
||||
{
|
||||
TDEFL_PUT_BITS(0x78, 8);
|
||||
TDEFL_PUT_BITS(0x01, 8);
|
||||
const mz_uint8 cmf = 0x78;
|
||||
mz_uint8 flg, flevel = 3;
|
||||
mz_uint header, i, mz_un = sizeof(s_tdefl_num_probes) / sizeof(mz_uint);
|
||||
|
||||
/* Determine compression level by reversing the process in tdefl_create_comp_flags_from_zip_params() */
|
||||
for (i = 0; i < mz_un; i++)
|
||||
if (s_tdefl_num_probes[i] == (d->m_flags & 0xFFF)) break;
|
||||
|
||||
if (i < 2)
|
||||
flevel = 0;
|
||||
else if (i < 6)
|
||||
flevel = 1;
|
||||
else if (i == 6)
|
||||
flevel = 2;
|
||||
|
||||
header = cmf << 8 | (flevel << 6);
|
||||
header += 31 - (header % 31);
|
||||
flg = header & 0xFF;
|
||||
|
||||
TDEFL_PUT_BITS(cmf, 8);
|
||||
TDEFL_PUT_BITS(flg, 8);
|
||||
}
|
||||
|
||||
TDEFL_PUT_BITS(flush == TDEFL_FINISH, 1);
|
||||
@@ -1732,7 +1764,7 @@ static mz_bool tdefl_compress_normal(tdefl_compressor *d)
|
||||
mz_uint dst_pos = (d->m_lookahead_pos + d->m_lookahead_size) & TDEFL_LZ_DICT_SIZE_MASK, ins_pos = d->m_lookahead_pos + d->m_lookahead_size - 2;
|
||||
mz_uint hash = (d->m_dict[ins_pos & TDEFL_LZ_DICT_SIZE_MASK] << TDEFL_LZ_HASH_SHIFT) ^ d->m_dict[(ins_pos + 1) & TDEFL_LZ_DICT_SIZE_MASK];
|
||||
mz_uint num_bytes_to_process = (mz_uint)MZ_MIN(src_buf_left, TDEFL_MAX_MATCH_LEN - d->m_lookahead_size);
|
||||
const mz_uint8 *pSrc_end = pSrc + num_bytes_to_process;
|
||||
const mz_uint8 *pSrc_end = pSrc ? pSrc + num_bytes_to_process : NULL;
|
||||
src_buf_left -= num_bytes_to_process;
|
||||
d->m_lookahead_size += num_bytes_to_process;
|
||||
while (pSrc != pSrc_end)
|
||||
@@ -1942,8 +1974,8 @@ tdefl_status tdefl_compress(tdefl_compressor *d, const void *pIn_buf, size_t *pI
|
||||
d->m_finished = (flush == TDEFL_FINISH);
|
||||
if (flush == TDEFL_FULL_FLUSH)
|
||||
{
|
||||
MZ_CLEAR_OBJ(d->m_hash);
|
||||
MZ_CLEAR_OBJ(d->m_next);
|
||||
MZ_CLEAR_ARR(d->m_hash);
|
||||
MZ_CLEAR_ARR(d->m_next);
|
||||
d->m_dict_size = 0;
|
||||
}
|
||||
}
|
||||
@@ -1966,7 +1998,7 @@ tdefl_status tdefl_init(tdefl_compressor *d, tdefl_put_buf_func_ptr pPut_buf_fun
|
||||
d->m_greedy_parsing = (flags & TDEFL_GREEDY_PARSING_FLAG) != 0;
|
||||
d->m_max_probes[1] = 1 + (((flags & 0xFFF) >> 2) + 2) / 3;
|
||||
if (!(flags & TDEFL_NONDETERMINISTIC_PARSING_FLAG))
|
||||
MZ_CLEAR_OBJ(d->m_hash);
|
||||
MZ_CLEAR_ARR(d->m_hash);
|
||||
d->m_lookahead_pos = d->m_lookahead_size = d->m_dict_size = d->m_total_lz_bytes = d->m_lz_code_buf_dict_pos = d->m_bits_in = 0;
|
||||
d->m_output_flush_ofs = d->m_output_flush_remaining = d->m_finished = d->m_block_index = d->m_bit_buffer = d->m_wants_to_finish = 0;
|
||||
d->m_pLZ_code_buf = d->m_lz_code_buf + 1;
|
||||
@@ -1987,7 +2019,7 @@ tdefl_status tdefl_init(tdefl_compressor *d, tdefl_put_buf_func_ptr pPut_buf_fun
|
||||
d->m_src_buf_left = 0;
|
||||
d->m_out_buf_ofs = 0;
|
||||
if (!(flags & TDEFL_NONDETERMINISTIC_PARSING_FLAG))
|
||||
MZ_CLEAR_OBJ(d->m_dict);
|
||||
MZ_CLEAR_ARR(d->m_dict);
|
||||
memset(&d->m_huff_count[0][0], 0, sizeof(d->m_huff_count[0][0]) * TDEFL_MAX_HUFF_SYMBOLS_0);
|
||||
memset(&d->m_huff_count[1][0], 0, sizeof(d->m_huff_count[1][0]) * TDEFL_MAX_HUFF_SYMBOLS_1);
|
||||
return TDEFL_STATUS_OKAY;
|
||||
@@ -2197,7 +2229,7 @@ void *tdefl_write_image_to_png_file_in_memory(const void *pImage, int w, int h,
|
||||
/* Allocate the tdefl_compressor and tinfl_decompressor structures in C so that */
|
||||
/* non-C language bindings to tdefL_ and tinfl_ API don't need to worry about */
|
||||
/* structure size and allocation mechanism. */
|
||||
tdefl_compressor *tdefl_compressor_alloc()
|
||||
tdefl_compressor *tdefl_compressor_alloc(void)
|
||||
{
|
||||
return (tdefl_compressor *)MZ_MALLOC(sizeof(tdefl_compressor));
|
||||
}
|
||||
@@ -2215,6 +2247,8 @@ void tdefl_compressor_free(tdefl_compressor *pComp)
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /*#ifndef MINIZ_NO_DEFLATE_APIS*/
|
||||
/**************************************************************************
|
||||
*
|
||||
* Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
@@ -2243,6 +2277,8 @@ void tdefl_compressor_free(tdefl_compressor *pComp)
|
||||
|
||||
|
||||
|
||||
#ifndef MINIZ_NO_INFLATE_APIS
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
@@ -2323,10 +2359,10 @@ extern "C" {
|
||||
/* It reads just enough bytes from the input stream that are needed to decode the next Huffman code (and absolutely no more). It works by trying to fully decode a */
|
||||
/* Huffman code by using whatever bits are currently present in the bit buffer. If this fails, it reads another byte, and tries again until it succeeds or until the */
|
||||
/* bit buffer contains >=15 bits (deflate's max. Huffman code size). */
|
||||
#define TINFL_HUFF_BITBUF_FILL(state_index, pHuff) \
|
||||
#define TINFL_HUFF_BITBUF_FILL(state_index, pLookUp, pTree) \
|
||||
do \
|
||||
{ \
|
||||
temp = (pHuff)->m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]; \
|
||||
temp = pLookUp[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]; \
|
||||
if (temp >= 0) \
|
||||
{ \
|
||||
code_len = temp >> 9; \
|
||||
@@ -2338,7 +2374,7 @@ extern "C" {
|
||||
code_len = TINFL_FAST_LOOKUP_BITS; \
|
||||
do \
|
||||
{ \
|
||||
temp = (pHuff)->m_tree[~temp + ((bit_buf >> code_len++) & 1)]; \
|
||||
temp = pTree[~temp + ((bit_buf >> code_len++) & 1)]; \
|
||||
} while ((temp < 0) && (num_bits >= (code_len + 1))); \
|
||||
if (temp >= 0) \
|
||||
break; \
|
||||
@@ -2354,7 +2390,7 @@ extern "C" {
|
||||
/* The slow path is only executed at the very end of the input buffer. */
|
||||
/* v1.16: The original macro handled the case at the very end of the passed-in input buffer, but we also need to handle the case where the user passes in 1+zillion bytes */
|
||||
/* following the deflate data and our non-conservative read-ahead path won't kick in here on this code. This is much trickier. */
|
||||
#define TINFL_HUFF_DECODE(state_index, sym, pHuff) \
|
||||
#define TINFL_HUFF_DECODE(state_index, sym, pLookUp, pTree) \
|
||||
do \
|
||||
{ \
|
||||
int temp; \
|
||||
@@ -2363,7 +2399,7 @@ extern "C" {
|
||||
{ \
|
||||
if ((pIn_buf_end - pIn_buf_cur) < 2) \
|
||||
{ \
|
||||
TINFL_HUFF_BITBUF_FILL(state_index, pHuff); \
|
||||
TINFL_HUFF_BITBUF_FILL(state_index, pLookUp, pTree); \
|
||||
} \
|
||||
else \
|
||||
{ \
|
||||
@@ -2372,14 +2408,14 @@ extern "C" {
|
||||
num_bits += 16; \
|
||||
} \
|
||||
} \
|
||||
if ((temp = (pHuff)->m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0) \
|
||||
if ((temp = pLookUp[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0) \
|
||||
code_len = temp >> 9, temp &= 511; \
|
||||
else \
|
||||
{ \
|
||||
code_len = TINFL_FAST_LOOKUP_BITS; \
|
||||
do \
|
||||
{ \
|
||||
temp = (pHuff)->m_tree[~temp + ((bit_buf >> code_len++) & 1)]; \
|
||||
temp = pTree[~temp + ((bit_buf >> code_len++) & 1)]; \
|
||||
} while (temp < 0); \
|
||||
} \
|
||||
sym = temp; \
|
||||
@@ -2388,20 +2424,33 @@ extern "C" {
|
||||
} \
|
||||
MZ_MACRO_END
|
||||
|
||||
static void tinfl_clear_tree(tinfl_decompressor *r)
|
||||
{
|
||||
if (r->m_type == 0)
|
||||
MZ_CLEAR_ARR(r->m_tree_0);
|
||||
else if (r->m_type == 1)
|
||||
MZ_CLEAR_ARR(r->m_tree_1);
|
||||
else
|
||||
MZ_CLEAR_ARR(r->m_tree_2);
|
||||
}
|
||||
|
||||
tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_next, size_t *pIn_buf_size, mz_uint8 *pOut_buf_start, mz_uint8 *pOut_buf_next, size_t *pOut_buf_size, const mz_uint32 decomp_flags)
|
||||
{
|
||||
static const int s_length_base[31] = { 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 };
|
||||
static const int s_length_extra[31] = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 0, 0 };
|
||||
static const int s_dist_base[32] = { 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0 };
|
||||
static const int s_dist_extra[32] = { 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13 };
|
||||
static const mz_uint16 s_length_base[31] = { 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0 };
|
||||
static const mz_uint8 s_length_extra[31] = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 0, 0 };
|
||||
static const mz_uint16 s_dist_base[32] = { 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0 };
|
||||
static const mz_uint8 s_dist_extra[32] = { 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13 };
|
||||
static const mz_uint8 s_length_dezigzag[19] = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
|
||||
static const int s_min_table_sizes[3] = { 257, 1, 4 };
|
||||
static const mz_uint16 s_min_table_sizes[3] = { 257, 1, 4 };
|
||||
|
||||
mz_int16 *pTrees[3];
|
||||
mz_uint8 *pCode_sizes[3];
|
||||
|
||||
tinfl_status status = TINFL_STATUS_FAILED;
|
||||
mz_uint32 num_bits, dist, counter, num_extra;
|
||||
tinfl_bit_buf_t bit_buf;
|
||||
const mz_uint8 *pIn_buf_cur = pIn_buf_next, *const pIn_buf_end = pIn_buf_next + *pIn_buf_size;
|
||||
mz_uint8 *pOut_buf_cur = pOut_buf_next, *const pOut_buf_end = pOut_buf_next + *pOut_buf_size;
|
||||
mz_uint8 *pOut_buf_cur = pOut_buf_next, *const pOut_buf_end = pOut_buf_next ? pOut_buf_next + *pOut_buf_size : NULL;
|
||||
size_t out_buf_size_mask = (decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF) ? (size_t)-1 : ((pOut_buf_next - pOut_buf_start) + *pOut_buf_size) - 1, dist_from_out_buf_start;
|
||||
|
||||
/* Ensure the output buffer's size is a power of 2, unless the output buffer is large enough to hold the entire output file (in which case it doesn't matter). */
|
||||
@@ -2411,6 +2460,13 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
return TINFL_STATUS_BAD_PARAM;
|
||||
}
|
||||
|
||||
pTrees[0] = r->m_tree_0;
|
||||
pTrees[1] = r->m_tree_1;
|
||||
pTrees[2] = r->m_tree_2;
|
||||
pCode_sizes[0] = r->m_code_size_0;
|
||||
pCode_sizes[1] = r->m_code_size_1;
|
||||
pCode_sizes[2] = r->m_code_size_2;
|
||||
|
||||
num_bits = r->m_num_bits;
|
||||
bit_buf = r->m_bit_buf;
|
||||
dist = r->m_dist;
|
||||
@@ -2427,7 +2483,7 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
TINFL_GET_BYTE(2, r->m_zhdr1);
|
||||
counter = (((r->m_zhdr0 * 256 + r->m_zhdr1) % 31 != 0) || (r->m_zhdr1 & 32) || ((r->m_zhdr0 & 15) != 8));
|
||||
if (!(decomp_flags & TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF))
|
||||
counter |= (((1U << (8U + (r->m_zhdr0 >> 4))) > 32768U) || ((out_buf_size_mask + 1) < (size_t)(1U << (8U + (r->m_zhdr0 >> 4)))));
|
||||
counter |= (((1U << (8U + (r->m_zhdr0 >> 4))) > 32768U) || ((out_buf_size_mask + 1) < (size_t)((size_t)1 << (8U + (r->m_zhdr0 >> 4)))));
|
||||
if (counter)
|
||||
{
|
||||
TINFL_CR_RETURN_FOREVER(36, TINFL_STATUS_FAILED);
|
||||
@@ -2488,11 +2544,11 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
{
|
||||
if (r->m_type == 1)
|
||||
{
|
||||
mz_uint8 *p = r->m_tables[0].m_code_size;
|
||||
mz_uint8 *p = r->m_code_size_0;
|
||||
mz_uint i;
|
||||
r->m_table_sizes[0] = 288;
|
||||
r->m_table_sizes[1] = 32;
|
||||
TINFL_MEMSET(r->m_tables[1].m_code_size, 5, 32);
|
||||
TINFL_MEMSET(r->m_code_size_1, 5, 32);
|
||||
for (i = 0; i <= 143; ++i)
|
||||
*p++ = 8;
|
||||
for (; i <= 255; ++i)
|
||||
@@ -2509,26 +2565,30 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
TINFL_GET_BITS(11, r->m_table_sizes[counter], "\05\05\04"[counter]);
|
||||
r->m_table_sizes[counter] += s_min_table_sizes[counter];
|
||||
}
|
||||
MZ_CLEAR_OBJ(r->m_tables[2].m_code_size);
|
||||
MZ_CLEAR_ARR(r->m_code_size_2);
|
||||
for (counter = 0; counter < r->m_table_sizes[2]; counter++)
|
||||
{
|
||||
mz_uint s;
|
||||
TINFL_GET_BITS(14, s, 3);
|
||||
r->m_tables[2].m_code_size[s_length_dezigzag[counter]] = (mz_uint8)s;
|
||||
r->m_code_size_2[s_length_dezigzag[counter]] = (mz_uint8)s;
|
||||
}
|
||||
r->m_table_sizes[2] = 19;
|
||||
}
|
||||
for (; (int)r->m_type >= 0; r->m_type--)
|
||||
{
|
||||
int tree_next, tree_cur;
|
||||
tinfl_huff_table *pTable;
|
||||
mz_int16 *pLookUp;
|
||||
mz_int16 *pTree;
|
||||
mz_uint8 *pCode_size;
|
||||
mz_uint i, j, used_syms, total, sym_index, next_code[17], total_syms[16];
|
||||
pTable = &r->m_tables[r->m_type];
|
||||
MZ_CLEAR_OBJ(total_syms);
|
||||
MZ_CLEAR_OBJ(pTable->m_look_up);
|
||||
MZ_CLEAR_OBJ(pTable->m_tree);
|
||||
pLookUp = r->m_look_up[r->m_type];
|
||||
pTree = pTrees[r->m_type];
|
||||
pCode_size = pCode_sizes[r->m_type];
|
||||
MZ_CLEAR_ARR(total_syms);
|
||||
TINFL_MEMSET(pLookUp, 0, sizeof(r->m_look_up[0]));
|
||||
tinfl_clear_tree(r);
|
||||
for (i = 0; i < r->m_table_sizes[r->m_type]; ++i)
|
||||
total_syms[pTable->m_code_size[i]]++;
|
||||
total_syms[pCode_size[i]]++;
|
||||
used_syms = 0, total = 0;
|
||||
next_code[0] = next_code[1] = 0;
|
||||
for (i = 1; i <= 15; ++i)
|
||||
@@ -2542,7 +2602,7 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
}
|
||||
for (tree_next = -1, sym_index = 0; sym_index < r->m_table_sizes[r->m_type]; ++sym_index)
|
||||
{
|
||||
mz_uint rev_code = 0, l, cur_code, code_size = pTable->m_code_size[sym_index];
|
||||
mz_uint rev_code = 0, l, cur_code, code_size = pCode_size[sym_index];
|
||||
if (!code_size)
|
||||
continue;
|
||||
cur_code = next_code[code_size]++;
|
||||
@@ -2553,14 +2613,14 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
mz_int16 k = (mz_int16)((code_size << 9) | sym_index);
|
||||
while (rev_code < TINFL_FAST_LOOKUP_SIZE)
|
||||
{
|
||||
pTable->m_look_up[rev_code] = k;
|
||||
pLookUp[rev_code] = k;
|
||||
rev_code += (1 << code_size);
|
||||
}
|
||||
continue;
|
||||
}
|
||||
if (0 == (tree_cur = pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)]))
|
||||
if (0 == (tree_cur = pLookUp[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)]))
|
||||
{
|
||||
pTable->m_look_up[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)] = (mz_int16)tree_next;
|
||||
pLookUp[rev_code & (TINFL_FAST_LOOKUP_SIZE - 1)] = (mz_int16)tree_next;
|
||||
tree_cur = tree_next;
|
||||
tree_next -= 2;
|
||||
}
|
||||
@@ -2568,24 +2628,24 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
for (j = code_size; j > (TINFL_FAST_LOOKUP_BITS + 1); j--)
|
||||
{
|
||||
tree_cur -= ((rev_code >>= 1) & 1);
|
||||
if (!pTable->m_tree[-tree_cur - 1])
|
||||
if (!pTree[-tree_cur - 1])
|
||||
{
|
||||
pTable->m_tree[-tree_cur - 1] = (mz_int16)tree_next;
|
||||
pTree[-tree_cur - 1] = (mz_int16)tree_next;
|
||||
tree_cur = tree_next;
|
||||
tree_next -= 2;
|
||||
}
|
||||
else
|
||||
tree_cur = pTable->m_tree[-tree_cur - 1];
|
||||
tree_cur = pTree[-tree_cur - 1];
|
||||
}
|
||||
tree_cur -= ((rev_code >>= 1) & 1);
|
||||
pTable->m_tree[-tree_cur - 1] = (mz_int16)sym_index;
|
||||
pTree[-tree_cur - 1] = (mz_int16)sym_index;
|
||||
}
|
||||
if (r->m_type == 2)
|
||||
{
|
||||
for (counter = 0; counter < (r->m_table_sizes[0] + r->m_table_sizes[1]);)
|
||||
{
|
||||
mz_uint s;
|
||||
TINFL_HUFF_DECODE(16, dist, &r->m_tables[2]);
|
||||
TINFL_HUFF_DECODE(16, dist, r->m_look_up[2], r->m_tree_2);
|
||||
if (dist < 16)
|
||||
{
|
||||
r->m_len_codes[counter++] = (mz_uint8)dist;
|
||||
@@ -2605,8 +2665,8 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
{
|
||||
TINFL_CR_RETURN_FOREVER(21, TINFL_STATUS_FAILED);
|
||||
}
|
||||
TINFL_MEMCPY(r->m_tables[0].m_code_size, r->m_len_codes, r->m_table_sizes[0]);
|
||||
TINFL_MEMCPY(r->m_tables[1].m_code_size, r->m_len_codes + r->m_table_sizes[0], r->m_table_sizes[1]);
|
||||
TINFL_MEMCPY(r->m_code_size_0, r->m_len_codes, r->m_table_sizes[0]);
|
||||
TINFL_MEMCPY(r->m_code_size_1, r->m_len_codes + r->m_table_sizes[0], r->m_table_sizes[1]);
|
||||
}
|
||||
}
|
||||
for (;;)
|
||||
@@ -2616,7 +2676,7 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
{
|
||||
if (((pIn_buf_end - pIn_buf_cur) < 4) || ((pOut_buf_end - pOut_buf_cur) < 2))
|
||||
{
|
||||
TINFL_HUFF_DECODE(23, counter, &r->m_tables[0]);
|
||||
TINFL_HUFF_DECODE(23, counter, r->m_look_up[0], r->m_tree_0);
|
||||
if (counter >= 256)
|
||||
break;
|
||||
while (pOut_buf_cur >= pOut_buf_end)
|
||||
@@ -2644,14 +2704,14 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
num_bits += 16;
|
||||
}
|
||||
#endif
|
||||
if ((sym2 = r->m_tables[0].m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
|
||||
if ((sym2 = r->m_look_up[0][bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
|
||||
code_len = sym2 >> 9;
|
||||
else
|
||||
{
|
||||
code_len = TINFL_FAST_LOOKUP_BITS;
|
||||
do
|
||||
{
|
||||
sym2 = r->m_tables[0].m_tree[~sym2 + ((bit_buf >> code_len++) & 1)];
|
||||
sym2 = r->m_tree_0[~sym2 + ((bit_buf >> code_len++) & 1)];
|
||||
} while (sym2 < 0);
|
||||
}
|
||||
counter = sym2;
|
||||
@@ -2668,14 +2728,14 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
num_bits += 16;
|
||||
}
|
||||
#endif
|
||||
if ((sym2 = r->m_tables[0].m_look_up[bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
|
||||
if ((sym2 = r->m_look_up[0][bit_buf & (TINFL_FAST_LOOKUP_SIZE - 1)]) >= 0)
|
||||
code_len = sym2 >> 9;
|
||||
else
|
||||
{
|
||||
code_len = TINFL_FAST_LOOKUP_BITS;
|
||||
do
|
||||
{
|
||||
sym2 = r->m_tables[0].m_tree[~sym2 + ((bit_buf >> code_len++) & 1)];
|
||||
sym2 = r->m_tree_0[~sym2 + ((bit_buf >> code_len++) & 1)];
|
||||
} while (sym2 < 0);
|
||||
}
|
||||
bit_buf >>= code_len;
|
||||
@@ -2704,7 +2764,7 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
counter += extra_bits;
|
||||
}
|
||||
|
||||
TINFL_HUFF_DECODE(26, dist, &r->m_tables[1]);
|
||||
TINFL_HUFF_DECODE(26, dist, r->m_look_up[1], r->m_tree_1);
|
||||
num_extra = s_dist_extra[dist];
|
||||
dist = s_dist_base[dist];
|
||||
if (num_extra)
|
||||
@@ -2789,7 +2849,7 @@ tinfl_status tinfl_decompress(tinfl_decompressor *r, const mz_uint8 *pIn_buf_nex
|
||||
--pIn_buf_cur;
|
||||
num_bits -= 8;
|
||||
}
|
||||
bit_buf &= (tinfl_bit_buf_t)((((mz_uint64)1) << num_bits) - (mz_uint64)1);
|
||||
bit_buf &= ~(~(tinfl_bit_buf_t)0 << num_bits);
|
||||
MZ_ASSERT(!num_bits); /* if this assert fires then we've read beyond the end of non-deflate/zlib streams with following data (such as gzip streams). */
|
||||
|
||||
if (decomp_flags & TINFL_FLAG_PARSE_ZLIB_HEADER)
|
||||
@@ -2821,7 +2881,7 @@ common_exit:
|
||||
}
|
||||
}
|
||||
r->m_num_bits = num_bits;
|
||||
r->m_bit_buf = bit_buf & (tinfl_bit_buf_t)((((mz_uint64)1) << num_bits) - (mz_uint64)1);
|
||||
r->m_bit_buf = bit_buf & ~(~(tinfl_bit_buf_t)0 << num_bits);
|
||||
r->m_dist = dist;
|
||||
r->m_counter = counter;
|
||||
r->m_num_extra = num_extra;
|
||||
@@ -2916,6 +2976,7 @@ int tinfl_decompress_mem_to_callback(const void *pIn_buf, size_t *pIn_buf_size,
|
||||
size_t in_buf_ofs = 0, dict_ofs = 0;
|
||||
if (!pDict)
|
||||
return TINFL_STATUS_FAILED;
|
||||
memset(pDict,0,TINFL_LZ_DICT_SIZE);
|
||||
tinfl_init(&decomp);
|
||||
for (;;)
|
||||
{
|
||||
@@ -2938,7 +2999,7 @@ int tinfl_decompress_mem_to_callback(const void *pIn_buf, size_t *pIn_buf_size,
|
||||
}
|
||||
|
||||
#ifndef MINIZ_NO_MALLOC
|
||||
tinfl_decompressor *tinfl_decompressor_alloc()
|
||||
tinfl_decompressor *tinfl_decompressor_alloc(void)
|
||||
{
|
||||
tinfl_decompressor *pDecomp = (tinfl_decompressor *)MZ_MALLOC(sizeof(tinfl_decompressor));
|
||||
if (pDecomp)
|
||||
@@ -2955,6 +3016,8 @@ void tinfl_decompressor_free(tinfl_decompressor *pDecomp)
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /*#ifndef MINIZ_NO_INFLATE_APIS*/
|
||||
/**************************************************************************
|
||||
*
|
||||
* Copyright 2013-2014 RAD Game Tools and Valve Software
|
||||
@@ -2997,19 +3060,48 @@ extern "C" {
|
||||
#include <sys/stat.h>
|
||||
|
||||
#if defined(_MSC_VER) || defined(__MINGW64__)
|
||||
|
||||
#define WIN32_LEAN_AND_MEAN
|
||||
#include <windows.h>
|
||||
|
||||
static WCHAR* mz_utf8z_to_widechar(const char* str)
|
||||
{
|
||||
int reqChars = MultiByteToWideChar(CP_UTF8, 0, str, -1, NULL, 0);
|
||||
WCHAR* wStr = (WCHAR*)malloc(reqChars * sizeof(WCHAR));
|
||||
MultiByteToWideChar(CP_UTF8, 0, str, -1, wStr, reqChars);
|
||||
return wStr;
|
||||
}
|
||||
|
||||
static FILE *mz_fopen(const char *pFilename, const char *pMode)
|
||||
{
|
||||
FILE *pFile = NULL;
|
||||
fopen_s(&pFile, pFilename, pMode);
|
||||
return pFile;
|
||||
WCHAR* wFilename = mz_utf8z_to_widechar(pFilename);
|
||||
WCHAR* wMode = mz_utf8z_to_widechar(pMode);
|
||||
FILE* pFile = NULL;
|
||||
errno_t err = _wfopen_s(&pFile, wFilename, wMode);
|
||||
free(wFilename);
|
||||
free(wMode);
|
||||
return err ? NULL : pFile;
|
||||
}
|
||||
|
||||
static FILE *mz_freopen(const char *pPath, const char *pMode, FILE *pStream)
|
||||
{
|
||||
FILE *pFile = NULL;
|
||||
if (freopen_s(&pFile, pPath, pMode, pStream))
|
||||
return NULL;
|
||||
return pFile;
|
||||
WCHAR* wPath = mz_utf8z_to_widechar(pPath);
|
||||
WCHAR* wMode = mz_utf8z_to_widechar(pMode);
|
||||
FILE* pFile = NULL;
|
||||
errno_t err = _wfreopen_s(&pFile, wPath, wMode, pStream);
|
||||
free(wPath);
|
||||
free(wMode);
|
||||
return err ? NULL : pFile;
|
||||
}
|
||||
|
||||
static int mz_stat64(const char *path, struct __stat64 *buffer)
|
||||
{
|
||||
WCHAR* wPath = mz_utf8z_to_widechar(path);
|
||||
int res = _wstat64(wPath, buffer);
|
||||
free(wPath);
|
||||
return res;
|
||||
}
|
||||
|
||||
#ifndef MINIZ_NO_TIME
|
||||
#include <sys/utime.h>
|
||||
#endif
|
||||
@@ -3020,11 +3112,12 @@ static FILE *mz_freopen(const char *pPath, const char *pMode, FILE *pStream)
|
||||
#define MZ_FTELL64 _ftelli64
|
||||
#define MZ_FSEEK64 _fseeki64
|
||||
#define MZ_FILE_STAT_STRUCT _stat64
|
||||
#define MZ_FILE_STAT _stat64
|
||||
#define MZ_FILE_STAT mz_stat64
|
||||
#define MZ_FFLUSH fflush
|
||||
#define MZ_FREOPEN mz_freopen
|
||||
#define MZ_DELETE_FILE remove
|
||||
#elif defined(__MINGW32__)
|
||||
|
||||
#elif defined(__MINGW32__) || defined(__WATCOMC__)
|
||||
#ifndef MINIZ_NO_TIME
|
||||
#include <sys/utime.h>
|
||||
#endif
|
||||
@@ -3032,13 +3125,14 @@ static FILE *mz_freopen(const char *pPath, const char *pMode, FILE *pStream)
|
||||
#define MZ_FCLOSE fclose
|
||||
#define MZ_FREAD fread
|
||||
#define MZ_FWRITE fwrite
|
||||
#define MZ_FTELL64 ftello64
|
||||
#define MZ_FSEEK64 fseeko64
|
||||
#define MZ_FILE_STAT_STRUCT _stat
|
||||
#define MZ_FILE_STAT _stat
|
||||
#define MZ_FTELL64 _ftelli64
|
||||
#define MZ_FSEEK64 _fseeki64
|
||||
#define MZ_FILE_STAT_STRUCT stat
|
||||
#define MZ_FILE_STAT stat
|
||||
#define MZ_FFLUSH fflush
|
||||
#define MZ_FREOPEN(f, m, s) freopen(f, m, s)
|
||||
#define MZ_DELETE_FILE remove
|
||||
|
||||
#elif defined(__TINYC__)
|
||||
#ifndef MINIZ_NO_TIME
|
||||
#include <sys/utime.h>
|
||||
@@ -3054,6 +3148,7 @@ static FILE *mz_freopen(const char *pPath, const char *pMode, FILE *pStream)
|
||||
#define MZ_FFLUSH fflush
|
||||
#define MZ_FREOPEN(f, m, s) freopen(f, m, s)
|
||||
#define MZ_DELETE_FILE remove
|
||||
|
||||
#elif defined(__USE_LARGEFILE64) /* gcc, clang */
|
||||
#ifndef MINIZ_NO_TIME
|
||||
#include <utime.h>
|
||||
@@ -3069,7 +3164,8 @@ static FILE *mz_freopen(const char *pPath, const char *pMode, FILE *pStream)
|
||||
#define MZ_FFLUSH fflush
|
||||
#define MZ_FREOPEN(p, m, s) freopen64(p, m, s)
|
||||
#define MZ_DELETE_FILE remove
|
||||
#elif defined(__APPLE__)
|
||||
|
||||
#elif defined(__APPLE__) || defined(__FreeBSD__)
|
||||
#ifndef MINIZ_NO_TIME
|
||||
#include <utime.h>
|
||||
#endif
|
||||
@@ -3215,7 +3311,7 @@ struct mz_zip_internal_state_tag
|
||||
mz_zip_array m_sorted_central_dir_offsets;
|
||||
|
||||
/* The flags passed in when the archive is initially opened. */
|
||||
uint32_t m_init_flags;
|
||||
mz_uint32 m_init_flags;
|
||||
|
||||
/* MZ_TRUE if the archive has a zip64 end of central directory headers, etc. */
|
||||
mz_bool m_zip64;
|
||||
@@ -3651,7 +3747,7 @@ static mz_bool mz_zip_reader_read_central_dir(mz_zip_archive *pZip, mz_uint flag
|
||||
if (((num_this_disk | cdir_disk_index) != 0) && ((num_this_disk != 1) || (cdir_disk_index != 1)))
|
||||
return mz_zip_set_error(pZip, MZ_ZIP_UNSUPPORTED_MULTIDISK);
|
||||
|
||||
if (cdir_size < pZip->m_total_files * MZ_ZIP_CENTRAL_DIR_HEADER_SIZE)
|
||||
if (cdir_size < (mz_uint64)pZip->m_total_files * MZ_ZIP_CENTRAL_DIR_HEADER_SIZE)
|
||||
return mz_zip_set_error(pZip, MZ_ZIP_INVALID_HEADER_OR_CORRUPTED);
|
||||
|
||||
if ((cdir_ofs + (mz_uint64)cdir_size) > pZip->m_archive_size)
|
||||
@@ -3802,7 +3898,7 @@ static mz_bool mz_zip_reader_read_central_dir(mz_zip_archive *pZip, mz_uint flag
|
||||
void mz_zip_zero_struct(mz_zip_archive *pZip)
|
||||
{
|
||||
if (pZip)
|
||||
MZ_CLEAR_OBJ(*pZip);
|
||||
MZ_CLEAR_PTR(pZip);
|
||||
}
|
||||
|
||||
static mz_bool mz_zip_reader_end_internal(mz_zip_archive *pZip, mz_bool set_last_error)
|
||||
@@ -4276,7 +4372,7 @@ static mz_bool mz_zip_locate_file_binary_search(mz_zip_archive *pZip, const char
|
||||
const mz_zip_array *pCentral_dir_offsets = &pState->m_central_dir_offsets;
|
||||
const mz_zip_array *pCentral_dir = &pState->m_central_dir;
|
||||
mz_uint32 *pIndices = &MZ_ZIP_ARRAY_ELEMENT(&pState->m_sorted_central_dir_offsets, mz_uint32, 0);
|
||||
const uint32_t size = pZip->m_total_files;
|
||||
const mz_uint32 size = pZip->m_total_files;
|
||||
const mz_uint filename_len = (mz_uint)strlen(pFilename);
|
||||
|
||||
if (pIndex)
|
||||
@@ -4291,7 +4387,7 @@ static mz_bool mz_zip_locate_file_binary_search(mz_zip_archive *pZip, const char
|
||||
while (l <= h)
|
||||
{
|
||||
mz_int64 m = l + ((h - l) >> 1);
|
||||
uint32_t file_index = pIndices[(uint32_t)m];
|
||||
mz_uint32 file_index = pIndices[(mz_uint32)m];
|
||||
|
||||
int comp = mz_zip_filename_compare(pCentral_dir, pCentral_dir_offsets, file_index, pFilename, filename_len);
|
||||
if (!comp)
|
||||
@@ -4384,7 +4480,8 @@ mz_bool mz_zip_reader_locate_file_v2(mz_zip_archive *pZip, const char *pName, co
|
||||
return mz_zip_set_error(pZip, MZ_ZIP_FILE_NOT_FOUND);
|
||||
}
|
||||
|
||||
mz_bool mz_zip_reader_extract_to_mem_no_alloc(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size)
|
||||
static
|
||||
mz_bool mz_zip_reader_extract_to_mem_no_alloc1(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size, const mz_zip_archive_file_stat *st)
|
||||
{
|
||||
int status = TINFL_STATUS_DONE;
|
||||
mz_uint64 needed_size, cur_file_ofs, comp_remaining, out_buf_ofs = 0, read_buf_size, read_buf_ofs = 0, read_buf_avail;
|
||||
@@ -4397,6 +4494,9 @@ mz_bool mz_zip_reader_extract_to_mem_no_alloc(mz_zip_archive *pZip, mz_uint file
|
||||
if ((!pZip) || (!pZip->m_pState) || ((buf_size) && (!pBuf)) || ((user_read_buf_size) && (!pUser_read_buf)) || (!pZip->m_pRead))
|
||||
return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
|
||||
|
||||
if (st) {
|
||||
file_stat = *st;
|
||||
} else
|
||||
if (!mz_zip_reader_file_stat(pZip, file_index, &file_stat))
|
||||
return MZ_FALSE;
|
||||
|
||||
@@ -4527,17 +4627,22 @@ mz_bool mz_zip_reader_extract_to_mem_no_alloc(mz_zip_archive *pZip, mz_uint file
|
||||
return status == TINFL_STATUS_DONE;
|
||||
}
|
||||
|
||||
mz_bool mz_zip_reader_extract_to_mem_no_alloc(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size)
|
||||
{
|
||||
return mz_zip_reader_extract_to_mem_no_alloc1(pZip, file_index, pBuf, buf_size, flags, pUser_read_buf, user_read_buf_size, NULL);
|
||||
}
|
||||
|
||||
mz_bool mz_zip_reader_extract_file_to_mem_no_alloc(mz_zip_archive *pZip, const char *pFilename, void *pBuf, size_t buf_size, mz_uint flags, void *pUser_read_buf, size_t user_read_buf_size)
|
||||
{
|
||||
mz_uint32 file_index;
|
||||
if (!mz_zip_reader_locate_file_v2(pZip, pFilename, NULL, flags, &file_index))
|
||||
return MZ_FALSE;
|
||||
return mz_zip_reader_extract_to_mem_no_alloc(pZip, file_index, pBuf, buf_size, flags, pUser_read_buf, user_read_buf_size);
|
||||
return mz_zip_reader_extract_to_mem_no_alloc1(pZip, file_index, pBuf, buf_size, flags, pUser_read_buf, user_read_buf_size, NULL);
|
||||
}
|
||||
|
||||
mz_bool mz_zip_reader_extract_to_mem(mz_zip_archive *pZip, mz_uint file_index, void *pBuf, size_t buf_size, mz_uint flags)
|
||||
{
|
||||
return mz_zip_reader_extract_to_mem_no_alloc(pZip, file_index, pBuf, buf_size, flags, NULL, 0);
|
||||
return mz_zip_reader_extract_to_mem_no_alloc1(pZip, file_index, pBuf, buf_size, flags, NULL, 0, NULL);
|
||||
}
|
||||
|
||||
mz_bool mz_zip_reader_extract_file_to_mem(mz_zip_archive *pZip, const char *pFilename, void *pBuf, size_t buf_size, mz_uint flags)
|
||||
@@ -4547,23 +4652,17 @@ mz_bool mz_zip_reader_extract_file_to_mem(mz_zip_archive *pZip, const char *pFil
|
||||
|
||||
void *mz_zip_reader_extract_to_heap(mz_zip_archive *pZip, mz_uint file_index, size_t *pSize, mz_uint flags)
|
||||
{
|
||||
mz_uint64 comp_size, uncomp_size, alloc_size;
|
||||
const mz_uint8 *p = mz_zip_get_cdh(pZip, file_index);
|
||||
mz_zip_archive_file_stat file_stat;
|
||||
mz_uint64 alloc_size;
|
||||
void *pBuf;
|
||||
|
||||
if (pSize)
|
||||
*pSize = 0;
|
||||
|
||||
if (!p)
|
||||
{
|
||||
mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
|
||||
if (!mz_zip_reader_file_stat(pZip, file_index, &file_stat))
|
||||
return NULL;
|
||||
}
|
||||
|
||||
comp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_COMPRESSED_SIZE_OFS);
|
||||
uncomp_size = MZ_READ_LE32(p + MZ_ZIP_CDH_DECOMPRESSED_SIZE_OFS);
|
||||
|
||||
alloc_size = (flags & MZ_ZIP_FLAG_COMPRESSED_DATA) ? comp_size : uncomp_size;
|
||||
alloc_size = (flags & MZ_ZIP_FLAG_COMPRESSED_DATA) ? file_stat.m_comp_size : file_stat.m_uncomp_size;
|
||||
if (((sizeof(size_t) == sizeof(mz_uint32))) && (alloc_size > 0x7FFFFFFF))
|
||||
{
|
||||
mz_zip_set_error(pZip, MZ_ZIP_INTERNAL_ERROR);
|
||||
@@ -4576,7 +4675,7 @@ void *mz_zip_reader_extract_to_heap(mz_zip_archive *pZip, mz_uint file_index, si
|
||||
return NULL;
|
||||
}
|
||||
|
||||
if (!mz_zip_reader_extract_to_mem(pZip, file_index, pBuf, (size_t)alloc_size, flags))
|
||||
if (!mz_zip_reader_extract_to_mem_no_alloc1(pZip, file_index, pBuf, (size_t)alloc_size, flags, NULL, 0, &file_stat))
|
||||
{
|
||||
pZip->m_pFree(pZip->m_pAlloc_opaque, pBuf);
|
||||
return NULL;
|
||||
@@ -5037,7 +5136,7 @@ size_t mz_zip_reader_extract_iter_read(mz_zip_reader_extract_iter_state* pState,
|
||||
size_t to_copy = MZ_MIN( (buf_size - copied_to_caller), pState->out_blk_remain );
|
||||
|
||||
/* Copy data to caller's buffer */
|
||||
memcpy( (uint8_t*)pvBuf + copied_to_caller, pWrite_buf_cur, to_copy );
|
||||
memcpy( (mz_uint8*)pvBuf + copied_to_caller, pWrite_buf_cur, to_copy );
|
||||
|
||||
#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
|
||||
/* Perform CRC */
|
||||
@@ -5406,7 +5505,7 @@ handle_failure:
|
||||
mz_bool mz_zip_validate_archive(mz_zip_archive *pZip, mz_uint flags)
|
||||
{
|
||||
mz_zip_internal_state *pState;
|
||||
uint32_t i;
|
||||
mz_uint32 i;
|
||||
|
||||
if ((!pZip) || (!pZip->m_pState) || (!pZip->m_pAlloc) || (!pZip->m_pFree) || (!pZip->m_pRead))
|
||||
return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
|
||||
@@ -5424,9 +5523,6 @@ mz_bool mz_zip_validate_archive(mz_zip_archive *pZip, mz_uint flags)
|
||||
}
|
||||
else
|
||||
{
|
||||
if (pZip->m_total_files >= MZ_UINT32_MAX)
|
||||
return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
|
||||
|
||||
if (pState->m_central_dir.m_size >= MZ_UINT32_MAX)
|
||||
return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE);
|
||||
}
|
||||
@@ -5788,7 +5884,7 @@ mz_bool mz_zip_writer_init_file_v2(mz_zip_archive *pZip, const char *pFilename,
|
||||
mz_uint64 cur_ofs = 0;
|
||||
char buf[4096];
|
||||
|
||||
MZ_CLEAR_OBJ(buf);
|
||||
MZ_CLEAR_ARR(buf);
|
||||
|
||||
do
|
||||
{
|
||||
@@ -6151,7 +6247,7 @@ mz_bool mz_zip_writer_add_mem_ex_v2(mz_zip_archive *pZip, const char *pArchive_n
|
||||
pState->m_zip64 = MZ_TRUE;
|
||||
/*return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES); */
|
||||
}
|
||||
if ((buf_size > 0xFFFFFFFF) || (uncomp_size > 0xFFFFFFFF))
|
||||
if (((mz_uint64)buf_size > 0xFFFFFFFF) || (uncomp_size > 0xFFFFFFFF))
|
||||
{
|
||||
pState->m_zip64 = MZ_TRUE;
|
||||
/*return mz_zip_set_error(pZip, MZ_ZIP_ARCHIVE_TOO_LARGE); */
|
||||
@@ -6244,7 +6340,7 @@ mz_bool mz_zip_writer_add_mem_ex_v2(mz_zip_archive *pZip, const char *pArchive_n
|
||||
}
|
||||
cur_archive_file_ofs += num_alignment_padding_bytes;
|
||||
|
||||
MZ_CLEAR_OBJ(local_dir_header);
|
||||
MZ_CLEAR_ARR(local_dir_header);
|
||||
|
||||
if (!store_data_uncompressed || (level_and_flags & MZ_ZIP_FLAG_COMPRESSED_DATA))
|
||||
{
|
||||
@@ -6394,7 +6490,7 @@ mz_bool mz_zip_writer_add_mem_ex_v2(mz_zip_archive *pZip, const char *pArchive_n
|
||||
mz_bool mz_zip_writer_add_read_buf_callback(mz_zip_archive *pZip, const char *pArchive_name, mz_file_read_func read_callback, void* callback_opaque, mz_uint64 max_size, const MZ_TIME_T *pFile_time, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags,
|
||||
const char *user_extra_data, mz_uint user_extra_data_len, const char *user_extra_data_central, mz_uint user_extra_data_central_len)
|
||||
{
|
||||
mz_uint16 gen_flags = (level_and_flags & MZ_ZIP_FLAG_WRITE_HEADER_SET_SIZE) ? 0 : MZ_ZIP_LDH_BIT_FLAG_HAS_LOCATOR;
|
||||
mz_uint16 gen_flags;
|
||||
mz_uint uncomp_crc32 = MZ_CRC32_INIT, level, num_alignment_padding_bytes;
|
||||
mz_uint16 method = 0, dos_time = 0, dos_date = 0, ext_attributes = 0;
|
||||
mz_uint64 local_dir_header_ofs, cur_archive_file_ofs = pZip->m_archive_size, uncomp_size = 0, comp_size = 0;
|
||||
@@ -6406,13 +6502,15 @@ mz_bool mz_zip_writer_add_read_buf_callback(mz_zip_archive *pZip, const char *pA
|
||||
mz_zip_internal_state *pState;
|
||||
mz_uint64 file_ofs = 0, cur_archive_header_file_ofs;
|
||||
|
||||
if (!(level_and_flags & MZ_ZIP_FLAG_ASCII_FILENAME))
|
||||
gen_flags |= MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_UTF8;
|
||||
|
||||
if ((int)level_and_flags < 0)
|
||||
level_and_flags = MZ_DEFAULT_LEVEL;
|
||||
level = level_and_flags & 0xF;
|
||||
|
||||
gen_flags = (level_and_flags & MZ_ZIP_FLAG_WRITE_HEADER_SET_SIZE) ? 0 : MZ_ZIP_LDH_BIT_FLAG_HAS_LOCATOR;
|
||||
|
||||
if (!(level_and_flags & MZ_ZIP_FLAG_ASCII_FILENAME))
|
||||
gen_flags |= MZ_ZIP_GENERAL_PURPOSE_BIT_FLAG_UTF8;
|
||||
|
||||
/* Sanity checks */
|
||||
if ((!pZip) || (!pZip->m_pState) || (pZip->m_zip_mode != MZ_ZIP_MODE_WRITING) || (!pArchive_name) || ((comment_size) && (!pComment)) || (level > MZ_UBER_COMPRESSION))
|
||||
return mz_zip_set_error(pZip, MZ_ZIP_INVALID_PARAMETER);
|
||||
@@ -6497,7 +6595,7 @@ mz_bool mz_zip_writer_add_read_buf_callback(mz_zip_archive *pZip, const char *pA
|
||||
method = MZ_DEFLATED;
|
||||
}
|
||||
|
||||
MZ_CLEAR_OBJ(local_dir_header);
|
||||
MZ_CLEAR_ARR(local_dir_header);
|
||||
if (pState->m_zip64)
|
||||
{
|
||||
if (max_size >= MZ_UINT32_MAX || local_dir_header_ofs >= MZ_UINT32_MAX)
|
||||
@@ -6801,7 +6899,7 @@ mz_bool mz_zip_writer_add_file(mz_zip_archive *pZip, const char *pArchive_name,
|
||||
}
|
||||
#endif /* #ifndef MINIZ_NO_STDIO */
|
||||
|
||||
static mz_bool mz_zip_writer_update_zip64_extension_block(mz_zip_array *pNew_ext, mz_zip_archive *pZip, const mz_uint8 *pExt, uint32_t ext_len, mz_uint64 *pComp_size, mz_uint64 *pUncomp_size, mz_uint64 *pLocal_header_ofs, mz_uint32 *pDisk_start)
|
||||
static mz_bool mz_zip_writer_update_zip64_extension_block(mz_zip_array *pNew_ext, mz_zip_archive *pZip, const mz_uint8 *pExt, mz_uint32 ext_len, mz_uint64 *pComp_size, mz_uint64 *pUncomp_size, mz_uint64 *pLocal_header_ofs, mz_uint32 *pDisk_start)
|
||||
{
|
||||
/* + 64 should be enough for any new zip64 data */
|
||||
if (!mz_zip_array_reserve(pZip, pNew_ext, ext_len + 64, MZ_FALSE))
|
||||
@@ -7117,10 +7215,10 @@ mz_bool mz_zip_writer_add_from_zip_reader(mz_zip_archive *pZip, mz_zip_archive *
|
||||
if (pZip->m_pState->m_zip64)
|
||||
{
|
||||
/* dest is zip64, so upgrade the data descriptor */
|
||||
const mz_uint32 *pSrc_descriptor = (const mz_uint32 *)((const mz_uint8 *)pBuf + (has_id ? sizeof(mz_uint32) : 0));
|
||||
const mz_uint32 src_crc32 = pSrc_descriptor[0];
|
||||
const mz_uint64 src_comp_size = pSrc_descriptor[1];
|
||||
const mz_uint64 src_uncomp_size = pSrc_descriptor[2];
|
||||
const mz_uint8 *pSrc_descriptor = (const mz_uint8 *)pBuf + (has_id ? sizeof(mz_uint32) : 0);
|
||||
const mz_uint32 src_crc32 = MZ_READ_LE32(pSrc_descriptor);
|
||||
const mz_uint64 src_comp_size = MZ_READ_LE32(pSrc_descriptor + sizeof(mz_uint32));
|
||||
const mz_uint64 src_uncomp_size = MZ_READ_LE32(pSrc_descriptor + 2*sizeof(mz_uint32));
|
||||
|
||||
mz_write_le32((mz_uint8 *)pBuf, MZ_ZIP_DATA_DESCRIPTOR_ID);
|
||||
mz_write_le32((mz_uint8 *)pBuf + sizeof(mz_uint32) * 1, src_crc32);
|
||||
@@ -7256,7 +7354,7 @@ mz_bool mz_zip_writer_finalize_archive(mz_zip_archive *pZip)
|
||||
|
||||
if (pState->m_zip64)
|
||||
{
|
||||
if ((pZip->m_total_files > MZ_UINT32_MAX) || (pState->m_central_dir.m_size >= MZ_UINT32_MAX))
|
||||
if ((mz_uint64)pState->m_central_dir.m_size >= MZ_UINT32_MAX)
|
||||
return mz_zip_set_error(pZip, MZ_ZIP_TOO_MANY_FILES);
|
||||
}
|
||||
else
|
||||
@@ -7284,7 +7382,7 @@ mz_bool mz_zip_writer_finalize_archive(mz_zip_archive *pZip)
|
||||
/* Write zip64 end of central directory header */
|
||||
mz_uint64 rel_ofs_to_zip64_ecdr = pZip->m_archive_size;
|
||||
|
||||
MZ_CLEAR_OBJ(hdr);
|
||||
MZ_CLEAR_ARR(hdr);
|
||||
MZ_WRITE_LE32(hdr + MZ_ZIP64_ECDH_SIG_OFS, MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIG);
|
||||
MZ_WRITE_LE64(hdr + MZ_ZIP64_ECDH_SIZE_OF_RECORD_OFS, MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE - sizeof(mz_uint32) - sizeof(mz_uint64));
|
||||
MZ_WRITE_LE16(hdr + MZ_ZIP64_ECDH_VERSION_MADE_BY_OFS, 0x031E); /* TODO: always Unix */
|
||||
@@ -7299,7 +7397,7 @@ mz_bool mz_zip_writer_finalize_archive(mz_zip_archive *pZip)
|
||||
pZip->m_archive_size += MZ_ZIP64_END_OF_CENTRAL_DIR_HEADER_SIZE;
|
||||
|
||||
/* Write zip64 end of central directory locator */
|
||||
MZ_CLEAR_OBJ(hdr);
|
||||
MZ_CLEAR_ARR(hdr);
|
||||
MZ_WRITE_LE32(hdr + MZ_ZIP64_ECDL_SIG_OFS, MZ_ZIP64_END_OF_CENTRAL_DIR_LOCATOR_SIG);
|
||||
MZ_WRITE_LE64(hdr + MZ_ZIP64_ECDL_REL_OFS_TO_ZIP64_ECDR_OFS, rel_ofs_to_zip64_ecdr);
|
||||
MZ_WRITE_LE32(hdr + MZ_ZIP64_ECDL_TOTAL_NUMBER_OF_DISKS_OFS, 1);
|
||||
@@ -7310,7 +7408,7 @@ mz_bool mz_zip_writer_finalize_archive(mz_zip_archive *pZip)
|
||||
}
|
||||
|
||||
/* Write end of central directory record */
|
||||
MZ_CLEAR_OBJ(hdr);
|
||||
MZ_CLEAR_ARR(hdr);
|
||||
MZ_WRITE_LE32(hdr + MZ_ZIP_ECDH_SIG_OFS, MZ_ZIP_END_OF_CENTRAL_DIR_HEADER_SIG);
|
||||
MZ_WRITE_LE16(hdr + MZ_ZIP_ECDH_CDIR_NUM_ENTRIES_ON_DISK_OFS, MZ_MIN(MZ_UINT16_MAX, pZip->m_total_files));
|
||||
MZ_WRITE_LE16(hdr + MZ_ZIP_ECDH_CDIR_TOTAL_ENTRIES_OFS, MZ_MIN(MZ_UINT16_MAX, pZip->m_total_files));
|
||||
@@ -7626,7 +7724,9 @@ const char *mz_zip_get_error_string(mz_zip_error mz_err)
|
||||
case MZ_ZIP_VALIDATION_FAILED:
|
||||
return "validation failed";
|
||||
case MZ_ZIP_WRITE_CALLBACK_FAILED:
|
||||
return "write calledback failed";
|
||||
return "write callback failed";
|
||||
case MZ_ZIP_TOTAL_ERRORS:
|
||||
return "total errors";
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
@@ -1,5 +1,7 @@
|
||||
#ifndef MINIZ_EXPORT
|
||||
#define MINIZ_EXPORT
|
||||
/* miniz.c 2.2.0 - public domain deflate/inflate, zlib-subset, ZIP reading/writing/appending, PNG writing
|
||||
#endif
|
||||
/* miniz.c 3.0.2 - public domain deflate/inflate, zlib-subset, ZIP reading/writing/appending, PNG writing
|
||||
See "unlicense" statement at the end of this file.
|
||||
Rich Geldreich <richgel99@gmail.com>, last updated Oct. 13, 2013
|
||||
Implements RFC 1950: http://www.ietf.org/rfc/rfc1950.txt and RFC 1951: http://www.ietf.org/rfc/rfc1951.txt
|
||||
@@ -116,7 +118,7 @@
|
||||
|
||||
|
||||
/* Defines to completely disable specific portions of miniz.c:
|
||||
If all macros here are defined the only functionality remaining will be CRC-32, adler-32, tinfl, and tdefl. */
|
||||
If all macros here are defined the only functionality remaining will be CRC-32 and adler-32. */
|
||||
|
||||
/* Define MINIZ_NO_STDIO to disable all usage and any functions which rely on stdio for file I/O. */
|
||||
/*#define MINIZ_NO_STDIO */
|
||||
@@ -126,6 +128,12 @@
|
||||
/* The current downside is the times written to your archives will be from 1979. */
|
||||
/*#define MINIZ_NO_TIME */
|
||||
|
||||
/* Define MINIZ_NO_DEFLATE_APIS to disable all compression API's. */
|
||||
/*#define MINIZ_NO_DEFLATE_APIS */
|
||||
|
||||
/* Define MINIZ_NO_INFLATE_APIS to disable all decompression API's. */
|
||||
/*#define MINIZ_NO_INFLATE_APIS */
|
||||
|
||||
/* Define MINIZ_NO_ARCHIVE_APIS to disable all ZIP archive API's. */
|
||||
/*#define MINIZ_NO_ARCHIVE_APIS */
|
||||
|
||||
@@ -144,6 +152,14 @@
|
||||
functions (such as tdefl_compress_mem_to_heap() and tinfl_decompress_mem_to_heap()) won't work. */
|
||||
/*#define MINIZ_NO_MALLOC */
|
||||
|
||||
#ifdef MINIZ_NO_INFLATE_APIS
|
||||
#define MINIZ_NO_ARCHIVE_APIS
|
||||
#endif
|
||||
|
||||
#ifdef MINIZ_NO_DEFLATE_APIS
|
||||
#define MINIZ_NO_ARCHIVE_WRITING_APIS
|
||||
#endif
|
||||
|
||||
#if defined(__TINYC__) && (defined(__linux) || defined(__linux__))
|
||||
/* TODO: Work around "error: include file 'sys\utime.h' when compiling with tcc on Linux */
|
||||
#define MINIZ_NO_TIME
|
||||
@@ -162,18 +178,40 @@
|
||||
#define MINIZ_X86_OR_X64_CPU 0
|
||||
#endif
|
||||
|
||||
#if (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__) || MINIZ_X86_OR_X64_CPU
|
||||
/* Set MINIZ_LITTLE_ENDIAN only if not set */
|
||||
#if !defined(MINIZ_LITTLE_ENDIAN)
|
||||
#if defined(__BYTE_ORDER__) && defined(__ORDER_LITTLE_ENDIAN__)
|
||||
|
||||
#if (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)
|
||||
/* Set MINIZ_LITTLE_ENDIAN to 1 if the processor is little endian. */
|
||||
#define MINIZ_LITTLE_ENDIAN 1
|
||||
#else
|
||||
#define MINIZ_LITTLE_ENDIAN 0
|
||||
#endif
|
||||
|
||||
#else
|
||||
|
||||
#if MINIZ_X86_OR_X64_CPU
|
||||
#define MINIZ_LITTLE_ENDIAN 1
|
||||
#else
|
||||
#define MINIZ_LITTLE_ENDIAN 0
|
||||
#endif
|
||||
|
||||
#endif
|
||||
#endif
|
||||
|
||||
/* Using unaligned loads and stores causes errors when using UBSan */
|
||||
#if defined(__has_feature)
|
||||
#if __has_feature(undefined_behavior_sanitizer)
|
||||
#define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 0
|
||||
#endif
|
||||
#endif
|
||||
|
||||
/* Set MINIZ_USE_UNALIGNED_LOADS_AND_STORES only if not set */
|
||||
#if !defined(MINIZ_USE_UNALIGNED_LOADS_AND_STORES)
|
||||
#if MINIZ_X86_OR_X64_CPU
|
||||
/* Set MINIZ_USE_UNALIGNED_LOADS_AND_STORES to 1 on CPU's that permit efficient integer loads and stores from unaligned addresses. */
|
||||
#define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 1
|
||||
#define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 0
|
||||
#define MINIZ_UNALIGNED_USE_MEMCPY
|
||||
#else
|
||||
#define MINIZ_USE_UNALIGNED_LOADS_AND_STORES 0
|
||||
@@ -237,9 +275,9 @@ enum
|
||||
MZ_DEFAULT_COMPRESSION = -1
|
||||
};
|
||||
|
||||
#define MZ_VERSION "10.2.0"
|
||||
#define MZ_VERNUM 0xA100
|
||||
#define MZ_VER_MAJOR 10
|
||||
#define MZ_VERSION "11.0.2"
|
||||
#define MZ_VERNUM 0xB002
|
||||
#define MZ_VER_MAJOR 11
|
||||
#define MZ_VER_MINOR 2
|
||||
#define MZ_VER_REVISION 0
|
||||
#define MZ_VER_SUBREVISION 0
|
||||
@@ -305,6 +343,8 @@ typedef mz_stream *mz_streamp;
|
||||
/* Returns the version string of miniz.c. */
|
||||
MINIZ_EXPORT const char *mz_version(void);
|
||||
|
||||
#ifndef MINIZ_NO_DEFLATE_APIS
|
||||
|
||||
/* mz_deflateInit() initializes a compressor with default options: */
|
||||
/* Parameters: */
|
||||
/* pStream must point to an initialized mz_stream struct. */
|
||||
@@ -357,6 +397,10 @@ MINIZ_EXPORT int mz_compress2(unsigned char *pDest, mz_ulong *pDest_len, const u
|
||||
/* mz_compressBound() returns a (very) conservative upper bound on the amount of data that could be generated by calling mz_compress(). */
|
||||
MINIZ_EXPORT mz_ulong mz_compressBound(mz_ulong source_len);
|
||||
|
||||
#endif /*#ifndef MINIZ_NO_DEFLATE_APIS*/
|
||||
|
||||
#ifndef MINIZ_NO_INFLATE_APIS
|
||||
|
||||
/* Initializes a decompressor. */
|
||||
MINIZ_EXPORT int mz_inflateInit(mz_streamp pStream);
|
||||
|
||||
@@ -390,6 +434,7 @@ MINIZ_EXPORT int mz_inflateEnd(mz_streamp pStream);
|
||||
/* Returns MZ_OK on success, or one of the error codes from mz_inflate() on failure. */
|
||||
MINIZ_EXPORT int mz_uncompress(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong source_len);
|
||||
MINIZ_EXPORT int mz_uncompress2(unsigned char *pDest, mz_ulong *pDest_len, const unsigned char *pSource, mz_ulong *pSource_len);
|
||||
#endif /*#ifndef MINIZ_NO_INFLATE_APIS*/
|
||||
|
||||
/* Returns a string description of the specified error code, or NULL if the error code is invalid. */
|
||||
MINIZ_EXPORT const char *mz_error(int err);
|
||||
@@ -440,6 +485,8 @@ typedef void *const voidpc;
|
||||
#define free_func mz_free_func
|
||||
#define internal_state mz_internal_state
|
||||
#define z_stream mz_stream
|
||||
|
||||
#ifndef MINIZ_NO_DEFLATE_APIS
|
||||
#define deflateInit mz_deflateInit
|
||||
#define deflateInit2 mz_deflateInit2
|
||||
#define deflateReset mz_deflateReset
|
||||
@@ -449,6 +496,9 @@ typedef void *const voidpc;
|
||||
#define compress mz_compress
|
||||
#define compress2 mz_compress2
|
||||
#define compressBound mz_compressBound
|
||||
#endif /*#ifndef MINIZ_NO_DEFLATE_APIS*/
|
||||
|
||||
#ifndef MINIZ_NO_INFLATE_APIS
|
||||
#define inflateInit mz_inflateInit
|
||||
#define inflateInit2 mz_inflateInit2
|
||||
#define inflateReset mz_inflateReset
|
||||
@@ -456,6 +506,8 @@ typedef void *const voidpc;
|
||||
#define inflateEnd mz_inflateEnd
|
||||
#define uncompress mz_uncompress
|
||||
#define uncompress2 mz_uncompress2
|
||||
#endif /*#ifndef MINIZ_NO_INFLATE_APIS*/
|
||||
|
||||
#define crc32 mz_crc32
|
||||
#define adler32 mz_adler32
|
||||
#define MAX_WBITS 15
|
||||
@@ -519,7 +571,8 @@ typedef int mz_bool;
|
||||
#ifdef MINIZ_NO_TIME
|
||||
typedef struct mz_dummy_time_t_tag
|
||||
{
|
||||
int m_dummy;
|
||||
mz_uint32 m_dummy1;
|
||||
mz_uint32 m_dummy2;
|
||||
} mz_dummy_time_t;
|
||||
#define MZ_TIME_T mz_dummy_time_t
|
||||
#else
|
||||
@@ -541,6 +594,8 @@ typedef struct mz_dummy_time_t_tag
|
||||
#define MZ_MAX(a, b) (((a) > (b)) ? (a) : (b))
|
||||
#define MZ_MIN(a, b) (((a) < (b)) ? (a) : (b))
|
||||
#define MZ_CLEAR_OBJ(obj) memset(&(obj), 0, sizeof(obj))
|
||||
#define MZ_CLEAR_ARR(obj) memset((obj), 0, sizeof(obj))
|
||||
#define MZ_CLEAR_PTR(obj) memset((obj), 0, sizeof(*obj))
|
||||
|
||||
#if MINIZ_USE_UNALIGNED_LOADS_AND_STORES && MINIZ_LITTLE_ENDIAN
|
||||
#define MZ_READ_LE16(p) *((const mz_uint16 *)(p))
|
||||
@@ -577,6 +632,8 @@ extern MINIZ_EXPORT void *miniz_def_realloc_func(void *opaque, void *address, si
|
||||
#pragma once
|
||||
|
||||
|
||||
#ifndef MINIZ_NO_DEFLATE_APIS
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
@@ -764,10 +821,14 @@ MINIZ_EXPORT void tdefl_compressor_free(tdefl_compressor *pComp);
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /*#ifndef MINIZ_NO_DEFLATE_APIS*/
|
||||
#pragma once
|
||||
|
||||
/* ------------------- Low-level Decompression API Definitions */
|
||||
|
||||
#ifndef MINIZ_NO_INFLATE_APIS
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
@@ -876,12 +937,6 @@ enum
|
||||
TINFL_FAST_LOOKUP_SIZE = 1 << TINFL_FAST_LOOKUP_BITS
|
||||
};
|
||||
|
||||
typedef struct
|
||||
{
|
||||
mz_uint8 m_code_size[TINFL_MAX_HUFF_SYMBOLS_0];
|
||||
mz_int16 m_look_up[TINFL_FAST_LOOKUP_SIZE], m_tree[TINFL_MAX_HUFF_SYMBOLS_0 * 2];
|
||||
} tinfl_huff_table;
|
||||
|
||||
#if MINIZ_HAS_64BIT_REGISTERS
|
||||
#define TINFL_USE_64BIT_BITBUF 1
|
||||
#else
|
||||
@@ -901,7 +956,13 @@ struct tinfl_decompressor_tag
|
||||
mz_uint32 m_state, m_num_bits, m_zhdr0, m_zhdr1, m_z_adler32, m_final, m_type, m_check_adler32, m_dist, m_counter, m_num_extra, m_table_sizes[TINFL_MAX_HUFF_TABLES];
|
||||
tinfl_bit_buf_t m_bit_buf;
|
||||
size_t m_dist_from_out_buf_start;
|
||||
tinfl_huff_table m_tables[TINFL_MAX_HUFF_TABLES];
|
||||
mz_int16 m_look_up[TINFL_MAX_HUFF_TABLES][TINFL_FAST_LOOKUP_SIZE];
|
||||
mz_int16 m_tree_0[TINFL_MAX_HUFF_SYMBOLS_0 * 2];
|
||||
mz_int16 m_tree_1[TINFL_MAX_HUFF_SYMBOLS_1 * 2];
|
||||
mz_int16 m_tree_2[TINFL_MAX_HUFF_SYMBOLS_2 * 2];
|
||||
mz_uint8 m_code_size_0[TINFL_MAX_HUFF_SYMBOLS_0];
|
||||
mz_uint8 m_code_size_1[TINFL_MAX_HUFF_SYMBOLS_1];
|
||||
mz_uint8 m_code_size_2[TINFL_MAX_HUFF_SYMBOLS_2];
|
||||
mz_uint8 m_raw_header[4], m_len_codes[TINFL_MAX_HUFF_SYMBOLS_0 + TINFL_MAX_HUFF_SYMBOLS_1 + 137];
|
||||
};
|
||||
|
||||
@@ -909,6 +970,8 @@ struct tinfl_decompressor_tag
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /*#ifndef MINIZ_NO_INFLATE_APIS*/
|
||||
|
||||
#pragma once
|
||||
|
||||
|
||||
@@ -942,10 +1005,6 @@ typedef struct
|
||||
mz_uint16 m_bit_flag;
|
||||
mz_uint16 m_method;
|
||||
|
||||
#ifndef MINIZ_NO_TIME
|
||||
MZ_TIME_T m_time;
|
||||
#endif
|
||||
|
||||
/* CRC-32 of uncompressed data. */
|
||||
mz_uint32 m_crc32;
|
||||
|
||||
@@ -982,6 +1041,11 @@ typedef struct
|
||||
/* Guaranteed to be zero terminated, may be truncated to fit. */
|
||||
char m_comment[MZ_ZIP_MAX_ARCHIVE_FILE_COMMENT_SIZE];
|
||||
|
||||
#ifdef MINIZ_NO_TIME
|
||||
MZ_TIME_T m_padding;
|
||||
#else
|
||||
MZ_TIME_T m_time;
|
||||
#endif
|
||||
} mz_zip_archive_file_stat;
|
||||
|
||||
typedef size_t (*mz_file_read_func)(void *pOpaque, mz_uint64 file_ofs, void *pBuf, size_t n);
|
||||
@@ -1093,9 +1157,7 @@ typedef struct
|
||||
mz_uint flags;
|
||||
|
||||
int status;
|
||||
#ifndef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
|
||||
mz_uint file_crc32;
|
||||
#endif
|
||||
|
||||
mz_uint64 read_buf_size, read_buf_ofs, read_buf_avail, comp_remaining, out_buf_ofs, cur_file_ofs;
|
||||
mz_zip_archive_file_stat file_stat;
|
||||
void *pRead_buf;
|
||||
@@ -1105,6 +1167,12 @@ typedef struct
|
||||
|
||||
tinfl_decompressor inflator;
|
||||
|
||||
#ifdef MINIZ_DISABLE_ZIP_READER_CRC32_CHECKS
|
||||
mz_uint padding;
|
||||
#else
|
||||
mz_uint file_crc32;
|
||||
#endif
|
||||
|
||||
} mz_zip_reader_extract_iter_state;
|
||||
|
||||
/* -------- ZIP reading */
|
||||
@@ -1228,9 +1296,9 @@ MINIZ_EXPORT mz_bool mz_zip_reader_extract_file_to_cfile(mz_zip_archive *pZip, c
|
||||
/* TODO */
|
||||
typedef void *mz_zip_streaming_extract_state_ptr;
|
||||
mz_zip_streaming_extract_state_ptr mz_zip_streaming_extract_begin(mz_zip_archive *pZip, mz_uint file_index, mz_uint flags);
|
||||
uint64_t mz_zip_streaming_extract_get_size(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState);
|
||||
uint64_t mz_zip_streaming_extract_get_cur_ofs(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState);
|
||||
mz_bool mz_zip_streaming_extract_seek(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState, uint64_t new_ofs);
|
||||
mz_uint64 mz_zip_streaming_extract_get_size(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState);
|
||||
mz_uint64 mz_zip_streaming_extract_get_cur_ofs(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState);
|
||||
mz_bool mz_zip_streaming_extract_seek(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState, mz_uint64 new_ofs);
|
||||
size_t mz_zip_streaming_extract_read(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState, void *pBuf, size_t buf_size);
|
||||
mz_bool mz_zip_streaming_extract_end(mz_zip_archive *pZip, mz_zip_streaming_extract_state_ptr pState);
|
||||
#endif
|
||||
@@ -1244,7 +1312,9 @@ MINIZ_EXPORT mz_bool mz_zip_validate_archive(mz_zip_archive *pZip, mz_uint flags
|
||||
|
||||
/* Misc utils/helpers, valid for ZIP reading or writing */
|
||||
MINIZ_EXPORT mz_bool mz_zip_validate_mem_archive(const void *pMem, size_t size, mz_uint flags, mz_zip_error *pErr);
|
||||
#ifndef MINIZ_NO_STDIO
|
||||
MINIZ_EXPORT mz_bool mz_zip_validate_file_archive(const char *pFilename, mz_uint flags, mz_zip_error *pErr);
|
||||
#endif
|
||||
|
||||
/* Universal end function - calls either mz_zip_reader_end() or mz_zip_writer_end(). */
|
||||
MINIZ_EXPORT mz_bool mz_zip_end(mz_zip_archive *pZip);
|
||||
@@ -1318,7 +1388,7 @@ MINIZ_EXPORT mz_bool mz_zip_writer_add_from_zip_reader(mz_zip_archive *pZip, mz_
|
||||
/* An archive must be manually finalized by calling this function for it to be valid. */
|
||||
MINIZ_EXPORT mz_bool mz_zip_writer_finalize_archive(mz_zip_archive *pZip);
|
||||
|
||||
/* Finalizes a heap archive, returning a poiner to the heap block and its size. */
|
||||
/* Finalizes a heap archive, returning a pointer to the heap block and its size. */
|
||||
/* The heap block will be allocated using the mz_zip_archive's alloc/realloc callbacks. */
|
||||
MINIZ_EXPORT mz_bool mz_zip_writer_finalize_heap_archive(mz_zip_archive *pZip, void **ppBuf, size_t *pSize);
|
||||
|
||||
@@ -1335,11 +1405,13 @@ MINIZ_EXPORT mz_bool mz_zip_writer_end(mz_zip_archive *pZip);
|
||||
MINIZ_EXPORT mz_bool mz_zip_add_mem_to_archive_file_in_place(const char *pZip_filename, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags);
|
||||
MINIZ_EXPORT mz_bool mz_zip_add_mem_to_archive_file_in_place_v2(const char *pZip_filename, const char *pArchive_name, const void *pBuf, size_t buf_size, const void *pComment, mz_uint16 comment_size, mz_uint level_and_flags, mz_zip_error *pErr);
|
||||
|
||||
#ifndef MINIZ_NO_STDIO
|
||||
/* Reads a single file from an archive into a heap block. */
|
||||
/* If pComment is not NULL, only the file with the specified comment will be extracted. */
|
||||
/* Returns NULL on failure. */
|
||||
MINIZ_EXPORT void *mz_zip_extract_archive_file_to_heap(const char *pZip_filename, const char *pArchive_name, size_t *pSize, mz_uint flags);
|
||||
MINIZ_EXPORT void *mz_zip_extract_archive_file_to_heap_v2(const char *pZip_filename, const char *pArchive_name, const char *pComment, size_t *pSize, mz_uint flags, mz_zip_error *pErr);
|
||||
#endif
|
||||
|
||||
#endif /* #ifndef MINIZ_NO_ARCHIVE_WRITING_APIS */
|
||||
|
||||
|
||||
264
ext/pugixml/CMakeLists.txt
Normal file
264
ext/pugixml/CMakeLists.txt
Normal file
@@ -0,0 +1,264 @@
|
||||
cmake_minimum_required(VERSION 3.5)
|
||||
|
||||
# Policy configuration; this *MUST* be specified before project is defined
|
||||
if(POLICY CMP0091)
|
||||
cmake_policy(SET CMP0091 NEW) # Enables use of MSVC_RUNTIME_LIBRARY
|
||||
endif()
|
||||
|
||||
project(pugixml VERSION 1.14 LANGUAGES CXX)
|
||||
|
||||
include(CMakePackageConfigHelpers)
|
||||
include(CMakeDependentOption)
|
||||
include(GNUInstallDirs)
|
||||
include(CTest)
|
||||
|
||||
cmake_dependent_option(PUGIXML_USE_VERSIONED_LIBDIR
|
||||
"Use a private subdirectory to install the headers and libraries" OFF
|
||||
"CMAKE_SOURCE_DIR STREQUAL PROJECT_SOURCE_DIR" OFF)
|
||||
|
||||
cmake_dependent_option(PUGIXML_USE_POSTFIX
|
||||
"Use separate postfix for each configuration to make sure you can install multiple build outputs" OFF
|
||||
"CMAKE_SOURCE_DIR STREQUAL PROJECT_SOURCE_DIR" OFF)
|
||||
|
||||
cmake_dependent_option(PUGIXML_STATIC_CRT
|
||||
"Use static MSVC RT libraries" OFF
|
||||
"MSVC" OFF)
|
||||
|
||||
cmake_dependent_option(PUGIXML_BUILD_TESTS
|
||||
"Build pugixml tests" OFF
|
||||
"BUILD_TESTING;CMAKE_SOURCE_DIR STREQUAL PROJECT_SOURCE_DIR" OFF)
|
||||
|
||||
# Custom build defines
|
||||
set(PUGIXML_BUILD_DEFINES CACHE STRING "Build defines for custom options")
|
||||
separate_arguments(PUGIXML_BUILD_DEFINES)
|
||||
|
||||
# Technically not needed for this file. This is builtin CMAKE global variable.
|
||||
option(BUILD_SHARED_LIBS "Build shared instead of static library" OFF)
|
||||
|
||||
# Expose option to build PUGIXML as static as well when the global BUILD_SHARED_LIBS variable is set
|
||||
cmake_dependent_option(PUGIXML_BUILD_SHARED_AND_STATIC_LIBS
|
||||
"Build both shared and static libraries" OFF
|
||||
"BUILD_SHARED_LIBS" OFF)
|
||||
|
||||
# Expose options from the pugiconfig.hpp
|
||||
option(PUGIXML_WCHAR_MODE "Enable wchar_t mode" OFF)
|
||||
option(PUGIXML_COMPACT "Enable compact mode" OFF)
|
||||
|
||||
# Advanced options from pugiconfig.hpp
|
||||
option(PUGIXML_NO_XPATH "Disable XPath" OFF)
|
||||
option(PUGIXML_NO_STL "Disable STL" OFF)
|
||||
option(PUGIXML_NO_EXCEPTIONS "Disable Exceptions" OFF)
|
||||
mark_as_advanced(PUGIXML_NO_XPATH PUGIXML_NO_STL PUGIXML_NO_EXCEPTIONS)
|
||||
|
||||
set(PUGIXML_PUBLIC_DEFINITIONS
|
||||
$<$<BOOL:${PUGIXML_WCHAR_MODE}>:PUGIXML_WCHAR_MODE>
|
||||
$<$<BOOL:${PUGIXML_COMPACT}>:PUGIXML_COMPACT>
|
||||
$<$<BOOL:${PUGIXML_NO_XPATH}>:PUGIXML_NO_XPATH>
|
||||
$<$<BOOL:${PUGIXML_NO_STL}>:PUGIXML_NO_STL>
|
||||
$<$<BOOL:${PUGIXML_NO_EXCEPTIONS}>:PUGIXML_NO_EXCEPTIONS>)
|
||||
|
||||
# This is used to backport a CMake 3.15 feature, but is also forwards compatible
|
||||
if (NOT DEFINED CMAKE_MSVC_RUNTIME_LIBRARY)
|
||||
set(CMAKE_MSVC_RUNTIME_LIBRARY
|
||||
MultiThreaded$<$<CONFIG:Debug>:Debug>$<$<NOT:$<BOOL:${PUGIXML_STATIC_CRT}>>:DLL>)
|
||||
endif()
|
||||
|
||||
if (NOT DEFINED CMAKE_CXX_STANDARD_REQUIRED)
|
||||
set(CMAKE_CXX_STANDARD_REQUIRED ON)
|
||||
endif()
|
||||
|
||||
if (NOT DEFINED CMAKE_CXX_STANDARD)
|
||||
set(CMAKE_CXX_STANDARD 11)
|
||||
endif()
|
||||
|
||||
if (PUGIXML_USE_POSTFIX)
|
||||
set(CMAKE_RELWITHDEBINFO_POSTFIX _r)
|
||||
set(CMAKE_MINSIZEREL_POSTFIX _m)
|
||||
set(CMAKE_DEBUG_POSTFIX _d)
|
||||
endif()
|
||||
|
||||
if (CMAKE_VERSION VERSION_LESS 3.15)
|
||||
set(msvc-rt $<TARGET_PROPERTY:MSVC_RUNTIME_LIBRARY>)
|
||||
|
||||
set(msvc-rt-mtd-shared $<STREQUAL:${msvc-rt},MultiThreadedDebugDLL>)
|
||||
set(msvc-rt-mtd-static $<STREQUAL:${msvc-rt},MultiThreadedDebug>)
|
||||
set(msvc-rt-mt-shared $<STREQUAL:${msvc-rt},MultiThreadedDLL>)
|
||||
set(msvc-rt-mt-static $<STREQUAL:${msvc-rt},MultiThreaded>)
|
||||
unset(msvc-rt)
|
||||
|
||||
set(msvc-rt-mtd-shared $<${msvc-rt-mtd-shared}:-MDd>)
|
||||
set(msvc-rt-mtd-static $<${msvc-rt-mtd-static}:-MTd>)
|
||||
set(msvc-rt-mt-shared $<${msvc-rt-mt-shared}:-MD>)
|
||||
set(msvc-rt-mt-static $<${msvc-rt-mt-static}:-MT>)
|
||||
endif()
|
||||
|
||||
set(versioned-dir $<$<BOOL:${PUGIXML_USE_VERSIONED_LIBDIR}>:/pugixml-${PROJECT_VERSION}>)
|
||||
|
||||
set(libs)
|
||||
|
||||
if (BUILD_SHARED_LIBS)
|
||||
add_library(pugixml-shared SHARED
|
||||
${PROJECT_SOURCE_DIR}/scripts/pugixml_dll.rc
|
||||
${PROJECT_SOURCE_DIR}/src/pugixml.cpp)
|
||||
add_library(pugixml::shared ALIAS pugixml-shared)
|
||||
list(APPEND libs pugixml-shared)
|
||||
string(CONCAT pugixml.msvc $<OR:
|
||||
$<STREQUAL:${CMAKE_CXX_COMPILER_FRONTEND_VARIANT},MSVC>,
|
||||
$<CXX_COMPILER_ID:MSVC>
|
||||
>)
|
||||
|
||||
set_property(TARGET pugixml-shared PROPERTY EXPORT_NAME shared)
|
||||
target_include_directories(pugixml-shared
|
||||
PUBLIC
|
||||
$<BUILD_INTERFACE:${PROJECT_SOURCE_DIR}/src>)
|
||||
target_compile_definitions(pugixml-shared
|
||||
PUBLIC
|
||||
${PUGIXML_BUILD_DEFINES}
|
||||
${PUGIXML_PUBLIC_DEFINITIONS}
|
||||
PRIVATE
|
||||
PUGIXML_API=$<IF:${pugixml.msvc},__declspec\(dllexport\),__attribute__\(\(visibility\("default"\)\)\)>
|
||||
)
|
||||
target_compile_options(pugixml-shared
|
||||
PRIVATE
|
||||
${msvc-rt-mtd-shared}
|
||||
${msvc-rt-mtd-static}
|
||||
${msvc-rt-mt-shared}
|
||||
${msvc-rt-mt-static})
|
||||
endif()
|
||||
|
||||
if (NOT BUILD_SHARED_LIBS OR PUGIXML_BUILD_SHARED_AND_STATIC_LIBS)
|
||||
add_library(pugixml-static STATIC
|
||||
${PROJECT_SOURCE_DIR}/src/pugixml.cpp)
|
||||
add_library(pugixml::static ALIAS pugixml-static)
|
||||
list(APPEND libs pugixml-static)
|
||||
|
||||
set_property(TARGET pugixml-static PROPERTY EXPORT_NAME static)
|
||||
target_include_directories(pugixml-static
|
||||
PUBLIC
|
||||
$<BUILD_INTERFACE:${PROJECT_SOURCE_DIR}/src>)
|
||||
target_compile_definitions(pugixml-static
|
||||
PUBLIC
|
||||
${PUGIXML_BUILD_DEFINES}
|
||||
${PUGIXML_PUBLIC_DEFINITIONS})
|
||||
target_compile_options(pugixml-static
|
||||
PRIVATE
|
||||
${msvc-rt-mtd-shared}
|
||||
${msvc-rt-mtd-static}
|
||||
${msvc-rt-mt-shared}
|
||||
${msvc-rt-mt-static})
|
||||
endif()
|
||||
|
||||
if (BUILD_SHARED_LIBS)
|
||||
set(pugixml-alias pugixml-shared)
|
||||
else()
|
||||
set(pugixml-alias pugixml-static)
|
||||
endif()
|
||||
add_library(pugixml INTERFACE)
|
||||
target_link_libraries(pugixml INTERFACE ${pugixml-alias})
|
||||
add_library(pugixml::pugixml ALIAS pugixml)
|
||||
|
||||
set_target_properties(${libs}
|
||||
PROPERTIES
|
||||
MSVC_RUNTIME_LIBRARY ${CMAKE_MSVC_RUNTIME_LIBRARY}
|
||||
EXCLUDE_FROM_ALL ON
|
||||
POSITION_INDEPENDENT_CODE ON
|
||||
SOVERSION ${PROJECT_VERSION_MAJOR}
|
||||
VERSION ${PROJECT_VERSION}
|
||||
OUTPUT_NAME pugixml)
|
||||
|
||||
set_target_properties(${libs}
|
||||
PROPERTIES
|
||||
EXCLUDE_FROM_ALL OFF)
|
||||
set(install-targets pugixml ${libs})
|
||||
|
||||
configure_package_config_file(
|
||||
"${PROJECT_SOURCE_DIR}/scripts/pugixml-config.cmake.in"
|
||||
"${PROJECT_BINARY_DIR}/pugixml-config.cmake"
|
||||
INSTALL_DESTINATION ${CMAKE_INSTALL_LIBDIR}
|
||||
NO_CHECK_REQUIRED_COMPONENTS_MACRO
|
||||
NO_SET_AND_CHECK_MACRO)
|
||||
|
||||
write_basic_package_version_file(
|
||||
"${PROJECT_BINARY_DIR}/pugixml-config-version.cmake"
|
||||
COMPATIBILITY SameMajorVersion)
|
||||
|
||||
if (PUGIXML_USE_POSTFIX)
|
||||
if(CMAKE_BUILD_TYPE MATCHES RelWithDebInfo)
|
||||
set(LIB_POSTFIX ${CMAKE_RELWITHDEBINFO_POSTFIX})
|
||||
elseif(CMAKE_BUILD_TYPE MATCHES MinSizeRel)
|
||||
set(LIB_POSTFIX ${CMAKE_MINSIZEREL_POSTFIX})
|
||||
elseif(CMAKE_BUILD_TYPE MATCHES Debug)
|
||||
set(LIB_POSTFIX ${CMAKE_DEBUG_POSTFIX})
|
||||
endif()
|
||||
endif()
|
||||
|
||||
configure_file(scripts/pugixml.pc.in pugixml.pc @ONLY)
|
||||
|
||||
if (NOT DEFINED PUGIXML_RUNTIME_COMPONENT)
|
||||
set(PUGIXML_RUNTIME_COMPONENT Runtime)
|
||||
endif()
|
||||
|
||||
if (NOT DEFINED PUGIXML_LIBRARY_COMPONENT)
|
||||
set(PUGIXML_LIBRARY_COMPONENT Library)
|
||||
endif()
|
||||
|
||||
if (NOT DEFINED PUGIXML_DEVELOPMENT_COMPONENT)
|
||||
set(PUGIXML_DEVELOPMENT_COMPONENT Development)
|
||||
endif()
|
||||
|
||||
set(namelink-component)
|
||||
if (NOT CMAKE_VERSION VERSION_LESS 3.12)
|
||||
set(namelink-component NAMELINK_COMPONENT ${PUGIXML_DEVELOPMENT_COMPONENT})
|
||||
endif()
|
||||
install(TARGETS ${install-targets}
|
||||
EXPORT pugixml-targets
|
||||
RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR} COMPONENT ${PUGIXML_RUNTIME_COMPONENT}
|
||||
LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR} COMPONENT ${PUGIXML_LIBRARY_COMPONENT} ${namelink-component}
|
||||
ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR} COMPONENT ${PUGIXML_DEVELOPMENT_COMPONENT}
|
||||
INCLUDES DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}${versioned-dir})
|
||||
|
||||
install(EXPORT pugixml-targets
|
||||
NAMESPACE pugixml::
|
||||
DESTINATION ${CMAKE_INSTALL_LIBDIR}/cmake/pugixml COMPONENT ${PUGIXML_DEVELOPMENT_COMPONENT})
|
||||
|
||||
export(EXPORT pugixml-targets
|
||||
NAMESPACE pugixml::)
|
||||
|
||||
install(FILES
|
||||
"${PROJECT_BINARY_DIR}/pugixml-config-version.cmake"
|
||||
"${PROJECT_BINARY_DIR}/pugixml-config.cmake"
|
||||
DESTINATION ${CMAKE_INSTALL_LIBDIR}/cmake/pugixml COMPONENT ${PUGIXML_DEVELOPMENT_COMPONENT})
|
||||
|
||||
install(FILES ${PROJECT_BINARY_DIR}/pugixml.pc
|
||||
DESTINATION ${CMAKE_INSTALL_LIBDIR}/pkgconfig COMPONENT ${PUGIXML_DEVELOPMENT_COMPONENT})
|
||||
|
||||
install(
|
||||
FILES
|
||||
"${PROJECT_SOURCE_DIR}/src/pugiconfig.hpp"
|
||||
"${PROJECT_SOURCE_DIR}/src/pugixml.hpp"
|
||||
DESTINATION
|
||||
${CMAKE_INSTALL_INCLUDEDIR}${versioned-dir} COMPONENT ${PUGIXML_DEVELOPMENT_COMPONENT})
|
||||
|
||||
if (PUGIXML_BUILD_TESTS)
|
||||
set(fuzz-pattern "tests/fuzz_*.cpp")
|
||||
set(test-pattern "tests/*.cpp")
|
||||
if (CMAKE_VERSION VERSION_GREATER 3.11)
|
||||
list(INSERT fuzz-pattern 0 CONFIGURE_DEPENDS)
|
||||
list(INSERT test-pattern 0 CONFIGURE_DEPENDS)
|
||||
endif()
|
||||
file(GLOB test-sources ${test-pattern})
|
||||
file(GLOB fuzz-sources ${fuzz-pattern})
|
||||
list(REMOVE_ITEM test-sources ${fuzz-sources})
|
||||
|
||||
add_custom_target(check
|
||||
COMMAND ${CMAKE_CTEST_COMMAND} --output-on-failure)
|
||||
|
||||
add_executable(pugixml-check ${test-sources})
|
||||
add_test(NAME pugixml::test
|
||||
COMMAND pugixml-check
|
||||
WORKING_DIRECTORY ${PROJECT_SOURCE_DIR})
|
||||
add_dependencies(check pugixml-check)
|
||||
target_link_libraries(pugixml-check
|
||||
PRIVATE
|
||||
pugixml::pugixml)
|
||||
endif()
|
||||
24
ext/pugixml/LICENSE.md
Normal file
24
ext/pugixml/LICENSE.md
Normal file
@@ -0,0 +1,24 @@
|
||||
MIT License
|
||||
|
||||
Copyright (c) 2006-2023 Arseny Kapoulkine
|
||||
|
||||
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:
|
||||
|
||||
The above copyright notice and this permission notice shall be
|
||||
included in all copies or substantial portions of the Software.
|
||||
|
||||
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.
|
||||
12
ext/pugixml/scripts/pugixml-config.cmake.in
Normal file
12
ext/pugixml/scripts/pugixml-config.cmake.in
Normal file
@@ -0,0 +1,12 @@
|
||||
@PACKAGE_INIT@
|
||||
|
||||
include("${CMAKE_CURRENT_LIST_DIR}/pugixml-targets.cmake")
|
||||
|
||||
# If the user is not requiring 1.11 (either by explicitly requesting an older
|
||||
# version or not requesting one at all), provide the old imported target name
|
||||
# for compatibility.
|
||||
if (NOT TARGET pugixml AND (NOT DEFINED PACKAGE_FIND_VERSION OR PACKAGE_FIND_VERSION VERSION_LESS "1.11"))
|
||||
add_library(pugixml INTERFACE IMPORTED)
|
||||
# Equivalent to target_link_libraries INTERFACE, but compatible with CMake 3.10
|
||||
set_target_properties(pugixml PROPERTIES INTERFACE_LINK_LIBRARIES pugixml::pugixml)
|
||||
endif ()
|
||||
11
ext/pugixml/scripts/pugixml.pc.in
Normal file
11
ext/pugixml/scripts/pugixml.pc.in
Normal file
@@ -0,0 +1,11 @@
|
||||
prefix=@CMAKE_INSTALL_PREFIX@
|
||||
exec_prefix=${prefix}
|
||||
includedir=@CMAKE_INSTALL_FULL_INCLUDEDIR@@INSTALL_SUFFIX@
|
||||
libdir=@CMAKE_INSTALL_FULL_LIBDIR@@INSTALL_SUFFIX@
|
||||
|
||||
Name: pugixml
|
||||
Description: Light-weight, simple and fast XML parser for C++ with XPath support.
|
||||
URL: https://pugixml.org/
|
||||
Version: @pugixml_VERSION@
|
||||
Cflags: -I${includedir}
|
||||
Libs: -L${libdir} -lpugixml@LIB_POSTFIX@
|
||||
45
ext/pugixml/scripts/pugixml_dll.rc
Normal file
45
ext/pugixml/scripts/pugixml_dll.rc
Normal file
@@ -0,0 +1,45 @@
|
||||
#include <winver.h>
|
||||
|
||||
#define PUGIXML_VERSION_MAJOR 1
|
||||
#define PUGIXML_VERSION_MINOR 14
|
||||
#define PUGIXML_VERSION_PATCH 0
|
||||
#define PUGIXML_VERSION_NUMBER "1.14.0\0"
|
||||
|
||||
#if defined(GCC_WINDRES) || defined(__MINGW32__) || defined(__CYGWIN__)
|
||||
VS_VERSION_INFO VERSIONINFO
|
||||
#else
|
||||
VS_VERSION_INFO VERSIONINFO MOVEABLE IMPURE LOADONCALL DISCARDABLE
|
||||
#endif
|
||||
FILEVERSION PUGIXML_VERSION_MAJOR,PUGIXML_VERSION_MINOR,PUGIXML_VERSION_PATCH,0
|
||||
PRODUCTVERSION PUGIXML_VERSION_MAJOR,PUGIXML_VERSION_MINOR,PUGIXML_VERSION_PATCH,0
|
||||
FILEFLAGSMASK VS_FFI_FILEFLAGSMASK
|
||||
#ifdef _DEBUG
|
||||
FILEFLAGS 1
|
||||
#else
|
||||
FILEFLAGS 0
|
||||
#endif
|
||||
FILEOS VOS__WINDOWS32
|
||||
FILETYPE VFT_DLL
|
||||
FILESUBTYPE 0 // not used
|
||||
BEGIN
|
||||
BLOCK "StringFileInfo"
|
||||
BEGIN
|
||||
BLOCK "040904E4"
|
||||
//language ID = U.S. English, char set = Windows, Multilingual
|
||||
BEGIN
|
||||
VALUE "CompanyName", "zeux/pugixml\0"
|
||||
VALUE "FileDescription", "pugixml library\0"
|
||||
VALUE "FileVersion", PUGIXML_VERSION_NUMBER
|
||||
VALUE "InternalName", "pugixml.dll\0"
|
||||
VALUE "LegalCopyright", "Copyright (C) 2006-2023, by Arseny Kapoulkine\0"
|
||||
VALUE "OriginalFilename", "pugixml.dll\0"
|
||||
VALUE "ProductName", "pugixml\0"
|
||||
VALUE "ProductVersion", PUGIXML_VERSION_NUMBER
|
||||
VALUE "Comments", "For more information visit https://github.com/zeux/pugixml/\0"
|
||||
END
|
||||
END
|
||||
BLOCK "VarFileInfo"
|
||||
BEGIN
|
||||
VALUE "Translation", 0x0409, 1252
|
||||
END
|
||||
END
|
||||
77
ext/pugixml/src/pugiconfig.hpp
Normal file
77
ext/pugixml/src/pugiconfig.hpp
Normal file
@@ -0,0 +1,77 @@
|
||||
/**
|
||||
* pugixml parser - version 1.14
|
||||
* --------------------------------------------------------
|
||||
* Copyright (C) 2006-2023, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)
|
||||
* Report bugs and download new versions at https://pugixml.org/
|
||||
*
|
||||
* This library is distributed under the MIT License. See notice at the end
|
||||
* of this file.
|
||||
*
|
||||
* This work is based on the pugxml parser, which is:
|
||||
* Copyright (C) 2003, by Kristen Wegner (kristen@tima.net)
|
||||
*/
|
||||
|
||||
#ifndef HEADER_PUGICONFIG_HPP
|
||||
#define HEADER_PUGICONFIG_HPP
|
||||
|
||||
// Uncomment this to enable wchar_t mode
|
||||
// #define PUGIXML_WCHAR_MODE
|
||||
|
||||
// Uncomment this to enable compact mode
|
||||
// #define PUGIXML_COMPACT
|
||||
|
||||
// Uncomment this to disable XPath
|
||||
// #define PUGIXML_NO_XPATH
|
||||
|
||||
// Uncomment this to disable STL
|
||||
// #define PUGIXML_NO_STL
|
||||
|
||||
// Uncomment this to disable exceptions
|
||||
// #define PUGIXML_NO_EXCEPTIONS
|
||||
|
||||
// Set this to control attributes for public classes/functions, i.e.:
|
||||
// #define PUGIXML_API __declspec(dllexport) // to export all public symbols from DLL
|
||||
// #define PUGIXML_CLASS __declspec(dllimport) // to import all classes from DLL
|
||||
// #define PUGIXML_FUNCTION __fastcall // to set calling conventions to all public functions to fastcall
|
||||
// In absence of PUGIXML_CLASS/PUGIXML_FUNCTION definitions PUGIXML_API is used instead
|
||||
|
||||
// Tune these constants to adjust memory-related behavior
|
||||
// #define PUGIXML_MEMORY_PAGE_SIZE 32768
|
||||
// #define PUGIXML_MEMORY_OUTPUT_STACK 10240
|
||||
// #define PUGIXML_MEMORY_XPATH_PAGE_SIZE 4096
|
||||
|
||||
// Tune this constant to adjust max nesting for XPath queries
|
||||
// #define PUGIXML_XPATH_DEPTH_LIMIT 1024
|
||||
|
||||
// Uncomment this to switch to header-only version
|
||||
// #define PUGIXML_HEADER_ONLY
|
||||
|
||||
// Uncomment this to enable long long support
|
||||
// #define PUGIXML_HAS_LONG_LONG
|
||||
|
||||
#endif
|
||||
|
||||
/**
|
||||
* Copyright (c) 2006-2023 Arseny Kapoulkine
|
||||
*
|
||||
* 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:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be
|
||||
* included in all copies or substantial portions of the Software.
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
13226
ext/pugixml/src/pugixml.cpp
Normal file
13226
ext/pugixml/src/pugixml.cpp
Normal file
File diff suppressed because it is too large
Load Diff
1516
ext/pugixml/src/pugixml.hpp
Normal file
1516
ext/pugixml/src/pugixml.hpp
Normal file
File diff suppressed because it is too large
Load Diff
@@ -1,4 +0,0 @@
|
||||
add_library(rapidxml INTERFACE)
|
||||
add_library(External::rapidxml ALIAS rapidxml)
|
||||
target_include_directories(rapidxml
|
||||
INTERFACE ${CMAKE_CURRENT_SOURCE_DIR})
|
||||
@@ -1,52 +0,0 @@
|
||||
Use of this software is granted under one of the following two licenses,
|
||||
to be chosen freely by the user.
|
||||
|
||||
1. Boost Software License - Version 1.0 - August 17th, 2003
|
||||
===============================================================================
|
||||
|
||||
Copyright (c) 2006, 2007 Marcin Kalicinski
|
||||
|
||||
Permission is hereby granted, free of charge, to any person or organization
|
||||
obtaining a copy of the software and accompanying documentation covered by
|
||||
this license (the "Software") to use, reproduce, display, distribute,
|
||||
execute, and transmit the Software, and to prepare derivative works of the
|
||||
Software, and to permit third-parties to whom the Software is furnished to
|
||||
do so, all subject to the following:
|
||||
|
||||
The copyright notices in the Software and this entire statement, including
|
||||
the above license grant, this restriction and the following disclaimer,
|
||||
must be included in all copies of the Software, in whole or in part, and
|
||||
all derivative works of the Software, unless such copies or derivative
|
||||
works are solely in the form of machine-executable object code generated by
|
||||
a source language processor.
|
||||
|
||||
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, TITLE AND NON-INFRINGEMENT. IN NO EVENT
|
||||
SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
|
||||
FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
|
||||
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
||||
DEALINGS IN THE SOFTWARE.
|
||||
|
||||
2. The MIT License
|
||||
===============================================================================
|
||||
|
||||
Copyright (c) 2006, 2007 Marcin Kalicinski
|
||||
|
||||
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:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all
|
||||
copies or substantial portions of the Software.
|
||||
|
||||
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.
|
||||
File diff suppressed because it is too large
Load Diff
@@ -1,174 +0,0 @@
|
||||
#ifndef RAPIDXML_ITERATORS_HPP_INCLUDED
|
||||
#define RAPIDXML_ITERATORS_HPP_INCLUDED
|
||||
|
||||
// Copyright (C) 2006, 2009 Marcin Kalicinski
|
||||
// Version 1.13
|
||||
// Revision $DateTime: 2009/05/13 01:46:17 $
|
||||
//! \file rapidxml_iterators.hpp This file contains rapidxml iterators
|
||||
|
||||
#include "rapidxml.hpp"
|
||||
|
||||
namespace rapidxml
|
||||
{
|
||||
|
||||
//! Iterator of child nodes of xml_node
|
||||
template<class Ch>
|
||||
class node_iterator
|
||||
{
|
||||
|
||||
public:
|
||||
|
||||
typedef typename xml_node<Ch> value_type;
|
||||
typedef typename xml_node<Ch> &reference;
|
||||
typedef typename xml_node<Ch> *pointer;
|
||||
typedef std::ptrdiff_t difference_type;
|
||||
typedef std::bidirectional_iterator_tag iterator_category;
|
||||
|
||||
node_iterator()
|
||||
: m_node(0)
|
||||
{
|
||||
}
|
||||
|
||||
node_iterator(xml_node<Ch> *node)
|
||||
: m_node(node->first_node())
|
||||
{
|
||||
}
|
||||
|
||||
reference operator *() const
|
||||
{
|
||||
assert(m_node);
|
||||
return *m_node;
|
||||
}
|
||||
|
||||
pointer operator->() const
|
||||
{
|
||||
assert(m_node);
|
||||
return m_node;
|
||||
}
|
||||
|
||||
node_iterator& operator++()
|
||||
{
|
||||
assert(m_node);
|
||||
m_node = m_node->next_sibling();
|
||||
return *this;
|
||||
}
|
||||
|
||||
node_iterator operator++(int)
|
||||
{
|
||||
node_iterator tmp = *this;
|
||||
++this;
|
||||
return tmp;
|
||||
}
|
||||
|
||||
node_iterator& operator--()
|
||||
{
|
||||
assert(m_node && m_node->previous_sibling());
|
||||
m_node = m_node->previous_sibling();
|
||||
return *this;
|
||||
}
|
||||
|
||||
node_iterator operator--(int)
|
||||
{
|
||||
node_iterator tmp = *this;
|
||||
++this;
|
||||
return tmp;
|
||||
}
|
||||
|
||||
bool operator ==(const node_iterator<Ch> &rhs)
|
||||
{
|
||||
return m_node == rhs.m_node;
|
||||
}
|
||||
|
||||
bool operator !=(const node_iterator<Ch> &rhs)
|
||||
{
|
||||
return m_node != rhs.m_node;
|
||||
}
|
||||
|
||||
private:
|
||||
|
||||
xml_node<Ch> *m_node;
|
||||
|
||||
};
|
||||
|
||||
//! Iterator of child attributes of xml_node
|
||||
template<class Ch>
|
||||
class attribute_iterator
|
||||
{
|
||||
|
||||
public:
|
||||
|
||||
typedef typename xml_attribute<Ch> value_type;
|
||||
typedef typename xml_attribute<Ch> &reference;
|
||||
typedef typename xml_attribute<Ch> *pointer;
|
||||
typedef std::ptrdiff_t difference_type;
|
||||
typedef std::bidirectional_iterator_tag iterator_category;
|
||||
|
||||
attribute_iterator()
|
||||
: m_attribute(0)
|
||||
{
|
||||
}
|
||||
|
||||
attribute_iterator(xml_node<Ch> *node)
|
||||
: m_attribute(node->first_attribute())
|
||||
{
|
||||
}
|
||||
|
||||
reference operator *() const
|
||||
{
|
||||
assert(m_attribute);
|
||||
return *m_attribute;
|
||||
}
|
||||
|
||||
pointer operator->() const
|
||||
{
|
||||
assert(m_attribute);
|
||||
return m_attribute;
|
||||
}
|
||||
|
||||
attribute_iterator& operator++()
|
||||
{
|
||||
assert(m_attribute);
|
||||
m_attribute = m_attribute->next_attribute();
|
||||
return *this;
|
||||
}
|
||||
|
||||
attribute_iterator operator++(int)
|
||||
{
|
||||
attribute_iterator tmp = *this;
|
||||
++this;
|
||||
return tmp;
|
||||
}
|
||||
|
||||
attribute_iterator& operator--()
|
||||
{
|
||||
assert(m_attribute && m_attribute->previous_attribute());
|
||||
m_attribute = m_attribute->previous_attribute();
|
||||
return *this;
|
||||
}
|
||||
|
||||
attribute_iterator operator--(int)
|
||||
{
|
||||
attribute_iterator tmp = *this;
|
||||
++this;
|
||||
return tmp;
|
||||
}
|
||||
|
||||
bool operator ==(const attribute_iterator<Ch> &rhs)
|
||||
{
|
||||
return m_attribute == rhs.m_attribute;
|
||||
}
|
||||
|
||||
bool operator !=(const attribute_iterator<Ch> &rhs)
|
||||
{
|
||||
return m_attribute != rhs.m_attribute;
|
||||
}
|
||||
|
||||
private:
|
||||
|
||||
xml_attribute<Ch> *m_attribute;
|
||||
|
||||
};
|
||||
|
||||
}
|
||||
|
||||
#endif
|
||||
@@ -1,421 +0,0 @@
|
||||
#ifndef RAPIDXML_PRINT_HPP_INCLUDED
|
||||
#define RAPIDXML_PRINT_HPP_INCLUDED
|
||||
|
||||
// Copyright (C) 2006, 2009 Marcin Kalicinski
|
||||
// Version 1.13
|
||||
// Revision $DateTime: 2009/05/13 01:46:17 $
|
||||
//! \file rapidxml_print.hpp This file contains rapidxml printer implementation
|
||||
|
||||
#include "rapidxml.hpp"
|
||||
|
||||
// Only include streams if not disabled
|
||||
#ifndef RAPIDXML_NO_STREAMS
|
||||
#include <ostream>
|
||||
#include <iterator>
|
||||
#endif
|
||||
|
||||
namespace rapidxml
|
||||
{
|
||||
|
||||
///////////////////////////////////////////////////////////////////////
|
||||
// Printing flags
|
||||
|
||||
const int print_no_indenting = 0x1; //!< Printer flag instructing the printer to suppress indenting of XML. See print() function.
|
||||
|
||||
///////////////////////////////////////////////////////////////////////
|
||||
// Internal
|
||||
|
||||
//! \cond internal
|
||||
namespace internal
|
||||
{
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////
|
||||
// Internal character operations
|
||||
|
||||
// Copy characters from given range to given output iterator
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt copy_chars(const Ch *begin, const Ch *end, OutIt out)
|
||||
{
|
||||
while (begin != end)
|
||||
*out++ = *begin++;
|
||||
return out;
|
||||
}
|
||||
|
||||
// Copy characters from given range to given output iterator and expand
|
||||
// characters into references (< > ' " &)
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt copy_and_expand_chars(const Ch *begin, const Ch *end, Ch noexpand, OutIt out)
|
||||
{
|
||||
while (begin != end)
|
||||
{
|
||||
if (*begin == noexpand)
|
||||
{
|
||||
*out++ = *begin; // No expansion, copy character
|
||||
}
|
||||
else
|
||||
{
|
||||
switch (*begin)
|
||||
{
|
||||
case Ch('<'):
|
||||
*out++ = Ch('&'); *out++ = Ch('l'); *out++ = Ch('t'); *out++ = Ch(';');
|
||||
break;
|
||||
case Ch('>'):
|
||||
*out++ = Ch('&'); *out++ = Ch('g'); *out++ = Ch('t'); *out++ = Ch(';');
|
||||
break;
|
||||
case Ch('\''):
|
||||
*out++ = Ch('&'); *out++ = Ch('a'); *out++ = Ch('p'); *out++ = Ch('o'); *out++ = Ch('s'); *out++ = Ch(';');
|
||||
break;
|
||||
case Ch('"'):
|
||||
*out++ = Ch('&'); *out++ = Ch('q'); *out++ = Ch('u'); *out++ = Ch('o'); *out++ = Ch('t'); *out++ = Ch(';');
|
||||
break;
|
||||
case Ch('&'):
|
||||
*out++ = Ch('&'); *out++ = Ch('a'); *out++ = Ch('m'); *out++ = Ch('p'); *out++ = Ch(';');
|
||||
break;
|
||||
default:
|
||||
*out++ = *begin; // No expansion, copy character
|
||||
}
|
||||
}
|
||||
++begin; // Step to next character
|
||||
}
|
||||
return out;
|
||||
}
|
||||
|
||||
// Fill given output iterator with repetitions of the same character
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt fill_chars(OutIt out, int n, Ch ch)
|
||||
{
|
||||
for (int i = 0; i < n; ++i)
|
||||
*out++ = ch;
|
||||
return out;
|
||||
}
|
||||
|
||||
// Find character
|
||||
template<class Ch, Ch ch>
|
||||
inline bool find_char(const Ch *begin, const Ch *end)
|
||||
{
|
||||
while (begin != end)
|
||||
if (*begin++ == ch)
|
||||
return true;
|
||||
return false;
|
||||
}
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////
|
||||
// Internal printing operations
|
||||
|
||||
// Print node
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)
|
||||
{
|
||||
// Print proper node type
|
||||
switch (node->type())
|
||||
{
|
||||
|
||||
// Document
|
||||
case node_document:
|
||||
out = print_children(out, node, flags, indent);
|
||||
break;
|
||||
|
||||
// Element
|
||||
case node_element:
|
||||
out = print_element_node(out, node, flags, indent);
|
||||
break;
|
||||
|
||||
// Data
|
||||
case node_data:
|
||||
out = print_data_node(out, node, flags, indent);
|
||||
break;
|
||||
|
||||
// CDATA
|
||||
case node_cdata:
|
||||
out = print_cdata_node(out, node, flags, indent);
|
||||
break;
|
||||
|
||||
// Declaration
|
||||
case node_declaration:
|
||||
out = print_declaration_node(out, node, flags, indent);
|
||||
break;
|
||||
|
||||
// Comment
|
||||
case node_comment:
|
||||
out = print_comment_node(out, node, flags, indent);
|
||||
break;
|
||||
|
||||
// Doctype
|
||||
case node_doctype:
|
||||
out = print_doctype_node(out, node, flags, indent);
|
||||
break;
|
||||
|
||||
// Pi
|
||||
case node_pi:
|
||||
out = print_pi_node(out, node, flags, indent);
|
||||
break;
|
||||
|
||||
// Unknown
|
||||
default:
|
||||
assert(0);
|
||||
break;
|
||||
}
|
||||
|
||||
// If indenting not disabled, add line break after node
|
||||
if (!(flags & print_no_indenting))
|
||||
*out = Ch('\n'), ++out;
|
||||
|
||||
// Return modified iterator
|
||||
return out;
|
||||
}
|
||||
|
||||
// Print children of the node
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print_children(OutIt out, const xml_node<Ch> *node, int flags, int indent)
|
||||
{
|
||||
for (xml_node<Ch> *child = node->first_node(); child; child = child->next_sibling())
|
||||
out = print_node(out, child, flags, indent);
|
||||
return out;
|
||||
}
|
||||
|
||||
// Print attributes of the node
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print_attributes(OutIt out, const xml_node<Ch> *node, int flags)
|
||||
{
|
||||
for (xml_attribute<Ch> *attribute = node->first_attribute(); attribute; attribute = attribute->next_attribute())
|
||||
{
|
||||
if (attribute->name() && attribute->value())
|
||||
{
|
||||
// Print attribute name
|
||||
*out = Ch(' '), ++out;
|
||||
out = copy_chars(attribute->name(), attribute->name() + attribute->name_size(), out);
|
||||
*out = Ch('='), ++out;
|
||||
// Print attribute value using appropriate quote type
|
||||
if (find_char<Ch, Ch('"')>(attribute->value(), attribute->value() + attribute->value_size()))
|
||||
{
|
||||
*out = Ch('\''), ++out;
|
||||
out = copy_and_expand_chars(attribute->value(), attribute->value() + attribute->value_size(), Ch('"'), out);
|
||||
*out = Ch('\''), ++out;
|
||||
}
|
||||
else
|
||||
{
|
||||
*out = Ch('"'), ++out;
|
||||
out = copy_and_expand_chars(attribute->value(), attribute->value() + attribute->value_size(), Ch('\''), out);
|
||||
*out = Ch('"'), ++out;
|
||||
}
|
||||
}
|
||||
}
|
||||
return out;
|
||||
}
|
||||
|
||||
// Print data node
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print_data_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)
|
||||
{
|
||||
assert(node->type() == node_data);
|
||||
if (!(flags & print_no_indenting))
|
||||
out = fill_chars(out, indent, Ch('\t'));
|
||||
out = copy_and_expand_chars(node->value(), node->value() + node->value_size(), Ch(0), out);
|
||||
return out;
|
||||
}
|
||||
|
||||
// Print data node
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print_cdata_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)
|
||||
{
|
||||
assert(node->type() == node_cdata);
|
||||
if (!(flags & print_no_indenting))
|
||||
out = fill_chars(out, indent, Ch('\t'));
|
||||
*out = Ch('<'); ++out;
|
||||
*out = Ch('!'); ++out;
|
||||
*out = Ch('['); ++out;
|
||||
*out = Ch('C'); ++out;
|
||||
*out = Ch('D'); ++out;
|
||||
*out = Ch('A'); ++out;
|
||||
*out = Ch('T'); ++out;
|
||||
*out = Ch('A'); ++out;
|
||||
*out = Ch('['); ++out;
|
||||
out = copy_chars(node->value(), node->value() + node->value_size(), out);
|
||||
*out = Ch(']'); ++out;
|
||||
*out = Ch(']'); ++out;
|
||||
*out = Ch('>'); ++out;
|
||||
return out;
|
||||
}
|
||||
|
||||
// Print element node
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print_element_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)
|
||||
{
|
||||
assert(node->type() == node_element);
|
||||
|
||||
// Print element name and attributes, if any
|
||||
if (!(flags & print_no_indenting))
|
||||
out = fill_chars(out, indent, Ch('\t'));
|
||||
*out = Ch('<'), ++out;
|
||||
out = copy_chars(node->name(), node->name() + node->name_size(), out);
|
||||
out = print_attributes(out, node, flags);
|
||||
|
||||
// If node is childless
|
||||
if (node->value_size() == 0 && !node->first_node())
|
||||
{
|
||||
// Print childless node tag ending
|
||||
*out = Ch('/'), ++out;
|
||||
*out = Ch('>'), ++out;
|
||||
}
|
||||
else
|
||||
{
|
||||
// Print normal node tag ending
|
||||
*out = Ch('>'), ++out;
|
||||
|
||||
// Test if node contains a single data node only (and no other nodes)
|
||||
xml_node<Ch> *child = node->first_node();
|
||||
if (!child)
|
||||
{
|
||||
// If node has no children, only print its value without indenting
|
||||
out = copy_and_expand_chars(node->value(), node->value() + node->value_size(), Ch(0), out);
|
||||
}
|
||||
else if (child->next_sibling() == 0 && child->type() == node_data)
|
||||
{
|
||||
// If node has a sole data child, only print its value without indenting
|
||||
out = copy_and_expand_chars(child->value(), child->value() + child->value_size(), Ch(0), out);
|
||||
}
|
||||
else
|
||||
{
|
||||
// Print all children with full indenting
|
||||
if (!(flags & print_no_indenting))
|
||||
*out = Ch('\n'), ++out;
|
||||
out = print_children(out, node, flags, indent + 1);
|
||||
if (!(flags & print_no_indenting))
|
||||
out = fill_chars(out, indent, Ch('\t'));
|
||||
}
|
||||
|
||||
// Print node end
|
||||
*out = Ch('<'), ++out;
|
||||
*out = Ch('/'), ++out;
|
||||
out = copy_chars(node->name(), node->name() + node->name_size(), out);
|
||||
*out = Ch('>'), ++out;
|
||||
}
|
||||
return out;
|
||||
}
|
||||
|
||||
// Print declaration node
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print_declaration_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)
|
||||
{
|
||||
// Print declaration start
|
||||
if (!(flags & print_no_indenting))
|
||||
out = fill_chars(out, indent, Ch('\t'));
|
||||
*out = Ch('<'), ++out;
|
||||
*out = Ch('?'), ++out;
|
||||
*out = Ch('x'), ++out;
|
||||
*out = Ch('m'), ++out;
|
||||
*out = Ch('l'), ++out;
|
||||
|
||||
// Print attributes
|
||||
out = print_attributes(out, node, flags);
|
||||
|
||||
// Print declaration end
|
||||
*out = Ch('?'), ++out;
|
||||
*out = Ch('>'), ++out;
|
||||
|
||||
return out;
|
||||
}
|
||||
|
||||
// Print comment node
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print_comment_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)
|
||||
{
|
||||
assert(node->type() == node_comment);
|
||||
if (!(flags & print_no_indenting))
|
||||
out = fill_chars(out, indent, Ch('\t'));
|
||||
*out = Ch('<'), ++out;
|
||||
*out = Ch('!'), ++out;
|
||||
*out = Ch('-'), ++out;
|
||||
*out = Ch('-'), ++out;
|
||||
out = copy_chars(node->value(), node->value() + node->value_size(), out);
|
||||
*out = Ch('-'), ++out;
|
||||
*out = Ch('-'), ++out;
|
||||
*out = Ch('>'), ++out;
|
||||
return out;
|
||||
}
|
||||
|
||||
// Print doctype node
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print_doctype_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)
|
||||
{
|
||||
assert(node->type() == node_doctype);
|
||||
if (!(flags & print_no_indenting))
|
||||
out = fill_chars(out, indent, Ch('\t'));
|
||||
*out = Ch('<'), ++out;
|
||||
*out = Ch('!'), ++out;
|
||||
*out = Ch('D'), ++out;
|
||||
*out = Ch('O'), ++out;
|
||||
*out = Ch('C'), ++out;
|
||||
*out = Ch('T'), ++out;
|
||||
*out = Ch('Y'), ++out;
|
||||
*out = Ch('P'), ++out;
|
||||
*out = Ch('E'), ++out;
|
||||
*out = Ch(' '), ++out;
|
||||
out = copy_chars(node->value(), node->value() + node->value_size(), out);
|
||||
*out = Ch('>'), ++out;
|
||||
return out;
|
||||
}
|
||||
|
||||
// Print pi node
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print_pi_node(OutIt out, const xml_node<Ch> *node, int flags, int indent)
|
||||
{
|
||||
assert(node->type() == node_pi);
|
||||
if (!(flags & print_no_indenting))
|
||||
out = fill_chars(out, indent, Ch('\t'));
|
||||
*out = Ch('<'), ++out;
|
||||
*out = Ch('?'), ++out;
|
||||
out = copy_chars(node->name(), node->name() + node->name_size(), out);
|
||||
*out = Ch(' '), ++out;
|
||||
out = copy_chars(node->value(), node->value() + node->value_size(), out);
|
||||
*out = Ch('?'), ++out;
|
||||
*out = Ch('>'), ++out;
|
||||
return out;
|
||||
}
|
||||
|
||||
}
|
||||
//! \endcond
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////
|
||||
// Printing
|
||||
|
||||
//! Prints XML to given output iterator.
|
||||
//! \param out Output iterator to print to.
|
||||
//! \param node Node to be printed. Pass xml_document to print entire document.
|
||||
//! \param flags Flags controlling how XML is printed.
|
||||
//! \return Output iterator pointing to position immediately after last character of printed text.
|
||||
template<class OutIt, class Ch>
|
||||
inline OutIt print(OutIt out, const xml_node<Ch> &node, int flags = 0)
|
||||
{
|
||||
return internal::print_node(out, &node, flags, 0);
|
||||
}
|
||||
|
||||
#ifndef RAPIDXML_NO_STREAMS
|
||||
|
||||
//! Prints XML to given output stream.
|
||||
//! \param out Output stream to print to.
|
||||
//! \param node Node to be printed. Pass xml_document to print entire document.
|
||||
//! \param flags Flags controlling how XML is printed.
|
||||
//! \return Output stream.
|
||||
template<class Ch>
|
||||
inline std::basic_ostream<Ch> &print(std::basic_ostream<Ch> &out, const xml_node<Ch> &node, int flags = 0)
|
||||
{
|
||||
print(std::ostream_iterator<Ch>(out), node, flags);
|
||||
return out;
|
||||
}
|
||||
|
||||
//! Prints formatted XML to given output stream. Uses default printing flags. Use print() function to customize printing process.
|
||||
//! \param out Output stream to print to.
|
||||
//! \param node Node to be printed.
|
||||
//! \return Output stream.
|
||||
template<class Ch>
|
||||
inline std::basic_ostream<Ch> &operator <<(std::basic_ostream<Ch> &out, const xml_node<Ch> &node)
|
||||
{
|
||||
return print(out, node);
|
||||
}
|
||||
|
||||
#endif
|
||||
|
||||
}
|
||||
|
||||
#endif
|
||||
@@ -1,122 +0,0 @@
|
||||
#ifndef RAPIDXML_UTILS_HPP_INCLUDED
|
||||
#define RAPIDXML_UTILS_HPP_INCLUDED
|
||||
|
||||
// Copyright (C) 2006, 2009 Marcin Kalicinski
|
||||
// Version 1.13
|
||||
// Revision $DateTime: 2009/05/13 01:46:17 $
|
||||
//! \file rapidxml_utils.hpp This file contains high-level rapidxml utilities that can be useful
|
||||
//! in certain simple scenarios. They should probably not be used if maximizing performance is the main objective.
|
||||
|
||||
#include "rapidxml.hpp"
|
||||
#include <vector>
|
||||
#include <string>
|
||||
#include <fstream>
|
||||
#include <stdexcept>
|
||||
|
||||
namespace rapidxml
|
||||
{
|
||||
|
||||
//! Represents data loaded from a file
|
||||
template<class Ch = char>
|
||||
class file
|
||||
{
|
||||
|
||||
public:
|
||||
|
||||
//! Loads file into the memory. Data will be automatically destroyed by the destructor.
|
||||
//! \param filename Filename to load.
|
||||
file(const char *filename)
|
||||
{
|
||||
using namespace std;
|
||||
|
||||
// Open stream
|
||||
basic_ifstream<Ch> stream(filename, ios::binary);
|
||||
if (!stream)
|
||||
throw runtime_error(string("cannot open file ") + filename);
|
||||
stream.unsetf(ios::skipws);
|
||||
|
||||
// Determine stream size
|
||||
stream.seekg(0, ios::end);
|
||||
size_t size = stream.tellg();
|
||||
stream.seekg(0);
|
||||
|
||||
// Load data and add terminating 0
|
||||
m_data.resize(size + 1);
|
||||
stream.read(&m_data.front(), static_cast<streamsize>(size));
|
||||
m_data[size] = 0;
|
||||
}
|
||||
|
||||
//! Loads file into the memory. Data will be automatically destroyed by the destructor
|
||||
//! \param stream Stream to load from
|
||||
file(std::basic_istream<Ch> &stream)
|
||||
{
|
||||
using namespace std;
|
||||
|
||||
// Load data and add terminating 0
|
||||
stream.unsetf(ios::skipws);
|
||||
m_data.assign(istreambuf_iterator<Ch>(stream), istreambuf_iterator<Ch>());
|
||||
if (stream.fail() || stream.bad())
|
||||
throw runtime_error("error reading stream");
|
||||
m_data.push_back(0);
|
||||
}
|
||||
|
||||
//! Gets file data.
|
||||
//! \return Pointer to data of file.
|
||||
Ch *data()
|
||||
{
|
||||
return &m_data.front();
|
||||
}
|
||||
|
||||
//! Gets file data.
|
||||
//! \return Pointer to data of file.
|
||||
const Ch *data() const
|
||||
{
|
||||
return &m_data.front();
|
||||
}
|
||||
|
||||
//! Gets file data size.
|
||||
//! \return Size of file data, in characters.
|
||||
std::size_t size() const
|
||||
{
|
||||
return m_data.size();
|
||||
}
|
||||
|
||||
private:
|
||||
|
||||
std::vector<Ch> m_data; // File data
|
||||
|
||||
};
|
||||
|
||||
//! Counts children of node. Time complexity is O(n).
|
||||
//! \return Number of children of node
|
||||
template<class Ch>
|
||||
inline std::size_t count_children(xml_node<Ch> *node)
|
||||
{
|
||||
xml_node<Ch> *child = node->first_node();
|
||||
std::size_t count = 0;
|
||||
while (child)
|
||||
{
|
||||
++count;
|
||||
child = child->next_sibling();
|
||||
}
|
||||
return count;
|
||||
}
|
||||
|
||||
//! Counts attributes of node. Time complexity is O(n).
|
||||
//! \return Number of attributes of node
|
||||
template<class Ch>
|
||||
inline std::size_t count_attributes(xml_node<Ch> *node)
|
||||
{
|
||||
xml_attribute<Ch> *attr = node->first_attribute();
|
||||
std::size_t count = 0;
|
||||
while (attr)
|
||||
{
|
||||
++count;
|
||||
attr = attr->next_attribute();
|
||||
}
|
||||
return count;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
#endif
|
||||
99
ext/tmxlite/CMakeLists.txt
Normal file
99
ext/tmxlite/CMakeLists.txt
Normal file
@@ -0,0 +1,99 @@
|
||||
project(tmxlite VERSION 1.3.1)
|
||||
set(PROJECT_NAME tmxlite)
|
||||
|
||||
list(APPEND CMAKE_MODULE_PATH "${CMAKE_CURRENT_SOURCE_DIR}/cmake/modules/")
|
||||
|
||||
if(NOT TMXLITE_STATIC_LIB)
|
||||
SET(TMXLITE_STATIC_LIB FALSE CACHE BOOL "Should tmxlite be built as a static or shared lib?")
|
||||
endif()
|
||||
|
||||
SET(PROJECT_STATIC_RUNTIME FALSE CACHE BOOL "Use statically linked standard/runtime libraries?")
|
||||
|
||||
SET(USE_RTTI TRUE CACHE BOOL "Use run time type information?")
|
||||
|
||||
SET(USE_EXTLIBS FALSE CACHE BOOL "Use external zlib, zstd and pugixml libraries instead of the included source?")
|
||||
SET(USE_ZSTD FALSE CACHE BOOL "Enable zstd compression? (Already set to true if USE_EXTLIBS is true)")
|
||||
|
||||
if(USE_RTTI)
|
||||
if(CMAKE_COMPILER_IS_GNUCXX OR APPLE)
|
||||
if(PROJECT_STATIC_RUNTIME)
|
||||
SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall -static")
|
||||
else()
|
||||
SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall")
|
||||
endif()
|
||||
endif()
|
||||
else()
|
||||
if(CMAKE_COMPILER_IS_GNUCXX OR APPLE)
|
||||
if(PROJECT_STATIC_RUNTIME)
|
||||
SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall -fno-rtti -static")
|
||||
else()
|
||||
SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall -fno-rtti")
|
||||
endif()
|
||||
endif()
|
||||
endif()
|
||||
|
||||
if(TMXLITE_STATIC_LIB)
|
||||
SET(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG} -g -D_DEBUG_ -DTMXLITE_STATIC")
|
||||
SET(CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} -O3 -DNDEBUG -DTMXLITE_STATIC")
|
||||
SET(CMAKE_DEBUG_POSTFIX -s-d)
|
||||
SET(CMAKE_RELEASE_POSTFIX -s)
|
||||
else()
|
||||
SET(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG} -g -D_DEBUG_")
|
||||
SET(CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} -O3 -DNDEBUG")
|
||||
SET(CMAKE_DEBUG_POSTFIX -d)
|
||||
endif()
|
||||
|
||||
# includes the list of source files in the src directory
|
||||
set(PROJECT_DIR ${CMAKE_CURRENT_SOURCE_DIR}/src)
|
||||
include(${PROJECT_DIR}/CMakeLists.txt)
|
||||
|
||||
if(TMXLITE_STATIC_LIB)
|
||||
add_library(${PROJECT_NAME} STATIC ${PROJECT_SRC})
|
||||
else()
|
||||
add_library(${PROJECT_NAME} SHARED ${PROJECT_SRC})
|
||||
endif()
|
||||
|
||||
set_target_properties(${PROJECT_NAME} PROPERTIES
|
||||
CXX_STANDARD 14
|
||||
CXX_STANDARD_REQUIRED ON)
|
||||
|
||||
# disable msvc warning
|
||||
if(MSVC)
|
||||
target_compile_definitions(${PROJECT_NAME} PRIVATE _CRT_SECURE_NO_WARNINGS)
|
||||
endif()
|
||||
|
||||
# if we want external zip and xml libs find them and tell the compiler
|
||||
if(USE_EXTLIBS)
|
||||
target_compile_definitions(${PROJECT_NAME} PRIVATE USE_EXTLIBS)
|
||||
target_compile_definitions(${PROJECT_NAME} PRIVATE USE_ZSTD)
|
||||
|
||||
list(APPEND CMAKE_MODULE_PATH "${CMAKE_SOURCE_DIR}/cmake/modules/")
|
||||
|
||||
find_package(ZLIB REQUIRED)
|
||||
find_package(PUGIXML REQUIRED)
|
||||
find_package(Zstd REQUIRED)
|
||||
|
||||
target_include_directories(${PROJECT_NAME} PRIVATE ${ZLIB_INCLUDE_DIRS} ${PUGIXML_INCLUDE_DIR} ${ZSTD_INCLUDE_DIR})
|
||||
|
||||
else()
|
||||
# add miniz and pugixml from source
|
||||
target_link_libraries(${PROJECT_NAME} pugixml::static External::miniz)
|
||||
|
||||
if(USE_ZSTD)
|
||||
target_compile_definitions(${PROJECT_NAME} PRIVATE USE_ZSTD)
|
||||
|
||||
list(APPEND CMAKE_MODULE_PATH "${CMAKE_SOURCE_DIR}/cmake/modules/")
|
||||
find_package(Zstd REQUIRED)
|
||||
target_include_directories(${PROJECT_NAME} PRIVATE ${ZSTD_INCLUDE_DIR})
|
||||
endif()
|
||||
endif()
|
||||
|
||||
if(USE_EXTLIBS)
|
||||
target_link_libraries(${PROJECT_NAME} ${ZLIB_LIBRARIES} ${PUGIXML_LIBRARY} ${ZSTD_LIBRARY})
|
||||
else()
|
||||
if(USE_ZSTD)
|
||||
target_link_libraries(${PROJECT_NAME} ${ZSTD_LIBRARY})
|
||||
endif()
|
||||
endif()
|
||||
|
||||
target_include_directories(${PROJECT_NAME} PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/include)
|
||||
10
ext/tmxlite/cmake/modules/FindPUGIXML.cmake
Normal file
10
ext/tmxlite/cmake/modules/FindPUGIXML.cmake
Normal file
@@ -0,0 +1,10 @@
|
||||
find_path(PUGIXML_INCLUDE_DIR NAMES pugixml.hpp)
|
||||
find_library(PUGIXML_LIBRARY NAMES pugixml)
|
||||
|
||||
include(FindPackageHandleStandardArgs)
|
||||
find_package_handle_standard_args(PUGIXML DEFAULT_MSG
|
||||
PUGIXML_LIBRARY PUGIXML_INCLUDE_DIR)
|
||||
|
||||
mark_as_advanced(PUGIXML_INCLUDE_DIR
|
||||
PUGIXML_LIBRARY)
|
||||
|
||||
10
ext/tmxlite/cmake/modules/FindTMXLITE.cmake
Normal file
10
ext/tmxlite/cmake/modules/FindTMXLITE.cmake
Normal file
@@ -0,0 +1,10 @@
|
||||
include(FindPackageHandleStandardArgs)
|
||||
|
||||
# Search for the header file
|
||||
find_path(TMXLITE_INCLUDE_DIR NAMES tmxlite/Config.hpp PATH_SUFFIXES include)
|
||||
|
||||
# Search for the library
|
||||
find_library(TMXLITE_LIBRARIES NAMES tmxlite PATH_SUFFIXES lib)
|
||||
|
||||
# Did we find everything we need?
|
||||
FIND_PACKAGE_HANDLE_STANDARD_ARGS(tmxlite DEFAULT_MSG TMXLITE_LIBRARIES TMXLITE_INCLUDE_DIR)
|
||||
41
ext/tmxlite/cmake/modules/FindZstd.cmake
Normal file
41
ext/tmxlite/cmake/modules/FindZstd.cmake
Normal file
@@ -0,0 +1,41 @@
|
||||
# Copyright (c) Meta Platforms, Inc. and affiliates.
|
||||
#
|
||||
# Licensed under the Apache License, Version 2.0 (the "License");
|
||||
# you may not use this file except in compliance with the License.
|
||||
# You may obtain a copy of the License at
|
||||
#
|
||||
# http://www.apache.org/licenses/LICENSE-2.0
|
||||
#
|
||||
# Unless required by applicable law or agreed to in writing, software
|
||||
# distributed under the License is distributed on an "AS IS" BASIS,
|
||||
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
# See the License for the specific language governing permissions and
|
||||
# limitations under the License.
|
||||
|
||||
#
|
||||
# - Try to find Facebook zstd library
|
||||
# This will define
|
||||
# ZSTD_FOUND
|
||||
# ZSTD_INCLUDE_DIR
|
||||
# ZSTD_LIBRARY
|
||||
#
|
||||
|
||||
find_path(ZSTD_INCLUDE_DIR NAMES zstd.h)
|
||||
|
||||
find_library(ZSTD_LIBRARY_DEBUG NAMES zstdd zstd_staticd)
|
||||
find_library(ZSTD_LIBRARY_RELEASE NAMES zstd zstd_static)
|
||||
|
||||
include(SelectLibraryConfigurations)
|
||||
SELECT_LIBRARY_CONFIGURATIONS(ZSTD)
|
||||
|
||||
include(FindPackageHandleStandardArgs)
|
||||
FIND_PACKAGE_HANDLE_STANDARD_ARGS(
|
||||
ZSTD DEFAULT_MSG
|
||||
ZSTD_LIBRARY ZSTD_INCLUDE_DIR
|
||||
)
|
||||
|
||||
if (ZSTD_FOUND)
|
||||
message(STATUS "Found Zstd: ${ZSTD_LIBRARY}")
|
||||
endif()
|
||||
|
||||
mark_as_advanced(ZSTD_INCLUDE_DIR ZSTD_LIBRARY)
|
||||
64
ext/tmxlite/include/tmxlite/Config.hpp
Normal file
64
ext/tmxlite/include/tmxlite/Config.hpp
Normal file
@@ -0,0 +1,64 @@
|
||||
/*********************************************************************
|
||||
(c) Matt Marchant 2016 - 2021
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
//check which platform we're on and create export macros as necessary
|
||||
#if !defined(TMXLITE_STATIC)
|
||||
|
||||
#if defined(_WIN32)
|
||||
|
||||
//windows compilers need specific (and different) keywords for export
|
||||
#define TMXLITE_EXPORT_API __declspec(dllexport)
|
||||
|
||||
//for vc compilers we also need to turn off this annoying C4251 warning
|
||||
#ifdef _MSC_VER
|
||||
#pragma warning(disable: 4251)
|
||||
#endif //_MSC_VER
|
||||
|
||||
#else //linux, FreeBSD, Mac OS X
|
||||
|
||||
#if __GNUC__ >= 4
|
||||
|
||||
//gcc 4 has special keywords for showing/hiding symbols,
|
||||
//the same keyword is used for both importing and exporting
|
||||
#define TMXLITE_EXPORT_API __attribute__ ((__visibility__ ("default")))
|
||||
|
||||
#else
|
||||
|
||||
//gcc < 4 has no mechanism to explicitly hide symbols, everything's exported
|
||||
#define TMXLITE_EXPORT_API
|
||||
#endif //__GNUC__
|
||||
|
||||
#endif //_WIN32
|
||||
|
||||
#else
|
||||
|
||||
//static build doesn't need import/export macros
|
||||
#define TMXLITE_EXPORT_API
|
||||
|
||||
#endif //TMXLITE_STATIC
|
||||
226
ext/tmxlite/include/tmxlite/FreeFuncs.hpp
Normal file
226
ext/tmxlite/include/tmxlite/FreeFuncs.hpp
Normal file
@@ -0,0 +1,226 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2021
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
/*********************************************************************
|
||||
base64_decode
|
||||
|
||||
Copyright (C) 2004-2008 René Nyffenegger
|
||||
This source code is provided 'as-is', without any express or implied
|
||||
warranty. In no event will the author be held liable for any damages
|
||||
arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute it
|
||||
freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this source code must not be misrepresented; you must not
|
||||
claim that you wrote the original source code. If you use this source code
|
||||
in a product, an acknowledgment in the product documentation would be
|
||||
appreciated but is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such, and must not be
|
||||
misrepresented as being the original source code.
|
||||
3. This notice may not be removed or altered from any source distribution.
|
||||
|
||||
René Nyffenegger rene.nyffenegger@adp-gmbh.ch
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/detail/Android.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
#include <tmxlite/Types.hpp>
|
||||
|
||||
#include <string>
|
||||
#include <sstream>
|
||||
#include <vector>
|
||||
#include <functional>
|
||||
#include <algorithm>
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
//using inline here just to supress unused warnings on gcc
|
||||
bool decompress(const char* source, std::vector<unsigned char>& dest, std::size_t inSize, std::size_t expectedSize);
|
||||
|
||||
static inline std::string base64_decode(std::string const& encoded_string)
|
||||
{
|
||||
static const std::string base64_chars =
|
||||
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
|
||||
"abcdefghijklmnopqrstuvwxyz"
|
||||
"0123456789+/";
|
||||
|
||||
std::function<bool(unsigned char)> is_base64 =
|
||||
[](unsigned char c)->bool
|
||||
{
|
||||
return (isalnum(c) || (c == '+') || (c == '/'));
|
||||
};
|
||||
|
||||
auto in_len = encoded_string.size();
|
||||
int i = 0;
|
||||
int j = 0;
|
||||
int in_ = 0;
|
||||
unsigned char char_array_4[4], char_array_3[3];
|
||||
std::string ret;
|
||||
|
||||
while (in_len-- && (encoded_string[in_] != '=') && is_base64(encoded_string[in_]))
|
||||
{
|
||||
char_array_4[i++] = encoded_string[in_]; in_++;
|
||||
if (i == 4)
|
||||
{
|
||||
for (i = 0; i < 4; i++)
|
||||
{
|
||||
char_array_4[i] = static_cast<unsigned char>(base64_chars.find(char_array_4[i]));
|
||||
}
|
||||
char_array_3[0] = (char_array_4[0] << 2) + ((char_array_4[1] & 0x30) >> 4);
|
||||
char_array_3[1] = ((char_array_4[1] & 0xf) << 4) + ((char_array_4[2] & 0x3c) >> 2);
|
||||
char_array_3[2] = ((char_array_4[2] & 0x3) << 6) + char_array_4[3];
|
||||
|
||||
for (i = 0; (i < 3); i++)
|
||||
{
|
||||
ret += char_array_3[i];
|
||||
}
|
||||
i = 0;
|
||||
}
|
||||
}
|
||||
|
||||
if (i)
|
||||
{
|
||||
for (j = i; j < 4; j++)
|
||||
{
|
||||
char_array_4[j] = 0;
|
||||
}
|
||||
|
||||
for (j = 0; j < 4; j++)
|
||||
{
|
||||
char_array_4[j] = static_cast<unsigned char>(base64_chars.find(char_array_4[j]));
|
||||
}
|
||||
|
||||
char_array_3[0] = (char_array_4[0] << 2) + ((char_array_4[1] & 0x30) >> 4);
|
||||
char_array_3[1] = ((char_array_4[1] & 0xf) << 4) + ((char_array_4[2] & 0x3c) >> 2);
|
||||
char_array_3[2] = ((char_array_4[2] & 0x3) << 6) + char_array_4[3];
|
||||
|
||||
for (j = 0; (j < i - 1); j++)
|
||||
{
|
||||
ret += char_array_3[j];
|
||||
}
|
||||
}
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
static inline Colour colourFromString(std::string str)
|
||||
{
|
||||
//removes preceding #
|
||||
auto result = str.find_last_of('#');
|
||||
if (result != std::string::npos)
|
||||
{
|
||||
str = str.substr(result + 1);
|
||||
}
|
||||
|
||||
if (str.size() == 6 || str.size() == 8)
|
||||
{
|
||||
unsigned int value, r, g, b;
|
||||
unsigned int a = 255;
|
||||
std::stringstream input(str);
|
||||
input >> std::hex >> value;
|
||||
|
||||
r = (value >> 16) & 0xff;
|
||||
g = (value >> 8) & 0xff;
|
||||
b = value & 0xff;
|
||||
|
||||
if (str.size() == 8)
|
||||
{
|
||||
a = (value >> 24) & 0xff;
|
||||
}
|
||||
|
||||
return{ std::uint8_t(r), std::uint8_t(g), std::uint8_t(b), std::uint8_t(a) };
|
||||
}
|
||||
Logger::log(str + ": not a valid colour string", Logger::Type::Error);
|
||||
return{};
|
||||
}
|
||||
|
||||
static inline std::string resolveFilePath(std::string path, const std::string& workingDir)
|
||||
{
|
||||
static const std::string match("../");
|
||||
std::size_t result = path.find(match);
|
||||
std::size_t count = 0;
|
||||
while (result != std::string::npos)
|
||||
{
|
||||
count++;
|
||||
path = path.substr(result + match.size());
|
||||
result = path.find(match);
|
||||
}
|
||||
|
||||
if (workingDir.empty()) return path;
|
||||
|
||||
std::string outPath = workingDir;
|
||||
for (auto i = 0u; i < count; ++i)
|
||||
{
|
||||
result = outPath.find_last_of('/');
|
||||
if (result != std::string::npos)
|
||||
{
|
||||
outPath = outPath.substr(0, result);
|
||||
}
|
||||
}
|
||||
// this does only work on windows
|
||||
#ifndef __ANDROID__
|
||||
return outPath + '/' + path;
|
||||
#endif
|
||||
|
||||
// todo: make resolveFilePath work with subfolders on
|
||||
// android - currently only the root folder is working
|
||||
|
||||
#ifdef __ANDROID__
|
||||
return path;
|
||||
#endif
|
||||
}
|
||||
|
||||
static inline std::string getFilePath(const std::string& path)
|
||||
{
|
||||
//TODO this doesn't actually check that there is a file at the
|
||||
//end of the path, or that it's even a valid path...
|
||||
|
||||
static auto searchFunc = [](const char separator, const std::string& path)->std::string
|
||||
{
|
||||
std::size_t i = path.rfind(separator, path.length());
|
||||
if (i != std::string::npos)
|
||||
{
|
||||
return(path.substr(0, i + 1));
|
||||
}
|
||||
|
||||
return "";
|
||||
};
|
||||
|
||||
|
||||
#ifdef _WIN32 //try windows formatted paths first
|
||||
std::string retVal = searchFunc('\\', path);
|
||||
if (!retVal.empty()) return retVal;
|
||||
#endif
|
||||
|
||||
return searchFunc('/', path);
|
||||
}
|
||||
} //namespacec tmx
|
||||
107
ext/tmxlite/include/tmxlite/ImageLayer.hpp
Normal file
107
ext/tmxlite/include/tmxlite/ImageLayer.hpp
Normal file
@@ -0,0 +1,107 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2022
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Config.hpp>
|
||||
#include <tmxlite/Layer.hpp>
|
||||
#include <tmxlite/Types.hpp>
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
/*!
|
||||
\brief Image layers contain a single image which make up that
|
||||
layer. The parser contains the fully resolved path to the image
|
||||
relative to the working directory.
|
||||
*/
|
||||
class TMXLITE_EXPORT_API ImageLayer final : public Layer
|
||||
{
|
||||
public:
|
||||
explicit ImageLayer(const std::string&);
|
||||
|
||||
Type getType() const override { return Layer::Type::Image; }
|
||||
void parse(const pugi::xml_node&, Map*) override;
|
||||
|
||||
/*!
|
||||
\brief Returns the path, relative to the working directory,
|
||||
of the image used by the image layer.
|
||||
*/
|
||||
const std::string& getImagePath() const { return m_filePath; }
|
||||
|
||||
/*!
|
||||
\brief Returns the colour used by the image to represent transparent
|
||||
pixels. By default this is (0, 0, 0, 0)
|
||||
*/
|
||||
const Colour& getTransparencyColour() const { return m_transparencyColour; }
|
||||
|
||||
/*!
|
||||
\brief Returns true if the image used by this layer specifically states a
|
||||
colour to use as transparency
|
||||
*/
|
||||
bool hasTransparency() const { return m_hasTransparency; }
|
||||
|
||||
/*!
|
||||
\brief Returns the size of the image of the image layer in pixels.
|
||||
*/
|
||||
const Vector2u& getImageSize() const { return m_imageSize; }
|
||||
|
||||
/*!
|
||||
\brief Returns true if the image drawn by this layer is repeated along
|
||||
the X axis.
|
||||
*/
|
||||
bool hasRepeatX() const { return m_hasRepeatX; }
|
||||
|
||||
/*!
|
||||
\brief Returns true if the image drawn by this layer is repeated along
|
||||
the Y axis.
|
||||
*/
|
||||
bool hasRepeatY() const { return m_hasRepeatY; }
|
||||
|
||||
private:
|
||||
std::string m_workingDir;
|
||||
std::string m_filePath;
|
||||
Colour m_transparencyColour;
|
||||
bool m_hasTransparency;
|
||||
Vector2u m_imageSize;
|
||||
bool m_hasRepeatX;
|
||||
bool m_hasRepeatY;
|
||||
};
|
||||
|
||||
template <>
|
||||
inline ImageLayer& Layer::getLayerAs<ImageLayer>()
|
||||
{
|
||||
assert(getType() == Type::Image);
|
||||
return *static_cast<ImageLayer*>(this);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline const ImageLayer& Layer::getLayerAs<ImageLayer>() const
|
||||
{
|
||||
assert(getType() == Type::Image);
|
||||
return *static_cast<const ImageLayer*>(this);
|
||||
}
|
||||
}
|
||||
175
ext/tmxlite/include/tmxlite/Layer.hpp
Normal file
175
ext/tmxlite/include/tmxlite/Layer.hpp
Normal file
@@ -0,0 +1,175 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2023
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Config.hpp>
|
||||
#include <tmxlite/Property.hpp>
|
||||
#include <tmxlite/Types.hpp>
|
||||
|
||||
#include <string>
|
||||
#include <memory>
|
||||
#include <vector>
|
||||
|
||||
namespace pugi
|
||||
{
|
||||
class xml_node;
|
||||
}
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
class Map;
|
||||
class TileLayer;
|
||||
class ObjectGroup;
|
||||
class ImageLayer;
|
||||
class LayerGroup;
|
||||
/*!
|
||||
\brief Represents a layer of a tmx format tile map.
|
||||
This is an abstract base class from which all layer
|
||||
types are derived.
|
||||
*/
|
||||
class TMXLITE_EXPORT_API Layer
|
||||
{
|
||||
public:
|
||||
using Ptr = std::unique_ptr<Layer>;
|
||||
|
||||
Layer() : m_opacity(1.f), m_visible(true) {};
|
||||
virtual ~Layer() = default;
|
||||
|
||||
/*!
|
||||
\brief Layer type as returned by getType()
|
||||
Tile: this layer is a TileLayer type
|
||||
Object: This layer is an ObjectGroup type
|
||||
Image: This layer is an ImageLayer type
|
||||
Group: This layer is a LayerGroup type
|
||||
*/
|
||||
enum class Type
|
||||
{
|
||||
Tile,
|
||||
Object,
|
||||
Image,
|
||||
Group
|
||||
};
|
||||
|
||||
/*!
|
||||
\brief Returns a Type value representing the concrete type.
|
||||
Use this when deciding which conrete layer type to use when
|
||||
calling the templated function getLayerAs<T>()
|
||||
*/
|
||||
virtual Type getType() const = 0;
|
||||
|
||||
/*!
|
||||
\brief Returns the class of the Layer, as defined in the editor Tiled 1.9+
|
||||
*/
|
||||
const std::string& getClass() const { return m_class; }
|
||||
|
||||
/*!
|
||||
\brief Use this to get a reference to the concrete layer type
|
||||
which this layer points to.
|
||||
Use getType() to return the type value of this layer and determine
|
||||
if the concrete type is TileLayer, ObjectGroup, ImageLayer, or LayerGroup
|
||||
*/
|
||||
template <typename T>
|
||||
T& getLayerAs();
|
||||
|
||||
|
||||
template <typename T>
|
||||
const T& getLayerAs() const;
|
||||
|
||||
/*!
|
||||
\brief Attempts to parse the specific node layer type
|
||||
*/
|
||||
virtual void parse(const pugi::xml_node&, Map* = nullptr) = 0;
|
||||
|
||||
/*!
|
||||
\brief Returns the name of the layer
|
||||
*/
|
||||
const std::string& getName() const { return m_name; }
|
||||
|
||||
/*!
|
||||
\brief Returns the opacity value for the layer
|
||||
*/
|
||||
float getOpacity() const { return m_opacity; }
|
||||
|
||||
/*!
|
||||
\brief Returns whether this layer is visible or not
|
||||
*/
|
||||
bool getVisible() const { return m_visible; }
|
||||
|
||||
/*!
|
||||
\brief Returns the offset from the top left corner
|
||||
of the layer, in pixels
|
||||
*/
|
||||
const Vector2i& getOffset() const { return m_offset; }
|
||||
|
||||
/*!
|
||||
\brief Returns the parallax factor
|
||||
*/
|
||||
const Vector2f& getParallaxFactor() const { return m_parallaxFactor; }
|
||||
|
||||
/*!
|
||||
\brief Returns the tint colour of the layer.
|
||||
Defaults to 0xFFFFFFFF - pure white
|
||||
*/
|
||||
Colour getTintColour() const { return m_tintColour; }
|
||||
|
||||
/*!
|
||||
\brief Returns the size of the layer, in pixels.
|
||||
This will be the same as the map size for fixed size maps.
|
||||
*/
|
||||
const Vector2u& getSize() const { return m_size; }
|
||||
|
||||
/*!
|
||||
\brief Returns the list of properties of this layer
|
||||
*/
|
||||
const std::vector<Property>& getProperties() const { return m_properties; }
|
||||
|
||||
protected:
|
||||
|
||||
void setName(const std::string& name) { m_name = name; }
|
||||
void setClass(const std::string& cls) { m_class = cls; }
|
||||
void setOpacity(float opacity) { m_opacity = opacity; }
|
||||
void setVisible(bool visible) { m_visible = visible; }
|
||||
void setOffset(std::int32_t x, std::int32_t y) { m_offset = Vector2i(x, y); }
|
||||
void setParallaxFactor(float x, float y) { m_parallaxFactor.x = x; m_parallaxFactor.y = y; }
|
||||
void setTintColour(Colour c) { m_tintColour = c; }
|
||||
void setSize(std::uint32_t width, std::uint32_t height) { m_size = Vector2u(width, height); }
|
||||
void addProperty(const pugi::xml_node& node) { m_properties.emplace_back(); m_properties.back().parse(node); }
|
||||
|
||||
private:
|
||||
std::string m_name;
|
||||
std::string m_class;
|
||||
float m_opacity;
|
||||
bool m_visible;
|
||||
Vector2i m_offset;
|
||||
Vector2f m_parallaxFactor;
|
||||
Colour m_tintColour = { 255,255,255,255 };
|
||||
Vector2u m_size;
|
||||
|
||||
std::vector<Property> m_properties;
|
||||
};
|
||||
}
|
||||
86
ext/tmxlite/include/tmxlite/LayerGroup.hpp
Normal file
86
ext/tmxlite/include/tmxlite/LayerGroup.hpp
Normal file
@@ -0,0 +1,86 @@
|
||||
/*********************************************************************
|
||||
Grant Gangi 2019 - 2022
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Config.hpp>
|
||||
#include <tmxlite/Layer.hpp>
|
||||
#include <tmxlite/Types.hpp>
|
||||
|
||||
#include <vector>
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
/*!
|
||||
\brief Layer groups are used to organize the layers of
|
||||
the map in a hierarchy. They can contain all other layer
|
||||
types including more layer groups to further nest layers.
|
||||
*/
|
||||
class TMXLITE_EXPORT_API LayerGroup final : public Layer
|
||||
{
|
||||
public:
|
||||
|
||||
LayerGroup(const std::string& workDir, const Vector2u& tileCount);
|
||||
~LayerGroup() = default;
|
||||
LayerGroup(const LayerGroup&) = delete;
|
||||
const LayerGroup& operator = (const LayerGroup&) = delete;
|
||||
LayerGroup(LayerGroup&&) = default;
|
||||
LayerGroup& operator = (LayerGroup&&) = default;
|
||||
|
||||
|
||||
Type getType() const override { return Layer::Type::Group; }
|
||||
void parse(const pugi::xml_node&, Map*) override;
|
||||
|
||||
/*!
|
||||
\brief Returns a reference to the vector containing the layer data.
|
||||
Layers are pointer-to-baseclass, the concrete type of which can be
|
||||
found via Layer::getType()
|
||||
\see Layer
|
||||
*/
|
||||
const std::vector<Layer::Ptr>& getLayers() const { return m_layers; }
|
||||
|
||||
private:
|
||||
|
||||
std::vector<Layer::Ptr> m_layers;
|
||||
|
||||
std::string m_workingDir;
|
||||
Vector2u m_tileCount;
|
||||
};
|
||||
|
||||
template <>
|
||||
inline LayerGroup& Layer::getLayerAs<LayerGroup>()
|
||||
{
|
||||
assert(getType() == Type::Group);
|
||||
return *static_cast<LayerGroup*>(this);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline const LayerGroup& Layer::getLayerAs<LayerGroup>() const
|
||||
{
|
||||
assert(getType() == Type::Group);
|
||||
return *static_cast<const LayerGroup*>(this);
|
||||
}
|
||||
}
|
||||
282
ext/tmxlite/include/tmxlite/Map.hpp
Normal file
282
ext/tmxlite/include/tmxlite/Map.hpp
Normal file
@@ -0,0 +1,282 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 -2021
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Tileset.hpp>
|
||||
#include <tmxlite/Layer.hpp>
|
||||
#include <tmxlite/Property.hpp>
|
||||
#include <tmxlite/Types.hpp>
|
||||
#include <tmxlite/Object.hpp>
|
||||
|
||||
#include <string>
|
||||
#include <vector>
|
||||
#include <map>
|
||||
#include <unordered_map>
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
/*!
|
||||
\brief Holds the xml version of the loaded map
|
||||
*/
|
||||
struct TMXLITE_EXPORT_API Version
|
||||
{
|
||||
//major/minor are apparently reserved by gcc
|
||||
std::uint16_t upper;
|
||||
std::uint16_t lower;
|
||||
Version(std::uint16_t maj = 0, std::uint16_t min = 0)
|
||||
: upper(maj), lower(min) {}
|
||||
};
|
||||
|
||||
enum class Orientation
|
||||
{
|
||||
Orthogonal,
|
||||
Isometric,
|
||||
Staggered,
|
||||
Hexagonal,
|
||||
None
|
||||
};
|
||||
|
||||
enum class RenderOrder
|
||||
{
|
||||
RightDown,
|
||||
RightUp,
|
||||
LeftDown,
|
||||
LeftUp,
|
||||
None
|
||||
};
|
||||
|
||||
enum class StaggerAxis
|
||||
{
|
||||
X, Y, None
|
||||
};
|
||||
|
||||
enum class StaggerIndex
|
||||
{
|
||||
Even, Odd, None
|
||||
};
|
||||
|
||||
/*!
|
||||
\brief Parser for TMX format tile maps.
|
||||
This class can be used to parse the XML format tile maps created
|
||||
with the Tiled map editor, providing an interface to create drawable and
|
||||
physics objects. Typical usage would be to create an instance of this
|
||||
class before calling load() providing a path to the *.tmx file to be
|
||||
loaded. Then layers or objects can be requested from the Map class
|
||||
to be interpreted as needed.
|
||||
\see https://doc.mapeditor.org/en/stable/reference/tmx-map-format/#map
|
||||
*/
|
||||
class TMXLITE_EXPORT_API Map final
|
||||
{
|
||||
public:
|
||||
|
||||
Map();
|
||||
~Map() = default;
|
||||
Map(const Map&) = delete;
|
||||
Map& operator = (const Map&) = delete;
|
||||
Map(Map&&) = default;
|
||||
Map& operator = (Map&&) = default;
|
||||
|
||||
/*!
|
||||
\brief Attempts to parse the tilemap at the given location.
|
||||
\param std::string Path to map file to try to parse
|
||||
\returns true if map was parsed successfully else returns false.
|
||||
In debug mode this will attempt to log any errors to the console.
|
||||
*/
|
||||
bool load(const std::string&);
|
||||
|
||||
/*!
|
||||
\brief Loads a map from a document stored in a string
|
||||
\param data A std::string containing the map data to load
|
||||
\param workingDir A std::string containing the working directory
|
||||
in which to find assets such as tile sets or images
|
||||
\returns true if successful, else false
|
||||
*/
|
||||
bool loadFromString(const std::string& data, const std::string& workingDir);
|
||||
|
||||
/*!
|
||||
\brief Returns the version of the tile map last parsed.
|
||||
If no tile map has yet been parsed the version will read 0, 0
|
||||
*/
|
||||
const Version& getVersion() const { return m_version; }
|
||||
|
||||
/*!
|
||||
\brief Returns the orientation of the map if one is loaded,
|
||||
else returns None
|
||||
*/
|
||||
Orientation getOrientation() const { return m_orientation; }
|
||||
|
||||
/*!
|
||||
\brief Returns the RenderOrder of the map if one is loaded,
|
||||
else returns None
|
||||
*/
|
||||
RenderOrder getRenderOrder() const { return m_renderOrder; }
|
||||
|
||||
/*!
|
||||
\brief Returns the tile count of the map in the X and Y directions
|
||||
*/
|
||||
const Vector2u& getTileCount() const { return m_tileCount; }
|
||||
|
||||
/*!
|
||||
\brief Returns the size of the tile grid in this map.
|
||||
Actual tile sizes may vary and will be extended / shrunk about
|
||||
the bottom left corner of the tile.
|
||||
*/
|
||||
const Vector2u& getTileSize() const { return m_tileSize; }
|
||||
|
||||
/*!
|
||||
\brief Returns the bounds of the map
|
||||
*/
|
||||
FloatRect getBounds() const { return FloatRect(0.f, 0.f, static_cast<float>(m_tileCount.x * m_tileSize.x), static_cast<float>(m_tileCount.y * m_tileSize.y)); }
|
||||
|
||||
/*!
|
||||
\brief Returns the length of an edge of a tile if a Hexagonal
|
||||
map is loaded.
|
||||
The length returned is in pixels of the straight edge running
|
||||
along the axis returned by getStaggerAxis(). If no map is loaded
|
||||
or the loaded map is not of Hexagonal orientation this function
|
||||
returns 0.f
|
||||
*/
|
||||
float getHexSideLength() const { return m_hexSideLength; }
|
||||
|
||||
/*!
|
||||
\brief Stagger axis of the map.
|
||||
If either a Staggered or Hexagonal tile map is loaded this returns
|
||||
which axis the map is staggered along, else returns None.
|
||||
*/
|
||||
StaggerAxis getStaggerAxis() const { return m_staggerAxis; }
|
||||
|
||||
/*!
|
||||
\brief Stagger Index of the loaded map.
|
||||
If a Staggered or Hexagonal map is loaded this returns whether
|
||||
the even or odd rows of tiles are staggered, otherwise it returns None.
|
||||
*/
|
||||
StaggerIndex getStaggerIndex() const { return m_staggerIndex; }
|
||||
|
||||
/*!
|
||||
\brief Returns the background colour of the map.
|
||||
*/
|
||||
const Colour& getBackgroundColour() const { return m_backgroundColour; }
|
||||
|
||||
/*!
|
||||
\brief Returns a reference to the vector of tile sets used by the map
|
||||
*/
|
||||
const std::vector<Tileset>& getTilesets() const { return m_tilesets; }
|
||||
|
||||
/*!
|
||||
\brief Returns a reference to the vector containing the layer data.
|
||||
Layers are pointer-to-baseclass, the concrete type of which can be
|
||||
found via Layer::getType()
|
||||
\see Layer
|
||||
*/
|
||||
const std::vector<Layer::Ptr>& getLayers() const { return m_layers; }
|
||||
|
||||
/*!
|
||||
\brief Returns the class of the Map, as defined in the editor Tiled 1.9+
|
||||
*/
|
||||
const std::string& getClass() const { return m_class; }
|
||||
|
||||
/*!
|
||||
\brief Returns a vector of Property objects loaded by the map
|
||||
*/
|
||||
const std::vector<Property>& getProperties() const { return m_properties; }
|
||||
|
||||
/*!
|
||||
\brief Returns a Hashmap of all animated tiles accessible by TileID
|
||||
*/
|
||||
const std::map<std::uint32_t, Tileset::Tile>& getAnimatedTiles() const { return m_animTiles; }
|
||||
|
||||
/*!
|
||||
\brief Returns the current working directory of the map. Images and
|
||||
other resources are loaded relative to this.
|
||||
*/
|
||||
const std::string& getWorkingDirectory() const { return m_workingDirectory; }
|
||||
|
||||
/*!
|
||||
\brief Returns an unordered_map of template objects indexed by file name
|
||||
*/
|
||||
std::unordered_map<std::string, Object>& getTemplateObjects() { return m_templateObjects; }
|
||||
const std::unordered_map<std::string, Object>& getTemplateObjects() const { return m_templateObjects; }
|
||||
|
||||
/*!
|
||||
\brief Returns an unordered_map of tilesets used by templated objects.
|
||||
If Object::getTilesetName() is not empty it can be used to retreive a tileset
|
||||
from this map. Otherwise the object's tileset can be found from in the map's
|
||||
global tilesets returned by getTilesets().
|
||||
*/
|
||||
std::unordered_map<std::string, Tileset>& getTemplateTilesets() { return m_templateTilesets; }
|
||||
const std::unordered_map<std::string, Tileset>& getTemplateTilesets() const { return m_templateTilesets; }
|
||||
|
||||
/*!
|
||||
\brief Returns true if this is in infinite tile map.
|
||||
Infinite maps store their tile data in for tile layers in chunks. If
|
||||
this is an infinite map use TileLayer::getChunks() to get tile IDs
|
||||
rather than TileLayer::getTiles().
|
||||
\see TileLayer
|
||||
*/
|
||||
bool isInfinite() const { return m_infinite; }
|
||||
|
||||
/*
|
||||
\brief Returns the origin of each layer's parallax offset value
|
||||
*/
|
||||
Vector2f getParallaxOrigin() const { return m_parallaxOrigin; }
|
||||
|
||||
private:
|
||||
Version m_version;
|
||||
std::string m_class;
|
||||
Orientation m_orientation;
|
||||
RenderOrder m_renderOrder;
|
||||
bool m_infinite;
|
||||
|
||||
Vector2u m_tileCount;
|
||||
Vector2u m_tileSize;
|
||||
|
||||
float m_hexSideLength;
|
||||
StaggerAxis m_staggerAxis;
|
||||
StaggerIndex m_staggerIndex;
|
||||
|
||||
Vector2f m_parallaxOrigin;
|
||||
|
||||
Colour m_backgroundColour;
|
||||
|
||||
std::string m_workingDirectory;
|
||||
|
||||
std::vector<Tileset> m_tilesets;
|
||||
std::vector<Layer::Ptr> m_layers;
|
||||
std::vector<Property> m_properties;
|
||||
std::map<std::uint32_t, Tileset::Tile> m_animTiles;
|
||||
|
||||
std::unordered_map<std::string, Object> m_templateObjects;
|
||||
std::unordered_map<std::string, Tileset> m_templateTilesets;
|
||||
|
||||
bool parseMapNode(const pugi::xml_node&);
|
||||
|
||||
//always returns false so we can return this
|
||||
//on load failure
|
||||
bool reset();
|
||||
};
|
||||
}
|
||||
221
ext/tmxlite/include/tmxlite/Object.hpp
Normal file
221
ext/tmxlite/include/tmxlite/Object.hpp
Normal file
@@ -0,0 +1,221 @@
|
||||
/*********************************************************************
|
||||
(c) Matt Marchant 2016 - 2021
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Config.hpp>
|
||||
#include <tmxlite/Property.hpp>
|
||||
#include <tmxlite/Types.hpp>
|
||||
|
||||
#include <string>
|
||||
#include <vector>
|
||||
|
||||
namespace pugi
|
||||
{
|
||||
class xml_node;
|
||||
}
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
class Map;
|
||||
|
||||
/*!
|
||||
\brief Contains the text information stored in a Text object.
|
||||
*/
|
||||
struct TMXLITE_EXPORT_API Text final
|
||||
{
|
||||
std::string fontFamily;
|
||||
std::uint32_t pixelSize = 16; //!< pixels, not points
|
||||
bool wrap = false;
|
||||
Colour colour;
|
||||
bool bold = false;
|
||||
bool italic = false;
|
||||
bool underline = false;
|
||||
bool strikethough = false;
|
||||
bool kerning = true;
|
||||
|
||||
enum class HAlign
|
||||
{
|
||||
Left, Centre, Right
|
||||
}hAlign = HAlign::Left;
|
||||
|
||||
enum class VAlign
|
||||
{
|
||||
Top, Centre, Bottom
|
||||
}vAlign = VAlign::Top;
|
||||
|
||||
std::string content; //!< actual string content
|
||||
};
|
||||
|
||||
/*!
|
||||
\brief Objects are stored in ObjectGroup layers.
|
||||
Objects may be rectangular, elliptical, polygonal or
|
||||
a polyline. Rectangular and elliptical Objects have their
|
||||
size determined via the AABB, whereas polygon and polyline
|
||||
shapes are defined by a list of points. Objects are
|
||||
rectangular by default. Since version 1.0 Objects also
|
||||
support Text nodes.
|
||||
*/
|
||||
class TMXLITE_EXPORT_API Object final
|
||||
{
|
||||
public:
|
||||
enum class Shape
|
||||
{
|
||||
Rectangle,
|
||||
Ellipse,
|
||||
Point,
|
||||
Polygon,
|
||||
Polyline,
|
||||
Text
|
||||
};
|
||||
|
||||
Object();
|
||||
|
||||
/*!
|
||||
\brief Attempts to parse the given xml node and
|
||||
read the Object properties if it is valid.
|
||||
*/
|
||||
void parse(const pugi::xml_node&, Map*);
|
||||
|
||||
/*!
|
||||
\brief Returns the unique ID of the Object
|
||||
*/
|
||||
std::uint32_t getUID() const { return m_UID; }
|
||||
|
||||
/*!
|
||||
\brief Returns the name of the Object
|
||||
*/
|
||||
const std::string& getName() const { return m_name; }
|
||||
|
||||
/*!
|
||||
\brief Returns the type (equal to class) of the Object, as defined in the editor Tiled < 1.9
|
||||
*/
|
||||
const std::string& getType() const { return m_class; }
|
||||
|
||||
/*!
|
||||
\brief Returns the class (equal to type) of the Object, as defined in the editor Tiled 1.9+
|
||||
*/
|
||||
const std::string& getClass() const { return m_class; }
|
||||
|
||||
/*!
|
||||
\brief Returns the position of the Object in pixels
|
||||
*/
|
||||
const Vector2f& getPosition() const { return m_position; }
|
||||
|
||||
/*!
|
||||
\brief Returns the global Axis Aligned Bounding Box.
|
||||
The AABB is positioned via the left and top properties, and
|
||||
define the Object's width and height. This can be used to derive
|
||||
the shape of the Object if it is rectangular or elliptical.
|
||||
*/
|
||||
const FloatRect& getAABB() const { return m_AABB; }
|
||||
|
||||
/*!
|
||||
\brief Returns the rotation of the Object in degrees clockwise
|
||||
*/
|
||||
float getRotation() const { return m_rotation; }
|
||||
|
||||
/*!
|
||||
\brief Returns the global tile ID associated with the Object
|
||||
if there is one. This is used to draw the Object (and therefore
|
||||
the Object must be rectangular)
|
||||
*/
|
||||
std::uint32_t getTileID() const { return m_tileID; }
|
||||
|
||||
/*!
|
||||
\brief Returns the flip flags if the objects uses a TileID to
|
||||
draw it.
|
||||
Returns 0 otherwise.
|
||||
*/
|
||||
std::uint8_t getFlipFlags() const { return m_flipFlags; }
|
||||
|
||||
/*!
|
||||
\brief Returns whether or not the Object is visible
|
||||
*/
|
||||
bool visible() const { return m_visible; }
|
||||
|
||||
/*!
|
||||
\brief Returns the Shape type of the Object
|
||||
*/
|
||||
Shape getShape() const { return m_shape; }
|
||||
|
||||
/*!
|
||||
\brief Returns a reference to the vector of points which
|
||||
make up the Object. If the Object is rectangular or elliptical
|
||||
then the vector will be empty. Point coordinates are in pixels,
|
||||
relative to the object position.
|
||||
*/
|
||||
const std::vector<Vector2f>& getPoints() const { return m_points; }
|
||||
|
||||
/*!
|
||||
\brief Returns a reference to the vector of properties belonging to
|
||||
the Object.
|
||||
*/
|
||||
const std::vector<Property>& getProperties() const { return m_properties; }
|
||||
|
||||
/*!
|
||||
\brief Returns a Text struct containing information about any text
|
||||
this object may have, such as font data and formatting.
|
||||
If an object does not contain any text information this struct will
|
||||
be populated with default values. Use getShape() to determine
|
||||
if this object is in fact a text object.
|
||||
*/
|
||||
const Text& getText() const { return m_textData; }
|
||||
Text& getText() { return m_textData; }
|
||||
|
||||
/*!
|
||||
\brief Returns the tileset name used by this object if it is derived
|
||||
from a template, else returns an empty string.
|
||||
If the string is not empty use it to index the unordered_map returned
|
||||
by Map::getTemplateTilesets()
|
||||
*/
|
||||
const std::string& getTilesetName() const { return m_tilesetName; }
|
||||
|
||||
private:
|
||||
std::uint32_t m_UID;
|
||||
std::string m_name;
|
||||
std::string m_class;
|
||||
Vector2f m_position;
|
||||
FloatRect m_AABB;
|
||||
float m_rotation;
|
||||
std::uint32_t m_tileID;
|
||||
std::uint8_t m_flipFlags;
|
||||
bool m_visible;
|
||||
|
||||
Shape m_shape;
|
||||
std::vector<Vector2f> m_points;
|
||||
std::vector<Property> m_properties;
|
||||
|
||||
Text m_textData;
|
||||
|
||||
std::string m_tilesetName;
|
||||
|
||||
void parsePoints(const pugi::xml_node&);
|
||||
void parseText(const pugi::xml_node&);
|
||||
void parseTemplate(const std::string&, Map*);
|
||||
};
|
||||
}
|
||||
99
ext/tmxlite/include/tmxlite/ObjectGroup.hpp
Normal file
99
ext/tmxlite/include/tmxlite/ObjectGroup.hpp
Normal file
@@ -0,0 +1,99 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2022
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Config.hpp>
|
||||
#include <tmxlite/Layer.hpp>
|
||||
#include <tmxlite/Object.hpp>
|
||||
|
||||
#include <vector>
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
/*!
|
||||
\brief ObjectGroup layers contain a series of Objects
|
||||
which may be made up of shapes or images.
|
||||
*/
|
||||
class TMXLITE_EXPORT_API ObjectGroup final : public Layer
|
||||
{
|
||||
public:
|
||||
enum class DrawOrder
|
||||
{
|
||||
Index, //< objects should be drawn in the order in which they appear
|
||||
TopDown //< objects should be drawn sorted by their Y position
|
||||
};
|
||||
|
||||
ObjectGroup();
|
||||
|
||||
Type getType() const override { return Layer::Type::Object; }
|
||||
void parse(const pugi::xml_node&, Map*) override;
|
||||
|
||||
/*!
|
||||
\brief Returns the colour associated with this layer
|
||||
*/
|
||||
const Colour& getColour() const { return m_colour; }
|
||||
|
||||
/*!
|
||||
\brief Returns the DrawOrder for the objects in this group.
|
||||
Defaults to TopDown, where Objects are drawn sorted by Y position
|
||||
*/
|
||||
DrawOrder getDrawOrder() const { return m_drawOrder; }
|
||||
|
||||
/*!
|
||||
\brief Returns a reference to the vector of properties for
|
||||
the ObjectGroup
|
||||
*/
|
||||
const std::vector<Property>& getProperties() const { return m_properties; }
|
||||
|
||||
/*!
|
||||
\brief Returns a reference to the vector of Objects which belong to the group
|
||||
*/
|
||||
const std::vector<Object>& getObjects() const { return m_objects; }
|
||||
|
||||
private:
|
||||
Colour m_colour;
|
||||
DrawOrder m_drawOrder;
|
||||
|
||||
std::vector<Property> m_properties;
|
||||
std::vector<Object> m_objects;
|
||||
};
|
||||
|
||||
template <>
|
||||
inline ObjectGroup& Layer::getLayerAs<ObjectGroup>()
|
||||
{
|
||||
assert(getType() == Type::Object);
|
||||
return *static_cast<ObjectGroup*>(this);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline const ObjectGroup& Layer::getLayerAs<ObjectGroup>() const
|
||||
{
|
||||
assert(getType() == Type::Object);
|
||||
return *static_cast<const ObjectGroup*>(this);
|
||||
}
|
||||
}
|
||||
86
ext/tmxlite/include/tmxlite/ObjectTypes.hpp
Normal file
86
ext/tmxlite/include/tmxlite/ObjectTypes.hpp
Normal file
@@ -0,0 +1,86 @@
|
||||
/*********************************************************************
|
||||
Raphaël Frantz 2021
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Property.hpp>
|
||||
|
||||
#include <string>
|
||||
#include <vector>
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
/*!
|
||||
\brief Parser for Tiled object types export format.
|
||||
Link to the specification: https://doc.mapeditor.org/fr/latest/manual/custom-properties/#predefining-properties.
|
||||
*/
|
||||
class TMXLITE_EXPORT_API ObjectTypes final
|
||||
{
|
||||
public:
|
||||
/*!
|
||||
\brief Types that stores all predefined properties for all objects of this type.
|
||||
To take less spaces, they are not exported by default into maps.
|
||||
*/
|
||||
struct Type
|
||||
{
|
||||
std::string name;
|
||||
Colour colour;
|
||||
std::vector<Property> properties;
|
||||
};
|
||||
|
||||
/*!
|
||||
\brief Attempts to parse the object types at the given location.
|
||||
\param std::string Path to object types file to try to parse
|
||||
\returns true if object types was parsed successfully else returns false.
|
||||
In debug mode this will attempt to log any errors to the console.
|
||||
*/
|
||||
bool load(const std::string&);
|
||||
|
||||
/*!
|
||||
\brief Loads an object types from a document stored in a string
|
||||
\param data A std::string containing the object types to load
|
||||
\param workingDir A std::string containing the working directory
|
||||
in which to find files.
|
||||
\returns true if successful, else false
|
||||
*/
|
||||
bool loadFromString(const std::string& data, const std::string& workingDir);
|
||||
|
||||
/*!
|
||||
\brief Returns all predefined types and their default values.
|
||||
*/
|
||||
const std::vector<Type>& getTypes() const { return m_types; }
|
||||
|
||||
private:
|
||||
std::string m_workingDirectory;
|
||||
std::vector<Type> m_types;
|
||||
|
||||
bool parseObjectTypesNode(const pugi::xml_node&);
|
||||
|
||||
//always returns false so we can return this
|
||||
//on load failure
|
||||
bool reset();
|
||||
};
|
||||
}
|
||||
144
ext/tmxlite/include/tmxlite/Property.hpp
Normal file
144
ext/tmxlite/include/tmxlite/Property.hpp
Normal file
@@ -0,0 +1,144 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2021
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Config.hpp>
|
||||
#include <tmxlite/Types.hpp>
|
||||
|
||||
#include <string>
|
||||
#include <cassert>
|
||||
|
||||
namespace pugi
|
||||
{
|
||||
class xml_node;
|
||||
}
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
/*!
|
||||
\brief Represents a custom property.
|
||||
Tiles, objects and layers of a tmx map may have custom
|
||||
properties assigned to them. This class represents a
|
||||
single property and provides access to its value, the
|
||||
type of which can be determined with getType()
|
||||
*/
|
||||
class TMXLITE_EXPORT_API Property final
|
||||
{
|
||||
public:
|
||||
|
||||
enum class Type
|
||||
{
|
||||
Boolean,
|
||||
Float,
|
||||
Int,
|
||||
String,
|
||||
Colour,
|
||||
File,
|
||||
Object,
|
||||
Undef
|
||||
};
|
||||
|
||||
Property();
|
||||
|
||||
static Property fromBoolean(bool value);
|
||||
static Property fromFloat(float value);
|
||||
static Property fromInt(int value);
|
||||
static Property fromString(const std::string& value);
|
||||
static Property fromColour(const Colour& value);
|
||||
static Property fromFile(const std::string& value);
|
||||
static Property fromObject(int value);
|
||||
|
||||
/*!
|
||||
\brief Attempts to parse the given node as a property
|
||||
\param isObjectTypes Set to true if the parsing is done from an object types files.
|
||||
*/
|
||||
void parse(const pugi::xml_node&, bool isObjectTypes = false);
|
||||
|
||||
/*!
|
||||
\brief Returns the type of data stored in the property.
|
||||
This should generally be called first before trying to
|
||||
read the proprty value, as reading the incorrect type
|
||||
will lead to undefined behaviour.
|
||||
*/
|
||||
Type getType() const { return m_type; }
|
||||
|
||||
/*!
|
||||
\brief Returns the name of this property
|
||||
*/
|
||||
const std::string& getName() const { return m_name; }
|
||||
|
||||
/*!
|
||||
\brief Returns the property's value as a boolean
|
||||
*/
|
||||
bool getBoolValue() const { assert(m_type == Type::Boolean); return m_boolValue; }
|
||||
|
||||
/*!
|
||||
\brief Returns the property's value as a float
|
||||
*/
|
||||
float getFloatValue() const { assert(m_type == Type::Float); return m_floatValue; }
|
||||
|
||||
/*!
|
||||
\brief Returns the property's value as an integer
|
||||
*/
|
||||
int getIntValue() const { assert(m_type == Type::Int || m_type == Type::Object); return m_intValue; }
|
||||
|
||||
/*!
|
||||
\brief Returns the property's value as a string
|
||||
*/
|
||||
const std::string& getStringValue() const { assert(m_type == Type::String); return m_stringValue; }
|
||||
|
||||
/*!
|
||||
\brief Returns the property's value as a Colour struct
|
||||
*/
|
||||
const Colour& getColourValue() const { assert(m_type == Type::Colour); return m_colourValue; }
|
||||
|
||||
/*!
|
||||
\brief Returns the file path property as a string, relative to the map file
|
||||
*/
|
||||
const std::string& getFileValue() const { assert(m_type == Type::File); return m_stringValue; }
|
||||
|
||||
/*!
|
||||
\brief Returns the property's value as an integer object handle
|
||||
*/
|
||||
int getObjectValue() const { assert(m_type == Type::Object); return m_intValue; }
|
||||
|
||||
|
||||
private:
|
||||
union
|
||||
{
|
||||
bool m_boolValue;
|
||||
float m_floatValue;
|
||||
int m_intValue;
|
||||
};
|
||||
std::string m_stringValue;
|
||||
std::string m_name;
|
||||
Colour m_colourValue;
|
||||
|
||||
Type m_type;
|
||||
};
|
||||
}
|
||||
116
ext/tmxlite/include/tmxlite/TileLayer.hpp
Normal file
116
ext/tmxlite/include/tmxlite/TileLayer.hpp
Normal file
@@ -0,0 +1,116 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2022
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Layer.hpp>
|
||||
#include <tmxlite/Types.hpp>
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
/*!
|
||||
\brief A layer made up from a series of tile sets
|
||||
*/
|
||||
class TMXLITE_EXPORT_API TileLayer final : public Layer
|
||||
{
|
||||
public:
|
||||
/*!
|
||||
\brief Tile information for a layer
|
||||
*/
|
||||
struct Tile final
|
||||
{
|
||||
std::uint32_t ID = 0; //!< Global ID of the tile
|
||||
std::uint8_t flipFlags = 0; //!< Flags marking if the tile should be flipped when drawn
|
||||
};
|
||||
|
||||
/*!
|
||||
\brief Represents a chunk of tile data, if this is an infinite map
|
||||
*/
|
||||
struct Chunk final
|
||||
{
|
||||
Vector2i position; //<! coordinate in tiles, not pixels
|
||||
Vector2i size; //!< size in tiles, not pixels
|
||||
std::vector<Tile> tiles;
|
||||
};
|
||||
|
||||
/*!
|
||||
\brief Flags used to tell if a tile is flipped when drawn
|
||||
*/
|
||||
enum FlipFlag
|
||||
{
|
||||
Horizontal = 0x8,
|
||||
Vertical = 0x4,
|
||||
Diagonal = 0x2
|
||||
};
|
||||
|
||||
explicit TileLayer(std::size_t);
|
||||
|
||||
Type getType() const override { return Layer::Type::Tile; }
|
||||
void parse(const pugi::xml_node&, Map*) override;
|
||||
|
||||
/*!
|
||||
\brief Returns the list of tiles used to make up the layer
|
||||
If this is empty then the map is most likely infinite, in
|
||||
which case the tile data is stored in chunks.
|
||||
\see getChunks()
|
||||
*/
|
||||
const std::vector<Tile>& getTiles() const { return m_tiles; }
|
||||
|
||||
/*!
|
||||
\brief Returns a vector of chunks which make up this layer
|
||||
if the map is set to infinite. This will be empty if the map
|
||||
is not infinite.
|
||||
\see getTiles()
|
||||
*/
|
||||
const std::vector<Chunk>& getChunks() const { return m_chunks; }
|
||||
|
||||
private:
|
||||
std::vector<Tile> m_tiles;
|
||||
std::vector<Chunk> m_chunks;
|
||||
std::size_t m_tileCount;
|
||||
|
||||
void parseBase64(const pugi::xml_node&);
|
||||
void parseCSV(const pugi::xml_node&);
|
||||
void parseUnencoded(const pugi::xml_node&);
|
||||
|
||||
void createTiles(const std::vector<std::uint32_t>&, std::vector<Tile>& destination);
|
||||
};
|
||||
|
||||
template <>
|
||||
inline TileLayer& Layer::getLayerAs<TileLayer>()
|
||||
{
|
||||
assert(getType() == Type::Tile);
|
||||
return *static_cast<TileLayer*>(this);
|
||||
}
|
||||
|
||||
template <>
|
||||
inline const TileLayer& Layer::getLayerAs<TileLayer>() const
|
||||
{
|
||||
assert(getType() == Type::Tile);
|
||||
return *static_cast<const TileLayer*>(this);
|
||||
}
|
||||
}
|
||||
296
ext/tmxlite/include/tmxlite/Tileset.hpp
Normal file
296
ext/tmxlite/include/tmxlite/Tileset.hpp
Normal file
@@ -0,0 +1,296 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2023
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Config.hpp>
|
||||
#include <tmxlite/Property.hpp>
|
||||
#include <tmxlite/ObjectGroup.hpp>
|
||||
|
||||
#include <string>
|
||||
#include <vector>
|
||||
#include <array>
|
||||
|
||||
namespace pugi
|
||||
{
|
||||
class xml_node;
|
||||
}
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
class Map;
|
||||
|
||||
/*!
|
||||
\brief Represents a Tileset node as loaded
|
||||
from a *.tmx format tile map via the tmx::Map
|
||||
class.
|
||||
*/
|
||||
class TMXLITE_EXPORT_API Tileset final
|
||||
{
|
||||
public:
|
||||
explicit Tileset(const std::string& workingDir);
|
||||
|
||||
/*!
|
||||
\brief Any tiles within a tile set which have special
|
||||
data associated with them such as animation or terrain
|
||||
information will have one of these stored in the tile set.
|
||||
*/
|
||||
struct Tile final
|
||||
{
|
||||
std::uint32_t ID = 0;
|
||||
std::array<std::int32_t, 4u> terrainIndices{};
|
||||
std::uint32_t probability = 100;
|
||||
|
||||
/*!
|
||||
\brief a group of frames which make up an animation
|
||||
*/
|
||||
struct Animation final
|
||||
{
|
||||
/*!
|
||||
\brief A frame within an animation
|
||||
*/
|
||||
struct Frame final
|
||||
{
|
||||
std::uint32_t tileID = 0;
|
||||
std::uint32_t duration = 0;
|
||||
|
||||
bool operator == (const Frame& other) const
|
||||
{
|
||||
return (this == &other) ||
|
||||
(tileID == other.tileID && duration == other.duration);
|
||||
}
|
||||
|
||||
bool operator != (const Frame& other) const
|
||||
{
|
||||
return !(*this == other);
|
||||
}
|
||||
};
|
||||
std::vector<Frame> frames;
|
||||
}animation;
|
||||
std::vector<Property> properties;
|
||||
ObjectGroup objectGroup;
|
||||
std::string imagePath;
|
||||
Vector2u imageSize;
|
||||
/*!
|
||||
\brief The position of the tile within the image.
|
||||
*/
|
||||
Vector2u imagePosition;
|
||||
std::string className;
|
||||
};
|
||||
|
||||
/*!
|
||||
\brief Terrain information with which one
|
||||
or more tiles may be associated.
|
||||
*/
|
||||
struct Terrain final
|
||||
{
|
||||
std::string name;
|
||||
std::uint32_t tileID = -1;
|
||||
std::vector<Property> properties;
|
||||
};
|
||||
|
||||
/*!
|
||||
\brief Declares the alignment of tile Objects
|
||||
*/
|
||||
enum class ObjectAlignment
|
||||
{
|
||||
Unspecified,
|
||||
TopLeft,
|
||||
Top,
|
||||
TopRight,
|
||||
Left,
|
||||
Center,
|
||||
Right,
|
||||
BottomLeft,
|
||||
Bottom,
|
||||
BottomRight
|
||||
};
|
||||
|
||||
/*!
|
||||
\brief Attempts to parse the given xml node.
|
||||
If node parsing fails an error is printed in the console
|
||||
and the Tileset remains in an uninitialised state.
|
||||
*/
|
||||
void parse(pugi::xml_node, Map*);
|
||||
|
||||
/*!
|
||||
\brief Returns the first GID of this tile set.
|
||||
This the ID of the first tile in the tile set, so that
|
||||
each tile set guarantees a unique set of IDs
|
||||
*/
|
||||
std::uint32_t getFirstGID() const { return m_firstGID; }
|
||||
|
||||
/*!
|
||||
\brief Returns the last GID of this tile set.
|
||||
This is the ID of the last tile in the tile set.
|
||||
*/
|
||||
std::uint32_t getLastGID() const;
|
||||
|
||||
/*!
|
||||
\brief Returns the name of this tile set.
|
||||
*/
|
||||
const std::string& getName() const { return m_name; }
|
||||
|
||||
/*!
|
||||
\brief Returns the class of the Tileset, as defined in the editor Tiled 1.9+
|
||||
*/
|
||||
const std::string& getClass() const { return m_class; }
|
||||
|
||||
/*!
|
||||
\brief Returns the width and height of a tile in the
|
||||
tile set, in pixels.
|
||||
*/
|
||||
const Vector2u& getTileSize() const { return m_tileSize; }
|
||||
|
||||
/*!
|
||||
\brief Returns the spacing, in pixels, between each tile in the set
|
||||
*/
|
||||
std::uint32_t getSpacing() const { return m_spacing; }
|
||||
|
||||
/*!
|
||||
\brief Returns the margin, in pixels, around each tile in the set
|
||||
*/
|
||||
std::uint32_t getMargin() const { return m_margin; }
|
||||
|
||||
/*!
|
||||
\brief Returns the number of tiles in the tile set
|
||||
*/
|
||||
std::uint32_t getTileCount() const { return m_tileCount; }
|
||||
|
||||
/*!
|
||||
\brief Returns the number of columns which make up the tile set.
|
||||
This is used when rendering collection of images sets
|
||||
*/
|
||||
std::uint32_t getColumnCount() const { return m_columnCount; }
|
||||
|
||||
/*!
|
||||
\brief Returns the alignment of tile objects.
|
||||
The default value is ObjectAlignment::Unspecified for compatibility.
|
||||
When the alignment is Unspecified tile objects use BottomLeft in
|
||||
orthogonal mode and Bottom in isometric mode.
|
||||
\see ObjectAlignment
|
||||
*/
|
||||
ObjectAlignment getObjectAlignment() const { return m_objectAlignment; }
|
||||
|
||||
/*!
|
||||
\brief Returns the tile offset in pixels.
|
||||
Tile will draw tiles offset from the top left using this value.
|
||||
*/
|
||||
const Vector2u& getTileOffset() const { return m_tileOffset; }
|
||||
|
||||
/*!
|
||||
\brief Returns a reference to the list of Property objects for this
|
||||
tile set
|
||||
*/
|
||||
const std::vector<Property>& getProperties() const { return m_properties; }
|
||||
|
||||
/*!
|
||||
\brief Returns the file path to the tile set image, relative to the
|
||||
working directory. Use this to load the texture required by whichever
|
||||
method you choose to render the map.
|
||||
*/
|
||||
const std::string& getImagePath() const { return m_imagePath; }
|
||||
|
||||
/*!
|
||||
\brief Returns the size of the tile set image in pixels.
|
||||
*/
|
||||
const Vector2u& getImageSize() const { return m_imageSize; }
|
||||
|
||||
/*!
|
||||
\brief Returns the colour used by the tile map image to represent transparency.
|
||||
By default this is a transparent colour (0, 0, 0, 0)
|
||||
*/
|
||||
const Colour& getTransparencyColour() const { return m_transparencyColour; }
|
||||
|
||||
/*!
|
||||
\brief Returns true if the image used by this tileset specifically requests
|
||||
a colour to use as transparency.
|
||||
*/
|
||||
bool hasTransparency() const { return m_hasTransparency; }
|
||||
|
||||
/*!
|
||||
\brief Returns a vector of Terrain types associated with one
|
||||
or more tiles within this tile set
|
||||
*/
|
||||
const std::vector<Terrain>& getTerrainTypes() const { return m_terrainTypes; }
|
||||
|
||||
/*!
|
||||
\brief Returns a reference to the vector of tile data used by
|
||||
tiles which make up this tile set.
|
||||
*/
|
||||
const std::vector<Tile>& getTiles() const { return m_tiles; }
|
||||
|
||||
/*!
|
||||
\brief Checks if a tiled ID is in the range of the first ID and the last ID
|
||||
\param id Tile ID
|
||||
\return
|
||||
*/
|
||||
bool hasTile(std::uint32_t id) const { return id >= m_firstGID && id <= getLastGID(); };
|
||||
|
||||
/*!
|
||||
\brief queries tiles and returns a tile with the given ID. Checks if the TileID is part of the Tileset with `hasTile(id)`
|
||||
\param id Tile ID. The Tile ID will be corrected internally.
|
||||
\return In case of a success it returns the correct tile. In terms of failure it will return a nullptr.
|
||||
*/
|
||||
const Tile* getTile(std::uint32_t id) const;
|
||||
|
||||
private:
|
||||
|
||||
std::string m_workingDir;
|
||||
|
||||
std::uint32_t m_firstGID;
|
||||
std::string m_source;
|
||||
std::string m_name;
|
||||
std::string m_class;
|
||||
Vector2u m_tileSize;
|
||||
std::uint32_t m_spacing;
|
||||
std::uint32_t m_margin;
|
||||
std::uint32_t m_tileCount;
|
||||
std::uint32_t m_columnCount;
|
||||
ObjectAlignment m_objectAlignment;
|
||||
Vector2u m_tileOffset;
|
||||
|
||||
std::vector<Property> m_properties;
|
||||
std::string m_imagePath;
|
||||
Vector2u m_imageSize;
|
||||
Colour m_transparencyColour;
|
||||
bool m_hasTransparency;
|
||||
|
||||
std::vector<Terrain> m_terrainTypes;
|
||||
std::vector<std::uint32_t> m_tileIndex;
|
||||
std::vector<Tile> m_tiles;
|
||||
|
||||
void reset();
|
||||
|
||||
void parseOffsetNode(const pugi::xml_node&);
|
||||
void parsePropertyNode(const pugi::xml_node&);
|
||||
void parseTerrainNode(const pugi::xml_node&);
|
||||
Tile& newTile(std::uint32_t ID);
|
||||
void parseTileNode(const pugi::xml_node&, Map*);
|
||||
void createMissingTile(std::uint32_t ID);
|
||||
};
|
||||
}
|
||||
150
ext/tmxlite/include/tmxlite/Types.hpp
Normal file
150
ext/tmxlite/include/tmxlite/Types.hpp
Normal file
@@ -0,0 +1,150 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2023
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <tmxlite/Config.hpp>
|
||||
|
||||
#include <cstdint>
|
||||
#include <ostream>
|
||||
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
/*!
|
||||
\brief Two dimensional vector used to store points and positions
|
||||
*/
|
||||
template <class T>
|
||||
struct Vector2 final
|
||||
{
|
||||
Vector2() : x(0), y(0) {}
|
||||
Vector2(T x, T y) :x(x), y(y) {}
|
||||
T x, y;
|
||||
};
|
||||
|
||||
using Vector2f = Vector2<float>;
|
||||
using Vector2i = Vector2<int>;
|
||||
using Vector2u = Vector2<unsigned>;
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator + (const Vector2<T>& l, const Vector2<T>& r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator += (Vector2<T>& l, const Vector2<T>& r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator - (const Vector2<T>& l, const Vector2<T>& r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator -= (Vector2<T>& l, const Vector2<T>& r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator * (const Vector2<T>& l, const Vector2<T>& r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator *= (Vector2<T>& l, const Vector2<T>& r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator * (const Vector2<T>& l, T r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator *= (Vector2<T>& l, T r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator / (const Vector2<T>& l, const Vector2<T>& r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator /= (Vector2<T>& l, const Vector2<T>& r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator / (const Vector2<T>& l, T r);
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator /= (Vector2<T>& l, T r);
|
||||
|
||||
#include "Types.inl"
|
||||
|
||||
/*!
|
||||
\brief Describes a rectangular area, such as an AABB (axis aligned bounding box)
|
||||
*/
|
||||
template <class T>
|
||||
struct Rectangle final
|
||||
{
|
||||
Rectangle() : left(0), top(0), width(0), height(0) {}
|
||||
Rectangle(T l, T t, T w, T h) : left(l), top(t), width(w), height(h) {}
|
||||
Rectangle(Vector2<T> position, Vector2<T> size) : left(position.x), top(position.y), width(size.x), height(size.y) {}
|
||||
T left, top, width, height;
|
||||
};
|
||||
|
||||
using FloatRect = Rectangle<float>;
|
||||
using IntRect = Rectangle<int>;
|
||||
|
||||
/*!
|
||||
\brief Contains the red, green, blue and alpha values of a colour
|
||||
in the range 0 - 255.
|
||||
*/
|
||||
struct TMXLITE_EXPORT_API Colour final
|
||||
{
|
||||
Colour(std::uint8_t red = 0, std::uint8_t green = 0, std::uint8_t blue = 0, std::uint8_t alpha = 255)
|
||||
: r(red), g(green), b(blue), a(alpha) {}
|
||||
std::uint8_t r, g, b, a;
|
||||
|
||||
bool operator == (const Colour& other)
|
||||
{
|
||||
return other.r == r
|
||||
&& other.g == g
|
||||
&& other.b == b
|
||||
&& other.a == a;
|
||||
}
|
||||
|
||||
bool operator != (const Colour& other)
|
||||
{
|
||||
return !(*this == other);
|
||||
}
|
||||
|
||||
explicit operator std::uint32_t() const
|
||||
{
|
||||
return (r << 24) | (g << 16) | (b << 8) | a;
|
||||
}
|
||||
};
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
std::ostream& operator << (std::ostream& os, const tmx::Vector2<T>& t)
|
||||
{
|
||||
os << "{" << t.x << ", " << t.y << "}";
|
||||
return os;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
std::ostream& operator << (std::ostream& os, const tmx::Rectangle<T>& t)
|
||||
{
|
||||
os << "{" << t.left << ", " << t.top << ", " << t.width << ", " << t.height << "}";
|
||||
return os;
|
||||
}
|
||||
|
||||
std::ostream& operator << (std::ostream& os, const tmx::Colour& c);
|
||||
110
ext/tmxlite/include/tmxlite/Types.inl
Normal file
110
ext/tmxlite/include/tmxlite/Types.inl
Normal file
@@ -0,0 +1,110 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2023
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator + (const Vector2<T>& l, const Vector2<T>& r)
|
||||
{
|
||||
return { l.x + r.x, l.y + r.y };
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator += (Vector2<T>& l, const Vector2<T>& r)
|
||||
{
|
||||
l.x += r.x;
|
||||
l.y += r.y;
|
||||
return l;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator - (const Vector2<T>& l, const Vector2<T>& r)
|
||||
{
|
||||
return { l.x - r.x, l.y - r.y };
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator -= (Vector2<T>& l, const Vector2<T>& r)
|
||||
{
|
||||
l.x -= r.x;
|
||||
l.y -= r.y;
|
||||
return l;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator * (const Vector2<T>& l, const Vector2<T>& r)
|
||||
{
|
||||
return { l.x * r.x, l.y * r.y };
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator *= (Vector2<T>& l, const Vector2<T>& r)
|
||||
{
|
||||
l.x *= r.x;
|
||||
l.y *= r.y;
|
||||
return l;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator * (const Vector2<T>& l, T r)
|
||||
{
|
||||
return { l.x * r, l.y * r };
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator *= (Vector2<T>& l, T r)
|
||||
{
|
||||
l.x *= r;
|
||||
l.y *= r;
|
||||
return l;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator / (const Vector2<T>& l, const Vector2<T>& r)
|
||||
{
|
||||
return { l.x / r.x, l.y / r.y };
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator /= (Vector2<T>& l, const Vector2<T>& r)
|
||||
{
|
||||
l.x /= r.x;
|
||||
l.y /= r.y;
|
||||
return l;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T> operator / (const Vector2<T>& l, T r)
|
||||
{
|
||||
return { l.x / r, l.y / r };
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Vector2<T>& operator /= (Vector2<T>& l, T r)
|
||||
{
|
||||
l.x /= r;
|
||||
l.y /= r;
|
||||
return l;
|
||||
}
|
||||
53
ext/tmxlite/include/tmxlite/detail/Android.hpp
Normal file
53
ext/tmxlite/include/tmxlite/detail/Android.hpp
Normal file
@@ -0,0 +1,53 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifndef ANDROID_INC_HPP_
|
||||
#define ANDROID_INC_HPP_
|
||||
#ifdef __ANDROID__
|
||||
|
||||
#include <string>
|
||||
#include <sstream>
|
||||
|
||||
#include <cstdlib>
|
||||
|
||||
namespace std
|
||||
{
|
||||
template <typename T>
|
||||
std::string to_string(T value)
|
||||
{
|
||||
std::ostringstream os;
|
||||
os << value;
|
||||
return os.str();
|
||||
}
|
||||
}
|
||||
|
||||
#define STOI(str) std::strtol(str.c_str(), 0, 10)
|
||||
#else
|
||||
#define STOI(str) std::stoi(str)
|
||||
|
||||
#endif // __ANDROID__
|
||||
#endif // ANDROID_INC_HPP_
|
||||
190
ext/tmxlite/include/tmxlite/detail/Log.hpp
Normal file
190
ext/tmxlite/include/tmxlite/detail/Log.hpp
Normal file
@@ -0,0 +1,190 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2021
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
//flexible logging class, based on code at https://github.com/fallahn/xygine
|
||||
|
||||
#ifndef TMXLITE_LOGGER_HPP_
|
||||
#define TMXLITE_LOGGER_HPP_
|
||||
|
||||
#include <string>
|
||||
#include <iostream>
|
||||
#include <iomanip>
|
||||
#include <fstream>
|
||||
#include <sstream>
|
||||
#include <list>
|
||||
#include <ctime>
|
||||
|
||||
#ifdef _MSC_VER
|
||||
#define NOMINMAX
|
||||
#include <windows.h>
|
||||
#endif //_MSC_VER
|
||||
|
||||
|
||||
#ifdef __ANDROID__
|
||||
#include <android/log.h>
|
||||
#include <cstring>
|
||||
|
||||
#define LOG_TAG "TMXlite-Debug"
|
||||
//#define ALOG(...) __android_log_print(ANDROID_LOG_INFO,LOG_TAG,__VA_ARGS__)
|
||||
|
||||
#define LOGI(...) __android_log_print(ANDROID_LOG_INFO,LOG_TAG,__VA_ARGS__)
|
||||
#define LOGE(...) __android_log_print(ANDROID_LOG_ERROR,LOG_TAG,__VA_ARGS__)
|
||||
#endif // __ANDROID__
|
||||
|
||||
namespace tmx
|
||||
{
|
||||
/*!
|
||||
\brief Class allowing messages to be logged to a combination
|
||||
of one or more destinations such as the console, log file or
|
||||
output window in Visual Studio
|
||||
*/
|
||||
class Logger final
|
||||
{
|
||||
public:
|
||||
enum class Output
|
||||
{
|
||||
Console,
|
||||
File,
|
||||
All
|
||||
};
|
||||
|
||||
enum class Type
|
||||
{
|
||||
Info,
|
||||
Warning,
|
||||
Error
|
||||
};
|
||||
/*!
|
||||
\brief Logs a message to a given destination.
|
||||
\param message Message to log
|
||||
\param type Whether this message gets tagged as information, a warning or an error
|
||||
\param output Destination for the message. Can be the console via cout, a log file on disk, or both
|
||||
*/
|
||||
static void log(const std::string& message, Type type = Type::Info, Output output = Output::Console)
|
||||
{
|
||||
std::string outstring;
|
||||
switch (type)
|
||||
{
|
||||
case Type::Info:
|
||||
default:
|
||||
outstring = "INFO: " + message;
|
||||
break;
|
||||
case Type::Error:
|
||||
outstring = "ERROR: " + message;
|
||||
break;
|
||||
case Type::Warning:
|
||||
outstring = "WARNING: " + message;
|
||||
break;
|
||||
}
|
||||
|
||||
if (output == Output::Console || output == Output::All)
|
||||
{
|
||||
if (type == Type::Error)
|
||||
{
|
||||
#ifdef __ANDROID__
|
||||
|
||||
int outstringLength = outstring.length();
|
||||
char outstring_chararray[outstringLength+1];
|
||||
std::strcpy(outstring_chararray, outstring.c_str());
|
||||
LOGE("%s",outstring_chararray);
|
||||
#endif
|
||||
std::cerr << outstring << std::endl;
|
||||
}
|
||||
else
|
||||
{
|
||||
#ifdef __ANDROID__
|
||||
int outstringLength = outstring.length();
|
||||
char outstring_chararray[outstringLength+1];
|
||||
std::strcpy(outstring_chararray, outstring.c_str());
|
||||
LOGI("%s", outstring_chararray);
|
||||
#endif
|
||||
std::cout << outstring << std::endl;
|
||||
}
|
||||
const std::size_t maxBuffer = 30;
|
||||
buffer().push_back(outstring);
|
||||
if (buffer().size() > maxBuffer)buffer().pop_front(); //no majick here pl0x
|
||||
updateOutString(maxBuffer);
|
||||
|
||||
#ifdef _MSC_VER
|
||||
outstring += "\n";
|
||||
OutputDebugStringA(outstring.c_str());
|
||||
#endif //_MSC_VER
|
||||
}
|
||||
if (output == Output::File || output == Output::All)
|
||||
{
|
||||
//output to a log file
|
||||
std::ofstream file("output.log", std::ios::app);
|
||||
if (file.good())
|
||||
{
|
||||
#ifndef __ANDROID__
|
||||
std::time_t time = std::time(nullptr);
|
||||
auto tm = *std::localtime(&time);
|
||||
//put_time isn't implemented by the ndk versions of the stl
|
||||
file.imbue(std::locale());
|
||||
file << std::put_time(&tm, "%d/%m/%y-%H:%M:%S: ");
|
||||
#endif //__ANDROID__
|
||||
file << outstring << std::endl;
|
||||
file.close();
|
||||
}
|
||||
else
|
||||
{
|
||||
log(message, type, Output::Console);
|
||||
log("Above message was intended for log file. Opening file probably failed.", Type::Warning, Output::Console);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static const std::string& bufferString(){ return stringOutput(); }
|
||||
|
||||
private:
|
||||
static std::list<std::string>& buffer(){ static std::list<std::string> buffer; return buffer; }
|
||||
static std::string& stringOutput() { static std::string output; return output; }
|
||||
static void updateOutString(std::size_t maxBuffer)
|
||||
{
|
||||
static size_t count = 0;
|
||||
stringOutput().append(buffer().back());
|
||||
stringOutput().append("\n");
|
||||
count++;
|
||||
|
||||
if (count > maxBuffer)
|
||||
{
|
||||
stringOutput() = stringOutput().substr(stringOutput().find_first_of('\n') + 1, stringOutput().size());
|
||||
count--;
|
||||
}
|
||||
}
|
||||
};
|
||||
}
|
||||
#ifndef _DEBUG_
|
||||
#define LOG(message, type)
|
||||
#else
|
||||
#define LOG(message, type) {\
|
||||
std::stringstream ss; \
|
||||
ss << message << " (" << __FILE__ << ", " << __LINE__ << ")"; \
|
||||
tmx::Logger::log(ss.str(), type);}
|
||||
#endif //_DEBUG_
|
||||
|
||||
#endif //TMXLITE_LOGGER_HPP_
|
||||
15
ext/tmxlite/src/CMakeLists.txt
Normal file
15
ext/tmxlite/src/CMakeLists.txt
Normal file
@@ -0,0 +1,15 @@
|
||||
set(PROJECT_SRC
|
||||
${PROJECT_DIR}/FreeFuncs.cpp
|
||||
${PROJECT_DIR}/ImageLayer.cpp
|
||||
${PROJECT_DIR}/Map.cpp
|
||||
${PROJECT_DIR}/Object.cpp
|
||||
${PROJECT_DIR}/ObjectGroup.cpp
|
||||
${PROJECT_DIR}/Property.cpp
|
||||
${PROJECT_DIR}/TileLayer.cpp
|
||||
${PROJECT_DIR}/LayerGroup.cpp
|
||||
${PROJECT_DIR}/Tileset.cpp
|
||||
${PROJECT_DIR}/ObjectTypes.cpp)
|
||||
|
||||
set(LIB_SRC
|
||||
${PROJECT_DIR}/miniz.c
|
||||
${PROJECT_DIR}/detail/pugixml.cpp)
|
||||
133
ext/tmxlite/src/FreeFuncs.cpp
Normal file
133
ext/tmxlite/src/FreeFuncs.cpp
Normal file
@@ -0,0 +1,133 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2023
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifndef USE_EXTLIBS
|
||||
#include "miniz.h"
|
||||
#else
|
||||
#include <zlib.h>
|
||||
#endif
|
||||
#include <tmxlite/FreeFuncs.hpp>
|
||||
#include <tmxlite/Types.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
|
||||
#include <cstring>
|
||||
|
||||
bool tmx::decompress(const char* source, std::vector<unsigned char>& dest, std::size_t inSize, std::size_t expectedSize)
|
||||
{
|
||||
if (!source)
|
||||
{
|
||||
LOG("Input string is empty, decompression failed.", Logger::Type::Error);
|
||||
return false;
|
||||
}
|
||||
|
||||
//#ifdef USE_EXTLIBS
|
||||
|
||||
|
||||
//#else
|
||||
int currentSize = static_cast<int>(expectedSize);
|
||||
std::vector<unsigned char> byteArray(expectedSize / sizeof(unsigned char));
|
||||
z_stream stream;
|
||||
stream.zalloc = Z_NULL;
|
||||
stream.zfree = Z_NULL;
|
||||
stream.opaque = Z_NULL;
|
||||
stream.next_in = (Bytef*)source;
|
||||
stream.avail_in = static_cast<unsigned int>(inSize);
|
||||
stream.next_out = (Bytef*)byteArray.data();
|
||||
stream.avail_out = static_cast<unsigned int>(expectedSize);
|
||||
|
||||
//we'd prefer to use inflateInit2 but it appears
|
||||
//to be incorrect in miniz. This is fine for zlib
|
||||
//compressed data, but gzip compressed streams
|
||||
//will fail to inflate.
|
||||
#ifdef USE_EXTLIBS
|
||||
if (inflateInit2(&stream, 15 + 32) != Z_OK)
|
||||
#else
|
||||
if (inflateInit(&stream) != Z_OK)
|
||||
#endif
|
||||
{
|
||||
LOG("inflate init failed", Logger::Type::Error);
|
||||
return false;
|
||||
}
|
||||
|
||||
int result = 0;
|
||||
do
|
||||
{
|
||||
result = inflate(&stream, Z_SYNC_FLUSH);
|
||||
|
||||
switch (result)
|
||||
{
|
||||
default: break;
|
||||
case Z_NEED_DICT:
|
||||
case Z_STREAM_ERROR:
|
||||
result = Z_DATA_ERROR;
|
||||
case Z_DATA_ERROR:
|
||||
Logger::log("If using gzip or zstd compression try using zlib instead", Logger::Type::Info);
|
||||
case Z_MEM_ERROR:
|
||||
inflateEnd(&stream);
|
||||
Logger::log("inflate() returned " + std::to_string(result), Logger::Type::Error);
|
||||
return false;
|
||||
}
|
||||
|
||||
if (result != Z_STREAM_END)
|
||||
{
|
||||
int oldSize = currentSize;
|
||||
currentSize *= 2;
|
||||
std::vector<unsigned char> newArray(currentSize / sizeof(unsigned char));
|
||||
std::memcpy(newArray.data(), byteArray.data(), currentSize / 2);
|
||||
byteArray = std::move(newArray);
|
||||
|
||||
stream.next_out = (Bytef*)(byteArray.data() + oldSize);
|
||||
stream.avail_out = oldSize;
|
||||
|
||||
}
|
||||
} while (result != Z_STREAM_END);
|
||||
|
||||
if (stream.avail_in != 0)
|
||||
{
|
||||
LOG("stream.avail_in is 0", Logger::Type::Error);
|
||||
LOG("zlib decompression failed.", Logger::Type::Error);
|
||||
return false;
|
||||
}
|
||||
|
||||
const int outSize = currentSize - stream.avail_out;
|
||||
inflateEnd(&stream);
|
||||
|
||||
std::vector<unsigned char> newArray(outSize / sizeof(unsigned char));
|
||||
std::memcpy(newArray.data(), byteArray.data(), outSize);
|
||||
byteArray = std::move(newArray);
|
||||
|
||||
//copy bytes to vector
|
||||
dest.insert(dest.begin(), byteArray.begin(), byteArray.end());
|
||||
//#endif
|
||||
return true;
|
||||
}
|
||||
|
||||
std::ostream& operator << (std::ostream& os, const tmx::Colour& c)
|
||||
{
|
||||
os << "RGBA: " << (int)c.r << ", " << (int)c.g << ", " << (int)c.b << ", " << (int)c.a;
|
||||
return os;
|
||||
}
|
||||
110
ext/tmxlite/src/ImageLayer.cpp
Normal file
110
ext/tmxlite/src/ImageLayer.cpp
Normal file
@@ -0,0 +1,110 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2023
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifdef USE_EXTLIBS
|
||||
#include <pugixml.hpp>
|
||||
#else
|
||||
#include "detail/pugixml.hpp"
|
||||
#endif
|
||||
#include <tmxlite/ImageLayer.hpp>
|
||||
#include <tmxlite/FreeFuncs.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
|
||||
using namespace tmx;
|
||||
|
||||
ImageLayer::ImageLayer(const std::string& workingDir)
|
||||
: m_workingDir (workingDir),
|
||||
m_hasTransparency (false),
|
||||
m_hasRepeatX (false),
|
||||
m_hasRepeatY (false)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
//public
|
||||
void ImageLayer::parse(const pugi::xml_node& node, Map*)
|
||||
{
|
||||
std::string attribName = node.name();
|
||||
if (attribName != "imagelayer")
|
||||
{
|
||||
Logger::log("Node not an image layer, node skipped", Logger::Type::Error);
|
||||
return;
|
||||
}
|
||||
|
||||
//TODO this gets repeated foreach layer type and could all be moved to base class...
|
||||
setName(node.attribute("name").as_string());
|
||||
setClass(node.attribute("class").as_string());
|
||||
setOpacity(node.attribute("opacity").as_float(1.f));
|
||||
setVisible(node.attribute("visible").as_bool(true));
|
||||
setOffset(node.attribute("offsetx").as_int(0), node.attribute("offsety").as_int(0));
|
||||
setSize(node.attribute("width").as_uint(0), node.attribute("height").as_uint(0));
|
||||
setParallaxFactor(node.attribute("parallaxx").as_float(1.f), node.attribute("parallaxy").as_float(1.f));
|
||||
|
||||
std::string tintColour = node.attribute("tintcolor").as_string();
|
||||
if (!tintColour.empty())
|
||||
{
|
||||
setTintColour(colourFromString(tintColour));
|
||||
}
|
||||
|
||||
m_hasRepeatX = node.attribute("repeatx").as_bool(false);
|
||||
m_hasRepeatY = node.attribute("repeaty").as_bool(false);
|
||||
|
||||
for (const auto& child : node.children())
|
||||
{
|
||||
attribName = child.name();
|
||||
if (attribName == "image")
|
||||
{
|
||||
attribName = child.attribute("source").as_string();
|
||||
if (attribName.empty())
|
||||
{
|
||||
Logger::log("Image Layer has missing source property", Logger::Type::Warning);
|
||||
return;
|
||||
}
|
||||
|
||||
if (child.attribute("width") && child.attribute("height"))
|
||||
{
|
||||
m_imageSize.x = child.attribute("width").as_uint();
|
||||
m_imageSize.y = child.attribute("height").as_uint();
|
||||
}
|
||||
|
||||
m_filePath = resolveFilePath(attribName, m_workingDir);
|
||||
if (child.attribute("trans"))
|
||||
{
|
||||
attribName = child.attribute("trans").as_string();
|
||||
m_transparencyColour = colourFromString(attribName);
|
||||
m_hasTransparency = true;
|
||||
}
|
||||
}
|
||||
else if (attribName == "properties")
|
||||
{
|
||||
for (const auto& p : child.children())
|
||||
{
|
||||
addProperty(p);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
109
ext/tmxlite/src/LayerGroup.cpp
Normal file
109
ext/tmxlite/src/LayerGroup.cpp
Normal file
@@ -0,0 +1,109 @@
|
||||
/*********************************************************************
|
||||
Grant Gangi 2019
|
||||
Matt Marchant 2023
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifdef USE_EXTLIBS
|
||||
#include <pugixml.hpp>
|
||||
#else
|
||||
#include "detail/pugixml.hpp"
|
||||
#endif
|
||||
#include <tmxlite/LayerGroup.hpp>
|
||||
#include <tmxlite/FreeFuncs.hpp>
|
||||
#include <tmxlite/ObjectGroup.hpp>
|
||||
#include <tmxlite/ImageLayer.hpp>
|
||||
#include <tmxlite/TileLayer.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
|
||||
using namespace tmx;
|
||||
|
||||
LayerGroup::LayerGroup(const std::string& workingDir, const Vector2u& tileCount)
|
||||
: m_workingDir(workingDir),
|
||||
m_tileCount(tileCount)
|
||||
{
|
||||
}
|
||||
|
||||
//public
|
||||
void LayerGroup::parse(const pugi::xml_node& node, Map* map)
|
||||
{
|
||||
assert(map);
|
||||
std::string attribString = node.name();
|
||||
if (attribString != "group")
|
||||
{
|
||||
Logger::log("Node was not a group layer, node will be skipped.", Logger::Type::Error);
|
||||
return;
|
||||
}
|
||||
|
||||
setName(node.attribute("name").as_string());
|
||||
setClass(node.attribute("class").as_string());
|
||||
setOpacity(node.attribute("opacity").as_float(1.f));
|
||||
setVisible(node.attribute("visible").as_bool(true));
|
||||
setOffset(node.attribute("offsetx").as_int(0), node.attribute("offsety").as_int(0));
|
||||
setSize(node.attribute("width").as_uint(0), node.attribute("height").as_uint(0));
|
||||
setParallaxFactor(node.attribute("parallaxx").as_float(1.f), node.attribute("parallaxy").as_float(1.f));
|
||||
|
||||
std::string tintColour = node.attribute("tintcolor").as_string();
|
||||
if (!tintColour.empty())
|
||||
{
|
||||
setTintColour(colourFromString(tintColour));
|
||||
}
|
||||
|
||||
// parse children
|
||||
for (const auto& child : node.children())
|
||||
{
|
||||
attribString = child.name();
|
||||
if (attribString == "properties")
|
||||
{
|
||||
for (const auto& p : child.children())
|
||||
{
|
||||
addProperty(p);
|
||||
}
|
||||
}
|
||||
else if (attribString == "layer")
|
||||
{
|
||||
m_layers.emplace_back(std::make_unique<TileLayer>(m_tileCount.x * m_tileCount.y));
|
||||
m_layers.back()->parse(child, map);
|
||||
}
|
||||
else if (attribString == "objectgroup")
|
||||
{
|
||||
m_layers.emplace_back(std::make_unique<ObjectGroup>());
|
||||
m_layers.back()->parse(child, map);
|
||||
}
|
||||
else if (attribString == "imagelayer")
|
||||
{
|
||||
m_layers.emplace_back(std::make_unique<ImageLayer>(m_workingDir));
|
||||
m_layers.back()->parse(child, map);
|
||||
}
|
||||
else if (attribString == "group")
|
||||
{
|
||||
m_layers.emplace_back(std::make_unique<LayerGroup>(m_workingDir, m_tileCount));
|
||||
m_layers.back()->parse(child, map);
|
||||
}
|
||||
else
|
||||
{
|
||||
LOG("Unidentified name " + attribString + ": node skipped", Logger::Type::Warning);
|
||||
}
|
||||
}
|
||||
}
|
||||
367
ext/tmxlite/src/Map.cpp
Normal file
367
ext/tmxlite/src/Map.cpp
Normal file
@@ -0,0 +1,367 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2023
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifdef USE_EXTLIBS
|
||||
#include <pugixml.hpp>
|
||||
#else
|
||||
#include "detail/pugixml.hpp"
|
||||
#endif
|
||||
#include <tmxlite/Map.hpp>
|
||||
#include <tmxlite/FreeFuncs.hpp>
|
||||
#include <tmxlite/ObjectGroup.hpp>
|
||||
#include <tmxlite/ImageLayer.hpp>
|
||||
#include <tmxlite/TileLayer.hpp>
|
||||
#include <tmxlite/LayerGroup.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
#include <tmxlite/detail/Android.hpp>
|
||||
|
||||
#include <queue>
|
||||
|
||||
using namespace tmx;
|
||||
|
||||
Map::Map()
|
||||
: m_orientation (Orientation::None),
|
||||
m_renderOrder (RenderOrder::None),
|
||||
m_infinite (false),
|
||||
m_hexSideLength (0.f),
|
||||
m_staggerAxis (StaggerAxis::None),
|
||||
m_staggerIndex (StaggerIndex::None)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
//public
|
||||
bool Map::load(const std::string& path)
|
||||
{
|
||||
reset();
|
||||
|
||||
//open the doc
|
||||
pugi::xml_document doc;
|
||||
auto result = doc.load_file(path.c_str());
|
||||
if (!result)
|
||||
{
|
||||
Logger::log("Failed opening " + path, Logger::Type::Error);
|
||||
Logger::log("Reason: " + std::string(result.description()), Logger::Type::Error);
|
||||
return false;
|
||||
}
|
||||
|
||||
//make sure we have consistent path separators
|
||||
m_workingDirectory = path;
|
||||
std::replace(m_workingDirectory.begin(), m_workingDirectory.end(), '\\', '/');
|
||||
m_workingDirectory = getFilePath(m_workingDirectory);
|
||||
|
||||
if (!m_workingDirectory.empty() &&
|
||||
m_workingDirectory.back() == '/')
|
||||
{
|
||||
m_workingDirectory.pop_back();
|
||||
}
|
||||
|
||||
|
||||
//find the map node and bail if it doesn't exist
|
||||
auto mapNode = doc.child("map");
|
||||
if (!mapNode)
|
||||
{
|
||||
Logger::log("Failed opening map: " + path + ", no map node found", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
return parseMapNode(mapNode);
|
||||
}
|
||||
|
||||
bool Map::loadFromString(const std::string& data, const std::string& workingDir)
|
||||
{
|
||||
reset();
|
||||
|
||||
//open the doc
|
||||
pugi::xml_document doc;
|
||||
auto result = doc.load_string(data.c_str());
|
||||
if (!result)
|
||||
{
|
||||
Logger::log("Failed opening map", Logger::Type::Error);
|
||||
Logger::log("Reason: " + std::string(result.description()), Logger::Type::Error);
|
||||
return false;
|
||||
}
|
||||
|
||||
//make sure we have consistent path separators
|
||||
m_workingDirectory = workingDir;
|
||||
std::replace(m_workingDirectory.begin(), m_workingDirectory.end(), '\\', '/');
|
||||
m_workingDirectory = getFilePath(m_workingDirectory);
|
||||
|
||||
if (!m_workingDirectory.empty() &&
|
||||
m_workingDirectory.back() == '/')
|
||||
{
|
||||
m_workingDirectory.pop_back();
|
||||
}
|
||||
|
||||
//find the map node and bail if it doesn't exist
|
||||
auto mapNode = doc.child("map");
|
||||
if (!mapNode)
|
||||
{
|
||||
Logger::log("Failed opening map: no map node found", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
return parseMapNode(mapNode);
|
||||
}
|
||||
|
||||
//private
|
||||
bool Map::parseMapNode(const pugi::xml_node& mapNode)
|
||||
{
|
||||
//parse map attributes
|
||||
std::size_t pointPos = 0;
|
||||
std::string attribString = mapNode.attribute("version").as_string();
|
||||
if (attribString.empty() || (pointPos = attribString.find('.')) == std::string::npos)
|
||||
{
|
||||
Logger::log("Invalid map version value, map not loaded.", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
m_version.upper = STOI(attribString.substr(0, pointPos));
|
||||
m_version.lower = STOI(attribString.substr(pointPos + 1));
|
||||
|
||||
m_class = mapNode.attribute("class").as_string();
|
||||
|
||||
attribString = mapNode.attribute("orientation").as_string();
|
||||
if (attribString.empty())
|
||||
{
|
||||
Logger::log("Missing map orientation attribute, map not loaded.", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
if (attribString == "orthogonal")
|
||||
{
|
||||
m_orientation = Orientation::Orthogonal;
|
||||
}
|
||||
else if (attribString == "isometric")
|
||||
{
|
||||
m_orientation = Orientation::Isometric;
|
||||
}
|
||||
else if (attribString == "staggered")
|
||||
{
|
||||
m_orientation = Orientation::Staggered;
|
||||
}
|
||||
else if (attribString == "hexagonal")
|
||||
{
|
||||
m_orientation = Orientation::Hexagonal;
|
||||
}
|
||||
else
|
||||
{
|
||||
Logger::log(attribString + " format maps aren't supported yet, sorry! Map not loaded", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
attribString = mapNode.attribute("renderorder").as_string();
|
||||
//this property is optional for older version of map files
|
||||
if (!attribString.empty())
|
||||
{
|
||||
if (attribString == "right-down")
|
||||
{
|
||||
m_renderOrder = RenderOrder::RightDown;
|
||||
}
|
||||
else if (attribString == "right-up")
|
||||
{
|
||||
m_renderOrder = RenderOrder::RightUp;
|
||||
}
|
||||
else if (attribString == "left-down")
|
||||
{
|
||||
m_renderOrder = RenderOrder::LeftDown;
|
||||
}
|
||||
else if (attribString == "left-up")
|
||||
{
|
||||
m_renderOrder = RenderOrder::LeftUp;
|
||||
}
|
||||
else
|
||||
{
|
||||
Logger::log(attribString + ": invalid render order. Map not loaded.", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
}
|
||||
|
||||
if (mapNode.attribute("infinite"))
|
||||
{
|
||||
m_infinite = mapNode.attribute("infinite").as_int() != 0;
|
||||
}
|
||||
|
||||
unsigned width = mapNode.attribute("width").as_int();
|
||||
unsigned height = mapNode.attribute("height").as_int();
|
||||
if (width && height)
|
||||
{
|
||||
m_tileCount = { width, height };
|
||||
}
|
||||
else
|
||||
{
|
||||
Logger::log("Invalid map tile count, map not loaded", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
width = mapNode.attribute("tilewidth").as_int();
|
||||
height = mapNode.attribute("tileheight").as_int();
|
||||
if (width && height)
|
||||
{
|
||||
m_tileSize = { width, height };
|
||||
}
|
||||
else
|
||||
{
|
||||
Logger::log("Invalid tile size, map not loaded", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
m_hexSideLength = mapNode.attribute("hexsidelength").as_float();
|
||||
if (m_orientation == Orientation::Hexagonal && m_hexSideLength <= 0)
|
||||
{
|
||||
Logger::log("Invalid he side length found, map not loaded", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
attribString = mapNode.attribute("staggeraxis").as_string();
|
||||
if (attribString == "x")
|
||||
{
|
||||
m_staggerAxis = StaggerAxis::X;
|
||||
}
|
||||
else if (attribString == "y")
|
||||
{
|
||||
m_staggerAxis = StaggerAxis::Y;
|
||||
}
|
||||
if ((m_orientation == Orientation::Staggered || m_orientation == Orientation::Hexagonal)
|
||||
&& m_staggerAxis == StaggerAxis::None)
|
||||
{
|
||||
Logger::log("Map missing stagger axis property. Map not loaded.", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
attribString = mapNode.attribute("staggerindex").as_string();
|
||||
if (attribString == "odd")
|
||||
{
|
||||
m_staggerIndex = StaggerIndex::Odd;
|
||||
}
|
||||
else if (attribString == "even")
|
||||
{
|
||||
m_staggerIndex = StaggerIndex::Even;
|
||||
}
|
||||
if ((m_orientation == Orientation::Staggered || m_orientation == Orientation::Hexagonal)
|
||||
&& m_staggerIndex == StaggerIndex::None)
|
||||
{
|
||||
Logger::log("Map missing stagger index property. Map not loaded.", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
m_parallaxOrigin =
|
||||
{
|
||||
mapNode.attribute("parallaxoriginx").as_float(0.f),
|
||||
mapNode.attribute("parallaxoriginy").as_float(0.f)
|
||||
};
|
||||
|
||||
//colour property is optional
|
||||
attribString = mapNode.attribute("backgroundcolor").as_string();
|
||||
if (!attribString.empty())
|
||||
{
|
||||
m_backgroundColour = colourFromString(attribString);
|
||||
}
|
||||
|
||||
//TODO do we need next object ID
|
||||
|
||||
//parse all child nodes
|
||||
for (const auto& node : mapNode.children())
|
||||
{
|
||||
std::string name = node.name();
|
||||
if (name == "tileset")
|
||||
{
|
||||
m_tilesets.emplace_back(m_workingDirectory);
|
||||
m_tilesets.back().parse(node, this);
|
||||
}
|
||||
else if (name == "layer")
|
||||
{
|
||||
m_layers.emplace_back(std::make_unique<TileLayer>(m_tileCount.x * m_tileCount.y));
|
||||
m_layers.back()->parse(node);
|
||||
}
|
||||
else if (name == "objectgroup")
|
||||
{
|
||||
m_layers.emplace_back(std::make_unique<ObjectGroup>());
|
||||
m_layers.back()->parse(node, this);
|
||||
}
|
||||
else if (name == "imagelayer")
|
||||
{
|
||||
m_layers.emplace_back(std::make_unique<ImageLayer>(m_workingDirectory));
|
||||
m_layers.back()->parse(node, this);
|
||||
}
|
||||
else if (name == "properties")
|
||||
{
|
||||
const auto& children = node.children();
|
||||
for (const auto& child : children)
|
||||
{
|
||||
m_properties.emplace_back();
|
||||
m_properties.back().parse(child);
|
||||
}
|
||||
}
|
||||
else if (name == "group")
|
||||
{
|
||||
m_layers.emplace_back(std::make_unique<LayerGroup>(m_workingDirectory, m_tileCount));
|
||||
m_layers.back()->parse(node, this);
|
||||
}
|
||||
else
|
||||
{
|
||||
LOG("Unidentified name " + name + ": node skipped", Logger::Type::Warning);
|
||||
}
|
||||
}
|
||||
// fill animated tiles for easier lookup into map
|
||||
for(const auto& ts : m_tilesets)
|
||||
{
|
||||
for(const auto& tile : ts.getTiles())
|
||||
{
|
||||
if (!tile.animation.frames.empty())
|
||||
{
|
||||
m_animTiles[tile.ID + ts.getFirstGID()] = tile;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
bool Map::reset()
|
||||
{
|
||||
m_orientation = Orientation::None;
|
||||
m_renderOrder = RenderOrder::None;
|
||||
m_tileCount = { 0u, 0u };
|
||||
m_tileSize = { 0u, 0u };
|
||||
m_hexSideLength = 0.f;
|
||||
m_staggerAxis = StaggerAxis::None;
|
||||
m_staggerIndex = StaggerIndex::None;
|
||||
m_backgroundColour = {};
|
||||
m_workingDirectory = "";
|
||||
|
||||
m_tilesets.clear();
|
||||
m_layers.clear();
|
||||
m_properties.clear();
|
||||
|
||||
m_templateObjects.clear();
|
||||
m_templateTilesets.clear();
|
||||
|
||||
m_animTiles.clear();
|
||||
|
||||
return false;
|
||||
}
|
||||
403
ext/tmxlite/src/Object.cpp
Normal file
403
ext/tmxlite/src/Object.cpp
Normal file
@@ -0,0 +1,403 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2021
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifdef USE_EXTLIBS
|
||||
#include <pugixml.hpp>
|
||||
#else
|
||||
#include "detail/pugixml.hpp"
|
||||
#endif
|
||||
#include <tmxlite/Object.hpp>
|
||||
#include <tmxlite/FreeFuncs.hpp>
|
||||
#include <tmxlite/Map.hpp>
|
||||
#include <tmxlite/Tileset.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
|
||||
#include <sstream>
|
||||
|
||||
using namespace tmx;
|
||||
|
||||
Object::Object()
|
||||
: m_UID (0),
|
||||
m_rotation (0.f),
|
||||
m_tileID (0),
|
||||
m_flipFlags (0),
|
||||
m_visible (true),
|
||||
m_shape (Shape::Rectangle)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
//public
|
||||
void Object::parse(const pugi::xml_node& node, Map* map)
|
||||
{
|
||||
std::string attribString = node.name();
|
||||
if (attribString != "object")
|
||||
{
|
||||
Logger::log("This not an Object node, parsing skipped.", Logger::Type::Error);
|
||||
return;
|
||||
}
|
||||
|
||||
m_UID = node.attribute("id").as_int();
|
||||
m_name = node.attribute("name").as_string();
|
||||
|
||||
m_class = node.attribute("type").as_string();
|
||||
if (m_class.empty())
|
||||
{
|
||||
m_class = node.attribute("class").as_string();
|
||||
}
|
||||
|
||||
m_position.x = node.attribute("x").as_float();
|
||||
m_AABB.left = m_position.x;
|
||||
m_position.y = node.attribute("y").as_float();
|
||||
m_AABB.top = m_position.y;
|
||||
m_AABB.width = node.attribute("width").as_float();
|
||||
m_AABB.height = node.attribute("height").as_float();
|
||||
m_rotation = node.attribute("rotation").as_float();
|
||||
m_visible = node.attribute("visible").as_bool(true);
|
||||
|
||||
m_tileID = node.attribute("gid").as_uint();
|
||||
|
||||
static const std::uint32_t mask = 0xf0000000;
|
||||
m_flipFlags = ((m_tileID & mask) >> 28);
|
||||
m_tileID = m_tileID & ~mask;
|
||||
|
||||
for (const auto& child : node.children())
|
||||
{
|
||||
attribString = child.name();
|
||||
if (attribString == "properties")
|
||||
{
|
||||
for (const auto& p : child.children())
|
||||
{
|
||||
m_properties.emplace_back();
|
||||
m_properties.back().parse(p);
|
||||
}
|
||||
}
|
||||
else if (attribString == "ellipse")
|
||||
{
|
||||
m_shape = Shape::Ellipse;
|
||||
}
|
||||
else if (attribString == "point")
|
||||
{
|
||||
m_shape = Shape::Point;
|
||||
}
|
||||
else if (attribString == "polygon")
|
||||
{
|
||||
m_shape = Shape::Polygon;
|
||||
parsePoints(child);
|
||||
}
|
||||
else if (attribString == "polyline")
|
||||
{
|
||||
m_shape = Shape::Polyline;
|
||||
parsePoints(child);
|
||||
}
|
||||
else if (attribString == "text")
|
||||
{
|
||||
m_shape = Shape::Text;
|
||||
parseText(child);
|
||||
}
|
||||
}
|
||||
|
||||
//parse templates last so we know which properties
|
||||
//ought to be overridden
|
||||
std::string templateStr = node.attribute("template").as_string();
|
||||
if (!templateStr.empty() && map)
|
||||
{
|
||||
parseTemplate(templateStr, map);
|
||||
}
|
||||
}
|
||||
|
||||
//private
|
||||
void Object::parsePoints(const pugi::xml_node& node)
|
||||
{
|
||||
if (node.attribute("points"))
|
||||
{
|
||||
std::string pointlist = node.attribute("points").as_string();
|
||||
std::stringstream stream(pointlist);
|
||||
std::vector<std::string> points;
|
||||
std::string pointstring;
|
||||
while (std::getline(stream, pointstring, ' '))
|
||||
{
|
||||
points.push_back(pointstring);
|
||||
}
|
||||
|
||||
//parse each pair into sf::vector2f
|
||||
for (unsigned int i = 0; i < points.size(); i++)
|
||||
{
|
||||
std::vector<float> coords;
|
||||
std::stringstream coordstream(points[i]);
|
||||
|
||||
float j;
|
||||
while (coordstream >> j)
|
||||
{
|
||||
coords.push_back(j);
|
||||
//TODO this should really ignore anything non-numeric
|
||||
if (coordstream.peek() == ',')
|
||||
{
|
||||
coordstream.ignore();
|
||||
}
|
||||
}
|
||||
m_points.emplace_back(coords[0], coords[1]);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
Logger::log("Points for polygon or polyline object are missing", Logger::Type::Warning);
|
||||
}
|
||||
}
|
||||
|
||||
void Object::parseText(const pugi::xml_node& node)
|
||||
{
|
||||
m_textData.bold = node.attribute("bold").as_bool(false);
|
||||
m_textData.colour = colourFromString(node.attribute("color").as_string("#FFFFFFFF"));
|
||||
m_textData.fontFamily = node.attribute("fontfamily").as_string();
|
||||
m_textData.italic = node.attribute("italic").as_bool(false);
|
||||
m_textData.kerning = node.attribute("kerning").as_bool(true);
|
||||
m_textData.pixelSize = node.attribute("pixelsize").as_uint(16);
|
||||
m_textData.strikethough = node.attribute("strikeout").as_bool(false);
|
||||
m_textData.underline = node.attribute("underline").as_bool(false);
|
||||
m_textData.wrap = node.attribute("wrap").as_bool(false);
|
||||
|
||||
std::string alignment = node.attribute("halign").as_string("left");
|
||||
if (alignment == "left")
|
||||
{
|
||||
m_textData.hAlign = Text::HAlign::Left;
|
||||
}
|
||||
else if (alignment == "center")
|
||||
{
|
||||
m_textData.hAlign = Text::HAlign::Centre;
|
||||
}
|
||||
else if (alignment == "right")
|
||||
{
|
||||
m_textData.hAlign = Text::HAlign::Right;
|
||||
}
|
||||
|
||||
alignment = node.attribute("valign").as_string("top");
|
||||
if (alignment == "top")
|
||||
{
|
||||
m_textData.vAlign = Text::VAlign::Top;
|
||||
}
|
||||
else if (alignment == "center")
|
||||
{
|
||||
m_textData.vAlign = Text::VAlign::Centre;
|
||||
}
|
||||
else if (alignment == "bottom")
|
||||
{
|
||||
m_textData.vAlign = Text::VAlign::Bottom;
|
||||
}
|
||||
|
||||
m_textData.content = node.text().as_string();
|
||||
}
|
||||
|
||||
void Object::parseTemplate(const std::string& path, Map* map)
|
||||
{
|
||||
assert(map);
|
||||
|
||||
auto& templateObjects = map->getTemplateObjects();
|
||||
auto& templateTilesets = map->getTemplateTilesets();
|
||||
|
||||
//load the template if not already loaded
|
||||
if (templateObjects.count(path) == 0)
|
||||
{
|
||||
auto templatePath = map->getWorkingDirectory() + "/" + path;
|
||||
|
||||
pugi::xml_document doc;
|
||||
if (!doc.load_file(templatePath.c_str()))
|
||||
{
|
||||
Logger::log("Failed opening template file " + path, Logger::Type::Error);
|
||||
return;
|
||||
}
|
||||
|
||||
auto templateNode = doc.child("template");
|
||||
if (!templateNode)
|
||||
{
|
||||
Logger::log("Template node missing from " + path, Logger::Type::Error);
|
||||
return;
|
||||
}
|
||||
|
||||
//if the template has a tileset load that (if not already loaded)
|
||||
std::string tilesetName;
|
||||
auto tileset = templateNode.child("tileset");
|
||||
if (tileset)
|
||||
{
|
||||
tilesetName = tileset.attribute("source").as_string();
|
||||
if (!tilesetName.empty() &&
|
||||
templateTilesets.count(tilesetName) == 0)
|
||||
{
|
||||
templateTilesets.insert(std::make_pair(tilesetName, Tileset(map->getWorkingDirectory())));
|
||||
templateTilesets.at(tilesetName).parse(tileset, map);
|
||||
}
|
||||
}
|
||||
|
||||
//parse the object - don't pass the map pointer here so there's
|
||||
//no recursion if someone tried to get clever and put a template in a template
|
||||
auto obj = templateNode.child("object");
|
||||
if (obj)
|
||||
{
|
||||
templateObjects.insert(std::make_pair(path, Object()));
|
||||
templateObjects[path].parse(obj, nullptr);
|
||||
templateObjects[path].m_tilesetName = tilesetName;
|
||||
}
|
||||
}
|
||||
|
||||
//apply any non-overridden object properties from the template
|
||||
if (templateObjects.count(path) != 0)
|
||||
{
|
||||
const auto& obj = templateObjects[path];
|
||||
if (m_AABB.width == 0)
|
||||
{
|
||||
m_AABB.width = obj.m_AABB.width;
|
||||
}
|
||||
|
||||
if (m_AABB.height == 0)
|
||||
{
|
||||
m_AABB.height = obj.m_AABB.height;
|
||||
}
|
||||
|
||||
m_tilesetName = obj.m_tilesetName;
|
||||
|
||||
if (m_name.empty())
|
||||
{
|
||||
m_name = obj.m_name;
|
||||
}
|
||||
|
||||
if (m_class.empty())
|
||||
{
|
||||
m_class = obj.m_class;
|
||||
}
|
||||
|
||||
if (m_rotation == 0)
|
||||
{
|
||||
m_rotation = obj.m_rotation;
|
||||
}
|
||||
|
||||
if (m_tileID == 0)
|
||||
{
|
||||
m_tileID = obj.m_tileID;
|
||||
}
|
||||
|
||||
if (m_flipFlags == 0)
|
||||
{
|
||||
m_flipFlags = obj.m_flipFlags;
|
||||
}
|
||||
|
||||
if (m_shape == Shape::Rectangle)
|
||||
{
|
||||
m_shape = obj.m_shape;
|
||||
}
|
||||
|
||||
if (m_points.empty())
|
||||
{
|
||||
m_points = obj.m_points;
|
||||
}
|
||||
|
||||
//compare properties and only copy ones that don't exist
|
||||
for (const auto& p : obj.m_properties)
|
||||
{
|
||||
auto result = std::find_if(m_properties.begin(), m_properties.end(),
|
||||
[&p](const Property& a)
|
||||
{
|
||||
return a.getName() == p.getName();
|
||||
});
|
||||
|
||||
if (result == m_properties.end())
|
||||
{
|
||||
m_properties.push_back(p);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
if (m_shape == Shape::Text)
|
||||
{
|
||||
//check each text property and update as necessary
|
||||
//TODO this makes he assumption we prefer the template
|
||||
//properties over the default ones - this might not
|
||||
//actually be the case....
|
||||
const auto& otherText = obj.m_textData;
|
||||
if (m_textData.fontFamily.empty())
|
||||
{
|
||||
m_textData.fontFamily = otherText.fontFamily;
|
||||
}
|
||||
|
||||
if (m_textData.pixelSize == 16)
|
||||
{
|
||||
m_textData.pixelSize = otherText.pixelSize;
|
||||
}
|
||||
|
||||
//TODO this isn't actually right if we *want* to be false
|
||||
//and the template is set to true...
|
||||
if (m_textData.wrap == false)
|
||||
{
|
||||
m_textData.wrap = otherText.wrap;
|
||||
}
|
||||
|
||||
if (m_textData.colour == Colour())
|
||||
{
|
||||
m_textData.colour = otherText.colour;
|
||||
}
|
||||
|
||||
if (m_textData.bold == false)
|
||||
{
|
||||
m_textData.bold = otherText.bold;
|
||||
}
|
||||
|
||||
if (m_textData.italic == false)
|
||||
{
|
||||
m_textData.italic = otherText.italic;
|
||||
}
|
||||
|
||||
if (m_textData.underline == false)
|
||||
{
|
||||
m_textData.underline = otherText.underline;
|
||||
}
|
||||
|
||||
if (m_textData.strikethough == false)
|
||||
{
|
||||
m_textData.strikethough = otherText.strikethough;
|
||||
}
|
||||
|
||||
if (m_textData.kerning == true)
|
||||
{
|
||||
m_textData.kerning = otherText.kerning;
|
||||
}
|
||||
|
||||
if (m_textData.hAlign == Text::HAlign::Left)
|
||||
{
|
||||
m_textData.hAlign = otherText.hAlign;
|
||||
}
|
||||
|
||||
if (m_textData.vAlign == Text::VAlign::Top)
|
||||
{
|
||||
m_textData.vAlign = otherText.vAlign;
|
||||
}
|
||||
|
||||
if (m_textData.content.empty())
|
||||
{
|
||||
m_textData.content = otherText.content;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
102
ext/tmxlite/src/ObjectGroup.cpp
Normal file
102
ext/tmxlite/src/ObjectGroup.cpp
Normal file
@@ -0,0 +1,102 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2023
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifdef USE_EXTLIBS
|
||||
#include <pugixml.hpp>
|
||||
#else
|
||||
#include "detail/pugixml.hpp"
|
||||
#endif
|
||||
#include <tmxlite/FreeFuncs.hpp>
|
||||
#include <tmxlite/ObjectGroup.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
|
||||
using namespace tmx;
|
||||
|
||||
ObjectGroup::ObjectGroup()
|
||||
: m_colour (127, 127, 127, 255),
|
||||
m_drawOrder (DrawOrder::TopDown)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
//public
|
||||
void ObjectGroup::parse(const pugi::xml_node& node, Map* map)
|
||||
{
|
||||
assert(map);
|
||||
|
||||
std::string attribString = node.name();
|
||||
if (attribString != "objectgroup")
|
||||
{
|
||||
Logger::log("Node was not an object group, node will be skipped.", Logger::Type::Error);
|
||||
return;
|
||||
}
|
||||
|
||||
setName(node.attribute("name").as_string());
|
||||
setClass(node.attribute("class").as_string());
|
||||
|
||||
attribString = node.attribute("color").as_string();
|
||||
if (!attribString.empty())
|
||||
{
|
||||
m_colour = colourFromString(attribString);
|
||||
}
|
||||
|
||||
setOpacity(node.attribute("opacity").as_float(1.f));
|
||||
setVisible(node.attribute("visible").as_bool(true));
|
||||
setOffset(node.attribute("offsetx").as_int(0), node.attribute("offsety").as_int(0));
|
||||
setSize(node.attribute("width").as_uint(0), node.attribute("height").as_uint(0));
|
||||
setParallaxFactor(node.attribute("parallaxx").as_float(1.f), node.attribute("parallaxy").as_float(1.f));
|
||||
|
||||
std::string tintColour = node.attribute("tintcolor").as_string();
|
||||
if (!tintColour.empty())
|
||||
{
|
||||
setTintColour(colourFromString(tintColour));
|
||||
}
|
||||
|
||||
attribString = node.attribute("draworder").as_string();
|
||||
if (attribString == "index")
|
||||
{
|
||||
m_drawOrder = DrawOrder::Index;
|
||||
}
|
||||
|
||||
for (const auto& child : node.children())
|
||||
{
|
||||
attribString = child.name();
|
||||
if (attribString == "properties")
|
||||
{
|
||||
for (const auto& p : child)
|
||||
{
|
||||
m_properties.emplace_back();
|
||||
m_properties.back().parse(p);
|
||||
}
|
||||
}
|
||||
else if (attribString == "object")
|
||||
{
|
||||
m_objects.emplace_back();
|
||||
m_objects.back().parse(child, map);
|
||||
}
|
||||
}
|
||||
}
|
||||
154
ext/tmxlite/src/ObjectTypes.cpp
Normal file
154
ext/tmxlite/src/ObjectTypes.cpp
Normal file
@@ -0,0 +1,154 @@
|
||||
/*********************************************************************
|
||||
Raphaël Frantz 2021
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifdef USE_EXTLIBS
|
||||
#include <pugixml.hpp>
|
||||
#else
|
||||
#include "detail/pugixml.hpp"
|
||||
#endif
|
||||
#include <tmxlite/FreeFuncs.hpp>
|
||||
#include <tmxlite/ObjectTypes.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
|
||||
using namespace tmx;
|
||||
|
||||
bool ObjectTypes::load(const std::string &path)
|
||||
{
|
||||
reset();
|
||||
|
||||
//open the doc
|
||||
pugi::xml_document doc;
|
||||
auto result = doc.load_file(path.c_str());
|
||||
if (!result)
|
||||
{
|
||||
Logger::log("Failed opening " + path, Logger::Type::Error);
|
||||
Logger::log("Reason: " + std::string(result.description()), Logger::Type::Error);
|
||||
return false;
|
||||
}
|
||||
|
||||
//make sure we have consistent path separators
|
||||
m_workingDirectory = path;
|
||||
std::replace(m_workingDirectory.begin(), m_workingDirectory.end(), '\\', '/');
|
||||
m_workingDirectory = getFilePath(m_workingDirectory);
|
||||
|
||||
if (!m_workingDirectory.empty() &&
|
||||
m_workingDirectory.back() == '/')
|
||||
{
|
||||
m_workingDirectory.pop_back();
|
||||
}
|
||||
|
||||
|
||||
//find the node and bail if it doesn't exist
|
||||
auto node = doc.child("objecttypes");
|
||||
if (!node)
|
||||
{
|
||||
Logger::log("Failed opening object types: " + path + ", no objecttype node found", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
return parseObjectTypesNode(node);
|
||||
}
|
||||
|
||||
bool ObjectTypes::loadFromString(const std::string &data, const std::string &workingDir)
|
||||
{
|
||||
reset();
|
||||
|
||||
//open the doc
|
||||
pugi::xml_document doc;
|
||||
auto result = doc.load_string(data.c_str());
|
||||
if (!result)
|
||||
{
|
||||
Logger::log("Failed opening object types", Logger::Type::Error);
|
||||
Logger::log("Reason: " + std::string(result.description()), Logger::Type::Error);
|
||||
return false;
|
||||
}
|
||||
|
||||
//make sure we have consistent path separators
|
||||
m_workingDirectory = workingDir;
|
||||
std::replace(m_workingDirectory.begin(), m_workingDirectory.end(), '\\', '/');
|
||||
m_workingDirectory = getFilePath(m_workingDirectory);
|
||||
|
||||
if (!m_workingDirectory.empty() &&
|
||||
m_workingDirectory.back() == '/')
|
||||
{
|
||||
m_workingDirectory.pop_back();
|
||||
}
|
||||
|
||||
|
||||
//find the node and bail if it doesn't exist
|
||||
auto node = doc.child("objecttypes");
|
||||
if (!node)
|
||||
{
|
||||
Logger::log("Failed object types: no objecttypes node found", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
return parseObjectTypesNode(node);
|
||||
}
|
||||
|
||||
bool ObjectTypes::parseObjectTypesNode(const pugi::xml_node &node)
|
||||
{
|
||||
//<objecttypes> <-- node
|
||||
// <objecttype name="Character" color="#1e47ff">
|
||||
// <property>...
|
||||
|
||||
//parse types
|
||||
for(const auto& child : node.children())
|
||||
{
|
||||
std::string attribString = child.name();
|
||||
if (attribString == "objecttype")
|
||||
{
|
||||
Type type;
|
||||
|
||||
//parse the metadata of the type
|
||||
type.name = child.attribute("name").as_string();
|
||||
type.colour = colourFromString(child.attribute("color").as_string("#FFFFFFFF"));;
|
||||
|
||||
//parse the default properties of the type
|
||||
for (const auto& p : child.children())
|
||||
{
|
||||
Property prop;
|
||||
prop.parse(p, true);
|
||||
type.properties.push_back(prop);
|
||||
}
|
||||
|
||||
m_types.push_back(type);
|
||||
}
|
||||
else
|
||||
{
|
||||
LOG("Unidentified name " + attribString + ": node skipped", Logger::Type::Warning);
|
||||
}
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
bool ObjectTypes::reset()
|
||||
{
|
||||
m_workingDirectory.clear();
|
||||
m_types.clear();
|
||||
return false;
|
||||
}
|
||||
167
ext/tmxlite/src/Property.cpp
Normal file
167
ext/tmxlite/src/Property.cpp
Normal file
@@ -0,0 +1,167 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2021
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifdef USE_EXTLIBS
|
||||
#include <pugixml.hpp>
|
||||
#else
|
||||
#include "detail/pugixml.hpp"
|
||||
#endif
|
||||
#include <tmxlite/Property.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
#include <tmxlite/FreeFuncs.hpp>
|
||||
|
||||
using namespace tmx;
|
||||
|
||||
Property::Property()
|
||||
: m_type(Type::Undef)
|
||||
{
|
||||
}
|
||||
|
||||
Property Property::fromBoolean(bool value)
|
||||
{
|
||||
Property p;
|
||||
p.m_type = Type::Boolean;
|
||||
p.m_boolValue = value;
|
||||
return p;
|
||||
}
|
||||
|
||||
Property Property::fromFloat(float value)
|
||||
{
|
||||
Property p;
|
||||
p.m_type = Type::Float;
|
||||
p.m_floatValue = value;
|
||||
return p;
|
||||
}
|
||||
|
||||
Property Property::fromInt(int value)
|
||||
{
|
||||
Property p;
|
||||
p.m_type = Type::Int;
|
||||
p.m_intValue = value;
|
||||
return p;
|
||||
}
|
||||
|
||||
Property Property::fromString(const std::string& value)
|
||||
{
|
||||
Property p;
|
||||
p.m_type = Type::String;
|
||||
p.m_stringValue = value;
|
||||
return p;
|
||||
}
|
||||
|
||||
Property Property::fromColour(const Colour& value)
|
||||
{
|
||||
Property p;
|
||||
p.m_type = Type::Colour;
|
||||
p.m_colourValue = value;
|
||||
return p;
|
||||
}
|
||||
|
||||
Property Property::fromFile(const std::string& value)
|
||||
{
|
||||
Property p;
|
||||
p.m_type = Type::File;
|
||||
p.m_stringValue = value;
|
||||
return p;
|
||||
}
|
||||
|
||||
Property Property::fromObject(int value)
|
||||
{
|
||||
Property p;
|
||||
p.m_type = Type::Object;
|
||||
p.m_intValue = value;
|
||||
return p;
|
||||
}
|
||||
|
||||
//public
|
||||
void Property::parse(const pugi::xml_node& node, bool isObjectTypes)
|
||||
{
|
||||
// The value attribute name is different in object types
|
||||
const char *const valueAttribute = isObjectTypes ? "default" : "value";
|
||||
|
||||
std::string attribData = node.name();
|
||||
if (attribData != "property")
|
||||
{
|
||||
Logger::log("Node was not a valid property, node will be skipped", Logger::Type::Error);
|
||||
return;
|
||||
}
|
||||
|
||||
m_name = node.attribute("name").as_string();
|
||||
|
||||
attribData = node.attribute("type").as_string("string");
|
||||
if (attribData == "bool")
|
||||
{
|
||||
attribData = node.attribute(valueAttribute).as_string("false");
|
||||
m_boolValue = (attribData == "true");
|
||||
m_type = Type::Boolean;
|
||||
return;
|
||||
}
|
||||
else if (attribData == "int")
|
||||
{
|
||||
m_intValue = node.attribute(valueAttribute).as_int(0);
|
||||
m_type = Type::Int;
|
||||
return;
|
||||
}
|
||||
else if (attribData == "float")
|
||||
{
|
||||
m_floatValue = node.attribute(valueAttribute).as_float(0.f);
|
||||
m_type = Type::Float;
|
||||
return;
|
||||
}
|
||||
else if (attribData == "string")
|
||||
{
|
||||
m_stringValue = node.attribute(valueAttribute).as_string();
|
||||
|
||||
//if value is empty, try getting the child value instead
|
||||
//as this is how multiline string properties are stored.
|
||||
if(m_stringValue.empty())
|
||||
{
|
||||
m_stringValue = node.child_value();
|
||||
}
|
||||
|
||||
m_type = Type::String;
|
||||
return;
|
||||
}
|
||||
else if (attribData == "color")
|
||||
{
|
||||
m_colourValue = colourFromString(node.attribute(valueAttribute).as_string("#FFFFFFFF"));
|
||||
m_type = Type::Colour;
|
||||
return;
|
||||
}
|
||||
else if (attribData == "file")
|
||||
{
|
||||
m_stringValue = node.attribute(valueAttribute).as_string();
|
||||
m_type = Type::File;
|
||||
return;
|
||||
}
|
||||
else if (attribData == "object")
|
||||
{
|
||||
m_intValue = node.attribute(valueAttribute).as_int(0);
|
||||
m_type = Type::Object;
|
||||
return;
|
||||
}
|
||||
}
|
||||
340
ext/tmxlite/src/TileLayer.cpp
Normal file
340
ext/tmxlite/src/TileLayer.cpp
Normal file
@@ -0,0 +1,340 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2023
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifdef USE_EXTLIBS
|
||||
#include <pugixml.hpp>
|
||||
#include <zstd.h>
|
||||
#else
|
||||
#include "detail/pugixml.hpp"
|
||||
#endif
|
||||
|
||||
#ifdef USE_ZSTD
|
||||
#include <zstd.h>
|
||||
#endif
|
||||
|
||||
#include <tmxlite/FreeFuncs.hpp>
|
||||
#include <tmxlite/TileLayer.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
|
||||
#include <sstream>
|
||||
|
||||
using namespace tmx;
|
||||
|
||||
namespace
|
||||
{
|
||||
struct CompressionType final
|
||||
{
|
||||
enum
|
||||
{
|
||||
Zlib, GZip, Zstd, None
|
||||
};
|
||||
};
|
||||
}
|
||||
|
||||
TileLayer::TileLayer(std::size_t tileCount)
|
||||
: m_tileCount (tileCount)
|
||||
{
|
||||
m_tiles.reserve(tileCount);
|
||||
}
|
||||
|
||||
//public
|
||||
void TileLayer::parse(const pugi::xml_node& node, Map*)
|
||||
{
|
||||
std::string attribName = node.name();
|
||||
if (attribName != "layer")
|
||||
{
|
||||
Logger::log("node not a layer node, skipped parsing", Logger::Type::Error);
|
||||
return;
|
||||
}
|
||||
|
||||
setName(node.attribute("name").as_string());
|
||||
setClass(node.attribute("class").as_string());
|
||||
setOpacity(node.attribute("opacity").as_float(1.f));
|
||||
setVisible(node.attribute("visible").as_bool(true));
|
||||
setOffset(node.attribute("offsetx").as_int(0), node.attribute("offsety").as_int(0));
|
||||
setSize(node.attribute("width").as_uint(0), node.attribute("height").as_uint(0));
|
||||
setParallaxFactor(node.attribute("parallaxx").as_float(1.f), node.attribute("parallaxy").as_float(1.f));
|
||||
|
||||
std::string tintColour = node.attribute("tintcolor").as_string();
|
||||
if (!tintColour.empty())
|
||||
{
|
||||
setTintColour(colourFromString(tintColour));
|
||||
}
|
||||
|
||||
for (const auto& child : node.children())
|
||||
{
|
||||
attribName = child.name();
|
||||
if (attribName == "data")
|
||||
{
|
||||
attribName = child.attribute("encoding").as_string();
|
||||
if (attribName == "base64")
|
||||
{
|
||||
parseBase64(child);
|
||||
}
|
||||
else if (attribName == "csv")
|
||||
{
|
||||
parseCSV(child);
|
||||
}
|
||||
else
|
||||
{
|
||||
parseUnencoded(child);
|
||||
}
|
||||
}
|
||||
else if (attribName == "properties")
|
||||
{
|
||||
for (const auto& p : child.children())
|
||||
{
|
||||
addProperty(p);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
//private
|
||||
void TileLayer::parseBase64(const pugi::xml_node& node)
|
||||
{
|
||||
auto processDataString = [](std::string dataString, std::size_t tileCount, std::int32_t compressionType)->std::vector<std::uint32_t>
|
||||
{
|
||||
std::stringstream ss;
|
||||
ss << dataString;
|
||||
ss >> dataString;
|
||||
dataString = base64_decode(dataString);
|
||||
|
||||
std::size_t expectedSize = tileCount * 4; //4 bytes per tile
|
||||
std::vector<unsigned char> byteData;
|
||||
byteData.reserve(expectedSize);
|
||||
|
||||
switch (compressionType)
|
||||
{
|
||||
default:
|
||||
byteData.insert(byteData.end(), dataString.begin(), dataString.end());
|
||||
break;
|
||||
case CompressionType::Zstd:
|
||||
#if defined USE_ZSTD || defined USE_EXTLIBS
|
||||
{
|
||||
std::size_t dataSize = dataString.length() * sizeof(unsigned char);
|
||||
std::size_t result = ZSTD_decompress(byteData.data(), expectedSize, &dataString[0], dataSize);
|
||||
|
||||
if (ZSTD_isError(result))
|
||||
{
|
||||
std::string err = ZSTD_getErrorName(result);
|
||||
LOG("Failed to decompress layer data, node skipped.\nError: " + err, Logger::Type::Error);
|
||||
}
|
||||
}
|
||||
#else
|
||||
Logger::log("Library must be built with USE_EXTLIBS or USE_ZSTD for Zstd compression", Logger::Type::Error);
|
||||
return {};
|
||||
#endif
|
||||
case CompressionType::GZip:
|
||||
#ifndef USE_EXTLIBS
|
||||
Logger::log("Library must be built with USE_EXTLIBS for GZip compression", Logger::Type::Error);
|
||||
return {};
|
||||
#endif
|
||||
//[[fallthrough]];
|
||||
case CompressionType::Zlib:
|
||||
{
|
||||
//unzip
|
||||
std::size_t dataSize = dataString.length() * sizeof(unsigned char);
|
||||
|
||||
if (!decompress(dataString.c_str(), byteData, dataSize, expectedSize))
|
||||
{
|
||||
LOG("Failed to decompress layer data, node skipped.", Logger::Type::Error);
|
||||
return {};
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
|
||||
//data stream is in bytes so we need to OR into 32 bit values
|
||||
std::vector<std::uint32_t> IDs;
|
||||
IDs.reserve(tileCount);
|
||||
for (auto i = 0u; i < expectedSize - 3u; i += 4u)
|
||||
{
|
||||
std::uint32_t id = byteData[i] | byteData[i + 1] << 8 | byteData[i + 2] << 16 | byteData[i + 3] << 24;
|
||||
IDs.push_back(id);
|
||||
}
|
||||
|
||||
return IDs;
|
||||
};
|
||||
|
||||
std::int32_t compressionType = CompressionType::None;
|
||||
std::string compression = node.attribute("compression").as_string();
|
||||
if (compression == "gzip")
|
||||
{
|
||||
compressionType = CompressionType::GZip;
|
||||
}
|
||||
else if (compression == "zlib")
|
||||
{
|
||||
compressionType = CompressionType::Zlib;
|
||||
}
|
||||
else if (compression == "zstd")
|
||||
{
|
||||
compressionType = CompressionType::Zstd;
|
||||
}
|
||||
|
||||
std::string data = node.text().as_string();
|
||||
if (data.empty())
|
||||
{
|
||||
//check for chunk nodes
|
||||
auto dataCount = 0;
|
||||
for (const auto& childNode : node.children())
|
||||
{
|
||||
std::string childName = childNode.name();
|
||||
if (childName == "chunk")
|
||||
{
|
||||
std::string dataString = childNode.text().as_string();
|
||||
if (!dataString.empty())
|
||||
{
|
||||
Chunk chunk;
|
||||
chunk.position.x = childNode.attribute("x").as_int();
|
||||
chunk.position.y = childNode.attribute("y").as_int();
|
||||
|
||||
chunk.size.x = childNode.attribute("width").as_int();
|
||||
chunk.size.y = childNode.attribute("height").as_int();
|
||||
|
||||
auto IDs = processDataString(dataString, (chunk.size.x * chunk.size.y), compressionType);
|
||||
|
||||
if (!IDs.empty())
|
||||
{
|
||||
createTiles(IDs, chunk.tiles);
|
||||
m_chunks.push_back(chunk);
|
||||
dataCount++;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (dataCount == 0)
|
||||
{
|
||||
Logger::log("Layer " + getName() + " has no layer data. Layer skipped.", Logger::Type::Error);
|
||||
return;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
auto IDs = processDataString(data, m_tileCount, compressionType);
|
||||
createTiles(IDs, m_tiles);
|
||||
}
|
||||
}
|
||||
|
||||
void TileLayer::parseCSV(const pugi::xml_node& node)
|
||||
{
|
||||
auto processDataString = [](const std::string dataString, std::size_t tileCount)->std::vector<std::uint32_t>
|
||||
{
|
||||
std::vector<std::uint32_t> IDs;
|
||||
IDs.reserve(tileCount);
|
||||
|
||||
const char* ptr = dataString.c_str();
|
||||
while (true)
|
||||
{
|
||||
char* end;
|
||||
auto res = std::strtoul(ptr, &end, 10);
|
||||
if (end == ptr) break;
|
||||
ptr = end;
|
||||
IDs.push_back(res);
|
||||
if (*ptr == ',') ++ptr;
|
||||
}
|
||||
|
||||
return IDs;
|
||||
};
|
||||
|
||||
std::string data = node.text().as_string();
|
||||
if (data.empty())
|
||||
{
|
||||
//check for chunk nodes
|
||||
auto dataCount = 0;
|
||||
for (const auto& childNode : node.children())
|
||||
{
|
||||
std::string childName = childNode.name();
|
||||
if (childName == "chunk")
|
||||
{
|
||||
std::string dataString = childNode.text().as_string();
|
||||
if (!dataString.empty())
|
||||
{
|
||||
Chunk chunk;
|
||||
chunk.position.x = childNode.attribute("x").as_int();
|
||||
chunk.position.y = childNode.attribute("y").as_int();
|
||||
|
||||
chunk.size.x = childNode.attribute("width").as_int();
|
||||
chunk.size.y = childNode.attribute("height").as_int();
|
||||
|
||||
auto IDs = processDataString(dataString, chunk.size.x * chunk.size.y);
|
||||
|
||||
if (!IDs.empty())
|
||||
{
|
||||
createTiles(IDs, chunk.tiles);
|
||||
m_chunks.push_back(chunk);
|
||||
dataCount++;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (dataCount == 0)
|
||||
{
|
||||
Logger::log("Layer " + getName() + " has no layer data. Layer skipped.", Logger::Type::Error);
|
||||
return;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
createTiles(processDataString(data, m_tileCount), m_tiles);
|
||||
}
|
||||
}
|
||||
|
||||
void TileLayer::parseUnencoded(const pugi::xml_node& node)
|
||||
{
|
||||
std::string attribName;
|
||||
std::vector<std::uint32_t> IDs;
|
||||
IDs.reserve(m_tileCount);
|
||||
|
||||
for (const auto& child : node.children())
|
||||
{
|
||||
attribName = child.name();
|
||||
if (attribName == "tile")
|
||||
{
|
||||
IDs.push_back(child.attribute("gid").as_uint());
|
||||
}
|
||||
}
|
||||
|
||||
createTiles(IDs, m_tiles);
|
||||
}
|
||||
|
||||
void TileLayer::createTiles(const std::vector<std::uint32_t>& IDs, std::vector<Tile>& destination)
|
||||
{
|
||||
//LOG(IDs.size() != m_tileCount, "Layer tile count does not match expected size. Found: "
|
||||
// + std::to_string(IDs.size()) + ", expected: " + std::to_string(m_tileCount));
|
||||
|
||||
static const std::uint32_t mask = 0xf0000000;
|
||||
for (const auto& id : IDs)
|
||||
{
|
||||
destination.emplace_back();
|
||||
destination.back().flipFlags = ((id & mask) >> 28);
|
||||
destination.back().ID = id & ~mask;
|
||||
}
|
||||
}
|
||||
460
ext/tmxlite/src/Tileset.cpp
Normal file
460
ext/tmxlite/src/Tileset.cpp
Normal file
@@ -0,0 +1,460 @@
|
||||
/*********************************************************************
|
||||
Matt Marchant 2016 - 2023
|
||||
http://trederia.blogspot.com
|
||||
|
||||
tmxlite - Zlib license.
|
||||
|
||||
This software is provided 'as-is', without any express or
|
||||
implied warranty. In no event will the authors be held
|
||||
liable for any damages arising from the use of this software.
|
||||
|
||||
Permission is granted to anyone to use this software for any purpose,
|
||||
including commercial applications, and to alter it and redistribute
|
||||
it freely, subject to the following restrictions:
|
||||
|
||||
1. The origin of this software must not be misrepresented;
|
||||
you must not claim that you wrote the original software.
|
||||
If you use this software in a product, an acknowledgment
|
||||
in the product documentation would be appreciated but
|
||||
is not required.
|
||||
|
||||
2. Altered source versions must be plainly marked as such,
|
||||
and must not be misrepresented as being the original software.
|
||||
|
||||
3. This notice may not be removed or altered from any
|
||||
source distribution.
|
||||
*********************************************************************/
|
||||
|
||||
#ifdef USE_EXTLIBS
|
||||
#include <pugixml.hpp>
|
||||
#else
|
||||
#include "detail/pugixml.hpp"
|
||||
#endif
|
||||
#include <tmxlite/Tileset.hpp>
|
||||
#include <tmxlite/FreeFuncs.hpp>
|
||||
#include <tmxlite/detail/Log.hpp>
|
||||
|
||||
#include <ctype.h>
|
||||
|
||||
using namespace tmx;
|
||||
|
||||
Tileset::Tileset(const std::string& workingDir)
|
||||
: m_workingDir (workingDir),
|
||||
m_firstGID (0),
|
||||
m_spacing (0),
|
||||
m_margin (0),
|
||||
m_tileCount (0),
|
||||
m_columnCount (0),
|
||||
m_objectAlignment (ObjectAlignment::Unspecified),
|
||||
m_transparencyColour (0, 0, 0, 0),
|
||||
m_hasTransparency (false)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
//public
|
||||
void Tileset::parse(pugi::xml_node node, Map* map)
|
||||
{
|
||||
assert(map);
|
||||
|
||||
std::string attribString = node.name();
|
||||
if (attribString != "tileset")
|
||||
{
|
||||
Logger::log(attribString + ": not a tileset node! Node will be skipped.", Logger::Type::Warning);
|
||||
return;
|
||||
}
|
||||
|
||||
m_firstGID = node.attribute("firstgid").as_int();
|
||||
if (m_firstGID == 0)
|
||||
{
|
||||
Logger::log("Invalid first GID in tileset. Tileset node skipped.", Logger::Type::Warning);
|
||||
return;
|
||||
}
|
||||
|
||||
pugi::xml_document tsxDoc; //need to keep this in scope
|
||||
if (node.attribute("source"))
|
||||
{
|
||||
//parse TSX doc
|
||||
std::string path = node.attribute("source").as_string();
|
||||
path = resolveFilePath(path, m_workingDir);
|
||||
|
||||
//as the TSX file now dictates the image path, the working
|
||||
//directory is now that of the tsx file
|
||||
auto position = path.find_last_of('/');
|
||||
if (position != std::string::npos)
|
||||
{
|
||||
m_workingDir = path.substr(0, position);
|
||||
}
|
||||
else
|
||||
{
|
||||
m_workingDir = "";
|
||||
}
|
||||
|
||||
//see if doc can be opened
|
||||
auto result = tsxDoc.load_file(path.c_str());
|
||||
if (!result)
|
||||
{
|
||||
Logger::log(path + ": Failed opening tsx file for tile set, tile set will be skipped", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
//if it can then replace the current node with tsx node
|
||||
node = tsxDoc.child("tileset");
|
||||
if (!node)
|
||||
{
|
||||
Logger::log("tsx file does not contain a tile set node, tile set will be skipped", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
}
|
||||
|
||||
m_name = node.attribute("name").as_string();
|
||||
LOG("found tile set " + m_name, Logger::Type::Info);
|
||||
m_class = node.attribute("class").as_string();
|
||||
|
||||
m_tileSize.x = node.attribute("tilewidth").as_int();
|
||||
m_tileSize.y = node.attribute("tileheight").as_int();
|
||||
if (m_tileSize.x == 0 || m_tileSize.y == 0)
|
||||
{
|
||||
Logger::log("Invalid tile size found in tile set node. Node will be skipped.", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
|
||||
m_spacing = node.attribute("spacing").as_int();
|
||||
m_margin = node.attribute("margin").as_int();
|
||||
m_tileCount = node.attribute("tilecount").as_int();
|
||||
m_columnCount = node.attribute("columns").as_int();
|
||||
|
||||
m_tileIndex.reserve(m_tileCount);
|
||||
m_tiles.reserve(m_tileCount);
|
||||
|
||||
std::string objectAlignment = node.attribute("objectalignment").as_string();
|
||||
if (!objectAlignment.empty())
|
||||
{
|
||||
if (objectAlignment == "unspecified")
|
||||
{
|
||||
m_objectAlignment = ObjectAlignment::Unspecified;
|
||||
}
|
||||
else if (objectAlignment == "topleft")
|
||||
{
|
||||
m_objectAlignment = ObjectAlignment::TopLeft;
|
||||
}
|
||||
else if (objectAlignment == "top")
|
||||
{
|
||||
m_objectAlignment = ObjectAlignment::Top;
|
||||
}
|
||||
else if (objectAlignment == "topright")
|
||||
{
|
||||
m_objectAlignment = ObjectAlignment::TopRight;
|
||||
}
|
||||
else if (objectAlignment == "left")
|
||||
{
|
||||
m_objectAlignment = ObjectAlignment::Left;
|
||||
}
|
||||
else if (objectAlignment == "center")
|
||||
{
|
||||
m_objectAlignment = ObjectAlignment::Center;
|
||||
}
|
||||
else if (objectAlignment == "right")
|
||||
{
|
||||
m_objectAlignment = ObjectAlignment::Right;
|
||||
}
|
||||
else if (objectAlignment == "bottomleft")
|
||||
{
|
||||
m_objectAlignment = ObjectAlignment::BottomLeft;
|
||||
}
|
||||
else if (objectAlignment == "bottom")
|
||||
{
|
||||
m_objectAlignment = ObjectAlignment::Bottom;
|
||||
}
|
||||
else if (objectAlignment == "bottomright")
|
||||
{
|
||||
m_objectAlignment = ObjectAlignment::BottomRight;
|
||||
}
|
||||
}
|
||||
|
||||
const auto& children = node.children();
|
||||
for (const auto& node : children)
|
||||
{
|
||||
std::string name = node.name();
|
||||
if (name == "image")
|
||||
{
|
||||
//TODO this currently doesn't cover embedded images
|
||||
//mostly because I can't figure out how to export them
|
||||
//from the Tiled editor... but also resource handling
|
||||
//should be handled by the renderer, not the parser.
|
||||
attribString = node.attribute("source").as_string();
|
||||
if (attribString.empty())
|
||||
{
|
||||
Logger::log("Tileset image node has missing source property, tile set not loaded", Logger::Type::Error);
|
||||
return reset();
|
||||
}
|
||||
m_imagePath = resolveFilePath(attribString, m_workingDir);
|
||||
if (node.attribute("trans"))
|
||||
{
|
||||
attribString = node.attribute("trans").as_string();
|
||||
m_transparencyColour = colourFromString(attribString);
|
||||
m_hasTransparency = true;
|
||||
}
|
||||
if (node.attribute("width") && node.attribute("height"))
|
||||
{
|
||||
m_imageSize.x = node.attribute("width").as_int();
|
||||
m_imageSize.y = node.attribute("height").as_int();
|
||||
}
|
||||
}
|
||||
else if (name == "tileoffset")
|
||||
{
|
||||
parseOffsetNode(node);
|
||||
}
|
||||
else if (name == "properties")
|
||||
{
|
||||
parsePropertyNode(node);
|
||||
}
|
||||
else if (name == "terraintypes")
|
||||
{
|
||||
parseTerrainNode(node);
|
||||
}
|
||||
else if (name == "tile")
|
||||
{
|
||||
parseTileNode(node, map);
|
||||
}
|
||||
}
|
||||
|
||||
//if the tsx file does not declare every tile, we create the missing ones
|
||||
if (m_tiles.size() != getTileCount())
|
||||
{
|
||||
for (std::uint32_t ID = 0; ID < getTileCount(); ID++)
|
||||
{
|
||||
createMissingTile(ID);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
std::uint32_t Tileset::getLastGID() const
|
||||
{
|
||||
assert(!m_tileIndex.empty());
|
||||
return m_firstGID + static_cast<std::uint32_t>(m_tileIndex.size()) - 1;
|
||||
}
|
||||
|
||||
const Tileset::Tile* Tileset::getTile(std::uint32_t id) const
|
||||
{
|
||||
if (!hasTile(id))
|
||||
{
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
//corrects the ID. Indices and IDs are different.
|
||||
id -= m_firstGID;
|
||||
id = m_tileIndex[id];
|
||||
return id ? &m_tiles[id - 1] : nullptr;
|
||||
}
|
||||
|
||||
//private
|
||||
void Tileset::reset()
|
||||
{
|
||||
m_firstGID = 0;
|
||||
m_source = "";
|
||||
m_name = "";
|
||||
m_class = "";
|
||||
m_tileSize = { 0,0 };
|
||||
m_spacing = 0;
|
||||
m_margin = 0;
|
||||
m_tileCount = 0;
|
||||
m_columnCount = 0;
|
||||
m_objectAlignment = ObjectAlignment::Unspecified;
|
||||
m_tileOffset = { 0,0 };
|
||||
m_properties.clear();
|
||||
m_imagePath = "";
|
||||
m_transparencyColour = { 0, 0, 0, 0 };
|
||||
m_hasTransparency = false;
|
||||
m_terrainTypes.clear();
|
||||
m_tileIndex.clear();
|
||||
m_tiles.clear();
|
||||
}
|
||||
|
||||
void Tileset::parseOffsetNode(const pugi::xml_node& node)
|
||||
{
|
||||
m_tileOffset.x = node.attribute("x").as_int();
|
||||
m_tileOffset.y = node.attribute("y").as_int();
|
||||
}
|
||||
|
||||
void Tileset::parsePropertyNode(const pugi::xml_node& node)
|
||||
{
|
||||
const auto& children = node.children();
|
||||
for (const auto& child : children)
|
||||
{
|
||||
m_properties.emplace_back();
|
||||
m_properties.back().parse(child);
|
||||
}
|
||||
}
|
||||
|
||||
void Tileset::parseTerrainNode(const pugi::xml_node& node)
|
||||
{
|
||||
const auto& children = node.children();
|
||||
for (const auto& child : children)
|
||||
{
|
||||
std::string name = child.name();
|
||||
if (name == "terrain")
|
||||
{
|
||||
m_terrainTypes.emplace_back();
|
||||
auto& terrain = m_terrainTypes.back();
|
||||
terrain.name = child.attribute("name").as_string();
|
||||
terrain.tileID = child.attribute("tile").as_int();
|
||||
auto properties = child.child("properties");
|
||||
if (properties)
|
||||
{
|
||||
for (const auto& p : properties)
|
||||
{
|
||||
name = p.name();
|
||||
if (name == "property")
|
||||
{
|
||||
terrain.properties.emplace_back();
|
||||
terrain.properties.back().parse(p);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
Tileset::Tile& Tileset::newTile(std::uint32_t ID)
|
||||
{
|
||||
Tile& tile = (m_tiles.emplace_back(), m_tiles.back());
|
||||
if (m_tileIndex.size() <= ID)
|
||||
{
|
||||
m_tileIndex.resize(ID + 1, 0);
|
||||
}
|
||||
|
||||
m_tileIndex[ID] = static_cast<std::uint32_t>(m_tiles.size());
|
||||
tile.ID = ID;
|
||||
return tile;
|
||||
}
|
||||
|
||||
void Tileset::parseTileNode(const pugi::xml_node& node, Map* map)
|
||||
{
|
||||
assert(map);
|
||||
|
||||
Tile& tile = newTile(node.attribute("id").as_int());
|
||||
if (node.attribute("terrain"))
|
||||
{
|
||||
std::string data = node.attribute("terrain").as_string();
|
||||
bool lastWasChar = true;
|
||||
std::size_t idx = 0u;
|
||||
for (auto i = 0u; i < data.size() && idx < tile.terrainIndices.size(); ++i)
|
||||
{
|
||||
if (isdigit(data[i]))
|
||||
{
|
||||
tile.terrainIndices[idx++] = std::atoi(&data[i]);
|
||||
lastWasChar = false;
|
||||
}
|
||||
else
|
||||
{
|
||||
if (!lastWasChar)
|
||||
{
|
||||
lastWasChar = true;
|
||||
}
|
||||
else
|
||||
{
|
||||
tile.terrainIndices[idx++] = -1;
|
||||
lastWasChar = false;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (lastWasChar)
|
||||
{
|
||||
tile.terrainIndices[idx] = -1;
|
||||
}
|
||||
}
|
||||
|
||||
tile.probability = node.attribute("probability").as_int(100);
|
||||
|
||||
tile.className = node.attribute("type").as_string();
|
||||
if (tile.className.empty())
|
||||
{
|
||||
tile.className = node.attribute("class").as_string();
|
||||
}
|
||||
|
||||
//by default we set the tile's values as in an Image tileset
|
||||
tile.imagePath = m_imagePath;
|
||||
tile.imageSize = m_tileSize;
|
||||
|
||||
if (m_columnCount != 0)
|
||||
{
|
||||
std::uint32_t rowIndex = tile.ID % m_columnCount;
|
||||
std::uint32_t columnIndex = tile.ID / m_columnCount;
|
||||
tile.imagePosition.x = m_margin + rowIndex * (m_tileSize.x + m_spacing);
|
||||
tile.imagePosition.y = m_margin + columnIndex * (m_tileSize.y + m_spacing);
|
||||
}
|
||||
|
||||
const auto& children = node.children();
|
||||
for (const auto& child : children)
|
||||
{
|
||||
std::string name = child.name();
|
||||
if (name == "properties")
|
||||
{
|
||||
for (const auto& prop : child.children())
|
||||
{
|
||||
tile.properties.emplace_back();
|
||||
tile.properties.back().parse(prop);
|
||||
}
|
||||
}
|
||||
else if (name == "objectgroup")
|
||||
{
|
||||
tile.objectGroup.parse(child, map);
|
||||
}
|
||||
else if (name == "image")
|
||||
{
|
||||
std::string attribString = child.attribute("source").as_string();
|
||||
if (attribString.empty())
|
||||
{
|
||||
Logger::log("Tile image path missing", Logger::Type::Warning);
|
||||
continue;
|
||||
}
|
||||
tile.imagePath = resolveFilePath(attribString, m_workingDir);
|
||||
|
||||
tile.imagePosition = tmx::Vector2u(0, 0);
|
||||
|
||||
if (child.attribute("trans"))
|
||||
{
|
||||
attribString = child.attribute("trans").as_string();
|
||||
m_transparencyColour = colourFromString(attribString);
|
||||
m_hasTransparency = true;
|
||||
}
|
||||
if (child.attribute("width"))
|
||||
{
|
||||
tile.imageSize.x = child.attribute("width").as_uint();
|
||||
}
|
||||
if (child.attribute("height"))
|
||||
{
|
||||
tile.imageSize.y = child.attribute("height").as_uint();
|
||||
}
|
||||
}
|
||||
else if (name == "animation")
|
||||
{
|
||||
for (const auto& frameNode : child.children())
|
||||
{
|
||||
Tile::Animation::Frame frame;
|
||||
frame.duration = frameNode.attribute("duration").as_int();
|
||||
frame.tileID = frameNode.attribute("tileid").as_int() + m_firstGID;
|
||||
tile.animation.frames.push_back(frame);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void Tileset::createMissingTile(std::uint32_t ID)
|
||||
{
|
||||
//first, we check if the tile does not yet exist
|
||||
if (m_tileIndex.size() > ID && m_tileIndex[ID])
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
Tile& tile = newTile(ID);
|
||||
tile.imagePath = m_imagePath;
|
||||
tile.imageSize = m_tileSize;
|
||||
|
||||
std::uint32_t rowIndex = ID % m_columnCount;
|
||||
std::uint32_t columnIndex = ID / m_columnCount;
|
||||
tile.imagePosition.x = m_margin + rowIndex * (m_tileSize.x + m_spacing);
|
||||
tile.imagePosition.y = m_margin + columnIndex * (m_tileSize.y + m_spacing);
|
||||
}
|
||||
1
ext/tmxlite/src/detail/pugixml.hpp
Normal file
1
ext/tmxlite/src/detail/pugixml.hpp
Normal file
@@ -0,0 +1 @@
|
||||
#include <pugixml.hpp>
|
||||
@@ -1,22 +0,0 @@
|
||||
include(CheckIncludeFile)
|
||||
include(CheckFunctionExists)
|
||||
|
||||
check_include_file(strings.h HAVE_STRINGS_H)
|
||||
check_function_exists(strcasecmp HAVE_STRCASECMP)
|
||||
check_function_exists(_stricmp HAVE__STRICMP)
|
||||
check_function_exists(strncasecmp HAVE_STRNCASECMP)
|
||||
check_function_exists(_strnicmp HAVE__STRNICMP)
|
||||
|
||||
add_library(ultragetopt
|
||||
ultragetopt.c ultragetopt.h)
|
||||
add_library(External::ultragetopt ALIAS ultragetopt)
|
||||
|
||||
target_include_directories(ultragetopt
|
||||
PUBLIC ${CMAKE_CURRENT_SOURCE_DIR})
|
||||
|
||||
target_compile_definitions(ultragetopt PRIVATE
|
||||
$<$<BOOL:${HAVE_STRINGS_H}>:HAVE_STRINGS_H=1>
|
||||
$<$<BOOL:${HAVE_STRCASECMP}>:HAVE_STRCASECMP=1>
|
||||
$<$<BOOL:${HAVE__STRICMP}>:HAVE__STRICMP=1>
|
||||
$<$<BOOL:${HAVE_STRNCASECMP}>:HAVE_STRNCASECMP=1>
|
||||
$<$<BOOL:${HAVE__STRNICMP}>:HAVE__STRNICMP=1>)
|
||||
@@ -1,826 +0,0 @@
|
||||
/* Ultra-Getopt - A replacement for getopt() with support for many common
|
||||
* extensions, MS-DOS formatted option strings, and much more.
|
||||
*
|
||||
* To use this library as a replacement for vendor-provided getopt() functions,
|
||||
* define ULTRAGETOPT_REPLACE_GETOPT and include "ultragetopt.h" after the
|
||||
* vendor-provided headers for getopt() functions.
|
||||
*
|
||||
* Copyright (C) 2007-2011, Kevin Locke <kevin@kevinlocke.name>
|
||||
*
|
||||
* 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:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be included in
|
||||
* all copies or substantial portions of the Software.
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include <assert.h>
|
||||
#include <ctype.h> /* islower() isupper() tolower() toupper() */
|
||||
#include <stdarg.h>
|
||||
#include <stdio.h> /* fprintf() */
|
||||
#include <stdlib.h> /* getenv() */
|
||||
#include <string.h> /* strcmp(), strncmp(), strchr() */
|
||||
|
||||
#if HAVE_STRINGS_H
|
||||
# include <strings.h> /* strcasecmp(), strncasecmp() */
|
||||
#endif
|
||||
|
||||
#undef ULTRAGETOPT_REPLACE_GETOPT /* Protect against project-wide defines */
|
||||
#include "ultragetopt.h"
|
||||
|
||||
/* Define replacements for missing functions */
|
||||
#if !HAVE_STRCASECMP && HAVE__STRICMP
|
||||
# define strcasecmp _stricmp
|
||||
#endif
|
||||
|
||||
#if !HAVE_STRNCASECMP && HAVE__STRNICMP
|
||||
# define strncasecmp _strnicmp
|
||||
#endif
|
||||
|
||||
#if !HAVE_STRCHR && HAVE_INDEX
|
||||
# define strchr index
|
||||
#endif
|
||||
|
||||
/* Supported defines:
|
||||
* ULTRAGETOPT_LIKE_BSD Behave like BSD getopt()
|
||||
* ULTRAGETOPT_LIKE_DARWIN Behave like Darwin (Mac OS) getopt()
|
||||
* ULTRAGETOPT_LIKE_GNU Behave like GNU getopt()
|
||||
* ULTRAGETOPT_LIKE_POSIX Behave like POSIX definition of getopt()
|
||||
*
|
||||
* ULTRAGETOPT_ASSIGNSPACE Parse "-o value" as "value" rather than " value"
|
||||
* Note: Only applicable when argv[x] == "-o value"
|
||||
* Not for argv[x] == "-o" [x+1] == "value"
|
||||
* ULTRAGETOPT_DEFAULTOPTOPT Set optopt to this value by default on each
|
||||
* call to getopt()
|
||||
* ULTRAGETOPT_HYPHENARG Accept -option -arg as -option with argument
|
||||
* "-arg" rather than -option missing argument
|
||||
* Note: A single "-" is always accepted as an
|
||||
* argument
|
||||
* ULTRAGETOPT_LONGOPTADJACENT Accept adjacent arguments to long options
|
||||
* (e.g. --optionarg) based on first longest-match
|
||||
* ULTRAGETOPT_OPTIONPERMUTE Permute options, do not stop at first non-option
|
||||
* Behaves like GNU getopt where leading '+' or
|
||||
* $POSIXLY_CORRECT both stop this @ runtime
|
||||
* ULTRAGETOPT_SHORTOPTASSIGN Support -o=file syntax for short options
|
||||
* ULTRAGETOPT_SEPARATEDOPTIONAL Accept separated optional arguments
|
||||
* Parse -o file as -o with argument file
|
||||
* ULTRAGETOPT_DOS_DASH Support - and -- options in ultragetopt*_dos()
|
||||
* ULTRAGETOPT_BSD_ERRORS Print error messages matching BSD getopt
|
||||
* ULTRAGETOPT_DARWIN_ERRORS Print error messages matching Darwin getopt
|
||||
* ULTRAGETOPT_GNU_ERRORS Print error messages matching GNU getopt
|
||||
* ULTRAGETOPT_NO_EATDASHDASH Do not increment optind when argv[optind] is --
|
||||
* ULTRAGETOPT_NO_OPTIONALARG Do not support GNU "::" optional argument
|
||||
* Always supported in *_long*()
|
||||
* ULTRAGETOPT_NO_OPTIONASSIGN Do not support --option=value syntax
|
||||
*/
|
||||
|
||||
#ifdef ULTRAGETOPT_LIKE_POSIX
|
||||
# define ULTRAGETOPT_NO_OPTIONALARG
|
||||
# define ULTRAGETOPT_NO_OPTIONASSIGN
|
||||
# undef ULTRAGETOPT_NO_EATDASHDASH
|
||||
# undef ULTRAGETOPT_ASSIGNSPACE
|
||||
# undef ULTRAGETOPT_BSD_ERRORS
|
||||
# undef ULTRAGETOPT_DARWIN_ERRORS
|
||||
# undef ULTRAGETOPT_GNU_ERRORS
|
||||
# undef ULTRAGETOPT_OPTIONPERMUTE
|
||||
# undef ULTRAGETOPT_SHORTOPTASSIGN
|
||||
#elif defined(ULTRAGETOPT_LIKE_GNU)
|
||||
# define ULTRAGETOPT_GNU_ERRORS
|
||||
# define ULTRAGETOPT_HYPHENARG
|
||||
# define ULTRAGETOPT_OPTIONPERMUTE
|
||||
# undef ULTRAGETOPT_ASSIGNSPACE
|
||||
# undef ULTRAGETOPT_NO_OPTIONALARG
|
||||
# undef ULTRAGETOPT_NO_OPTIONASSIGN
|
||||
# undef ULTRAGETOPT_NO_EATDASHDASH
|
||||
# undef ULTRAGETOPT_SHORTOPTASSIGN
|
||||
# undef ULTRAGETOPT_SEPARATEOPTIONAL
|
||||
# undef ULTRAGETOPT_LONGOPTADJACENT
|
||||
#elif defined(ULTRAGETOPT_LIKE_BSD)
|
||||
# define ULTRAGETOPT_BSD_ERRORS
|
||||
# define ULTRAGETOPT_OPTIONPERMUTE
|
||||
# define ULTRAGETOPT_DEFAULTOPTOPT '?'
|
||||
# undef ULTRAGETOPT_ASSIGNSPACE
|
||||
# undef ULTRAGETOPT_NO_OPTIONALARG
|
||||
# undef ULTRAGETOPT_NO_OPTIONASSIGN
|
||||
# undef ULTRAGETOPT_NO_EATDASHDASH
|
||||
# undef ULTRAGETOPT_SHORTOPTASSIGN
|
||||
# undef ULTRAGETOPT_SEPARATEOPTIONAL
|
||||
# undef ULTRAGETOPT_LONGOPTADJACENT
|
||||
#elif defined(ULTRAGETOPT_LIKE_DARWIN)
|
||||
# define ULTRAGETOPT_DARWIN_ERRORS
|
||||
# define ULTRAGETOPT_OPTIONPERMUTE
|
||||
# undef ULTRAGETOPT_ASSIGNSPACE
|
||||
# undef ULTRAGETOPT_NO_OPTIONALARG
|
||||
# undef ULTRAGETOPT_NO_OPTIONASSIGN
|
||||
# undef ULTRAGETOPT_SHORTOPTASSIGN
|
||||
# undef ULTRAGETOPT_NO_EATDASHDASH
|
||||
# undef ULTRAGETOPT_SEPARATEOPTIONAL
|
||||
# undef ULTRAGETOPT_LONGOPTADJACENT
|
||||
#endif
|
||||
|
||||
#ifdef ULTRAGETOPT_NO_OPTIONASSIGN
|
||||
static const char *const unixassigners = "";
|
||||
static const char *const dosassigners = ":";
|
||||
#elif defined(ULTRAGETOPT_OPTIONSPACE)
|
||||
static const char *const unixassigners = "= ";
|
||||
static const char *const dosassigners = ":= ";
|
||||
#else
|
||||
static const char *const unixassigners = "=";
|
||||
static const char *const dosassigners = ":=";
|
||||
#endif
|
||||
|
||||
#ifdef ULTRAGETOPT_DOS_DASH
|
||||
static const char *const unixleaders = "-";
|
||||
static const char *const dosleaders = "/-";
|
||||
#else
|
||||
static const char *const unixleaders = "-";
|
||||
static const char *const dosleaders = "/";
|
||||
#endif
|
||||
|
||||
/* Flags for all variants of ultragetopt*() */
|
||||
static const int getoptflags = 0
|
||||
#ifdef ULTRAGETOPT_SEPARATEDOPTIONAL
|
||||
| UGO_SEPARATEDOPTIONAL
|
||||
#endif
|
||||
#ifdef ULTRAGETOPT_SHORTOPTASSIGN
|
||||
| UGO_SHORTOPTASSIGN
|
||||
#endif
|
||||
#ifdef ULTRAGETOPT_NO_EATDASHDASH
|
||||
| UGO_NOEATDASHDASH
|
||||
#endif
|
||||
#ifdef ULTRAGETOPT_HYPHENARG
|
||||
| UGO_HYPHENARG
|
||||
#endif
|
||||
;
|
||||
|
||||
#ifdef ULTRAGETOPT_GNU_ERRORS
|
||||
static const char *const errorarg =
|
||||
"%s: option `%.*s' doesn't allow an argument\n";
|
||||
static const char *const errornoarg =
|
||||
"%s: option `%.*s' requires an argument \n";
|
||||
static const char *const erroropt =
|
||||
"%s: unrecognized option `%.*s'\n";
|
||||
static const char *const errorargc =
|
||||
"%s: option `-%c' does not take an argument\n";
|
||||
static const char *const errornoargc =
|
||||
"%s: option requires an argument -- `-%c'\n";
|
||||
static const char *const erroroptc =
|
||||
"%s: invalid option -- %c\n";
|
||||
#elif defined(ULTRAGETOPT_BSD_ERRORS)
|
||||
static const char *const errorarg =
|
||||
"%s: option doesn't take an argument -- %.*s\n";
|
||||
static const char *const errornoarg =
|
||||
"%s: option requires an argument -- %.*s\n";
|
||||
static const char *const erroropt =
|
||||
"%s: unknown option -- %.*s\n";
|
||||
static const char *const errorargc =
|
||||
"%s: option doesn't take an argument -- %c\n";
|
||||
static const char *const errornoargc =
|
||||
"%s: option requires an argument -- %c\n";
|
||||
static const char *const erroroptc =
|
||||
"%s: unknown option -- %c\n";
|
||||
#elif defined(ULTRAGETOPT_DARWIN_ERRORS)
|
||||
static const char *const errorarg =
|
||||
"%s: option `%.*s' doesn't allow an argument\n"; /* with -- */
|
||||
static const char *const errornoarg =
|
||||
"%s: option `%.*s' requires an argument\n";
|
||||
static const char *const erroropt =
|
||||
"%s: unrecognized option `%.*s'\n"; /* with -- */
|
||||
static const char *const errorargc =
|
||||
"%s: option doesn't take an argument -- %c\n";
|
||||
static const char *const errornoargc =
|
||||
"%s: option requires an argument -- %c\n";
|
||||
static const char *const erroroptc =
|
||||
"%s: invalid option -- %c\n";
|
||||
#else /* POSIX-like */
|
||||
static const char *const errorarg =
|
||||
"%s: option does not take an argument -- %.*s\n";
|
||||
static const char *const errornoarg =
|
||||
"%s: option requires an argument -- %.*s\n";
|
||||
static const char *const erroropt =
|
||||
"%s: illegal option -- %.*s\n";
|
||||
static const char *const errorargc =
|
||||
"%s: option does not take an argument -- %c\n";
|
||||
static const char *const errornoargc =
|
||||
"%s: option requires an argument -- %c\n";
|
||||
static const char *const erroroptc =
|
||||
"%s: illegal option -- %c\n";
|
||||
#endif
|
||||
|
||||
/* Globals to match optarg, optind, opterr, optopt, optreset */
|
||||
char *ultraoptarg = NULL;
|
||||
int ultraoptind = 1;
|
||||
int ultraopterr = 1;
|
||||
int ultraoptreset = 0;
|
||||
#ifdef ULTRAGETOPT_DEFAULTOPTOPT
|
||||
int ultraoptopt = ULTRAGETOPT_DEFAULTOPTOPT -0;
|
||||
#else
|
||||
int ultraoptopt = 0;
|
||||
#endif
|
||||
|
||||
static int ultraoptnum = 0; /* How many options of the current multi-option
|
||||
argument have been processed? (e.g. -vvv) */
|
||||
|
||||
/* Add format error checking for gcc versions that support it */
|
||||
#if defined(__GNUC__) && __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR > 6)
|
||||
static void print_error(int flags, const char *template, ...)
|
||||
__attribute__ ((format (printf, 2, 3)));
|
||||
#endif
|
||||
|
||||
/* Print errors only if not suppressed */
|
||||
static void print_error(int flags, const char *template, ...)
|
||||
{
|
||||
va_list ap;
|
||||
|
||||
va_start(ap, template);
|
||||
if (ultraopterr != 0 && !(flags & UGO_NOPRINTERR))
|
||||
vfprintf(stderr, template, ap);
|
||||
va_end(ap);
|
||||
}
|
||||
|
||||
/* Check if an argument string looks like an option string */
|
||||
static inline int like_option(const char *arg, const char *optleaders)
|
||||
{
|
||||
return arg != NULL &&
|
||||
arg[0] != '\0' && /* >= 2 characters long */
|
||||
arg[1] != '\0' &&
|
||||
strchr(optleaders, arg[0]) && /* Starts with optleader */
|
||||
(arg[2] != '\0' || arg[0] != arg[1]); /* Not -- */
|
||||
}
|
||||
|
||||
/* Check if an argument string looks like the option terminator string */
|
||||
static inline int like_optterm(const char *arg, const char *optleaders)
|
||||
{
|
||||
return arg != NULL &&
|
||||
arg[0] != '\0' &&
|
||||
arg[1] != '\0' &&
|
||||
arg[2] == '\0' &&
|
||||
arg[0] == arg[1] &&
|
||||
strchr(optleaders, arg[0]);
|
||||
}
|
||||
|
||||
/* Check if an argument string looks like an option argument string */
|
||||
static inline int like_optarg(const char *arg, const char *optleaders,
|
||||
int allow_option)
|
||||
{
|
||||
return arg != NULL &&
|
||||
(allow_option ||
|
||||
(!like_option(arg, optleaders) && !like_optterm(arg, optleaders)));
|
||||
}
|
||||
|
||||
/* If argv[curopt] matches a long option, return the index of that option
|
||||
* Otherwise, return -1
|
||||
* If it has an adjacent argument, return pointer to it in longarg, else NULL
|
||||
*/
|
||||
static int match_longopt(int curopt, char *const argv[],
|
||||
const struct option *longopts, const char *assigners,
|
||||
const char *optleaders, int flags, char **longarg)
|
||||
{
|
||||
size_t alen, optnamelen = 0;
|
||||
char *optname;
|
||||
char *temp;
|
||||
int i;
|
||||
int (*optncmp)(const char *s1, const char *s2, size_t n);
|
||||
|
||||
if (longarg == NULL)
|
||||
longarg = &temp;
|
||||
*longarg = NULL;
|
||||
|
||||
if (flags & UGO_CASEINSENSITIVE)
|
||||
optncmp = strncasecmp;
|
||||
else
|
||||
optncmp = strncmp;
|
||||
|
||||
if (longopts == NULL)
|
||||
return -1;
|
||||
|
||||
if (!like_option(argv[curopt], optleaders))
|
||||
return -1;
|
||||
|
||||
if (flags & UGO_SINGLELEADERONLY) {
|
||||
optname = argv[curopt]+1;
|
||||
} else if (!strchr(optleaders, argv[curopt][1])) {
|
||||
/* Possible short option */
|
||||
if (flags & UGO_SINGLELEADERLONG)
|
||||
optname = argv[curopt]+1;
|
||||
else
|
||||
return -1;
|
||||
} else {
|
||||
optname = argv[curopt]+2;
|
||||
}
|
||||
|
||||
/* Do first longest-match search if requested */
|
||||
if (flags & UGO_LONGOPTADJACENT) {
|
||||
size_t matchlen = 0;
|
||||
int matchind = -1;
|
||||
for (i=0; longopts[i].name != NULL; i++) {
|
||||
size_t longnamelen = strlen(longopts[i].name);
|
||||
if (longnamelen > matchlen
|
||||
&& optncmp(optname, longopts[i].name, longnamelen) == 0) {
|
||||
matchind = i;
|
||||
matchlen = longnamelen;
|
||||
}
|
||||
}
|
||||
|
||||
if (matchlen > 0) {
|
||||
/* See if our match has an adjacent argument */
|
||||
if (optname[matchlen] != '\0') {
|
||||
/* Strip assigner character if present */
|
||||
if (strchr(assigners, optname[matchlen]))
|
||||
*longarg = optname+matchlen+1;
|
||||
else
|
||||
*longarg = optname+matchlen;
|
||||
}
|
||||
|
||||
return matchind;
|
||||
}
|
||||
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* Check for assigner in the option */
|
||||
alen = strlen(assigners);
|
||||
for (i=0; (unsigned)i < alen; i++) {
|
||||
char *asn = strchr(optname, assigners[i]);
|
||||
if (asn != NULL) {
|
||||
optnamelen = asn - optname;
|
||||
*longarg = asn+1;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (optnamelen == 0)
|
||||
optnamelen = strlen(optname);
|
||||
|
||||
for (i=0; longopts[i].name != NULL; i++)
|
||||
if (optncmp(optname, longopts[i].name, optnamelen) == 0
|
||||
&& strlen(longopts[i].name) == optnamelen)
|
||||
return i;
|
||||
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* Check if an option has a separate argument (in the following argv[] index) */
|
||||
static int has_separate_argument(int curopt, int argc, char *const argv[],
|
||||
const char *shortopts,
|
||||
const struct option *longopts,
|
||||
const char *assigners, const char *optleaders,
|
||||
int flags)
|
||||
{
|
||||
int longind;
|
||||
char *longarg;
|
||||
|
||||
assert(curopt < argc && like_option(argv[curopt], optleaders));
|
||||
|
||||
/* Check if we have a long option */
|
||||
longind = match_longopt(ultraoptind, argv, longopts, assigners, optleaders,
|
||||
flags, &longarg);
|
||||
if (longind >= 0) {
|
||||
if (longopts[longind].has_arg == no_argument
|
||||
|| longarg != NULL
|
||||
|| (longopts[longind].has_arg == optional_argument
|
||||
&& !(flags & UGO_SEPARATEDOPTIONAL)))
|
||||
return 0;
|
||||
|
||||
return like_optarg(argv[curopt+1], optleaders,
|
||||
(flags & UGO_HYPHENARG) &&
|
||||
longopts[longind].has_arg == required_argument);
|
||||
} else if (!strchr(optleaders, argv[curopt][1])) {
|
||||
/* Short option */
|
||||
char *optpos;
|
||||
|
||||
optpos = strchr(shortopts, argv[curopt][1]);
|
||||
if ((flags & UGO_CASEINSENSITIVE) && optpos == NULL) {
|
||||
if (islower(argv[curopt][1]))
|
||||
optpos = strchr(shortopts, toupper(argv[curopt][1]));
|
||||
else
|
||||
optpos = strchr(shortopts, tolower(argv[curopt][1]));
|
||||
}
|
||||
|
||||
|
||||
return optpos != NULL /* Option found */
|
||||
&& optpos[1] == ':' /* Option takes argument */
|
||||
&& (optpos[2] != ':' || (flags & UGO_SEPARATEDOPTIONAL))
|
||||
&& argv[curopt][2] == '\0' /* Argument is not adjacent */
|
||||
&& like_optarg(argv[curopt+1], /* Is an argument */
|
||||
optleaders,
|
||||
(flags & UGO_HYPHENARG) && optpos[2] != ':');
|
||||
}
|
||||
|
||||
/* No match */
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Bring the next option, or terminator, up to ultraoptind if there is one
|
||||
* Returns number of words shifted forward
|
||||
*/
|
||||
static int permute_options(int argc, char *argv[], const char *shortopts,
|
||||
const struct option *longopts,
|
||||
const char *assigners, const char *optleaders,
|
||||
int flags)
|
||||
{
|
||||
int curopt = ultraoptind;
|
||||
|
||||
/* If we already have an option or no more possible, give up */
|
||||
if (curopt >= argc || like_option(argv[curopt], optleaders))
|
||||
return 0;
|
||||
|
||||
for ( ; curopt < argc && argv[curopt]; curopt++) {
|
||||
int shiftarg = 0;
|
||||
int i;
|
||||
|
||||
/* Permute options and the option terminator */
|
||||
if (like_option(argv[curopt], optleaders)) {
|
||||
/* Check if we need to shift argument too */
|
||||
shiftarg = has_separate_argument(curopt, argc, argv, shortopts,
|
||||
longopts, assigners, optleaders,
|
||||
flags);
|
||||
} else if (!like_optterm(argv[curopt], optleaders)) {
|
||||
continue;
|
||||
}
|
||||
|
||||
/* Shift option */
|
||||
for (i=curopt; i>ultraoptind; i--) {
|
||||
char *temp = argv[i];
|
||||
argv[i] = argv[i-1];
|
||||
argv[i-1] = temp;
|
||||
|
||||
if (shiftarg) {
|
||||
temp = argv[i+1];
|
||||
argv[i+1] = argv[i];
|
||||
argv[i] = temp;
|
||||
}
|
||||
}
|
||||
|
||||
/* All done */
|
||||
if (shiftarg)
|
||||
return 2;
|
||||
else
|
||||
return 1;
|
||||
}
|
||||
|
||||
/* Couldn't find an option, bummer */
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* Handle a longopts[longind] matches argv[ultraoptind] actions */
|
||||
static int handle_longopt(int longind, char *longarg, int noseparg,
|
||||
char *const argv[],
|
||||
const struct option *longopts, int *indexptr,
|
||||
const char *optleaders, int flags)
|
||||
{
|
||||
/* Handle assignment arguments */
|
||||
if (longarg && longopts[longind].has_arg == no_argument) {
|
||||
print_error(flags, errorarg, argv[0],
|
||||
longarg-argv[ultraoptind]-1, argv[ultraoptind]);
|
||||
/* TODO: What is a good value to put in ultraoptopt? */
|
||||
/* Looks like GNU getopt() uses val */
|
||||
ultraoptopt = longopts[longind].val;
|
||||
ultraoptind++;
|
||||
return '?';
|
||||
} else if (longarg) {
|
||||
ultraoptind++;
|
||||
ultraoptarg = longarg;
|
||||
|
||||
if (indexptr)
|
||||
*indexptr = longind;
|
||||
|
||||
if (longopts[longind].flag) {
|
||||
*(longopts[longind].flag) = longopts[longind].val;
|
||||
return 0;
|
||||
} else
|
||||
return longopts[longind].val;
|
||||
}
|
||||
|
||||
/* Handle missing required argument */
|
||||
if (longopts[longind].has_arg == required_argument
|
||||
&& (noseparg
|
||||
|| !like_optarg(argv[ultraoptind+1],
|
||||
optleaders,
|
||||
flags & UGO_HYPHENARG))) {
|
||||
print_error(flags, errornoarg, argv[0],
|
||||
strlen(argv[ultraoptind]), argv[ultraoptind]);
|
||||
ultraoptind++;
|
||||
if (flags & UGO_MISSINGCOLON)
|
||||
return ':';
|
||||
else
|
||||
return '?';
|
||||
}
|
||||
|
||||
/* Handle available argument */
|
||||
if ((longopts[longind].has_arg == required_argument
|
||||
|| (longopts[longind].has_arg == optional_argument
|
||||
&& (flags & UGO_SEPARATEDOPTIONAL)))
|
||||
&& !noseparg
|
||||
&& like_optarg(argv[ultraoptind+1],
|
||||
optleaders,
|
||||
(flags & UGO_HYPHENARG) &&
|
||||
longopts[longind].has_arg == required_argument)) {
|
||||
ultraoptarg = argv[ultraoptind+1];
|
||||
ultraoptind += 2;
|
||||
} else
|
||||
ultraoptind++;
|
||||
|
||||
if (indexptr)
|
||||
*indexptr = longind;
|
||||
|
||||
if (longopts[longind].flag) {
|
||||
*(longopts[longind].flag) = longopts[longind].val;
|
||||
return 0;
|
||||
} else
|
||||
return longopts[longind].val;
|
||||
}
|
||||
|
||||
int ultragetopt_tunable(int argc, char *const argv[], const char *shortopts,
|
||||
const struct option *longopts, int *indexptr,
|
||||
const char *assigners, const char *optleaders,
|
||||
int flags)
|
||||
{
|
||||
char *opt; /* Option we are processing */
|
||||
char *optpos; /* Pointer to opt in shortopts */
|
||||
int noseparg = 0; /* Force option not to have a separate argument */
|
||||
|
||||
if (ultraoptreset) {
|
||||
ultraoptind = 1;
|
||||
ultraopterr = 1;
|
||||
ultraoptnum = 0;
|
||||
ultraoptreset = 0;
|
||||
}
|
||||
|
||||
ultraoptarg = NULL;
|
||||
#ifdef ULTRAGETOPT_DEFAULTOPTOPT
|
||||
ultraoptopt = ULTRAGETOPT_DEFAULTOPTOPT -0;
|
||||
#endif
|
||||
|
||||
/* Sanity check (These are specified verbatim in SUS) */
|
||||
if (ultraoptind > argc
|
||||
|| argv[ultraoptind] == NULL)
|
||||
return -1;
|
||||
|
||||
/* No permuting when $POSIXLY_CORRECT is set (to match GNU getopt) */
|
||||
if (getenv("POSIXLY_CORRECT"))
|
||||
flags &= ~UGO_OPTIONPERMUTE;
|
||||
|
||||
/* Get flags from shortopts */
|
||||
for ( ; shortopts && *shortopts; shortopts++) {
|
||||
if (*shortopts == '+')
|
||||
flags &= ~UGO_OPTIONPERMUTE;
|
||||
else if (*shortopts == '-')
|
||||
flags |= UGO_NONOPTARG;
|
||||
else if (*shortopts == ':') {
|
||||
flags |= UGO_NOPRINTERR;
|
||||
flags |= UGO_MISSINGCOLON;
|
||||
} else
|
||||
break;
|
||||
}
|
||||
|
||||
/* Found non-option */
|
||||
if (!like_option(argv[ultraoptind], optleaders)) {
|
||||
int shifted;
|
||||
|
||||
if (like_optterm(argv[ultraoptind], optleaders)) {
|
||||
if (!(flags & UGO_NOEATDASHDASH))
|
||||
ultraoptind++;
|
||||
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (flags & UGO_NONOPTARG) {
|
||||
ultraoptarg = argv[ultraoptind];
|
||||
ultraoptind++;
|
||||
return 1;
|
||||
}
|
||||
|
||||
if (!(flags & UGO_OPTIONPERMUTE))
|
||||
return -1;
|
||||
|
||||
shifted = permute_options(argc, (char **)argv, shortopts, longopts,
|
||||
assigners, optleaders, flags);
|
||||
if (shifted == 0)
|
||||
return -1;
|
||||
else if (shifted == 1)
|
||||
noseparg = 1;
|
||||
|
||||
if (like_optterm(argv[ultraoptind], optleaders)) {
|
||||
if (!(flags & UGO_NOEATDASHDASH))
|
||||
ultraoptind++;
|
||||
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
/* At this point we must have an option of some sort */
|
||||
assert(like_option(argv[ultraoptind], optleaders));
|
||||
|
||||
/* Handle --* */
|
||||
if (argv[ultraoptind][0] == argv[ultraoptind][1]) {
|
||||
int longind;
|
||||
char *longarg;
|
||||
|
||||
/* Handle long option */
|
||||
longind = match_longopt(ultraoptind, argv, longopts, assigners,
|
||||
optleaders, flags, &longarg);
|
||||
if (longind < 0) {
|
||||
if (longarg == NULL)
|
||||
print_error(flags, erroropt, argv[0],
|
||||
strlen(argv[ultraoptind]), argv[ultraoptind]);
|
||||
else
|
||||
print_error(flags, erroropt, argv[0],
|
||||
longarg - argv[ultraoptind] - 1, argv[ultraoptind]);
|
||||
|
||||
/* TODO: What is a good value for optopt in this case? */
|
||||
/* Looks like BSD uses 0 */
|
||||
ultraoptopt = 0;
|
||||
ultraoptind++;
|
||||
return '?';
|
||||
}
|
||||
|
||||
return handle_longopt(longind, longarg, noseparg, argv,
|
||||
longopts, indexptr, optleaders, flags);
|
||||
}
|
||||
|
||||
/* See if it matches a long-only option */
|
||||
if (longopts != NULL &&
|
||||
ultraoptnum == 0 &&
|
||||
((flags & UGO_SINGLELEADERLONG) ||
|
||||
(flags & UGO_SINGLELEADERONLY))) {
|
||||
int longind;
|
||||
char *longarg;
|
||||
|
||||
longind = match_longopt(ultraoptind, argv, longopts, assigners,
|
||||
optleaders, flags, &longarg);
|
||||
|
||||
if (longind >= 0)
|
||||
return handle_longopt(longind, longarg, noseparg, argv,
|
||||
longopts, indexptr, optleaders, flags);
|
||||
}
|
||||
|
||||
/* No long matches, process short option */
|
||||
opt = argv[ultraoptind] + ultraoptnum + 1;
|
||||
optpos = strchr(shortopts, opt[0]);
|
||||
if (optpos == NULL && (flags & UGO_CASEINSENSITIVE)) {
|
||||
if (islower(opt[0]))
|
||||
optpos = strchr(shortopts, toupper(opt[0]));
|
||||
else
|
||||
optpos = strchr(shortopts, tolower(opt[0]));
|
||||
}
|
||||
|
||||
/* This could indicate ultraoptnum not being reset properly */
|
||||
assert(opt[0] != '\0');
|
||||
|
||||
/* Check for invalid or unrecognized option */
|
||||
if (optpos == NULL || opt[0] == ':') {
|
||||
print_error(flags, erroroptc, argv[0], opt[0]);
|
||||
|
||||
ultraoptopt = opt[0];
|
||||
if (opt[1] != '\0')
|
||||
ultraoptnum++;
|
||||
else {
|
||||
ultraoptnum = 0;
|
||||
ultraoptind++;
|
||||
}
|
||||
|
||||
return '?';
|
||||
}
|
||||
|
||||
/* Handle arguments */
|
||||
if (optpos[1] == ':') {
|
||||
ultraoptnum = 0;
|
||||
|
||||
/* Handle adjacent arguments -ofile.txt */
|
||||
if (opt[1] != '\0') {
|
||||
/* Skip over assignment character */
|
||||
if ((flags & UGO_SHORTOPTASSIGN) && strchr(assigners, opt[1]))
|
||||
ultraoptarg = opt + 2;
|
||||
else
|
||||
ultraoptarg = opt + 1;
|
||||
|
||||
ultraoptind++;
|
||||
return optpos[0];
|
||||
}
|
||||
|
||||
/* Handle optional argument not present */
|
||||
if ((flags & UGO_OPTIONALARG) /* accept optionals */
|
||||
&& optpos[2] == ':' /* opt takes optional */
|
||||
&& (argv[ultraoptind+1] == NULL /* optional doesn't exist */
|
||||
|| !(flags & UGO_SEPARATEDOPTIONAL) /* separated not accepted */
|
||||
|| like_option(argv[ultraoptind+1], optleaders))) {
|
||||
ultraoptind++;
|
||||
return optpos[0];
|
||||
}
|
||||
|
||||
/* Handle separated argument missing */
|
||||
if (ultraoptind+2 > argc
|
||||
|| noseparg
|
||||
|| !like_optarg(argv[ultraoptind+1],
|
||||
optleaders,
|
||||
(flags & UGO_HYPHENARG))) {
|
||||
ultraoptind++;
|
||||
print_error(flags, errornoargc, argv[0], opt[0]);
|
||||
|
||||
ultraoptopt = opt[0];
|
||||
if (flags & UGO_MISSINGCOLON)
|
||||
return ':';
|
||||
else
|
||||
return '?';
|
||||
}
|
||||
|
||||
ultraoptind += 2;
|
||||
ultraoptarg = argv[ultraoptind-1];
|
||||
return optpos[0];
|
||||
}
|
||||
|
||||
/* Handle argumentless option with assigned option */
|
||||
if ((flags & UGO_SHORTOPTASSIGN)
|
||||
&& opt[1] != '\0' && strchr(assigners, opt[1])) {
|
||||
print_error(flags, errorargc, argv[0], opt[0]);
|
||||
ultraoptnum = 0;
|
||||
ultraoptopt = opt[0];
|
||||
ultraoptind++;
|
||||
return '?';
|
||||
}
|
||||
|
||||
if (opt[1] != '\0') {
|
||||
ultraoptnum++;
|
||||
} else {
|
||||
ultraoptnum = 0;
|
||||
ultraoptind++;
|
||||
}
|
||||
|
||||
return optpos[0];
|
||||
}
|
||||
|
||||
/* POSIX-compliant getopt
|
||||
*
|
||||
* Handles optional argument '::' specifier as an extension for compatibility
|
||||
* with glibc
|
||||
*/
|
||||
int ultragetopt(int argc, char * const argv[], const char *optstring)
|
||||
{
|
||||
int flags = getoptflags;
|
||||
|
||||
#ifdef ULTRAGETOPT_OPTIONPERMUTE
|
||||
flags |= UGO_OPTIONPERMUTE;
|
||||
#endif
|
||||
|
||||
#ifndef ULTRAGETOPT_NO_OPTIONALARG
|
||||
flags |= UGO_OPTIONALARG;
|
||||
#endif
|
||||
|
||||
return ultragetopt_tunable(argc, argv, optstring, NULL, NULL,
|
||||
unixassigners, unixleaders, flags);
|
||||
}
|
||||
|
||||
/* GNU getopt_long workalike
|
||||
*
|
||||
* Argument reordering not yet implemented
|
||||
* Leading + and - under consideration (behavior violates POSIX...)
|
||||
*/
|
||||
int ultragetopt_long(int argc, char *const argv[], const char *shortopts,
|
||||
const struct option *longopts, int *indexptr)
|
||||
{
|
||||
return ultragetopt_tunable(argc, argv, shortopts, longopts, indexptr,
|
||||
unixassigners, unixleaders,
|
||||
getoptflags | UGO_OPTIONPERMUTE | UGO_OPTIONALARG);
|
||||
}
|
||||
|
||||
/* GNU getopt_long_only workalike */
|
||||
int ultragetopt_long_only(int argc, char *const argv[], const char *shortopts,
|
||||
const struct option *longopts, int *indexptr)
|
||||
{
|
||||
return ultragetopt_tunable(argc, argv, shortopts, longopts, indexptr,
|
||||
unixassigners, unixleaders,
|
||||
getoptflags | UGO_SINGLELEADERLONG
|
||||
| UGO_OPTIONPERMUTE | UGO_OPTIONALARG);
|
||||
}
|
||||
|
||||
int ultragetopt_dos(int argc, char * const argv[], const char *optstring)
|
||||
{
|
||||
return ultragetopt_tunable(argc, argv, optstring, NULL, NULL,
|
||||
dosassigners, dosleaders,
|
||||
getoptflags | UGO_CASEINSENSITIVE);
|
||||
}
|
||||
|
||||
int ultragetopt_long_dos(int argc, char *const argv[], const char *shortopts,
|
||||
const struct option *longopts, int *indexptr)
|
||||
{
|
||||
return ultragetopt_tunable(argc, argv, shortopts, longopts, indexptr,
|
||||
dosassigners, dosleaders,
|
||||
getoptflags | UGO_CASEINSENSITIVE
|
||||
| UGO_SINGLELEADERLONG | UGO_SINGLELEADERONLY
|
||||
| UGO_OPTIONPERMUTE | UGO_OPTIONALARG);
|
||||
}
|
||||
|
||||
/* vim:set sts=4 sw=4: */
|
||||
@@ -1,105 +0,0 @@
|
||||
|
||||
/* define ULTRAGETOPT_REPLACE_GETOPT for ultragetopt*() to replace getopt*() */
|
||||
/* define ULTRAGETOPT_ONLY_DOS for ultragetopt*_dos() to replace ultragetopt*() */
|
||||
|
||||
#ifndef INCLUDED_GETOPT_H
|
||||
#define INCLUDED_GETOPT_H 1
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#define ULTRAGETOPT_REPLACE_GETOPT
|
||||
#define ULTRAGETOPT_LIKE_GNU
|
||||
#define ULTRAGETOPT_LINKAGE extern
|
||||
|
||||
/* Flag values to pass to getopt_tunable() */
|
||||
#define UGO_CASEINSENSITIVE 0x1
|
||||
#define UGO_SINGLELEADERLONG 0x2
|
||||
#define UGO_OPTIONPERMUTE 0x4
|
||||
#define UGO_NONOPTARG 0x8
|
||||
#define UGO_NOPRINTERR 0x10
|
||||
#define UGO_OPTIONALARG 0x20
|
||||
#define UGO_MISSINGCOLON 0x40
|
||||
#define UGO_SEPARATEDOPTIONAL 0x80
|
||||
#define UGO_SHORTOPTASSIGN 0x100
|
||||
#define UGO_NOEATDASHDASH 0x200
|
||||
#define UGO_LONGOPTADJACENT 0x400
|
||||
#define UGO_HYPHENARG 0x800
|
||||
#define UGO_SINGLELEADERONLY 0x1000
|
||||
|
||||
#ifndef required_argument
|
||||
# define no_argument 0
|
||||
# define required_argument 1
|
||||
# define optional_argument 2
|
||||
|
||||
struct option {
|
||||
const char *name; /* Name of the option */
|
||||
int has_arg; /* Does the option take an argument? */
|
||||
int *flag; /* Location to store val when option encountered */
|
||||
int val; /* Value to return (or store in flag) for option */
|
||||
};
|
||||
#endif /* required_argument */
|
||||
|
||||
ULTRAGETOPT_LINKAGE char *ultraoptarg;
|
||||
ULTRAGETOPT_LINKAGE int ultraoptind, ultraopterr, ultraoptopt, ultraoptreset;
|
||||
|
||||
ULTRAGETOPT_LINKAGE int ultragetopt(int argc, char *const argv[],
|
||||
const char *optstring);
|
||||
|
||||
ULTRAGETOPT_LINKAGE int ultragetopt_long(int argc, char *const argv[],
|
||||
const char *shortopts, const struct option *longopts, int *indexptr);
|
||||
|
||||
ULTRAGETOPT_LINKAGE int ultragetopt_long_only(int argc, char *const argv[],
|
||||
const char *shortopts, const struct option *longopts, int *indexptr);
|
||||
|
||||
ULTRAGETOPT_LINKAGE int ultragetopt_dos(int argc, char * const argv[],
|
||||
const char *optstring);
|
||||
|
||||
ULTRAGETOPT_LINKAGE int ultragetopt_long_dos(int argc, char *const argv[],
|
||||
const char *shortopts, const struct option *longopts, int *indexptr);
|
||||
|
||||
/* Getopt with modifiable (tunable) behavior - also the backend for all other
|
||||
* getopt functions.
|
||||
* assigners - string of characters accepted to assign to an option
|
||||
* (e.g. --outfile=file.txt where '=' is the assigner)
|
||||
* optleaders - string of characters that indicate an option
|
||||
* (usually "-" on UNIX, "/" on DOS)
|
||||
* flags - see README for list of accepted flags
|
||||
*/
|
||||
ULTRAGETOPT_LINKAGE int ultragetopt_tunable(int argc, char *const argv[],
|
||||
const char *shortopts, const struct option *longopts, int *indexptr,
|
||||
const char *assigners, const char *optleaders, int flags);
|
||||
|
||||
#ifdef ULTRAGETOPT_REPLACE_GETOPT
|
||||
# define optarg ultraoptarg
|
||||
# define optind ultraoptind
|
||||
# define opterr ultraopterr
|
||||
# define optopt ultraoptopt
|
||||
# define optreset ultraoptreset
|
||||
# define getopt(argc, argv, optstring) \
|
||||
ultragetopt(argc, argv, optstring)
|
||||
# define getopt_long(argc, argv, shortopts, longopts, indexptr) \
|
||||
ultragetopt_long(argc, argv, shortopts, longopts, indexptr)
|
||||
# define getopt_long_only(argc, argv, shortopts, longopts, indexptr) \
|
||||
ultragetopt_long_only(argc, argv, shortopts, longopts, indexptr)
|
||||
# define getopt_dos(argc, argv, optstring) \
|
||||
ultragetopt_dos(argc, argv, optstring)
|
||||
# define getopt_long_dos(argc, argv, shortopts, longopts, indexptr) \
|
||||
ultragetopt_long_dos(argc, argv, shortopts, longopts, indexptr)
|
||||
#endif /* GETOPT_NO_EXTENSIONS */
|
||||
|
||||
#ifdef ULTRAGETOPT_DOS_ONLY
|
||||
# define ultragetopt(argc, argv, optstring) \
|
||||
ultragetopt_dos(argc, argv, optstring)
|
||||
# define ultragetopt_long(argc, argv, shortopts, longopts, indexptr) \
|
||||
ultragetopt_long_dos(argc, argv, shortopts, longopts, indexptr)
|
||||
# define ultragetopt_long_only(argc, argv, shortopts, longopts, indexptr) \
|
||||
ultragetopt_long_dos(argc, argv, shortopts, longopts, indexptr)
|
||||
#endif /* ULTRAGETOPT_DOS_ONLY */
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* INCLUDED_GETOPT_H */
|
||||
@@ -1,14 +1,24 @@
|
||||
add_executable(tmx2gba
|
||||
tmx2gba.cpp
|
||||
tmxlayer.hpp
|
||||
tmxobject.hpp
|
||||
argparse.hpp argparse.cpp
|
||||
tmxreader.hpp tmxreader.cpp
|
||||
tmxtileset.hpp)
|
||||
target_link_libraries(tmx2gba
|
||||
External::base64
|
||||
External::miniz
|
||||
External::rapidxml
|
||||
External::ultragetopt)
|
||||
convert.hpp convert.cpp
|
||||
headerwriter.hpp headerwriter.cpp
|
||||
swriter.hpp swriter.cpp
|
||||
tmx2gba.cpp)
|
||||
|
||||
configure_file(config.h.in config.h @ONLY)
|
||||
target_sources(tmx2gba PRIVATE ${CMAKE_CURRENT_BINARY_DIR}/config.h)
|
||||
target_include_directories(tmx2gba PRIVATE ${CMAKE_CURRENT_BINARY_DIR})
|
||||
|
||||
set_target_properties(tmx2gba PROPERTIES CXX_STANDARD 20)
|
||||
|
||||
# Enable strong warnings
|
||||
target_compile_options(tmx2gba PRIVATE
|
||||
$<$<CXX_COMPILER_ID:MSVC>:/Wall>
|
||||
$<$<CXX_COMPILER_ID:GNU,Clang,AppleClang>:-Wall -Wextra -pedantic>
|
||||
$<$<CXX_COMPILER_ID:Clang,AppleClang>:-Weverything -Wno-c++98-compat -Wno-c++98-compat-pedantic -Wno-padded>)
|
||||
|
||||
target_link_libraries(tmx2gba tmxlite)
|
||||
|
||||
if (TMX2GBA_DKP_INSTALL)
|
||||
if (DEFINED ENV{DEVKITPRO})
|
||||
|
||||
216
src/argparse.cpp
Normal file
216
src/argparse.cpp
Normal file
@@ -0,0 +1,216 @@
|
||||
/* argparse.cpp - Copyright (C) 2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#include "argparse.hpp"
|
||||
#include <optional>
|
||||
#include <cstring>
|
||||
#include <filesystem>
|
||||
#include <iomanip>
|
||||
#include <iostream>
|
||||
|
||||
|
||||
ArgParse::ArgParser::ArgParser(
|
||||
const std::string_view argv0,
|
||||
Options options,
|
||||
HandleOption&& handler
|
||||
) noexcept :
|
||||
name(std::filesystem::path(argv0).filename().string()),
|
||||
options(options),
|
||||
handler(std::forward<HandleOption>(handler)) {}
|
||||
|
||||
|
||||
void ArgParse::Options::ShowShortUsage(const std::string_view name, std::ostream& out) const
|
||||
{
|
||||
out << "Usage: " << name;
|
||||
for (const auto& it : options)
|
||||
{
|
||||
if (it.argumentName)
|
||||
{
|
||||
// Option with argument
|
||||
it.required
|
||||
? out << " <-" << it.flag << ' ' << it.argumentName << '>'
|
||||
: out << " [-" << it.flag << ' ' << it.argumentName << ']';
|
||||
}
|
||||
else
|
||||
{
|
||||
// Argument-less flag
|
||||
it.required
|
||||
? out << " <-" << it.flag << '>'
|
||||
: out << " [-" << it.flag << ']';
|
||||
}
|
||||
}
|
||||
out << std::endl;
|
||||
}
|
||||
|
||||
void ArgParse::Options::ShowHelpUsage(const std::string_view name, std::ostream& out) const
|
||||
{
|
||||
// Base usage
|
||||
out << "Usage: " << name << " [-";
|
||||
for (const auto& it : options)
|
||||
if (!it.required)
|
||||
out << it.flag;
|
||||
out << "] <-";
|
||||
for (const auto& it : options)
|
||||
if (it.required)
|
||||
out << it.flag;
|
||||
out << ">" << std::endl;
|
||||
|
||||
// Determine the alignment width from the longest argument
|
||||
auto paramLength = [](const Option& p) -> int { return p.argumentName
|
||||
? static_cast<int>(std::strlen(p.argumentName) + 3)
|
||||
: 1; };
|
||||
auto longestParam = std::max_element(options.begin(), options.end(),
|
||||
[=](auto a, auto b) -> bool { return paramLength(a) < paramLength(b); });
|
||||
auto alignWidth = paramLength(*longestParam) + 3;
|
||||
|
||||
// print argument descriptions
|
||||
for (const auto& it : options)
|
||||
{
|
||||
auto decorateArgument = [=] { return " <" + std::string(it.argumentName) + "> "; };
|
||||
out << " -" << it.flag
|
||||
<< std::left << std::setw(alignWidth) << std::setfill('-') << (it.argumentName ? decorateArgument() : " ")
|
||||
<< " " << it.helpString << std::endl;
|
||||
}
|
||||
out << std::flush;
|
||||
}
|
||||
|
||||
|
||||
ArgParse::ParseCtrl ArgParse::ParserState::Next(const std::string_view token)
|
||||
{
|
||||
auto getFlag = [](const std::string_view s) { return s[0] == '-' && s[1] ? std::optional<int>(s[1]) : std::nullopt; };
|
||||
auto getOption = [&](int flag) -> std::optional<std::reference_wrapper<const Option>>
|
||||
{
|
||||
for (auto& opt : options.options)
|
||||
if (opt.flag == flag)
|
||||
return std::optional(std::cref(opt));
|
||||
return {};
|
||||
};
|
||||
|
||||
if (expectArg)
|
||||
{
|
||||
expectArg = false;
|
||||
return handler(flagChar, token);
|
||||
}
|
||||
else
|
||||
{
|
||||
auto flag = getFlag(token);
|
||||
if (flag.has_value())
|
||||
{
|
||||
flagChar = flag.value();
|
||||
const auto opt = getOption(flagChar);
|
||||
if (opt.has_value())
|
||||
{
|
||||
bool expect = opt.value().get().argumentName != nullptr;
|
||||
if (token.length() <= 2)
|
||||
{
|
||||
expectArg = expect;
|
||||
if (!expectArg)
|
||||
return handler(flagChar, "");
|
||||
}
|
||||
else
|
||||
{
|
||||
return handler(flagChar, expect ? token.substr(2) : "");
|
||||
}
|
||||
}
|
||||
}
|
||||
else if (!token.empty())
|
||||
{
|
||||
return ParseCtrl::QUIT_ERR_UNEXPECTED;
|
||||
}
|
||||
}
|
||||
|
||||
return ParseCtrl::CONTINUE;
|
||||
}
|
||||
|
||||
|
||||
void ArgParse::ArgParser::DisplayError(const std::string_view message, bool helpPrompt) const
|
||||
{
|
||||
std::cerr << GetName() << ": " << message << std::endl;
|
||||
options.ShowShortUsage(GetName(), std::cerr);
|
||||
if (helpPrompt)
|
||||
std::cerr << "Run '" << GetName() << " -h' to view all available options." << std::endl;
|
||||
}
|
||||
|
||||
bool ArgParse::ArgParser::CheckParse(ArgParse::ParseErr err) const
|
||||
{
|
||||
switch (err)
|
||||
{
|
||||
case ParseErr::OK:
|
||||
return true;
|
||||
case ParseErr::OPT_UNKNOWN:
|
||||
DisplayError("Unrecognised option.");
|
||||
return false;
|
||||
case ParseErr::UNEXPECTED:
|
||||
DisplayError("Unexpected token.");
|
||||
return false;
|
||||
case ParseErr::ARG_EXPECTED:
|
||||
DisplayError("Requires an argument.");
|
||||
return false;
|
||||
case ParseErr::ARG_INVALID:
|
||||
DisplayError("Invalid argument.", false);
|
||||
return false;
|
||||
case ParseErr::ARG_RANGE:
|
||||
DisplayError("Argument out of range.", false);
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
bool ArgParse::ReadParamFile(std::vector<std::string>& tokens, std::istream& file)
|
||||
{
|
||||
bool inQuote = false;
|
||||
std::string quoteStr;
|
||||
const auto store = [&](const std::string_view token, bool quote)
|
||||
{
|
||||
if (quote)
|
||||
quoteStr = token;
|
||||
else
|
||||
tokens.emplace_back(token);
|
||||
};
|
||||
|
||||
while (!file.eof())
|
||||
{
|
||||
if (!inQuote)
|
||||
{
|
||||
std::string token;
|
||||
file >> token;
|
||||
if (!token.empty())
|
||||
{
|
||||
std::string::size_type beg = 0, end;
|
||||
while ((end = token.find_first_of('"', beg)) != std::string::npos)
|
||||
{
|
||||
auto size = end - beg;
|
||||
if (size > 0)
|
||||
store(token.substr(beg, size), !inQuote);
|
||||
inQuote = !inQuote;
|
||||
beg = end + 1;
|
||||
}
|
||||
if (beg > 0)
|
||||
{
|
||||
auto size = token.length() - beg;
|
||||
if (size > 0)
|
||||
token = token.substr(beg);
|
||||
else
|
||||
token.clear();
|
||||
}
|
||||
if (!token.empty())
|
||||
store(token, inQuote);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
const int c = file.get();
|
||||
if (c == '"')
|
||||
{
|
||||
tokens.emplace_back(quoteStr);
|
||||
quoteStr.clear();
|
||||
inQuote = false;
|
||||
}
|
||||
else
|
||||
{
|
||||
quoteStr.push_back(static_cast<char>(c));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return !inQuote;
|
||||
}
|
||||
132
src/argparse.hpp
Normal file
132
src/argparse.hpp
Normal file
@@ -0,0 +1,132 @@
|
||||
/* argparse.hpp - Copyright (C) 2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#ifndef ARGPARSE_HPP
|
||||
#define ARGPARSE_HPP
|
||||
|
||||
#include <initializer_list>
|
||||
#include <functional>
|
||||
#include <string>
|
||||
#include <ostream>
|
||||
#include <span>
|
||||
#include <ranges>
|
||||
#include <string_view>
|
||||
#include <vector>
|
||||
|
||||
namespace ArgParse
|
||||
{
|
||||
struct Option
|
||||
{
|
||||
const char* argumentName;
|
||||
const char* helpString;
|
||||
char flag;
|
||||
bool required;
|
||||
|
||||
static constexpr Option Optional(char flag, const char* name, const char* help)
|
||||
{
|
||||
return { name, help, flag, false };
|
||||
}
|
||||
static constexpr Option Required(char flag, const char* name, const char* help)
|
||||
{
|
||||
return { name, help, flag, false };
|
||||
}
|
||||
};
|
||||
|
||||
struct Options
|
||||
{
|
||||
const std::vector<Option> options;
|
||||
|
||||
inline Options(const std::initializer_list<Option>&& rhs) : options(rhs) {}
|
||||
|
||||
void ShowShortUsage(const std::string_view name, std::ostream& out) const;
|
||||
void ShowHelpUsage(const std::string_view name, std::ostream& out) const;
|
||||
};
|
||||
|
||||
enum class ParseCtrl
|
||||
{
|
||||
CONTINUE,
|
||||
QUIT_EARLY,
|
||||
QUIT_ERR_UNKNOWN,
|
||||
QUIT_ERR_UNEXPECTED,
|
||||
QUIT_ERR_EXPECTARG,
|
||||
QUIT_ERR_INVALID,
|
||||
QUIT_ERR_RANGE
|
||||
};
|
||||
|
||||
enum class ParseErr
|
||||
{
|
||||
OK,
|
||||
OPT_UNKNOWN,
|
||||
UNEXPECTED,
|
||||
ARG_EXPECTED,
|
||||
ARG_INVALID,
|
||||
ARG_RANGE
|
||||
};
|
||||
|
||||
using HandleOption = std::function<ParseCtrl(int, const std::string_view)>;
|
||||
|
||||
class ParserState
|
||||
{
|
||||
HandleOption handler;
|
||||
const Options& options;
|
||||
int flagChar;
|
||||
bool expectArg = false;
|
||||
|
||||
public:
|
||||
ParserState(HandleOption handler, const Options& options) noexcept
|
||||
: handler(handler), options(options) {}
|
||||
[[nodiscard]] bool ExpectingArg() const { return expectArg; }
|
||||
[[nodiscard]] ParseCtrl Next(const std::string_view token);
|
||||
};
|
||||
|
||||
class ArgParser
|
||||
{
|
||||
const std::string name;
|
||||
Options options;
|
||||
HandleOption handler;
|
||||
|
||||
[[nodiscard]] bool CheckParse(ArgParse::ParseErr err) const;
|
||||
|
||||
public:
|
||||
explicit ArgParser(const std::string_view argv0, Options options, HandleOption&& handler) noexcept;
|
||||
|
||||
[[nodiscard]] const std::string_view GetName() const noexcept { return name; }
|
||||
void DisplayError(const std::string_view message, bool helpPrompt = true) const;
|
||||
|
||||
template <typename V>
|
||||
[[nodiscard]] bool Parse(V args)
|
||||
{
|
||||
ParserState state(handler, options);
|
||||
for (auto arg : args)
|
||||
{
|
||||
ParseErr err = ParseErr::UNEXPECTED;
|
||||
switch (state.Next(arg))
|
||||
{
|
||||
case ParseCtrl::CONTINUE: continue;
|
||||
case ParseCtrl::QUIT_EARLY: err = ParseErr::OK; break;
|
||||
case ParseCtrl::QUIT_ERR_UNKNOWN: err = ParseErr::OPT_UNKNOWN; break;
|
||||
case ParseCtrl::QUIT_ERR_UNEXPECTED: err = ParseErr::UNEXPECTED; break;
|
||||
case ParseCtrl::QUIT_ERR_EXPECTARG: err = ParseErr::ARG_EXPECTED; break;
|
||||
case ParseCtrl::QUIT_ERR_INVALID: err = ParseErr::ARG_INVALID; break;
|
||||
case ParseCtrl::QUIT_ERR_RANGE: err = ParseErr::ARG_RANGE; break;
|
||||
}
|
||||
if (!CheckParse(err))
|
||||
return false;
|
||||
}
|
||||
return CheckParse(state.ExpectingArg() ? ParseErr::ARG_EXPECTED : ParseErr::OK);
|
||||
}
|
||||
|
||||
[[nodiscard]] inline bool Parse(std::initializer_list<std::string_view> args)
|
||||
{
|
||||
return Parse<std::initializer_list<std::string_view>>(args);
|
||||
}
|
||||
|
||||
[[nodiscard]] inline bool Parse(std::span<char*> args)
|
||||
{
|
||||
return Parse(args | std::views::transform([](char const* v){ return std::string_view(v); }));
|
||||
}
|
||||
};
|
||||
|
||||
[[nodiscard]] extern bool ReadParamFile(std::vector<std::string>& tokens, std::istream& file);
|
||||
}
|
||||
|
||||
#endif//ARGPARSE_HPP
|
||||
6
src/config.h.in
Normal file
6
src/config.h.in
Normal file
@@ -0,0 +1,6 @@
|
||||
#ifndef CONFIG_H
|
||||
#define CONFIG_H
|
||||
|
||||
#define TMX2GBA_VERSION "@PROJECT_VERSION@"
|
||||
|
||||
#endif//CONFIG_H
|
||||
67
src/convert.cpp
Normal file
67
src/convert.cpp
Normal file
@@ -0,0 +1,67 @@
|
||||
/* converter.hpp - Copyright (C) 2015-2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#include "convert.hpp"
|
||||
#include "tmxreader.hpp"
|
||||
|
||||
|
||||
bool convert::ConvertCharmap(std::vector<uint16_t>& out, int idxOffset, uint32_t defaultPal, const TmxReader& tmx)
|
||||
{
|
||||
const auto gfxTiles = tmx.GetGraphicsTiles();
|
||||
const auto palTiles = tmx.GetPaletteTiles();
|
||||
|
||||
const size_t numTiles = tmx.TileCount();
|
||||
out.reserve(numTiles);
|
||||
for (size_t i = 0; i < numTiles; ++i)
|
||||
{
|
||||
const TmxReader::Tile tile = gfxTiles[i];
|
||||
|
||||
int tileIdx = std::max(0, static_cast<int>(tmx.LidFromGid(tile.id)) + idxOffset);
|
||||
uint8_t flags = 0x0;
|
||||
|
||||
// Get flipped!
|
||||
flags |= (tile.flags & TmxReader::FLIP_HORZ) ? 0x4 : 0x0;
|
||||
flags |= (tile.flags & TmxReader::FLIP_VERT) ? 0x8 : 0x0;
|
||||
|
||||
// Determine palette ID
|
||||
uint32_t idx = 0;
|
||||
if (palTiles.has_value())
|
||||
idx = tmx.LidFromGid(palTiles.value()[i]);
|
||||
if (idx == 0)
|
||||
idx = defaultPal + 1;
|
||||
flags |= static_cast<uint8_t>(idx - 1) << 4;
|
||||
|
||||
out.push_back(static_cast<uint16_t>(tileIdx) | static_cast<uint16_t>(flags << 8));
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
bool convert::ConvertCollision(std::vector<uint8_t>& out, const TmxReader& tmx)
|
||||
{
|
||||
const auto clsTiles = tmx.GetCollisionTiles().value();
|
||||
|
||||
size_t numTiles = tmx.TileCount();
|
||||
out.reserve(numTiles);
|
||||
for (size_t i = 0; i < numTiles; ++i)
|
||||
{
|
||||
uint8_t id = static_cast<uint8_t>(tmx.LidFromGid(clsTiles[i]));
|
||||
out.emplace_back(id);
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
bool convert::ConvertObjects(std::vector<uint32_t>& out, const TmxReader& tmx)
|
||||
{
|
||||
const auto objects = tmx.GetObjects().value();
|
||||
|
||||
for (auto obj : objects)
|
||||
{
|
||||
out.push_back(obj.id);
|
||||
out.emplace_back(static_cast<int>(obj.x * 256.0f));
|
||||
out.emplace_back(static_cast<int>(obj.y * 256.0f));
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
20
src/convert.hpp
Normal file
20
src/convert.hpp
Normal file
@@ -0,0 +1,20 @@
|
||||
/* converter.hpp - Copyright (C) 2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#ifndef CONVERT_HPP
|
||||
#define CONVERT_HPP
|
||||
|
||||
#include <cstdint>
|
||||
#include <vector>
|
||||
|
||||
class TmxReader;
|
||||
|
||||
namespace convert
|
||||
{
|
||||
[[nodiscard]] bool ConvertCharmap(std::vector<uint16_t>& out,
|
||||
int idOffset, uint32_t defaultPalIdx,
|
||||
const TmxReader& tmx);
|
||||
[[nodiscard]] bool ConvertCollision(std::vector<uint8_t>& out, const TmxReader& tmx);
|
||||
[[nodiscard]] bool ConvertObjects(std::vector<uint32_t>& out, const TmxReader& tmx);
|
||||
};
|
||||
|
||||
#endif//CONVERT_HPP
|
||||
92
src/headerwriter.cpp
Normal file
92
src/headerwriter.cpp
Normal file
@@ -0,0 +1,92 @@
|
||||
/* headerwriter.cpp - Copyright (C) 2015-2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#include "headerwriter.hpp"
|
||||
#include <algorithm>
|
||||
|
||||
|
||||
template <typename T> static constexpr std::string_view DatType();
|
||||
template <> constexpr std::string_view DatType<uint8_t>() { return "unsigned char"; }
|
||||
template <> constexpr std::string_view DatType<uint16_t>() { return "unsigned short"; }
|
||||
template <> constexpr std::string_view DatType<uint32_t>() { return "unsigned int"; }
|
||||
|
||||
void HeaderWriter::WriteSize(unsigned width, unsigned height)
|
||||
{
|
||||
stream << std::endl;
|
||||
WriteDefine(mName + "Width", width);
|
||||
WriteDefine(mName + "Height", height);
|
||||
}
|
||||
|
||||
void HeaderWriter::WriteCharacterMap(const std::span<uint16_t> charData)
|
||||
{
|
||||
stream << std::endl;
|
||||
WriteDefine(mName + "TilesLen", charData.size() * 2);
|
||||
WriteSymbol(mName + "Tiles", DatType<uint16_t>(), charData.size());
|
||||
}
|
||||
|
||||
void HeaderWriter::WriteCollision(const std::span<uint8_t> collisionData)
|
||||
{
|
||||
stream << std::endl;
|
||||
WriteDefine(mName + "CollisionLen", collisionData.size());
|
||||
WriteSymbol(mName + "Collision", DatType<uint8_t>(), collisionData.size());
|
||||
}
|
||||
|
||||
void HeaderWriter::WriteObjects(const std::span<uint32_t> objData)
|
||||
{
|
||||
stream << std::endl;
|
||||
WriteDefine(mName + "ObjCount", objData.size() / 3);
|
||||
WriteDefine(mName + "ObjdatLen", objData.size() * sizeof(int));
|
||||
WriteSymbol(mName + "Objdat", DatType<uint32_t>(), objData.size());
|
||||
}
|
||||
|
||||
|
||||
static std::string GuardName(std::string label)
|
||||
{
|
||||
std::transform(label.begin(), label.end(), label.begin(), ::toupper);
|
||||
return "TMX2GBA_" + label;
|
||||
}
|
||||
|
||||
|
||||
void HeaderWriter::WriteGuardStart()
|
||||
{
|
||||
const std::string guard = GuardName(mName);
|
||||
stream << "#ifndef " << guard << std::endl;
|
||||
stream << "#define " << guard << std::endl;
|
||||
}
|
||||
|
||||
void HeaderWriter::WriteGuardEnd()
|
||||
{
|
||||
const std::string guard = GuardName(mName);
|
||||
stream << std::endl << "#endif//" << guard << std::endl;
|
||||
}
|
||||
|
||||
|
||||
HeaderWriter::~HeaderWriter()
|
||||
{
|
||||
if (stream.is_open())
|
||||
{
|
||||
WriteGuardEnd();
|
||||
stream.close();
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
bool HeaderWriter::Open(const std::filesystem::path& path, const std::string_view name)
|
||||
{
|
||||
mName = name;
|
||||
stream.open(path);
|
||||
if (!stream.is_open())
|
||||
return false;
|
||||
|
||||
WriteGuardStart();
|
||||
return true;
|
||||
}
|
||||
|
||||
void HeaderWriter::WriteDefine(const std::string_view name, const std::string_view value)
|
||||
{
|
||||
stream << "#define " << name << " " << value << std::endl;
|
||||
}
|
||||
|
||||
void HeaderWriter::WriteSymbol(const std::string_view name, const std::string_view type, std::size_t count)
|
||||
{
|
||||
stream << "extern const " << type << " " << name << "[" << count << "];" << std::endl;
|
||||
}
|
||||
46
src/headerwriter.hpp
Normal file
46
src/headerwriter.hpp
Normal file
@@ -0,0 +1,46 @@
|
||||
/* headerwriter.hpp - Copyright (C) 2015-2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#ifndef HEADERWRITER_HPP
|
||||
#define HEADERWRITER_HPP
|
||||
|
||||
#include <cstddef>
|
||||
#include <cstdint>
|
||||
#include <string>
|
||||
#include <string_view>
|
||||
#include <span>
|
||||
#include <concepts>
|
||||
#include <fstream>
|
||||
#include <filesystem>
|
||||
|
||||
template <typename T>
|
||||
concept NumericType = std::integral<T> || std::floating_point<T>;
|
||||
|
||||
class HeaderWriter
|
||||
{
|
||||
std::ofstream stream;
|
||||
std::string mName;
|
||||
|
||||
void WriteGuardStart();
|
||||
void WriteGuardEnd();
|
||||
|
||||
public:
|
||||
~HeaderWriter();
|
||||
|
||||
[[nodiscard]] bool Open(const std::filesystem::path& path, const std::string_view name);
|
||||
|
||||
void WriteDefine(const std::string_view name, const std::string_view value);
|
||||
void WriteSymbol(const std::string_view name, const std::string_view type, std::size_t count);
|
||||
|
||||
template <NumericType T>
|
||||
void WriteDefine(const std::string_view name, T value)
|
||||
{
|
||||
WriteDefine(name, std::to_string(value));
|
||||
}
|
||||
|
||||
void WriteSize(unsigned width, unsigned height);
|
||||
void WriteCharacterMap(const std::span<uint16_t> charData);
|
||||
void WriteCollision(const std::span<uint8_t> collisionData);
|
||||
void WriteObjects(const std::span<uint32_t> objData);
|
||||
};
|
||||
|
||||
#endif//HEADERWRITER_HPP
|
||||
159
src/swriter.cpp
Normal file
159
src/swriter.cpp
Normal file
@@ -0,0 +1,159 @@
|
||||
/* swwriter.cpp - Copyright (C) 2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#include "swriter.hpp"
|
||||
#include <type_traits>
|
||||
#include <limits>
|
||||
#include <assert.h>
|
||||
|
||||
#define GNU_STYLE 0
|
||||
#define MASM_STYLE 1
|
||||
|
||||
#define HEX_STYLE GNU_STYLE
|
||||
|
||||
|
||||
static inline constexpr char HexU(uint8_t h) { return "0123456789ABCDEF"[h >> 4]; }
|
||||
static inline constexpr char HexL(uint8_t l) { return "0123456789ABCDEF"[l & 15]; }
|
||||
|
||||
#if HEX_STYLE == GNU_STYLE
|
||||
template <typename T> static void CHex(std::ostream& s, T x);
|
||||
template <> void CHex(std::ostream& s, uint8_t x)
|
||||
{
|
||||
if (x > 9) s << "0x";
|
||||
if (x > 15) s << HexU(x);
|
||||
s << HexL(x);
|
||||
}
|
||||
template <> void CHex(std::ostream& s, uint16_t x)
|
||||
{
|
||||
if (x > 9) s << "0x";
|
||||
if (x > 4095) s << HexU(static_cast<uint8_t>(x >> 8));
|
||||
if (x > 255) s << HexL(static_cast<uint8_t>(x >> 8));
|
||||
if (x > 15) s << HexU(static_cast<uint8_t>(x));
|
||||
s << HexL(static_cast<uint8_t>(x));
|
||||
}
|
||||
template <> void CHex(std::ostream& s, uint32_t x)
|
||||
{
|
||||
if (x > 9) s << "0x";
|
||||
if (x > 0xFFFFFFF) s << HexU(static_cast<uint8_t>(x >> 24));
|
||||
if (x > 0xFFFFFF) s << HexL(static_cast<uint8_t>(x >> 24));
|
||||
if (x > 0xFFFFF) s << HexU(static_cast<uint8_t>(x >> 16));
|
||||
if (x > 65535) s << HexL(static_cast<uint8_t>(x >> 16));
|
||||
if (x > 4095) s << HexU(static_cast<uint8_t>(x >> 8));
|
||||
if (x > 255) s << HexL(static_cast<uint8_t>(x >> 8));
|
||||
if (x > 15) s << HexU(static_cast<uint8_t>(x));
|
||||
s << HexL(static_cast<uint8_t>(x));
|
||||
}
|
||||
#elif HEX_STYLE == MASM_STYLE
|
||||
template <typename T> static void MHex(std::ostream& s, T x);
|
||||
template <> void MHex(std::ostream& s, uint8_t x)
|
||||
{
|
||||
if (x > 159) s << "0";
|
||||
if (x > 15) s << HexU(x); else if (x > 9) s << "0";
|
||||
s << HexL(x);
|
||||
if (x > 9) s << "h";
|
||||
}
|
||||
template <> void MHex(std::ostream& s, uint16_t x)
|
||||
{
|
||||
if (x > 40959) s << "0";
|
||||
if (x > 4095) s << HexU(static_cast<uint8_t>(x >> 8)); else if (x > 2559) s << "0";
|
||||
if (x > 255) s << HexL(static_cast<uint8_t>(x >> 8)); else if (x > 159) s << "0";
|
||||
if (x > 15) s << HexU(static_cast<uint8_t>(x)); else if (x > 9) s << "0";
|
||||
s << HexL(static_cast<uint8_t>(x));
|
||||
if (x > 9) s << "h";
|
||||
}
|
||||
template <> void MHex(std::ostream& s, uint32_t x)
|
||||
{
|
||||
if (x > 0x9FFFFFFF) s << "0";
|
||||
if (x > 0xFFFFFFF) s << HexU(static_cast<uint8_t>(x >> 24)); else if (x > 0x9FFFFFF) s << "0";
|
||||
if (x > 0xFFFFFF) s << HexL(static_cast<uint8_t>(x >> 24)); else if (x > 0x9FFFFF) s << "0";
|
||||
if (x > 0xFFFFF) s << HexU(static_cast<uint8_t>(x >> 16)); else if (x > 655359) s << "0";
|
||||
if (x > 65535) s << HexL(static_cast<uint8_t>(x >> 16)); else if (x > 40959) s << "0";
|
||||
if (x > 4095) s << HexU(static_cast<uint8_t>(x >> 8)); else if (x > 2559) s << "0";
|
||||
if (x > 255) s << HexL(static_cast<uint8_t>(x >> 8)); else if (x > 159) s << "0";
|
||||
if (x > 15) s << HexU(static_cast<uint8_t>(x)); else if (x > 9) s << "0";
|
||||
s << HexL(static_cast<uint8_t>(x));
|
||||
if (x > 9) s << "h";
|
||||
}
|
||||
#else
|
||||
# error "Unknown hex style"
|
||||
#endif
|
||||
|
||||
|
||||
template <typename T> static constexpr const std::string_view DataType();
|
||||
template <> constexpr const std::string_view DataType<uint8_t>() { return ".byte"; }
|
||||
template <> constexpr const std::string_view DataType<uint16_t>() { return ".hword"; }
|
||||
template <> constexpr const std::string_view DataType<uint32_t>() { return ".word"; }
|
||||
|
||||
template <typename I>
|
||||
static void WriteArrayDetail(std::ostream& s, const I beg, const I end, int perCol)
|
||||
{
|
||||
typedef typename std::iterator_traits<I>::value_type Element;
|
||||
|
||||
int col = 0;
|
||||
for (auto it = beg;;)
|
||||
{
|
||||
if (col == 0)
|
||||
s << "\t" << DataType<Element>() << " ";
|
||||
|
||||
const Element e = *it;
|
||||
#if HEX_STYLE == MASM_STYLE
|
||||
MHex(s, e);
|
||||
#elif HEX_STYLE == GNU_STYLE
|
||||
CHex(s, e);
|
||||
#endif
|
||||
|
||||
if (++it == end)
|
||||
break;
|
||||
|
||||
if (++col < perCol)
|
||||
{
|
||||
s << ",";
|
||||
}
|
||||
else
|
||||
{
|
||||
s << std::endl;
|
||||
col = 0;
|
||||
}
|
||||
}
|
||||
s << std::endl;
|
||||
}
|
||||
|
||||
|
||||
void SWriter::WriteSymbol(const std::string_view suffix)
|
||||
{
|
||||
if (writes++ != 0)
|
||||
stream << std::endl;
|
||||
stream << "\t.section .rodata" << std::endl;
|
||||
stream << "\t.align 2" << std::endl;
|
||||
stream << "\t.global " << mName << suffix << std::endl;
|
||||
stream << "\t.hidden " << mName << suffix << std::endl;
|
||||
stream << mName << suffix << ":" << std::endl;
|
||||
}
|
||||
|
||||
void SWriter::WriteArray(const std::string_view suffix, std::span<uint8_t> data, int numCols)
|
||||
{
|
||||
assert(data.size());
|
||||
WriteSymbol(suffix);
|
||||
WriteArrayDetail(stream, data.begin(), data.end(), numCols);
|
||||
}
|
||||
|
||||
void SWriter::WriteArray(const std::string_view suffix, std::span<uint16_t> data, int numCols)
|
||||
{
|
||||
assert(data.size());
|
||||
WriteSymbol(suffix);
|
||||
WriteArrayDetail(stream, data.begin(), data.end(), numCols);
|
||||
}
|
||||
|
||||
void SWriter::WriteArray(const std::string_view suffix, std::span<uint32_t> data, int numCols)
|
||||
{
|
||||
assert(data.size());
|
||||
WriteSymbol(suffix);
|
||||
WriteArrayDetail(stream, data.begin(), data.end(), numCols);
|
||||
}
|
||||
|
||||
|
||||
bool SWriter::Open(const std::filesystem::path& path, const std::string_view name)
|
||||
{
|
||||
mName = name;
|
||||
stream.open(path);
|
||||
return stream.is_open();
|
||||
}
|
||||
30
src/swriter.hpp
Normal file
30
src/swriter.hpp
Normal file
@@ -0,0 +1,30 @@
|
||||
/* swwriter.hpp - Copyright (C) 2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#ifndef SWRITER_HPP
|
||||
#define SWRITER_HPP
|
||||
|
||||
#include <cstddef>
|
||||
#include <cstdint>
|
||||
#include <string>
|
||||
#include <string_view>
|
||||
#include <span>
|
||||
#include <fstream>
|
||||
#include <filesystem>
|
||||
|
||||
class SWriter
|
||||
{
|
||||
std::ofstream stream;
|
||||
std::string mName;
|
||||
int writes = 0;
|
||||
|
||||
void WriteSymbol(const std::string_view suffix);
|
||||
|
||||
public:
|
||||
[[nodiscard]] bool Open(const std::filesystem::path& path, const std::string_view name);
|
||||
|
||||
void WriteArray(const std::string_view suffix, std::span<uint8_t> data, int numCols = 16);
|
||||
void WriteArray(const std::string_view suffix, std::span<uint16_t> data, int numCols = 16);
|
||||
void WriteArray(const std::string_view suffix, std::span<uint32_t> data, int numCols = 16);
|
||||
};
|
||||
|
||||
#endif//SWRITER_HPP
|
||||
461
src/tmx2gba.cpp
461
src/tmx2gba.cpp
@@ -1,101 +1,114 @@
|
||||
/* tmx2gba.cpp - Copyright (C) 2015-2022 a dinosaur (zlib, see COPYING.txt) */
|
||||
/* tmx2gba.cpp - Copyright (C) 2015-2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#include "argparse.hpp"
|
||||
#include "tmxreader.hpp"
|
||||
#include "tmxlayer.hpp"
|
||||
#include "tmxobject.hpp"
|
||||
#include "convert.hpp"
|
||||
#include "headerwriter.hpp"
|
||||
#include "swriter.hpp"
|
||||
#include "config.h"
|
||||
#include <iostream>
|
||||
#include <fstream>
|
||||
#include <vector>
|
||||
#include <map>
|
||||
#include <string>
|
||||
#include <cstdint>
|
||||
#include <algorithm>
|
||||
#include <ultragetopt.h>
|
||||
|
||||
|
||||
const std::string helpUsage = "Usage: tmx2gba [-h] [-f file] [-r offset] [-lyc name] [-p 0-15] [-m name;id] <-i inpath> <-o outpath>";
|
||||
const std::string helpShort = "Run 'tmx2gba -h' to view all available options.";
|
||||
const std::string versionStr = "tmx2gba version 0.3, (c) 2015-2022 a dinosaur";
|
||||
const std::string helpFull = R"(
|
||||
-h ------------ Display this help & command info.
|
||||
-v ------------ Display version & quit.
|
||||
-l <name> ----- Name of layer to use (default first layer in TMX).
|
||||
-y <name> ----- Layer for palette mappings.
|
||||
-c <name> ----- Output a separate 8bit collision map of the specified layer.
|
||||
-r <offset> --- Offset tile indices (default 0).
|
||||
-p <0-15> ----- Select which palette to use for 4-bit tilesets.
|
||||
-m <name;id> -- Map an object name to an ID, will enable object exports.
|
||||
-i <path> ----- Path to input TMX file.
|
||||
-o <path> ----- Path to output files.
|
||||
-f <file> ----- Specify a file to use for flags, will override any options specified on the command line.)";
|
||||
|
||||
struct Arguments
|
||||
{
|
||||
bool help = false, showVersion = false;
|
||||
std::string inPath, outPath;
|
||||
std::string layer, collisionlay, paletteLay;
|
||||
std::string flagFile;
|
||||
int offset = 0;
|
||||
int palette = 0;
|
||||
std::vector<std::string> objMappings;
|
||||
bool objExport = false;
|
||||
bool help = false, showVersion = false;
|
||||
};
|
||||
|
||||
void ParseArgs(int argc, char** argv, Arguments& p)
|
||||
using ArgParse::Option;
|
||||
|
||||
static const ArgParse::Options options =
|
||||
{
|
||||
int opt;
|
||||
optreset = 1;
|
||||
while ((opt = getopt(argc, argv, "hvr:l:c:p:y:m:i:o:f:")) > 0)
|
||||
Option::Optional('h', nullptr, "Display this help & command info"),
|
||||
Option::Optional('v', nullptr, "Display version & quit"),
|
||||
Option::Optional('l', "name", "Name of layer to use (default first layer in TMX)"),
|
||||
Option::Optional('y', "name", "Layer for palette mappings"),
|
||||
Option::Optional('c', "name", "Output a separate 8bit collision map of the specified layer"),
|
||||
Option::Optional('r', "offset", "Offset tile indices (default 0)"),
|
||||
Option::Optional('p', "0-15", "Select which palette to use for 4-bit tilesets"),
|
||||
Option::Optional('m', "name;id", "Map an object name to an ID, will enable object exports"),
|
||||
Option::Required('i', "inpath", "Path to input TMX file"),
|
||||
Option::Required('o', "outpath", "Path to output files"),
|
||||
Option::Optional('f', "file", "Specify a file to use for flags, will override any options"
|
||||
" specified on the command line")
|
||||
};
|
||||
|
||||
static bool ParseArgs(int argc, char** argv, Arguments& params)
|
||||
{
|
||||
auto parser = ArgParse::ArgParser(argv[0], options, [&](int opt, const std::string_view arg)
|
||||
-> ArgParse::ParseCtrl
|
||||
{
|
||||
switch (opt)
|
||||
using ArgParse::ParseCtrl;
|
||||
try
|
||||
{
|
||||
case ('h'):
|
||||
p.help = true;
|
||||
return;
|
||||
case ('v'):
|
||||
p.showVersion = true;
|
||||
return;
|
||||
switch (opt)
|
||||
{
|
||||
case 'h': params.help = true; return ParseCtrl::QUIT_EARLY;
|
||||
case 'v': params.showVersion = true; return ParseCtrl::QUIT_EARLY;
|
||||
case 'l': params.layer = arg; return ParseCtrl::CONTINUE;
|
||||
case 'c': params.collisionlay = arg; return ParseCtrl::CONTINUE;
|
||||
case 'y': params.paletteLay = arg; return ParseCtrl::CONTINUE;
|
||||
case 'r': params.offset = std::stoi(std::string(arg)); return ParseCtrl::CONTINUE;
|
||||
case 'p': params.palette = std::stoi(std::string(arg)); return ParseCtrl::CONTINUE;
|
||||
case 'm': params.objMappings.emplace_back(arg); return ParseCtrl::CONTINUE;
|
||||
case 'i': params.inPath = arg; return ParseCtrl::CONTINUE;
|
||||
case 'o': params.outPath = arg; return ParseCtrl::CONTINUE;
|
||||
case 'f': params.flagFile = arg; return ParseCtrl::CONTINUE;
|
||||
|
||||
case ('l'): p.layer = optarg; break;
|
||||
case ('c'): p.collisionlay = optarg; break;
|
||||
case ('y'): p.paletteLay = optarg; break;
|
||||
case ('r'): p.offset = std::stoi(optarg); break;
|
||||
case ('p'): p.palette = std::stoi(optarg); break;
|
||||
|
||||
case ('m'):
|
||||
p.objExport = true;
|
||||
p.objMappings.emplace_back(optarg);
|
||||
break;
|
||||
|
||||
case ('i'): p.inPath = optarg; break;
|
||||
case ('o'): p.outPath = optarg; break;
|
||||
case ('f'): p.flagFile = optarg; break;
|
||||
|
||||
default:
|
||||
break;
|
||||
default: return ParseCtrl::QUIT_ERR_UNKNOWN;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
catch (std::invalid_argument const&) { return ParseCtrl::QUIT_ERR_INVALID; }
|
||||
catch (std::out_of_range const&) { return ParseCtrl::QUIT_ERR_RANGE; }
|
||||
});
|
||||
|
||||
if (!parser.Parse(std::span(argv + 1, argc - 1)))
|
||||
return false;
|
||||
|
||||
if (params.help || params.showVersion)
|
||||
return true;
|
||||
|
||||
if (!params.flagFile.empty())
|
||||
{
|
||||
std::ifstream paramFile(params.flagFile);
|
||||
if (!paramFile.is_open())
|
||||
{
|
||||
std::cerr << "Failed to open param file." << std::endl;
|
||||
return false;
|
||||
}
|
||||
|
||||
std::vector<std::string> tokens;
|
||||
if (!ArgParse::ReadParamFile(tokens, paramFile))
|
||||
{
|
||||
std::cerr << "Failed to read param file: Unterminated quote string." << std::endl;
|
||||
return false;
|
||||
}
|
||||
|
||||
if (!parser.Parse(tokens))
|
||||
return false;
|
||||
}
|
||||
|
||||
bool CheckArgs(const Arguments& params)
|
||||
{
|
||||
// Check my paranoia
|
||||
if (params.inPath.empty())
|
||||
{
|
||||
std::cerr << "No input file specified." << std::endl;
|
||||
std::cout << helpUsage << std::endl << helpShort << std::endl;
|
||||
parser.DisplayError("No input file specified.");
|
||||
return false;
|
||||
}
|
||||
if (params.outPath.empty())
|
||||
{
|
||||
std::cerr << "No output file specified." << std::endl;
|
||||
std::cout << helpUsage << std::endl << helpShort << std::endl;
|
||||
parser.DisplayError("No output file specified.");
|
||||
return false;
|
||||
}
|
||||
if (params.palette < 0 || params.palette > 15)
|
||||
{
|
||||
std::cerr << "Invalid palette index." << std::endl;
|
||||
std::cout << helpUsage << std::endl << helpShort << std::endl;
|
||||
parser.DisplayError("Invalid palette index.");
|
||||
return false;
|
||||
}
|
||||
|
||||
@@ -103,130 +116,44 @@ bool CheckArgs(const Arguments& params)
|
||||
}
|
||||
|
||||
|
||||
template <typename T> constexpr const char* DatType();
|
||||
template <> constexpr const char* DatType<uint8_t>() { return ".byte"; }
|
||||
template <> constexpr const char* DatType<uint16_t>() { return ".hword"; }
|
||||
template <> constexpr const char* DatType<uint32_t>() { return ".word"; }
|
||||
|
||||
template <typename T>
|
||||
void WriteArray(std::ofstream& aOut, const std::vector<T>& aDat, int aPerCol = 16)
|
||||
static std::string SanitiseLabel(const std::string_view ident)
|
||||
{
|
||||
int col = 0;
|
||||
std::string out;
|
||||
out.reserve(ident.length());
|
||||
|
||||
aOut.setf(std::ios::hex, std::ios::basefield);
|
||||
aOut.setf(std::ios::showbase);
|
||||
|
||||
size_t i = 0;
|
||||
for (T element : aDat)
|
||||
int last = '_';
|
||||
for (int i : ident)
|
||||
{
|
||||
if (col == 0)
|
||||
aOut << "\t" << DatType<T>() << " ";
|
||||
|
||||
aOut << std::hex << (int)element;
|
||||
|
||||
if (i < aDat.size() - 1)
|
||||
{
|
||||
if (++col < aPerCol)
|
||||
{
|
||||
aOut << ",";
|
||||
}
|
||||
else
|
||||
{
|
||||
aOut << "" << std::endl;
|
||||
col = 0;
|
||||
}
|
||||
}
|
||||
|
||||
++i;
|
||||
if (out.empty() && std::isdigit(i))
|
||||
continue;
|
||||
if (!std::isalnum(i))
|
||||
i = '_';
|
||||
if (i != '_' || last != '_')
|
||||
out.push_back(i);
|
||||
last = i;
|
||||
}
|
||||
return out;
|
||||
}
|
||||
|
||||
int main(int argc, char** argv)
|
||||
{
|
||||
Arguments p;
|
||||
ParseArgs(argc, argv, p);
|
||||
|
||||
if (!ParseArgs(argc, argv, p))
|
||||
return 1;
|
||||
if (p.help)
|
||||
{
|
||||
std::cout << helpUsage << std::endl << helpFull << std::endl;
|
||||
options.ShowHelpUsage(argv[0], std::cout);
|
||||
return 0;
|
||||
}
|
||||
if (p.showVersion)
|
||||
{
|
||||
std::cout << versionStr << std::endl;
|
||||
std::cout << "tmx2gba version " << TMX2GBA_VERSION << ", (c) 2015-2024 a dinosaur" << std::endl;
|
||||
return 0;
|
||||
}
|
||||
|
||||
if (!p.flagFile.empty())
|
||||
{
|
||||
std::ifstream paramFile(p.flagFile);
|
||||
if (!paramFile.is_open())
|
||||
{
|
||||
std::cerr << "Failed to open param file." << std::endl;
|
||||
return -1;
|
||||
}
|
||||
|
||||
std::vector<std::string> fileArgTokens;
|
||||
fileArgTokens.push_back("auu~~");
|
||||
bool carry = false;
|
||||
std::string rawToken;
|
||||
while (!paramFile.eof())
|
||||
{
|
||||
if (carry)
|
||||
{
|
||||
std::string tmp;
|
||||
paramFile >> tmp;
|
||||
rawToken += " ";
|
||||
rawToken += tmp;
|
||||
}
|
||||
else
|
||||
{
|
||||
rawToken.clear();
|
||||
paramFile >> rawToken;
|
||||
}
|
||||
|
||||
if (rawToken.empty())
|
||||
continue;
|
||||
|
||||
bool qFr = rawToken[0] == '"';
|
||||
bool qBk = rawToken[rawToken.length() - 1] == '"';
|
||||
if (qFr && qBk)
|
||||
{
|
||||
fileArgTokens.push_back(rawToken.substr(1, rawToken.length() - 2));
|
||||
}
|
||||
else
|
||||
if (qFr)
|
||||
{
|
||||
fileArgTokens.push_back(rawToken.substr(1, rawToken.length() - 1));
|
||||
carry = true;
|
||||
}
|
||||
else
|
||||
if (qBk)
|
||||
{
|
||||
fileArgTokens.push_back(rawToken.substr(0, rawToken.length() - 1));
|
||||
carry = false;
|
||||
}
|
||||
else
|
||||
{
|
||||
fileArgTokens.push_back(rawToken);
|
||||
}
|
||||
}
|
||||
|
||||
std::vector<const char*> fileArgs;
|
||||
fileArgs.reserve(fileArgTokens.size());
|
||||
for (const auto& token : fileArgTokens)
|
||||
fileArgs.push_back(token.c_str());
|
||||
fileArgs.push_back(nullptr);
|
||||
|
||||
ParseArgs(static_cast<int>(fileArgs.size()) - 1, (char**)fileArgs.data(), p);
|
||||
}
|
||||
|
||||
if (!CheckArgs(p))
|
||||
return -1;
|
||||
|
||||
// Object mappings
|
||||
std::map<std::string, uint32_t> objMapping;
|
||||
if (p.objExport)
|
||||
if (!p.objMappings.empty())
|
||||
{
|
||||
for (const auto& objToken : p.objMappings)
|
||||
{
|
||||
@@ -234,7 +161,7 @@ int main(int argc, char** argv)
|
||||
if (splitter == std::string::npos)
|
||||
{
|
||||
std::cerr << "Malformed mapping (missing a splitter)." << std::endl;
|
||||
return -1;
|
||||
return 1;
|
||||
}
|
||||
|
||||
try
|
||||
@@ -253,175 +180,77 @@ int main(int argc, char** argv)
|
||||
|
||||
// Open & read input file
|
||||
TmxReader tmx;
|
||||
std::ifstream fin(p.inPath);
|
||||
if (!fin.is_open())
|
||||
switch (tmx.Open(p.inPath,
|
||||
p.layer, p.paletteLay, p.collisionlay, objMapping))
|
||||
{
|
||||
case TmxReader::Error::LOAD_FAILED:
|
||||
std::cerr << "Failed to open input file." << std::endl;
|
||||
return -1;
|
||||
return 1;
|
||||
case TmxReader::Error::NO_LAYERS:
|
||||
std::cerr << "No suitable tile layer found." << std::endl;
|
||||
return 1;
|
||||
case TmxReader::Error::GRAPHICS_NOTFOUND:
|
||||
std::cerr << "No graphics layer \"" << p.layer << "\" found." << std::endl;
|
||||
return 1;
|
||||
case TmxReader::Error::PALETTE_NOTFOUND:
|
||||
std::cerr << "No palette layer \"" << p.paletteLay << "\" found." << std::endl;
|
||||
return 1;
|
||||
case TmxReader::Error::COLLISION_NOTFOUND:
|
||||
std::cerr << "No collision layer \"" << p.collisionlay << "\" found." << std::endl;
|
||||
return 1;
|
||||
case TmxReader::Error::OK:
|
||||
break;
|
||||
}
|
||||
tmx.Open(fin);
|
||||
|
||||
// Get layers
|
||||
if (tmx.GetLayerCount() == 0)
|
||||
{
|
||||
std::cerr << "No layers found." << std::endl;
|
||||
return -1;
|
||||
}
|
||||
const TmxLayer* layerGfx = p.layer.empty()
|
||||
? tmx.GetLayer(0)
|
||||
: tmx.GetLayer(p.layer);
|
||||
const TmxLayer* layerCls = p.collisionlay.empty()
|
||||
? nullptr
|
||||
: tmx.GetLayer(p.collisionlay);
|
||||
const TmxLayer* layerPal = p.paletteLay.empty()
|
||||
? nullptr
|
||||
: tmx.GetLayer(p.paletteLay);
|
||||
|
||||
if (layerGfx == nullptr)
|
||||
{
|
||||
std::cerr << "Input layer not found." << std::endl;
|
||||
return -1;
|
||||
}
|
||||
// Get name from file
|
||||
std::string name = SanitiseLabel(std::filesystem::path(p.outPath).stem().string());
|
||||
|
||||
// Open output files
|
||||
std::ofstream foutS(p.outPath + ".s");
|
||||
std::ofstream foutH(p.outPath + ".h");
|
||||
if (!foutS.is_open() || !foutH.is_open())
|
||||
SWriter outS;
|
||||
if (!outS.Open(p.outPath + ".s", name))
|
||||
{
|
||||
std::cerr << "Failed to create output file(s).";
|
||||
return -1;
|
||||
std::cerr << "Failed to create output file \"" << p.outPath << ".s\".";
|
||||
return 1;
|
||||
}
|
||||
HeaderWriter outH;
|
||||
if (!outH.Open(p.outPath + ".h", name))
|
||||
{
|
||||
std::cerr << "Failed to create output file \"" << p.outPath << ".h\".";
|
||||
return 1;
|
||||
}
|
||||
|
||||
int slashPos = std::max((int)p.outPath.find_last_of('/'), (int)p.outPath.find_last_of('\\'));
|
||||
std::string name = p.outPath;
|
||||
if (slashPos != -1)
|
||||
name = name.substr(slashPos + 1);
|
||||
|
||||
// Write header guards
|
||||
std::string guard = "TMX2GBA_" + name;
|
||||
for (auto& c: guard)
|
||||
c = static_cast<char>(toupper(c));
|
||||
foutH << "#ifndef " << guard << std::endl;
|
||||
foutH << "#define " << guard << std::endl;
|
||||
foutH << std::endl;
|
||||
foutH << "#define " << name << "Width " << tmx.GetWidth() << std::endl;
|
||||
foutH << "#define " << name << "Height " << tmx.GetHeight() << std::endl;
|
||||
foutH << std::endl;
|
||||
|
||||
// Convert to GBA-friendly charmap data
|
||||
const uint32_t* gfxTiles = layerGfx->GetData();
|
||||
const uint32_t* palTiles = (layerPal == nullptr) ? nullptr : layerPal->GetData();
|
||||
std::vector<uint16_t> charDat;
|
||||
size_t numTiles = static_cast<size_t>(layerGfx->GetWidth()) * static_cast<size_t>(layerGfx->GetHeight());
|
||||
charDat.reserve(numTiles);
|
||||
for (size_t i = 0; i < numTiles; ++i)
|
||||
{
|
||||
uint32_t read = (*gfxTiles++);
|
||||
std::vector<uint16_t> charDat;
|
||||
if (!convert::ConvertCharmap(charDat, p.offset, p.palette, tmx))
|
||||
return 1;
|
||||
|
||||
uint16_t tile = (uint16_t)std::max<int32_t>(0, tmx.LidFromGid(read & ~TmxLayer::FLIP_MASK) + p.offset);
|
||||
uint8_t flags = 0x0;
|
||||
|
||||
// Get flipped!
|
||||
flags |= (read & TmxLayer::FLIP_HORZ) ? 0x4 : 0x0;
|
||||
flags |= (read & TmxLayer::FLIP_VERT) ? 0x8 : 0x0;
|
||||
|
||||
// Determine palette ID
|
||||
uint32_t idx = 0;
|
||||
if (palTiles != nullptr)
|
||||
idx = tmx.LidFromGid((*palTiles++) & ~TmxLayer::FLIP_MASK);
|
||||
if (idx == 0)
|
||||
idx = p.palette + 1;
|
||||
flags |= static_cast<uint8_t>(idx - 1) << 4;
|
||||
|
||||
charDat.push_back(tile | (static_cast<uint16_t>(flags) << 8));
|
||||
// Write out charmap
|
||||
outH.WriteSize(tmx.GetSize().width, tmx.GetSize().height);
|
||||
outH.WriteCharacterMap(charDat);
|
||||
outS.WriteArray("Tiles", charDat);
|
||||
}
|
||||
|
||||
// Write out charmap
|
||||
foutH << "#define " << name << "TilesLen " << charDat.size() * 2 << std::endl;
|
||||
foutH << "extern const unsigned short " << name << "Tiles[" << charDat.size() << "];" << std::endl;
|
||||
foutH << std::endl;
|
||||
|
||||
foutS << "\t.section .rodata" << std::endl;
|
||||
foutS << "\t.align 2" << std::endl;
|
||||
foutS << "\t.global " << name << "Tiles" << std::endl;
|
||||
foutS << "\t.hidden " << name << "Tiles" << std::endl;
|
||||
foutS << name << "Tiles" << ":" << std::endl;
|
||||
WriteArray<uint16_t>(foutS, charDat);
|
||||
foutS << std::endl;
|
||||
|
||||
// Convert collision map & write it out
|
||||
if (layerCls != nullptr)
|
||||
// Convert collision map & write out
|
||||
if (tmx.HasCollisionTiles())
|
||||
{
|
||||
std::vector<uint8_t> vucCollisionDat;
|
||||
vucCollisionDat.reserve(layerCls->GetWidth() * layerCls->GetHeight());
|
||||
std::vector<uint8_t> collisionDat;
|
||||
if (!convert::ConvertCollision(collisionDat, tmx))
|
||||
return 1;
|
||||
|
||||
gfxTiles = layerCls->GetData();
|
||||
for (int i = 0; i < layerCls->GetWidth() * layerCls->GetHeight(); ++i)
|
||||
{
|
||||
uint8_t ucTile = (uint8_t)tmx.LidFromGid((*gfxTiles++) & ~TmxLayer::FLIP_MASK);
|
||||
vucCollisionDat.push_back(ucTile);
|
||||
}
|
||||
|
||||
// Try to nicely append "_collision" to the output name
|
||||
std::string path;
|
||||
size_t extPos = p.outPath.find_last_of('.');
|
||||
if (extPos != std::string::npos)
|
||||
path = p.outPath.insert(extPos, "_collision");
|
||||
else
|
||||
path = p.outPath + "_collision";
|
||||
|
||||
// Write collision
|
||||
foutH << "#define " << name << "CollisionLen " << vucCollisionDat.size() << std::endl;
|
||||
foutH << "extern const unsigned char " << name << "Collision[" << vucCollisionDat.size() << "];" << std::endl;
|
||||
foutH << std::endl;
|
||||
|
||||
foutS << std::endl;
|
||||
foutS << "\t.section .rodata" << std::endl;
|
||||
foutS << "\t.align 2" << std::endl;
|
||||
foutS << "\t.global " << name << "Collision" << std::endl;
|
||||
foutS << "\t.hidden " << name << "Collision" << std::endl;
|
||||
foutS << name << "Collision" << ":" << std::endl;
|
||||
WriteArray<uint8_t>(foutS, vucCollisionDat);
|
||||
foutS << std::endl;
|
||||
outH.WriteCollision(collisionDat);
|
||||
outS.WriteArray("Collision", collisionDat, 32);
|
||||
}
|
||||
|
||||
if (p.objExport)
|
||||
if (tmx.HasObjects())
|
||||
{
|
||||
std::vector<uint32_t> objDat;
|
||||
for (size_t i = 0; i < tmx.GetObjectCount(); ++i)
|
||||
{
|
||||
auto obj = tmx.GetObject(i);
|
||||
auto it = objMapping.find(obj->GetName());
|
||||
if (it == objMapping.end())
|
||||
continue;
|
||||
if (!convert::ConvertObjects(objDat, tmx))
|
||||
return 1;
|
||||
|
||||
float x, y;
|
||||
obj->GetPos(x, y);
|
||||
objDat.push_back(it->second);
|
||||
objDat.push_back((int)(x * 256.0f));
|
||||
objDat.push_back((int)(y * 256.0f));
|
||||
}
|
||||
|
||||
// Write objects
|
||||
foutH << "#define " << name << "ObjCount " << objDat.size() / 3 << std::endl;
|
||||
foutH << "#define " << name << "ObjdatLen " << objDat.size() * sizeof(int) << std::endl;
|
||||
foutH << "extern const unsigned int " << name << "Objdat[" << objDat.size() << "];" << std::endl;
|
||||
foutH << std::endl;
|
||||
|
||||
foutS << std::endl;
|
||||
foutS << "\t.section .rodata" << std::endl;
|
||||
foutS << "\t.align 2" << std::endl;
|
||||
foutS << "\t.global " << name << "Objdat" << std::endl;
|
||||
foutS << "\t.hidden " << name << "Objdat" << std::endl;
|
||||
foutS << name << "Objdat" << ":" << std::endl;
|
||||
WriteArray<uint32_t>(foutS, objDat);
|
||||
foutS << std::endl;
|
||||
outH.WriteObjects(objDat);
|
||||
outS.WriteArray("Objdat", objDat);
|
||||
}
|
||||
|
||||
foutH << "#endif//" << guard << std::endl;
|
||||
|
||||
foutH.close();
|
||||
foutS.close();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@@ -1,34 +0,0 @@
|
||||
/* tmxlayer.hpp - Copyright (C) 2015-2022 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#ifndef TMXLAYER_HPP
|
||||
#define TMXLAYER_HPP
|
||||
|
||||
#include <string>
|
||||
#include <cstdint>
|
||||
#include <utility>
|
||||
|
||||
class TmxLayer
|
||||
{
|
||||
public:
|
||||
static constexpr uint32_t FLIP_HORZ = 0x80000000;
|
||||
static constexpr uint32_t FLIP_VERT = 0x40000000;
|
||||
static constexpr uint32_t FLIP_DIAG = 0x20000000;
|
||||
static constexpr uint32_t FLIP_MASK = 0xE0000000;
|
||||
|
||||
TmxLayer() : mWidth(0), mHeight(0), mTileDat(nullptr) {}
|
||||
TmxLayer(int aWidth, int aHeight, std::string aName, uint32_t* aTileDat)
|
||||
: mName(std::move(aName)), mWidth(aWidth), mHeight(aHeight), mTileDat(aTileDat) {}
|
||||
inline ~TmxLayer() { delete[] mTileDat; }
|
||||
|
||||
constexpr const std::string& GetName() const { return mName; }
|
||||
constexpr int GetWidth() const { return mWidth; }
|
||||
constexpr int GetHeight() const { return mHeight; }
|
||||
constexpr const uint32_t* GetData() const { return mTileDat; }
|
||||
|
||||
private:
|
||||
std::string mName;
|
||||
int mWidth, mHeight;
|
||||
uint32_t* mTileDat;
|
||||
};
|
||||
|
||||
#endif//TMXLAYER_HPP
|
||||
@@ -1,25 +0,0 @@
|
||||
/* tmxobject.hpp - Copyright (C) 2015-2022 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#ifndef TMXOBJECT_HPP
|
||||
#define TMXOBJECT_HPP
|
||||
|
||||
#include <string>
|
||||
#include <utility>
|
||||
|
||||
class TmxObject
|
||||
{
|
||||
public:
|
||||
TmxObject() : mX(0.0f), mY(0.0f) {}
|
||||
TmxObject(std::string aName, float aX, float aY)
|
||||
: mName(std::move(aName)), mX(aX), mY(aY) {}
|
||||
~TmxObject() = default;
|
||||
|
||||
constexpr const std::string& GetName() const { return mName; }
|
||||
inline void GetPos(float& aOutX, float& aOutY) const { aOutX = mX; aOutY = mY; }
|
||||
|
||||
private:
|
||||
std::string mName;
|
||||
float mX, mY;
|
||||
};
|
||||
|
||||
#endif//TMXOBJECT_HPP
|
||||
@@ -1,227 +1,133 @@
|
||||
/* tmxreader.cpp - Copyright (C) 2015-2022 a dinosaur (zlib, see COPYING.txt) */
|
||||
/* tmxreader.cpp - Copyright (C) 2015-2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#include "tmxreader.hpp"
|
||||
#include "tmxtileset.hpp"
|
||||
#include "tmxobject.hpp"
|
||||
#include "tmxlayer.hpp"
|
||||
#include <cstdint>
|
||||
#include <sstream>
|
||||
#include "tmxlite/Map.hpp"
|
||||
#include "tmxlite/TileLayer.hpp"
|
||||
#include "tmxlite/ObjectGroup.hpp"
|
||||
#include <optional>
|
||||
#include <algorithm>
|
||||
#include <rapidxml/rapidxml.hpp>
|
||||
#include <base64.h>
|
||||
#include <miniz.h>
|
||||
|
||||
|
||||
TmxReader::~TmxReader()
|
||||
TmxReader::Error TmxReader::Open(const std::string& inPath,
|
||||
const std::string_view graphicsName,
|
||||
const std::string_view paletteName,
|
||||
const std::string_view collisionName,
|
||||
const std::map<std::string, uint32_t>& objMapping)
|
||||
{
|
||||
// Delete old tilesets
|
||||
for (auto pTileset : mTilesets)
|
||||
delete pTileset;
|
||||
mTilesets.clear();
|
||||
tmx::Map map;
|
||||
if (!map.load(inPath))
|
||||
return Error::LOAD_FAILED;
|
||||
|
||||
// Delete old layers
|
||||
for (auto pLay : mLayers)
|
||||
delete pLay;
|
||||
mLayers.clear();
|
||||
}
|
||||
using tmx::TileLayer;
|
||||
using tmx::ObjectGroup;
|
||||
using std::optional;
|
||||
using std::reference_wrapper;
|
||||
|
||||
optional<reference_wrapper<const TileLayer>> layerGfx;
|
||||
optional<reference_wrapper<const TileLayer>> layerCls;
|
||||
optional<reference_wrapper<const TileLayer>> layerPal;
|
||||
std::vector<reference_wrapper<const ObjectGroup>> objGroups;
|
||||
|
||||
bool TmxReader::DecodeMap(uint32_t* aOut, size_t aOutSize, const std::string& aBase64Dat)
|
||||
{
|
||||
// Cut leading & trailing whitespace (including newlines)
|
||||
auto beg = std::find_if_not(aBase64Dat.begin(), aBase64Dat.end(), ::isspace);
|
||||
if (beg == std::end(aBase64Dat))
|
||||
return false;
|
||||
auto end = std::find_if_not(aBase64Dat.rbegin(), aBase64Dat.rend(), ::isspace);
|
||||
std::size_t begOff = std::distance(aBase64Dat.begin(), beg);
|
||||
std::size_t endOff = std::distance(end, aBase64Dat.rend()) - begOff;
|
||||
auto trimmed = aBase64Dat.substr(begOff, endOff);
|
||||
|
||||
// Decode base64 string
|
||||
std::string decoded = base64_decode(trimmed);
|
||||
|
||||
// Decompress compressed data
|
||||
auto dstSize = static_cast<mz_ulong>(aOutSize);
|
||||
int res = uncompress(
|
||||
(unsigned char*)aOut,
|
||||
&dstSize,
|
||||
reinterpret_cast<const unsigned char*>(decoded.data()),
|
||||
static_cast<mz_ulong>(decoded.size()));
|
||||
decoded.clear();
|
||||
if (res < 0)
|
||||
return false;
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
void TmxReader::ReadTileset(rapidxml::xml_node<>* aXNode)
|
||||
{
|
||||
rapidxml::xml_attribute<>* xAttrib;
|
||||
|
||||
const char* name = "";
|
||||
const char* source = "";
|
||||
uint32_t firstGid = 0;
|
||||
|
||||
// Read name
|
||||
xAttrib = aXNode->first_attribute("name");
|
||||
if (xAttrib != nullptr)
|
||||
name = xAttrib->value();
|
||||
|
||||
// Read source
|
||||
xAttrib = aXNode->first_attribute("source");
|
||||
if (xAttrib != nullptr)
|
||||
source = xAttrib->value();
|
||||
|
||||
// Read first global ID
|
||||
xAttrib = aXNode->first_attribute("firstgid");
|
||||
if (xAttrib != nullptr)
|
||||
firstGid = std::stoul(xAttrib->value());
|
||||
|
||||
mTilesets.push_back(new TmxTileset(name, source, firstGid));
|
||||
}
|
||||
|
||||
void TmxReader::ReadLayer(rapidxml::xml_node<>* aXNode)
|
||||
{
|
||||
rapidxml::xml_attribute<>* xAttrib;
|
||||
const char* name = "";
|
||||
int width = 0;
|
||||
int height = 0;
|
||||
uint32_t* tileDat = nullptr;
|
||||
|
||||
// Read name
|
||||
xAttrib = aXNode->first_attribute("name");
|
||||
if (xAttrib != nullptr)
|
||||
name = xAttrib->value();
|
||||
|
||||
// Read width
|
||||
xAttrib = aXNode->first_attribute("width");
|
||||
if (xAttrib != nullptr)
|
||||
width = std::stoi(xAttrib->value());
|
||||
|
||||
// Read height
|
||||
xAttrib = aXNode->first_attribute("height");
|
||||
if (xAttrib != nullptr)
|
||||
height = std::stoi(xAttrib->value());
|
||||
|
||||
// Read tile data
|
||||
auto xData = aXNode->first_node("data");
|
||||
if (xData != nullptr)
|
||||
// Read layers
|
||||
for (const auto& layer : map.getLayers())
|
||||
{
|
||||
// TODO: don't assume base64 & zlib
|
||||
tileDat = new uint32_t[width * height];
|
||||
if (!DecodeMap(tileDat, width * height * sizeof(uint32_t), std::string(xData->value())))
|
||||
auto name = layer->getName();
|
||||
if (layer->getType() == tmx::Layer::Type::Tile)
|
||||
{
|
||||
delete[] tileDat;
|
||||
tileDat = nullptr;
|
||||
if (layerGfx == std::nullopt && (graphicsName.empty() || name == graphicsName))
|
||||
layerGfx = layer->getLayerAs<TileLayer>();
|
||||
if (!collisionName.empty() && layerCls == std::nullopt && name == collisionName)
|
||||
layerCls = layer->getLayerAs<TileLayer>();
|
||||
if (!paletteName.empty() && layerPal == std::nullopt && name == paletteName)
|
||||
layerPal = layer->getLayerAs<TileLayer>();
|
||||
}
|
||||
else if (!objMapping.empty() && layer->getType() == tmx::Layer::Type::Object)
|
||||
{
|
||||
objGroups.emplace_back(layer->getLayerAs<ObjectGroup>());
|
||||
}
|
||||
}
|
||||
|
||||
mLayers.push_back(new TmxLayer(width, height, name, tileDat));
|
||||
}
|
||||
|
||||
void TmxReader::ReadObjects(rapidxml::xml_node<>* aXNode)
|
||||
{
|
||||
for (auto xNode = aXNode->first_node(); xNode != nullptr; xNode = xNode->next_sibling())
|
||||
// Check layers
|
||||
if (layerGfx == std::nullopt)
|
||||
{
|
||||
if (strcmp(xNode->name(), "object") != 0)
|
||||
continue;
|
||||
|
||||
rapidxml::xml_attribute<>* xAttrib;
|
||||
const char* name = "";
|
||||
float x = 0.0f;
|
||||
float y = 0.0f;
|
||||
|
||||
// Read name
|
||||
xAttrib = xNode->first_attribute("name");
|
||||
if (xAttrib != nullptr)
|
||||
name = xAttrib->value();
|
||||
|
||||
// Read X pos
|
||||
xAttrib = xNode->first_attribute("x");
|
||||
if (xAttrib != nullptr)
|
||||
x = std::stof(xAttrib->value());
|
||||
|
||||
// Read Y pos
|
||||
xAttrib = xNode->first_attribute("y");
|
||||
if (xAttrib != nullptr)
|
||||
y = std::stof(xAttrib->value());
|
||||
|
||||
mObjects.push_back(new TmxObject(name, x, y));
|
||||
}
|
||||
}
|
||||
|
||||
void TmxReader::Open(std::istream& aIn)
|
||||
{
|
||||
// Delete old tilesets
|
||||
for (auto tileset : mTilesets)
|
||||
delete tileset;
|
||||
mTilesets.clear();
|
||||
|
||||
// Delete old layers
|
||||
for (auto layer : mLayers)
|
||||
delete layer;
|
||||
mLayers.clear();
|
||||
|
||||
mGidTable.clear();
|
||||
|
||||
// Read string into a buffer
|
||||
std::stringstream buf;
|
||||
buf << aIn.rdbuf();
|
||||
std::string strXml = buf.str();
|
||||
buf.clear();
|
||||
|
||||
// Parse document
|
||||
rapidxml::xml_document<> xDoc;
|
||||
xDoc.parse<0>((char*)strXml.c_str());
|
||||
|
||||
// Get map node
|
||||
auto xMap = xDoc.first_node("map");
|
||||
if (xMap == nullptr)
|
||||
return;
|
||||
|
||||
// Read map attribs
|
||||
rapidxml::xml_attribute<>* xAttrib = nullptr;
|
||||
if ((xAttrib = xMap->first_attribute("width")) != nullptr)
|
||||
mWidth = std::stoi(xAttrib->value());
|
||||
if ((xAttrib = xMap->first_attribute("height")) != nullptr)
|
||||
mHeight = std::stoi(xAttrib->value());
|
||||
|
||||
// Read nodes
|
||||
for (auto xNode = xMap->first_node(); xNode != nullptr; xNode = xNode->next_sibling())
|
||||
{
|
||||
// Read layer nodes
|
||||
if (strcmp(xNode->name(), "layer") == 0)
|
||||
ReadLayer(xNode);
|
||||
if (graphicsName.empty())
|
||||
return Error::NO_LAYERS;
|
||||
else
|
||||
if (strcmp(xNode->name(), "tileset") == 0)
|
||||
ReadTileset(xNode);
|
||||
else
|
||||
if (strcmp(xNode->name(), "objectgroup") == 0)
|
||||
ReadObjects(xNode);
|
||||
return Error::GRAPHICS_NOTFOUND;
|
||||
}
|
||||
if (layerCls == std::nullopt && !collisionName.empty())
|
||||
return Error::GRAPHICS_NOTFOUND;
|
||||
if (layerPal == std::nullopt && !paletteName.empty())
|
||||
return Error::PALETTE_NOTFOUND;
|
||||
|
||||
// Read TMX map
|
||||
mSize = Size { map.getTileCount().x, map.getTileCount().y };
|
||||
size_t numTiles = static_cast<size_t>(mSize.width) * static_cast<size_t>(mSize.height);
|
||||
|
||||
// Read graphics layer
|
||||
mGraphics.reserve(numTiles);
|
||||
for (auto tmxTile : layerGfx.value().get().getTiles())
|
||||
mGraphics.emplace_back(Tile { tmxTile.ID, tmxTile.flipFlags });
|
||||
|
||||
// Read optional layers
|
||||
if (layerPal != std::nullopt)
|
||||
{
|
||||
std::vector<uint32_t> v;
|
||||
v.reserve(numTiles);
|
||||
for (auto tmxTile : layerPal.value().get().getTiles())
|
||||
v.emplace_back(tmxTile.ID);
|
||||
mPalette.emplace(v);
|
||||
}
|
||||
if (layerCls != std::nullopt)
|
||||
{
|
||||
std::vector<uint32_t> v;
|
||||
v.reserve(numTiles);
|
||||
for (auto tmxTile : layerCls.value().get().getTiles())
|
||||
v.emplace_back(tmxTile.ID);
|
||||
mCollision.emplace(v);
|
||||
}
|
||||
|
||||
// Generate global id table
|
||||
for (auto tileset : mTilesets)
|
||||
mGidTable.push_back(tileset->GetFirstGid());
|
||||
std::sort(mGidTable.rbegin(), mGidTable.rend());
|
||||
}
|
||||
// Read tilesets
|
||||
const auto& tilesets = map.getTilesets();
|
||||
mGidTable.reserve(tilesets.size());
|
||||
for (const auto& set : tilesets)
|
||||
mGidTable.emplace_back(std::make_pair(set.getFirstGID(), set.getLastGID()));
|
||||
|
||||
const TmxLayer* TmxReader::GetLayer(const std::string& aName) const
|
||||
{
|
||||
for (auto layer : mLayers)
|
||||
// Read objects
|
||||
if (!objMapping.empty())
|
||||
{
|
||||
if (layer->GetName() == aName)
|
||||
return layer;
|
||||
std::vector<Object> v;
|
||||
for (const auto& group : objGroups)
|
||||
{
|
||||
const auto& tmxObjects = group.get().getObjects();
|
||||
v.reserve(v.size() + tmxObjects.size());
|
||||
for (const auto& tmxObj : tmxObjects)
|
||||
{
|
||||
auto it = objMapping.find(tmxObj.getName());
|
||||
if (it == objMapping.end())
|
||||
continue;
|
||||
|
||||
const auto& aabb = tmxObj.getAABB();
|
||||
Object obj;
|
||||
obj.id = it->second;
|
||||
obj.x = aabb.left;
|
||||
obj.y = aabb.top;
|
||||
|
||||
v.emplace_back(obj);
|
||||
}
|
||||
}
|
||||
mObjects.emplace(v);
|
||||
}
|
||||
return nullptr;
|
||||
|
||||
return Error::OK;
|
||||
}
|
||||
|
||||
uint32_t TmxReader::LidFromGid(uint32_t aGid)
|
||||
uint32_t TmxReader::LidFromGid(uint32_t aGid) const
|
||||
{
|
||||
for (uint32_t first : mGidTable)
|
||||
for (auto range : mGidTable)
|
||||
{
|
||||
if (first <= aGid)
|
||||
return aGid - (first - 1);
|
||||
if (aGid >= range.first && aGid <= range.second)
|
||||
return aGid - (range.first - 1);
|
||||
}
|
||||
return aGid;
|
||||
}
|
||||
|
||||
@@ -1,50 +1,80 @@
|
||||
/* tmxreader.hpp - Copyright (C) 2015-2022 a dinosaur (zlib, see COPYING.txt) */
|
||||
/* tmxreader.hpp - Copyright (C) 2015-2024 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#ifndef TMXREADER_HPP
|
||||
#define TMXREADER_HPP
|
||||
|
||||
#include <istream>
|
||||
#include <vector>
|
||||
#include <string>
|
||||
#include <string_view>
|
||||
#include <cstdint>
|
||||
#include <rapidxml/rapidxml.hpp>
|
||||
|
||||
class TmxTileset;
|
||||
class TmxLayer;
|
||||
class TmxObject;
|
||||
#include <span>
|
||||
#include <vector>
|
||||
#include <map>
|
||||
#include <optional>
|
||||
|
||||
class TmxReader
|
||||
{
|
||||
public:
|
||||
TmxReader() = default;
|
||||
~TmxReader();
|
||||
static constexpr uint8_t FLIP_HORZ = 0x8;
|
||||
static constexpr uint8_t FLIP_VERT = 0x4;
|
||||
static constexpr uint8_t FLIP_DIAG = 0x2;
|
||||
static constexpr uint8_t FLIP_MASK = 0xE;
|
||||
|
||||
void Open(std::istream& aIn);
|
||||
enum class Error
|
||||
{
|
||||
OK,
|
||||
LOAD_FAILED,
|
||||
NO_LAYERS,
|
||||
GRAPHICS_NOTFOUND,
|
||||
PALETTE_NOTFOUND,
|
||||
COLLISION_NOTFOUND
|
||||
};
|
||||
|
||||
constexpr int GetWidth() const { return mWidth; }
|
||||
constexpr int GetHeight() const { return mHeight; }
|
||||
[[nodiscard]] Error Open(const std::string& inPath,
|
||||
const std::string_view graphicsName,
|
||||
const std::string_view paletteName,
|
||||
const std::string_view collisionName,
|
||||
const std::map<std::string, uint32_t>& objMapping);
|
||||
struct Size { unsigned width, height; };
|
||||
|
||||
inline const TmxLayer* GetLayer(size_t aId) const { return mLayers.at(aId); }
|
||||
const TmxLayer* GetLayer(const std::string& aName) const;
|
||||
inline std::size_t GetLayerCount() const { return mLayers.size(); }
|
||||
[[nodiscard]] constexpr Size GetSize() const { return mSize; }
|
||||
[[nodiscard]] constexpr size_t TileCount() const { return
|
||||
static_cast<size_t>(mSize.width) *
|
||||
static_cast<size_t>(mSize.height); }
|
||||
|
||||
inline const TmxObject* GetObject(size_t aId) const { return mObjects.at(aId); }
|
||||
inline size_t GetObjectCount() const { return mObjects.size(); }
|
||||
[[nodiscard]] uint32_t LidFromGid(uint32_t aGid) const;
|
||||
|
||||
uint32_t LidFromGid(uint32_t aGid);
|
||||
struct Tile { uint32_t id; uint8_t flags; };
|
||||
struct Object { unsigned id; float x, y; };
|
||||
|
||||
[[nodiscard]] constexpr bool HasCollisionTiles() const { return mCollision.has_value(); }
|
||||
[[nodiscard]] constexpr bool HasObjects() const { return mObjects.has_value(); }
|
||||
|
||||
[[nodiscard]] constexpr const std::span<const Tile> GetGraphicsTiles() const { return mGraphics; }
|
||||
[[nodiscard]] constexpr const std::optional<std::span<const uint32_t>> GetPaletteTiles() const
|
||||
{
|
||||
if (mPalette.has_value()) { return { mPalette.value() }; }
|
||||
return std::nullopt;
|
||||
}
|
||||
[[nodiscard]] constexpr const std::optional<std::span<const uint32_t>> GetCollisionTiles() const
|
||||
{
|
||||
if (mCollision.has_value()) { return { mCollision.value() }; }
|
||||
return std::nullopt;
|
||||
}
|
||||
[[nodiscard]] constexpr const std::optional<std::span<const Object>> GetObjects() const
|
||||
{
|
||||
if (mObjects.has_value()) { return { mObjects.value() }; }
|
||||
return std::nullopt;
|
||||
}
|
||||
|
||||
private:
|
||||
static bool DecodeMap(uint32_t* aOut, size_t aOutSize, const std::string& aBase64Dat);
|
||||
void ReadTileset(rapidxml::xml_node<>* aXNode);
|
||||
void ReadLayer(rapidxml::xml_node<>* aXNode);
|
||||
void ReadObjects(rapidxml::xml_node<>* aXNode);
|
||||
Size mSize;
|
||||
|
||||
int mWidth, mHeight;
|
||||
std::vector<TmxTileset*> mTilesets;
|
||||
std::vector<TmxLayer*> mLayers;
|
||||
std::vector<TmxObject*> mObjects;
|
||||
std::vector<uint32_t> mGidTable;
|
||||
std::vector<std::pair<uint32_t, uint32_t>> mGidTable;
|
||||
|
||||
std::vector<Tile> mGraphics;
|
||||
std::optional<std::vector<uint32_t>> mPalette;
|
||||
std::optional<std::vector<uint32_t>> mCollision;
|
||||
std::optional<std::vector<Object>> mObjects;
|
||||
};
|
||||
|
||||
#endif//TMXREADER_HPP
|
||||
|
||||
@@ -1,29 +0,0 @@
|
||||
/* tmxtileset.hpp - Copyright (C) 2015-2022 a dinosaur (zlib, see COPYING.txt) */
|
||||
|
||||
#ifndef TMXTILESET_HPP
|
||||
#define TMXTILESET_HPP
|
||||
|
||||
#include <string>
|
||||
#include <cstdint>
|
||||
#include <utility>
|
||||
|
||||
class TmxTileset
|
||||
{
|
||||
public:
|
||||
TmxTileset() : mFirstGid(0) {}
|
||||
TmxTileset(std::string aName, std::string aSource, uint32_t aFirstGid)
|
||||
: mName(std::move(aName)), mSource(std::move(aSource)), mFirstGid(aFirstGid) {}
|
||||
~TmxTileset() = default;
|
||||
|
||||
constexpr const std::string& GetName() const { return mName; }
|
||||
constexpr const std::string& GetSource() const { return mSource; }
|
||||
constexpr uint32_t GetFirstGid() const { return mFirstGid; }
|
||||
|
||||
private:
|
||||
std::string mName;
|
||||
std::string mSource;
|
||||
uint32_t mFirstGid;
|
||||
|
||||
};
|
||||
|
||||
#endif//TMXTILESET_HPP
|
||||
Reference in New Issue
Block a user