[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10,"_11":12},"actionData","errors","root",{"_180":-5,"_183":184,"_185":186},"routes/shell",{"_43":44,"_179":-5,"_180":-5,"_181":182},"routes/repo",{"_34":-7,"_35":36,"_37":38,"_39":40,"_41":42,"_43":44,"_45":32,"_46":32,"_47":32,"_48":32,"_49":32,"_50":32,"_51":52,"_53":52,"_54":32,"_55":-7,"_56":-7,"_57":58,"_59":60,"_61":62,"_63":-5,"_64":65,"_66":67,"_68":69,"_70":71},"routes/repo.blob",{"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":-5,"_26":27,"_28":29,"_29":30,"_31":32,"_33":14},"ref","main","path","crates/ltx/src/lz4_block.rs","oid","b14870fe47619d5452616bcaad5e483b4b40a9de","size",7320,"commit","90b43017241f81189453d326d05948f388b34652","mounts",[],"source","plain",{"_13":14,"_15":16},"kind","text","//! Byte-compatible LZ4 block compression for `superfly/ltx` v0.5.2.\n//!\n//! This is a Rust port of `pierrec/lz4` v4.1.23's fast block compressor.\n//! `superfly/ltx` uses that implementation, and valid LZ4 encoders can choose\n//! different matches. The ordinary `lz4_flex` encoder is format-compatible but\n//! does not produce the same bytes, so the LTX writer needs this small pinned\n//! implementation to preserve an exact-file compatibility contract.\n//!\n//! Copyright (c) 2015, Pierre Curto. The source is available under the BSD\n//! 3-Clause license. See `LICENSE.pierrec-lz4` in this crate.\n\nconst MIN_MATCH: usize = 4;\nconst WINDOW_LOG: usize = 16;\nconst WINDOW_SIZE: usize = 1 << WINDOW_LOG;\nconst WINDOW_MASK: usize = WINDOW_SIZE - 1;\nconst HASH_LOG: usize = 16;\nconst HASH_SIZE: usize = 1 << HASH_LOG;\nconst MATCH_FIND_LIMIT: usize = 10 + MIN_MATCH;\n\n/// The reusable state for the exact upstream fast compressor.\npub(crate) struct Compressor {\n table: Vec,\n in_use: Vec,\n}\n\nimpl Default for Compressor {\n fn default() -> Self {\n Self {\n table: vec![0; HASH_SIZE],\n in_use: vec![0; HASH_SIZE / 32],\n }\n }\n}\n\nimpl Compressor {\n /// Compresses one independent block with the algorithm used by\n /// `github.com/pierrec/lz4/v4@v4.1.23`.\n pub(crate) fn compress(&mut self, src: &[u8]) -> Vec {\n self.in_use.fill(0);\n\n let mut dst = vec![0; compress_bound(src.len())];\n let mut si = 0usize;\n let mut di = 0usize;\n let mut anchor = 0usize;\n let sn = src.len().saturating_sub(MATCH_FIND_LIMIT);\n\n if src.len() > MATCH_FIND_LIMIT {\n while si < sn {\n let matched = read_u64_le(src, si);\n let mut hash = block_hash(matched);\n let hash2 = block_hash(matched >> 8);\n\n let mut reference = self.get(hash, si);\n let reference2 = self.get(hash2, si + 1);\n self.put(hash, si);\n self.put(hash2, si + 1);\n\n let mut offset = si as isize - reference;\n if !matches_at(src, matched as u32, reference, offset) {\n hash = block_hash(matched >> 16);\n let reference3 = self.get(hash, si + 2);\n\n si += 1;\n reference = reference2;\n offset = si as isize - reference;\n if !matches_at(src, (matched >> 8) as u32, reference, offset) {\n si += 1;\n reference = reference3;\n offset = si as isize - reference;\n self.put(hash, si);\n if !matches_at(src, (matched >> 16) as u32, reference, offset) {\n si += 2 + ((si - anchor) >> 7);\n continue;\n }\n }\n }\n\n let offset = offset as usize;\n let mut literal_len = si - anchor;\n let mut match_len = MIN_MATCH;\n\n let mut target = si as isize - offset as isize - 1;\n while literal_len > 0 && target >= 0 && src[si - 1] == src[target as usize] {\n si -= 1;\n target -= 1;\n literal_len -= 1;\n match_len += 1;\n }\n\n let match_base = si + MIN_MATCH;\n si += match_len;\n while si + 8 <= sn {\n let diff = read_u64_le(src, si) ^ read_u64_le(src, si - offset);\n if diff == 0 {\n si += 8;\n } else {\n si += diff.trailing_zeros() as usize >> 3;\n break;\n }\n }\n match_len = si - match_base;\n\n let token_offset = di;\n dst[token_offset] = match_len.min(0x0f) as u8;\n di += 1;\n if literal_len < 0x0f {\n dst[token_offset] |= (literal_len << 4) as u8;\n } else {\n dst[token_offset] |= 0xf0;\n di = write_length(&mut dst, di, literal_len - 0x0f);\n }\n\n dst[di..di + literal_len].copy_from_slice(&src[anchor..anchor + literal_len]);\n di += literal_len;\n dst[di..di + 2].copy_from_slice(&(offset as u16).to_le_bytes());\n di += 2;\n anchor = si;\n\n if match_len >= 0x0f {\n di = write_length(&mut dst, di, match_len - 0x0f);\n }\n if si >= sn {\n break;\n }\n\n hash = block_hash(read_u64_le(src, si - 2));\n self.put(hash, si - 2);\n }\n }\n\n let mut literal_len = src.len() - anchor;\n if literal_len < 0x0f {\n dst[di] = (literal_len << 4) as u8;\n } else {\n dst[di] = 0xf0;\n di += 1;\n while literal_len >= 0xff + 0x0f {\n dst[di] = 0xff;\n di += 1;\n literal_len -= 0xff;\n }\n dst[di] = (literal_len - 0x0f) as u8;\n }\n di += 1;\n di += copy_into(&mut dst[di..], &src[anchor..]);\n dst.truncate(di);\n dst\n }\n\n fn get(&self, hash: u32, si: usize) -> isize {\n let hash = hash as usize & (HASH_SIZE - 1);\n let mut pos = 0isize;\n if self.in_use[hash / 32] & (1 << (hash % 32)) != 0 {\n pos = self.table[hash] as isize;\n }\n pos += (si & !WINDOW_MASK) as isize;\n if pos >= si as isize {\n pos -= WINDOW_SIZE as isize;\n }\n pos\n }\n\n fn put(&mut self, hash: u32, si: usize) {\n let hash = hash as usize & (HASH_SIZE - 1);\n self.table[hash] = si as u16;\n self.in_use[hash / 32] |= 1 << (hash % 32);\n }\n}\n\npub(crate) fn compress_bound(n: usize) -> usize {\n n + n / 255 + 16\n}\n\nfn block_hash(value: u64) -> u32 {\n const PRIME_6_BYTES: u64 = 227_718_039_650_203;\n ((value << 16).wrapping_mul(PRIME_6_BYTES) >> (64 - HASH_LOG)) as u32\n}\n\nfn read_u64_le(src: &[u8], offset: usize) -> u64 {\n u64::from_le_bytes(src[offset..offset + 8].try_into().expect(\"checked read\"))\n}\n\nfn matches_at(src: &[u8], value: u32, reference: isize, offset: isize) -> bool {\n offset > 0\n && offset < WINDOW_SIZE as isize\n && reference >= 0\n && value\n == u32::from_le_bytes(\n src[reference as usize..reference as usize + 4]\n .try_into()\n .expect(\"windowed read\"),\n )\n}\n\nfn write_length(dst: &mut [u8], mut offset: usize, mut len: usize) -> usize {\n while len >= 0xff {\n dst[offset] = 0xff;\n offset += 1;\n len -= 0xff;\n }\n dst[offset] = len as u8;\n offset + 1\n}\n\nfn copy_into(dst: &mut [u8], src: &[u8]) -> usize {\n dst[..src.len()].copy_from_slice(src);\n src.len()\n}\n\n#[doc(hidden)]\npub mod internal {\n #[derive(Default)]\n pub struct Compressor(super::Compressor);\n\n impl Compressor {\n pub fn compress(&mut self, source: &[u8]) -> Vec {\n self.0.compress(source)\n }\n }\n}\n","editable",false,"branch","documentNavigation","repo","denoland/celld","repoId","a23b8a10-92cf-4dc4-a7ab-a04e58298dde","ownerId","org:42048915","organization",true,"site","nexthub","private","admin","settings","maintainer","triage","starred","stars",1,"watchers","watching","pinned","notify","views",[135,136,137,138,139,140,141,142,143,144,145,146,147],"navigation",{"_57":58,"_93":94,"_95":96,"_97":98,"_99":100,"_101":102,"_103":104},"sources",[],"viewer","meta",{"_85":86,"_87":88,"_89":90,"_45":32,"_91":14,"_92":32,"_51":52,"_53":52},"branches",[14],"tags",[72,73,74,75,76,77,78,79,80,81,82,83,84],"cloneUrl","https://git.nexthub.sh/denoland/celld.git","v0.0.1","v0.0.2","v0.1.0","v0.2.0","v0.2.1","v0.3.0","v0.4.0","v0.4.1","v0.5.0","v0.5.1","v0.6.0","v0.6.1","v0.6.2","description","self-hosted, distributed Durable Objects","owner","denoland","section","","head","empty","pins",[118,119,120],"documents",{"_113":114,"_115":116},"code",{"_110":111,"_112":106},"automations",{"_108":52,"_109":-5},"delivery",{"_105":106,"_107":-5},"tag","7gTA52Z9a1vO6FP6eCQPix9zO4O","releases",0,"applications","workflows","deployments","commits",13,"changes","counts",{"_117":116},"total",38,"issue",{"_121":112,"_123":133,"_15":112,"_125":134,"_55":42,"_127":32,"_128":42,"_129":106},{"_121":130,"_123":131,"_15":130,"_125":132,"_55":42,"_127":32,"_128":42,"_129":106},{"_121":122,"_123":124,"_15":122,"_125":126,"_55":42,"_127":32,"_128":42,"_129":116},"id","issues","name","Issues","filters",{},"saved","pinnable","count","tasks","Tasks",{},"Changes",{},{"_121":112,"_123":133,"_15":112,"_125":178,"_55":42,"_127":32,"_128":42},{"_121":130,"_123":131,"_15":130,"_125":177,"_55":42,"_127":32,"_128":42},{"_121":122,"_123":124,"_15":122,"_125":176,"_55":42,"_127":32,"_128":42},{"_121":173,"_123":174,"_15":173,"_125":175,"_55":32,"_127":32,"_128":42},{"_121":170,"_123":171,"_15":170,"_125":172,"_55":32,"_127":32,"_128":42},{"_121":108,"_123":168,"_15":99,"_125":169,"_55":32,"_127":32,"_128":42},{"_121":109,"_123":165,"_15":166,"_125":167,"_55":32,"_127":32,"_128":42},{"_121":105,"_123":163,"_15":105,"_125":164,"_55":32,"_127":32,"_128":42},{"_121":159,"_123":160,"_15":161,"_125":162,"_55":32,"_127":32,"_128":42},{"_121":95,"_123":157,"_15":95,"_125":158,"_55":32,"_127":32,"_128":32},{"_121":154,"_123":155,"_15":154,"_125":156,"_55":32,"_127":32,"_128":32},{"_121":151,"_123":152,"_15":151,"_125":153,"_55":32,"_127":32,"_128":32},{"_121":148,"_123":149,"_15":148,"_125":150,"_55":32,"_127":32,"_128":32},"decisions","Decisions",{},"changelog","Changelog",{},"roadmap","Roadmap",{},"Documents",{},"activity","Activity","insights",{},"Releases",{},"Deployments","automations/deployments",{},"Workflows",{},"discussions","Discussions",{},"goals","Goals",{},{},{},{},"groups","user","agents",[],"now",1794638841377,"sidebar","expanded"]