On 12/20/2014 03:39 AM, Josef Bacik wrote:
On 12/20/2014 06:23 AM, Robert White wrote:
On 12/19/2014 01:17 PM, Josef Bacik wrote:
tl;dr: Cow means you can in the worst case end up using 2 * filesize -
blocksize of data on disk and the file will appear to be filesize.
Thanks,
Doesn't the worst case more like N^log(N) (when N is file in blocksize)
in the pernicious case?
Staggered block overwrites can "peer down" through gaps to create more
than two layers of retention. The only real requirement is that each
layer get smaller than the one before it so as to leave some of each of
it's predecessor visible.
So if I make a file size N blocks, then overwrite it with N-1 blocks,
then overwrite it again with N-2 blocks (etc). I can easily create a
deep slop of obscured data.
[-----------------]
[----------------]
[---------------]
[--------------]
[-------------]
[------------]
[-----------]
[----------]
[---------]
(etc...)
Or would I have to bracket the front and back
----------
--------
------
Or could I bracket the sides
---------
---- ----
--- ---
-- --
- -
There's got to be pahological patterns like this that can end up with a
heck of a lot of "hidden" data.
Just the sloped case would do it, the pathological case would result in
way more used than you expect. So I guess the worst case would be
something like
(num_blocks + (num_blocks - 1)!) * blocksize
I think that for a single file it's not factorial but consecutive sum.
(One of Gauss' equations.)
so max=((n * (n+1))/2)*blocksize
A lot smaller than factorial but still n^2+n blocks, which is nothing to
discard lightly.
in actually size usage. Our extents are limited to 128mb in size, but
still that ends up being pretty huge. I'm actually going to do this
locally and see what happens. Thanks,
Josef
--
To unsubscribe from this list: send the line "unsubscribe linux-btrfs" in
the body of a message to majord...@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
