Autumn-27andClaude Opus 4.8
0ef8561411
ARTEX — AI 自主渗透测试系统（Go 后端 + Next.js 前端，单二进制内嵌）。 Co-Authored-By: Claude Opus 4.8 (1M context) <[email protected]>
79 lines
1.9 KiB
Go
79 lines
1.9 KiB
Go
package db
|
|
|
|
import (
|
|
"context"
|
|
"time"
|
|
)
|
|
|
|
// DBLog is one persisted backend log row from the server_logs table.
|
|
type DBLog struct {
|
|
ID int64
|
|
CreatedAt time.Time
|
|
Level string
|
|
Tag string
|
|
Text string
|
|
}
|
|
|
|
// InsertLog appends one log line and returns its auto-assigned id.
|
|
func (d *DB) InsertLog(level, tag, text string) (int64, error) {
|
|
var id int64
|
|
err := d.QueryRowContext(context.Background(),
|
|
"INSERT INTO server_logs(level,tag,text) VALUES($1,$2,$3) RETURNING id",
|
|
level, tag, text,
|
|
).Scan(&id)
|
|
return id, err
|
|
}
|
|
|
|
// RecentLogs returns the most recent limit rows, oldest-first.
|
|
func (d *DB) RecentLogs(limit int) ([]*DBLog, error) {
|
|
rows, err := d.QueryContext(context.Background(),
|
|
`SELECT id, created_at, level, tag, text
|
|
FROM server_logs
|
|
ORDER BY id DESC
|
|
LIMIT $1`, limit)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
defer rows.Close()
|
|
var out []*DBLog
|
|
for rows.Next() {
|
|
l := &DBLog{}
|
|
if err := rows.Scan(&l.ID, &l.CreatedAt, &l.Level, &l.Tag, &l.Text); err != nil {
|
|
return nil, err
|
|
}
|
|
out = append(out, l)
|
|
}
|
|
// Reverse to oldest-first
|
|
for i, j := 0, len(out)-1; i < j; i, j = i+1, j-1 {
|
|
out[i], out[j] = out[j], out[i]
|
|
}
|
|
return out, nil
|
|
}
|
|
|
|
// ListLogsBefore returns up to limit rows with id < beforeID, oldest-first.
|
|
func (d *DB) ListLogsBefore(beforeID int64, limit int) ([]*DBLog, error) {
|
|
rows, err := d.QueryContext(context.Background(),
|
|
`SELECT id, created_at, level, tag, text
|
|
FROM server_logs
|
|
WHERE id < $1
|
|
ORDER BY id DESC
|
|
LIMIT $2`, beforeID, limit)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
defer rows.Close()
|
|
var out []*DBLog
|
|
for rows.Next() {
|
|
l := &DBLog{}
|
|
if err := rows.Scan(&l.ID, &l.CreatedAt, &l.Level, &l.Tag, &l.Text); err != nil {
|
|
return nil, err
|
|
}
|
|
out = append(out, l)
|
|
}
|
|
// Reverse to oldest-first
|
|
for i, j := 0, len(out)-1; i < j; i, j = i+1, j-1 {
|
|
out[i], out[j] = out[j], out[i]
|
|
}
|
|
return out, nil
|
|
}
|