forked from forgejo/forgejo
Integrate public as bindata optionally (#293)
* Dropped unused codekit config * Integrated dynamic and static bindata for public * Ignore public bindata * Add a general generate make task * Integrated flexible public assets into web command * Updated vendoring, added all missiong govendor deps * Made the linter happy with the bindata and dynamic code * Moved public bindata definition to modules directory * Ignoring the new bindata path now * Updated to the new public modules import path * Updated public bindata command and drop the new prefix
This commit is contained in:
parent
4680c349dd
commit
b6a95a8cb3
691 changed files with 305318 additions and 1272 deletions
58
vendor/github.com/pingcap/tidb/kv/bufpool.go
generated
vendored
Normal file
58
vendor/github.com/pingcap/tidb/kv/bufpool.go
generated
vendored
Normal file
|
@ -0,0 +1,58 @@
|
|||
// Copyright 2015 PingCAP, Inc.
|
||||
//
|
||||
// Licensed under the Apache License, Version 2.0 (the "License");
|
||||
// you may not use this file except in compliance with the License.
|
||||
// You may obtain a copy of the License at
|
||||
//
|
||||
// http://www.apache.org/licenses/LICENSE-2.0
|
||||
//
|
||||
// Unless required by applicable law or agreed to in writing, software
|
||||
// distributed under the License is distributed on an "AS IS" BASIS,
|
||||
// See the License for the specific language governing permissions and
|
||||
// limitations under the License.
|
||||
|
||||
package kv
|
||||
|
||||
import (
|
||||
"sync"
|
||||
|
||||
"github.com/ngaut/log"
|
||||
)
|
||||
|
||||
// A cache holds a set of reusable objects.
|
||||
// The slice is a stack (LIFO).
|
||||
// If more are needed, the cache creates them by calling new.
|
||||
type cache struct {
|
||||
mu sync.Mutex
|
||||
name string
|
||||
saved []MemBuffer
|
||||
// factory
|
||||
fact func() MemBuffer
|
||||
}
|
||||
|
||||
func (c *cache) put(x MemBuffer) {
|
||||
c.mu.Lock()
|
||||
if len(c.saved) < cap(c.saved) {
|
||||
c.saved = append(c.saved, x)
|
||||
} else {
|
||||
log.Warnf("%s is full, size: %d, you may need to increase pool size", c.name, len(c.saved))
|
||||
}
|
||||
c.mu.Unlock()
|
||||
}
|
||||
|
||||
func (c *cache) get() MemBuffer {
|
||||
c.mu.Lock()
|
||||
n := len(c.saved)
|
||||
if n == 0 {
|
||||
c.mu.Unlock()
|
||||
return c.fact()
|
||||
}
|
||||
x := c.saved[n-1]
|
||||
c.saved = c.saved[0 : n-1]
|
||||
c.mu.Unlock()
|
||||
return x
|
||||
}
|
||||
|
||||
func newCache(name string, cap int, fact func() MemBuffer) *cache {
|
||||
return &cache{name: name, saved: make([]MemBuffer, 0, cap), fact: fact}
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue