├── src ├── fetcher │ ├── mod.rs │ └── events │ │ ├── visitor.rs │ │ └── mod.rs ├── transformations │ ├── mod.rs │ └── memory │ │ ├── mod.rs │ │ ├── visitors.rs │ │ ├── memory_encryption.rs │ │ └── memory_transformer.rs └── main.rs ├── .gitignore ├── assets ├── input.wasm └── vm_input.wasm ├── Cargo.toml ├── .github └── workflows │ ├── ci.yml │ └── binaries.yml ├── README.md └── LICENSE /src/fetcher/mod.rs: -------------------------------------------------------------------------------- 1 | pub mod events; -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | /target 2 | /.idea 3 | /Cargo.lock -------------------------------------------------------------------------------- /assets/input.wasm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/munew/hcaptcha-wasm-deobfuscator/HEAD/assets/input.wasm -------------------------------------------------------------------------------- /assets/vm_input.wasm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/munew/hcaptcha-wasm-deobfuscator/HEAD/assets/vm_input.wasm -------------------------------------------------------------------------------- /src/transformations/mod.rs: -------------------------------------------------------------------------------- 1 | pub mod memory; 2 | 3 | use walrus::Module; 4 | 5 | pub trait Transformer { 6 | fn transform(&mut self, module: &mut Module); 7 | } -------------------------------------------------------------------------------- /Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "hcaptcha-wasm-deobfuscator" 3 | version = "0.1.0" 4 | edition = "2024" 5 | 6 | [dependencies] 7 | walrus = "0.23.3" 8 | anyhow = "1.0.98" -------------------------------------------------------------------------------- /src/transformations/memory/mod.rs: -------------------------------------------------------------------------------- 1 | pub mod memory_transformer; 2 | mod visitors; 3 | mod memory_encryption; 4 | 5 | #[derive(Eq, PartialEq, Hash, Debug)] 6 | enum MemEncFuncType { 7 | Unsigned8, // 1 byte 8 | Unsigned16, // 2 bytes 9 | // Unsigned32, // 4 bytes 10 | // Unsigned64, // don't think it exists 11 | Signed8, // 1 byte 12 | Signed16, // 2 bytes 13 | Signed32, // 4 bytes 14 | Signed64, // 8 bytes 15 | 16 | Float32, 17 | Float64, 18 | } -------------------------------------------------------------------------------- /src/fetcher/events/visitor.rs: -------------------------------------------------------------------------------- 1 | use walrus::ir::{dfs_in_order, Const, Value, Visitor}; 2 | use walrus::LocalFunction; 3 | 4 | struct I32ConstCollector { 5 | collected_consts: Vec, 6 | } 7 | 8 | impl<'a> Visitor<'a> for I32ConstCollector { 9 | fn visit_const(&mut self, instr: &Const) { 10 | if let Value::I32(i) = &instr.value { 11 | self.collected_consts.push(*i); 12 | } 13 | } 14 | } 15 | 16 | pub fn collect_i32_consts(local: &LocalFunction) -> Vec { 17 | let mut visitor = I32ConstCollector { collected_consts: vec![] }; 18 | dfs_in_order(&mut visitor, local, local.entry_block()); 19 | visitor.collected_consts 20 | } -------------------------------------------------------------------------------- /.github/workflows/ci.yml: -------------------------------------------------------------------------------- 1 | name: Rust CI 2 | 3 | on: 4 | push: 5 | branches: [master] 6 | pull_request: 7 | branches: [master] 8 | 9 | jobs: 10 | build-and-test: 11 | runs-on: ubuntu-latest 12 | 13 | steps: 14 | - name: Checkout code 15 | uses: actions/checkout@v3 16 | 17 | - name: Install Rust 18 | uses: actions-rs/toolchain@v1 19 | with: 20 | toolchain: stable 21 | override: true 22 | 23 | - name: Cache Cargo registry 24 | uses: actions/cache@v3 25 | with: 26 | path: | 27 | ~/.cargo/registry 28 | ~/.cargo/git 29 | key: ${{ runner.os }}-cargo-registry-${{ hashFiles('**/Cargo.lock') }} 30 | restore-keys: | 31 | ${{ runner.os }}-cargo-registry- 32 | 33 | - name: Cache build artifacts 34 | uses: actions/cache@v3 35 | with: 36 | path: target 37 | key: ${{ runner.os }}-target-${{ hashFiles('**/Cargo.lock') }} 38 | restore-keys: | 39 | ${{ runner.os }}-target- 40 | 41 | - name: Build project 42 | run: cargo build --verbose 43 | 44 | - name: Run tests 45 | run: cargo test --verbose -------------------------------------------------------------------------------- /src/main.rs: -------------------------------------------------------------------------------- 1 | mod fetcher; 2 | mod transformations; 3 | 4 | // use crate::fetcher::events::fetch_events; 5 | use crate::transformations::memory::memory_transformer::MemoryTransformer; 6 | use crate::transformations::Transformer; 7 | use std::env; 8 | use std::path::Path; 9 | use std::time::Instant; 10 | use walrus::Module; 11 | 12 | fn main() -> Result<(), Box> { 13 | let args: Vec = env::args().collect(); 14 | 15 | let input = Path::new( 16 | args.get(1) 17 | .map(|s| s.as_str()) 18 | .unwrap_or("./assets/input.wasm"), 19 | ); 20 | 21 | let output = Path::new( 22 | args.get(2) 23 | .map(|s| s.as_str()) 24 | .unwrap_or("./assets/output.wasm"), 25 | ); 26 | 27 | if !input.exists() { 28 | panic!("Input file does not exist"); 29 | } 30 | 31 | let t = Instant::now(); 32 | let mut module = Module::from_file(input).map_err(|e| format!("{:?}", e))?; 33 | 34 | let mut transformers = vec![MemoryTransformer {}]; 35 | 36 | for transformer in transformers.iter_mut() { 37 | transformer.transform(&mut module); 38 | } 39 | 40 | // let events = fetch_events(&mut module)?; 41 | // println!("{:?}", events); 42 | 43 | println!("Took {:?}", t.elapsed()); 44 | module.emit_wasm_file(output)?; 45 | 46 | Ok(()) 47 | } 48 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # hCaptcha WASM deobfuscator & fetcher 2 | 3 | ## Important 4 | - hCaptcha appears to randomly choose between XOR and ChaCha20 for memory encryption. Only XOR is currently supported—ChaCha20 is not yet implemented. 5 | - The output WASM is fully runnable, but you must comment out the memory block initialization call in the JS. 6 | 7 | ## Required JS modification 8 | ```js 9 | Af.then(function(OE) { 10 | return function(OE, hW) { 11 | return new Promise(function(vk, hn) { 12 | WebAssembly.instantiate(OE, hW).then(function(hW) { 13 | if (!hW || !hW.exports) 14 | throw new Error("Failed to instantiate"); 15 | hW instanceof WebAssembly.Instance ? vk({ 16 | instance: hW, 17 | module: OE 18 | }) : vk(hW) 19 | }).catch(function(OE) { 20 | return hn(OE) 21 | }) 22 | } 23 | ) 24 | }(OE, { 25 | a: sf 26 | }) 27 | }).then(function(hW) { 28 | !function(OE) { 29 | qy = OE; 30 | for (hW = Math[N_(332)]((qy.vb[N_(333)][N_(334)] - qi) / rR), 31 | vk = 0, 32 | void 0; vk < hW; vk++) { 33 | var hW; 34 | var vk; 35 | // qy.Ab(vk) <-- COMMENT THIS 36 | } 37 | }(hW.instance.exports), 38 | OE() 39 | }).catch(function(OE) { 40 | return hW(OE) 41 | }) 42 | ``` 43 | 44 | ## Features 45 | - Revert memory encryption (xor) 46 | - Fetch events string 47 | 48 | ## Dependencies 49 | - [Walrus](https://github.com/rustwasm/walrus) - WASM transformations 50 | - [anyhow](https://github.com/dtolnay/anyhow) - Error handling -------------------------------------------------------------------------------- /.github/workflows/binaries.yml: -------------------------------------------------------------------------------- 1 | name: Build Binaries 2 | 3 | on: 4 | push: 5 | tags: 6 | - 'v*' 7 | workflow_dispatch: 8 | 9 | jobs: 10 | build: 11 | runs-on: ${{ matrix.os }} 12 | strategy: 13 | matrix: 14 | include: 15 | - os: ubuntu-latest 16 | name: linux-amd64 17 | target: x86_64-unknown-linux-gnu 18 | 19 | - os: windows-latest 20 | name: windows-amd64 21 | target: x86_64-pc-windows-msvc 22 | 23 | steps: 24 | - name: Checkout code 25 | uses: actions/checkout@v3 26 | 27 | - name: Install Rust 28 | uses: actions-rs/toolchain@v1 29 | with: 30 | toolchain: stable 31 | target: ${{ matrix.target }} 32 | override: true 33 | 34 | - name: Build release binary 35 | run: cargo build --release --target ${{ matrix.target }} 36 | 37 | - name: Prepare artifacts 38 | run: | 39 | mkdir -p artifacts 40 | if [[ "${{ matrix.os }}" == "windows-latest" ]]; then 41 | cp target/${{ matrix.target }}/release/${{ github.event.repository.name }}.exe artifacts/${{ github.event.repository.name }}-${{ matrix.name }}.exe 42 | else 43 | cp target/${{ matrix.target }}/release/${{ github.event.repository.name }} artifacts/${{ github.event.repository.name }}-${{ matrix.name }} 44 | fi 45 | shell: bash 46 | 47 | - name: Upload artifact 48 | uses: actions/upload-artifact@v4 49 | with: 50 | name: ${{ github.event.repository.name }}-${{ matrix.name }} 51 | path: artifacts/* 52 | 53 | release: 54 | if: startsWith(github.ref, 'refs/tags/') 55 | needs: build 56 | runs-on: ubuntu-latest 57 | steps: 58 | - name: Download all artifacts 59 | uses: actions/download-artifact@v4 60 | with: 61 | path: artifacts 62 | 63 | - name: Create Release and Upload Binaries 64 | uses: softprops/action-gh-release@v2 65 | env: 66 | GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }} 67 | with: 68 | files: artifacts/**/* -------------------------------------------------------------------------------- /src/transformations/memory/visitors.rs: -------------------------------------------------------------------------------- 1 | use walrus::ir::{dfs_in_order, BinaryOp, Binop, Const, Load, Store, StoreKind, Value, Visitor}; 2 | use walrus::LocalFunction; 3 | use crate::transformations::memory::MemEncFuncType; 4 | 5 | #[derive(Default)] 6 | pub struct LoadMemoryFuncMapper { 7 | has_load: bool, 8 | 9 | has_16_bits_mask: bool, 10 | has_8_bits_mask: bool, 11 | has_24_bits_shl: bool, 12 | has_right_shift_signed: bool, 13 | has_left_shift: bool, 14 | } 15 | 16 | impl LoadMemoryFuncMapper { 17 | pub fn map(&mut self, local: &LocalFunction) -> Option { 18 | dfs_in_order(self, local, local.entry_block()); 19 | if !self.has_load { 20 | return None; 21 | } 22 | 23 | if self.has_left_shift && self.has_24_bits_shl { 24 | return Some(MemEncFuncType::Signed8); 25 | } 26 | 27 | if self.has_right_shift_signed { 28 | if self.has_16_bits_mask { 29 | return Some(MemEncFuncType::Signed16); 30 | } else if self.has_8_bits_mask { 31 | return Some(MemEncFuncType::Signed8); 32 | } 33 | } else { 34 | if self.has_16_bits_mask { 35 | return Some(MemEncFuncType::Unsigned16); 36 | } else if self.has_8_bits_mask { 37 | return Some(MemEncFuncType::Unsigned8); 38 | } 39 | } 40 | 41 | Some(MemEncFuncType::Signed32) 42 | } 43 | } 44 | 45 | impl<'a> Visitor<'a> for LoadMemoryFuncMapper { 46 | fn visit_const(&mut self, instr: &Const) { 47 | match instr.value { 48 | Value::I32(i) => { 49 | if i == 65535 { 50 | self.has_16_bits_mask = true; 51 | } 52 | 53 | if i == 24 { 54 | self.has_24_bits_shl = true; 55 | } 56 | 57 | if i == 255 { 58 | self.has_8_bits_mask = true; 59 | } 60 | } 61 | _ => {} 62 | } 63 | } 64 | 65 | fn visit_binop(&mut self, instr: &Binop) { 66 | match instr.op { 67 | BinaryOp::I32ShrS => { 68 | self.has_right_shift_signed = true; 69 | } 70 | BinaryOp::I32Shl => { 71 | self.has_left_shift = true; 72 | } 73 | _ => {} 74 | } 75 | } 76 | 77 | fn visit_load(&mut self, _: &Load) { 78 | self.has_load = true; 79 | } 80 | } 81 | 82 | #[derive(Default)] 83 | pub struct StoreMemoryFuncMapper { 84 | has_store: bool, 85 | store_kind: Option, 86 | } 87 | 88 | impl StoreMemoryFuncMapper { 89 | pub fn map(&mut self, local: &LocalFunction) -> Option { 90 | dfs_in_order(self, local, local.entry_block()); 91 | if !self.has_store { 92 | return None; 93 | } 94 | 95 | match self.store_kind.as_ref().unwrap() { 96 | StoreKind::I32_8 {..} => Some(MemEncFuncType::Signed8), 97 | StoreKind::I32_16 {..} => Some(MemEncFuncType::Signed16), 98 | StoreKind::I32 { .. } => Some(MemEncFuncType::Signed32), 99 | StoreKind::I64 { .. } => Some(MemEncFuncType::Float64), 100 | _ => unreachable!(), 101 | } 102 | } 103 | } 104 | 105 | impl<'a> Visitor<'a> for StoreMemoryFuncMapper { 106 | fn visit_store(&mut self, instr: &Store) { 107 | self.has_store = true; 108 | self.store_kind = Some(instr.kind.clone()); 109 | } 110 | } 111 | -------------------------------------------------------------------------------- /src/transformations/memory/memory_encryption.rs: -------------------------------------------------------------------------------- 1 | use std::collections::{HashMap, VecDeque}; 2 | use anyhow::Context; 3 | use walrus::{ConstExpr, DataKind, FunctionId, Module}; 4 | use walrus::ir::{BinaryOp, Instr, Value}; 5 | use crate::transformations::memory::MemEncFuncType; 6 | 7 | pub struct XorMemoryEncryption { 8 | xor_table_start: usize, 9 | } 10 | 11 | impl XorMemoryEncryption { 12 | fn decrypt(&self, module: &Module, start: usize, data: &Vec) -> (usize, Vec) { 13 | let start_pos = start - ((start / 320) << 3) - 320 - 23; // 23 is hardcoded btw 14 | let mut new_data = Vec::::with_capacity(data.len()); 15 | 16 | let xor_table = self.get_xor_table(module); 17 | for (i, _) in data.iter().enumerate() { 18 | let pos = start_pos + i; 19 | 20 | let res = self.read_byte(start, &data, &xor_table, pos); 21 | if let Some(res) = res { 22 | new_data.push(res); 23 | } else { 24 | break; 25 | } 26 | } 27 | 28 | (start_pos, new_data) 29 | } 30 | 31 | // Retrieves xor table 32 | // Needs a function that loads a primitive from the memory (preferably unsigned byte) 33 | fn get_xor_table(&self, module: &Module) -> Vec { 34 | let mut xors = Vec::new(); 35 | 36 | let data_segment = module.data.iter().next().unwrap(); 37 | let data_start = match &data_segment.kind { 38 | DataKind::Active { offset, .. } => match *offset { 39 | ConstExpr::Value(v) => match v { 40 | Value::I32(i) => i, 41 | _ => panic!(), 42 | }, 43 | _ => panic!(), 44 | }, 45 | _ => panic!(), 46 | } as usize; 47 | 48 | // It seems like that the table always has 96 bytes 49 | for i in 0..96 { 50 | xors.push(data_segment.value[self.xor_table_start + i - data_start]); 51 | } 52 | 53 | xors 54 | } 55 | 56 | fn read_byte( 57 | &self, 58 | data_start: usize, 59 | data: &Vec, 60 | xor_table: &Vec, 61 | pos: usize, 62 | ) -> Option { 63 | let var0 = pos; 64 | let var1 = var0 / 320; 65 | let var2 = (var1 << 3) + var0 + 1032; 66 | 67 | let v = xor_table[var0 % 96]; 68 | let result = if *data.get((var1 * 328 + 1024) - data_start)? > 0 { 69 | data[var2 - data_start] 70 | } else { 71 | v 72 | }; 73 | 74 | Some(result ^ v) 75 | } 76 | } 77 | 78 | pub enum MemoryEncryptionMode { 79 | Xor(XorMemoryEncryption), 80 | Chacha20, 81 | } 82 | 83 | impl MemoryEncryptionMode { 84 | pub fn decrypt(&self, module: &Module, start: usize, data: &Vec) -> (usize, Vec) { 85 | match self { 86 | MemoryEncryptionMode::Xor(enc) => enc.decrypt(module, start, data), 87 | MemoryEncryptionMode::Chacha20 => panic!("Chacha20 is not supported yet"), 88 | } 89 | } 90 | } 91 | 92 | pub fn map_memory_encryption_mode(module: &Module, mapped_loads: &HashMap) -> Result { 93 | let u8_load_func = mapped_loads 94 | .into_iter() 95 | .find(|(_, func_type)| matches!(func_type, MemEncFuncType::Unsigned8)) 96 | .map(|(id, _)| module.funcs.get(*id).kind.unwrap_local()) 97 | .context("could not find u8 load func")?; 98 | 99 | let mut stack = VecDeque::new(); 100 | stack.push_front(u8_load_func.entry_block()); 101 | 102 | while let Some(block_id) = stack.pop_back() { 103 | let block = u8_load_func.block(block_id); 104 | 105 | for window in block.instrs.windows(2).enumerate() { 106 | let (_, instrs) = window; 107 | 108 | match &instrs[0].0 { 109 | Instr::Call(_) => { 110 | return Ok(MemoryEncryptionMode::Chacha20); 111 | } 112 | Instr::Binop(binop) if matches!(binop.op, BinaryOp::I32RemU) => { 113 | if let Instr::Const(c) = &instrs[1].0 { 114 | if let Value::I32(i) = c.value { 115 | return Ok(MemoryEncryptionMode::Xor(XorMemoryEncryption { 116 | xor_table_start: i as usize, 117 | })); 118 | } 119 | } 120 | } 121 | Instr::Block(b) => stack.push_front(b.seq), 122 | _ => continue, 123 | } 124 | } 125 | } 126 | 127 | Err(anyhow::anyhow!("Failed to map memory encryption mode")) 128 | } -------------------------------------------------------------------------------- /src/fetcher/events/mod.rs: -------------------------------------------------------------------------------- 1 | mod visitor; 2 | 3 | use crate::fetcher::events::visitor::collect_i32_consts; 4 | use anyhow::{bail, Context}; 5 | use std::collections::VecDeque; 6 | use std::ops::Index; 7 | use walrus::ir::{BinaryOp, Block, Const, IfElse, Instr, Loop, Value}; 8 | use walrus::{ConstExpr, DataKind, GlobalKind, LocalFunction, Module}; 9 | 10 | const NEEDED_VALUES: [i32; 4] = [-1, 268435455, -2147483648, 0]; 11 | 12 | pub fn fetch_events(module: &mut Module) -> Result { 13 | let global = module.globals.iter().next().context("Could not find global")?; 14 | let data_segment = module.data.iter().nth(1).context("Could not find memory")?; 15 | let data_start = match &data_segment.kind { 16 | DataKind::Active { offset, .. } => match *offset { 17 | ConstExpr::Value(v) => match v { 18 | Value::I32(i) => i, 19 | _ => panic!(), 20 | }, 21 | _ => panic!(), 22 | }, 23 | _ => panic!(), 24 | } as usize; 25 | 26 | 27 | 'a: for (_, func) in module.funcs.iter_local() { 28 | let collected_consts = collect_i32_consts(func); 29 | for n in NEEDED_VALUES { 30 | if !collected_consts.contains(&n) { 31 | continue 'a; 32 | } 33 | } 34 | 35 | let (events_idx, events_length) = search_pattern(data_start, func).context("Could not find xor event loc in memory")?; 36 | let global_idx = match &global.kind { 37 | GlobalKind::Local(c) => match c { 38 | ConstExpr::Value(v) => match v { 39 | Value::I32(i) => i, 40 | _ => panic!(), 41 | } 42 | _ => panic!(), 43 | } 44 | _ => panic!(), 45 | }; 46 | 47 | return read_events(data_start, &data_segment.value, events_idx as usize, *global_idx as usize); 48 | } 49 | 50 | bail!("could not find function that init events") 51 | } 52 | 53 | fn read_events(data_start: usize, data: &Vec, encrypted_event_string_idx: usize, xor_table: usize) -> Result { 54 | let mut res = String::new(); 55 | let mut offset = 0; 56 | 57 | let off1 = encrypted_event_string_idx - data_start; 58 | let off2 = xor_table - data_start; 59 | 60 | // This is definitely not how hCaptcha does it 61 | // I'm just way too lazy to parse the length due to how hard it would be with control flow 62 | loop { 63 | let a = data[off1+offset]; 64 | let b = data[off2+offset]; 65 | let xor = (a ^ b) as char; 66 | 67 | if !xor.is_alphanumeric() && xor != '\n' && xor != ',' { 68 | break; 69 | } 70 | 71 | res.push(xor); 72 | offset += 1; 73 | } 74 | 75 | Ok(res) 76 | } 77 | 78 | fn search_pattern(data_segment_start: usize, func: &LocalFunction) -> Option<(i32, i32)> { 79 | let mut stack = VecDeque::new(); 80 | stack.push_front(func.entry_block()); 81 | while let Some(block_id) = stack.pop_back() { 82 | let block = func.block(block_id); 83 | 84 | for (idx, (instr, _)) in block.instrs.iter().enumerate() { 85 | match instr { 86 | Instr::Block(Block { seq }) | Instr::Loop(Loop { seq }) => { 87 | stack.push_front(*seq) 88 | } 89 | Instr::IfElse(IfElse { 90 | consequent, 91 | alternative, 92 | }) => { 93 | stack.push_front(*consequent); 94 | stack.push_front(*alternative); 95 | } 96 | Instr::Binop(op) if matches!(op.op, BinaryOp::I32Xor) => { 97 | if !matches!(block.instrs[idx-1].0, Instr::Load(_)) || !matches!(block.instrs[idx-2].0, Instr::Binop(_)) || !matches!(block.instrs[idx+1].0, Instr::Store(_)) { 98 | continue; 99 | } 100 | 101 | 102 | if let ( 103 | Some(Instr::Const(Const { value: Value::I32(n1), .. })), 104 | Some(Instr::Const(Const { value: Value::I32(n2), .. })), 105 | ) = ( 106 | block.instrs.get(idx.wrapping_sub(3)).map(|(i, _)| i), 107 | block.instrs.get(idx + 3).map(|(i, _)| i), 108 | ) { 109 | if *n1 > data_segment_start as i32 { 110 | return Some((*n1, *n2)); 111 | } 112 | } 113 | } 114 | _ => {} 115 | } 116 | } 117 | } 118 | 119 | None 120 | } -------------------------------------------------------------------------------- /src/transformations/memory/memory_transformer.rs: -------------------------------------------------------------------------------- 1 | use crate::transformations::memory::visitors::{LoadMemoryFuncMapper, StoreMemoryFuncMapper}; 2 | use crate::transformations::memory::MemEncFuncType; 3 | use crate::transformations::Transformer; 4 | use std::collections::{HashMap, VecDeque}; 5 | use walrus::ir::{ 6 | BinaryOp, Block, ExtendedLoad, IfElse, Instr, Load, LoadKind, Loop, MemArg, Store, StoreKind, 7 | Value, 8 | }; 9 | use walrus::{ConstExpr, DataKind, FunctionId, FunctionKind, InstrLocId, Module, ValType}; 10 | use crate::transformations::memory::memory_encryption::map_memory_encryption_mode; 11 | 12 | pub struct MemoryTransformer {} 13 | 14 | impl Transformer for MemoryTransformer { 15 | fn transform(&mut self, module: &mut Module) { 16 | let mapped_load_functions = self.map_load_functions(module); 17 | let mapped_store_functions = self.map_store_functions(module); 18 | let memory_encryption_mode = map_memory_encryption_mode(&module, &mapped_load_functions).unwrap(); 19 | 20 | let wasm_data = module.data.iter().nth(1).unwrap(); 21 | let data_start = match &wasm_data.kind { 22 | DataKind::Active { offset, .. } => match *offset { 23 | ConstExpr::Value(v) => match v { 24 | Value::I32(i) => i, 25 | _ => panic!(), 26 | }, 27 | _ => panic!(), 28 | }, 29 | _ => panic!(), 30 | } as usize; 31 | 32 | let (start_pos, new_data) = memory_encryption_mode.decrypt(&module, data_start, &wasm_data.value); 33 | 34 | // replace data with our new decrypted data 35 | { 36 | let mem_id = module.get_memory_id().unwrap(); 37 | let data = module.data.get_mut(wasm_data.id()); 38 | 39 | data.value = new_data; 40 | data.kind = DataKind::Active { 41 | memory: mem_id, 42 | offset: ConstExpr::Value(Value::I32(start_pos as i32)), 43 | } 44 | } 45 | 46 | self.revert_memory_loads(module, &mapped_load_functions); 47 | self.revert_memory_stores(module, &mapped_store_functions); 48 | self.rewrite_loads(module, &mapped_load_functions); 49 | self.rewrite_stores(module, &mapped_store_functions); 50 | } 51 | } 52 | 53 | impl MemoryTransformer { 54 | // Finds every function that could possibly match with mem load funcs. 55 | // 2 params + 1 result + exported 56 | fn find_mem_load_functions(&self, module: &Module) -> Vec { 57 | let mut functions = Vec::new(); 58 | 59 | 'a: for function in module.funcs.iter() { 60 | let function_id = function.id(); 61 | if let FunctionKind::Local(local) = &function.kind { 62 | let t = module.types.get(local.ty()); 63 | if t.params().len() != 2 { 64 | // idx, offset 65 | continue 'a; 66 | } 67 | 68 | for param in t.params() { 69 | if !matches!(param, ValType::I32) { 70 | continue 'a; 71 | } 72 | } 73 | 74 | if t.results().len() != 1 { 75 | continue 'a; 76 | } 77 | 78 | if !module.exports.get_exported_func(function_id).is_some() { 79 | continue 'a; 80 | } 81 | 82 | functions.push(function_id); 83 | } 84 | } 85 | 86 | functions 87 | } 88 | 89 | fn map_load_functions(&self, module: &mut Module) -> HashMap { 90 | let mut mapped_load_functions = HashMap::new(); 91 | let load_functions = self.find_mem_load_functions(module); 92 | 93 | for id in load_functions.into_iter() { 94 | let func = module.funcs.get(id); // ALWAYS local 95 | let local = func.kind.unwrap_local(); 96 | let t = module.types.get(local.ty()); 97 | 98 | match t.results()[0] { 99 | ValType::I32 => { 100 | let mut visitor = LoadMemoryFuncMapper::default(); 101 | if let Some(load_type) = visitor.map(&local) { 102 | mapped_load_functions.insert(id, load_type); 103 | } 104 | } 105 | ValType::F32 => { 106 | mapped_load_functions.insert(id, MemEncFuncType::Float32); 107 | } 108 | ValType::F64 => { 109 | mapped_load_functions.insert(id, MemEncFuncType::Float64); 110 | } 111 | ValType::I64 => { 112 | mapped_load_functions.insert(id, MemEncFuncType::Signed64); 113 | } 114 | _ => unreachable!(), // what the flip 115 | }; 116 | } 117 | 118 | mapped_load_functions 119 | } 120 | 121 | fn revert_memory_loads( 122 | &self, 123 | module: &mut Module, 124 | functions: &HashMap, 125 | ) { 126 | let memory_id = module.memories.iter().next().unwrap().id(); 127 | 128 | module.funcs.iter_local_mut().for_each(|(_, f)| { 129 | let mut stack = VecDeque::new(); 130 | stack.push_front(f.entry_block()); 131 | while let Some(block_id) = stack.pop_back() { 132 | let block = f.block_mut(block_id); 133 | 134 | let mut replacements = Vec::<(usize, (Instr, InstrLocId))>::new(); 135 | 136 | for (idx, (instr, instr_id)) in block.instrs.iter().enumerate() { 137 | match instr { 138 | Instr::Block(Block { seq }) | Instr::Loop(Loop { seq }) => { 139 | stack.push_front(*seq) 140 | } 141 | Instr::IfElse(IfElse { 142 | consequent, 143 | alternative, 144 | }) => { 145 | stack.push_front(*consequent); 146 | stack.push_front(*alternative); 147 | } 148 | Instr::Const(c) => match c.value { 149 | Value::I32(i) => { 150 | let next_instruction = block.instrs.get(idx + 1); 151 | if let Some((next_instruction, _)) = next_instruction { 152 | if let Instr::Call(call) = next_instruction { 153 | if let Some(func_type) = functions.get(&call.func) { 154 | replacements.push(( 155 | idx, 156 | ( 157 | Instr::Load(match func_type { 158 | MemEncFuncType::Signed64 => Load { 159 | memory: memory_id, 160 | kind: LoadKind::I64 { 161 | atomic: false, 162 | }, 163 | arg: MemArg { 164 | align: 8, 165 | offset: i as u32, 166 | }, 167 | }, 168 | MemEncFuncType::Signed32 => Load { 169 | memory: memory_id, 170 | kind: LoadKind::I32 { 171 | atomic: false, 172 | }, 173 | arg: MemArg { 174 | align: 4, 175 | offset: i as u32, 176 | }, 177 | }, 178 | MemEncFuncType::Signed16 => Load { 179 | memory: memory_id, 180 | kind: LoadKind::I32_16 { 181 | kind: ExtendedLoad::SignExtend, 182 | }, 183 | arg: MemArg { 184 | align: 2, 185 | offset: i as u32, 186 | }, 187 | }, 188 | MemEncFuncType::Unsigned16 => Load { 189 | memory: memory_id, 190 | kind: LoadKind::I32_16 { 191 | kind: ExtendedLoad::ZeroExtend, 192 | }, 193 | arg: MemArg { 194 | align: 2, 195 | offset: i as u32, 196 | }, 197 | }, 198 | MemEncFuncType::Unsigned8 => Load { 199 | memory: memory_id, 200 | kind: LoadKind::I32_8 { 201 | kind: ExtendedLoad::ZeroExtend, 202 | }, 203 | arg: MemArg { 204 | align: 1, 205 | offset: i as u32, 206 | }, 207 | }, 208 | MemEncFuncType::Signed8 => Load { 209 | memory: memory_id, 210 | kind: LoadKind::I32_8 { 211 | kind: ExtendedLoad::SignExtend, 212 | }, 213 | arg: MemArg { 214 | align: 1, 215 | offset: i as u32, 216 | }, 217 | }, 218 | MemEncFuncType::Float32 => Load { 219 | memory: memory_id, 220 | kind: LoadKind::F32, 221 | arg: MemArg { 222 | align: 4, 223 | offset: i as u32, 224 | }, 225 | }, 226 | MemEncFuncType::Float64 => Load { 227 | memory: memory_id, 228 | kind: LoadKind::F64, 229 | arg: MemArg { 230 | align: 8, 231 | offset: i as u32, 232 | }, 233 | }, 234 | }), 235 | *instr_id, 236 | ), 237 | )); 238 | } 239 | } 240 | } 241 | } 242 | _ => {} 243 | }, 244 | _ => {} 245 | }; 246 | } 247 | 248 | replacements.reverse(); 249 | for (idx, (instr, seq)) in replacements { 250 | block.instrs[idx] = (instr, seq); 251 | block.instrs.remove(idx + 1); 252 | } 253 | } 254 | }); 255 | } 256 | 257 | fn revert_memory_stores( 258 | &self, 259 | module: &mut Module, 260 | functions: &HashMap, 261 | ) { 262 | let memory_id = module.memories.iter().next().unwrap().id(); 263 | 264 | module.funcs.iter_local_mut().for_each(|(_, f)| { 265 | let mut stack = VecDeque::new(); 266 | stack.push_front(f.entry_block()); 267 | while let Some(block_id) = stack.pop_back() { 268 | let block = f.block_mut(block_id); 269 | 270 | let mut replacements = Vec::<(usize, (Instr, InstrLocId))>::new(); 271 | 272 | for (idx, (instr, instr_id)) in block.instrs.iter().enumerate() { 273 | match instr { 274 | Instr::Block(Block { seq }) | Instr::Loop(Loop { seq }) => { 275 | stack.push_front(*seq) 276 | } 277 | Instr::IfElse(IfElse { 278 | consequent, 279 | alternative, 280 | }) => { 281 | stack.push_front(*consequent); 282 | stack.push_front(*alternative); 283 | } 284 | Instr::Const(c) => match c.value { 285 | Value::I32(i) => { 286 | let next_instruction = block.instrs.get(idx + 1); 287 | if let Some((next_instruction, _)) = next_instruction { 288 | if let Instr::Call(call) = next_instruction { 289 | if let Some(func_type) = functions.get(&call.func) { 290 | replacements.push(( 291 | idx, 292 | ( 293 | Instr::Store(match func_type { 294 | MemEncFuncType::Signed64 => Store { 295 | memory: memory_id, 296 | kind: StoreKind::I64 { atomic: false }, 297 | arg: MemArg { 298 | align: 8, 299 | offset: i as u32, 300 | }, 301 | }, 302 | MemEncFuncType::Signed32 => Store { 303 | memory: memory_id, 304 | kind: StoreKind::I32 { atomic: false }, 305 | arg: MemArg { 306 | align: 4, 307 | offset: i as u32, 308 | }, 309 | }, 310 | MemEncFuncType::Signed16 311 | | MemEncFuncType::Unsigned16 => Store { 312 | memory: memory_id, 313 | kind: StoreKind::I32_16 { 314 | atomic: false, 315 | }, 316 | arg: MemArg { 317 | align: 2, 318 | offset: i as u32, 319 | }, 320 | }, 321 | MemEncFuncType::Signed8 322 | | MemEncFuncType::Unsigned8 => Store { 323 | memory: memory_id, 324 | kind: StoreKind::I32_8 { 325 | atomic: false, 326 | }, 327 | arg: MemArg { 328 | align: 1, 329 | offset: i as u32, 330 | }, 331 | }, 332 | MemEncFuncType::Float32 => Store { 333 | memory: memory_id, 334 | kind: StoreKind::F32, 335 | arg: MemArg { 336 | align: 4, 337 | offset: i as u32, 338 | }, 339 | }, 340 | MemEncFuncType::Float64 => Store { 341 | memory: memory_id, 342 | kind: StoreKind::F64, 343 | arg: MemArg { 344 | align: 8, 345 | offset: i as u32, 346 | }, 347 | }, 348 | }), 349 | *instr_id, 350 | ), 351 | )); 352 | } 353 | } 354 | } 355 | } 356 | _ => {} 357 | }, 358 | _ => {} 359 | }; 360 | } 361 | 362 | replacements.reverse(); // hell yeah 363 | for (idx, (instr, seq)) in replacements { 364 | block.instrs[idx] = (instr, seq); 365 | block.instrs.remove(idx + 1); 366 | } 367 | } 368 | }); 369 | } 370 | 371 | fn find_mem_store_functions(&self, module: &Module) -> Vec { 372 | let mut functions = Vec::new(); 373 | 374 | 'a: for function in module.funcs.iter() { 375 | let function_id = function.id(); 376 | if let FunctionKind::Local(local) = &function.kind { 377 | let t = module.types.get(local.ty()); 378 | if t.params().len() != 3 { 379 | // idx, offset 380 | continue 'a; 381 | } 382 | 383 | for (i, param) in t.params().iter().enumerate() { 384 | if !matches!(param, ValType::I32) && i != 1 { 385 | continue 'a; 386 | } 387 | } 388 | 389 | if t.results().len() != 0 { 390 | continue 'a; 391 | } 392 | 393 | if !module.exports.get_exported_func(function_id).is_some() { 394 | continue 'a; 395 | } 396 | 397 | functions.push(function_id); 398 | } 399 | } 400 | 401 | functions 402 | } 403 | 404 | fn map_store_functions(&self, module: &mut Module) -> HashMap { 405 | let mut mapped_store_functions = HashMap::new(); 406 | let store_functions = self.find_mem_store_functions(module); 407 | 408 | for id in store_functions.into_iter() { 409 | let func = module.funcs.get(id); // ALWAYS local 410 | let local = func.kind.unwrap_local(); 411 | let t = module.types.get(local.ty()); 412 | 413 | match &t.params()[1] { 414 | ValType::I64 => { 415 | mapped_store_functions.insert(id, MemEncFuncType::Signed64); 416 | } 417 | ValType::F32 => { 418 | mapped_store_functions.insert(id, MemEncFuncType::Float32); 419 | } 420 | ValType::F64 => { 421 | mapped_store_functions.insert(id, MemEncFuncType::Float64); 422 | } 423 | _ => { 424 | let mut visitor = StoreMemoryFuncMapper::default(); 425 | if let Some(load_type) = visitor.map(&local) { 426 | mapped_store_functions.insert(id, load_type); 427 | } 428 | } 429 | } 430 | } 431 | 432 | mapped_store_functions 433 | } 434 | 435 | fn rewrite_loads(&self, module: &mut Module, functions: &HashMap) { 436 | let memory_id = module.memories.iter().next().unwrap().id(); 437 | 438 | for (id, func_type) in functions.into_iter() { 439 | let func = module.funcs.get_mut(*id).kind.unwrap_local_mut(); 440 | 441 | let idx_local = *func.args.get(0).unwrap(); 442 | let offset_local = *func.args.get(1).unwrap(); 443 | 444 | func.builder_mut() 445 | .func_body() 446 | .local_get_at(0, idx_local) 447 | .local_get_at(1, offset_local) 448 | .binop_at(2, BinaryOp::I32Add); 449 | 450 | match func_type { 451 | MemEncFuncType::Unsigned8 => { 452 | func.builder_mut().func_body().load_at( 453 | 3, 454 | memory_id, 455 | LoadKind::I32_8 { 456 | kind: ExtendedLoad::ZeroExtend, 457 | }, 458 | MemArg { 459 | align: 1, 460 | offset: 0, 461 | }, 462 | ); 463 | } 464 | MemEncFuncType::Signed8 => { 465 | func.builder_mut().func_body().load_at( 466 | 3, 467 | memory_id, 468 | LoadKind::I32_8 { 469 | kind: ExtendedLoad::SignExtend, 470 | }, 471 | MemArg { 472 | align: 1, 473 | offset: 0, 474 | }, 475 | ); 476 | } 477 | MemEncFuncType::Unsigned16 => { 478 | func.builder_mut().func_body().load_at( 479 | 3, 480 | memory_id, 481 | LoadKind::I32_16 { 482 | kind: ExtendedLoad::ZeroExtend, 483 | }, 484 | MemArg { 485 | align: 2, 486 | offset: 0, 487 | }, 488 | ); 489 | } 490 | MemEncFuncType::Signed16 => { 491 | func.builder_mut().func_body().load_at( 492 | 3, 493 | memory_id, 494 | LoadKind::I32_16 { 495 | kind: ExtendedLoad::SignExtend, 496 | }, 497 | MemArg { 498 | align: 2, 499 | offset: 0, 500 | }, 501 | ); 502 | } 503 | MemEncFuncType::Signed32 => { 504 | func.builder_mut().func_body().load_at( 505 | 3, 506 | memory_id, 507 | LoadKind::I32 { atomic: false }, 508 | MemArg { 509 | align: 4, 510 | offset: 0, 511 | }, 512 | ); 513 | } 514 | MemEncFuncType::Signed64 => { 515 | func.builder_mut().func_body().load_at( 516 | 3, 517 | memory_id, 518 | LoadKind::I64 { atomic: false }, 519 | MemArg { 520 | align: 8, 521 | offset: 0, 522 | }, 523 | ); 524 | } 525 | MemEncFuncType::Float32 => { 526 | func.builder_mut().func_body().load_at( 527 | 3, 528 | memory_id, 529 | LoadKind::F32, 530 | MemArg { 531 | align: 4, 532 | offset: 0, 533 | }, 534 | ); 535 | } 536 | MemEncFuncType::Float64 => { 537 | func.builder_mut().func_body().load_at( 538 | 3, 539 | memory_id, 540 | LoadKind::F64, 541 | MemArg { 542 | align: 8, 543 | offset: 0, 544 | }, 545 | ); 546 | } 547 | } 548 | 549 | func.builder_mut().func_body().return_at(4); 550 | } 551 | } 552 | 553 | fn rewrite_stores(&self, module: &mut Module, functions: &HashMap) { 554 | let memory_id = module.memories.iter().next().unwrap().id(); 555 | 556 | for (id, func_type) in functions.into_iter() { 557 | let func = module.funcs.get_mut(*id).kind.unwrap_local_mut(); 558 | 559 | let idx_local = *func.args.get(0).unwrap(); 560 | let value_local = *func.args.get(1).unwrap(); 561 | let offset_local = *func.args.get(2).unwrap(); 562 | 563 | func.builder_mut() 564 | .func_body() 565 | .local_get_at(0, idx_local) 566 | .local_get_at(1, offset_local) 567 | .binop_at(2, BinaryOp::I32Add) 568 | .local_get_at(3, value_local); 569 | 570 | match func_type { 571 | MemEncFuncType::Unsigned8 | MemEncFuncType::Signed8 => { 572 | func.builder_mut().func_body().store_at( 573 | 4, 574 | memory_id, 575 | StoreKind::I32_8 { atomic: false }, 576 | MemArg { 577 | align: 1, 578 | offset: 0, 579 | }, 580 | ); 581 | } 582 | MemEncFuncType::Unsigned16 | MemEncFuncType::Signed16 => { 583 | func.builder_mut().func_body().store_at( 584 | 4, 585 | memory_id, 586 | StoreKind::I32_16 { atomic: false }, 587 | MemArg { 588 | align: 2, 589 | offset: 0, 590 | }, 591 | ); 592 | } 593 | MemEncFuncType::Signed32 => { 594 | func.builder_mut().func_body().store_at( 595 | 4, 596 | memory_id, 597 | StoreKind::I32 { atomic: false }, 598 | MemArg { 599 | align: 4, 600 | offset: 0, 601 | }, 602 | ); 603 | } 604 | MemEncFuncType::Signed64 => { 605 | func.builder_mut().func_body().store_at( 606 | 4, 607 | memory_id, 608 | StoreKind::I64 { atomic: false }, 609 | MemArg { 610 | align: 8, 611 | offset: 0, 612 | }, 613 | ); 614 | } 615 | MemEncFuncType::Float32 => { 616 | func.builder_mut().func_body().store_at( 617 | 4, 618 | memory_id, 619 | StoreKind::F32, 620 | MemArg { 621 | align: 4, 622 | offset: 0, 623 | }, 624 | ); 625 | } 626 | MemEncFuncType::Float64 => { 627 | func.builder_mut().func_body().store_at( 628 | 4, 629 | memory_id, 630 | StoreKind::F64, 631 | MemArg { 632 | align: 8, 633 | offset: 0, 634 | }, 635 | ); 636 | } 637 | } 638 | 639 | func.builder_mut().func_body().return_at(5); 640 | } 641 | } 642 | } -------------------------------------------------------------------------------- /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 | . --------------------------------------------------------------------------------