mirror of
https://github.com/hanzoai/forge.git
synced 2026-10-30 15:00:39 +00:00
binding, captcha, cache and session came from gitea.com/go-chi — Gitea forks of
Martini/Macaron middleware, ~6000 LOC across 27 files. They are in-tree now:
modules/binding (23 consumers repointed)
modules/captcha
modules/cache/chi (modules/cache already ours; upstream goes beneath)
modules/session/chi
Not a zip migration, and that is deliberate. zip has no session layer and no
captcha layer — this forge authenticates every web request through a session,
so porting to zip is not a port, it is an auth rewrite. Vendoring removes the
gitea.com dependency, which is what was actually being asked for, at zero risk
to the auth path. The zip migration stays available and is now a decision about
the router alone rather than one entangled with sessions.
Trimmed while vendoring:
- session/ledis, cache/{ledis,nodb} deleted. The supported providers are
memory/file/kv/mysql/postgres/couchbase/memcache/db, so those backends were
dead code dragging ledisdb and nodb into the module graph.
- backend tests needing a live memcache/mysql/postgres/couchbase/redis
removed. They had never run here (they lived in an external module) and
would have been red forever. The hermetic memory/file/session tests stay
and pass.
Remaining gitea.com deps are three real upstream projects, not middleware:
runner, dingtalk_webhook, levelqueue.
Everything green; integration compile gate green.
Co-authored-by: Hanzo Dev <[email protected]>
181 lines
3.8 KiB
Go
181 lines
3.8 KiB
Go
// Copyright 2026 Hanzo AI, Inc. All rights reserved.
|
|
// Copyright 2013 Beego Authors
|
|
// Copyright 2014 The Macaron Authors
|
|
//
|
|
// 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, WITHOUT
|
|
// WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
|
|
// License for the specific language governing permissions and limitations
|
|
// under the License.
|
|
|
|
package cache
|
|
|
|
import (
|
|
"errors"
|
|
"sync"
|
|
"time"
|
|
)
|
|
|
|
// MemoryItem represents a memory cache item.
|
|
type MemoryItem struct {
|
|
val interface{}
|
|
created int64
|
|
expire int64
|
|
}
|
|
|
|
func (item *MemoryItem) hasExpired() bool {
|
|
return item.expire > 0 &&
|
|
(time.Now().Unix()-item.created) >= item.expire
|
|
}
|
|
|
|
// MemoryCacher represents a memory cache adapter implementation.
|
|
type MemoryCacher struct {
|
|
lock sync.RWMutex
|
|
items map[string]*MemoryItem
|
|
interval int // GC interval.
|
|
}
|
|
|
|
// NewMemoryCacher creates and returns a new memory cacher.
|
|
func NewMemoryCacher() *MemoryCacher {
|
|
return &MemoryCacher{items: make(map[string]*MemoryItem)}
|
|
}
|
|
|
|
// Put puts value into cache with key and expire time.
|
|
// If expired is 0, it will be deleted by next GC operation.
|
|
func (c *MemoryCacher) Put(key string, val interface{}, expire int64) error {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
|
|
c.items[key] = &MemoryItem{
|
|
val: val,
|
|
created: time.Now().Unix(),
|
|
expire: expire,
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// Get gets cached value by given key.
|
|
func (c *MemoryCacher) Get(key string) interface{} {
|
|
c.lock.RLock()
|
|
defer c.lock.RUnlock()
|
|
|
|
item, ok := c.items[key]
|
|
if !ok {
|
|
return nil
|
|
}
|
|
if item.hasExpired() {
|
|
go c.Delete(key)
|
|
return nil
|
|
}
|
|
return item.val
|
|
}
|
|
|
|
// Delete deletes cached value by given key.
|
|
func (c *MemoryCacher) Delete(key string) error {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
|
|
delete(c.items, key)
|
|
return nil
|
|
}
|
|
|
|
// Incr increases cached int-type value by given key as a counter.
|
|
func (c *MemoryCacher) Incr(key string) (err error) {
|
|
c.lock.RLock()
|
|
defer c.lock.RUnlock()
|
|
|
|
item, ok := c.items[key]
|
|
if !ok {
|
|
return errors.New("key not exist")
|
|
}
|
|
item.val, err = Incr(item.val)
|
|
return err
|
|
}
|
|
|
|
// Decr decreases cached int-type value by given key as a counter.
|
|
func (c *MemoryCacher) Decr(key string) (err error) {
|
|
c.lock.RLock()
|
|
defer c.lock.RUnlock()
|
|
|
|
item, ok := c.items[key]
|
|
if !ok {
|
|
return errors.New("key not exist")
|
|
}
|
|
|
|
item.val, err = Decr(item.val)
|
|
return err
|
|
}
|
|
|
|
// IsExist returns true if cached value exists.
|
|
func (c *MemoryCacher) IsExist(key string) bool {
|
|
c.lock.RLock()
|
|
defer c.lock.RUnlock()
|
|
|
|
if item, ok := c.items[key]; ok {
|
|
return !item.hasExpired()
|
|
}
|
|
return false
|
|
}
|
|
|
|
// Flush deletes all cached data.
|
|
func (c *MemoryCacher) Flush() error {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
|
|
c.items = make(map[string]*MemoryItem)
|
|
return nil
|
|
}
|
|
|
|
func (c *MemoryCacher) checkRawExpiration(key string) {
|
|
item, ok := c.items[key]
|
|
if !ok {
|
|
return
|
|
}
|
|
|
|
if item.hasExpired() {
|
|
delete(c.items, key)
|
|
}
|
|
}
|
|
|
|
func (c *MemoryCacher) startGC() {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
|
|
if c.interval < 1 {
|
|
return
|
|
}
|
|
|
|
if c.items != nil {
|
|
for key := range c.items {
|
|
c.checkRawExpiration(key)
|
|
}
|
|
}
|
|
|
|
time.AfterFunc(time.Duration(c.interval)*time.Second, func() { c.startGC() })
|
|
}
|
|
|
|
// StartAndGC starts GC routine based on config string settings.
|
|
func (c *MemoryCacher) StartAndGC(opt Options) error {
|
|
c.lock.Lock()
|
|
c.interval = opt.Interval
|
|
c.lock.Unlock()
|
|
|
|
go c.startGC()
|
|
return nil
|
|
}
|
|
|
|
func init() {
|
|
Register("memory", NewMemoryCacher())
|
|
}
|
|
|
|
// Ping tests if the cache is alive.
|
|
func (c *MemoryCacher) Ping() error {
|
|
return GenericPing(c)
|
|
}
|