1 #ifndef SORT_H 2 #define SORT_H 3 4 /* 5 * Squashfs 6 * 7 * Copyright (c) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2013 8 * Phillip Lougher <phillip (at) squashfs.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 27 struct priority_entry { 28 struct dir_ent *dir; 29 struct priority_entry *next; 30 }; 31 32 extern int read_sort_file(char *, int, char *[]); 33 extern void sort_files_and_write(struct dir_info *); 34 extern void generate_file_priorities(struct dir_info *, int priority, 35 struct stat *); 36 extern struct priority_entry *priority_list[65536]; 37 #endif 38
