mirror of
https://git.code.sf.net/p/ntfs-3g/ntfs-3g.git
synced 2024-11-23 18:14:24 +08:00
forgot "cvs delete"
This commit is contained in:
yura
parent
ae37e54d8c
commit
a3a318a8b4
@ -1,38 +0,0 @@
|
|||||||
/*
|
|
||||||
* rich.h - Temporary junk file. Part of the Linux-NTFS project.
|
|
||||||
*
|
|
||||||
* Copyright (c) 2004-2005 Richard Russon
|
|
||||||
*
|
|
||||||
* This program/include file 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 of the License, or
|
|
||||||
* (at your option) any later version.
|
|
||||||
*
|
|
||||||
* This program/include file 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 (in the main directory of the Linux-NTFS
|
|
||||||
* distribution in the file COPYING); if not, write to the Free Software
|
|
||||||
* Foundation,Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef _NTFS_RICH_H_
|
|
||||||
#define _NTFS_RICH_H_
|
|
||||||
|
|
||||||
#include "layout.h"
|
|
||||||
#include "attrib.h"
|
|
||||||
#include "bitmap.h"
|
|
||||||
|
|
||||||
#define ATTR_SIZE(s) ROUND_UP(s, 3)
|
|
||||||
|
|
||||||
ATTR_RECORD * find_attribute(const ATTR_TYPES type, ntfs_attr_search_ctx *ctx);
|
|
||||||
ATTR_RECORD * find_first_attribute(const ATTR_TYPES type, MFT_RECORD *mft);
|
|
||||||
int utils_free_non_residents3(struct ntfs_bmp *bmp, ntfs_inode *inode, ATTR_RECORD *attr);
|
|
||||||
int utils_free_non_residents2(ntfs_inode *inode, struct ntfs_bmp *bmp);
|
|
||||||
void ntfs_name_print(ntfschar *name, int name_len);
|
|
||||||
|
|
||||||
#endif /* _NTFS_RICH_H_ */
|
|
||||||
|
|
||||||
@ -1,82 +0,0 @@
|
|||||||
/*
|
|
||||||
* tree.h - Directory tree handling code. Part of the Linux-NTFS project.
|
|
||||||
*
|
|
||||||
* Copyright (c) 2004-2005 Richard Russon
|
|
||||||
*
|
|
||||||
* This program/include file 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 of the License, or
|
|
||||||
* (at your option) any later version.
|
|
||||||
*
|
|
||||||
* This program/include file 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 (in the main directory of the Linux-NTFS
|
|
||||||
* distribution in the file COPYING); if not, write to the Free Software
|
|
||||||
* Foundation,Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef _NTFS_TREE_H_
|
|
||||||
#define _NTFS_TREE_H_
|
|
||||||
|
|
||||||
#include "layout.h"
|
|
||||||
#include "volume.h"
|
|
||||||
|
|
||||||
struct ntfs_dir;
|
|
||||||
|
|
||||||
/**
|
|
||||||
* struct ntfs_dt -
|
|
||||||
*/
|
|
||||||
struct ntfs_dt {
|
|
||||||
struct ntfs_dir *dir;
|
|
||||||
struct ntfs_dt *parent;
|
|
||||||
u8 *data;
|
|
||||||
int data_len;
|
|
||||||
int child_count;
|
|
||||||
INDEX_ENTRY **children;
|
|
||||||
struct ntfs_dt **sub_nodes;
|
|
||||||
ntfs_inode **inodes;
|
|
||||||
VCN vcn;
|
|
||||||
INDEX_HEADER *header;
|
|
||||||
BOOL changed;
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
void ntfs_dt_free(struct ntfs_dt *dt);
|
|
||||||
int ntfs_dt_rollback(struct ntfs_dt *dt);
|
|
||||||
int ntfs_dt_commit(struct ntfs_dt *dt);
|
|
||||||
BOOL ntfs_dt_create_children2(struct ntfs_dt *dt, int count);
|
|
||||||
BOOL ntfs_dt_resize_children3(struct ntfs_dt *dt, int new);
|
|
||||||
int ntfs_dt_root_count(struct ntfs_dt *dt);
|
|
||||||
int ntfs_dt_alloc_count(struct ntfs_dt *dt);
|
|
||||||
int ntfs_dt_initialise2(ntfs_volume *vol, struct ntfs_dt *dt);
|
|
||||||
struct ntfs_dt * ntfs_dt_create(struct ntfs_dir *dir, struct ntfs_dt *parent, VCN vcn);
|
|
||||||
MFT_REF ntfs_dt_find(struct ntfs_dt *dt, ntfschar *name, int name_len);
|
|
||||||
struct ntfs_dt * ntfs_dt_find2(struct ntfs_dt *dt, ntfschar *name, int name_len, int *index_num);
|
|
||||||
struct ntfs_dt * ntfs_dt_find3(struct ntfs_dt *dt, ntfschar *name, int name_len, int *index_num);
|
|
||||||
struct ntfs_dt * ntfs_dt_find4(struct ntfs_dt *dt, ntfschar *name, int name_len, int *index_num);
|
|
||||||
void ntfs_dt_find_all(struct ntfs_dt *dt);
|
|
||||||
int ntfs_dt_find_parent(struct ntfs_dt *dt);
|
|
||||||
BOOL ntfs_dt_isroot(struct ntfs_dt *dt);
|
|
||||||
int ntfs_dt_root_freespace(struct ntfs_dt *dt);
|
|
||||||
int ntfs_dt_alloc_freespace(struct ntfs_dt *dt);
|
|
||||||
int ntfs_dt_transfer(struct ntfs_dt *old, struct ntfs_dt *new, int start, int count);
|
|
||||||
int ntfs_dt_alloc_insert(struct ntfs_dt *dt, INDEX_ENTRY *first, int count);
|
|
||||||
INDEX_ENTRY * ntfs_dt_alloc_insert2(struct ntfs_dt *dt, int before, int count, int bytes);
|
|
||||||
int ntfs_dt_root_insert(struct ntfs_dt *dt, INDEX_ENTRY *first, int count);
|
|
||||||
int ntfs_dt_alloc_remove2(struct ntfs_dt *dt, int start, int count);
|
|
||||||
int ntfs_dt_root_remove2(struct ntfs_dt *dt, int start, int count);
|
|
||||||
int ntfs_dt_transfer2(struct ntfs_dt *old, struct ntfs_dt *new, int start, int count);
|
|
||||||
int ntfs_dt_root_replace(struct ntfs_dt *del, int del_num, INDEX_ENTRY *del_ie, INDEX_ENTRY *suc_ie);
|
|
||||||
BOOL ntfs_dt_alloc_replace(struct ntfs_dt *del, int del_num, INDEX_ENTRY *del_ie, INDEX_ENTRY *suc_ie);
|
|
||||||
BOOL ntfs_dt_root_remove(struct ntfs_dt *del, int del_num);
|
|
||||||
BOOL ntfs_dt_alloc_remove(struct ntfs_dt *del, int del_num);
|
|
||||||
int ntfs_dt_alloc_add(struct ntfs_dt *parent, int index_num, INDEX_ENTRY *ie, struct ntfs_dt *child);
|
|
||||||
int ntfs_dt_root_add(struct ntfs_dt *parent, int index_num, INDEX_ENTRY *ie, struct ntfs_dt *child);
|
|
||||||
int ntfs_dt_add2(INDEX_ENTRY *ie, struct ntfs_dt *suc, int suc_num, struct ntfs_dt *ded);
|
|
||||||
|
|
||||||
#endif /* _NTFS_TREE_H_ */
|
|
||||||
|
|
||||||
215
libntfs/rich.c
215
libntfs/rich.c
@ -1,215 +0,0 @@
|
|||||||
/**
|
|
||||||
* rich.c - Temporary junk file. Part of the Linux-NTFS project.
|
|
||||||
*
|
|
||||||
* Copyright (c) 2004-2005 Richard Russon
|
|
||||||
*
|
|
||||||
* This program/include file 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 of the License, or
|
|
||||||
* (at your option) any later version.
|
|
||||||
*
|
|
||||||
* This program/include file 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 (in the main directory of the Linux-NTFS
|
|
||||||
* distribution in the file COPYING); if not, write to the Free Software
|
|
||||||
* Foundation,Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifdef NTFS_RICH
|
|
||||||
|
|
||||||
#ifdef HAVE_CONFIG_H
|
|
||||||
#include "config.h"
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef HAVE_STDLIB_H
|
|
||||||
#include <stdlib.h>
|
|
||||||
#endif
|
|
||||||
#ifdef HAVE_ERRNO_H
|
|
||||||
#include <errno.h>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifdef HAVE_ERRNO_H
|
|
||||||
#include <errno.h>
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#include "rich.h"
|
|
||||||
#include "layout.h"
|
|
||||||
#include "logging.h"
|
|
||||||
|
|
||||||
/**
|
|
||||||
* find_attribute - Find an attribute of the given type
|
|
||||||
* @type: An attribute type, e.g. AT_FILE_NAME
|
|
||||||
* @ctx: A search context, created using ntfs_get_attr_search_ctx
|
|
||||||
*
|
|
||||||
* Using the search context to keep track, find the first/next occurrence of a
|
|
||||||
* given attribute type.
|
|
||||||
*
|
|
||||||
* N.B. This will return a pointer into @mft. As long as the search context
|
|
||||||
* has been created without an inode, it won't overflow the buffer.
|
|
||||||
*
|
|
||||||
* Return: Pointer Success, an attribute was found
|
|
||||||
* NULL Error, no matching attributes were found
|
|
||||||
*/
|
|
||||||
ATTR_RECORD * find_attribute(const ATTR_TYPES type, ntfs_attr_search_ctx *ctx)
|
|
||||||
{
|
|
||||||
if (!ctx) {
|
|
||||||
errno = EINVAL;
|
|
||||||
return NULL;
|
|
||||||
}
|
|
||||||
|
|
||||||
ntfs_log_trace ("\n");
|
|
||||||
if (ntfs_attr_lookup(type, NULL, 0, 0, 0, NULL, 0, ctx) != 0) {
|
|
||||||
ntfs_log_debug("find_attribute didn't find an attribute of type: 0x%02x.\n", type);
|
|
||||||
return NULL; /* None / no more of that type */
|
|
||||||
}
|
|
||||||
|
|
||||||
ntfs_log_debug("find_attribute found an attribute of type: 0x%02x.\n", type);
|
|
||||||
return ctx->attr;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* find_first_attribute - Find the first attribute of a given type
|
|
||||||
* @type: An attribute type, e.g. AT_FILE_NAME
|
|
||||||
* @mft: A buffer containing a raw MFT record
|
|
||||||
*
|
|
||||||
* Search through a raw MFT record for an attribute of a given type.
|
|
||||||
* The return value is a pointer into the MFT record that was supplied.
|
|
||||||
*
|
|
||||||
* N.B. This will return a pointer into @mft. The pointer won't stray outside
|
|
||||||
* the buffer, since we created the search context without an inode.
|
|
||||||
*
|
|
||||||
* Return: Pointer Success, an attribute was found
|
|
||||||
* NULL Error, no matching attributes were found
|
|
||||||
*/
|
|
||||||
ATTR_RECORD * find_first_attribute(const ATTR_TYPES type, MFT_RECORD *mft)
|
|
||||||
{
|
|
||||||
ntfs_attr_search_ctx *ctx;
|
|
||||||
ATTR_RECORD *rec;
|
|
||||||
|
|
||||||
if (!mft) {
|
|
||||||
errno = EINVAL;
|
|
||||||
return NULL;
|
|
||||||
}
|
|
||||||
|
|
||||||
ntfs_log_trace ("\n");
|
|
||||||
ctx = ntfs_attr_get_search_ctx(NULL, mft);
|
|
||||||
if (!ctx) {
|
|
||||||
//XXX ntfs_log_error("Couldn't create a search context.\n");
|
|
||||||
return NULL;
|
|
||||||
}
|
|
||||||
|
|
||||||
rec = find_attribute(type, ctx);
|
|
||||||
ntfs_attr_put_search_ctx(ctx);
|
|
||||||
if (rec)
|
|
||||||
ntfs_log_debug("find_first_attribute: found attr of type 0x%02x.\n", type);
|
|
||||||
else
|
|
||||||
ntfs_log_debug("find_first_attribute: didn't find attr of type 0x%02x.\n", type);
|
|
||||||
return rec;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* ntfs_name_print - Send a Unicode name to the debug log
|
|
||||||
* @name:
|
|
||||||
* @name_len:
|
|
||||||
*
|
|
||||||
* Description...
|
|
||||||
*
|
|
||||||
* Returns:
|
|
||||||
*/
|
|
||||||
void ntfs_name_print(ntfschar *name, int name_len)
|
|
||||||
{
|
|
||||||
char *buffer = NULL;
|
|
||||||
|
|
||||||
if (name_len) {
|
|
||||||
ntfs_ucstombs(name, name_len, &buffer, 0);
|
|
||||||
ntfs_log_debug("%s", buffer);
|
|
||||||
free(buffer);
|
|
||||||
} else {
|
|
||||||
ntfs_log_debug("!");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* utils_free_non_residents3 - Free all the non-resident attributes of an inode
|
|
||||||
* @bmp:
|
|
||||||
* @inode:
|
|
||||||
* @attr:
|
|
||||||
*
|
|
||||||
* Description...
|
|
||||||
*
|
|
||||||
* Returns:
|
|
||||||
*/
|
|
||||||
int utils_free_non_residents3(struct ntfs_bmp *bmp, ntfs_inode *inode, ATTR_RECORD *attr)
|
|
||||||
{
|
|
||||||
ntfs_attr *na;
|
|
||||||
runlist_element *rl;
|
|
||||||
LCN size;
|
|
||||||
LCN count;
|
|
||||||
|
|
||||||
if (!bmp)
|
|
||||||
return 1;
|
|
||||||
if (!inode)
|
|
||||||
return 1;
|
|
||||||
if (!attr)
|
|
||||||
return 1;
|
|
||||||
if (!attr->non_resident)
|
|
||||||
return 0;
|
|
||||||
|
|
||||||
ntfs_log_trace ("\n");
|
|
||||||
na = ntfs_attr_open(inode, attr->type, NULL, 0);
|
|
||||||
if (!na)
|
|
||||||
return 1;
|
|
||||||
|
|
||||||
ntfs_attr_map_whole_runlist(na);
|
|
||||||
rl = na->rl;
|
|
||||||
size = na->allocated_size >> inode->vol->cluster_size_bits;
|
|
||||||
for (count = 0; count < size; count += rl->length, rl++) {
|
|
||||||
if (ntfs_bmp_set_range(bmp, rl->lcn, rl->length, 0) < 0) {
|
|
||||||
ntfs_log_warning("set range : %lld - %lld FAILED\n", rl->lcn, rl->lcn+rl->length-1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
ntfs_attr_close(na);
|
|
||||||
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* utils_free_non_residents2 - Find all the non-resident attributes of an inode
|
|
||||||
* @inode:
|
|
||||||
* @bmp:
|
|
||||||
*
|
|
||||||
* Description...
|
|
||||||
*
|
|
||||||
* Returns:
|
|
||||||
*/
|
|
||||||
int utils_free_non_residents2(ntfs_inode *inode, struct ntfs_bmp *bmp)
|
|
||||||
{
|
|
||||||
ntfs_attr_search_ctx *ctx;
|
|
||||||
|
|
||||||
if (!inode)
|
|
||||||
return -1;
|
|
||||||
if (!bmp)
|
|
||||||
return -1;
|
|
||||||
|
|
||||||
ntfs_log_trace ("\n");
|
|
||||||
ctx = ntfs_attr_get_search_ctx(NULL, inode->mrec);
|
|
||||||
if (!ctx) {
|
|
||||||
ntfs_log_info("can't create a search context\n");
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
while (ntfs_attr_lookup(AT_UNUSED, NULL, 0, 0, 0, NULL, 0, ctx) == 0) {
|
|
||||||
utils_free_non_residents3(bmp, inode, ctx->attr);
|
|
||||||
}
|
|
||||||
|
|
||||||
ntfs_attr_put_search_ctx(ctx);
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
#endif /* NTFS_RICH */
|
|
||||||
|
|
||||||
2366
libntfs/tree.c
2366
libntfs/tree.c
File diff suppressed because it is too large
Load Diff
Loading…
Reference in New Issue
Block a user