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
198
199
200
201
202
203
204
205
206
207
|
/* BLURB lgpl
Coda File System
Release 5
Copyright (c) 1987-1999 Carnegie Mellon University
Additional copyrights listed below
This code is distributed "AS IS" without warranty of any kind under
the terms of the GNU Library General Public Licence Version 2, as
shown in the file LICENSE. The technical and financial contributors to
Coda are listed in the file CREDITS.
Additional copyrights
none currently
#*/
#include <stdio.h>
#include <stdlib.h>
#include "rds_private.h"
/*
* Coalescing has proven necessary. This approach is to invoke it rarely,
* like in times of emergency or when the application starts up. This
* approach will merge all memory that can be merged, and runs linearly
* in the number of free blocks. After this phase has run, the MAXLIST
* is reset to the highest non-empty list.
*/
/* this function merges a freeblock with all of the following free blocks */
int merge_with_next_free(free_block_t *fbp, rvm_tid_t *tid, int *err)
{
free_block_t *nfbp;
guard_t *block_end;
rvm_return_t rvmret;
int list, merged;
assert(fbp->type == FREE_GUARD); /* Ensure fbp is a free block */
nfbp = NEXT_CONSECUTIVE_BLOCK(fbp);
merged = 0;
/* Do the set_range outside of next loop if appropriate. */
if ((nfbp->type == FREE_GUARD) && (nfbp < RDS_HIGH_ADDR)) {
rvmret = rvm_set_range(tid, (char *)fbp, sizeof(free_block_t));
if (rvmret != RVM_SUCCESS) {
(*err) = (int)rvmret;
return 0;
}
}
/* See if the next consecutive object is free. */
while ((nfbp->type == FREE_GUARD) && (nfbp < RDS_HIGH_ADDR)) {
block_end = BLOCK_END(fbp);/* Save a ptr to the endguard */
merged = 1;
RDS_STATS.merged++; /* Update merged object stat */
fbp->size += nfbp->size; /* Update the object's size */
/* remove the second object from it's list */
list = (nfbp->size >= RDS_MAXLIST) ? RDS_MAXLIST : nfbp->size;
assert(RDS_FREE_LIST[list].head != NULL);
rm_from_list(&RDS_FREE_LIST[list], nfbp, tid, err);
if (*err != SUCCESS) return 0;
/* Take out the guards to avoid future confusion. I'm going
* to assume that the next block follows immediately on
* the endguard of the first block */
rvmret = rvm_set_range(tid, (char *)block_end,
sizeof(guard_t) + sizeof(free_block_t));
if (rvmret != RVM_SUCCESS) {
(*err) = (int)rvmret;
return 0;
}
*block_end = 0;
BZERO(nfbp, sizeof(free_block_t));
nfbp = NEXT_CONSECUTIVE_BLOCK(fbp);
}
return merged;
}
void coalesce(rvm_tid_t *tid, int *err)
{
free_block_t *fbp, *save;
rvm_return_t rvmret;
int i, old_maxlist, merged;
/* Make sure the heap has been initialized */
if (!HEAP_INIT) {
(*err) = EHEAP_INIT;
return;
}
/* Update stats - don't need setrange, assume caller already has done that. */
RDS_STATS.coalesce++;
*err = SUCCESS; /* Initialize the error value */
/* Go through the lists, examing objects. For each free object, merge it
* with the next consecutive object in memory if it is also free. Continue
* merging until the next consecutive object is not free. The resulting
* object is guaranteed to be larger than the original, so put it on a new
* list. Because of this last fact, and because objects are split off the
* tail in split(), it may be wiser to run this loop from high to low.
* Need to make sure objects aren't pulled off the list from under our feet.
*/
for (i = RDS_NLISTS; i > 0; i--) {
/* Check to see if the list's guard is alright. */
if (RDS_FREE_LIST[i].guard != FREE_LIST_GUARD) {
(*err) = ECORRUPT;
return;
}
fbp = RDS_FREE_LIST[i].head;
while (fbp != NULL) {
merged = merge_with_next_free(fbp, tid, err);
if (*err)
return;
if (!merged)
RDS_STATS.unmerged++;
/* Move fbp, if merged, it must be larger. Don't move if already
* on the highest list. -- Use NLISTS here if MAXLIST < NLISTS.
*/
if (merged && i < RDS_NLISTS) {
/* remove fbp from it's list */
rm_from_list(&RDS_FREE_LIST[i], fbp, tid, err);
if (*err != SUCCESS) {
return;
}
save = fbp->next; /* Save the old value of next */
/* place fbp in its new list. */
put_block((char *)fbp, tid, err);
if (*err != SUCCESS) {
return;
}
fbp = save;
}
else {
fbp = fbp->next;
}
/* Yield to other threads, merging might take a while */
cthread_yield();
}
}
/* Second part is to put any real large objects on RDS_MAXLIST back where they
belong. Reset maxlist to it's highest value, RDS_NLIST. Obviously don't
need to do the second or third phases if RDS_MAXLIST == RDS_NLISTS. */
if (RDS_MAXLIST < RDS_NLISTS) {
old_maxlist = RDS_MAXLIST;
rvmret = rvm_set_range(tid, (char *)&(RDS_MAXLIST), sizeof(RDS_MAXLIST));
if (rvmret != RVM_SUCCESS) {
(*err) = (int)rvmret;
return;
}
RDS_MAXLIST = RDS_NLISTS;
fbp = RDS_FREE_LIST[old_maxlist].head;
while (fbp != NULL) {
if (fbp->size > old_maxlist) {
rm_from_list(&RDS_FREE_LIST[old_maxlist], fbp, tid, err);
if (*err != SUCCESS) {
return;
}
save = fbp->next; /* Save the old value of next */
/* Place the object in it's appropriate list. */
put_block((char *)fbp, tid, err);
if (*err != SUCCESS) {
return;
}
fbp = save;
}
else
fbp = fbp->next;
}
/* Third phase is reset RDS_MAXLIST to the highest non-empty value.*/
/* Used to be an assertion that maxlist != 1 in the next loop,
* Is this really a problem? I don't see it 1/29 -- dcs
*/
while ((RDS_FREE_LIST[RDS_MAXLIST].head == NULL) && (RDS_MAXLIST > 1)) {
RDS_MAXLIST--;
}
}
*err = SUCCESS;
}
|
