2008-11-25 10:41:58 -07:00
|
|
|
// 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.
|
|
|
|
|
2009-06-29 16:24:23 -06:00
|
|
|
package bytes
|
2008-11-25 10:41:58 -07:00
|
|
|
|
2009-09-22 15:53:48 -06:00
|
|
|
// Simple byte buffer for marshaling data.
|
2008-11-25 10:41:58 -07:00
|
|
|
|
2009-09-22 15:53:48 -06:00
|
|
|
import (
|
2009-12-15 16:33:31 -07:00
|
|
|
"io"
|
|
|
|
"os"
|
2009-09-22 15:53:48 -06:00
|
|
|
)
|
2009-09-21 13:59:14 -06:00
|
|
|
|
|
|
|
// Copy from string to byte array at offset doff. Assume there's room.
|
|
|
|
func copyString(dst []byte, doff int, str string) {
|
|
|
|
for soff := 0; soff < len(str); soff++ {
|
2009-12-15 16:33:31 -07:00
|
|
|
dst[doff] = str[soff]
|
|
|
|
doff++
|
2008-11-25 10:41:58 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-22 15:53:48 -06:00
|
|
|
// A Buffer is a variable-sized buffer of bytes
|
|
|
|
// with Read and Write methods.
|
|
|
|
// The zero value for Buffer is an empty buffer ready to use.
|
|
|
|
type Buffer struct {
|
2009-12-15 16:33:31 -07:00
|
|
|
buf []byte // contents are the bytes buf[off : len(buf)]
|
|
|
|
off int // read at &buf[off], write at &buf[len(buf)]
|
|
|
|
oneByte [1]byte // avoid allocation of slice on each WriteByte
|
|
|
|
bootstrap [64]byte // memory to hold first slice; helps small buffers (Printf) avoid allocation.
|
2009-09-22 15:53:48 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
// Bytes returns the contents of the unread portion of the buffer;
|
|
|
|
// len(b.Bytes()) == b.Len().
|
2009-12-15 16:33:31 -07:00
|
|
|
func (b *Buffer) Bytes() []byte { return b.buf[b.off:] }
|
2009-05-05 13:00:52 -06:00
|
|
|
|
2009-09-16 16:15:00 -06:00
|
|
|
// String returns the contents of the unread portion of the buffer
|
2009-10-31 14:28:22 -06:00
|
|
|
// as a string. If the Buffer is a nil pointer, it returns "<nil>".
|
2009-09-16 16:15:00 -06:00
|
|
|
func (b *Buffer) String() string {
|
2009-10-31 14:28:22 -06:00
|
|
|
if b == nil {
|
|
|
|
// Special case, useful in debugging.
|
2009-11-09 13:07:39 -07:00
|
|
|
return "<nil>"
|
2009-10-31 14:28:22 -06:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
return string(b.buf[b.off:])
|
2009-09-16 16:15:00 -06:00
|
|
|
}
|
|
|
|
|
2009-09-22 15:53:48 -06:00
|
|
|
// Len returns the number of bytes of the unread portion of the buffer;
|
|
|
|
// b.Len() == len(b.Bytes()).
|
2009-12-15 16:33:31 -07:00
|
|
|
func (b *Buffer) Len() int { return len(b.buf) - b.off }
|
2008-11-25 10:41:58 -07:00
|
|
|
|
2009-05-14 14:39:17 -06:00
|
|
|
// Truncate discards all but the first n unread bytes from the buffer.
|
2009-09-22 15:53:48 -06:00
|
|
|
// It is an error to call b.Truncate(n) with n > b.Len().
|
2009-06-29 16:24:23 -06:00
|
|
|
func (b *Buffer) Truncate(n int) {
|
2009-09-22 15:53:48 -06:00
|
|
|
if n == 0 {
|
|
|
|
// Reuse buffer space.
|
2009-11-09 13:07:39 -07:00
|
|
|
b.off = 0
|
2009-05-18 14:31:56 -06:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
b.buf = b.buf[0 : b.off+n]
|
2009-05-14 11:14:29 -06:00
|
|
|
}
|
|
|
|
|
2009-03-06 04:43:44 -07:00
|
|
|
// Reset resets the buffer so it has no content.
|
2009-05-14 11:14:29 -06:00
|
|
|
// b.Reset() is the same as b.Truncate(0).
|
2009-12-15 16:33:31 -07:00
|
|
|
func (b *Buffer) Reset() { b.Truncate(0) }
|
2009-09-21 13:59:14 -06:00
|
|
|
|
2009-12-06 13:03:52 -07:00
|
|
|
// Resize buffer to guarantee enough space for n more bytes.
|
|
|
|
// After this call, the state of b.buf is inconsistent.
|
|
|
|
// It must be fixed up as is done in Write and WriteString.
|
|
|
|
func (b *Buffer) resize(n int) {
|
2009-12-15 16:33:31 -07:00
|
|
|
var buf []byte
|
2009-12-06 13:03:52 -07:00
|
|
|
if b.buf == nil && n <= len(b.bootstrap) {
|
|
|
|
buf = &b.bootstrap
|
|
|
|
} else {
|
2009-12-15 16:33:31 -07:00
|
|
|
buf = b.buf
|
2009-12-06 13:03:52 -07:00
|
|
|
if len(b.buf)+n > cap(b.buf) {
|
|
|
|
// not enough space anywhere
|
|
|
|
buf = make([]byte, 2*cap(b.buf)+n)
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
copy(buf, b.buf[b.off:])
|
2009-12-06 13:03:52 -07:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
b.buf = buf
|
|
|
|
b.off = 0
|
2009-12-06 13:03:52 -07:00
|
|
|
}
|
|
|
|
|
2009-09-22 15:53:48 -06:00
|
|
|
// Write appends the contents of p to the buffer. The return
|
|
|
|
// value n is the length of p; err is always nil.
|
|
|
|
func (b *Buffer) Write(p []byte) (n int, err os.Error) {
|
2009-12-15 16:33:31 -07:00
|
|
|
m := b.Len()
|
2009-12-13 19:13:01 -07:00
|
|
|
// If buffer is empty, reset to recover space.
|
|
|
|
if m == 0 && b.off != 0 {
|
|
|
|
b.Truncate(0)
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
n = len(p)
|
2009-10-08 16:14:54 -06:00
|
|
|
if len(b.buf)+n > cap(b.buf) {
|
2009-12-06 13:03:52 -07:00
|
|
|
b.resize(n)
|
2009-09-22 15:53:48 -06:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
b.buf = b.buf[0 : b.off+m+n]
|
|
|
|
copy(b.buf[b.off+m:], p)
|
|
|
|
return n, nil
|
2009-09-21 13:59:14 -06:00
|
|
|
}
|
|
|
|
|
2009-12-06 13:03:52 -07:00
|
|
|
// WriteString appends the contents of s to the buffer. The return
|
|
|
|
// value n is the length of s; err is always nil.
|
|
|
|
func (b *Buffer) WriteString(s string) (n int, err os.Error) {
|
2009-12-15 16:33:31 -07:00
|
|
|
m := b.Len()
|
2009-12-13 19:13:01 -07:00
|
|
|
// If buffer is empty, reset to recover space.
|
|
|
|
if m == 0 && b.off != 0 {
|
|
|
|
b.Truncate(0)
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
n = len(s)
|
2009-12-06 13:03:52 -07:00
|
|
|
if len(b.buf)+n > cap(b.buf) {
|
|
|
|
b.resize(n)
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
b.buf = b.buf[0 : b.off+m+n]
|
|
|
|
copyString(b.buf, b.off+m, s)
|
|
|
|
return n, nil
|
2009-12-06 13:03:52 -07:00
|
|
|
}
|
|
|
|
|
2009-12-03 13:56:16 -07:00
|
|
|
// MinRead is the minimum slice size passed to a Read call by
|
|
|
|
// Buffer.ReadFrom. As long as the Buffer has at least MinRead bytes beyond
|
|
|
|
// what is required to hold the contents of r, ReadFrom will not grow the
|
|
|
|
// underlying buffer.
|
|
|
|
const MinRead = 512
|
|
|
|
|
|
|
|
// ReadFrom reads data from r until EOF and appends it to the buffer.
|
|
|
|
// The return value n is the number of bytes read.
|
|
|
|
// Any error except os.EOF encountered during the read
|
|
|
|
// is also returned.
|
|
|
|
func (b *Buffer) ReadFrom(r io.Reader) (n int64, err os.Error) {
|
2009-12-13 19:13:01 -07:00
|
|
|
// If buffer is empty, reset to recover space.
|
|
|
|
if b.off >= len(b.buf) {
|
|
|
|
b.Truncate(0)
|
|
|
|
}
|
2009-12-03 13:56:16 -07:00
|
|
|
for {
|
|
|
|
if cap(b.buf)-len(b.buf) < MinRead {
|
2009-12-15 16:33:31 -07:00
|
|
|
var newBuf []byte
|
2009-12-03 13:56:16 -07:00
|
|
|
// can we get space without allocation?
|
|
|
|
if b.off+cap(b.buf)-len(b.buf) >= MinRead {
|
|
|
|
// reuse beginning of buffer
|
|
|
|
newBuf = b.buf[0 : len(b.buf)-b.off]
|
|
|
|
} else {
|
|
|
|
// not enough space at end; put space on end
|
|
|
|
newBuf = make([]byte, len(b.buf)-b.off, 2*(cap(b.buf)-b.off)+MinRead)
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
copy(newBuf, b.buf[b.off:])
|
|
|
|
b.buf = newBuf
|
|
|
|
b.off = 0
|
2009-12-03 13:56:16 -07:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
m, e := r.Read(b.buf[len(b.buf):cap(b.buf)])
|
|
|
|
b.buf = b.buf[b.off : len(b.buf)+m]
|
|
|
|
n += int64(m)
|
2009-12-03 13:56:16 -07:00
|
|
|
if e == os.EOF {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
if e != nil {
|
|
|
|
return n, e
|
|
|
|
}
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
return n, nil // err is EOF, so return nil explicitly
|
2009-12-03 13:56:16 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
// WriteTo writes data to w until the buffer is drained or an error
|
|
|
|
// occurs. The return value n is the number of bytes written.
|
|
|
|
// Any error encountered during the write is also returned.
|
|
|
|
func (b *Buffer) WriteTo(w io.Writer) (n int64, err os.Error) {
|
|
|
|
for b.off < len(b.buf) {
|
2009-12-15 16:33:31 -07:00
|
|
|
m, e := w.Write(b.buf[b.off:])
|
|
|
|
n += int64(m)
|
|
|
|
b.off += m
|
2009-12-03 13:56:16 -07:00
|
|
|
if e != nil {
|
|
|
|
return n, e
|
|
|
|
}
|
|
|
|
}
|
2009-12-13 19:13:01 -07:00
|
|
|
// Buffer is now empty; reset.
|
2009-12-15 16:33:31 -07:00
|
|
|
b.Truncate(0)
|
|
|
|
return
|
2009-12-03 13:56:16 -07:00
|
|
|
}
|
|
|
|
|
2009-05-14 18:03:47 -06:00
|
|
|
// WriteByte appends the byte c to the buffer.
|
2009-05-15 11:46:14 -06:00
|
|
|
// The returned error is always nil, but is included
|
|
|
|
// to match bufio.Writer's WriteByte.
|
2009-06-29 16:24:23 -06:00
|
|
|
func (b *Buffer) WriteByte(c byte) os.Error {
|
2009-12-15 16:33:31 -07:00
|
|
|
b.oneByte[0] = c
|
|
|
|
b.Write(&b.oneByte)
|
|
|
|
return nil
|
2009-05-14 18:03:47 -06:00
|
|
|
}
|
|
|
|
|
2009-03-06 04:43:44 -07:00
|
|
|
// Read reads the next len(p) bytes from the buffer or until the buffer
|
2009-06-23 16:20:40 -06:00
|
|
|
// is drained. The return value n is the number of bytes read. If the
|
|
|
|
// buffer has no data to return, err is os.EOF even if len(p) is zero;
|
|
|
|
// otherwise it is nil.
|
2009-06-29 16:24:23 -06:00
|
|
|
func (b *Buffer) Read(p []byte) (n int, err os.Error) {
|
2009-09-22 15:53:48 -06:00
|
|
|
if b.off >= len(b.buf) {
|
2009-12-13 19:13:01 -07:00
|
|
|
// Buffer is empty, reset to recover space.
|
2009-12-15 16:33:31 -07:00
|
|
|
b.Truncate(0)
|
|
|
|
return 0, os.EOF
|
2009-06-23 16:20:40 -06:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
m := b.Len()
|
|
|
|
n = len(p)
|
2009-09-22 15:53:48 -06:00
|
|
|
|
|
|
|
if n > m {
|
|
|
|
// more bytes requested than available
|
2009-11-09 13:07:39 -07:00
|
|
|
n = m
|
2009-05-05 13:00:52 -06:00
|
|
|
}
|
2009-09-22 15:53:48 -06:00
|
|
|
|
2009-12-15 16:33:31 -07:00
|
|
|
copy(p, b.buf[b.off:b.off+n])
|
|
|
|
b.off += n
|
|
|
|
return n, err
|
2008-11-25 10:41:58 -07:00
|
|
|
}
|
|
|
|
|
2009-06-19 17:29:30 -06:00
|
|
|
// ReadByte reads and returns the next byte from the buffer.
|
2009-06-22 14:26:13 -06:00
|
|
|
// If no byte is available, it returns error os.EOF.
|
2009-06-29 16:24:23 -06:00
|
|
|
func (b *Buffer) ReadByte() (c byte, err os.Error) {
|
2009-09-22 15:53:48 -06:00
|
|
|
if b.off >= len(b.buf) {
|
2009-12-13 19:13:01 -07:00
|
|
|
// Buffer is empty, reset to recover space.
|
2009-12-15 16:33:31 -07:00
|
|
|
b.Truncate(0)
|
|
|
|
return 0, os.EOF
|
2009-06-19 17:29:30 -06:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
c = b.buf[b.off]
|
|
|
|
b.off++
|
|
|
|
return c, nil
|
2009-09-21 13:59:14 -06:00
|
|
|
}
|
|
|
|
|
2009-09-22 15:53:48 -06:00
|
|
|
// NewBuffer creates and initializes a new Buffer
|
|
|
|
// using buf as its initial contents.
|
2009-12-15 16:33:31 -07:00
|
|
|
func NewBuffer(buf []byte) *Buffer { return &Buffer{buf: buf} }
|
2009-06-19 17:29:30 -06:00
|
|
|
|
2009-09-22 15:53:48 -06:00
|
|
|
// NewBufferString creates and initializes a new Buffer
|
|
|
|
// using string s as its initial contents.
|
|
|
|
func NewBufferString(s string) *Buffer {
|
2009-12-15 16:33:31 -07:00
|
|
|
buf := make([]byte, len(s))
|
|
|
|
copyString(buf, 0, s)
|
|
|
|
return &Buffer{buf: buf}
|
2008-11-25 10:41:58 -07:00
|
|
|
}
|