root->cached_path = get_pool_memory(PM_FNAME);
root->type = TN_ROOT;
root->fname = "";
+ root->can_access = 1;
HL_ENTRY* entry = NULL;
root->hardlinks.init(entry, &entry->link, 0);
return root;
node = (TREE_NODE *)tree_alloc(root, size);
memset(node, 0, size);
node->delta_seq = -1;
+ node->can_access = 1;
return node;
}
strcpy(node->fname, fname);
node->parent = parent;
node->type = type;
- node->can_access = true;
-
/* Maintain a linear chain of nodes */
if (!root->first) {
root->first = node;
unsigned int type: 8; /* node type */
unsigned int extract: 1; /* extract item */
unsigned int extract_dir: 1; /* extract dir entry only */
- unsigned int have_link: 1; /* set if have hard link */
+ unsigned int hard_link: 1; /* set if have hard link */
+ unsigned int soft_link: 1; /* set if is soft link */
unsigned int inserted: 1; /* set when newly inserted */
unsigned int loaded: 1; /* set when the dir is in the tree */
+ unsigned int can_access: 1; /* Can access to this node */
struct s_tree_node *parent;
struct s_tree_node *next; /* next hash of FileIndex */
struct delta_list *delta_list; /* delta parts for this node */