aboutsummaryrefslogtreecommitdiff
path: root/freelist.go
diff options
context:
space:
mode:
Diffstat (limited to 'freelist.go')
-rw-r--r--freelist.go24
1 files changed, 10 insertions, 14 deletions
diff --git a/freelist.go b/freelist.go
index 53efa8f..aba48f5 100644
--- a/freelist.go
+++ b/freelist.go
@@ -24,7 +24,12 @@ func newFreelist() *freelist {
// size returns the size of the page after serialization.
func (f *freelist) size() int {
- return pageHeaderSize + (int(unsafe.Sizeof(pgid(0))) * f.count())
+ n := f.count()
+ if n >= 0xFFFF {
+ // The first element will be used to store the count. See freelist.write.
+ n++
+ }
+ return pageHeaderSize + (int(unsafe.Sizeof(pgid(0))) * n)
}
// count returns count of pages on the freelist
@@ -46,19 +51,10 @@ func (f *freelist) pending_count() int {
return count
}
-// lenall returns the combined number of all free ids and all pending ids.
-func (f *freelist) lenall() int {
- n := len(f.ids)
- for _, list := range f.pending {
- n += len(list)
- }
- return n
-}
-
-// all copies into dst a list of all free ids and all pending ids in one sorted list.
-// f.lenall returns the minimum length required for dst.
+// copyall copies into dst a list of all free ids and all pending ids in one sorted list.
+// f.count returns the minimum length required for dst.
func (f *freelist) copyall(dst []pgid) {
- m := make(pgids, 0, len(f.pending)) // len(f.pending) undercounts, but it is a start
+ m := make(pgids, 0, f.pending_count())
for _, list := range f.pending {
m = append(m, list...)
}
@@ -200,7 +196,7 @@ func (f *freelist) write(p *page) error {
// The page.count can only hold up to 64k elements so if we overflow that
// number then we handle it by putting the size in the first element.
- lenids := f.lenall()
+ lenids := f.count()
if lenids == 0 {
p.count = uint16(lenids)
} else if lenids < 0xFFFF {