2 * Directory tree build/traverse routines
4 * Kern Sibbald, June MMII
8 Copyright (C) 2002-2004 Kern Sibbald and John Walker
10 This program is free software; you can redistribute it and/or
11 modify it under the terms of the GNU General Public License as
12 published by the Free Software Foundation; either version 2 of
13 the License, or (at your option) any later version.
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 GNU
18 General Public License for more details.
20 You should have received a copy of the GNU General Public
21 License along with this program; if not, write to the Free
22 Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
28 struct s_mem *next; /* next buffer */
29 int rem; /* remaining bytes */
30 char *mem; /* memory pointer */
31 char first[1]; /* first byte */
35 * Keep this node as small as possible because
36 * there is one for each file.
39 char *fname; /* file name */
40 int32_t FileIndex; /* file index */
41 uint32_t JobId; /* JobId */
42 uint16_t fname_len; /* filename length */
43 unsigned int type: 8; /* node type */
44 unsigned int extract: 1; /* extract item */
45 unsigned int extract_dir: 1; /* extract dir entry only */
46 unsigned int have_link: 1; /* set if have hard link */
47 struct s_tree_node *parent;
48 struct s_tree_node *sibling;
49 struct s_tree_node *child;
50 struct s_tree_node *next; /* next hash of FileIndex */
52 typedef struct s_tree_node TREE_NODE;
55 char *fname; /* file name */
56 int32_t FileIndex; /* file index */
57 uint32_t JobId; /* JobId */
58 uint16_t fname_len; /* filename length */
59 unsigned int type: 8; /* node type */
60 unsigned int extract: 1; /* extract item */
61 unsigned int extract_dir: 1; /* extract dir entry only */
62 unsigned int have_link: 1; /* set if have hard link */
63 struct s_tree_node *parent;
64 struct s_tree_node *sibling;
65 struct s_tree_node *child;
66 struct s_tree_node *next; /* next hash of FileIndex */
68 /* The above ^^^ must be identical to a TREE_NODE structure */
69 struct s_tree_node *first; /* first entry in the tree */
70 struct s_tree_node *last; /* last entry in tree */
71 struct s_mem *mem; /* tree memory */
72 uint32_t total_size; /* total bytes allocated */
73 uint32_t blocks; /* total mallocs */
74 int cached_path_len; /* length of cached path */
75 char *cached_path; /* cached current path */
76 TREE_NODE *cached_parent; /* cached parent for above path */
78 typedef struct s_tree_root TREE_ROOT;
81 #define TN_ROOT 1 /* root node */
82 #define TN_NEWDIR 2 /* created directory to fill path */
83 #define TN_DIR 3 /* directory entry */
84 #define TN_DIR_NLS 4 /* directory -- no leading slash -- win32 */
85 #define TN_FILE 5 /* file entry */
87 TREE_ROOT *new_tree(int count);
88 TREE_NODE *new_tree_node(TREE_ROOT *root, int type);
89 TREE_NODE *insert_tree_node(char *fname, TREE_NODE *node,
90 TREE_ROOT *root, TREE_NODE *parent);
91 TREE_NODE *make_tree_path(char *path, TREE_ROOT *root);
92 TREE_NODE *tree_cwd(char *path, TREE_ROOT *root, TREE_NODE *node);
93 TREE_NODE *tree_relcwd(char *path, TREE_ROOT *root, TREE_NODE *node);
94 void append_tree_node(char *path, TREE_NODE *node, TREE_ROOT *root, TREE_NODE *parent);
95 void print_tree(char *path, TREE_NODE *root);
96 void free_tree(TREE_ROOT *root);
97 int tree_getpath(TREE_NODE *node, char *buf, int buf_size);
100 TREE_NODE *first_tree_node(TREE_ROOT *root);
101 TREE_NODE *next_tree_node(TREE_NODE *node);
103 #define first_tree_node(r) (r)->first
104 #define next_tree_node(n) (n)->next