├── .gitignore ├── default.nix ├── Makefile ├── package.json ├── .github └── workflows │ └── build.yml ├── demo └── demo.sol ├── src ├── test.t.sol └── test.sol └── LICENSE /.gitignore: -------------------------------------------------------------------------------- 1 | /.dapple 2 | /build 3 | /out 4 | /cache/ 5 | -------------------------------------------------------------------------------- /default.nix: -------------------------------------------------------------------------------- 1 | { solidityPackage, dappsys }: solidityPackage { 2 | name = "ds-test"; 3 | src = ./src; 4 | } 5 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | all:; dapp build 2 | 3 | test: 4 | -dapp --use solc:0.4.23 build 5 | -dapp --use solc:0.4.26 build 6 | -dapp --use solc:0.5.17 build 7 | -dapp --use solc:0.6.12 build 8 | -dapp --use solc:0.7.5 build 9 | 10 | demo: 11 | DAPP_SRC=demo dapp --use solc:0.7.5 build 12 | -hevm dapp-test --verbose 3 13 | 14 | .PHONY: test demo 15 | -------------------------------------------------------------------------------- /package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "ds-test", 3 | "version": "1.0.0", 4 | "description": "Assertions, equality checks and other test helpers ", 5 | "bugs": "https://github.com/dapphub/ds-test/issues", 6 | "license": "GPL-3.0", 7 | "author": "Contributors to ds-test", 8 | "files": [ 9 | "src/*" 10 | ], 11 | "repository": { 12 | "type": "git", 13 | "url": "https://github.com/dapphub/ds-test.git" 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /.github/workflows/build.yml: -------------------------------------------------------------------------------- 1 | name: "Build" 2 | on: 3 | pull_request: 4 | push: 5 | jobs: 6 | build: 7 | runs-on: ubuntu-latest 8 | steps: 9 | - uses: actions/checkout@v3 10 | - uses: cachix/install-nix-action@v20 11 | with: 12 | nix_path: nixpkgs=channel:nixos-unstable 13 | extra_nix_config: | 14 | access-tokens = github.com=${{ secrets.GITHUB_TOKEN }} 15 | 16 | - name: setup dapp binary cache 17 | uses: cachix/cachix-action@v12 18 | with: 19 | name: dapp 20 | 21 | - name: install dapptools 22 | run: nix profile install github:dapphub/dapptools#dapp --accept-flake-config 23 | 24 | - name: install foundry 25 | uses: foundry-rs/foundry-toolchain@v1 26 | 27 | - name: test with solc-0.5.17 28 | run: dapp --use solc-0.5.17 test -v 29 | 30 | - name: test with solc-0.6.11 31 | run: dapp --use solc-0.6.11 test -v 32 | 33 | - name: test with solc-0.7.6 34 | run: dapp --use solc-0.7.6 test -v 35 | 36 | - name: test with solc-0.8.18 37 | run: dapp --use solc-0.8.18 test -v 38 | 39 | - name: Run tests with foundry 40 | run: forge test -vvv 41 | 42 | -------------------------------------------------------------------------------- /demo/demo.sol: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-or-later 2 | pragma solidity >=0.5.0; 3 | 4 | import "../src/test.sol"; 5 | 6 | contract DemoTest is DSTest { 7 | function test_this() public pure { 8 | require(true); 9 | } 10 | function test_logs() public { 11 | emit log("-- log(string)"); 12 | emit log("a string"); 13 | 14 | emit log("-- log_named_uint(string, uint)"); 15 | emit log_named_uint("uint", 512); 16 | 17 | emit log("-- log_named_int(string, int)"); 18 | emit log_named_int("int", -512); 19 | 20 | emit log("-- log_named_address(string, address)"); 21 | emit log_named_address("address", address(this)); 22 | 23 | emit log("-- log_named_bytes32(string, bytes32)"); 24 | emit log_named_bytes32("bytes32", "a string"); 25 | 26 | emit log("-- log_named_bytes(string, bytes)"); 27 | emit log_named_bytes("bytes", hex"cafefe"); 28 | 29 | emit log("-- log_named_string(string, string)"); 30 | emit log_named_string("string", "a string"); 31 | 32 | emit log("-- log_named_decimal_uint(string, uint, uint)"); 33 | emit log_named_decimal_uint("decimal uint", 1.0e18, 18); 34 | 35 | emit log("-- log_named_decimal_int(string, int, uint)"); 36 | emit log_named_decimal_int("decimal int", -1.0e18, 18); 37 | } 38 | event log_old_named_uint(bytes32,uint); 39 | function test_old_logs() public { 40 | emit log_old_named_uint("key", 500); 41 | emit log_named_bytes32("bkey", "val"); 42 | } 43 | function test_trace() public view { 44 | this.echo("string 1", "string 2"); 45 | } 46 | function test_multiline() public { 47 | emit log("a multiline\\nstring"); 48 | emit log("a multiline string"); 49 | emit log_bytes("a string"); 50 | emit log_bytes("a multiline\nstring"); 51 | emit log_bytes("a multiline\\nstring"); 52 | emit logs(hex"0000"); 53 | emit log_named_bytes("0x0000", hex"0000"); 54 | emit logs(hex"ff"); 55 | } 56 | function echo(string memory s1, string memory s2) public pure 57 | returns (string memory, string memory) 58 | { 59 | return (s1, s2); 60 | } 61 | 62 | function prove_this(uint x) public { 63 | emit log_named_uint("sym x", x); 64 | assertGt(x + 1, 0); 65 | } 66 | 67 | function test_logn() public { 68 | assembly { 69 | log0(0x01, 0x02) 70 | log1(0x01, 0x02, 0x03) 71 | log2(0x01, 0x02, 0x03, 0x04) 72 | log3(0x01, 0x02, 0x03, 0x04, 0x05) 73 | } 74 | } 75 | 76 | event MyEvent(uint, uint indexed, uint, uint indexed); 77 | function test_events() public { 78 | emit MyEvent(1, 2, 3, 4); 79 | } 80 | 81 | function test_asserts() public { 82 | string memory err = "this test has failed!"; 83 | emit log("## assertTrue(bool)\n"); 84 | assertTrue(false); 85 | emit log("\n"); 86 | assertTrue(false, err); 87 | 88 | emit log("\n## assertEq(address,address)\n"); 89 | assertEq(address(this), msg.sender); 90 | emit log("\n"); 91 | assertEq(address(this), msg.sender, err); 92 | 93 | emit log("\n## assertEq32(bytes32,bytes32)\n"); 94 | assertEq32("bytes 1", "bytes 2"); 95 | emit log("\n"); 96 | assertEq32("bytes 1", "bytes 2", err); 97 | 98 | emit log("\n## assertEq(bytes32,bytes32)\n"); 99 | assertEq32("bytes 1", "bytes 2"); 100 | emit log("\n"); 101 | assertEq32("bytes 1", "bytes 2", err); 102 | 103 | emit log("\n## assertEq(uint,uint)\n"); 104 | assertEq(uint(0), 1); 105 | emit log("\n"); 106 | assertEq(uint(0), 1, err); 107 | 108 | emit log("\n## assertEq(int,int)\n"); 109 | assertEq(-1, -2); 110 | emit log("\n"); 111 | assertEq(-1, -2, err); 112 | 113 | emit log("\n## assertEqDecimal(int,int,uint)\n"); 114 | assertEqDecimal(-1.0e18, -1.1e18, 18); 115 | emit log("\n"); 116 | assertEqDecimal(-1.0e18, -1.1e18, 18, err); 117 | 118 | emit log("\n## assertEqDecimal(uint,uint,uint)\n"); 119 | assertEqDecimal(uint(1.0e18), 1.1e18, 18); 120 | emit log("\n"); 121 | assertEqDecimal(uint(1.0e18), 1.1e18, 18, err); 122 | 123 | emit log("\n## assertGt(uint,uint)\n"); 124 | assertGt(uint(0), 0); 125 | emit log("\n"); 126 | assertGt(uint(0), 0, err); 127 | 128 | emit log("\n## assertGt(int,int)\n"); 129 | assertGt(-1, -1); 130 | emit log("\n"); 131 | assertGt(-1, -1, err); 132 | 133 | emit log("\n## assertGtDecimal(int,int,uint)\n"); 134 | assertGtDecimal(-2.0e18, -1.1e18, 18); 135 | emit log("\n"); 136 | assertGtDecimal(-2.0e18, -1.1e18, 18, err); 137 | 138 | emit log("\n## assertGtDecimal(uint,uint,uint)\n"); 139 | assertGtDecimal(uint(1.0e18), 1.1e18, 18); 140 | emit log("\n"); 141 | assertGtDecimal(uint(1.0e18), 1.1e18, 18, err); 142 | 143 | emit log("\n## assertGe(uint,uint)\n"); 144 | assertGe(uint(0), 1); 145 | emit log("\n"); 146 | assertGe(uint(0), 1, err); 147 | 148 | emit log("\n## assertGe(int,int)\n"); 149 | assertGe(-1, 0); 150 | emit log("\n"); 151 | assertGe(-1, 0, err); 152 | 153 | emit log("\n## assertGeDecimal(int,int,uint)\n"); 154 | assertGeDecimal(-2.0e18, -1.1e18, 18); 155 | emit log("\n"); 156 | assertGeDecimal(-2.0e18, -1.1e18, 18, err); 157 | 158 | emit log("\n## assertGeDecimal(uint,uint,uint)\n"); 159 | assertGeDecimal(uint(1.0e18), 1.1e18, 18); 160 | emit log("\n"); 161 | assertGeDecimal(uint(1.0e18), 1.1e18, 18, err); 162 | 163 | emit log("\n## assertLt(uint,uint)\n"); 164 | assertLt(uint(0), 0); 165 | emit log("\n"); 166 | assertLt(uint(0), 0, err); 167 | 168 | emit log("\n## assertLt(int,int)\n"); 169 | assertLt(-1, -1); 170 | emit log("\n"); 171 | assertLt(-1, -1, err); 172 | 173 | emit log("\n## assertLtDecimal(int,int,uint)\n"); 174 | assertLtDecimal(-1.0e18, -1.1e18, 18); 175 | emit log("\n"); 176 | assertLtDecimal(-1.0e18, -1.1e18, 18, err); 177 | 178 | emit log("\n## assertLtDecimal(uint,uint,uint)\n"); 179 | assertLtDecimal(uint(2.0e18), 1.1e18, 18); 180 | emit log("\n"); 181 | assertLtDecimal(uint(2.0e18), 1.1e18, 18, err); 182 | 183 | emit log("\n## assertLe(uint,uint)\n"); 184 | assertLe(uint(1), 0); 185 | emit log("\n"); 186 | assertLe(uint(1), 0, err); 187 | 188 | emit log("\n## assertLe(int,int)\n"); 189 | assertLe(0, -1); 190 | emit log("\n"); 191 | assertLe(0, -1, err); 192 | 193 | emit log("\n## assertLeDecimal(int,int,uint)\n"); 194 | assertLeDecimal(-1.0e18, -1.1e18, 18); 195 | emit log("\n"); 196 | assertLeDecimal(-1.0e18, -1.1e18, 18, err); 197 | 198 | emit log("\n## assertLeDecimal(uint,uint,uint)\n"); 199 | assertLeDecimal(uint(2.0e18), 1.1e18, 18); 200 | emit log("\n"); 201 | assertLeDecimal(uint(2.0e18), 1.1e18, 18, err); 202 | 203 | emit log("\n## assertEq(string,string)\n"); 204 | string memory s1 = "string 1"; 205 | string memory s2 = "string 2"; 206 | assertEq(s1, s2); 207 | emit log("\n"); 208 | assertEq(s1, s2, err); 209 | 210 | emit log("\n## assertEq0(bytes,bytes)\n"); 211 | assertEq0(hex"abcdef01", hex"abcdef02"); 212 | emit log("\n"); 213 | assertEq0(hex"abcdef01", hex"abcdef02", err); 214 | } 215 | } 216 | 217 | contract DemoTestWithSetUp { 218 | function setUp() public { 219 | } 220 | function test_pass() public pure { 221 | } 222 | } 223 | -------------------------------------------------------------------------------- /src/test.t.sol: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-or-later 2 | pragma solidity >=0.5.0; 3 | 4 | import {DSTest} from "./test.sol"; 5 | 6 | contract DemoTest is DSTest { 7 | 8 | // --- assertTrue --- 9 | 10 | function testAssertTrue() public { 11 | assertTrue(true, "msg"); 12 | assertTrue(true); 13 | } 14 | function testFailAssertTrue() public { 15 | assertTrue(false); 16 | } 17 | function testFailAssertTrueWithMsg() public { 18 | assertTrue(false, "msg"); 19 | } 20 | 21 | // --- assertEq (Addr) --- 22 | 23 | function testAssertEqAddr() public { 24 | assertEq(address(0x0), address(0x0), "msg"); 25 | assertEq(address(0x0), address(0x0)); 26 | } 27 | function testFailAssertEqAddr() public { 28 | assertEq(address(0x0), address(0x1)); 29 | } 30 | function testFailAssertEqAddrWithMsg() public { 31 | assertEq(address(0x0), address(0x1), "msg"); 32 | } 33 | 34 | // --- assertEq (Bytes32) --- 35 | 36 | function testAssertEqBytes32() public { 37 | assertEq(bytes32("hi"), bytes32("hi"), "msg"); 38 | assertEq(bytes32("hi"), bytes32("hi")); 39 | } 40 | function testFailAssertEqBytes32() public { 41 | assertEq(bytes32("hi"), bytes32("ho")); 42 | } 43 | function testFailAssertEqBytes32WithMsg() public { 44 | assertEq(bytes32("hi"), bytes32("ho"), "msg"); 45 | } 46 | 47 | // --- assertEq (Int) --- 48 | 49 | function testAssertEqInt() public { 50 | assertEq(-1, -1, "msg"); 51 | assertEq(-1, -1); 52 | } 53 | function testFailAssertEqInt() public { 54 | assertEq(-1, -2); 55 | } 56 | function testFailAssertEqIntWithMsg() public { 57 | assertEq(-1, -2, "msg"); 58 | } 59 | 60 | // --- assertEq (UInt) --- 61 | 62 | function testAssertEqUInt() public { 63 | assertEq(uint(1), uint(1), "msg"); 64 | assertEq(uint(1), uint(1)); 65 | } 66 | function testFailAssertEqUInt() public { 67 | assertEq(uint(1), uint(2)); 68 | } 69 | function testFailAssertEqUIntWithMsg() public { 70 | assertEq(uint(1), uint(2), "msg"); 71 | } 72 | 73 | // --- assertEqDecimal (Int) --- 74 | 75 | function testAssertEqDecimalInt() public { 76 | assertEqDecimal(-1, -1, 18, "msg"); 77 | assertEqDecimal(-1, -1, 18); 78 | } 79 | function testFailAssertEqDecimalInt() public { 80 | assertEqDecimal(-1, -2, 18); 81 | } 82 | function testFailAssertEqDecimalIntWithMsg() public { 83 | assertEqDecimal(-1, -2, 18, "msg"); 84 | } 85 | 86 | // --- assertEqDecimal (UInt) --- 87 | 88 | function testAssertEqDecimalUInt() public { 89 | assertEqDecimal(uint(1), uint(1), 18, "msg"); 90 | assertEqDecimal(uint(1), uint(1), 18); 91 | } 92 | function testFailAssertEqDecimalUInt() public { 93 | assertEqDecimal(uint(1), uint(2), 18); 94 | } 95 | function testFailAssertEqDecimalUIntWithMsg() public { 96 | assertEqDecimal(uint(1), uint(2), 18, "msg"); 97 | } 98 | 99 | // --- assertNotEq (Addr) --- 100 | 101 | function testAssertNotEqAddr() public { 102 | assertNotEq(address(0x0), address(0x1), "msg"); 103 | assertNotEq(address(0x0), address(0x1)); 104 | } 105 | function testFailAssertNotEqAddr() public { 106 | assertNotEq(address(0x0), address(0x0)); 107 | } 108 | function testFailAssertNotEqAddrWithMsg() public { 109 | assertNotEq(address(0x0), address(0x0), "msg"); 110 | } 111 | 112 | // --- assertNotEq (Bytes32) --- 113 | 114 | function testAssertNotEqBytes32() public { 115 | assertNotEq(bytes32("hi"), bytes32("ho"), "msg"); 116 | assertNotEq(bytes32("hi"), bytes32("ho")); 117 | } 118 | function testFailAssertNotEqBytes32() public { 119 | assertNotEq(bytes32("hi"), bytes32("hi")); 120 | } 121 | function testFailAssertNotEqBytes32WithMsg() public { 122 | assertNotEq(bytes32("hi"), bytes32("hi"), "msg"); 123 | } 124 | 125 | // --- assertNotEq (Int) --- 126 | 127 | function testAssertNotEqInt() public { 128 | assertNotEq(-1, -2, "msg"); 129 | assertNotEq(-1, -2); 130 | } 131 | function testFailAssertNotEqInt() public { 132 | assertNotEq(-1, -1); 133 | } 134 | function testFailAssertNotEqIntWithMsg() public { 135 | assertNotEq(-1, -1, "msg"); 136 | } 137 | 138 | // --- assertNotEq (UInt) --- 139 | 140 | function testAssertNotEqUInt() public { 141 | assertNotEq(uint(1), uint(2), "msg"); 142 | assertNotEq(uint(1), uint(2)); 143 | } 144 | function testFailAssertNotEqUInt() public { 145 | assertNotEq(uint(1), uint(1)); 146 | } 147 | function testFailAssertNotEqUIntWithMsg() public { 148 | assertNotEq(uint(1), uint(1), "msg"); 149 | } 150 | 151 | // --- assertNotEqDecimal (Int) --- 152 | 153 | function testAssertNotEqDecimalInt() public { 154 | assertNotEqDecimal(-1, -2, 18, "msg"); 155 | assertNotEqDecimal(-1, -2, 18); 156 | } 157 | function testFailAssertNotEqDecimalInt() public { 158 | assertNotEqDecimal(-1, -1, 18); 159 | } 160 | function testFailAssertNotEqDecimalIntWithMsg() public { 161 | assertNotEqDecimal(-1, -1, 18, "msg"); 162 | } 163 | 164 | // --- assertNotEqDecimal (UInt) --- 165 | 166 | function testAssertNotEqDecimalUInt() public { 167 | assertNotEqDecimal(uint(1), uint(2), 18, "msg"); 168 | assertNotEqDecimal(uint(1), uint(2), 18); 169 | } 170 | function testFailAssertNotEqDecimalUInt() public { 171 | assertNotEqDecimal(uint(1), uint(1), 18); 172 | } 173 | function testFailAssertNotEqDecimalUIntWithMsg() public { 174 | assertNotEqDecimal(uint(1), uint(1), 18, "msg"); 175 | } 176 | 177 | // --- assertGt (UInt) --- 178 | 179 | function testAssertGtUInt() public { 180 | assertGt(uint(2), uint(1), "msg"); 181 | assertGt(uint(3), uint(2)); 182 | } 183 | function testFailAssertGtUInt() public { 184 | assertGt(uint(1), uint(2)); 185 | } 186 | function testFailAssertGtUIntWithMsg() public { 187 | assertGt(uint(1), uint(2), "msg"); 188 | } 189 | 190 | // --- assertGt (Int) --- 191 | 192 | function testAssertGtInt() public { 193 | assertGt(-1, -2, "msg"); 194 | assertGt(-1, -3); 195 | } 196 | function testFailAssertGtInt() public { 197 | assertGt(-2, -1); 198 | } 199 | function testFailAssertGtIntWithMsg() public { 200 | assertGt(-2, -1, "msg"); 201 | } 202 | 203 | // --- assertGtDecimal (UInt) --- 204 | 205 | function testAssertGtDecimalUInt() public { 206 | assertGtDecimal(uint(2), uint(1), 18, "msg"); 207 | assertGtDecimal(uint(3), uint(2), 18); 208 | } 209 | function testFailAssertGtDecimalUInt() public { 210 | assertGtDecimal(uint(1), uint(2), 18); 211 | } 212 | function testFailAssertGtDecimalUIntWithMsg() public { 213 | assertGtDecimal(uint(1), uint(2), 18, "msg"); 214 | } 215 | 216 | // --- assertGtDecimal (Int) --- 217 | 218 | function testAssertGtDecimalInt() public { 219 | assertGtDecimal(-1, -2, 18, "msg"); 220 | assertGtDecimal(-1, -3, 18); 221 | } 222 | function testFailAssertGtDecimalInt() public { 223 | assertGtDecimal(-2, -1, 18); 224 | } 225 | function testFailAssertGtDecimalIntWithMsg() public { 226 | assertGtDecimal(-2, -1, 18, "msg"); 227 | } 228 | 229 | // --- assertGe (UInt) --- 230 | 231 | function testAssertGeUInt() public { 232 | assertGe(uint(2), uint(1), "msg"); 233 | assertGe(uint(2), uint(2)); 234 | } 235 | function testFailAssertGeUInt() public { 236 | assertGe(uint(1), uint(2)); 237 | } 238 | function testFailAssertGeUIntWithMsg() public { 239 | assertGe(uint(1), uint(2), "msg"); 240 | } 241 | 242 | // --- assertGe (Int) --- 243 | 244 | function testAssertGeInt() public { 245 | assertGe(-1, -2, "msg"); 246 | assertGe(-1, -1); 247 | } 248 | function testFailAssertGeInt() public { 249 | assertGe(-2, -1); 250 | } 251 | function testFailAssertGeIntWithMsg() public { 252 | assertGe(-2, -1, "msg"); 253 | } 254 | 255 | // --- assertGeDecimal (UInt) --- 256 | 257 | function testAssertGeDecimalUInt() public { 258 | assertGeDecimal(uint(2), uint(1), 18, "msg"); 259 | assertGeDecimal(uint(2), uint(2), 18); 260 | } 261 | function testFailAssertGeDecimalUInt() public { 262 | assertGeDecimal(uint(1), uint(2), 18); 263 | } 264 | function testFailAssertGeDecimalUIntWithMsg() public { 265 | assertGeDecimal(uint(1), uint(2), 18, "msg"); 266 | } 267 | 268 | // --- assertGeDecimal (Int) --- 269 | 270 | function testAssertGeDecimalInt() public { 271 | assertGeDecimal(-1, -2, 18, "msg"); 272 | assertGeDecimal(-1, -2, 18); 273 | } 274 | function testFailAssertGeDecimalInt() public { 275 | assertGeDecimal(-2, -1, 18); 276 | } 277 | function testFailAssertGeDecimalIntWithMsg() public { 278 | assertGeDecimal(-2, -1, 18, "msg"); 279 | } 280 | 281 | // --- assertLt (UInt) --- 282 | 283 | function testAssertLtUInt() public { 284 | assertLt(uint(1), uint(2), "msg"); 285 | assertLt(uint(1), uint(3)); 286 | } 287 | function testFailAssertLtUInt() public { 288 | assertLt(uint(2), uint(2)); 289 | } 290 | function testFailAssertLtUIntWithMsg() public { 291 | assertLt(uint(3), uint(2), "msg"); 292 | } 293 | 294 | // --- assertLt (Int) --- 295 | 296 | function testAssertLtInt() public { 297 | assertLt(-2, -1, "msg"); 298 | assertLt(-1, 0); 299 | } 300 | function testFailAssertLtInt() public { 301 | assertLt(-1, -2); 302 | } 303 | function testFailAssertLtIntWithMsg() public { 304 | assertLt(-1, -1, "msg"); 305 | } 306 | 307 | // --- assertLtDecimal (UInt) --- 308 | 309 | function testAssertLtDecimalUInt() public { 310 | assertLtDecimal(uint(1), uint(2), 18, "msg"); 311 | assertLtDecimal(uint(2), uint(3), 18); 312 | } 313 | function testFailAssertLtDecimalUInt() public { 314 | assertLtDecimal(uint(1), uint(1), 18); 315 | } 316 | function testFailAssertLtDecimalUIntWithMsg() public { 317 | assertLtDecimal(uint(2), uint(1), 18, "msg"); 318 | } 319 | 320 | // --- assertLtDecimal (Int) --- 321 | 322 | function testAssertLtDecimalInt() public { 323 | assertLtDecimal(-2, -1, 18, "msg"); 324 | assertLtDecimal(-2, -1, 18); 325 | } 326 | function testFailAssertLtDecimalInt() public { 327 | assertLtDecimal(-2, -2, 18); 328 | } 329 | function testFailAssertLtDecimalIntWithMsg() public { 330 | assertLtDecimal(-1, -2, 18, "msg"); 331 | } 332 | 333 | // --- assertLe (UInt) --- 334 | 335 | function testAssertLeUInt() public { 336 | assertLe(uint(1), uint(2), "msg"); 337 | assertLe(uint(1), uint(1)); 338 | } 339 | function testFailAssertLeUInt() public { 340 | assertLe(uint(4), uint(2)); 341 | } 342 | function testFailAssertLeUIntWithMsg() public { 343 | assertLe(uint(3), uint(2), "msg"); 344 | } 345 | 346 | // --- assertLe (Int) --- 347 | 348 | function testAssertLeInt() public { 349 | assertLe(-2, -1, "msg"); 350 | assertLe(-1, -1); 351 | } 352 | function testFailAssertLeInt() public { 353 | assertLe(-1, -2); 354 | } 355 | function testFailAssertLeIntWithMsg() public { 356 | assertLe(-1, -3, "msg"); 357 | } 358 | 359 | // --- assertLeDecimal (UInt) --- 360 | 361 | function testAssertLeDecimalUInt() public { 362 | assertLeDecimal(uint(1), uint(2), 18, "msg"); 363 | assertLeDecimal(uint(2), uint(2), 18); 364 | } 365 | function testFailAssertLeDecimalUInt() public { 366 | assertLeDecimal(uint(1), uint(0), 18); 367 | } 368 | function testFailAssertLeDecimalUIntWithMsg() public { 369 | assertLeDecimal(uint(1), uint(0), 18, "msg"); 370 | } 371 | 372 | // --- assertLeDecimal (Int) --- 373 | 374 | function testAssertLeDecimalInt() public { 375 | assertLeDecimal(-2, -1, 18, "msg"); 376 | assertLeDecimal(-2, -2, 18); 377 | } 378 | function testFailAssertLeDecimalInt() public { 379 | assertLeDecimal(-2, -3, 18); 380 | } 381 | function testFailAssertLeDecimalIntWithMsg() public { 382 | assertLeDecimal(-1, -2, 18, "msg"); 383 | } 384 | 385 | // --- assertNotEq (String) --- 386 | 387 | function testAssertNotEqString() public { 388 | assertNotEq(new string(1), new string(2), "msg"); 389 | assertNotEq(new string(1), new string(2)); 390 | } 391 | function testFailAssertNotEqString() public { 392 | assertNotEq(new string(1), new string(1)); 393 | } 394 | function testFailAssertNotEqStringWithMsg() public { 395 | assertNotEq(new string(1), new string(1), "msg"); 396 | } 397 | 398 | // --- assertNotEq0 (Bytes) --- 399 | 400 | function testAssertNotEq0Bytes() public { 401 | assertNotEq0(bytes("hi"), bytes("ho"), "msg"); 402 | assertNotEq0(bytes("hi"), bytes("ho")); 403 | } 404 | function testFailAssertNotEq0Bytes() public { 405 | assertNotEq0(bytes("hi"), bytes("hi")); 406 | } 407 | function testFailAssertNotEq0BytesWithMsg() public { 408 | assertNotEq0(bytes("hi"), bytes("hi"), "msg"); 409 | } 410 | 411 | // --- fail override --- 412 | 413 | // ensure that fail can be overridden 414 | function fail() internal override { 415 | super.fail(); 416 | } 417 | } 418 | -------------------------------------------------------------------------------- /src/test.sol: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-or-later 2 | 3 | // This program is free software: you can redistribute it and/or modify 4 | // it under the terms of the GNU General Public License as published by 5 | // the Free Software Foundation, either version 3 of the License, or 6 | // (at your option) any later version. 7 | 8 | // This program is distributed in the hope that it will be useful, 9 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 10 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 11 | // GNU General Public License for more details. 12 | 13 | // You should have received a copy of the GNU General Public License 14 | // along with this program. If not, see . 15 | 16 | pragma solidity >=0.5.0; 17 | 18 | contract DSTest { 19 | event log (string); 20 | event logs (bytes); 21 | 22 | event log_address (address); 23 | event log_bytes32 (bytes32); 24 | event log_int (int); 25 | event log_uint (uint); 26 | event log_bytes (bytes); 27 | event log_string (string); 28 | 29 | event log_named_address (string key, address val); 30 | event log_named_bytes32 (string key, bytes32 val); 31 | event log_named_decimal_int (string key, int val, uint decimals); 32 | event log_named_decimal_uint (string key, uint val, uint decimals); 33 | event log_named_int (string key, int val); 34 | event log_named_uint (string key, uint val); 35 | event log_named_bytes (string key, bytes val); 36 | event log_named_string (string key, string val); 37 | 38 | bool public IS_TEST = true; 39 | bool private _failed; 40 | 41 | address constant HEVM_ADDRESS = 42 | address(bytes20(uint160(uint256(keccak256('hevm cheat code'))))); 43 | 44 | modifier mayRevert() { _; } 45 | modifier testopts(string memory) { _; } 46 | 47 | function failed() public returns (bool) { 48 | if (_failed) { 49 | return _failed; 50 | } else { 51 | bool globalFailed = false; 52 | if (hasHEVMContext()) { 53 | (, bytes memory retdata) = HEVM_ADDRESS.call( 54 | abi.encodePacked( 55 | bytes4(keccak256("load(address,bytes32)")), 56 | abi.encode(HEVM_ADDRESS, bytes32("failed")) 57 | ) 58 | ); 59 | globalFailed = abi.decode(retdata, (bool)); 60 | } 61 | return globalFailed; 62 | } 63 | } 64 | 65 | function fail() internal virtual { 66 | if (hasHEVMContext()) { 67 | (bool status, ) = HEVM_ADDRESS.call( 68 | abi.encodePacked( 69 | bytes4(keccak256("store(address,bytes32,bytes32)")), 70 | abi.encode(HEVM_ADDRESS, bytes32("failed"), bytes32(uint256(0x01))) 71 | ) 72 | ); 73 | status; // Silence compiler warnings 74 | } 75 | _failed = true; 76 | } 77 | 78 | function hasHEVMContext() internal view returns (bool) { 79 | uint256 hevmCodeSize = 0; 80 | assembly { 81 | hevmCodeSize := extcodesize(0x7109709ECfa91a80626fF3989D68f67F5b1DD12D) 82 | } 83 | return hevmCodeSize > 0; 84 | } 85 | 86 | modifier logs_gas() { 87 | uint startGas = gasleft(); 88 | _; 89 | uint endGas = gasleft(); 90 | emit log_named_uint("gas", startGas - endGas); 91 | } 92 | 93 | function assertTrue(bool condition) internal { 94 | if (!condition) { 95 | emit log("Error: Assertion Failed"); 96 | fail(); 97 | } 98 | } 99 | 100 | function assertTrue(bool condition, string memory err) internal { 101 | if (!condition) { 102 | emit log_named_string("Error", err); 103 | assertTrue(condition); 104 | } 105 | } 106 | 107 | function assertEq(address a, address b) internal { 108 | if (a != b) { 109 | emit log("Error: a == b not satisfied [address]"); 110 | emit log_named_address(" Left", a); 111 | emit log_named_address(" Right", b); 112 | fail(); 113 | } 114 | } 115 | function assertEq(address a, address b, string memory err) internal { 116 | if (a != b) { 117 | emit log_named_string ("Error", err); 118 | assertEq(a, b); 119 | } 120 | } 121 | 122 | function assertEq(bytes32 a, bytes32 b) internal { 123 | if (a != b) { 124 | emit log("Error: a == b not satisfied [bytes32]"); 125 | emit log_named_bytes32(" Left", a); 126 | emit log_named_bytes32(" Right", b); 127 | fail(); 128 | } 129 | } 130 | function assertEq(bytes32 a, bytes32 b, string memory err) internal { 131 | if (a != b) { 132 | emit log_named_string ("Error", err); 133 | assertEq(a, b); 134 | } 135 | } 136 | function assertEq32(bytes32 a, bytes32 b) internal { 137 | assertEq(a, b); 138 | } 139 | function assertEq32(bytes32 a, bytes32 b, string memory err) internal { 140 | assertEq(a, b, err); 141 | } 142 | 143 | function assertEq(int a, int b) internal { 144 | if (a != b) { 145 | emit log("Error: a == b not satisfied [int]"); 146 | emit log_named_int(" Left", a); 147 | emit log_named_int(" Right", b); 148 | fail(); 149 | } 150 | } 151 | function assertEq(int a, int b, string memory err) internal { 152 | if (a != b) { 153 | emit log_named_string("Error", err); 154 | assertEq(a, b); 155 | } 156 | } 157 | function assertEq(uint a, uint b) internal { 158 | if (a != b) { 159 | emit log("Error: a == b not satisfied [uint]"); 160 | emit log_named_uint(" Left", a); 161 | emit log_named_uint(" Right", b); 162 | fail(); 163 | } 164 | } 165 | function assertEq(uint a, uint b, string memory err) internal { 166 | if (a != b) { 167 | emit log_named_string("Error", err); 168 | assertEq(a, b); 169 | } 170 | } 171 | function assertEqDecimal(int a, int b, uint decimals) internal { 172 | if (a != b) { 173 | emit log("Error: a == b not satisfied [decimal int]"); 174 | emit log_named_decimal_int(" Left", a, decimals); 175 | emit log_named_decimal_int(" Right", b, decimals); 176 | fail(); 177 | } 178 | } 179 | function assertEqDecimal(int a, int b, uint decimals, string memory err) internal { 180 | if (a != b) { 181 | emit log_named_string("Error", err); 182 | assertEqDecimal(a, b, decimals); 183 | } 184 | } 185 | function assertEqDecimal(uint a, uint b, uint decimals) internal { 186 | if (a != b) { 187 | emit log("Error: a == b not satisfied [decimal uint]"); 188 | emit log_named_decimal_uint(" Left", a, decimals); 189 | emit log_named_decimal_uint(" Right", b, decimals); 190 | fail(); 191 | } 192 | } 193 | function assertEqDecimal(uint a, uint b, uint decimals, string memory err) internal { 194 | if (a != b) { 195 | emit log_named_string("Error", err); 196 | assertEqDecimal(a, b, decimals); 197 | } 198 | } 199 | 200 | function assertNotEq(address a, address b) internal { 201 | if (a == b) { 202 | emit log("Error: a != b not satisfied [address]"); 203 | emit log_named_address(" Left", a); 204 | emit log_named_address(" Right", b); 205 | fail(); 206 | } 207 | } 208 | function assertNotEq(address a, address b, string memory err) internal { 209 | if (a == b) { 210 | emit log_named_string ("Error", err); 211 | assertNotEq(a, b); 212 | } 213 | } 214 | 215 | function assertNotEq(bytes32 a, bytes32 b) internal { 216 | if (a == b) { 217 | emit log("Error: a != b not satisfied [bytes32]"); 218 | emit log_named_bytes32(" Left", a); 219 | emit log_named_bytes32(" Right", b); 220 | fail(); 221 | } 222 | } 223 | function assertNotEq(bytes32 a, bytes32 b, string memory err) internal { 224 | if (a == b) { 225 | emit log_named_string ("Error", err); 226 | assertNotEq(a, b); 227 | } 228 | } 229 | function assertNotEq32(bytes32 a, bytes32 b) internal { 230 | assertNotEq(a, b); 231 | } 232 | function assertNotEq32(bytes32 a, bytes32 b, string memory err) internal { 233 | assertNotEq(a, b, err); 234 | } 235 | 236 | function assertNotEq(int a, int b) internal { 237 | if (a == b) { 238 | emit log("Error: a != b not satisfied [int]"); 239 | emit log_named_int(" Left", a); 240 | emit log_named_int(" Right", b); 241 | fail(); 242 | } 243 | } 244 | function assertNotEq(int a, int b, string memory err) internal { 245 | if (a == b) { 246 | emit log_named_string("Error", err); 247 | assertNotEq(a, b); 248 | } 249 | } 250 | function assertNotEq(uint a, uint b) internal { 251 | if (a == b) { 252 | emit log("Error: a != b not satisfied [uint]"); 253 | emit log_named_uint(" Left", a); 254 | emit log_named_uint(" Right", b); 255 | fail(); 256 | } 257 | } 258 | function assertNotEq(uint a, uint b, string memory err) internal { 259 | if (a == b) { 260 | emit log_named_string("Error", err); 261 | assertNotEq(a, b); 262 | } 263 | } 264 | function assertNotEqDecimal(int a, int b, uint decimals) internal { 265 | if (a == b) { 266 | emit log("Error: a != b not satisfied [decimal int]"); 267 | emit log_named_decimal_int(" Left", a, decimals); 268 | emit log_named_decimal_int(" Right", b, decimals); 269 | fail(); 270 | } 271 | } 272 | function assertNotEqDecimal(int a, int b, uint decimals, string memory err) internal { 273 | if (a == b) { 274 | emit log_named_string("Error", err); 275 | assertNotEqDecimal(a, b, decimals); 276 | } 277 | } 278 | function assertNotEqDecimal(uint a, uint b, uint decimals) internal { 279 | if (a == b) { 280 | emit log("Error: a != b not satisfied [decimal uint]"); 281 | emit log_named_decimal_uint(" Left", a, decimals); 282 | emit log_named_decimal_uint(" Right", b, decimals); 283 | fail(); 284 | } 285 | } 286 | function assertNotEqDecimal(uint a, uint b, uint decimals, string memory err) internal { 287 | if (a == b) { 288 | emit log_named_string("Error", err); 289 | assertNotEqDecimal(a, b, decimals); 290 | } 291 | } 292 | 293 | function assertGt(uint a, uint b) internal { 294 | if (a <= b) { 295 | emit log("Error: a > b not satisfied [uint]"); 296 | emit log_named_uint(" Value a", a); 297 | emit log_named_uint(" Value b", b); 298 | fail(); 299 | } 300 | } 301 | function assertGt(uint a, uint b, string memory err) internal { 302 | if (a <= b) { 303 | emit log_named_string("Error", err); 304 | assertGt(a, b); 305 | } 306 | } 307 | function assertGt(int a, int b) internal { 308 | if (a <= b) { 309 | emit log("Error: a > b not satisfied [int]"); 310 | emit log_named_int(" Value a", a); 311 | emit log_named_int(" Value b", b); 312 | fail(); 313 | } 314 | } 315 | function assertGt(int a, int b, string memory err) internal { 316 | if (a <= b) { 317 | emit log_named_string("Error", err); 318 | assertGt(a, b); 319 | } 320 | } 321 | function assertGtDecimal(int a, int b, uint decimals) internal { 322 | if (a <= b) { 323 | emit log("Error: a > b not satisfied [decimal int]"); 324 | emit log_named_decimal_int(" Value a", a, decimals); 325 | emit log_named_decimal_int(" Value b", b, decimals); 326 | fail(); 327 | } 328 | } 329 | function assertGtDecimal(int a, int b, uint decimals, string memory err) internal { 330 | if (a <= b) { 331 | emit log_named_string("Error", err); 332 | assertGtDecimal(a, b, decimals); 333 | } 334 | } 335 | function assertGtDecimal(uint a, uint b, uint decimals) internal { 336 | if (a <= b) { 337 | emit log("Error: a > b not satisfied [decimal uint]"); 338 | emit log_named_decimal_uint(" Value a", a, decimals); 339 | emit log_named_decimal_uint(" Value b", b, decimals); 340 | fail(); 341 | } 342 | } 343 | function assertGtDecimal(uint a, uint b, uint decimals, string memory err) internal { 344 | if (a <= b) { 345 | emit log_named_string("Error", err); 346 | assertGtDecimal(a, b, decimals); 347 | } 348 | } 349 | 350 | function assertGe(uint a, uint b) internal { 351 | if (a < b) { 352 | emit log("Error: a >= b not satisfied [uint]"); 353 | emit log_named_uint(" Value a", a); 354 | emit log_named_uint(" Value b", b); 355 | fail(); 356 | } 357 | } 358 | function assertGe(uint a, uint b, string memory err) internal { 359 | if (a < b) { 360 | emit log_named_string("Error", err); 361 | assertGe(a, b); 362 | } 363 | } 364 | function assertGe(int a, int b) internal { 365 | if (a < b) { 366 | emit log("Error: a >= b not satisfied [int]"); 367 | emit log_named_int(" Value a", a); 368 | emit log_named_int(" Value b", b); 369 | fail(); 370 | } 371 | } 372 | function assertGe(int a, int b, string memory err) internal { 373 | if (a < b) { 374 | emit log_named_string("Error", err); 375 | assertGe(a, b); 376 | } 377 | } 378 | function assertGeDecimal(int a, int b, uint decimals) internal { 379 | if (a < b) { 380 | emit log("Error: a >= b not satisfied [decimal int]"); 381 | emit log_named_decimal_int(" Value a", a, decimals); 382 | emit log_named_decimal_int(" Value b", b, decimals); 383 | fail(); 384 | } 385 | } 386 | function assertGeDecimal(int a, int b, uint decimals, string memory err) internal { 387 | if (a < b) { 388 | emit log_named_string("Error", err); 389 | assertGeDecimal(a, b, decimals); 390 | } 391 | } 392 | function assertGeDecimal(uint a, uint b, uint decimals) internal { 393 | if (a < b) { 394 | emit log("Error: a >= b not satisfied [decimal uint]"); 395 | emit log_named_decimal_uint(" Value a", a, decimals); 396 | emit log_named_decimal_uint(" Value b", b, decimals); 397 | fail(); 398 | } 399 | } 400 | function assertGeDecimal(uint a, uint b, uint decimals, string memory err) internal { 401 | if (a < b) { 402 | emit log_named_string("Error", err); 403 | assertGeDecimal(a, b, decimals); 404 | } 405 | } 406 | 407 | function assertLt(uint a, uint b) internal { 408 | if (a >= b) { 409 | emit log("Error: a < b not satisfied [uint]"); 410 | emit log_named_uint(" Value a", a); 411 | emit log_named_uint(" Value b", b); 412 | fail(); 413 | } 414 | } 415 | function assertLt(uint a, uint b, string memory err) internal { 416 | if (a >= b) { 417 | emit log_named_string("Error", err); 418 | assertLt(a, b); 419 | } 420 | } 421 | function assertLt(int a, int b) internal { 422 | if (a >= b) { 423 | emit log("Error: a < b not satisfied [int]"); 424 | emit log_named_int(" Value a", a); 425 | emit log_named_int(" Value b", b); 426 | fail(); 427 | } 428 | } 429 | function assertLt(int a, int b, string memory err) internal { 430 | if (a >= b) { 431 | emit log_named_string("Error", err); 432 | assertLt(a, b); 433 | } 434 | } 435 | function assertLtDecimal(int a, int b, uint decimals) internal { 436 | if (a >= b) { 437 | emit log("Error: a < b not satisfied [decimal int]"); 438 | emit log_named_decimal_int(" Value a", a, decimals); 439 | emit log_named_decimal_int(" Value b", b, decimals); 440 | fail(); 441 | } 442 | } 443 | function assertLtDecimal(int a, int b, uint decimals, string memory err) internal { 444 | if (a >= b) { 445 | emit log_named_string("Error", err); 446 | assertLtDecimal(a, b, decimals); 447 | } 448 | } 449 | function assertLtDecimal(uint a, uint b, uint decimals) internal { 450 | if (a >= b) { 451 | emit log("Error: a < b not satisfied [decimal uint]"); 452 | emit log_named_decimal_uint(" Value a", a, decimals); 453 | emit log_named_decimal_uint(" Value b", b, decimals); 454 | fail(); 455 | } 456 | } 457 | function assertLtDecimal(uint a, uint b, uint decimals, string memory err) internal { 458 | if (a >= b) { 459 | emit log_named_string("Error", err); 460 | assertLtDecimal(a, b, decimals); 461 | } 462 | } 463 | 464 | function assertLe(uint a, uint b) internal { 465 | if (a > b) { 466 | emit log("Error: a <= b not satisfied [uint]"); 467 | emit log_named_uint(" Value a", a); 468 | emit log_named_uint(" Value b", b); 469 | fail(); 470 | } 471 | } 472 | function assertLe(uint a, uint b, string memory err) internal { 473 | if (a > b) { 474 | emit log_named_string("Error", err); 475 | assertLe(a, b); 476 | } 477 | } 478 | function assertLe(int a, int b) internal { 479 | if (a > b) { 480 | emit log("Error: a <= b not satisfied [int]"); 481 | emit log_named_int(" Value a", a); 482 | emit log_named_int(" Value b", b); 483 | fail(); 484 | } 485 | } 486 | function assertLe(int a, int b, string memory err) internal { 487 | if (a > b) { 488 | emit log_named_string("Error", err); 489 | assertLe(a, b); 490 | } 491 | } 492 | function assertLeDecimal(int a, int b, uint decimals) internal { 493 | if (a > b) { 494 | emit log("Error: a <= b not satisfied [decimal int]"); 495 | emit log_named_decimal_int(" Value a", a, decimals); 496 | emit log_named_decimal_int(" Value b", b, decimals); 497 | fail(); 498 | } 499 | } 500 | function assertLeDecimal(int a, int b, uint decimals, string memory err) internal { 501 | if (a > b) { 502 | emit log_named_string("Error", err); 503 | assertLeDecimal(a, b, decimals); 504 | } 505 | } 506 | function assertLeDecimal(uint a, uint b, uint decimals) internal { 507 | if (a > b) { 508 | emit log("Error: a <= b not satisfied [decimal uint]"); 509 | emit log_named_decimal_uint(" Value a", a, decimals); 510 | emit log_named_decimal_uint(" Value b", b, decimals); 511 | fail(); 512 | } 513 | } 514 | function assertLeDecimal(uint a, uint b, uint decimals, string memory err) internal { 515 | if (a > b) { 516 | emit log_named_string("Error", err); 517 | assertLeDecimal(a, b, decimals); 518 | } 519 | } 520 | 521 | function assertEq(string memory a, string memory b) internal { 522 | if (keccak256(abi.encodePacked(a)) != keccak256(abi.encodePacked(b))) { 523 | emit log("Error: a == b not satisfied [string]"); 524 | emit log_named_string(" Left", a); 525 | emit log_named_string(" Right", b); 526 | fail(); 527 | } 528 | } 529 | function assertEq(string memory a, string memory b, string memory err) internal { 530 | if (keccak256(abi.encodePacked(a)) != keccak256(abi.encodePacked(b))) { 531 | emit log_named_string("Error", err); 532 | assertEq(a, b); 533 | } 534 | } 535 | 536 | function assertNotEq(string memory a, string memory b) internal { 537 | if (keccak256(abi.encodePacked(a)) == keccak256(abi.encodePacked(b))) { 538 | emit log("Error: a != b not satisfied [string]"); 539 | emit log_named_string(" Left", a); 540 | emit log_named_string(" Right", b); 541 | fail(); 542 | } 543 | } 544 | function assertNotEq(string memory a, string memory b, string memory err) internal { 545 | if (keccak256(abi.encodePacked(a)) == keccak256(abi.encodePacked(b))) { 546 | emit log_named_string("Error", err); 547 | assertNotEq(a, b); 548 | } 549 | } 550 | 551 | function checkEq0(bytes memory a, bytes memory b) internal pure returns (bool ok) { 552 | ok = true; 553 | if (a.length == b.length) { 554 | for (uint i = 0; i < a.length; i++) { 555 | if (a[i] != b[i]) { 556 | ok = false; 557 | } 558 | } 559 | } else { 560 | ok = false; 561 | } 562 | } 563 | function assertEq0(bytes memory a, bytes memory b) internal { 564 | if (!checkEq0(a, b)) { 565 | emit log("Error: a == b not satisfied [bytes]"); 566 | emit log_named_bytes(" Left", a); 567 | emit log_named_bytes(" Right", b); 568 | fail(); 569 | } 570 | } 571 | function assertEq0(bytes memory a, bytes memory b, string memory err) internal { 572 | if (!checkEq0(a, b)) { 573 | emit log_named_string("Error", err); 574 | assertEq0(a, b); 575 | } 576 | } 577 | 578 | function assertNotEq0(bytes memory a, bytes memory b) internal { 579 | if (checkEq0(a, b)) { 580 | emit log("Error: a != b not satisfied [bytes]"); 581 | emit log_named_bytes(" Left", a); 582 | emit log_named_bytes(" Right", b); 583 | fail(); 584 | } 585 | } 586 | function assertNotEq0(bytes memory a, bytes memory b, string memory err) internal { 587 | if (checkEq0(a, b)) { 588 | emit log_named_string("Error", err); 589 | assertNotEq0(a, b); 590 | } 591 | } 592 | } 593 | -------------------------------------------------------------------------------- /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 | --------------------------------------------------------------------------------