2 #include "../port/lib.h"
10 Magichole = 0x484F4C45, /* HOLE */
13 typedef struct Hole Hole;
14 typedef struct Xalloc Xalloc;
15 typedef struct Xhdr Xhdr;
45 int i, n, upages, kpages;
51 eh = &xlists.hole[Nhole-1];
52 for(h = xlists.hole; h < eh; h++)
55 xlists.flist = xlists.hole;
58 kpages = conf.npage - upages;
60 for(i=0; i<nelem(conf.mem); i++){
65 /* don't try to use non-KADDR-able memory for kernel */
66 maxpages = cankaddr(m->base)/BY2PG;
69 /* first give to kernel */
71 m->kbase = (ulong)KADDR(m->base);
72 m->klimit = (ulong)KADDR(m->base+n*BY2PG);
73 xhole(m->base, n*BY2PG);
76 /* if anything left over, give to user */
78 if(pm >= palloc.mem+nelem(palloc.mem)){
79 print("xinit: losing %lud pages\n", m->npage-n);
82 pm->base = m->base+n*BY2PG;
83 pm->npage = m->npage - n;
91 xspanalloc(ulong size, int align, ulong span)
94 a = (ulong)xalloc(size+align+span);
96 panic("xspanalloc: %lud %d %lux", size, align, span);
99 v = (a + span) & ~(span-1);
105 xhole(PADDR(v+size+align), t);
111 v = (v + align) & ~(align-1);
117 xallocz(ulong size, int zero)
122 /* add room for magix & size overhead, round up to nearest vlong */
123 size += BY2V + offsetof(Xhdr, data[0]);
128 for(h = *l; h; h = h->link) {
129 if(h->size >= size) {
130 p = (Xhdr*)KADDR(h->addr);
135 h->link = xlists.flist;
141 p->magix = Magichole;
154 return xallocz(size, 1);
162 x = (Xhdr*)((ulong)p - offsetof(Xhdr, data[0]));
163 if(x->magix != Magichole) {
165 panic("xfree(%#p) %#ux != %#lux", p, Magichole, x->magix);
167 xhole(PADDR((uintptr)x), x->size);
171 xmerge(void *vp, void *vq)
175 p = (Xhdr*)(((ulong)vp - offsetof(Xhdr, data[0])));
176 q = (Xhdr*)(((ulong)vq - offsetof(Xhdr, data[0])));
177 if(p->magix != Magichole || q->magix != Magichole) {
183 badp = (p->magix != Magichole? p: q);
184 wd = (ulong *)badp - 12;
185 for (i = 24; i-- > 0; ) {
186 print("%#p: %lux", wd, *wd);
192 panic("xmerge(%#p, %#p) bad magic %#lux, %#lux",
193 vp, vq, p->magix, q->magix);
195 if((uchar*)p+p->size == (uchar*)q) {
203 xhole(ulong addr, ulong size)
214 for(h = *l; h; h = h->link) {
217 h->top = h->addr+h->size;
219 if(c && h->top == c->addr) {
223 c->link = xlists.flist;
233 if(h && top == h->addr) {
240 if(xlists.flist == nil) {
242 print("xfree: no free holes, leaked %lud bytes\n", size);
247 xlists.flist = h->link;
263 for(h = xlists.flist; h; h = h->link)
266 print("%d holes free\n", i);
268 for(h = xlists.table; h; h = h->link) {
269 print("%.8lux %.8lux %lud\n", h->addr, h->top, h->size);
272 print("%d bytes free\n", i);