blob: f90138ba5447b8a352415dea1bd2c58d4787f49c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
/* Calculation of various derived store fields
Copyright (C) 1995, 1996 Free Software Foundation, Inc.
Written by Miles Bader <miles@gnu.ai.mit.edu>
This file is part of the GNU Hurd.
The GNU Hurd 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, or (at
your option) any later version.
The GNU Hurd 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; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include "store.h"
/* Fills in the values of the various fields in STORE that are derivable from
the set of runs & the block size. */
void
_store_derive (struct store *store)
{
unsigned i;
off_t *runs = store->runs;
unsigned runs_len = store->runs_len;
size_t bsize = store->block_size;
/* BLOCK & SIZE */
store->blocks = 0;
for (i = 0; i < runs_len; i += 2)
{
store->wrap += runs[i + 1];
if (runs[i] >= 0)
store->blocks += runs[i + 1];
}
if (store->end == 0)
/* END not set; set it using the info from RUNS. */
store->end = store->wrap;
else if (store->wrap < store->end)
/* A wrapped disk! RUNS is repeated N times to reach END. Adjust BLOCKS
to include all iterations. */
{
size_t num_iters = store->end / store->wrap;
off_t last_part_base = num_iters * store->wrap;
store->blocks *= num_iters;
for (i = 0; i < runs_len; i += 2)
if (last_part_base + runs[i + 1] < store->end)
{
store->blocks += store->end - (last_part_base + runs[i + 1]);
break;
}
else if (runs[i] >= 0)
store->blocks += runs[i + 1];
}
store->size = store->end * bsize;
/* LOG2_BLOCK_SIZE */
store->log2_block_size = 0;
while ((1 << store->log2_block_size) < bsize)
store->log2_block_size++;
if ((1 << store->log2_block_size) != bsize)
store->log2_block_size = 0;
/* LOG2_BLOCKS_PER_PAGE */
store->log2_blocks_per_page = 0;
while ((bsize << store->log2_blocks_per_page) < vm_page_size)
store->log2_blocks_per_page++;
if ((bsize << store->log2_blocks_per_page) != vm_page_size)
store->log2_blocks_per_page = 0;
}
|
