code review 4118042: runtime: simpler heap map, memory allocation

src/pkg/runtime/mheap.c

 // Copyright 2009 The Go Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style
 // license that can be found in the LICENSE file.
 
 // Page heap.
 //
 // See malloc.h for overview.
 //
 // When a MSpan is in the heap free list, state == MSpanFree
 // and heapmap(s->start) == span, heapmap(s->start+s->npages-1) == span.
@@ skipping 17 matching lines @@
         MSpan *s;
 
         h = vh;
         s = (MSpan*)p;
         s->allnext = h->allspans;
         h->allspans = s;
 }
 
 // Initialize the heap; fetch memory using alloc.
 void
-runtime·MHeap_Init(MHeap *h, void *(*alloc)(void*, uintptr))
+runtime·MHeap_Init(MHeap *h, void *(*alloc)(uintptr))
 {
         uint32 i;
 
         runtime·FixAlloc_Init(&h->spanalloc, sizeof(MSpan), alloc, RecordSpan, h);
         runtime·FixAlloc_Init(&h->cachealloc, sizeof(MCache), alloc, nil, nil);
         // h->mapcache needs no init
         for(i=0; i<nelem(h->free); i++)
                 runtime·MSpanList_Init(&h->free[i]);
         runtime·MSpanList_Init(&h->large);
         for(i=0; i<nelem(h->central); i++)
@@ skipping 321 matching lines @@
 void
 runtime·MSpanList_Insert(MSpan *list, MSpan *span)
 {
         if(span->next != nil || span->prev != nil)
                 runtime·throw("MSpanList_Insert");
         span->next = list->next;
         span->prev = list;
         span->next->prev = span;
         span->prev->next = span;
 }