59 lines
1.7 KiB
C
59 lines
1.7 KiB
C
|
/*
|
||
|
|
* Squashfs - a compressed read only filesystem for Linux
|
||
|
|
*
|
||
|
|
* Copyright (c) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
|
||
|
|
* Phillip Lougher <phillip@lougher.demon.co.uk>
|
||
|
|
*
|
||
|
|
* This program is free software; you can redistribute it and/or
|
||
|
|
* modify it under the terms of the GNU General Public License
|
||
|
|
* as published by the Free Software Foundation; either version 2,
|
||
|
|
* or (at your option) any later version.
|
||
|
|
*
|
||
|
|
* This program is distributed in the hope that it will be useful,
|
||
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
* GNU General Public License for more details.
|
||
|
|
*
|
||
|
|
* You should have received a copy of the GNU General Public License
|
||
|
|
* along with this program; if not, write to the Free Software
|
||
|
|
* Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
||
|
|
*
|
||
|
|
* decompressor.c
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <linux/types.h>
|
||
|
|
#include <linux/mutex.h>
|
||
|
|
#include <linux/buffer_head.h>
|
||
|
|
|
||
|
|
#include "squashfs_fs.h"
|
||
|
|
#include "squashfs_fs_sb.h"
|
||
|
|
#include "squashfs_fs_i.h"
|
||
|
|
#include "decompressor.h"
|
||
|
|
#include "squashfs.h"
|
||
|
|
|
||
|
|
/*
|
||
|
|
* This file (and decompressor.h) implements a decompressor framework for
|
||
|
|
* Squashfs, allowing multiple decompressors to be easily supported
|
||
|
|
*/
|
||
|
|
|
||
|
|
static const struct squashfs_decompressor squashfs_unknown_comp_ops = {
|
||
|
|
NULL, NULL, NULL, 0, "unknown", 0
|
||
|
|
};
|
||
|
|
|
||
|
|
static const struct squashfs_decompressor *decompressor[] = {
|
||
|
|
&squashfs_zlib_comp_ops,
|
||
|
|
&squashfs_unknown_comp_ops
|
||
|
|
};
|
||
|
|
|
||
|
|
|
||
|
|
const struct squashfs_decompressor *squashfs_lookup_decompressor(int id)
|
||
|
|
{
|
||
|
|
int i;
|
||
|
|
|
||
|
|
for (i = 0; decompressor[i]->id; i++)
|
||
|
|
if (id == decompressor[i]->id)
|
||
|
|
break;
|
||
|
|
|
||
|
|
return decompressor[i];
|
||
|
|
}
|