Implementation of ntfs_cluster_alloc(). (Some fixme's remaining
and note this is _completely_ untested code!!! DANGEROUS!!!) (Logical change 1.111)edge.strict_endians
cantab.net!aia21
parent
f4db4b6cb7
commit
b37b14e014
|
|
@ -19,12 +19,14 @@
|
|||
* Foundation,Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*/
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <errno.h>
|
||||
|
||||
#include "types.h"
|
||||
#include "attrib.h"
|
||||
#include "bitmap.h"
|
||||
#include "debug.h"
|
||||
#include "runlist.h"
|
||||
#include "volume.h"
|
||||
#include "lcnalloc.h"
|
||||
|
|
@ -52,10 +54,10 @@
|
|||
*
|
||||
* There are two data zones. First is the area between the end of the mft zone
|
||||
* and the end of the volume, and second is the area between the start of the
|
||||
* volume and the start of the mft zone. On unmodified/standard volumes, the
|
||||
* second mft zone doesn't exist due to the mft zone being expanded to cover
|
||||
* the start of the volume in order to reserve space for the mft bitmap
|
||||
* attribute.
|
||||
* volume and the start of the mft zone. On unmodified/standard NTFS 1.x
|
||||
* volumes, the second date zone doesn't exist due to the mft zone being
|
||||
* expanded to cover the start of the volume in order to reserve space for the
|
||||
* mft bitmap attribute.
|
||||
*
|
||||
* This is not the prettiest function but the complexity stems from the need of
|
||||
* implementing the mft vs data zoned approach and from the fact that we have
|
||||
|
|
@ -85,17 +87,693 @@
|
|||
* possible code paths. So at least for now, I am leaving the double logic -
|
||||
* better safe than sorry... (AIA)
|
||||
*/
|
||||
// FIXME: Add a start_vcn parameter if we need it and then instead of setting
|
||||
// rl[rlpos].vcn = 0; for the first run, add a sparse start element (LCN_HOLE),
|
||||
// and make rl[rlpos].vcn = start_vcn; for the first non-sparse run. (AIA)
|
||||
runlist *ntfs_cluster_alloc(ntfs_volume *vol, s64 count, LCN start_lcn,
|
||||
const NTFS_CLUSTER_ALLOCATION_ZONES zone)
|
||||
{
|
||||
if (!vol || count < 0 || start_lcn < 0 || !vol->lcnbmp_na ||
|
||||
LCN zone_start, zone_end, bmp_pos, bmp_initial_pos, last_read_pos, lcn;
|
||||
LCN prev_lcn = 0, prev_run_len = 0, mft_zone_size;
|
||||
s64 clusters, br;
|
||||
runlist *rl = NULL, *trl;
|
||||
u8 *buf, *byte;
|
||||
int err = 0, rlpos, rlsize, buf_size;
|
||||
u8 pass, done_zones, search_zone, need_writeback, bit;
|
||||
|
||||
Dprintf("%s(): Entering with count = 0x%Lx, start_lcn = 0x%Lx,
|
||||
zone = %s_ZONE.\n", (long long)count,
|
||||
(long long)start_lcn,
|
||||
zone == MFT_ZONE ? "MFT" : "DATA");
|
||||
if (!vol || count < 0 || start_lcn < -1 || !vol->lcnbmp_na ||
|
||||
zone < FIRST_ZONE || zone > LAST_ZONE) {
|
||||
fprintf(stderr, "%s(): Invalid arguments!\n", __FUNCTION__);
|
||||
errno = EINVAL;
|
||||
return NULL;
|
||||
}
|
||||
|
||||
errno = ENOTSUP;
|
||||
/* Allocate memory. */
|
||||
buf = (u8*)malloc(8192);
|
||||
if (!buf)
|
||||
return NULL;
|
||||
/*
|
||||
* If no specific @start_lcn was requested, use the current data zone
|
||||
* position, otherwise use the requested @start_lcn but make sure it
|
||||
* lies outside the mft zone. Also set done_zones to 0 (no zones done)
|
||||
* and pass depending on whether we are starting inside a zone (1) or
|
||||
* at the beginning of a zone (2). If requesting from the MFT_ZONE,
|
||||
* we either start at the current position within the mft zone or at
|
||||
* the specified position. If the latter is out of bounds then we start
|
||||
* at the beginning of the MFT_ZONE.
|
||||
*/
|
||||
done_zones = 0;
|
||||
pass = 1;
|
||||
/*
|
||||
* zone_start and zone_end are the current search range. search_zone
|
||||
* is 1 for mft zone, 2 for data zone 1 (end of mft zone till end of
|
||||
* volume) and 4 for data zone 2 (start of volume till start of mft
|
||||
* zone).
|
||||
*/
|
||||
zone_start = start_lcn;
|
||||
if (zone_start < 0) {
|
||||
if (zone == DATA_ZONE)
|
||||
zone_start = vol->data1_zone_pos;
|
||||
else
|
||||
zone_start = vol->mft_zone_pos;
|
||||
if (!zone_start) {
|
||||
/*
|
||||
* Zone starts at beginning of volume which means a
|
||||
* single pass is sufficient.
|
||||
*/
|
||||
pass = 2;
|
||||
}
|
||||
} else if (zone == DATA_ZONE && zone_start >= vol->mft_zone_start &&
|
||||
zone_start < vol->mft_zone_end) {
|
||||
zone_start = vol->mft_zone_end;
|
||||
/*
|
||||
* Starting at beginning of data1_zone which means a single
|
||||
* pass in this zone is sufficient.
|
||||
*/
|
||||
pass = 2;
|
||||
} else if (zone == MFT_ZONE && (zone_start < vol->mft_zone_start ||
|
||||
zone_start >= vol->mft_zone_end)) {
|
||||
zone_start = vol->mft_lcn;
|
||||
if (!vol->mft_zone_end)
|
||||
zone_start = 0;
|
||||
/*
|
||||
* Starting at beginning of volume which means a single pass
|
||||
* is sufficient.
|
||||
*/
|
||||
pass = 2;
|
||||
}
|
||||
if (zone == MFT_ZONE) {
|
||||
//FIXME: What about when vol->mft_zone_end is zero? (AIA)
|
||||
zone_end = vol->mft_zone_end;
|
||||
search_zone = 1;
|
||||
} else /* if (zone == DATA_ZONE) */ {
|
||||
/* Skip searching the mft zone. */
|
||||
done_zones |= 1;
|
||||
if (zone_start >= vol->mft_zone_end) {
|
||||
zone_end = vol->nr_clusters;
|
||||
search_zone = 2;
|
||||
} else {
|
||||
zone_end = vol->mft_zone_start;
|
||||
search_zone = 4;
|
||||
}
|
||||
}
|
||||
/*
|
||||
* bmp_pos is the current bit position inside the bitmap. We use
|
||||
* bmp_initial_pos to determine whether or not to do a zone switch.
|
||||
*/
|
||||
bmp_pos = bmp_initial_pos = zone_start;
|
||||
|
||||
/* Loop until all clusters are allocated, i.e. clusters == 0. */
|
||||
clusters = count;
|
||||
rlpos = rlsize = 0;
|
||||
while (1) {
|
||||
Dprintf("%s(): Start of outer while loop: done_zones = 0x%x, "
|
||||
"search_zone = %i, pass = %i, zone_start = "
|
||||
"0x%Lx, zone_end = 0x%Lx, bmp_initial_pos = "
|
||||
"0x%Lx, bmp_pos = 0x%Lx, rlpos = %i, rlsize = "
|
||||
"%i.\n", __FUNCTION__, done_zones, search_zone,
|
||||
pass, (long long)zone_start,
|
||||
(long long)zone_end, (long long)bmp_initial_pos,
|
||||
(long long)bmp_pos, rlpos, rlsize);
|
||||
/* Loop until we run out of free clusters. */
|
||||
last_read_pos = bmp_pos >> 3;
|
||||
Dprintf("%s(): last_read_pos = 0x%Lx.\n", __FUNCTION__,
|
||||
(long long)last_read_pos);
|
||||
br = ntfs_attr_pread(vol->lcnbmp_na, last_read_pos, 8192, buf);
|
||||
if (br <= 0) {
|
||||
if (!br) {
|
||||
/* Reached end of attribute. */
|
||||
Dprintf("%s(): End of attribute reached. "
|
||||
"Skipping to zone_pass_done.\n",
|
||||
__FUNCTION__);
|
||||
goto zone_pass_done;
|
||||
}
|
||||
err = errno;
|
||||
Dprintf("%s(): ntfs_attr_pread() failed. Aborting.\n",
|
||||
__FUNCTION__);
|
||||
goto err_ret;
|
||||
}
|
||||
/*
|
||||
* We might have read less than 8192 bytes if we are close to
|
||||
* the end of the attribute.
|
||||
*/
|
||||
buf_size = (int)br << 3;
|
||||
lcn = bmp_pos & 7;
|
||||
bmp_pos &= ~7;
|
||||
need_writeback = 0;
|
||||
Dprintf("%s(): Before inner while loop: buf_size = %i, "
|
||||
"lcn = 0x%Lx, bmp_pos = 0x%Lx, need_writeback "
|
||||
"= %i.\n", __FUNCTION__, buf_size,
|
||||
(long long)lcn, (long long)bmp_pos,
|
||||
need_writeback);
|
||||
while (lcn < buf_size && lcn + bmp_pos < zone_end) {
|
||||
byte = buf + (lcn >> 3);
|
||||
Dprintf("%s(): In inner while loop: buf_size = %i, "
|
||||
"lcn = 0x%Lx, bmp_pos = 0x%Lx, "
|
||||
"need_writeback = %i, byte ofs = 0x%x, "
|
||||
"*byte = 0x%x.\n", __FUNCTION__,
|
||||
buf_size, (long long)lcn,
|
||||
(long long)bmp_pos, need_writeback,
|
||||
lcn >> 3, *byte);
|
||||
/* Skip full bytes. */
|
||||
if (*byte == 0xff) {
|
||||
lcn += 8;
|
||||
Dprintf("%s(): continuing while loop 1.\n",
|
||||
__FUNCTION__);
|
||||
continue;
|
||||
}
|
||||
bit = 1 << (lcn & 7);
|
||||
Dprintf("%s(): bit = %i.\n", __FUNCTION__, bit);
|
||||
/* If the bit is already set, go onto the next one. */
|
||||
if (*byte & bit) {
|
||||
lcn++;
|
||||
Dprintf("%s(): continuing while loop 2.\n",
|
||||
__FUNCTION__);
|
||||
continue;
|
||||
}
|
||||
/* Allocate the bitmap bit. */
|
||||
*byte |= bit;
|
||||
/* We need to write this bitmap buffer back to disk! */
|
||||
need_writeback = 1;
|
||||
Dprintf("%s(): *byte = 0x%x, need_writeback is set.\n",
|
||||
__FUNCTION__, *byte);
|
||||
/* Reallocate memory if necessary. */
|
||||
if ((rlpos + 2) * sizeof(runlist) >= rlsize) {
|
||||
Dprintf("%s(): Reallocating space.\n",
|
||||
__FUNCTION__);
|
||||
/* Setup first free bit return value. */
|
||||
if (!rl) {
|
||||
start_lcn = lcn + bmp_pos;
|
||||
Dprintf("%s(): start_lcn = 0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)start_lcn);
|
||||
}
|
||||
rlsize += 4096;
|
||||
trl = (runlist*)realloc(rl, rlsize);
|
||||
if (!trl) {
|
||||
err = ENOMEM;
|
||||
Dprintf("%s(): Failed to allocate "
|
||||
"memory, going to "
|
||||
"wb_err_ret.\n",
|
||||
__FUNCTION__);
|
||||
goto wb_err_ret;
|
||||
}
|
||||
rl = trl;
|
||||
Dprintf("%s(): Reallocated memory, rlsize = "
|
||||
"0x%x.\n", __FUNCTION__,
|
||||
rlsize);
|
||||
}
|
||||
/*
|
||||
* Coalesce with previous run if adjacent LCNs.
|
||||
* Otherwise, append a new run.
|
||||
*/
|
||||
Dprintf("%s(): Adding run (lcn 0x%Lx, len 0x%Lx), "
|
||||
"prev_lcn = 0x%Lx, lcn = 0x%Lx, "
|
||||
"bmp_pos = 0x%Lx, prev_run_len = 0x%x, "
|
||||
"rlpos = %i.\n", __FUNCTION__,
|
||||
(long long)(lcn + bmp_pos), 1LL,
|
||||
(long long)prev_lcn, (long long)lcn,
|
||||
(long long)bmp_pos,
|
||||
(long long)prev_run_len, rlpos);
|
||||
if (prev_lcn == lcn + bmp_pos - prev_run_len && rlpos) {
|
||||
Dprintf("%s(): Coalescing to run (lcn 0x%Lx, "
|
||||
"len 0x%Lx).\n", __FUNCTION__,
|
||||
(long long)rl[rlpos - 1].lcn,
|
||||
(long long)
|
||||
rl[rlpos - 1].length);
|
||||
rl[rlpos - 1].length = ++prev_run_len;
|
||||
Dprintf("%s(): Run now (lcn 0x%Lx, len 0x%Lx), "
|
||||
"prev_run_len = 0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)rl[rlpos - 1].lcn,
|
||||
(long long)rl[rlpos - 1].length,
|
||||
(long long)prev_run_len);
|
||||
} else {
|
||||
if (rlpos) {
|
||||
Dprintf("%s(): Adding new run, "
|
||||
"(previous run lcn "
|
||||
"0x%Lx, len 0x%Lx).\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
rl[rlpos - 1].lcn,
|
||||
(long long)
|
||||
rl[rlpos - 1].length);
|
||||
rl[rlpos].vcn = rl[rlpos - 1].vcn +
|
||||
prev_run_len;
|
||||
} else {
|
||||
Dprintf("%s(): Adding new run, is "
|
||||
"first run.\n",
|
||||
__FUNCTION__);
|
||||
rl[rlpos].vcn = 0;
|
||||
}
|
||||
rl[rlpos].lcn = prev_lcn = lcn + bmp_pos;
|
||||
rl[rlpos].length = prev_run_len = 1;
|
||||
rlpos++;
|
||||
}
|
||||
/* Done? */
|
||||
if (!--clusters) {
|
||||
LCN tc;
|
||||
/*
|
||||
* Update the current zone position. Positions
|
||||
* of already scanned zones have been updated
|
||||
* during the respective zone switches.
|
||||
*/
|
||||
tc = lcn + bmp_pos + 1;
|
||||
Dprintf("%s(): Done. Updating current zone "
|
||||
"position, tc = 0x%Lx, "
|
||||
"search_zone = %i.\n",
|
||||
__FUNCTION__, (long long)tc,
|
||||
search_zone);
|
||||
switch (search_zone) {
|
||||
case 1:
|
||||
Dprintf("%s(): Before checks, "
|
||||
"vol->mft_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->mft_zone_pos);
|
||||
if (tc >= vol->mft_zone_end) {
|
||||
vol->mft_zone_pos =
|
||||
vol->mft_lcn;
|
||||
if (!vol->mft_zone_end)
|
||||
vol->mft_zone_pos = 0;
|
||||
} else if ((bmp_initial_pos >=
|
||||
vol->mft_zone_pos ||
|
||||
tc > vol->mft_zone_pos)
|
||||
&& tc >= vol->mft_lcn)
|
||||
vol->mft_zone_pos = tc;
|
||||
Dprintf("%s(): After checks, "
|
||||
"vol->mft_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->mft_zone_pos);
|
||||
break;
|
||||
case 2:
|
||||
Dprintf("%s(): Before checks, "
|
||||
"vol->data1_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->data1_zone_pos);
|
||||
if (tc >= vol->nr_clusters)
|
||||
vol->data1_zone_pos =
|
||||
vol->mft_zone_end;
|
||||
else if ((bmp_initial_pos >=
|
||||
vol->data1_zone_pos ||
|
||||
tc > vol->data1_zone_pos)
|
||||
&& tc >= vol->mft_zone_end)
|
||||
vol->data1_zone_pos = tc;
|
||||
Dprintf("%s(): After checks, "
|
||||
"vol->data1_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->data1_zone_pos);
|
||||
break;
|
||||
case 4:
|
||||
Dprintf("%s(): Before checks, "
|
||||
"vol->data2_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->data2_zone_pos);
|
||||
if (tc >= vol->mft_zone_start)
|
||||
vol->data2_zone_pos = 0;
|
||||
else if (bmp_initial_pos >=
|
||||
vol->data2_zone_pos ||
|
||||
tc > vol->data2_zone_pos)
|
||||
vol->data2_zone_pos = tc;
|
||||
Dprintf("%s(): After checks, "
|
||||
"vol->data2_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->data2_zone_pos);
|
||||
break;
|
||||
default:
|
||||
if (rl)
|
||||
free(rl);
|
||||
free(buf);
|
||||
NTFS_BUG("switch(search_zone)");
|
||||
return NULL;
|
||||
}
|
||||
Dprintf("%s(): Going to done_ret.\n",
|
||||
__FUNCTION__);
|
||||
goto done_ret;
|
||||
}
|
||||
lcn++;
|
||||
}
|
||||
bmp_pos += buf_size;
|
||||
Dprintf("%s(): After inner while loop: buf_size = 0x%x, "
|
||||
"lcn = 0x%Lx, bmp_pos = 0x%Lx, need_writeback "
|
||||
"= %i.\n", __FUNCTION__, buf_size,
|
||||
(long long)lcn, (long long)bmp_pos,
|
||||
need_writeback);
|
||||
if (need_writeback) {
|
||||
s64 bw;
|
||||
Dprintf("%s(): Writing back.\n", __FUNCTION__);
|
||||
need_writeback = 0;
|
||||
bw = ntfs_attr_pwrite(vol->lcnbmp_na, last_read_pos,
|
||||
br, buf);
|
||||
if (bw != br) {
|
||||
if (bw == -1)
|
||||
err = errno;
|
||||
else
|
||||
err = EIO;
|
||||
fprintf(stderr, "%s(): Bitmap writeback "
|
||||
"failed in read next buffer "
|
||||
"code path with error code "
|
||||
"%i.\n", __FUNCTION__, err);
|
||||
goto err_ret;
|
||||
}
|
||||
}
|
||||
if (bmp_pos < zone_end) {
|
||||
Dprintf("%s(): Continuing outer while loop, bmp_pos = "
|
||||
"0x%Lx, zone_end = 0x%Lx.\n",
|
||||
__FUNCTION__, (long long)bmp_pos,
|
||||
(long long)zone_end);
|
||||
continue;
|
||||
}
|
||||
zone_pass_done: /* Finished with the current zone pass. */
|
||||
Dprintf("%s(): At zone_pass_done, pass = %i.\n", __FUNCTION__,
|
||||
pass);
|
||||
if (pass == 1) {
|
||||
/*
|
||||
* Now do pass 2, scanning the first part of the zone
|
||||
* we omitted in pass 1.
|
||||
*/
|
||||
pass = 2;
|
||||
zone_end = zone_start;
|
||||
switch (search_zone) {
|
||||
case 1: /* mft_zone */
|
||||
zone_start = vol->mft_zone_start;
|
||||
break;
|
||||
case 2: /* data1_zone */
|
||||
zone_start = vol->mft_zone_end;
|
||||
break;
|
||||
case 4: /* data2_zone */
|
||||
zone_start = 0;
|
||||
break;
|
||||
default:
|
||||
NTFS_BUG("switch(search_zone), 2");
|
||||
}
|
||||
/* Sanity check. */
|
||||
if (zone_end < zone_start)
|
||||
zone_end = zone_start;
|
||||
bmp_pos = zone_start;
|
||||
Dprintf("%s(): Continuing outer while loop, pass = 2, "
|
||||
"zone_start = 0x%Lx, zone_end = 0x%Lx, "
|
||||
"bmp_pos = 0x%Lx.\n", __FUNCTION__,
|
||||
zone_start, zone_end, bmp_pos);
|
||||
continue;
|
||||
} /* pass == 2 */
|
||||
done_zones_check:
|
||||
Dprintf("%s(): At done_zones_check, search_zone = %i, "
|
||||
"done_zones before = 0x%x, done_zones after = "
|
||||
"0x%x.\n", __FUNCTION__, search_zone,
|
||||
done_zones, done_zones | search_zone);
|
||||
done_zones |= search_zone;
|
||||
if (done_zones < 7) {
|
||||
Dprintf("%s(): Switching zone.\n", __FUNCTION__);
|
||||
/* Now switch to the next zone we haven't done yet. */
|
||||
pass = 1;
|
||||
switch (search_zone) {
|
||||
case 1:
|
||||
Dprintf("%s(): Switching from mft zone to "
|
||||
"data1 zone.\n", __FUNCTION__);
|
||||
/* Update mft zone position. */
|
||||
if (rlpos) {
|
||||
LCN tc;
|
||||
Dprintf("%s(): Before checks, "
|
||||
"vol->mft_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->mft_zone_pos);
|
||||
tc = rl[rlpos - 1].lcn +
|
||||
rl[rlpos - 1].length;
|
||||
if (tc >= vol->mft_zone_end) {
|
||||
vol->mft_zone_pos =
|
||||
vol->mft_lcn;
|
||||
if (!vol->mft_zone_end)
|
||||
vol->mft_zone_pos = 0;
|
||||
} else if ((bmp_initial_pos >=
|
||||
vol->mft_zone_pos ||
|
||||
tc > vol->mft_zone_pos)
|
||||
&& tc >= vol->mft_lcn)
|
||||
vol->mft_zone_pos = tc;
|
||||
Dprintf("%s(): After checks, "
|
||||
"vol->mft_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->mft_zone_pos);
|
||||
}
|
||||
/* Switch from mft zone to data1 zone. */
|
||||
switch_to_data1_zone: search_zone = 2;
|
||||
zone_start = bmp_initial_pos =
|
||||
vol->data1_zone_pos;
|
||||
zone_end = vol->nr_clusters;
|
||||
if (zone_start == vol->mft_zone_end)
|
||||
pass = 2;
|
||||
if (zone_start >= zone_end) {
|
||||
vol->data1_zone_pos = zone_start =
|
||||
vol->mft_zone_end;
|
||||
pass = 2;
|
||||
}
|
||||
break;
|
||||
case 2:
|
||||
Dprintf("%s(): Switching from data1 zone to "
|
||||
"data2 zone.\n", __FUNCTION__);
|
||||
/* Update data1 zone position. */
|
||||
if (rlpos) {
|
||||
LCN tc;
|
||||
Dprintf("%s(): Before checks, "
|
||||
"vol->data1_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->data1_zone_pos);
|
||||
tc = rl[rlpos - 1].lcn +
|
||||
rl[rlpos - 1].length;
|
||||
if (tc >= vol->nr_clusters)
|
||||
vol->data1_zone_pos =
|
||||
vol->mft_zone_end;
|
||||
else if ((bmp_initial_pos >=
|
||||
vol->data1_zone_pos ||
|
||||
tc > vol->data1_zone_pos)
|
||||
&& tc >= vol->mft_zone_end)
|
||||
vol->data1_zone_pos = tc;
|
||||
Dprintf("%s(): After checks, "
|
||||
"vol->data1_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->data1_zone_pos);
|
||||
}
|
||||
/* Switch from data1 zone to data2 zone. */
|
||||
search_zone = 4;
|
||||
zone_start = bmp_initial_pos =
|
||||
vol->data2_zone_pos;
|
||||
zone_end = vol->mft_zone_start;
|
||||
if (!zone_start)
|
||||
pass = 2;
|
||||
if (zone_start >= zone_end) {
|
||||
vol->data2_zone_pos = zone_start =
|
||||
bmp_initial_pos = 0;
|
||||
pass = 2;
|
||||
}
|
||||
break;
|
||||
case 4:
|
||||
Dprintf("%s(): Switching from data2 zone to "
|
||||
"data1 zone.\n");
|
||||
/* Update data2 zone position. */
|
||||
if (rlpos) {
|
||||
LCN tc;
|
||||
Dprintf("%s(): Before checks, "
|
||||
"vol->data2_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->data2_zone_pos);
|
||||
tc = rl[rlpos - 1].lcn +
|
||||
rl[rlpos - 1].length;
|
||||
if (tc >= vol->mft_zone_start)
|
||||
vol->data2_zone_pos = 0;
|
||||
else if (bmp_initial_pos >=
|
||||
vol->data2_zone_pos ||
|
||||
tc > vol->data2_zone_pos)
|
||||
vol->data2_zone_pos = tc;
|
||||
Dprintf("%s(): After checks, "
|
||||
"vol->data2_zone_pos = "
|
||||
"0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)
|
||||
vol->data2_zone_pos);
|
||||
}
|
||||
/* Switch from data2 zone to data1 zone. */
|
||||
goto switch_to_data1_zone; /* See above. */
|
||||
default:
|
||||
NTFS_BUG("switch(search_zone) 3");
|
||||
}
|
||||
Dprintf("%s(): After zone switch, search_zone = %i, "
|
||||
"pass = %i, bmp_initial_pos = 0x%Lx, "
|
||||
"zone_start = 0x%Lx, zone_end = "
|
||||
"0x%Lx.\n", __FUNCTION__, search_zone,
|
||||
pass, (long long)bmp_initial_pos,
|
||||
(long long)zone_start,
|
||||
(long long)zone_end);
|
||||
bmp_pos = zone_start;
|
||||
if (zone_start == zone_end) {
|
||||
Dprintf("%s(): Empty zone, going to "
|
||||
"done_zones_check.\n",
|
||||
__FUNCTION__);
|
||||
/* Empty zone. Don't bother searching it. */
|
||||
goto done_zones_check;
|
||||
}
|
||||
Dprintf("%s(): Continuing outer while loop.\n",
|
||||
__FUNCTION__);
|
||||
continue;
|
||||
} /* done_zones == 7 */
|
||||
Dprintf("%s(): All zones are finished.\n", __FUNCTION__);
|
||||
/*
|
||||
* All zones are finished! If DATA_ZONE, shrink mft zone. If
|
||||
* MFT_ZONE, we have really run out of space.
|
||||
*/
|
||||
mft_zone_size = vol->mft_zone_end - vol->mft_zone_start;
|
||||
Dprintf("%s(): vol->mft_zone_start = 0x%Lx, vol->mft_zone_end "
|
||||
"= 0x%Lx, mft_zone_size = 0x%Lx.\n",
|
||||
__FUNCTION__, (long long)vol->mft_zone_start,
|
||||
(long long)vol->mft_zone_end,
|
||||
(long long)mft_zone_size);
|
||||
if (zone == MFT_ZONE || mft_zone_size <= 0) {
|
||||
Dprintf("%s(): No free clusters left, going to "
|
||||
"err_ret.\n", __FUNCTION__);
|
||||
/* Really no more space left on device. */
|
||||
err = ENOSPC;
|
||||
goto err_ret;
|
||||
} /* zone == DATA_ZONE && mft_zone_size > 0 */
|
||||
Dprintf("%s(): Shrinking mft zone.\n", __FUNCTION__);
|
||||
zone_end = vol->mft_zone_end;
|
||||
mft_zone_size >>= 1;
|
||||
if (mft_zone_size > 0)
|
||||
vol->mft_zone_end = vol->mft_zone_start + mft_zone_size;
|
||||
else /* mft zone and data2 zone no longer exist. */
|
||||
vol->data2_zone_pos = vol->mft_zone_start =
|
||||
vol->mft_zone_end = 0;
|
||||
if (vol->mft_zone_pos >= vol->mft_zone_end) {
|
||||
vol->mft_zone_pos = vol->mft_lcn;
|
||||
if (!vol->mft_zone_end)
|
||||
vol->mft_zone_pos = 0;
|
||||
}
|
||||
bmp_pos = zone_start = bmp_initial_pos =
|
||||
vol->data1_zone_pos = vol->mft_zone_end;
|
||||
search_zone = 2;
|
||||
pass = 2;
|
||||
done_zones &= ~2;
|
||||
Dprintf("%s(): After shrinking mft zone, mft_zone_size = "
|
||||
"0x%Lx, vol->mft_zone_start = 0x%Lx, "
|
||||
"vol->mft_zone_end = 0x%Lx, vol->mft_zone_pos "
|
||||
"= 0x%Lx, search_zone = 2, pass = 2, "
|
||||
"dones_zones = 0x%x, zone_start = 0x%Lx, "
|
||||
"zone_end = 0x%Lx, vol->data1_zone_pos = "
|
||||
"0x%Lx, continuing outer while loop.\n",
|
||||
__FUNCTION__, (long long)mft_zone_size,
|
||||
(long long)vol->mft_zone_start,
|
||||
(long long)vol->mft_zone_end,
|
||||
(long long)vol->mft_zone_pos,
|
||||
done_zones, (long long)zone_start,
|
||||
(long long)zone_end,
|
||||
(long long)vol->data1_zone_pos);
|
||||
}
|
||||
Dprintf("%s(): After outer while loop.\n");
|
||||
done_ret:
|
||||
Dprintf("%s(): At done_ret.\n");
|
||||
/* Add runlist terminator element. */
|
||||
rl[rlpos].vcn = rl[rlpos - 1].vcn + rl[rlpos - 1].length;
|
||||
rl[rlpos].lcn = LCN_ENOENT;
|
||||
rl[rlpos].length = 0;
|
||||
if (need_writeback) {
|
||||
s64 bw;
|
||||
Dprintf("%s(): Writing back.\n", __FUNCTION__);
|
||||
need_writeback = 0;
|
||||
bw = ntfs_attr_pwrite(vol->lcnbmp_na, last_read_pos, br, buf);
|
||||
if (bw != br) {
|
||||
if (bw < 0)
|
||||
err = errno;
|
||||
else
|
||||
err = EIO;
|
||||
fprintf(stderr, "%s(): Bitmap writeback failed "
|
||||
"in done code path with error code "
|
||||
"%i.\n", __FUNCTION__, err);
|
||||
goto err_ret;
|
||||
}
|
||||
}
|
||||
done_err_ret:
|
||||
Dprintf("%s(): At done_err_ret (follows done_ret).\n");
|
||||
free(buf);
|
||||
/* Done! */
|
||||
if (!err)
|
||||
return rl;
|
||||
Dprintf("%s(): Failed to allocate clusters. Returning with error code "
|
||||
"%i.\n", __FUNCTION__, err);
|
||||
errno = err;
|
||||
return NULL;
|
||||
wb_err_ret:
|
||||
Dprintf("%s(): At wb_err_ret.\n", __FUNCTION__);
|
||||
if (need_writeback) {
|
||||
s64 bw;
|
||||
Dprintf("%s(): Writing back.\n", __FUNCTION__);
|
||||
need_writeback = 0;
|
||||
bw = ntfs_attr_pwrite(vol->lcnbmp_na, last_read_pos, br, buf);
|
||||
if (bw != br) {
|
||||
if (bw < 0)
|
||||
err = errno;
|
||||
else
|
||||
err = EIO;
|
||||
fprintf(stderr, "%s(): Bitmap writeback failed "
|
||||
"in error code path with error code "
|
||||
"%i.\n", __FUNCTION__, err);
|
||||
}
|
||||
}
|
||||
err_ret:
|
||||
Dprintf("%s(): At err_ret.\n", __FUNCTION__);
|
||||
if (rl) {
|
||||
if (err == ENOSPC) {
|
||||
Dprintf("%s(): err = ENOSPC, first free lcn = 0x%Lx, "
|
||||
"could allocate up to = 0x%Lx "
|
||||
"clusters.\n", __FUNCTION__,
|
||||
(long long)rl[0].lcn,
|
||||
(long long)count - clusters);
|
||||
}
|
||||
//FIXME: We don't have an attribute just a run list here! Also rl is not
|
||||
// terminated at this moment in time! (AIA)
|
||||
#if 0
|
||||
/* Deallocate all allocated clusters. */
|
||||
Dprintf("%s(): Deallocating allocated clusters.\n",
|
||||
__FUNCTION__);
|
||||
ntfs_cluster_free(vol, attrib_with_rl, 0, -1);
|
||||
#endif
|
||||
fprintf(stderr, "%s(): Eeek! Leaving inconsistent metadata.\n",
|
||||
__FUNCTION__);
|
||||
/* Free the runlist. */
|
||||
free(rl);
|
||||
rl = NULL;
|
||||
} else {
|
||||
if (err == ENOSPC) {
|
||||
Dprintf("%s(): No space left at all, err = ENOSPC, "
|
||||
"first free lcn = 0x%Lx.\n",
|
||||
__FUNCTION__,
|
||||
(long long)vol->data1_zone_pos);
|
||||
}
|
||||
}
|
||||
Dprintf("%s(): rl = NULL, going to done_err_ret.\n", __FUNCTION__);
|
||||
goto done_err_ret;
|
||||
}
|
||||
|
||||
/**
|
||||
|
|
|
|||
Loading…
Reference in New Issue