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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
/* A data structure to remember modifications to a memory region
Copyright (C) 1995 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 "ext2fs.h"
void
pokel_init (struct pokel *pokel, struct pager *pager, void *image)
{
pokel->lock = PTHREAD_SPINLOCK_INITIALIZER;
pokel->pokes = NULL;
pokel->free_pokes = NULL;
pokel->pager = pager;
pokel->image = image;
}
/* Clean up any state associated with POKEL (but don't free POKEL). */
void
pokel_finalize (struct pokel *pokel)
{
struct poke *pl, *next;
for (pl = pokel->pokes; pl; pl = next)
{
next = pl->next;
free (pl);
}
for (pl = pokel->free_pokes; pl; pl = next)
{
next = pl->next;
free (pl);
}
}
/* Remember that data here on the disk has been modified. */
void
pokel_add (struct pokel *pokel, void *loc, vm_size_t length)
{
struct poke *pl;
vm_offset_t offset = trunc_page (loc - pokel->image);
vm_offset_t end = round_page (loc + length - pokel->image);
ext2_debug ("adding %p[%ul] (range 0x%x to 0x%x)", loc, length, offset, end);
pthread_spin_lock (&pokel->lock);
pl = pokel->pokes;
while (pl != NULL)
{
vm_offset_t p_offs = pl->offset;
vm_size_t p_end = p_offs + pl->length;
if (p_offs <= offset && end <= p_end)
{
if (pokel->image == disk_cache)
for (vm_offset_t i = offset; i < end; i += block_size)
_disk_cache_block_deref (disk_cache + i);
break;
}
else if (p_end >= offset && end >= p_offs)
{
pl->offset = offset < p_offs ? offset : p_offs;
pl->length = (end > p_end ? end : p_end) - pl->offset;
if (pokel->image == disk_cache)
{
vm_offset_t i_begin = p_offs > offset ? p_offs : offset;
vm_offset_t i_end = p_end < end ? p_end : end;
for (vm_offset_t i = i_begin; i < i_end; i += block_size)
_disk_cache_block_deref (disk_cache + i);
}
ext2_debug ("extended 0x%x[%ul] to 0x%x[%ul]",
p_offs, p_end - p_offs, pl->offset, pl->length);
break;
}
pl = pl->next;
}
if (pl == NULL)
{
pl = pokel->free_pokes;
if (pl == NULL)
{
pl = malloc (sizeof (struct poke));
assert (pl);
}
else
pokel->free_pokes = pl->next;
pl->offset = offset;
pl->length = end - offset;
pl->next = pokel->pokes;
pokel->pokes = pl;
}
pthread_spin_unlock (&pokel->lock);
}
/* Move all pending pokes from POKEL into its free list. If SYNC is true,
otherwise do nothing. */
void
_pokel_exec (struct pokel *pokel, int sync, int wait)
{
struct poke *pl, *pokes, *last = NULL;
pthread_spin_lock (&pokel->lock);
pokes = pokel->pokes;
pokel->pokes = NULL;
pthread_spin_unlock (&pokel->lock);
for (pl = pokes; pl; last = pl, pl = pl->next)
{
if (sync)
{
ext2_debug ("syncing 0x%lx[%ul]", pl->offset, pl->length);
pager_sync_some (pokel->pager, pl->offset, pl->length, wait);
}
if (pokel->image == disk_cache)
{
vm_offset_t begin = trunc_block (pl->offset);
vm_offset_t end = round_block (pl->offset + pl->length);
for (vm_offset_t i = begin; i != end; i += block_size)
_disk_cache_block_deref (pokel->image + i);
}
}
if (last)
{
pthread_spin_lock (&pokel->lock);
last->next = pokel->free_pokes;
pokel->free_pokes = pokes;
pthread_spin_unlock (&pokel->lock);
}
}
/* Sync all the modified pieces of disk */
void
pokel_sync (struct pokel *pokel, int wait)
{
_pokel_exec (pokel, 1, wait);
}
/* Flush (that is, drop on the ground) all pending pokes in POKEL. */
void
pokel_flush (struct pokel *pokel)
{
_pokel_exec (pokel, 0, 0);
}
/* Transfer all regions from FROM to POKEL, which must have the same pager. */
void
pokel_inherit (struct pokel *pokel, struct pokel *from)
{
struct poke *pokes, *last;
assert (pokel->pager == from->pager);
assert (pokel->image == from->image);
/* Take all pokes from FROM... */
pthread_spin_lock (&from->lock);
pokes = from->pokes;
from->pokes = NULL;
pthread_spin_unlock (&from->lock);
/* And put them in POKEL. */
pthread_spin_lock (&pokel->lock);
last = pokel->pokes;
if (last)
{
while (last->next)
last = last->next;
last->next = pokes;
}
else
pokel->pokes = pokes;
pthread_spin_unlock (&pokel->lock);
}
|
