diff options
| author | Ondřej Surý <ondrej@sury.org> | 2011-01-17 12:40:45 +0100 |
|---|---|---|
| committer | Ondřej Surý <ondrej@sury.org> | 2011-01-17 12:40:45 +0100 |
| commit | 3e45412327a2654a77944249962b3652e6142299 (patch) | |
| tree | bc3bf69452afa055423cbe0c5cfa8ca357df6ccf /src/pkg/runtime/mheapmap64.c | |
| parent | c533680039762cacbc37db8dc7eed074c3e497be (diff) | |
| download | golang-3e45412327a2654a77944249962b3652e6142299.tar.gz | |
Imported Upstream version 2011.01.12upstream/2011.01.12
Diffstat (limited to 'src/pkg/runtime/mheapmap64.c')
| -rw-r--r-- | src/pkg/runtime/mheapmap64.c | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/src/pkg/runtime/mheapmap64.c b/src/pkg/runtime/mheapmap64.c index d5590a2d8..e45ac9413 100644 --- a/src/pkg/runtime/mheapmap64.c +++ b/src/pkg/runtime/mheapmap64.c @@ -10,13 +10,13 @@ // 3-level radix tree mapping page ids to Span*. void -MHeapMap_Init(MHeapMap *m, void *(*allocator)(uintptr)) +runtime·MHeapMap_Init(MHeapMap *m, void *(*allocator)(uintptr)) { m->allocator = allocator; } MSpan* -MHeapMap_Get(MHeapMap *m, PageID k) +runtime·MHeapMap_Get(MHeapMap *m, PageID k) { int32 i1, i2, i3; @@ -27,13 +27,13 @@ MHeapMap_Get(MHeapMap *m, PageID k) i1 = k & MHeapMap_Level1Mask; k >>= MHeapMap_Level1Bits; if(k != 0) - throw("MHeapMap_Get"); + runtime·throw("MHeapMap_Get"); return m->p[i1]->p[i2]->s[i3]; } MSpan* -MHeapMap_GetMaybe(MHeapMap *m, PageID k) +runtime·MHeapMap_GetMaybe(MHeapMap *m, PageID k) { int32 i1, i2, i3; MHeapMapNode2 *p2; @@ -46,7 +46,7 @@ MHeapMap_GetMaybe(MHeapMap *m, PageID k) i1 = k & MHeapMap_Level1Mask; k >>= MHeapMap_Level1Bits; if(k != 0) - throw("MHeapMap_Get"); + runtime·throw("MHeapMap_Get"); p2 = m->p[i1]; if(p2 == nil) @@ -58,7 +58,7 @@ MHeapMap_GetMaybe(MHeapMap *m, PageID k) } void -MHeapMap_Set(MHeapMap *m, PageID k, MSpan *s) +runtime·MHeapMap_Set(MHeapMap *m, PageID k, MSpan *s) { int32 i1, i2, i3; @@ -69,7 +69,7 @@ MHeapMap_Set(MHeapMap *m, PageID k, MSpan *s) i1 = k & MHeapMap_Level1Mask; k >>= MHeapMap_Level1Bits; if(k != 0) - throw("MHeapMap_Set"); + runtime·throw("MHeapMap_Set"); m->p[i1]->p[i2]->s[i3] = s; } @@ -77,7 +77,7 @@ MHeapMap_Set(MHeapMap *m, PageID k, MSpan *s) // Allocate the storage required for entries [k, k+1, ..., k+len-1] // so that Get and Set calls need not check for nil pointers. bool -MHeapMap_Preallocate(MHeapMap *m, PageID k, uintptr len) +runtime·MHeapMap_Preallocate(MHeapMap *m, PageID k, uintptr len) { uintptr end; int32 i1, i2; |