1*8f8cb840SMaxim Sobolev /* 2*8f8cb840SMaxim Sobolev * Copyright (c) 2004-2016 Maxim Sobolev <sobomax@FreeBSD.org> 3*8f8cb840SMaxim Sobolev * All rights reserved. 4*8f8cb840SMaxim Sobolev * 5*8f8cb840SMaxim Sobolev * Redistribution and use in source and binary forms, with or without 6*8f8cb840SMaxim Sobolev * modification, are permitted provided that the following conditions 7*8f8cb840SMaxim Sobolev * are met: 8*8f8cb840SMaxim Sobolev * 1. Redistributions of source code must retain the above copyright 9*8f8cb840SMaxim Sobolev * notice, this list of conditions and the following disclaimer. 10*8f8cb840SMaxim Sobolev * 2. Redistributions in binary form must reproduce the above copyright 11*8f8cb840SMaxim Sobolev * notice, this list of conditions and the following disclaimer in the 12*8f8cb840SMaxim Sobolev * documentation and/or other materials provided with the distribution. 13*8f8cb840SMaxim Sobolev * 14*8f8cb840SMaxim Sobolev * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15*8f8cb840SMaxim Sobolev * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16*8f8cb840SMaxim Sobolev * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17*8f8cb840SMaxim Sobolev * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18*8f8cb840SMaxim Sobolev * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19*8f8cb840SMaxim Sobolev * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20*8f8cb840SMaxim Sobolev * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21*8f8cb840SMaxim Sobolev * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22*8f8cb840SMaxim Sobolev * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23*8f8cb840SMaxim Sobolev * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24*8f8cb840SMaxim Sobolev * SUCH DAMAGE. 25*8f8cb840SMaxim Sobolev * 26*8f8cb840SMaxim Sobolev * $FreeBSD$ 27*8f8cb840SMaxim Sobolev */ 28*8f8cb840SMaxim Sobolev 29*8f8cb840SMaxim Sobolev /* CLOOP format and related constants */ 30*8f8cb840SMaxim Sobolev 31*8f8cb840SMaxim Sobolev /* 32*8f8cb840SMaxim Sobolev * Integer values (block size, number of blocks, offsets) 33*8f8cb840SMaxim Sobolev * are stored in big-endian (network) order on disk. 34*8f8cb840SMaxim Sobolev */ 35*8f8cb840SMaxim Sobolev 36*8f8cb840SMaxim Sobolev #define CLOOP_MAGIC_LEN 128 37*8f8cb840SMaxim Sobolev #define CLOOP_OFS_COMPR 0x0b 38*8f8cb840SMaxim Sobolev #define CLOOP_OFS_VERSN (CLOOP_OFS_COMPR + 1) 39*8f8cb840SMaxim Sobolev 40*8f8cb840SMaxim Sobolev #define CLOOP_MAJVER_2 '2' 41*8f8cb840SMaxim Sobolev #define CLOOP_MAJVER_3 '3' 42*8f8cb840SMaxim Sobolev 43*8f8cb840SMaxim Sobolev #define CLOOP_COMP_LIBZ 'V' 44*8f8cb840SMaxim Sobolev #define CLOOP_COMP_LZMA 'L' 45*8f8cb840SMaxim Sobolev 46*8f8cb840SMaxim Sobolev struct cloop_header { 47*8f8cb840SMaxim Sobolev char magic[CLOOP_MAGIC_LEN]; /* cloop magic */ 48*8f8cb840SMaxim Sobolev uint32_t blksz; /* block size */ 49*8f8cb840SMaxim Sobolev uint32_t nblocks; /* number of blocks */ 50*8f8cb840SMaxim Sobolev }; 51