Lines Matching defs:hole
39 struct hole {
48 static struct hole initholes[64];
87 struct hole *hole;
91 hole = list_entry(cur, struct hole, list);
93 if((hole->start == 0) && (hole->end == 0) && (hole->size == 0))
96 printk("hole: start %08lx end %08lx size %08lx\n", hole->start, hole->end, hole->size);
99 printk("end of hole listing...\n");
107 struct hole *hole;
108 struct hole *prev = NULL;
113 hole = list_entry(cur, struct hole, list);
116 prev = hole;
120 if(hole->end == prev->start) {
121 hole->size += prev->size;
122 hole->end = prev->end;
132 static inline struct hole *rmcache(void)
134 struct hole *ret;
138 printk("out of dvma hole cache!\n");
143 ret = list_entry(hole_cache.next, struct hole, list);
154 struct hole *hole;
158 printk("out of dvma holes! (printing hole cache)\n");
168 hole = list_entry(cur, struct hole, list);
171 newlen = len + ((hole->end - len) & (align-1));
175 if(hole->size > newlen) {
176 hole->end -= newlen;
177 hole->size -= newlen;
178 dvma_entry_use(hole->end) = newlen;
183 return hole->end;
184 } else if(hole->size == newlen) {
185 list_move(&(hole->list), &hole_cache);
186 dvma_entry_use(hole->start) = newlen;
191 return hole->start;
196 printk("unable to find dvma hole!\n");
205 struct hole *hole;
221 hole = list_entry(cur, struct hole, list);
223 if(hole->end == baddr) {
224 hole->end += len;
225 hole->size += len;
227 } else if(hole->start == (baddr + len)) {
228 hole->start = baddr;
229 hole->size += len;
235 hole = rmcache();
237 hole->start = baddr;
238 hole->end = baddr + len;
239 hole->size = len;
241 // list_add_tail(&(hole->list), cur);
242 list_add(&(hole->list), cur);
251 struct hole *hole;
257 /* prepare the hole cache */
261 hole = rmcache();
262 hole->start = DVMA_START;
263 hole->end = DVMA_END;
264 hole->size = DVMA_SIZE;
266 list_add(&(hole->list), &hole_list);