├── .gitignore ├── dpmi └── csdpmi7b.zip ├── src ├── dpmi │ ├── CMakeLists.txt │ ├── dpmi.hpp │ └── dpmi.cpp ├── utils │ ├── CMakeLists.txt │ ├── log.hpp │ └── cli.hpp ├── vbe │ ├── CMakeLists.txt │ ├── vbe.hpp │ └── vbe.cpp ├── version.h.in ├── CMakeLists.txt └── main.cpp ├── .clangd ├── .github └── workflows │ ├── release.yaml │ └── build.yaml ├── README.md ├── .clang-format └── LICENSE /.gitignore: -------------------------------------------------------------------------------- 1 | build/ 2 | -------------------------------------------------------------------------------- /dpmi/csdpmi7b.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/necroware/video-memory-tester/HEAD/dpmi/csdpmi7b.zip -------------------------------------------------------------------------------- /src/dpmi/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | add_library(dpmi dpmi.cpp) 2 | target_include_directories(dpmi PUBLIC ${CMAKE_CURRENT_LIST_DIR}) 3 | -------------------------------------------------------------------------------- /src/utils/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | add_library(utils INTERFACE) 2 | target_include_directories(utils INTERFACE ${CMAKE_CURRENT_LIST_DIR}) 3 | -------------------------------------------------------------------------------- /src/vbe/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | add_library(vbe vbe.cpp) 2 | target_include_directories(vbe PUBLIC .) 3 | target_link_libraries(vbe dpmi) 4 | -------------------------------------------------------------------------------- /.clangd: -------------------------------------------------------------------------------- 1 | CompileFlags: 2 | BuiltinHeaders: QueryDriver 3 | CompilationDatabase: ./build 4 | Index: 5 | Background: Build 6 | StandardLibrary: true 7 | -------------------------------------------------------------------------------- /src/version.h.in: -------------------------------------------------------------------------------- 1 | #pragma once 2 | 3 | #define PROJECT_NAME "@PROJECT_NAME@" 4 | #define PROJECT_VERSION_MAJOR @PROJECT_VERSION_MAJOR@ 5 | #define PROJECT_VERSION_MINOR @PROJECT_VERSION_MINOR@ 6 | #define PROJECT_VERSION_PATCH @PROJECT_VERSION_PATCH@ 7 | #define PROJECT_VERSION "@PROJECT_VERSION@" 8 | #define PROJECT_BUILD_DATE "@PROJECT_BUILD_DATE@" 9 | -------------------------------------------------------------------------------- /src/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.23) 2 | project(nwvmt VERSION 0.0.2) 3 | 4 | set(CMAKE_CXX_STANDARD 20) 5 | set(CMAKE_EXPORT_COMPILE_COMMANDS ON) 6 | 7 | add_subdirectory(dpmi) 8 | add_subdirectory(utils) 9 | add_subdirectory(vbe) 10 | 11 | add_executable(nwvmt main.cpp) 12 | target_link_libraries(nwvmt dpmi vbe utils) 13 | 14 | # Generate version header file 15 | string(TIMESTAMP PROJECT_BUILD_DATE "%Y-%m-%d") 16 | configure_file(version.h.in ${CMAKE_CURRENT_BINARY_DIR}/version.h) 17 | target_include_directories(nwvmt PRIVATE ${CMAKE_CURRENT_BINARY_DIR}) 18 | -------------------------------------------------------------------------------- /.github/workflows/release.yaml: -------------------------------------------------------------------------------- 1 | name: Release 2 | 3 | on: 4 | push: 5 | tags: 6 | - 'v[0-9]+.[0-9]+.[0-9]+' 7 | 8 | jobs: 9 | build: 10 | uses: ./.github/workflows/build.yaml 11 | 12 | release: 13 | needs: build 14 | runs-on: ubuntu-latest 15 | steps: 16 | - name: Download build artifact 17 | uses: actions/download-artifact@v4 18 | with: 19 | name: build-output 20 | path: build/ 21 | 22 | - name: Create GitHub Release 23 | uses: softprops/action-gh-release@v2 24 | with: 25 | tag_name: ${{ github.ref_name }} 26 | name: "Release ${{ github.ref_name }}" 27 | body: | 28 | Release for tag ${{ github.ref_name }}. 29 | files: | 30 | build/*.exe 31 | env: 32 | GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }} 33 | -------------------------------------------------------------------------------- /.github/workflows/build.yaml: -------------------------------------------------------------------------------- 1 | name: Build 2 | 3 | on: 4 | workflow_dispatch: 5 | workflow_call: 6 | pull_request: 7 | 8 | jobs: 9 | build: 10 | runs-on: ubuntu-latest 11 | container: 12 | image: jagholin/dosbox-gcc:latest 13 | 14 | steps: 15 | - name: Checkout source 16 | uses: actions/checkout@v4 17 | 18 | - name: Install Required Tools 19 | run: | 20 | apt-get update 21 | apt-get install -y cmake upx 22 | 23 | - name: Configure project 24 | run: cmake -B build -S src -DCMAKE_BUILD_TYPE=Release 25 | 26 | - name: Build project 27 | run: cmake --build build 28 | 29 | - name: Compress output binary 30 | run: upx -9 build/nwvmt.exe 31 | 32 | - name: Upload artifact 33 | uses: actions/upload-artifact@v4 34 | with: 35 | name: build-output 36 | path: build/*.exe 37 | 38 | -------------------------------------------------------------------------------- /src/utils/log.hpp: -------------------------------------------------------------------------------- 1 | // Necrowares's Video Memory Tester 2 | // Copyright (C) 2025 by Necroware 3 | // 4 | // This program is free software: you can redistribute it and/or modify 5 | // it under the terms of the GNU General Public License as published by 6 | // the Free Software Foundation, either version 3 of the License, or 7 | // (at your option) any later version. 8 | // 9 | // This program is distributed in the hope that it will be useful, 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | // GNU General Public License for more details. 13 | // 14 | // You should have received a copy of the GNU General Public License 15 | // along with this program. If not, see . 16 | 17 | #pragma once 18 | 19 | #include 20 | #include 21 | 22 | namespace log_internal { 23 | 24 | template 25 | auto wrap_arg(T&& arg) { 26 | return std::forward(arg); 27 | } 28 | 29 | inline const char* wrap_arg(const std::string& s) { return s.c_str(); } 30 | 31 | } // namespace log_internal 32 | 33 | template 34 | void log(const char* fmt, Args&&... args) { 35 | std::printf(fmt, log_internal::wrap_arg(std::forward(args))...); 36 | std::puts(""); 37 | } 38 | 39 | -------------------------------------------------------------------------------- /src/vbe/vbe.hpp: -------------------------------------------------------------------------------- 1 | // Necrowares's Video Memory Tester 2 | // Copyright (C) 2025 by Necroware 3 | // 4 | // This program is free software: you can redistribute it and/or modify 5 | // it under the terms of the GNU General Public License as published by 6 | // the Free Software Foundation, either version 3 of the License, or 7 | // (at your option) any later version. 8 | // 9 | // This program is distributed in the hope that it will be useful, 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | // GNU General Public License for more details. 13 | // 14 | // You should have received a copy of the GNU General Public License 15 | // along with this program. If not, see . 16 | 17 | #pragma once 18 | 19 | #include 20 | #include 21 | #include 22 | #include 23 | 24 | namespace vbe { 25 | 26 | struct oem_info_t { 27 | std::string description; 28 | std::string vendor_name; 29 | std::string product_name; 30 | std::string revision_name; 31 | }; 32 | 33 | struct mode_info_t { 34 | std::uint16_t id; 35 | std::uint16_t width; 36 | std::uint16_t height; 37 | std::uint8_t bits_per_pixel; 38 | }; 39 | 40 | class framebuffer { 41 | public: 42 | explicit framebuffer(std::uint16_t mode_id); 43 | ~framebuffer(); 44 | 45 | framebuffer(const framebuffer&) = delete; 46 | framebuffer(framebuffer&&) noexcept; 47 | framebuffer& operator=(const framebuffer&) = delete; 48 | framebuffer& operator=(framebuffer&&) noexcept; 49 | 50 | [[nodiscard]] auto selector() const -> int; 51 | void write(std::uint32_t offset, const void* data, std::size_t size) const; 52 | void read(std::uint32_t offset, void* data, std::size_t size) const; 53 | 54 | private: 55 | class impl; 56 | std::unique_ptr m_pimpl; 57 | }; 58 | 59 | oem_info_t get_oem_info(); 60 | std::size_t get_total_memory_size(); 61 | std::vector get_modes(); 62 | void reset(); 63 | 64 | } // namespace 65 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Necroware's Video Memory Tester 2 | 3 | *Warning:* This is a very early development version which potentially could 4 | break your graphics card, your house, your city, your country, and also come 5 | home drunken and impregnate your cat. So please, use it only at your own risk. 6 | 7 | # Why do we need another video memory test tool? 8 | 9 | First of all, this one is fast. Furthermore there are already tools out there 10 | which just return broken addresses, where you have to derive which of the 11 | memory chips on your card are broken. It often ends up in guessing games and 12 | replacing the wrong chips. So this tool doesn't only tell if the memory of your 13 | graphics card is broken, it also tells you which chip you should replace. This 14 | tool runs in DOS and is theoretically able to test all kinds of graphics cards 15 | which support VBE 2.0 16 | 17 | # How it works? 18 | 19 | The tool detects the graphics card and uses VBE 2.0 to allocate a linear frame 20 | buffer over the total size of the video memory. Then it writes different 21 | patterns into the video memory and validates the content. If any address turns 22 | out to be bad the tool calculates which memory chip exactly is affected on the 23 | card. Unfortunately it is not possible to tell which chips and how many of those 24 | are installed on the tested card, so this information has to be provided by the 25 | user and is used for the result calculations. 26 | 27 | # Current limitations 28 | 29 | - Needs pure DOS without any memory managers loaded 30 | - Supports only VBE 2.0 capable graphics cards 31 | - The memory chips on the card have to be at least 8-bit or multiple of 8-bits 32 | - No graphical interface or user feedback during the tests 33 | 34 | # Programming details 35 | 36 | With this project I finally got to a point which I had on my TODO list for a 37 | very long time: programming in modern C++ for DOS. So the tool is written in 38 | C++20 with STL, exceptions and almost all the fancy stuf. Only iostreams were 39 | not used because just inclusion of the headers grew the binary footprint of the 40 | tool by 300%. The project utilizes DJGPP C++ (12.0) compiler and CMake (3.23). 41 | 42 | # How to build 43 | 44 | cmake -B build -S src \ 45 | -DCMAKE_TOOLCHAIN_FILE=toolchain-djgpp.cmake -DCMAKE_BUILD_TYPE=Release 46 | cmake --build build 47 | 48 | # License 49 | 50 | The project is licensed under GPL v3.0 51 | 52 | -------------------------------------------------------------------------------- /src/dpmi/dpmi.hpp: -------------------------------------------------------------------------------- 1 | // Necrowares's Video Memory Tester 2 | // Copyright (C) 2025 by Necroware 3 | // 4 | // This program is free software: you can redistribute it and/or modify 5 | // it under the terms of the GNU General Public License as published by 6 | // the Free Software Foundation, either version 3 of the License, or 7 | // (at your option) any later version. 8 | // 9 | // This program is distributed in the hope that it will be useful, 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | // GNU General Public License for more details. 13 | // 14 | // You should have received a copy of the GNU General Public License 15 | // along with this program. If not, see . 16 | 17 | #pragma once 18 | 19 | #include 20 | #include 21 | #include 22 | 23 | namespace dpmi { 24 | 25 | using error = std::runtime_error; 26 | 27 | struct farptr_t { 28 | std::uint16_t offset; 29 | std::uint16_t segment; 30 | }; 31 | 32 | inline std::uint32_t to_real_addr(std::uint32_t segment, std::uint32_t offset) { 33 | return (segment << 4) + offset; 34 | } 35 | 36 | inline std::uint32_t to_real_addr(const farptr_t addr) { 37 | return to_real_addr(addr.segment, addr.offset); 38 | } 39 | 40 | class dos_memory { 41 | public: 42 | explicit dos_memory(std::uint32_t size_bytes); 43 | ~dos_memory(); 44 | 45 | // Non-copyable, move-enabled 46 | dos_memory(const dos_memory&) = delete; 47 | dos_memory& operator=(const dos_memory&) = delete; 48 | dos_memory(dos_memory&& other) noexcept; 49 | dos_memory& operator=(dos_memory&& other) noexcept; 50 | 51 | // Data transfer 52 | void put(const void* src, std::size_t len, std::size_t offset = 0) const; 53 | void get(void* dst, std::size_t len, std::size_t offset = 0); 54 | 55 | // Accessors 56 | [[nodiscard]] auto selector() const { return m_selector; } 57 | [[nodiscard]] auto segment() const { return m_segment; } 58 | [[nodiscard]] auto size() const { return m_size; } 59 | 60 | private: 61 | int m_selector; 62 | std::uint16_t m_segment; 63 | std::uint32_t m_size; 64 | }; 65 | 66 | template 67 | class typed_dos_memory { 68 | static_assert(std::is_trivial::value && 69 | std::is_standard_layout::value); 70 | 71 | public: 72 | using value_type = T; 73 | 74 | void push() const { m_buffer.put(&m_value, sizeof(m_value)); } 75 | 76 | auto pull() -> const value_type& { 77 | m_buffer.get(&m_value, sizeof(m_value)); 78 | return get(); 79 | } 80 | 81 | [[nodiscard]] auto get() const -> const value_type& { return m_value; } 82 | [[nodiscard]] auto get() -> value_type& { return m_value; } 83 | [[nodiscard]] auto operator->() const -> const value_type* { 84 | return &get(); 85 | } 86 | [[nodiscard]] auto operator->() -> value_type* { return &get(); } 87 | [[nodiscard]] auto segment() const -> std::uint16_t { 88 | return m_buffer.segment(); 89 | } 90 | 91 | private: 92 | value_type m_value{}; 93 | dos_memory m_buffer{sizeof(value_type)}; 94 | }; 95 | 96 | class physical_memory_mapping { 97 | public: 98 | physical_memory_mapping(std::uint32_t phys_addr, std::size_t size); 99 | ~physical_memory_mapping(); 100 | 101 | physical_memory_mapping(const physical_memory_mapping&) = delete; 102 | physical_memory_mapping& operator=(const physical_memory_mapping&) = delete; 103 | physical_memory_mapping(physical_memory_mapping&&) noexcept; 104 | physical_memory_mapping& operator=(physical_memory_mapping&&) noexcept; 105 | 106 | [[nodiscard]] auto selector() const -> int; 107 | [[nodiscard]] auto size() const -> std::size_t; 108 | 109 | private: 110 | class impl; 111 | std::unique_ptr m_pimpl; 112 | }; 113 | 114 | } // namespace dpmi 115 | -------------------------------------------------------------------------------- /src/dpmi/dpmi.cpp: -------------------------------------------------------------------------------- 1 | // Necrowares's Video Memory Tester 2 | // Copyright (C) 2025 by Necroware 3 | // 4 | // This program is free software: you can redistribute it and/or modify 5 | // it under the terms of the GNU General Public License as published by 6 | // the Free Software Foundation, either version 3 of the License, or 7 | // (at your option) any later version. 8 | // 9 | // This program is distributed in the hope that it will be useful, 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | // GNU General Public License for more details. 13 | // 14 | // You should have received a copy of the GNU General Public License 15 | // along with this program. If not, see . 16 | 17 | #include "dpmi.hpp" 18 | 19 | #include 20 | #include 21 | 22 | namespace dpmi { 23 | 24 | namespace details {} // namespace details 25 | 26 | dos_memory::dos_memory(std::uint32_t size) 27 | : m_selector(-1), m_segment(0), m_size(size) { 28 | const auto paragraphs = static_cast((size + 15) / 16); 29 | const auto segment = __dpmi_allocate_dos_memory(paragraphs, &m_selector); 30 | if (segment == -1 || m_selector == -1) { 31 | throw error("failed to allocate dos memory"); 32 | } 33 | m_segment = static_cast(segment); 34 | } 35 | 36 | dos_memory::~dos_memory() { 37 | if (m_selector != -1) { 38 | __dpmi_free_dos_memory(m_selector); 39 | } 40 | } 41 | 42 | dos_memory::dos_memory(dos_memory&& other) noexcept 43 | : m_selector(other.m_selector), 44 | m_segment(other.m_segment), 45 | m_size(other.m_size) { 46 | other.m_selector = -1; 47 | other.m_segment = 0; 48 | other.m_size = 0; 49 | } 50 | 51 | dos_memory& dos_memory::operator=(dos_memory&& other) noexcept { 52 | if (this != &other) { 53 | auto temp = dos_memory{std::forward(other)}; 54 | std::swap(m_selector, temp.m_selector); 55 | std::swap(m_segment, temp.m_segment); 56 | std::swap(m_size, temp.m_size); 57 | } 58 | return *this; 59 | } 60 | 61 | void dos_memory::put(const void* src, std::size_t len, std::size_t offset) const { 62 | dosmemput(src, len, to_real_addr(m_segment, offset)); 63 | } 64 | 65 | void dos_memory::get(void* dst, std::size_t len, std::size_t offset) { 66 | dosmemget(to_real_addr(m_segment, offset), len, dst); 67 | } 68 | 69 | class physical_memory_mapping::impl { 70 | public: 71 | impl(std::uint32_t phys_addr, std::uint32_t size) { 72 | m_meminfo.address = phys_addr; 73 | m_meminfo.size = size; 74 | if (__dpmi_physical_address_mapping(&m_meminfo) != 0) { 75 | throw error("failed to map physical address"); 76 | } 77 | m_selector = __dpmi_allocate_ldt_descriptors(1); 78 | if (m_selector < 0) { 79 | __dpmi_free_physical_address_mapping(&m_meminfo); 80 | throw error("Failed to allocate LDT descriptor"); 81 | } 82 | __dpmi_set_segment_base_address(m_selector, m_meminfo.address); 83 | __dpmi_set_segment_limit(m_selector, m_meminfo.size - 1); 84 | } 85 | 86 | ~impl() { 87 | __dpmi_free_ldt_descriptor(m_selector); 88 | __dpmi_free_physical_address_mapping(&m_meminfo); 89 | } 90 | 91 | impl(const impl&) = delete; 92 | impl& operator=(const impl&) = delete; 93 | impl(impl&&) = delete; 94 | impl& operator=(impl&&) = delete; 95 | 96 | [[nodiscard]] auto selector() const -> int { return m_selector; } 97 | [[nodiscard]] auto size() const -> std::uint32_t { return m_meminfo.size; } 98 | 99 | private: 100 | __dpmi_meminfo m_meminfo{}; 101 | int m_selector{-1}; 102 | }; 103 | 104 | physical_memory_mapping::physical_memory_mapping(std::uint32_t phys_addr, 105 | std::size_t size) 106 | : m_pimpl(std::make_unique(phys_addr, size)) {} 107 | 108 | physical_memory_mapping::~physical_memory_mapping() = default; 109 | physical_memory_mapping::physical_memory_mapping( 110 | physical_memory_mapping&& other) noexcept = default; 111 | physical_memory_mapping& physical_memory_mapping::operator=( 112 | physical_memory_mapping&& other) noexcept = default; 113 | 114 | auto physical_memory_mapping::selector() const -> int { 115 | return m_pimpl->selector(); 116 | } 117 | 118 | auto physical_memory_mapping::size() const -> std::size_t { 119 | return m_pimpl->size(); 120 | } 121 | 122 | } // namespace dpmi 123 | -------------------------------------------------------------------------------- /src/main.cpp: -------------------------------------------------------------------------------- 1 | // Necrowares's Video Memory Tester 2 | // Copyright (C) 2025 by Necroware 3 | // 4 | // This program is free software: you can redistribute it and/or modify 5 | // it under the terms of the GNU General Public License as published by 6 | // the Free Software Foundation, either version 3 of the License, or 7 | // (at your option) any later version. 8 | // 9 | // This program is distributed in the hope that it will be useful, 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | // GNU General Public License for more details. 13 | // 14 | // You should have received a copy of the GNU General Public License 15 | // along with this program. If not, see . 16 | 17 | #include 18 | #include 19 | #include 20 | #include 21 | #include 22 | 23 | #include 24 | 25 | namespace { 26 | 27 | using error = std::runtime_error; 28 | 29 | constexpr auto bits_per_byte = 8u; 30 | 31 | auto find_best_mode() -> vbe::mode_info_t { 32 | 33 | for (const auto& mode : vbe::get_modes()) { 34 | if (mode.width >= 640 && mode.height >= 480 && 35 | mode.bits_per_pixel >= 16) { 36 | return mode; 37 | } 38 | } 39 | throw error("No suitable VESA mode found."); 40 | } 41 | 42 | auto test_video_memory(const std::uint16_t mode_id, 43 | const std::uint16_t bus_width, 44 | const std::uint8_t num_chips) { 45 | 46 | const auto fb = vbe::framebuffer{mode_id}; 47 | const auto size = vbe::get_total_memory_size(); 48 | const auto bus_width_in_bytes = bus_width / bits_per_byte; 49 | const auto bytes_per_chip = bus_width_in_bytes / num_chips; 50 | 51 | auto result = std::vector(num_chips, true); 52 | auto block = std::vector(bus_width_in_bytes * 1024u, 0u); 53 | 54 | const auto test_pass = [&](const auto& generator) { 55 | for (auto addr = 0u; addr < size; addr += block.size()) { 56 | const auto rest = std::min(size - addr, block.size()); 57 | for (auto i = 0u; i < rest; i++) { 58 | block[i] = generator(i); 59 | } 60 | fb.write(addr, block.data(), rest); 61 | } 62 | for (auto addr = 0u; addr < size; addr += block.size()) { 63 | const auto rest = std::min(size - addr, block.size()); 64 | fb.read(addr, block.data(), rest); 65 | for (auto i = 0u; i < rest; i++) { 66 | if (block[i] != generator(i)) { 67 | result[(i % bus_width_in_bytes) / bytes_per_chip] = false; 68 | } 69 | } 70 | } 71 | }; 72 | 73 | test_pass([](std::uint8_t) { return 0x00; }); 74 | test_pass([](std::uint8_t) { return 0xFF; }); 75 | test_pass([](std::uint8_t) { return 0xAA; }); 76 | test_pass([](std::uint8_t) { return 0x55; }); 77 | test_pass([](std::uint8_t offs) { return offs; }); 78 | 79 | return result; 80 | } 81 | 82 | void check_arguments(const std::uint16_t bus_width, 83 | const std::uint8_t num_chips) { 84 | if (bus_width < bits_per_byte) { 85 | throw error("Memory bus width has to be at least 8-bit"); 86 | } 87 | if (num_chips == 0u) { 88 | throw error("Invalid number of chips"); 89 | } 90 | if (bus_width / num_chips < bits_per_byte) { 91 | throw error("Cards with less than a byte per chip are not supported"); 92 | } 93 | } 94 | 95 | void run(const std::uint16_t bus_width, const std::uint8_t num_chips) { 96 | 97 | check_arguments(bus_width, num_chips); 98 | 99 | const auto oem_info = vbe::get_oem_info(); 100 | const auto total_memory = vbe::get_total_memory_size(); 101 | const auto mode = find_best_mode(); 102 | 103 | log("Test Info:"); 104 | log("----------"); 105 | log("OEM String: %s", oem_info.description); 106 | log("Vendor: %s", oem_info.vendor_name); 107 | log("Product: %s", oem_info.product_name); 108 | log("Revision: %s", oem_info.revision_name); 109 | log("Total Memory: %dMB", total_memory / (1024u * 1024u)); 110 | log("Memory bus: %d-bit", bus_width); 111 | log("Number of chips: %d", num_chips); 112 | log("Test video mode: %#X [%dx%dx%d]", mode.id, mode.width, mode.height, 113 | mode.bits_per_pixel); 114 | 115 | log("\nThe test can take up to several minutes"); 116 | log("Press [ENTER] to continue"); 117 | getchar(); 118 | const auto test_result = test_video_memory(mode.id, bus_width, num_chips); 119 | for (auto i = 0u; i < test_result.size(); i++) { 120 | log("Chip %d: %s", i, test_result[i] ? "OK" : "BAD"); 121 | } 122 | } 123 | 124 | } // namespace 125 | 126 | int main(int argc, const char* argv[]) { 127 | try { 128 | log("Necroware's Video Memory Tester"); 129 | log("Version " PROJECT_VERSION " (build date " PROJECT_BUILD_DATE ")\n"); 130 | 131 | const auto params = std::vector{ 132 | {"chips", true, 0, "Number of chips on the card"}, 133 | {"bus", true, 0, "Memory bus width in bits"}, 134 | }; 135 | 136 | const auto args = cli::args_parser{argc, argv, params}; 137 | if (args.wants_help()) { 138 | args.print_usage(); 139 | return EXIT_SUCCESS; 140 | } 141 | 142 | run(args.get("bus"), args.get("chips")); 143 | return EXIT_SUCCESS; 144 | } catch (std::exception& ex) { 145 | log("error: %s", ex.what()); 146 | return EXIT_FAILURE; 147 | } 148 | } 149 | -------------------------------------------------------------------------------- /src/utils/cli.hpp: -------------------------------------------------------------------------------- 1 | // Necrowares's Video Memory Tester 2 | // Copyright (C) 2025 by Necroware 3 | // 4 | // This program is free software: you can redistribute it and/or modify 5 | // it under the terms of the GNU General Public License as published by 6 | // the Free Software Foundation, either version 3 of the License, or 7 | // (at your option) any later version. 8 | // 9 | // This program is distributed in the hope that it will be useful, 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | // GNU General Public License for more details. 13 | // 14 | // You should have received a copy of the GNU General Public License 15 | // along with this program. If not, see . 16 | 17 | #pragma once 18 | 19 | #include 20 | #include 21 | #include 22 | #include 23 | #include 24 | 25 | namespace cli { 26 | 27 | using error = std::runtime_error; 28 | 29 | using value_variant = std::variant; 30 | 31 | struct param_decl { 32 | std::string name; 33 | bool required; 34 | value_variant default_value; 35 | std::string description; 36 | }; 37 | 38 | class args_parser { 39 | public: 40 | args_parser(int argc, const char* argv[], std::vector params) 41 | : m_program_name{argv[0]}, m_decls{std::move(params)} { 42 | 43 | // Always add default options 44 | m_decls.push_back({"help", false, false, "Show usage information"}); 45 | 46 | // Fill default values 47 | for (const auto& decl : m_decls) { 48 | if (!decl.required) { 49 | m_values[decl.name] = decl.default_value; 50 | } 51 | } 52 | 53 | // parse arguments 54 | for (int i = 1; i < argc; ++i) { 55 | parse_argument(argv[i]); 56 | } 57 | 58 | if (wants_help()) { 59 | return; 60 | } 61 | 62 | // check required 63 | for (const auto& decl : m_decls) { 64 | if (decl.required && !m_values.contains(decl.name)) { 65 | throw error("missing required parameter: --" + decl.name); 66 | } 67 | } 68 | } 69 | 70 | [[nodiscard]] auto has(const std::string& key) const -> bool { 71 | return m_values.contains(key); 72 | } 73 | 74 | template 75 | [[nodiscard]] auto get(const std::string& key) const -> T { 76 | try { 77 | return std::get(m_values.at(key)); 78 | } catch (...) { 79 | throw error("invalid value type for --" + key); 80 | } 81 | } 82 | 83 | [[nodiscard]] auto wants_help() const -> bool { 84 | return std::get(m_values.at("help")); 85 | } 86 | 87 | void print_usage() const { 88 | auto msg = std::string{"usage: "} + m_program_name; 89 | msg += " [options] [args...]\noptions:\n"; 90 | for (const auto& decl : m_decls) { 91 | msg += " --" + decl.name; 92 | std::visit(dispatch{ 93 | [&msg](bool) {}, 94 | [&msg](int) { msg += "="; }, 95 | [&msg](double) { msg += "="; }, 96 | [&msg](const std::string&) { msg += "="; }, 97 | }, 98 | decl.default_value); 99 | msg += "\n " + decl.description; 100 | if (!decl.required) { 101 | msg += " (default: "; 102 | std::visit( 103 | dispatch{ 104 | [&](const std::string& val) { msg += val; }, 105 | [&](bool val) { msg += val ? "true" : "false"; }, 106 | [&](const auto& val) { msg += std::to_string(val); }, 107 | }, 108 | decl.default_value); 109 | msg += ")\n"; 110 | } else { 111 | msg += " [required]\n"; 112 | } 113 | } 114 | std::fputs(msg.c_str(), stderr); 115 | } 116 | 117 | private: 118 | template 119 | struct dispatch : Ts... { 120 | using Ts::operator()...; 121 | }; 122 | 123 | static auto from_string(const param_decl& decl, const std::string& str) { 124 | try { 125 | return std::visit( 126 | dispatch{ 127 | [&](int) -> value_variant { return std::stoi(str); }, 128 | [&](double) -> value_variant { return std::stod(str); }, 129 | [&](const std::string&) -> value_variant { return str; }, 130 | }, 131 | decl.default_value); 132 | } catch (...) { 133 | throw error("invalid value for --" + decl.name + ": " + str); 134 | } 135 | } 136 | 137 | std::string m_program_name; 138 | std::unordered_map m_values; 139 | std::vector m_decls; 140 | 141 | auto find_decl(const std::string& key) const -> const param_decl& { 142 | for (const auto& decl : m_decls) { 143 | if (decl.name == key) { 144 | return decl; 145 | } 146 | } 147 | throw error("unknown parameter: --" + key); 148 | } 149 | 150 | void parse_argument(const std::string& arg) { 151 | if (!arg.starts_with("--")) { 152 | throw error("unknown parameter: " + arg); 153 | } 154 | const auto eq = arg.find('='); 155 | const auto key = arg.substr(2, eq == std::string::npos ? eq : eq - 2); 156 | const auto& decl = find_decl(key); 157 | if (std::holds_alternative(decl.default_value)) { 158 | m_values[key] = true; 159 | } else if (eq != std::string::npos) { 160 | const auto value = arg.substr(eq + 1); 161 | m_values[key] = from_string(decl, value); 162 | } else { 163 | throw error("missing value for --" + key); 164 | } 165 | } 166 | }; 167 | 168 | } // namespace cli 169 | 170 | -------------------------------------------------------------------------------- /.clang-format: -------------------------------------------------------------------------------- 1 | --- 2 | Language: Cpp 3 | # BasedOnStyle: LLVM 4 | AccessModifierOffset: -4 5 | AlignAfterOpenBracket: Align 6 | AlignArrayOfStructures: None 7 | AlignConsecutiveMacros: None 8 | AlignConsecutiveAssignments: None 9 | AlignConsecutiveBitFields: None 10 | AlignConsecutiveDeclarations: None 11 | AlignEscapedNewlines: Right 12 | AlignOperands: Align 13 | AlignTrailingComments: true 14 | AllowAllArgumentsOnNextLine: true 15 | AllowAllParametersOfDeclarationOnNextLine: true 16 | AllowShortEnumsOnASingleLine: true 17 | AllowShortBlocksOnASingleLine: Never 18 | AllowShortCaseLabelsOnASingleLine: false 19 | AllowShortFunctionsOnASingleLine: All 20 | AllowShortLambdasOnASingleLine: All 21 | AllowShortIfStatementsOnASingleLine: Never 22 | AllowShortLoopsOnASingleLine: false 23 | AlwaysBreakAfterDefinitionReturnType: None 24 | AlwaysBreakAfterReturnType: None 25 | AlwaysBreakBeforeMultilineStrings: false 26 | AlwaysBreakTemplateDeclarations: true 27 | AttributeMacros: 28 | - __capability 29 | BinPackArguments: true 30 | BinPackParameters: true 31 | BraceWrapping: 32 | AfterCaseLabel: false 33 | AfterClass: false 34 | AfterControlStatement: Never 35 | AfterEnum: false 36 | AfterFunction: false 37 | AfterNamespace: false 38 | AfterObjCDeclaration: false 39 | AfterStruct: false 40 | AfterUnion: false 41 | AfterExternBlock: false 42 | BeforeCatch: false 43 | BeforeElse: true 44 | BeforeLambdaBody: false 45 | BeforeWhile: false 46 | IndentBraces: false 47 | SplitEmptyFunction: true 48 | SplitEmptyRecord: true 49 | SplitEmptyNamespace: true 50 | BreakBeforeBinaryOperators: None 51 | BreakBeforeConceptDeclarations: true 52 | BreakBeforeBraces: Attach 53 | BreakBeforeInheritanceComma: false 54 | BreakInheritanceList: BeforeColon 55 | BreakBeforeTernaryOperators: true 56 | BreakConstructorInitializersBeforeComma: false 57 | BreakConstructorInitializers: BeforeColon 58 | BreakAfterJavaFieldAnnotations: false 59 | BreakStringLiterals: true 60 | ColumnLimit: 80 61 | CommentPragmas: '^ IWYU pragma:' 62 | QualifierAlignment: Leave 63 | CompactNamespaces: false 64 | ConstructorInitializerIndentWidth: 0 65 | ContinuationIndentWidth: 4 66 | Cpp11BracedListStyle: true 67 | DeriveLineEnding: true 68 | DerivePointerAlignment: false 69 | DisableFormat: false 70 | EmptyLineAfterAccessModifier: Never 71 | EmptyLineBeforeAccessModifier: LogicalBlock 72 | ExperimentalAutoDetectBinPacking: false 73 | PackConstructorInitializers: BinPack 74 | BasedOnStyle: '' 75 | ConstructorInitializerAllOnOneLineOrOnePerLine: true 76 | AllowAllConstructorInitializersOnNextLine: true 77 | FixNamespaceComments: true 78 | ForEachMacros: 79 | - foreach 80 | - Q_FOREACH 81 | - BOOST_FOREACH 82 | IfMacros: 83 | - KJ_IF_MAYBE 84 | IncludeBlocks: Regroup 85 | IncludeCategories: 86 | - Regex: '^(<(gtest|gmock|isl|json)/)' 87 | Priority: 4 88 | SortPriority: 0 89 | CaseSensitive: false 90 | - Regex: '<.*\..*>' 91 | Priority: 2 92 | SortPriority: 0 93 | CaseSensitive: false 94 | - Regex: '<.*>' 95 | Priority: 3 96 | SortPriority: 0 97 | CaseSensitive: false 98 | - Regex: '".*"' 99 | Priority: 1 100 | SortPriority: 0 101 | CaseSensitive: false 102 | IncludeIsMainRegex: '(Test)?$' 103 | IncludeIsMainSourceRegex: '' 104 | IndentAccessModifiers: false 105 | IndentCaseLabels: false 106 | IndentCaseBlocks: false 107 | IndentGotoLabels: true 108 | IndentPPDirectives: None 109 | IndentExternBlock: AfterExternBlock 110 | IndentRequires: false 111 | IndentWidth: 4 112 | IndentWrappedFunctionNames: false 113 | InsertTrailingCommas: None 114 | JavaScriptQuotes: Leave 115 | JavaScriptWrapImports: true 116 | KeepEmptyLinesAtTheStartOfBlocks: true 117 | LambdaBodyIndentation: Signature 118 | MacroBlockBegin: '' 119 | MacroBlockEnd: '' 120 | MaxEmptyLinesToKeep: 1 121 | NamespaceIndentation: None 122 | ObjCBinPackProtocolList: Auto 123 | ObjCBlockIndentWidth: 2 124 | ObjCBreakBeforeNestedBlockParam: true 125 | ObjCSpaceAfterProperty: false 126 | ObjCSpaceBeforeProtocolList: true 127 | PenaltyBreakAssignment: 2 128 | PenaltyBreakBeforeFirstCallParameter: 19 129 | PenaltyBreakComment: 300 130 | PenaltyBreakFirstLessLess: 120 131 | PenaltyBreakOpenParenthesis: 0 132 | PenaltyBreakString: 1000 133 | PenaltyBreakTemplateDeclaration: 10 134 | PenaltyExcessCharacter: 1000000 135 | PenaltyReturnTypeOnItsOwnLine: 60 136 | PenaltyIndentedWhitespace: 0 137 | PointerAlignment: Left 138 | PPIndentWidth: -1 139 | ReferenceAlignment: Pointer 140 | ReflowComments: true 141 | RemoveBracesLLVM: false 142 | SeparateDefinitionBlocks: Leave 143 | ShortNamespaceLines: 1 144 | SortIncludes: CaseSensitive 145 | SortJavaStaticImport: Before 146 | SortUsingDeclarations: true 147 | SpaceAfterCStyleCast: false 148 | SpaceAfterLogicalNot: false 149 | SpaceAfterTemplateKeyword: true 150 | SpaceBeforeAssignmentOperators: true 151 | SpaceBeforeCaseColon: false 152 | SpaceBeforeCpp11BracedList: false 153 | SpaceBeforeCtorInitializerColon: true 154 | SpaceBeforeInheritanceColon: true 155 | SpaceBeforeParens: ControlStatements 156 | SpaceBeforeParensOptions: 157 | AfterControlStatements: true 158 | AfterForeachMacros: true 159 | AfterFunctionDefinitionName: false 160 | AfterFunctionDeclarationName: false 161 | AfterIfMacros: true 162 | AfterOverloadedOperator: false 163 | BeforeNonEmptyParentheses: false 164 | SpaceAroundPointerQualifiers: Default 165 | SpaceBeforeRangeBasedForLoopColon: true 166 | SpaceInEmptyBlock: false 167 | SpaceInEmptyParentheses: false 168 | SpacesBeforeTrailingComments: 1 169 | SpacesInAngles: Never 170 | SpacesInConditionalStatement: false 171 | SpacesInContainerLiterals: true 172 | SpacesInCStyleCastParentheses: false 173 | SpacesInLineCommentPrefix: 174 | Minimum: 1 175 | Maximum: -1 176 | SpacesInParentheses: false 177 | SpacesInSquareBrackets: false 178 | SpaceBeforeSquareBrackets: false 179 | BitFieldColonSpacing: Both 180 | Standard: Latest 181 | StatementAttributeLikeMacros: 182 | - Q_EMIT 183 | StatementMacros: 184 | - Q_UNUSED 185 | - QT_REQUIRE_VERSION 186 | TabWidth: 8 187 | UseCRLF: false 188 | UseTab: Never 189 | WhitespaceSensitiveMacros: 190 | - STRINGIZE 191 | - PP_STRINGIZE 192 | - BOOST_PP_STRINGIZE 193 | - NS_SWIFT_NAME 194 | - CF_SWIFT_NAME 195 | ... 196 | 197 | -------------------------------------------------------------------------------- /src/vbe/vbe.cpp: -------------------------------------------------------------------------------- 1 | // Necrowares's Video Memory Tester 2 | // Copyright (C) 2025 by Necroware 3 | // 4 | // This program is free software: you can redistribute it and/or modify 5 | // it under the terms of the GNU General Public License as published by 6 | // the Free Software Foundation, either version 3 of the License, or 7 | // (at your option) any later version. 8 | // 9 | // This program is distributed in the hope that it will be useful, 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | // GNU General Public License for more details. 13 | // 14 | // You should have received a copy of the GNU General Public License 15 | // along with this program. If not, see . 16 | 17 | #include "vbe.hpp" 18 | 19 | #include 20 | #include 21 | #include 22 | #include 23 | 24 | #include 25 | #include 26 | 27 | namespace vbe { 28 | 29 | namespace internal { 30 | 31 | class error : public std::runtime_error { 32 | public: 33 | explicit error(const std::string& msg) 34 | : std::runtime_error{"vbe: " + msg} {} 35 | }; 36 | 37 | struct __attribute__((packed)) controller_info_t { 38 | std::uint8_t signature[4]; 39 | std::uint16_t version; 40 | dpmi::farptr_t oem_string_ptr; 41 | std::uint8_t capabilities[4]; 42 | dpmi::farptr_t video_mode_ptr; 43 | std::uint16_t total_memory; 44 | std::uint16_t oem_software_rev; 45 | dpmi::farptr_t oem_vendor_name_ptr; 46 | dpmi::farptr_t oem_product_name_ptr; 47 | dpmi::farptr_t oem_product_rev_ptr; 48 | std::uint8_t reserved[222]; 49 | std::uint8_t oem_data[256]; 50 | }; 51 | 52 | struct __attribute__((packed)) mode_info_t { 53 | std::uint16_t mode_attributes; 54 | std::uint8_t win_a_attributes; 55 | std::uint8_t win_b_attributes; 56 | std::uint16_t win_granularity; 57 | std::uint16_t win_size; 58 | std::uint16_t win_a_segment; 59 | std::uint16_t win_b_segment; 60 | std::uint32_t win_func_ptr; 61 | std::uint16_t bytes_per_scanline; 62 | std::uint16_t x_resolution; 63 | std::uint16_t y_resolution; 64 | std::uint8_t x_char_size; 65 | std::uint8_t y_char_size; 66 | std::uint8_t number_of_planes; 67 | std::uint8_t bits_per_pixel; 68 | std::uint8_t number_of_banks; 69 | std::uint8_t memory_model; 70 | std::uint8_t bank_size; 71 | std::uint8_t number_of_image_pages; 72 | std::uint8_t reserved1; 73 | std::uint8_t red_mask_size; 74 | std::uint8_t red_field_position; 75 | std::uint8_t green_mask_size; 76 | std::uint8_t green_field_position; 77 | std::uint8_t blue_mask_size; 78 | std::uint8_t blue_field_position; 79 | std::uint8_t reserved_mask_size; 80 | std::uint8_t reserved_field_position; 81 | std::uint8_t direct_color_mode_info; 82 | std::uint32_t phys_base_ptr; 83 | std::uint32_t offscreen_mem_offset; 84 | std::uint16_t offscreen_mem_size; 85 | std::uint8_t reserved2[206]; 86 | }; 87 | 88 | void call(__dpmi_regs r) { 89 | if (__dpmi_int(0x10, &r) != 0 || r.x.ax != 0x004F) { 90 | throw error("Failed to get VESA info"); 91 | } 92 | } 93 | 94 | auto get_controller_info() -> const controller_info_t& { 95 | static const auto result = [] { 96 | auto info = dpmi::typed_dos_memory{}; 97 | std::memcpy(info->signature, "VBE2", 4); 98 | info.push(); 99 | __dpmi_regs r{}; 100 | r.x.ax = 0x4F00; 101 | r.x.es = info.segment(); 102 | call(r); 103 | info.pull(); 104 | if (std::memcmp(info->signature, "VESA", 4) != 0) { 105 | throw error("Invalid VESA info returned"); 106 | } 107 | if (info->version < 0x200) { 108 | throw error("Invalid VESA version"); 109 | } 110 | return info; 111 | }(); 112 | return result.get(); 113 | } 114 | 115 | auto get_mode_info(const std::uint16_t mode) { 116 | auto info = dpmi::typed_dos_memory{}; 117 | __dpmi_regs r{}; 118 | r.x.ax = 0x4F01; 119 | r.x.cx = mode; 120 | r.x.es = info.segment(); 121 | call(r); 122 | info.pull(); 123 | return info.get(); 124 | } 125 | 126 | void set_mode(std::uint16_t mode_id) { 127 | __dpmi_regs r{}; 128 | r.x.ax = 0x4F02; 129 | r.x.bx = mode_id | 0x4000; 130 | call(r); 131 | } 132 | 133 | void reset_mode() { 134 | __dpmi_regs regs = {}; 135 | regs.x.ax = 0x0003; 136 | __dpmi_int(0x10, ®s); 137 | } 138 | 139 | } // namespace internal 140 | 141 | oem_info_t get_oem_info() { 142 | const auto& info = internal::get_controller_info(); 143 | const auto read_string = [](dpmi::farptr_t addr) -> std::string { 144 | char temp[64u]; 145 | dosmemget(dpmi::to_real_addr(addr), sizeof(temp), temp); 146 | temp[sizeof(temp) - 1] = 0; 147 | return temp; 148 | }; 149 | return {read_string(info.oem_string_ptr), 150 | read_string(info.oem_vendor_name_ptr), 151 | read_string(info.oem_product_name_ptr), 152 | read_string(info.oem_product_rev_ptr)}; 153 | } 154 | 155 | std::size_t get_total_memory_size() { 156 | return internal::get_controller_info().total_memory * 64u * 1024u; 157 | } 158 | 159 | std::vector get_modes() { 160 | const auto& controller_info = internal::get_controller_info(); 161 | std::vector modes; 162 | const auto offset = dpmi::to_real_addr(controller_info.video_mode_ptr); 163 | _farsetsel(_dos_ds); 164 | for (auto i = 0u;; i += sizeof(std::uint16_t)) { 165 | const auto id = _farnspeekw(offset + i); 166 | if (id == 0xFFFF) { 167 | break; 168 | } 169 | const auto mode_info = internal::get_mode_info(id); 170 | if ((mode_info.mode_attributes & 0x01) == 0) { 171 | // list only hardware supported modes 172 | continue; 173 | } 174 | if (!(mode_info.mode_attributes & 0x80) || !mode_info.phys_base_ptr) { 175 | // select only linear frame buffer modes 176 | continue; 177 | } 178 | if (mode_info.bits_per_pixel < 8) { 179 | continue; 180 | } 181 | modes.push_back({id, mode_info.x_resolution, mode_info.y_resolution, 182 | mode_info.bits_per_pixel}); 183 | } 184 | return modes; 185 | } 186 | 187 | class framebuffer::impl { 188 | public: 189 | explicit impl(const internal::mode_info_t& mode_info) 190 | : m_mode_info{mode_info}, 191 | m_mapping{m_mode_info.phys_base_ptr, get_total_memory_size()} {} 192 | 193 | [[nodiscard]] auto selector() const { return m_mapping.selector(); } 194 | 195 | private: 196 | internal::mode_info_t m_mode_info; 197 | dpmi::physical_memory_mapping m_mapping; 198 | }; 199 | 200 | framebuffer::framebuffer(std::uint16_t mode_id) { 201 | const auto mode_info = internal::get_mode_info(mode_id); 202 | internal::set_mode(mode_id); 203 | m_pimpl = std::make_unique(std::move(mode_info)); 204 | } 205 | 206 | framebuffer::~framebuffer() { internal::reset_mode(); } 207 | framebuffer::framebuffer(framebuffer&&) noexcept = default; 208 | framebuffer& framebuffer::operator=(framebuffer&&) noexcept = default; 209 | 210 | auto framebuffer::selector() const -> int { return m_pimpl->selector(); } 211 | 212 | void framebuffer::write(std::uint32_t offset, const void* data, 213 | std::size_t size) const { 214 | const auto src_offset = reinterpret_cast(data); 215 | movedata(_my_ds(), src_offset, selector(), offset, size); 216 | } 217 | 218 | void framebuffer::read(std::uint32_t offset, void* data, 219 | std::size_t size) const { 220 | const auto dst_offset = reinterpret_cast(data); 221 | movedata(selector(), offset, _my_ds(), dst_offset, size); 222 | } 223 | 224 | } // namespace vbe 225 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------