1#ifndef SORT_H 2#define SORT_H 3 4/* 5 * Squashfs 6 * 7 * Copyright (c) 2002, 2003, 2004, 2005, 2006, 2007 8 * Phillip Lougher <phillip@lougher.org.uk> 9 * 10 * This program is free software; you can redistribute it and/or 11 * modify it under the terms of the GNU General Public License 12 * as published by the Free Software Foundation; either version 2, 13 * or (at your option) any later version. 14 * 15 * This program is distributed in the hope that it will be useful, 16 * but WITHOUT ANY WARRANTY; without even the implied warranty of 17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 18 * GNU General Public License for more details. 19 * 20 * You should have received a copy of the GNU General Public License 21 * along with this program; if not, write to the Free Software 22 * Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. 23 * 24 * sort.h 25 */ 26 27struct dir_info { 28 char *pathname; 29 unsigned int count; 30 unsigned int directory_count; 31 unsigned int current_count; 32 unsigned int byte_count; 33 char dir_is_ldir; 34 struct dir_ent *dir_ent; 35 struct dir_ent **list; 36 DIR *linuxdir; 37}; 38 39struct dir_ent { 40 char *name; 41 char *pathname; 42 struct inode_info *inode; 43 struct dir_info *dir; 44 struct dir_info *our_dir; 45 struct old_root_entry_info *data; 46}; 47 48struct inode_info { 49 unsigned int nlink; 50 struct stat buf; 51 squashfs_inode inode; 52 unsigned int type; 53 unsigned int inode_number; 54 char read; 55 struct inode_info *next; 56}; 57 58struct priority_entry { 59 struct dir_ent *dir; 60 struct priority_entry *next; 61}; 62#endif 63