2016-11-15 09:34:25 +00:00
|
|
|
// Package tsdb implements a time series storage for float64 sample data.
|
|
|
|
package tsdb
|
|
|
|
|
|
|
|
import (
|
2016-12-10 17:08:50 +00:00
|
|
|
"bytes"
|
2016-12-04 12:16:11 +00:00
|
|
|
"fmt"
|
2017-02-27 09:46:15 +00:00
|
|
|
"io"
|
2017-01-06 08:26:39 +00:00
|
|
|
"io/ioutil"
|
2016-12-04 12:16:11 +00:00
|
|
|
"os"
|
2016-12-08 16:43:10 +00:00
|
|
|
"path/filepath"
|
2016-12-15 07:31:26 +00:00
|
|
|
"strconv"
|
2017-01-06 12:13:22 +00:00
|
|
|
"strings"
|
2016-12-08 16:43:10 +00:00
|
|
|
"sync"
|
2017-02-04 10:53:52 +00:00
|
|
|
"sync/atomic"
|
2017-01-06 14:18:06 +00:00
|
|
|
"time"
|
2016-12-15 10:56:41 +00:00
|
|
|
"unsafe"
|
2016-11-15 09:34:25 +00:00
|
|
|
|
2016-12-15 07:31:26 +00:00
|
|
|
"golang.org/x/sync/errgroup"
|
|
|
|
|
2017-01-03 14:43:26 +00:00
|
|
|
"github.com/coreos/etcd/pkg/fileutil"
|
2016-12-21 08:39:01 +00:00
|
|
|
"github.com/fabxc/tsdb/labels"
|
2016-12-14 17:38:46 +00:00
|
|
|
"github.com/go-kit/kit/log"
|
2017-02-19 12:01:19 +00:00
|
|
|
"github.com/nightlyone/lockfile"
|
2017-01-03 14:43:26 +00:00
|
|
|
"github.com/pkg/errors"
|
2016-12-31 08:48:49 +00:00
|
|
|
"github.com/prometheus/client_golang/prometheus"
|
2016-11-15 09:34:25 +00:00
|
|
|
)
|
|
|
|
|
2016-12-09 09:00:14 +00:00
|
|
|
// DefaultOptions used for the DB. They are sane for setups using
|
2017-01-06 10:40:09 +00:00
|
|
|
// millisecond precision timestampdb.
|
2016-11-15 09:34:25 +00:00
|
|
|
var DefaultOptions = &Options{
|
2017-02-10 01:54:26 +00:00
|
|
|
WALFlushInterval: 5 * time.Second,
|
|
|
|
RetentionDuration: 15 * 24 * 60 * 60 * 1000, // 15 days in milliseconds
|
|
|
|
MinBlockDuration: 3 * 60 * 60 * 1000, // 2 hours in milliseconds
|
|
|
|
MaxBlockDuration: 24 * 60 * 60 * 1000, // 1 days in milliseconds
|
|
|
|
AppendableBlocks: 2,
|
2016-11-15 09:34:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Options of the DB storage.
|
|
|
|
type Options struct {
|
2017-01-29 07:11:47 +00:00
|
|
|
// The interval at which the write ahead log is flushed to disc.
|
2017-01-06 14:18:06 +00:00
|
|
|
WALFlushInterval time.Duration
|
2017-01-29 07:11:47 +00:00
|
|
|
|
2017-02-10 01:54:26 +00:00
|
|
|
// Duration of persisted data to keep.
|
|
|
|
RetentionDuration uint64
|
|
|
|
|
2017-02-01 14:29:48 +00:00
|
|
|
// The timestamp range of head blocks after which they get persisted.
|
|
|
|
// It's the minimum duration of any persisted block.
|
|
|
|
MinBlockDuration uint64
|
|
|
|
|
2017-01-29 07:11:47 +00:00
|
|
|
// The maximum timestamp range of compacted blocks.
|
2017-02-01 14:29:48 +00:00
|
|
|
MaxBlockDuration uint64
|
2017-01-29 07:11:47 +00:00
|
|
|
|
2017-02-01 20:31:35 +00:00
|
|
|
// Number of head blocks that can be appended to.
|
|
|
|
// Should be two or higher to prevent write errors in general scenarios.
|
|
|
|
//
|
|
|
|
// After a new block is started for timestamp t0 or higher, appends with
|
|
|
|
// timestamps as early as t0 - (n-1) * MinBlockDuration are valid.
|
|
|
|
AppendableBlocks int
|
2016-11-15 09:34:25 +00:00
|
|
|
}
|
|
|
|
|
2017-01-12 19:17:49 +00:00
|
|
|
// Appender allows appending a batch of data. It must be completed with a
|
|
|
|
// call to Commit or Rollback and must not be reused afterwards.
|
2016-12-10 17:08:50 +00:00
|
|
|
type Appender interface {
|
2017-02-01 14:29:48 +00:00
|
|
|
// Add adds a sample pair for the given series. A reference number is
|
|
|
|
// returned which can be used to add further samples in the same or later
|
|
|
|
// transactions.
|
|
|
|
// Returned reference numbers are ephemeral and may be rejected in calls
|
|
|
|
// to AddFast() at any point. Adding the sample via Add() returns a new
|
|
|
|
// reference number.
|
|
|
|
Add(l labels.Labels, t int64, v float64) (uint64, error)
|
|
|
|
|
|
|
|
// Add adds a sample pair for the referenced series. It is generally faster
|
|
|
|
// than adding a sample by providing its full label set.
|
|
|
|
AddFast(ref uint64, t int64, v float64) error
|
2016-12-20 23:02:37 +00:00
|
|
|
|
|
|
|
// Commit submits the collected samples and purges the batch.
|
2016-12-10 17:08:50 +00:00
|
|
|
Commit() error
|
2017-01-12 19:17:49 +00:00
|
|
|
|
|
|
|
// Rollback rolls back all modifications made in the appender so far.
|
|
|
|
Rollback() error
|
2016-12-10 17:08:50 +00:00
|
|
|
}
|
|
|
|
|
2016-12-09 09:00:14 +00:00
|
|
|
const sep = '\xff'
|
|
|
|
|
2017-01-06 10:40:09 +00:00
|
|
|
// DB handles reads and writes of time series falling into
|
|
|
|
// a hashed partition of a seriedb.
|
|
|
|
type DB struct {
|
2017-03-04 15:50:48 +00:00
|
|
|
dir string
|
|
|
|
lockf lockfile.Lockfile
|
|
|
|
|
2017-01-02 21:24:35 +00:00
|
|
|
logger log.Logger
|
2017-01-06 10:40:09 +00:00
|
|
|
metrics *dbMetrics
|
2017-01-18 05:18:32 +00:00
|
|
|
opts *Options
|
2016-12-09 09:00:14 +00:00
|
|
|
|
2017-03-04 15:50:48 +00:00
|
|
|
// Mutex for that must be held when modifying the general
|
|
|
|
// block layout.
|
2016-12-15 07:31:26 +00:00
|
|
|
mtx sync.RWMutex
|
2017-01-03 14:43:26 +00:00
|
|
|
persisted []*persistedBlock
|
2017-03-02 08:13:29 +00:00
|
|
|
seqBlocks map[int]Block
|
2017-03-04 15:50:48 +00:00
|
|
|
|
|
|
|
// Mutex that must be held when modifying just the head blocks
|
|
|
|
// or the general layout.
|
|
|
|
headmtx sync.RWMutex
|
|
|
|
heads []*headBlock
|
|
|
|
headGen uint8
|
2017-01-12 18:18:51 +00:00
|
|
|
|
2017-03-02 08:13:29 +00:00
|
|
|
compactor Compactor
|
2017-01-06 11:37:28 +00:00
|
|
|
|
|
|
|
compactc chan struct{}
|
|
|
|
donec chan struct{}
|
|
|
|
stopc chan struct{}
|
2016-12-09 09:00:14 +00:00
|
|
|
}
|
|
|
|
|
2017-01-06 10:40:09 +00:00
|
|
|
type dbMetrics struct {
|
2017-01-06 11:37:28 +00:00
|
|
|
samplesAppended prometheus.Counter
|
|
|
|
compactionsTriggered prometheus.Counter
|
2016-12-31 08:48:49 +00:00
|
|
|
}
|
|
|
|
|
2017-01-06 10:40:09 +00:00
|
|
|
func newDBMetrics(r prometheus.Registerer) *dbMetrics {
|
|
|
|
m := &dbMetrics{}
|
2017-01-03 14:43:26 +00:00
|
|
|
|
|
|
|
m.samplesAppended = prometheus.NewCounter(prometheus.CounterOpts{
|
2017-01-06 10:40:09 +00:00
|
|
|
Name: "tsdb_samples_appended_total",
|
|
|
|
Help: "Total number of appended sampledb.",
|
2017-01-03 14:43:26 +00:00
|
|
|
})
|
2017-01-06 11:37:28 +00:00
|
|
|
m.compactionsTriggered = prometheus.NewCounter(prometheus.CounterOpts{
|
|
|
|
Name: "tsdb_compactions_triggered_total",
|
|
|
|
Help: "Total number of triggered compactions for the partition.",
|
|
|
|
})
|
2016-12-31 08:48:49 +00:00
|
|
|
|
|
|
|
if r != nil {
|
|
|
|
r.MustRegister(
|
|
|
|
m.samplesAppended,
|
2017-01-09 18:14:21 +00:00
|
|
|
m.compactionsTriggered,
|
2016-12-31 08:48:49 +00:00
|
|
|
)
|
|
|
|
}
|
|
|
|
return m
|
|
|
|
}
|
|
|
|
|
2017-01-06 10:40:09 +00:00
|
|
|
// Open returns a new DB in the given directory.
|
2017-02-28 06:17:01 +00:00
|
|
|
func Open(dir string, l log.Logger, r prometheus.Registerer, opts *Options) (db *DB, err error) {
|
2017-02-19 12:01:19 +00:00
|
|
|
if err := os.MkdirAll(dir, 0777); err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
absdir, err := filepath.Abs(dir)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
2016-12-15 07:31:26 +00:00
|
|
|
}
|
2017-02-19 12:01:19 +00:00
|
|
|
lockf, err := lockfile.New(filepath.Join(absdir, "lock"))
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
if err := lockf.TryLock(); err != nil {
|
|
|
|
return nil, errors.Wrapf(err, "open DB in %s", dir)
|
|
|
|
}
|
|
|
|
|
2017-02-19 15:04:37 +00:00
|
|
|
if l == nil {
|
|
|
|
l = log.NewLogfmtLogger(os.Stdout)
|
|
|
|
l = log.NewContext(l).With("ts", log.DefaultTimestampUTC, "caller", log.DefaultCaller)
|
|
|
|
}
|
|
|
|
|
2017-01-18 05:18:32 +00:00
|
|
|
if opts == nil {
|
|
|
|
opts = DefaultOptions
|
|
|
|
}
|
2017-02-02 06:58:54 +00:00
|
|
|
if opts.AppendableBlocks < 1 {
|
|
|
|
return nil, errors.Errorf("AppendableBlocks must be greater than 0")
|
|
|
|
}
|
2017-01-18 05:18:32 +00:00
|
|
|
|
2017-01-06 11:37:28 +00:00
|
|
|
db = &DB{
|
|
|
|
dir: dir,
|
2017-02-19 12:01:19 +00:00
|
|
|
lockf: lockf,
|
2017-02-19 15:04:37 +00:00
|
|
|
logger: l,
|
2017-01-09 18:14:21 +00:00
|
|
|
metrics: newDBMetrics(r),
|
2017-01-18 05:18:32 +00:00
|
|
|
opts: opts,
|
2017-01-06 11:37:28 +00:00
|
|
|
compactc: make(chan struct{}, 1),
|
|
|
|
donec: make(chan struct{}),
|
|
|
|
stopc: make(chan struct{}),
|
2017-01-06 08:26:39 +00:00
|
|
|
}
|
2017-03-02 13:32:09 +00:00
|
|
|
db.compactor = newCompactor(r, &compactorOptions{
|
2017-02-01 14:29:48 +00:00
|
|
|
maxBlockRange: opts.MaxBlockDuration,
|
2017-01-18 05:18:32 +00:00
|
|
|
})
|
2017-01-06 11:37:28 +00:00
|
|
|
|
2017-03-02 08:13:29 +00:00
|
|
|
if err := db.reloadBlocks(); err != nil {
|
2016-12-15 07:31:26 +00:00
|
|
|
return nil, err
|
|
|
|
}
|
2017-01-06 11:37:28 +00:00
|
|
|
go db.run()
|
|
|
|
|
|
|
|
return db, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (db *DB) run() {
|
|
|
|
defer close(db.donec)
|
|
|
|
|
2017-02-28 14:08:52 +00:00
|
|
|
tick := time.NewTicker(30 * time.Second)
|
|
|
|
defer tick.Stop()
|
|
|
|
|
2017-01-20 06:58:19 +00:00
|
|
|
for {
|
|
|
|
select {
|
2017-02-28 14:08:52 +00:00
|
|
|
case <-tick.C:
|
|
|
|
select {
|
|
|
|
case db.compactc <- struct{}{}:
|
|
|
|
default:
|
|
|
|
}
|
2017-01-06 11:37:28 +00:00
|
|
|
case <-db.compactc:
|
|
|
|
db.metrics.compactionsTriggered.Inc()
|
|
|
|
|
2017-03-17 14:30:05 +00:00
|
|
|
changes1, err := db.retentionCutoff()
|
2017-03-19 12:50:35 +00:00
|
|
|
if err != nil {
|
|
|
|
db.logger.Log("msg", "retention cutoff failed", "err", err)
|
|
|
|
}
|
2017-03-04 15:50:48 +00:00
|
|
|
|
2017-03-17 14:30:05 +00:00
|
|
|
changes2, err := db.compact()
|
2017-03-19 12:50:35 +00:00
|
|
|
if err != nil {
|
|
|
|
db.logger.Log("msg", "compaction failed", "err", err)
|
|
|
|
}
|
2017-03-17 14:30:05 +00:00
|
|
|
|
|
|
|
if changes1 || changes2 {
|
2017-03-19 12:50:35 +00:00
|
|
|
if err := db.reloadBlocks(); err != nil {
|
|
|
|
db.logger.Log("msg", "reloading blocks failed", "err", err)
|
|
|
|
}
|
2017-01-06 11:37:28 +00:00
|
|
|
}
|
2017-01-06 14:18:06 +00:00
|
|
|
|
2017-01-06 11:37:28 +00:00
|
|
|
case <-db.stopc:
|
|
|
|
return
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-03-17 14:30:05 +00:00
|
|
|
func (db *DB) retentionCutoff() (bool, error) {
|
|
|
|
if db.opts.RetentionDuration == 0 {
|
|
|
|
return false, nil
|
|
|
|
}
|
2017-03-17 14:56:19 +00:00
|
|
|
|
|
|
|
db.mtx.RLock()
|
|
|
|
defer db.mtx.RUnlock()
|
|
|
|
|
2017-03-17 14:30:05 +00:00
|
|
|
// We don't count the span covered by head blocks towards the
|
|
|
|
// retention time as it generally makes up a fraction of it.
|
|
|
|
if len(db.persisted) == 0 {
|
|
|
|
return false, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
last := db.persisted[len(db.persisted)-1]
|
|
|
|
mint := last.Meta().MaxTime - int64(db.opts.RetentionDuration)
|
|
|
|
|
|
|
|
return retentionCutoff(db.dir, mint)
|
|
|
|
}
|
|
|
|
|
2017-03-04 15:50:48 +00:00
|
|
|
func (db *DB) compact() (changes bool, err error) {
|
|
|
|
db.headmtx.RLock()
|
|
|
|
|
2017-03-17 14:30:05 +00:00
|
|
|
// Check whether we have pending head blocks that are ready to be persisted.
|
|
|
|
// They have the highest priority.
|
2017-03-04 15:50:48 +00:00
|
|
|
var singles []*headBlock
|
2017-01-06 15:27:50 +00:00
|
|
|
|
2017-03-04 15:50:48 +00:00
|
|
|
// Collect head blocks that are ready for compaction. Write them after
|
|
|
|
// returning the lock to not block Appenders.
|
|
|
|
// Selected blocks are semantically ensured to not be written to afterwards
|
|
|
|
// by appendable().
|
2017-03-02 08:13:29 +00:00
|
|
|
if len(db.heads) > db.opts.AppendableBlocks {
|
|
|
|
for _, h := range db.heads[:len(db.heads)-db.opts.AppendableBlocks] {
|
|
|
|
// Blocks that won't be appendable when instantiating a new appender
|
|
|
|
// might still have active appenders on them.
|
|
|
|
// Abort at the first one we encounter.
|
|
|
|
if atomic.LoadUint64(&h.activeWriters) > 0 {
|
|
|
|
break
|
|
|
|
}
|
2017-03-04 15:50:48 +00:00
|
|
|
singles = append(singles, h)
|
|
|
|
}
|
|
|
|
}
|
2017-01-06 11:37:28 +00:00
|
|
|
|
2017-03-04 15:50:48 +00:00
|
|
|
db.headmtx.RUnlock()
|
2017-01-18 05:18:32 +00:00
|
|
|
|
2017-03-04 15:50:48 +00:00
|
|
|
Loop:
|
|
|
|
for _, h := range singles {
|
|
|
|
db.logger.Log("msg", "write head", "seq", h.Meta().Sequence)
|
2017-01-06 11:37:28 +00:00
|
|
|
|
2017-03-04 15:50:48 +00:00
|
|
|
select {
|
|
|
|
case <-db.stopc:
|
|
|
|
break Loop
|
|
|
|
default:
|
2017-02-02 08:32:06 +00:00
|
|
|
}
|
|
|
|
|
2017-03-04 15:50:48 +00:00
|
|
|
if err = db.compactor.Write(h.Dir(), h); err != nil {
|
|
|
|
return changes, errors.Wrap(err, "persist head block")
|
|
|
|
}
|
|
|
|
changes = true
|
|
|
|
}
|
2017-01-06 11:37:28 +00:00
|
|
|
|
2017-03-02 08:13:29 +00:00
|
|
|
// Check for compactions of multiple blocks.
|
|
|
|
for {
|
2017-03-02 13:32:09 +00:00
|
|
|
plans, err := db.compactor.Plan(db.dir)
|
2017-03-02 08:13:29 +00:00
|
|
|
if err != nil {
|
2017-03-04 15:50:48 +00:00
|
|
|
return changes, errors.Wrap(err, "plan compaction")
|
2017-03-02 08:13:29 +00:00
|
|
|
}
|
2017-01-06 11:37:28 +00:00
|
|
|
|
2017-03-02 08:13:29 +00:00
|
|
|
select {
|
|
|
|
case <-db.stopc:
|
2017-03-04 15:50:48 +00:00
|
|
|
return false, nil
|
2017-03-02 08:13:29 +00:00
|
|
|
default:
|
|
|
|
}
|
|
|
|
// We just execute compactions sequentially to not cause too extreme
|
|
|
|
// CPU and memory spikes.
|
|
|
|
// TODO(fabxc): return more descriptive plans in the future that allow
|
|
|
|
// estimation of resource usage and conditional parallelization?
|
|
|
|
for _, p := range plans {
|
|
|
|
db.logger.Log("msg", "compact blocks", "seq", fmt.Sprintf("%v", p))
|
|
|
|
|
|
|
|
if err := db.compactor.Compact(p...); err != nil {
|
2017-03-04 15:50:48 +00:00
|
|
|
return changes, errors.Wrapf(err, "compact %s", p)
|
2017-03-02 08:13:29 +00:00
|
|
|
}
|
|
|
|
changes = true
|
|
|
|
}
|
|
|
|
// If we didn't compact anything, there's nothing left to do.
|
|
|
|
if len(plans) == 0 {
|
|
|
|
break
|
2017-01-18 05:18:32 +00:00
|
|
|
}
|
2017-02-23 09:50:22 +00:00
|
|
|
}
|
|
|
|
|
2017-03-04 15:50:48 +00:00
|
|
|
return changes, nil
|
2017-02-10 01:54:26 +00:00
|
|
|
}
|
|
|
|
|
2017-03-17 14:30:05 +00:00
|
|
|
// retentionCutoff deletes all directories of blocks in dir that are strictly
|
|
|
|
// before mint.
|
|
|
|
func retentionCutoff(dir string, mint int64) (bool, error) {
|
2017-03-19 12:50:35 +00:00
|
|
|
df, err := fileutil.OpenDir(dir)
|
|
|
|
if err != nil {
|
|
|
|
return false, errors.Wrapf(err, "open directory")
|
|
|
|
}
|
2017-03-17 14:30:05 +00:00
|
|
|
dirs, err := blockDirs(dir)
|
|
|
|
if err != nil {
|
|
|
|
return false, errors.Wrapf(err, "list block dirs %s", dir)
|
|
|
|
}
|
|
|
|
|
|
|
|
changes := false
|
|
|
|
|
|
|
|
for _, dir := range dirs {
|
|
|
|
meta, err := readMetaFile(dir)
|
|
|
|
if err != nil {
|
|
|
|
return changes, errors.Wrapf(err, "read block meta %s", dir)
|
|
|
|
}
|
|
|
|
// The first block we encounter marks that we crossed the boundary
|
|
|
|
// of deletable blocks.
|
|
|
|
if meta.MaxTime >= mint {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
changes = true
|
|
|
|
|
|
|
|
if err := os.RemoveAll(dir); err != nil {
|
|
|
|
return changes, err
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-03-19 12:50:35 +00:00
|
|
|
return changes, fileutil.Fsync(df)
|
2017-03-17 14:30:05 +00:00
|
|
|
}
|
2017-03-02 08:13:29 +00:00
|
|
|
|
|
|
|
func (db *DB) reloadBlocks() error {
|
2017-03-17 13:10:18 +00:00
|
|
|
var cs []io.Closer
|
|
|
|
defer closeAll(cs...)
|
|
|
|
|
2017-03-02 08:13:29 +00:00
|
|
|
db.mtx.Lock()
|
|
|
|
defer db.mtx.Unlock()
|
2017-02-10 01:54:26 +00:00
|
|
|
|
2017-03-06 08:33:55 +00:00
|
|
|
db.headmtx.Lock()
|
|
|
|
defer db.headmtx.Unlock()
|
|
|
|
|
2017-03-02 08:13:29 +00:00
|
|
|
dirs, err := blockDirs(db.dir)
|
|
|
|
if err != nil {
|
|
|
|
return errors.Wrap(err, "find blocks")
|
|
|
|
}
|
2017-02-10 01:54:26 +00:00
|
|
|
var (
|
2017-03-02 08:13:29 +00:00
|
|
|
metas []*BlockMeta
|
|
|
|
persisted []*persistedBlock
|
|
|
|
heads []*headBlock
|
|
|
|
seqBlocks = make(map[int]Block, len(dirs))
|
2017-02-10 01:54:26 +00:00
|
|
|
)
|
2017-03-02 08:13:29 +00:00
|
|
|
|
|
|
|
for _, dir := range dirs {
|
|
|
|
meta, err := readMetaFile(dir)
|
|
|
|
if err != nil {
|
|
|
|
return errors.Wrapf(err, "read meta information %s", dir)
|
2017-02-10 01:54:26 +00:00
|
|
|
}
|
2017-03-02 08:13:29 +00:00
|
|
|
metas = append(metas, meta)
|
2017-02-10 01:54:26 +00:00
|
|
|
}
|
|
|
|
|
2017-03-02 08:13:29 +00:00
|
|
|
for i, meta := range metas {
|
|
|
|
b, ok := db.seqBlocks[meta.Sequence]
|
2016-12-15 07:31:26 +00:00
|
|
|
|
2017-03-02 08:13:29 +00:00
|
|
|
if meta.Compaction.Generation == 0 {
|
2017-03-08 15:53:07 +00:00
|
|
|
if !ok {
|
|
|
|
b, err = openHeadBlock(dirs[i], db.logger)
|
|
|
|
if err != nil {
|
|
|
|
return errors.Wrapf(err, "load head at %s", dirs[i])
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if meta.ULID != b.Meta().ULID {
|
2017-03-02 08:13:29 +00:00
|
|
|
return errors.Errorf("head block ULID changed unexpectedly")
|
|
|
|
}
|
|
|
|
heads = append(heads, b.(*headBlock))
|
|
|
|
} else {
|
2017-03-09 14:40:13 +00:00
|
|
|
if !ok || meta.ULID != b.Meta().ULID {
|
2017-03-02 08:13:29 +00:00
|
|
|
b, err = newPersistedBlock(dirs[i])
|
|
|
|
if err != nil {
|
|
|
|
return errors.Wrapf(err, "open persisted block %s", dirs[i])
|
|
|
|
}
|
|
|
|
}
|
|
|
|
persisted = append(persisted, b.(*persistedBlock))
|
|
|
|
}
|
2016-12-22 11:05:24 +00:00
|
|
|
|
2017-03-02 08:13:29 +00:00
|
|
|
seqBlocks[meta.Sequence] = b
|
2016-12-09 09:00:14 +00:00
|
|
|
}
|
2017-01-06 08:26:39 +00:00
|
|
|
|
2017-03-17 13:10:18 +00:00
|
|
|
// Close all blocks that we no longer need. They are closed after returning all
|
|
|
|
// locks to avoid questionable locking order.
|
2017-03-02 08:13:29 +00:00
|
|
|
for seq, b := range db.seqBlocks {
|
2017-03-09 14:40:13 +00:00
|
|
|
if nb, ok := seqBlocks[seq]; !ok || nb != b {
|
2017-03-17 13:10:18 +00:00
|
|
|
cs = append(cs, b)
|
2017-01-06 08:26:39 +00:00
|
|
|
}
|
2017-01-02 09:34:55 +00:00
|
|
|
}
|
|
|
|
|
2017-03-02 08:13:29 +00:00
|
|
|
db.seqBlocks = seqBlocks
|
2017-01-18 05:18:32 +00:00
|
|
|
db.persisted = persisted
|
2017-01-06 10:40:09 +00:00
|
|
|
db.heads = heads
|
2017-01-03 14:43:26 +00:00
|
|
|
|
2017-02-01 14:29:48 +00:00
|
|
|
return nil
|
2017-01-02 21:24:35 +00:00
|
|
|
}
|
|
|
|
|
2017-01-06 07:08:02 +00:00
|
|
|
// Close the partition.
|
2017-01-06 10:40:09 +00:00
|
|
|
func (db *DB) Close() error {
|
2017-01-06 11:37:28 +00:00
|
|
|
close(db.stopc)
|
|
|
|
<-db.donec
|
|
|
|
|
2017-01-06 10:40:09 +00:00
|
|
|
db.mtx.Lock()
|
2017-03-17 11:12:50 +00:00
|
|
|
defer db.mtx.Unlock()
|
2017-03-04 15:50:48 +00:00
|
|
|
|
2017-03-06 11:13:15 +00:00
|
|
|
var g errgroup.Group
|
2017-01-02 09:34:55 +00:00
|
|
|
|
2017-01-06 10:40:09 +00:00
|
|
|
for _, pb := range db.persisted {
|
2017-03-06 11:13:15 +00:00
|
|
|
g.Go(pb.Close)
|
2016-12-15 07:31:26 +00:00
|
|
|
}
|
2017-01-06 10:40:09 +00:00
|
|
|
for _, hb := range db.heads {
|
2017-03-06 11:13:15 +00:00
|
|
|
g.Go(hb.Close)
|
2017-01-03 14:43:26 +00:00
|
|
|
}
|
2016-12-15 07:31:26 +00:00
|
|
|
|
2017-03-06 11:13:15 +00:00
|
|
|
var merr MultiError
|
|
|
|
|
|
|
|
merr.Add(g.Wait())
|
2017-02-19 12:01:19 +00:00
|
|
|
merr.Add(db.lockf.Unlock())
|
|
|
|
|
2017-01-02 21:24:35 +00:00
|
|
|
return merr.Err()
|
2016-12-09 09:00:14 +00:00
|
|
|
}
|
|
|
|
|
2017-01-18 05:18:32 +00:00
|
|
|
// Appender returns a new Appender on the database.
|
2017-01-09 19:04:16 +00:00
|
|
|
func (db *DB) Appender() Appender {
|
2017-01-12 18:18:51 +00:00
|
|
|
db.mtx.RLock()
|
2017-02-01 14:29:48 +00:00
|
|
|
a := &dbAppender{db: db}
|
2017-01-12 18:18:51 +00:00
|
|
|
|
2017-03-17 13:10:18 +00:00
|
|
|
// Only instantiate appender after returning the headmtx to avoid
|
|
|
|
// questionable locking order.
|
2017-03-04 15:50:48 +00:00
|
|
|
db.headmtx.RLock()
|
|
|
|
|
2017-03-17 13:10:18 +00:00
|
|
|
app := db.appendable()
|
|
|
|
heads := make([]*headBlock, len(app))
|
|
|
|
copy(heads, app)
|
2017-03-04 15:50:48 +00:00
|
|
|
|
|
|
|
db.headmtx.RUnlock()
|
|
|
|
|
2017-03-17 13:10:18 +00:00
|
|
|
for _, b := range heads {
|
|
|
|
a.heads = append(a.heads, b.Appender().(*headAppender))
|
|
|
|
}
|
|
|
|
|
2017-02-01 14:29:48 +00:00
|
|
|
return a
|
2017-01-09 19:04:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
type dbAppender struct {
|
2017-02-09 00:13:16 +00:00
|
|
|
db *DB
|
|
|
|
heads []*headAppender
|
|
|
|
samples int
|
2017-01-09 19:04:16 +00:00
|
|
|
}
|
|
|
|
|
2017-02-01 14:29:48 +00:00
|
|
|
func (a *dbAppender) Add(lset labels.Labels, t int64, v float64) (uint64, error) {
|
|
|
|
h, err := a.appenderFor(t)
|
2017-01-12 18:18:51 +00:00
|
|
|
if err != nil {
|
|
|
|
return 0, err
|
|
|
|
}
|
2017-02-01 14:29:48 +00:00
|
|
|
ref, err := h.Add(lset, t, v)
|
|
|
|
if err != nil {
|
|
|
|
return 0, err
|
|
|
|
}
|
2017-02-09 00:13:16 +00:00
|
|
|
a.samples++
|
2017-02-01 14:29:48 +00:00
|
|
|
return ref | (uint64(h.generation) << 40), nil
|
2017-01-09 19:04:16 +00:00
|
|
|
}
|
|
|
|
|
2017-02-01 14:29:48 +00:00
|
|
|
func (a *dbAppender) AddFast(ref uint64, t int64, v float64) error {
|
2017-01-12 18:18:51 +00:00
|
|
|
// We store the head generation in the 4th byte and use it to reject
|
|
|
|
// stale references.
|
2017-01-13 15:14:40 +00:00
|
|
|
gen := uint8((ref << 16) >> 56)
|
2017-01-09 19:04:16 +00:00
|
|
|
|
2017-02-01 14:29:48 +00:00
|
|
|
h, err := a.appenderFor(t)
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
2017-02-01 20:31:35 +00:00
|
|
|
// If the reference pointed into a previous block, we cannot
|
|
|
|
// use it to append the sample.
|
2017-02-01 14:29:48 +00:00
|
|
|
if h.generation != gen {
|
2017-01-16 13:18:32 +00:00
|
|
|
return ErrNotFound
|
2016-12-31 14:35:08 +00:00
|
|
|
}
|
2017-02-09 00:13:16 +00:00
|
|
|
if err := h.AddFast(ref, t, v); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
a.samples++
|
|
|
|
return nil
|
2017-01-12 18:18:51 +00:00
|
|
|
}
|
2016-12-09 12:41:38 +00:00
|
|
|
|
2017-02-01 14:29:48 +00:00
|
|
|
// appenderFor gets the appender for the head containing timestamp t.
|
|
|
|
// If the head block doesn't exist yet, it gets created.
|
|
|
|
func (a *dbAppender) appenderFor(t int64) (*headAppender, error) {
|
2017-02-01 20:31:35 +00:00
|
|
|
// If there's no fitting head block for t, ensure it gets created.
|
2017-02-02 06:58:54 +00:00
|
|
|
if len(a.heads) == 0 || t >= a.heads[len(a.heads)-1].meta.MaxTime {
|
2017-03-04 15:50:48 +00:00
|
|
|
a.db.headmtx.Lock()
|
2017-02-02 10:09:19 +00:00
|
|
|
|
2017-03-17 13:10:18 +00:00
|
|
|
var newHeads []*headBlock
|
|
|
|
|
2017-02-01 20:31:35 +00:00
|
|
|
if err := a.db.ensureHead(t); err != nil {
|
2017-03-04 15:50:48 +00:00
|
|
|
a.db.headmtx.Unlock()
|
2017-02-01 14:29:48 +00:00
|
|
|
return nil, err
|
|
|
|
}
|
2017-02-02 06:58:54 +00:00
|
|
|
if len(a.heads) == 0 {
|
2017-03-17 13:10:18 +00:00
|
|
|
newHeads = append(newHeads, a.db.appendable()...)
|
2017-02-02 06:58:54 +00:00
|
|
|
} else {
|
|
|
|
maxSeq := a.heads[len(a.heads)-1].meta.Sequence
|
|
|
|
for _, b := range a.db.appendable() {
|
|
|
|
if b.meta.Sequence > maxSeq {
|
2017-03-17 13:10:18 +00:00
|
|
|
newHeads = append(newHeads, b)
|
2017-02-02 06:58:54 +00:00
|
|
|
}
|
|
|
|
}
|
2017-02-01 14:29:48 +00:00
|
|
|
}
|
2017-03-04 15:50:48 +00:00
|
|
|
|
|
|
|
a.db.headmtx.Unlock()
|
2017-03-17 13:10:18 +00:00
|
|
|
|
|
|
|
// Instantiate appenders after returning headmtx to avoid questionable
|
|
|
|
// locking order.
|
|
|
|
for _, b := range newHeads {
|
|
|
|
a.heads = append(a.heads, b.Appender().(*headAppender))
|
|
|
|
}
|
2017-02-01 20:31:35 +00:00
|
|
|
}
|
|
|
|
for i := len(a.heads) - 1; i >= 0; i-- {
|
|
|
|
if h := a.heads[i]; t >= h.meta.MinTime {
|
2017-02-01 14:29:48 +00:00
|
|
|
return h, nil
|
|
|
|
}
|
|
|
|
}
|
2017-01-03 14:43:26 +00:00
|
|
|
|
2017-02-01 14:29:48 +00:00
|
|
|
return nil, ErrNotFound
|
|
|
|
}
|
2016-12-09 12:41:38 +00:00
|
|
|
|
2017-03-06 11:13:15 +00:00
|
|
|
// ensureHead makes sure that there is a head block for the timestamp t if
|
|
|
|
// it is within or after the currently appendable window.
|
2017-02-01 20:31:35 +00:00
|
|
|
func (db *DB) ensureHead(t int64) error {
|
|
|
|
// Initial case for a new database: we must create the first
|
|
|
|
// AppendableBlocks-1 front padding heads.
|
|
|
|
if len(db.heads) == 0 {
|
|
|
|
for i := int64(db.opts.AppendableBlocks - 1); i >= 0; i-- {
|
|
|
|
if _, err := db.cut(t - i*int64(db.opts.MinBlockDuration)); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
2016-12-09 12:41:38 +00:00
|
|
|
}
|
|
|
|
}
|
2017-02-01 14:29:48 +00:00
|
|
|
|
2017-02-01 20:31:35 +00:00
|
|
|
for {
|
|
|
|
h := db.heads[len(db.heads)-1]
|
|
|
|
// If t doesn't exceed the range of heads blocks, there's nothing to do.
|
2017-02-02 06:58:54 +00:00
|
|
|
if t < h.meta.MaxTime {
|
2017-02-01 20:31:35 +00:00
|
|
|
return nil
|
|
|
|
}
|
2017-02-02 06:58:54 +00:00
|
|
|
if _, err := db.cut(h.meta.MaxTime); err != nil {
|
2017-02-01 20:31:35 +00:00
|
|
|
return err
|
|
|
|
}
|
2017-02-01 14:29:48 +00:00
|
|
|
}
|
2016-12-09 12:41:38 +00:00
|
|
|
}
|
|
|
|
|
2017-02-01 14:29:48 +00:00
|
|
|
func (a *dbAppender) Commit() error {
|
|
|
|
var merr MultiError
|
|
|
|
|
|
|
|
for _, h := range a.heads {
|
|
|
|
merr.Add(h.Commit())
|
|
|
|
}
|
|
|
|
a.db.mtx.RUnlock()
|
|
|
|
|
2017-02-09 00:13:16 +00:00
|
|
|
if merr.Err() == nil {
|
|
|
|
a.db.metrics.samplesAppended.Add(float64(a.samples))
|
|
|
|
}
|
2017-02-01 14:29:48 +00:00
|
|
|
return merr.Err()
|
|
|
|
}
|
|
|
|
|
2017-01-12 19:17:49 +00:00
|
|
|
func (a *dbAppender) Rollback() error {
|
2017-02-01 14:29:48 +00:00
|
|
|
var merr MultiError
|
|
|
|
|
|
|
|
for _, h := range a.heads {
|
|
|
|
merr.Add(h.Rollback())
|
|
|
|
}
|
2017-01-12 19:17:49 +00:00
|
|
|
a.db.mtx.RUnlock()
|
2017-02-01 14:29:48 +00:00
|
|
|
|
|
|
|
return merr.Err()
|
|
|
|
}
|
|
|
|
|
|
|
|
func (db *DB) appendable() []*headBlock {
|
2017-02-01 20:31:35 +00:00
|
|
|
if len(db.heads) <= db.opts.AppendableBlocks {
|
|
|
|
return db.heads
|
2017-02-01 14:29:48 +00:00
|
|
|
}
|
2017-02-01 20:31:35 +00:00
|
|
|
return db.heads[len(db.heads)-db.opts.AppendableBlocks:]
|
2017-01-12 19:17:49 +00:00
|
|
|
}
|
|
|
|
|
2016-12-15 15:14:33 +00:00
|
|
|
func intervalOverlap(amin, amax, bmin, bmax int64) bool {
|
2017-03-07 11:01:25 +00:00
|
|
|
if bmin >= amin && bmin <= amax {
|
2016-12-15 15:14:33 +00:00
|
|
|
return true
|
|
|
|
}
|
2017-03-07 11:01:25 +00:00
|
|
|
if amin >= bmin && amin <= bmax {
|
2016-12-15 15:14:33 +00:00
|
|
|
return true
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
2016-12-16 11:13:17 +00:00
|
|
|
func intervalContains(min, max, t int64) bool {
|
2017-03-07 11:01:25 +00:00
|
|
|
return t >= min && t <= max
|
2016-12-16 11:13:17 +00:00
|
|
|
}
|
|
|
|
|
2017-01-06 08:26:39 +00:00
|
|
|
// blocksForInterval returns all blocks within the partition that may contain
|
2016-12-13 14:26:58 +00:00
|
|
|
// data for the given time range.
|
2017-01-10 14:28:22 +00:00
|
|
|
func (db *DB) blocksForInterval(mint, maxt int64) []Block {
|
|
|
|
var bs []Block
|
2016-12-15 15:14:33 +00:00
|
|
|
|
2017-01-06 10:40:09 +00:00
|
|
|
for _, b := range db.persisted {
|
2017-01-19 10:22:47 +00:00
|
|
|
m := b.Meta()
|
2017-02-01 14:29:48 +00:00
|
|
|
if intervalOverlap(mint, maxt, m.MinTime, m.MaxTime) {
|
2016-12-15 15:14:33 +00:00
|
|
|
bs = append(bs, b)
|
|
|
|
}
|
|
|
|
}
|
2017-01-06 10:40:09 +00:00
|
|
|
for _, b := range db.heads {
|
2017-02-01 14:29:48 +00:00
|
|
|
m := b.Meta()
|
|
|
|
if intervalOverlap(mint, maxt, m.MinTime, m.MaxTime) {
|
2017-01-03 14:43:26 +00:00
|
|
|
bs = append(bs, b)
|
|
|
|
}
|
2016-12-15 15:14:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return bs
|
2016-12-13 14:26:58 +00:00
|
|
|
}
|
|
|
|
|
2017-01-03 14:43:26 +00:00
|
|
|
// cut starts a new head block to append to. The completed head block
|
|
|
|
// will still be appendable for the configured grace period.
|
2017-02-01 14:29:48 +00:00
|
|
|
func (db *DB) cut(mint int64) (*headBlock, error) {
|
2017-02-02 06:58:54 +00:00
|
|
|
maxt := mint + int64(db.opts.MinBlockDuration)
|
2017-01-19 10:22:47 +00:00
|
|
|
|
2017-02-14 07:53:19 +00:00
|
|
|
dir, seq, err := nextSequenceFile(db.dir, "b-")
|
2017-01-19 13:01:38 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
2017-02-01 14:29:48 +00:00
|
|
|
newHead, err := createHeadBlock(dir, seq, db.logger, mint, maxt)
|
2017-01-06 08:26:39 +00:00
|
|
|
if err != nil {
|
2017-01-19 10:22:47 +00:00
|
|
|
return nil, err
|
2017-01-06 08:26:39 +00:00
|
|
|
}
|
2017-02-01 14:29:48 +00:00
|
|
|
|
2017-01-06 14:18:06 +00:00
|
|
|
db.heads = append(db.heads, newHead)
|
2017-03-02 08:13:29 +00:00
|
|
|
db.seqBlocks[seq] = newHead
|
2017-01-12 18:18:51 +00:00
|
|
|
db.headGen++
|
2016-12-09 12:41:38 +00:00
|
|
|
|
2017-02-01 14:29:48 +00:00
|
|
|
newHead.generation = db.headGen
|
|
|
|
|
|
|
|
select {
|
|
|
|
case db.compactc <- struct{}{}:
|
|
|
|
default:
|
|
|
|
}
|
|
|
|
|
2017-01-19 10:22:47 +00:00
|
|
|
return newHead, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func isBlockDir(fi os.FileInfo) bool {
|
|
|
|
if !fi.IsDir() {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
if !strings.HasPrefix(fi.Name(), "b-") {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
if _, err := strconv.ParseUint(fi.Name()[2:], 10, 32); err != nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
func blockDirs(dir string) ([]string, error) {
|
|
|
|
files, err := ioutil.ReadDir(dir)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
var dirs []string
|
|
|
|
|
|
|
|
for _, fi := range files {
|
|
|
|
if isBlockDir(fi) {
|
|
|
|
dirs = append(dirs, filepath.Join(dir, fi.Name()))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return dirs, nil
|
2017-01-03 14:43:26 +00:00
|
|
|
}
|
2016-12-09 12:41:38 +00:00
|
|
|
|
2017-02-14 07:53:19 +00:00
|
|
|
func sequenceFiles(dir, prefix string) ([]string, error) {
|
|
|
|
files, err := ioutil.ReadDir(dir)
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
var res []string
|
|
|
|
|
|
|
|
for _, fi := range files {
|
|
|
|
if isSequenceFile(fi, prefix) {
|
|
|
|
res = append(res, filepath.Join(dir, fi.Name()))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return res, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func isSequenceFile(fi os.FileInfo, prefix string) bool {
|
|
|
|
if !strings.HasPrefix(fi.Name(), prefix) {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
if _, err := strconv.ParseUint(fi.Name()[len(prefix):], 10, 32); err != nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
func nextSequenceFile(dir, prefix string) (string, int, error) {
|
2017-01-19 10:22:47 +00:00
|
|
|
names, err := fileutil.ReadDir(dir)
|
2017-01-06 08:26:39 +00:00
|
|
|
if err != nil {
|
2017-01-29 07:11:47 +00:00
|
|
|
return "", 0, err
|
2017-01-06 08:26:39 +00:00
|
|
|
}
|
2017-01-06 12:13:22 +00:00
|
|
|
|
2017-01-06 08:26:39 +00:00
|
|
|
i := uint64(0)
|
2017-01-06 12:13:22 +00:00
|
|
|
for _, n := range names {
|
2017-02-10 01:54:26 +00:00
|
|
|
if !strings.HasPrefix(n, prefix) {
|
2017-01-06 12:13:22 +00:00
|
|
|
continue
|
|
|
|
}
|
2017-02-10 01:54:26 +00:00
|
|
|
j, err := strconv.ParseUint(n[len(prefix):], 10, 32)
|
2017-01-06 12:13:22 +00:00
|
|
|
if err != nil {
|
|
|
|
continue
|
2017-01-06 08:26:39 +00:00
|
|
|
}
|
2017-01-06 12:13:22 +00:00
|
|
|
i = j
|
2017-01-06 08:26:39 +00:00
|
|
|
}
|
2017-02-10 01:54:26 +00:00
|
|
|
return filepath.Join(dir, fmt.Sprintf("%s%0.6d", prefix, i+1)), int(i + 1), nil
|
2017-01-06 08:26:39 +00:00
|
|
|
}
|
2016-12-09 12:41:38 +00:00
|
|
|
|
2016-12-10 17:08:50 +00:00
|
|
|
// The MultiError type implements the error interface, and contains the
|
|
|
|
// Errors used to construct it.
|
|
|
|
type MultiError []error
|
2016-12-07 16:10:49 +00:00
|
|
|
|
2016-12-10 17:08:50 +00:00
|
|
|
// Returns a concatenated string of the contained errors
|
|
|
|
func (es MultiError) Error() string {
|
|
|
|
var buf bytes.Buffer
|
2016-12-07 16:10:49 +00:00
|
|
|
|
2017-01-04 20:11:15 +00:00
|
|
|
if len(es) > 1 {
|
2016-12-10 17:08:50 +00:00
|
|
|
fmt.Fprintf(&buf, "%d errors: ", len(es))
|
2016-12-08 09:04:24 +00:00
|
|
|
}
|
2016-12-07 16:10:49 +00:00
|
|
|
|
2016-12-10 17:08:50 +00:00
|
|
|
for i, err := range es {
|
|
|
|
if i != 0 {
|
|
|
|
buf.WriteString("; ")
|
|
|
|
}
|
|
|
|
buf.WriteString(err.Error())
|
|
|
|
}
|
2016-12-07 16:10:49 +00:00
|
|
|
|
2016-12-10 17:08:50 +00:00
|
|
|
return buf.String()
|
2016-11-15 09:34:25 +00:00
|
|
|
}
|
2016-12-15 07:31:26 +00:00
|
|
|
|
2016-12-15 10:56:41 +00:00
|
|
|
// Add adds the error to the error list if it is not nil.
|
2016-12-31 14:35:08 +00:00
|
|
|
func (es *MultiError) Add(err error) {
|
|
|
|
if err == nil {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
if merr, ok := err.(MultiError); ok {
|
|
|
|
*es = append(*es, merr...)
|
|
|
|
} else {
|
|
|
|
*es = append(*es, err)
|
2016-12-15 07:31:26 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-12-15 10:56:41 +00:00
|
|
|
// Err returns the error list as an error or nil if it is empty.
|
2016-12-15 07:31:26 +00:00
|
|
|
func (es MultiError) Err() error {
|
|
|
|
if len(es) == 0 {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
return es
|
|
|
|
}
|
2016-12-15 10:56:41 +00:00
|
|
|
|
|
|
|
func yoloString(b []byte) string {
|
2017-03-06 16:34:49 +00:00
|
|
|
return *((*string)(unsafe.Pointer(&b)))
|
2016-12-15 10:56:41 +00:00
|
|
|
}
|
2017-02-27 09:46:15 +00:00
|
|
|
|
|
|
|
func closeAll(cs ...io.Closer) error {
|
|
|
|
var merr MultiError
|
|
|
|
|
|
|
|
for _, c := range cs {
|
|
|
|
merr.Add(c.Close())
|
|
|
|
}
|
|
|
|
return merr.Err()
|
|
|
|
}
|