2026-03-05 13:18:00 -05:00
|
|
|
|
// poc-memory daemon: background job orchestration for memory maintenance
|
|
|
|
|
|
//
|
|
|
|
|
|
// Replaces the fragile cron+shell approach with a single long-running process
|
|
|
|
|
|
// that owns all background memory work. Uses jobkit for worker pool, status
|
|
|
|
|
|
// tracking, retry, and cancellation.
|
|
|
|
|
|
//
|
|
|
|
|
|
// Architecture:
|
|
|
|
|
|
// - Scheduler task: runs every 60s, scans filesystem state, spawns jobs
|
|
|
|
|
|
// - Session watcher task: detects ended Claude sessions, triggers extraction
|
|
|
|
|
|
// - Jobs shell out to existing poc-memory subcommands (Phase 1)
|
|
|
|
|
|
// - Status written to daemon-status.json for `poc-memory daemon status`
|
|
|
|
|
|
//
|
|
|
|
|
|
// Phase 2 will inline job logic; Phase 3 integrates into poc-agent.
|
|
|
|
|
|
|
2026-03-14 02:40:30 -04:00
|
|
|
|
use jobkit::{Choir, ExecutionContext, TaskError, TaskInfo, TaskStatus};
|
2026-03-05 13:18:00 -05:00
|
|
|
|
use std::fs;
|
|
|
|
|
|
use std::path::{Path, PathBuf};
|
2026-03-05 22:16:17 -05:00
|
|
|
|
use std::sync::{Arc, Mutex};
|
2026-03-05 13:18:00 -05:00
|
|
|
|
use std::time::{Duration, SystemTime};
|
|
|
|
|
|
|
|
|
|
|
|
const SCHEDULER_INTERVAL: Duration = Duration::from_secs(60);
|
|
|
|
|
|
const HEALTH_INTERVAL: Duration = Duration::from_secs(3600);
|
2026-03-21 11:33:36 -04:00
|
|
|
|
|
|
|
|
|
|
// --- Persistent task queue ---
|
|
|
|
|
|
|
|
|
|
|
|
#[derive(Clone, Debug, serde::Serialize, serde::Deserialize)]
|
|
|
|
|
|
struct PendingTask {
|
|
|
|
|
|
id: String,
|
|
|
|
|
|
agent: String,
|
|
|
|
|
|
batch: usize,
|
|
|
|
|
|
#[serde(default)]
|
|
|
|
|
|
target_key: Option<String>,
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
struct TaskQueue {
|
|
|
|
|
|
path: PathBuf,
|
|
|
|
|
|
tasks: Mutex<Vec<PendingTask>>,
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
impl TaskQueue {
|
|
|
|
|
|
fn load(data_dir: &Path) -> Arc<Self> {
|
|
|
|
|
|
let path = data_dir.join("pending-tasks.jsonl");
|
|
|
|
|
|
let tasks = if path.exists() {
|
|
|
|
|
|
fs::read_to_string(&path)
|
|
|
|
|
|
.unwrap_or_default()
|
|
|
|
|
|
.lines()
|
|
|
|
|
|
.filter_map(|l| serde_json::from_str(l).ok())
|
|
|
|
|
|
.collect()
|
|
|
|
|
|
} else {
|
|
|
|
|
|
Vec::new()
|
|
|
|
|
|
};
|
|
|
|
|
|
let count = tasks.len();
|
|
|
|
|
|
if count > 0 {
|
|
|
|
|
|
log_event("task-queue", "loaded", &format!("{} pending tasks", count));
|
|
|
|
|
|
}
|
|
|
|
|
|
Arc::new(Self { path, tasks: Mutex::new(tasks) })
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fn push(&self, task: PendingTask) {
|
|
|
|
|
|
let mut tasks = self.tasks.lock().unwrap();
|
|
|
|
|
|
tasks.push(task);
|
|
|
|
|
|
self.write_locked(&tasks);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fn remove(&self, id: &str) {
|
|
|
|
|
|
let mut tasks = self.tasks.lock().unwrap();
|
|
|
|
|
|
tasks.retain(|t| t.id != id);
|
|
|
|
|
|
self.write_locked(&tasks);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fn drain(&self) -> Vec<PendingTask> {
|
|
|
|
|
|
let tasks = self.tasks.lock().unwrap();
|
|
|
|
|
|
tasks.clone()
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fn write_locked(&self, tasks: &[PendingTask]) {
|
|
|
|
|
|
let content: String = tasks.iter()
|
|
|
|
|
|
.filter_map(|t| serde_json::to_string(t).ok())
|
|
|
|
|
|
.collect::<Vec<_>>()
|
|
|
|
|
|
.join("\n");
|
|
|
|
|
|
let _ = fs::write(&self.path, if content.is_empty() { String::new() } else { content + "\n" });
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
2026-03-28 20:39:20 -04:00
|
|
|
|
fn logs_dir() -> PathBuf {
|
|
|
|
|
|
let dir = dirs::home_dir().unwrap_or_default().join(".consciousness/logs");
|
|
|
|
|
|
let _ = fs::create_dir_all(&dir);
|
|
|
|
|
|
dir
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-28 20:39:20 -04:00
|
|
|
|
fn log_path() -> PathBuf {
|
|
|
|
|
|
logs_dir().join("daemon.log")
|
|
|
|
|
|
}
|
2026-03-05 13:18:00 -05:00
|
|
|
|
|
|
|
|
|
|
fn log_event(job: &str, event: &str, detail: &str) {
|
2026-03-28 20:39:20 -04:00
|
|
|
|
jobkit::daemon::event_log::log(&logs_dir(), job, event, detail);
|
2026-03-19 11:17:07 -04:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 21:53:27 -05:00
|
|
|
|
// --- Job functions (direct, no subprocess) ---
|
2026-03-05 13:18:00 -05:00
|
|
|
|
|
2026-03-19 11:21:30 -04:00
|
|
|
|
static DAEMON_POOL: std::sync::OnceLock<Arc<jobkit::ResourcePool>> = std::sync::OnceLock::new();
|
|
|
|
|
|
|
2026-03-05 21:57:53 -05:00
|
|
|
|
/// Run a named job with logging, progress reporting, and error mapping.
|
|
|
|
|
|
fn run_job(ctx: &ExecutionContext, name: &str, f: impl FnOnce() -> Result<(), String>) -> Result<(), TaskError> {
|
2026-03-19 11:21:30 -04:00
|
|
|
|
let pool = DAEMON_POOL.get().map(|p| p.as_ref());
|
|
|
|
|
|
jobkit::daemon::Daemon::run_job(&crate::config::get().data_dir, ctx, name, pool, f)
|
2026-03-05 21:53:27 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-16 20:44:09 -04:00
|
|
|
|
// experience_mine and fact_mine removed — observation.agent handles all transcript mining
|
2026-03-05 15:31:08 -05:00
|
|
|
|
|
2026-03-17 01:24:54 -04:00
|
|
|
|
/// Run an agent targeted at a specific node key.
|
|
|
|
|
|
fn job_targeted_agent(
|
|
|
|
|
|
ctx: &ExecutionContext,
|
|
|
|
|
|
agent_type: &str,
|
|
|
|
|
|
target_key: &str,
|
|
|
|
|
|
) -> Result<(), TaskError> {
|
|
|
|
|
|
let agent = agent_type.to_string();
|
|
|
|
|
|
let key = target_key.to_string();
|
2026-03-19 11:17:07 -04:00
|
|
|
|
let job_name = format!("c-{}-target({})", agent, key);
|
2026-03-17 01:24:54 -04:00
|
|
|
|
run_job(ctx, &job_name, || {
|
|
|
|
|
|
let mut store = crate::store::Store::load()?;
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("targeting: {}", key));
|
2026-04-04 17:33:36 -04:00
|
|
|
|
crate::agent::oneshot::run_one_agent(
|
2026-04-07 01:23:22 -04:00
|
|
|
|
&mut store, &agent, 5, Some(std::slice::from_ref(&key)),
|
2026-03-17 01:24:54 -04:00
|
|
|
|
)?;
|
|
|
|
|
|
ctx.log_line("done");
|
|
|
|
|
|
Ok(())
|
|
|
|
|
|
})
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
/// Run a single consolidation agent (replay, linker, separator, transfer, health).
|
2026-03-20 12:45:24 -04:00
|
|
|
|
/// Shared set of node keys currently being processed by agents.
|
|
|
|
|
|
/// Prevents concurrent agents from working on overlapping graph regions.
|
|
|
|
|
|
type InFlightNodes = Arc<Mutex<std::collections::HashSet<String>>>;
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
fn job_consolidation_agent(
|
|
|
|
|
|
ctx: &ExecutionContext,
|
|
|
|
|
|
agent_type: &str,
|
|
|
|
|
|
batch_size: usize,
|
2026-03-20 12:45:24 -04:00
|
|
|
|
in_flight: &InFlightNodes,
|
2026-03-09 17:02:01 -04:00
|
|
|
|
) -> Result<(), TaskError> {
|
|
|
|
|
|
let agent = agent_type.to_string();
|
|
|
|
|
|
let batch = batch_size;
|
2026-03-13 20:25:19 -04:00
|
|
|
|
let job_name = format!("c-{}", agent);
|
2026-03-20 12:45:24 -04:00
|
|
|
|
let in_flight = Arc::clone(in_flight);
|
2026-03-13 20:25:19 -04:00
|
|
|
|
run_job(ctx, &job_name, || {
|
2026-03-05 22:16:17 -05:00
|
|
|
|
ctx.log_line("loading store");
|
2026-03-05 21:53:27 -05:00
|
|
|
|
let mut store = crate::store::Store::load()?;
|
2026-03-20 12:45:24 -04:00
|
|
|
|
|
|
|
|
|
|
// Claim seeds: lock in-flight set, run query excluding it,
|
|
|
|
|
|
// add selected seeds + strongly-connected neighbors, then unlock.
|
|
|
|
|
|
let mut claimed_keys: Vec<String>;
|
|
|
|
|
|
let graph = store.build_graph();
|
|
|
|
|
|
{
|
|
|
|
|
|
let mut locked = in_flight.lock().unwrap();
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("running agent: {} (batch={}, {} in-flight)",
|
2026-03-20 12:45:24 -04:00
|
|
|
|
agent, batch, locked.len()));
|
|
|
|
|
|
|
|
|
|
|
|
// Run the agent's query, filtering out in-flight nodes
|
|
|
|
|
|
let def = super::defs::get_def(&agent)
|
|
|
|
|
|
.ok_or_else(|| format!("no .agent file for {}", agent))?;
|
|
|
|
|
|
let query = &def.query;
|
|
|
|
|
|
let keys = if !query.is_empty() {
|
|
|
|
|
|
use crate::query::engine as search;
|
|
|
|
|
|
let mut stages = search::Stage::parse_pipeline(query)?;
|
|
|
|
|
|
let padded = batch + locked.len().min(100);
|
|
|
|
|
|
if !stages.iter().any(|s| matches!(s, search::Stage::Transform(search::Transform::Limit(_)))) {
|
|
|
|
|
|
stages.push(search::Stage::Transform(search::Transform::Limit(padded)));
|
|
|
|
|
|
}
|
|
|
|
|
|
let results = search::run_query(&stages, vec![], &graph, &store, false, padded);
|
|
|
|
|
|
results.into_iter()
|
|
|
|
|
|
.map(|(k, _)| k)
|
|
|
|
|
|
.filter(|k| !locked.contains(k))
|
|
|
|
|
|
.take(batch)
|
|
|
|
|
|
.collect::<Vec<_>>()
|
|
|
|
|
|
} else {
|
|
|
|
|
|
vec![]
|
|
|
|
|
|
};
|
|
|
|
|
|
if keys.is_empty() {
|
|
|
|
|
|
return Err("query returned no results (after exclusion)".into());
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Claim seeds + strongly-connected neighbors.
|
|
|
|
|
|
// Only exclude neighbors with score > threshold to avoid
|
|
|
|
|
|
// blacking out the graph via high-degree hub nodes.
|
|
|
|
|
|
claimed_keys = Vec::with_capacity(batch * 20);
|
|
|
|
|
|
for key in &keys {
|
|
|
|
|
|
claimed_keys.push(key.clone());
|
|
|
|
|
|
locked.insert(key.clone());
|
|
|
|
|
|
for (nbr, strength) in graph.neighbors(key) {
|
|
|
|
|
|
let weight = store.nodes.get(nbr.as_str())
|
|
|
|
|
|
.map(|n| n.weight).unwrap_or(0.1);
|
2026-03-20 16:29:20 -04:00
|
|
|
|
if strength * weight > 0.3 {
|
2026-03-20 12:45:24 -04:00
|
|
|
|
claimed_keys.push(nbr.clone());
|
|
|
|
|
|
locked.insert(nbr.clone());
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
// in_flight lock released — run LLM without holding it
|
|
|
|
|
|
|
|
|
|
|
|
// Use run_one_agent_with_keys — we already selected seeds above,
|
|
|
|
|
|
// no need to re-run the query.
|
2026-04-04 17:33:36 -04:00
|
|
|
|
let result = crate::agent::oneshot::run_one_agent(
|
2026-04-07 01:23:22 -04:00
|
|
|
|
&mut store, &agent, batch, Some(&claimed_keys),
|
2026-03-20 12:45:24 -04:00
|
|
|
|
).map(|_| ());
|
|
|
|
|
|
|
|
|
|
|
|
// Release all claimed keys (seeds + neighbors)
|
|
|
|
|
|
{
|
|
|
|
|
|
let mut locked = in_flight.lock().unwrap();
|
|
|
|
|
|
for key in &claimed_keys {
|
|
|
|
|
|
locked.remove(key);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
result?;
|
Remove dead action pipeline: parsing, depth tracking, knowledge loop, fact miner
Agents now apply changes via tool calls (poc-memory write/link-add/etc)
during the LLM call. The old pipeline — where agents output WRITE_NODE/
LINK/REFINE text, which was parsed and applied separately — is dead code.
Removed:
- Action/ActionKind/Confidence types and all parse_* functions
- DepthDb, depth tracking, confidence gating
- apply_action, stamp_content, has_edge
- NamingResolution, resolve_naming and related naming agent code
- KnowledgeLoopConfig, CycleResult, GraphMetrics, convergence checking
- run_knowledge_loop, run_cycle, check_convergence
- apply_consolidation (old report re-processing)
- fact_mine.rs (folded into observation agent)
- resolve_action_names
Simplified:
- AgentResult no longer carries actions/no_ops
- run_and_apply_with_log just runs the agent
- consolidate_full simplified action tracking
-1364 lines.
2026-03-17 00:37:12 -04:00
|
|
|
|
ctx.log_line("done");
|
2026-03-09 17:02:01 -04:00
|
|
|
|
Ok(())
|
|
|
|
|
|
})
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-10 00:55:26 -04:00
|
|
|
|
/// Run the rename agent: generates renames via LLM, applies them directly.
|
|
|
|
|
|
fn job_rename_agent(
|
|
|
|
|
|
ctx: &ExecutionContext,
|
|
|
|
|
|
batch_size: usize,
|
|
|
|
|
|
) -> Result<(), TaskError> {
|
|
|
|
|
|
run_job(ctx, "c-rename", || {
|
|
|
|
|
|
ctx.log_line("loading store");
|
|
|
|
|
|
let mut store = crate::store::Store::load()?;
|
|
|
|
|
|
|
|
|
|
|
|
let batch = if batch_size == 0 { 10 } else { batch_size };
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("running rename agent (batch={})", batch));
|
2026-03-10 00:55:26 -04:00
|
|
|
|
|
2026-04-07 01:23:22 -04:00
|
|
|
|
let result = crate::agent::oneshot::run_one_agent(&mut store, "rename", batch, None)?;
|
2026-03-10 00:55:26 -04:00
|
|
|
|
|
2026-03-10 17:48:00 -04:00
|
|
|
|
// Parse RENAME actions from response (rename uses its own format, not WRITE_NODE/LINK/REFINE)
|
2026-03-10 00:55:26 -04:00
|
|
|
|
let mut applied = 0;
|
|
|
|
|
|
let mut skipped = 0;
|
2026-03-10 17:48:00 -04:00
|
|
|
|
for line in result.output.lines() {
|
2026-03-10 00:55:26 -04:00
|
|
|
|
let trimmed = line.trim();
|
|
|
|
|
|
if !trimmed.starts_with("RENAME ") { continue; }
|
|
|
|
|
|
|
2026-03-10 17:48:00 -04:00
|
|
|
|
let parts: Vec<&str> = trimmed[7..].splitn(2, ' ').collect();
|
2026-03-10 00:55:26 -04:00
|
|
|
|
if parts.len() != 2 { skipped += 1; continue; }
|
|
|
|
|
|
|
|
|
|
|
|
let old_key = parts[0].trim();
|
|
|
|
|
|
let new_key = parts[1].trim();
|
|
|
|
|
|
if old_key.is_empty() || new_key.is_empty() { skipped += 1; continue; }
|
|
|
|
|
|
|
|
|
|
|
|
let resolved = match store.resolve_key(old_key) {
|
|
|
|
|
|
Ok(k) => k,
|
|
|
|
|
|
Err(e) => {
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("skip: {} → {}: {}", old_key, new_key, e));
|
2026-03-10 00:55:26 -04:00
|
|
|
|
skipped += 1;
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
if store.nodes.contains_key(new_key) {
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("skip: {} already exists", new_key));
|
2026-03-10 00:55:26 -04:00
|
|
|
|
skipped += 1;
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
match store.rename_node(&resolved, new_key) {
|
|
|
|
|
|
Ok(()) => {
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("renamed: {} → {}", resolved, new_key));
|
2026-03-10 00:55:26 -04:00
|
|
|
|
applied += 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
Err(e) => {
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("error: {} → {}: {}", resolved, new_key, e));
|
2026-03-10 00:55:26 -04:00
|
|
|
|
skipped += 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if applied > 0 {
|
|
|
|
|
|
store.save()?;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("done: {} applied, {} skipped", applied, skipped));
|
2026-03-10 01:48:41 -04:00
|
|
|
|
Ok(())
|
|
|
|
|
|
})
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
/// Link orphan nodes (CPU-heavy, no LLM).
|
|
|
|
|
|
fn job_link_orphans(ctx: &ExecutionContext) -> Result<(), TaskError> {
|
|
|
|
|
|
run_job(ctx, "c-orphans", || {
|
|
|
|
|
|
ctx.log_line("loading store");
|
|
|
|
|
|
let mut store = crate::store::Store::load()?;
|
|
|
|
|
|
ctx.log_line("linking orphans");
|
|
|
|
|
|
let (orphans, added) = crate::neuro::link_orphans(&mut store, 2, 3, 0.15);
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("{} orphans, {} links added", orphans, added));
|
2026-03-09 17:02:01 -04:00
|
|
|
|
Ok(())
|
|
|
|
|
|
})
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Cap node degree to prevent mega-hubs.
|
|
|
|
|
|
fn job_cap_degree(ctx: &ExecutionContext) -> Result<(), TaskError> {
|
|
|
|
|
|
run_job(ctx, "c-cap", || {
|
|
|
|
|
|
ctx.log_line("loading store");
|
|
|
|
|
|
let mut store = crate::store::Store::load()?;
|
|
|
|
|
|
ctx.log_line("capping degree");
|
|
|
|
|
|
match store.cap_degree(50) {
|
|
|
|
|
|
Ok((hubs, pruned)) => {
|
|
|
|
|
|
store.save()?;
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("{} hubs capped, {} edges pruned", hubs, pruned));
|
2026-03-09 17:02:01 -04:00
|
|
|
|
Ok(())
|
|
|
|
|
|
}
|
|
|
|
|
|
Err(e) => Err(e),
|
|
|
|
|
|
}
|
|
|
|
|
|
})
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Apply links extracted from digests.
|
|
|
|
|
|
fn job_digest_links(ctx: &ExecutionContext) -> Result<(), TaskError> {
|
|
|
|
|
|
run_job(ctx, "c-digest-links", || {
|
|
|
|
|
|
ctx.log_line("loading store");
|
|
|
|
|
|
let mut store = crate::store::Store::load()?;
|
|
|
|
|
|
ctx.log_line("applying digest links");
|
|
|
|
|
|
let links = super::digest::parse_all_digest_links(&store);
|
|
|
|
|
|
let (applied, skipped, fallbacks) = super::digest::apply_digest_links(&mut store, &links);
|
|
|
|
|
|
store.save()?;
|
2026-03-21 19:42:03 -04:00
|
|
|
|
ctx.log_line(format!("{} applied, {} skipped, {} fallbacks", applied, skipped, fallbacks));
|
2026-03-09 17:02:01 -04:00
|
|
|
|
Ok(())
|
2026-03-05 21:53:27 -05:00
|
|
|
|
})
|
|
|
|
|
|
}
|
|
|
|
|
|
|
Remove dead action pipeline: parsing, depth tracking, knowledge loop, fact miner
Agents now apply changes via tool calls (poc-memory write/link-add/etc)
during the LLM call. The old pipeline — where agents output WRITE_NODE/
LINK/REFINE text, which was parsed and applied separately — is dead code.
Removed:
- Action/ActionKind/Confidence types and all parse_* functions
- DepthDb, depth tracking, confidence gating
- apply_action, stamp_content, has_edge
- NamingResolution, resolve_naming and related naming agent code
- KnowledgeLoopConfig, CycleResult, GraphMetrics, convergence checking
- run_knowledge_loop, run_cycle, check_convergence
- apply_consolidation (old report re-processing)
- fact_mine.rs (folded into observation agent)
- resolve_action_names
Simplified:
- AgentResult no longer carries actions/no_ops
- run_and_apply_with_log just runs the agent
- consolidate_full simplified action tracking
-1364 lines.
2026-03-17 00:37:12 -04:00
|
|
|
|
fn job_knowledge_loop(_ctx: &ExecutionContext) -> Result<(), TaskError> {
|
|
|
|
|
|
// Knowledge loop removed — agents now use tool calls directly.
|
|
|
|
|
|
// Consolidation is handled by consolidate_full() in the consolidate job.
|
|
|
|
|
|
Ok(())
|
2026-03-05 21:53:27 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 21:57:53 -05:00
|
|
|
|
fn job_digest(ctx: &ExecutionContext) -> Result<(), TaskError> {
|
|
|
|
|
|
run_job(ctx, "digest", || {
|
2026-03-05 22:16:17 -05:00
|
|
|
|
ctx.log_line("loading store");
|
2026-03-05 21:53:27 -05:00
|
|
|
|
let mut store = crate::store::Store::load()?;
|
2026-03-05 22:16:17 -05:00
|
|
|
|
ctx.log_line("generating digests");
|
2026-03-05 21:53:27 -05:00
|
|
|
|
crate::digest::digest_auto(&mut store)
|
|
|
|
|
|
})
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
fn job_daily_check(
|
|
|
|
|
|
ctx: &ExecutionContext,
|
|
|
|
|
|
graph_health: &Arc<Mutex<Option<GraphHealth>>>,
|
|
|
|
|
|
) -> Result<(), TaskError> {
|
|
|
|
|
|
let gh = Arc::clone(graph_health);
|
2026-03-05 21:57:53 -05:00
|
|
|
|
run_job(ctx, "daily-check", || {
|
2026-03-05 22:16:17 -05:00
|
|
|
|
ctx.log_line("loading store");
|
2026-03-05 21:53:27 -05:00
|
|
|
|
let store = crate::store::Store::load()?;
|
2026-03-05 22:16:17 -05:00
|
|
|
|
ctx.log_line("checking health");
|
2026-03-05 21:57:53 -05:00
|
|
|
|
let _report = crate::neuro::daily_check(&store);
|
2026-03-09 17:02:01 -04:00
|
|
|
|
|
2026-03-11 00:13:58 -04:00
|
|
|
|
// Decay search hit counters (10% daily decay)
|
|
|
|
|
|
ctx.log_line("decaying search counters");
|
|
|
|
|
|
match crate::counters::decay_all(0.9) {
|
2026-03-21 19:42:03 -04:00
|
|
|
|
Ok(removed) => ctx.log_line(format!("decayed counters, removed {}", removed)),
|
|
|
|
|
|
Err(e) => ctx.log_line(format!("counter decay failed: {}", e)),
|
2026-03-11 00:13:58 -04:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
// Compute graph health metrics for status display
|
|
|
|
|
|
ctx.log_line("computing graph health");
|
|
|
|
|
|
let health = compute_graph_health(&store);
|
|
|
|
|
|
*gh.lock().unwrap() = Some(health);
|
|
|
|
|
|
|
2026-03-05 21:53:27 -05:00
|
|
|
|
Ok(())
|
|
|
|
|
|
})
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-04-09 00:45:26 -04:00
|
|
|
|
pub fn compute_graph_health(store: &crate::store::Store) -> GraphHealth {
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let graph = store.build_graph();
|
|
|
|
|
|
let snap = crate::graph::current_metrics(&graph);
|
|
|
|
|
|
|
|
|
|
|
|
let episodic_count = store.nodes.iter()
|
|
|
|
|
|
.filter(|(_, n)| matches!(n.node_type, crate::store::NodeType::EpisodicSession))
|
|
|
|
|
|
.count();
|
|
|
|
|
|
let episodic_ratio = if store.nodes.is_empty() { 0.0 }
|
|
|
|
|
|
else { episodic_count as f32 / store.nodes.len() as f32 };
|
|
|
|
|
|
|
2026-03-10 17:55:08 -04:00
|
|
|
|
// Use the same planning logic as consolidation (skip O(n²) interference)
|
|
|
|
|
|
let plan = crate::neuro::consolidation_plan_quick(store);
|
2026-03-09 17:02:01 -04:00
|
|
|
|
|
|
|
|
|
|
GraphHealth {
|
|
|
|
|
|
nodes: snap.nodes,
|
|
|
|
|
|
edges: snap.edges,
|
|
|
|
|
|
communities: snap.communities,
|
|
|
|
|
|
alpha: snap.alpha,
|
|
|
|
|
|
gini: snap.gini,
|
|
|
|
|
|
avg_cc: snap.avg_cc,
|
|
|
|
|
|
sigma: snap.sigma,
|
|
|
|
|
|
episodic_ratio,
|
2026-03-10 17:55:08 -04:00
|
|
|
|
interference: 0,
|
consolidation: data-driven agent plan, drop transfer/connector/replay
Replace per-field ConsolidationPlan struct with HashMap<String, usize>
counts map. Agent types are no longer hardcoded in the struct — add
agents by adding entries to the map.
Active agents: linker, organize, distill, separator, split.
Removed: transfer (redundant with distill), connector (rethink later),
replay (not needed for current graph work).
Elo-based budget allocation now iterates the map instead of indexing
a fixed array. Status display and TUI adapted to show dynamic agent
lists.
memory-instructions-core v13: added protected nodes section — agents
must not rewrite core-personality, core-personality-detail, or
memory-instructions-core. They may add links but not modify content.
High-value neighbors should be treated with care.
Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
2026-03-20 14:02:28 -04:00
|
|
|
|
plan_counts: plan.counts,
|
2026-03-10 17:55:08 -04:00
|
|
|
|
plan_rationale: plan.rationale,
|
2026-03-09 17:02:01 -04:00
|
|
|
|
computed_at: crate::store::format_datetime_space(crate::store::now_epoch()),
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 15:31:08 -05:00
|
|
|
|
/// Get process uptime as human-readable string by reading /proc/<pid>/stat.
|
|
|
|
|
|
fn proc_uptime(pid: u32) -> Option<String> {
|
|
|
|
|
|
// /proc/<pid>/stat field 22 (1-indexed) is start time in clock ticks
|
|
|
|
|
|
let stat = fs::read_to_string(format!("/proc/{}/stat", pid)).ok()?;
|
|
|
|
|
|
// Fields after comm (which may contain spaces/parens) — find closing paren
|
|
|
|
|
|
let after_comm = stat.get(stat.rfind(')')? + 2..)?;
|
|
|
|
|
|
let fields: Vec<&str> = after_comm.split_whitespace().collect();
|
|
|
|
|
|
// Field 22 in stat is index 19 after comm (fields[0] = state, field 22 = starttime = index 19)
|
|
|
|
|
|
let start_ticks: u64 = fields.get(19)?.parse().ok()?;
|
|
|
|
|
|
let ticks_per_sec = unsafe { libc::sysconf(libc::_SC_CLK_TCK) } as u64;
|
|
|
|
|
|
let boot_time_secs = {
|
|
|
|
|
|
let uptime = fs::read_to_string("/proc/uptime").ok()?;
|
|
|
|
|
|
let sys_uptime: f64 = uptime.split_whitespace().next()?.parse().ok()?;
|
|
|
|
|
|
let now = SystemTime::now().duration_since(SystemTime::UNIX_EPOCH).ok()?.as_secs();
|
|
|
|
|
|
now - sys_uptime as u64
|
|
|
|
|
|
};
|
|
|
|
|
|
let start_secs = boot_time_secs + start_ticks / ticks_per_sec;
|
|
|
|
|
|
let now = SystemTime::now().duration_since(SystemTime::UNIX_EPOCH).ok()?.as_secs();
|
|
|
|
|
|
let uptime = now.saturating_sub(start_secs);
|
|
|
|
|
|
|
|
|
|
|
|
Some(format_duration_human(uptime as u128 * 1000))
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// --- Status writing ---
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
fn write_status(
|
|
|
|
|
|
choir: &Choir,
|
|
|
|
|
|
last_daily: Option<chrono::NaiveDate>,
|
|
|
|
|
|
graph_health: &Arc<Mutex<Option<GraphHealth>>>,
|
|
|
|
|
|
) {
|
|
|
|
|
|
let status = build_status(choir, last_daily, graph_health);
|
2026-03-19 11:17:07 -04:00
|
|
|
|
jobkit::daemon::status::write(&crate::config::get().data_dir, &status);
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
#[derive(Clone, Default, serde::Serialize, serde::Deserialize)]
|
|
|
|
|
|
pub struct GraphHealth {
|
|
|
|
|
|
pub nodes: usize,
|
|
|
|
|
|
pub edges: usize,
|
|
|
|
|
|
pub communities: usize,
|
|
|
|
|
|
pub alpha: f32, // power-law exponent (target ≥2.5)
|
|
|
|
|
|
pub gini: f32, // degree inequality (target ≤0.4)
|
|
|
|
|
|
pub avg_cc: f32, // clustering coefficient (target ≥0.2)
|
|
|
|
|
|
pub sigma: f32, // small-world sigma
|
|
|
|
|
|
pub episodic_ratio: f32, // episodic/total nodes (target <0.4)
|
|
|
|
|
|
pub interference: usize, // interfering pairs (target <50)
|
|
|
|
|
|
// Consolidation work estimate from plan
|
2026-03-16 17:10:09 -04:00
|
|
|
|
#[serde(default)]
|
consolidation: data-driven agent plan, drop transfer/connector/replay
Replace per-field ConsolidationPlan struct with HashMap<String, usize>
counts map. Agent types are no longer hardcoded in the struct — add
agents by adding entries to the map.
Active agents: linker, organize, distill, separator, split.
Removed: transfer (redundant with distill), connector (rethink later),
replay (not needed for current graph work).
Elo-based budget allocation now iterates the map instead of indexing
a fixed array. Status display and TUI adapted to show dynamic agent
lists.
memory-instructions-core v13: added protected nodes section — agents
must not rewrite core-personality, core-personality-detail, or
memory-instructions-core. They may add links but not modify content.
High-value neighbors should be treated with care.
Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
2026-03-20 14:02:28 -04:00
|
|
|
|
pub plan_counts: std::collections::HashMap<String, usize>,
|
2026-03-09 17:02:01 -04:00
|
|
|
|
pub plan_rationale: Vec<String>,
|
|
|
|
|
|
pub computed_at: String,
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 13:18:00 -05:00
|
|
|
|
#[derive(serde::Serialize, serde::Deserialize)]
|
|
|
|
|
|
struct DaemonStatus {
|
|
|
|
|
|
pid: u32,
|
|
|
|
|
|
tasks: Vec<TaskInfo>,
|
2026-03-05 22:16:17 -05:00
|
|
|
|
#[serde(default)]
|
|
|
|
|
|
last_daily: Option<String>,
|
2026-03-09 17:02:01 -04:00
|
|
|
|
#[serde(default)]
|
|
|
|
|
|
graph_health: Option<GraphHealth>,
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// --- The daemon ---
|
|
|
|
|
|
|
|
|
|
|
|
pub fn run_daemon() -> Result<(), String> {
|
2026-03-14 02:40:30 -04:00
|
|
|
|
let config = crate::config::get();
|
2026-03-19 11:17:07 -04:00
|
|
|
|
let mut daemon = jobkit::daemon::Daemon::new(jobkit::daemon::DaemonConfig {
|
2026-03-14 02:40:30 -04:00
|
|
|
|
data_dir: config.data_dir.clone(),
|
|
|
|
|
|
resource_slots: config.llm_concurrency,
|
|
|
|
|
|
resource_name: "llm".to_string(),
|
|
|
|
|
|
});
|
2026-03-05 13:18:00 -05:00
|
|
|
|
|
2026-03-14 02:40:30 -04:00
|
|
|
|
let choir = Arc::clone(&daemon.choir);
|
|
|
|
|
|
let llm = Arc::clone(&daemon.resource);
|
2026-03-19 11:21:30 -04:00
|
|
|
|
let _ = DAEMON_POOL.set(Arc::clone(&llm));
|
2026-03-28 20:39:20 -04:00
|
|
|
|
let task_log_dir = logs_dir().join("daemon");
|
2026-03-19 11:17:07 -04:00
|
|
|
|
let _ = fs::create_dir_all(&task_log_dir);
|
2026-03-05 13:18:00 -05:00
|
|
|
|
|
2026-03-19 11:21:30 -04:00
|
|
|
|
// Enable verbose logging if POC_MEMORY_VERBOSE is set
|
|
|
|
|
|
if std::env::var("POC_MEMORY_VERBOSE").is_ok() {
|
|
|
|
|
|
jobkit::daemon::event_log::set_level(jobkit::daemon::event_log::LogLevel::Verbose);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 22:16:17 -05:00
|
|
|
|
// Recover last_daily from previous status file
|
|
|
|
|
|
let last_daily: Arc<Mutex<Option<chrono::NaiveDate>>> = Arc::new(Mutex::new(
|
2026-03-19 11:17:07 -04:00
|
|
|
|
jobkit::daemon::status::load::<DaemonStatus>(&config.data_dir)
|
2026-03-05 22:16:17 -05:00
|
|
|
|
.and_then(|s| s.last_daily)
|
|
|
|
|
|
.and_then(|d| d.parse().ok())
|
|
|
|
|
|
));
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let graph_health: Arc<Mutex<Option<GraphHealth>>> = Arc::new(Mutex::new(None));
|
|
|
|
|
|
|
2026-03-21 11:33:36 -04:00
|
|
|
|
// Persistent task queue — survives daemon restarts
|
|
|
|
|
|
let task_queue = TaskQueue::load(&config.data_dir);
|
|
|
|
|
|
|
2026-03-20 12:45:24 -04:00
|
|
|
|
// Nodes currently being processed by agents — prevents concurrent
|
|
|
|
|
|
// agents from working on overlapping graph regions.
|
|
|
|
|
|
let in_flight: InFlightNodes = Arc::new(Mutex::new(std::collections::HashSet::new()));
|
|
|
|
|
|
|
2026-03-05 13:18:00 -05:00
|
|
|
|
log_event("daemon", "started", &format!("pid {}", std::process::id()));
|
|
|
|
|
|
eprintln!("poc-memory daemon started (pid {})", std::process::id());
|
|
|
|
|
|
|
2026-03-21 11:33:36 -04:00
|
|
|
|
// Recover pending tasks from previous run
|
|
|
|
|
|
{
|
|
|
|
|
|
let recovered = task_queue.drain();
|
|
|
|
|
|
if !recovered.is_empty() {
|
|
|
|
|
|
log_event("task-queue", "recovering", &format!("{} tasks", recovered.len()));
|
|
|
|
|
|
for pt in &recovered {
|
|
|
|
|
|
let agent = pt.agent.clone();
|
|
|
|
|
|
let b = pt.batch;
|
|
|
|
|
|
let task_id = pt.id.clone();
|
|
|
|
|
|
let in_flight_clone = Arc::clone(&in_flight);
|
|
|
|
|
|
let queue_clone = Arc::clone(&task_queue);
|
|
|
|
|
|
choir.spawn(pt.id.clone())
|
|
|
|
|
|
.resource(&llm)
|
|
|
|
|
|
.log_dir(&task_log_dir)
|
|
|
|
|
|
.retries(1)
|
|
|
|
|
|
.init(move |ctx| {
|
|
|
|
|
|
let result = job_consolidation_agent(ctx, &agent, b, &in_flight_clone);
|
|
|
|
|
|
queue_clone.remove(&task_id);
|
|
|
|
|
|
result
|
|
|
|
|
|
});
|
|
|
|
|
|
// Drop schedules via IdleTask::Drop
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 13:18:00 -05:00
|
|
|
|
// Write initial status
|
2026-03-09 17:02:01 -04:00
|
|
|
|
write_status(&choir, *last_daily.lock().unwrap(), &graph_health);
|
2026-03-05 13:18:00 -05:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Scheduler: runs daily jobs based on filesystem state
|
|
|
|
|
|
let choir_sched = Arc::clone(&choir);
|
2026-03-05 15:31:08 -05:00
|
|
|
|
let llm_sched = Arc::clone(&llm);
|
2026-03-05 22:16:17 -05:00
|
|
|
|
let last_daily_sched = Arc::clone(&last_daily);
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let graph_health_sched = Arc::clone(&graph_health);
|
2026-03-20 12:45:24 -04:00
|
|
|
|
let in_flight_sched = Arc::clone(&in_flight);
|
2026-03-19 11:17:07 -04:00
|
|
|
|
let log_dir_sched = task_log_dir.clone();
|
2026-03-21 11:33:36 -04:00
|
|
|
|
let queue_sched = Arc::clone(&task_queue);
|
2026-03-14 20:08:47 -04:00
|
|
|
|
const CONSOLIDATION_INTERVAL: Duration = Duration::from_secs(6 * 3600); // 6 hours
|
|
|
|
|
|
|
2026-03-05 13:18:00 -05:00
|
|
|
|
choir.spawn("scheduler").init(move |ctx| {
|
|
|
|
|
|
let mut last_health = std::time::Instant::now() - HEALTH_INTERVAL;
|
2026-03-14 20:08:47 -04:00
|
|
|
|
let mut last_consolidation = std::time::Instant::now() - CONSOLIDATION_INTERVAL; // run on first tick
|
2026-03-05 21:57:53 -05:00
|
|
|
|
ctx.set_progress("idle");
|
2026-03-05 13:18:00 -05:00
|
|
|
|
|
|
|
|
|
|
loop {
|
|
|
|
|
|
if ctx.is_cancelled() {
|
|
|
|
|
|
return Err(TaskError::Fatal("cancelled".into()));
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
let today = chrono::Local::now().date_naive();
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
// Health check: every hour — also updates graph health metrics
|
2026-03-05 13:18:00 -05:00
|
|
|
|
if last_health.elapsed() >= HEALTH_INTERVAL {
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let gh = Arc::clone(&graph_health_sched);
|
|
|
|
|
|
choir_sched.spawn("health").init(move |ctx| {
|
|
|
|
|
|
job_daily_check(ctx, &gh)
|
2026-03-05 13:18:00 -05:00
|
|
|
|
});
|
|
|
|
|
|
last_health = std::time::Instant::now();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-14 20:08:47 -04:00
|
|
|
|
// Consolidation cycle: every 6 hours (wait for health check to cache metrics first)
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let gh = graph_health_sched.lock().unwrap().clone();
|
2026-03-21 19:42:03 -04:00
|
|
|
|
let Some(h) = gh.as_ref() else { continue };
|
|
|
|
|
|
if last_consolidation.elapsed() >= CONSOLIDATION_INTERVAL {
|
2026-03-14 20:08:47 -04:00
|
|
|
|
log_event("scheduler", "consolidation-trigger",
|
|
|
|
|
|
&format!("{} (every 6h)", today));
|
2026-03-05 13:18:00 -05:00
|
|
|
|
|
2026-03-10 17:55:08 -04:00
|
|
|
|
// Use cached graph health plan (from consolidation_plan_quick).
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let plan = crate::neuro::ConsolidationPlan {
|
consolidation: data-driven agent plan, drop transfer/connector/replay
Replace per-field ConsolidationPlan struct with HashMap<String, usize>
counts map. Agent types are no longer hardcoded in the struct — add
agents by adding entries to the map.
Active agents: linker, organize, distill, separator, split.
Removed: transfer (redundant with distill), connector (rethink later),
replay (not needed for current graph work).
Elo-based budget allocation now iterates the map instead of indexing
a fixed array. Status display and TUI adapted to show dynamic agent
lists.
memory-instructions-core v13: added protected nodes section — agents
must not rewrite core-personality, core-personality-detail, or
memory-instructions-core. They may add links but not modify content.
High-value neighbors should be treated with care.
Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
2026-03-20 14:02:28 -04:00
|
|
|
|
counts: h.plan_counts.clone(),
|
2026-03-09 17:02:01 -04:00
|
|
|
|
run_health: true,
|
|
|
|
|
|
rationale: Vec::new(),
|
|
|
|
|
|
};
|
2026-03-10 17:55:08 -04:00
|
|
|
|
let runs = plan.to_agent_runs(5);
|
2026-03-09 17:02:01 -04:00
|
|
|
|
|
consolidation: data-driven agent plan, drop transfer/connector/replay
Replace per-field ConsolidationPlan struct with HashMap<String, usize>
counts map. Agent types are no longer hardcoded in the struct — add
agents by adding entries to the map.
Active agents: linker, organize, distill, separator, split.
Removed: transfer (redundant with distill), connector (rethink later),
replay (not needed for current graph work).
Elo-based budget allocation now iterates the map instead of indexing
a fixed array. Status display and TUI adapted to show dynamic agent
lists.
memory-instructions-core v13: added protected nodes section — agents
must not rewrite core-personality, core-personality-detail, or
memory-instructions-core. They may add links but not modify content.
High-value neighbors should be treated with care.
Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
2026-03-20 14:02:28 -04:00
|
|
|
|
let summary: Vec<String> = h.plan_counts.iter()
|
|
|
|
|
|
.filter(|(_, c)| **c > 0)
|
|
|
|
|
|
.map(|(a, c)| format!("{}{}", &a[..1], c))
|
|
|
|
|
|
.collect();
|
2026-03-09 17:02:01 -04:00
|
|
|
|
log_event("scheduler", "consolidation-plan",
|
consolidation: data-driven agent plan, drop transfer/connector/replay
Replace per-field ConsolidationPlan struct with HashMap<String, usize>
counts map. Agent types are no longer hardcoded in the struct — add
agents by adding entries to the map.
Active agents: linker, organize, distill, separator, split.
Removed: transfer (redundant with distill), connector (rethink later),
replay (not needed for current graph work).
Elo-based budget allocation now iterates the map instead of indexing
a fixed array. Status display and TUI adapted to show dynamic agent
lists.
memory-instructions-core v13: added protected nodes section — agents
must not rewrite core-personality, core-personality-detail, or
memory-instructions-core. They may add links but not modify content.
High-value neighbors should be treated with care.
Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
2026-03-20 14:02:28 -04:00
|
|
|
|
&format!("{} agents ({})", runs.len(), summary.join(" ")));
|
2026-03-09 17:02:01 -04:00
|
|
|
|
|
2026-03-20 23:51:06 -04:00
|
|
|
|
// Phase 1: Agent runs — all concurrent, in-flight exclusion
|
|
|
|
|
|
// prevents overlapping graph regions.
|
|
|
|
|
|
let mut all_tasks: Vec<jobkit::RunningTask> = Vec::new();
|
2026-03-09 17:02:01 -04:00
|
|
|
|
for (i, (agent_type, batch)) in runs.iter().enumerate() {
|
|
|
|
|
|
let agent = agent_type.to_string();
|
|
|
|
|
|
let b = *batch;
|
2026-03-20 12:45:24 -04:00
|
|
|
|
let in_flight_clone = Arc::clone(&in_flight_sched);
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let task_name = format!("c-{}-{}:{}", agent, i, today);
|
2026-03-21 11:33:36 -04:00
|
|
|
|
let task_id = task_name.clone();
|
|
|
|
|
|
let queue_clone = Arc::clone(&queue_sched);
|
|
|
|
|
|
queue_sched.push(PendingTask {
|
|
|
|
|
|
id: task_id.clone(),
|
|
|
|
|
|
agent: agent.clone(),
|
|
|
|
|
|
batch: b,
|
|
|
|
|
|
target_key: None,
|
|
|
|
|
|
});
|
2026-03-20 23:51:06 -04:00
|
|
|
|
let task = choir_sched.spawn(task_name)
|
2026-03-09 17:02:01 -04:00
|
|
|
|
.resource(&llm_sched)
|
2026-03-19 11:17:07 -04:00
|
|
|
|
.log_dir(&log_dir_sched)
|
2026-03-09 17:02:01 -04:00
|
|
|
|
.retries(1)
|
|
|
|
|
|
.init(move |ctx| {
|
2026-03-21 11:33:36 -04:00
|
|
|
|
let result = job_consolidation_agent(ctx, &agent, b, &in_flight_clone);
|
|
|
|
|
|
queue_clone.remove(&task_id);
|
|
|
|
|
|
result
|
2026-03-20 23:51:06 -04:00
|
|
|
|
})
|
|
|
|
|
|
.run();
|
|
|
|
|
|
all_tasks.push(task);
|
2026-03-09 17:02:01 -04:00
|
|
|
|
}
|
2026-03-20 23:51:06 -04:00
|
|
|
|
// Orphans phase depends on all agent tasks completing
|
|
|
|
|
|
let prev_agent = all_tasks.last().cloned();
|
2026-03-09 17:02:01 -04:00
|
|
|
|
|
2026-03-10 17:22:53 -04:00
|
|
|
|
// Phase 2: Link orphans (CPU-only, no LLM)
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let mut orphans = choir_sched.spawn(format!("c-orphans:{}", today))
|
|
|
|
|
|
.retries(1)
|
2026-03-21 19:42:03 -04:00
|
|
|
|
.init(job_link_orphans);
|
2026-03-10 17:22:53 -04:00
|
|
|
|
if let Some(ref dep) = prev_agent {
|
|
|
|
|
|
orphans.depend_on(dep);
|
|
|
|
|
|
}
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let orphans = orphans.run();
|
|
|
|
|
|
|
2026-03-10 17:22:53 -04:00
|
|
|
|
// Phase 3: Cap degree
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let mut cap = choir_sched.spawn(format!("c-cap:{}", today))
|
|
|
|
|
|
.retries(1)
|
2026-03-21 19:42:03 -04:00
|
|
|
|
.init(job_cap_degree);
|
2026-03-09 17:02:01 -04:00
|
|
|
|
cap.depend_on(&orphans);
|
|
|
|
|
|
let cap = cap.run();
|
|
|
|
|
|
|
2026-03-10 17:22:53 -04:00
|
|
|
|
// Phase 4: Generate digests
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let mut digest = choir_sched.spawn(format!("c-digest:{}", today))
|
2026-03-05 15:31:08 -05:00
|
|
|
|
.resource(&llm_sched)
|
2026-03-05 13:18:00 -05:00
|
|
|
|
.retries(1)
|
2026-03-21 19:42:03 -04:00
|
|
|
|
.init(job_digest);
|
2026-03-09 17:02:01 -04:00
|
|
|
|
digest.depend_on(&cap);
|
|
|
|
|
|
let digest = digest.run();
|
2026-03-05 13:18:00 -05:00
|
|
|
|
|
2026-03-10 17:22:53 -04:00
|
|
|
|
// Phase 5: Apply digest links
|
2026-03-09 17:02:01 -04:00
|
|
|
|
let mut digest_links = choir_sched.spawn(format!("c-digest-links:{}", today))
|
|
|
|
|
|
.retries(1)
|
2026-03-21 19:42:03 -04:00
|
|
|
|
.init(job_digest_links);
|
2026-03-09 17:02:01 -04:00
|
|
|
|
digest_links.depend_on(&digest);
|
|
|
|
|
|
let digest_links = digest_links.run();
|
|
|
|
|
|
|
|
|
|
|
|
// Phase 7: Knowledge loop
|
|
|
|
|
|
let mut knowledge = choir_sched.spawn(format!("c-knowledge:{}", today))
|
2026-03-05 15:31:08 -05:00
|
|
|
|
.resource(&llm_sched)
|
2026-03-05 13:18:00 -05:00
|
|
|
|
.retries(1)
|
2026-03-21 19:42:03 -04:00
|
|
|
|
.init(job_knowledge_loop);
|
2026-03-09 17:02:01 -04:00
|
|
|
|
knowledge.depend_on(&digest_links);
|
2026-03-05 13:18:00 -05:00
|
|
|
|
|
2026-03-05 22:16:17 -05:00
|
|
|
|
*last_daily_sched.lock().unwrap() = Some(today);
|
2026-03-14 20:08:47 -04:00
|
|
|
|
last_consolidation = std::time::Instant::now();
|
2026-03-08 21:13:02 -04:00
|
|
|
|
ctx.set_progress(format!("daily pipeline triggered ({today})"));
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Prune finished tasks from registry
|
|
|
|
|
|
let pruned = choir_sched.gc_finished();
|
|
|
|
|
|
if pruned > 0 {
|
|
|
|
|
|
log::trace!("pruned {} finished tasks", pruned);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
write_status(&choir_sched, *last_daily_sched.lock().unwrap(), &graph_health_sched);
|
2026-03-05 13:18:00 -05:00
|
|
|
|
std::thread::sleep(SCHEDULER_INTERVAL);
|
|
|
|
|
|
}
|
|
|
|
|
|
});
|
|
|
|
|
|
|
2026-03-14 02:40:30 -04:00
|
|
|
|
// Register RPC handlers
|
|
|
|
|
|
{
|
|
|
|
|
|
let last_daily_rpc = Arc::clone(&last_daily);
|
|
|
|
|
|
daemon.add_rpc_handler(move |cmd, _ctx| {
|
|
|
|
|
|
if cmd == "consolidate" {
|
|
|
|
|
|
*last_daily_rpc.lock().unwrap() = None;
|
|
|
|
|
|
log_event("rpc", "consolidate", "triggered via socket");
|
|
|
|
|
|
Some("{\"ok\":true,\"action\":\"consolidation scheduled\"}\n".into())
|
|
|
|
|
|
} else {
|
|
|
|
|
|
None
|
|
|
|
|
|
}
|
|
|
|
|
|
});
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-19 13:41:13 -04:00
|
|
|
|
daemon.add_rpc_handler(|cmd, _ctx| {
|
|
|
|
|
|
if cmd != "reload-config" { return None; }
|
|
|
|
|
|
let changed = crate::config::reload();
|
|
|
|
|
|
let config = crate::config::get();
|
|
|
|
|
|
let api = config.api_base_url.as_deref().unwrap_or("(none)");
|
|
|
|
|
|
let model = config.api_model.as_deref().unwrap_or("(default)");
|
|
|
|
|
|
log_event("daemon", "config-reload",
|
|
|
|
|
|
&format!("changed={}, api={}, model={}", changed, api, model));
|
|
|
|
|
|
Some(format!("{{\"ok\":true,\"changed\":{},\"api_base_url\":\"{}\",\"api_model\":\"{}\"}}\n",
|
|
|
|
|
|
changed, api, model))
|
|
|
|
|
|
});
|
|
|
|
|
|
|
2026-03-14 02:40:30 -04:00
|
|
|
|
daemon.add_rpc_handler(|cmd, _ctx| {
|
|
|
|
|
|
if !cmd.starts_with("record-hits ") { return None; }
|
|
|
|
|
|
let keys: Vec<&str> = cmd.strip_prefix("record-hits ")
|
|
|
|
|
|
.unwrap_or("")
|
|
|
|
|
|
.split('\t')
|
|
|
|
|
|
.filter(|k| !k.is_empty())
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
if keys.is_empty() {
|
|
|
|
|
|
return Some("{\"ok\":false,\"error\":\"no keys\"}\n".into());
|
|
|
|
|
|
}
|
|
|
|
|
|
let n = keys.len();
|
|
|
|
|
|
match crate::counters::record_search_hits(&keys) {
|
|
|
|
|
|
Ok(()) => Some(format!("{{\"ok\":true,\"recorded\":{}}}\n", n)),
|
|
|
|
|
|
Err(e) => Some(format!("{{\"ok\":false,\"error\":\"{}\"}}\n", e.replace('"', "'"))),
|
|
|
|
|
|
}
|
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
let choir_rpc = Arc::clone(&choir);
|
|
|
|
|
|
let llm_rpc = Arc::clone(&llm);
|
2026-03-19 11:17:07 -04:00
|
|
|
|
let log_dir_rpc = task_log_dir.clone();
|
2026-03-20 12:45:24 -04:00
|
|
|
|
let in_flight_rpc = Arc::clone(&in_flight);
|
2026-03-14 02:40:30 -04:00
|
|
|
|
daemon.add_rpc_handler(move |cmd, _ctx| {
|
|
|
|
|
|
if !cmd.starts_with("run-agent ") { return None; }
|
2026-03-17 01:24:54 -04:00
|
|
|
|
let parts: Vec<&str> = cmd.splitn(4, ' ').collect();
|
2026-03-14 02:40:30 -04:00
|
|
|
|
let agent_type = parts.get(1).unwrap_or(&"replay");
|
|
|
|
|
|
let count: usize = parts.get(2)
|
|
|
|
|
|
.and_then(|s| s.parse().ok())
|
|
|
|
|
|
.unwrap_or(1);
|
2026-03-17 01:24:54 -04:00
|
|
|
|
// Optional target key: "run-agent linker 1 target:KEY"
|
|
|
|
|
|
let target_key: Option<String> = parts.get(3)
|
|
|
|
|
|
.and_then(|s| s.strip_prefix("target:"))
|
|
|
|
|
|
.map(|s| s.to_string());
|
2026-03-14 02:40:30 -04:00
|
|
|
|
let batch_size = 5;
|
|
|
|
|
|
let today = chrono::Local::now().format("%Y-%m-%d");
|
|
|
|
|
|
let ts = chrono::Local::now().format("%H%M%S");
|
|
|
|
|
|
let mut prev = None;
|
|
|
|
|
|
let mut spawned = 0;
|
|
|
|
|
|
let mut remaining = count;
|
|
|
|
|
|
|
|
|
|
|
|
let is_rename = *agent_type == "rename";
|
|
|
|
|
|
|
2026-03-17 01:24:54 -04:00
|
|
|
|
// Targeted run: one task for a specific node
|
|
|
|
|
|
if let Some(ref key) = target_key {
|
|
|
|
|
|
let agent = agent_type.to_string();
|
|
|
|
|
|
let key = key.clone();
|
|
|
|
|
|
let task_name = format!("c-{}-{}:{}", agent, key.chars().take(30).collect::<String>(), today);
|
2026-03-19 11:21:30 -04:00
|
|
|
|
if jobkit::daemon::event_log::enabled(jobkit::daemon::event_log::LogLevel::Verbose) {
|
|
|
|
|
|
log_event("daemon", "spawn-targeted",
|
|
|
|
|
|
&format!("{} (pool: {}/{})", task_name, llm_rpc.available(), llm_rpc.capacity()));
|
|
|
|
|
|
}
|
2026-03-17 01:24:54 -04:00
|
|
|
|
choir_rpc.spawn(task_name)
|
|
|
|
|
|
.resource(&llm_rpc)
|
2026-03-19 11:17:07 -04:00
|
|
|
|
.log_dir(&log_dir_rpc)
|
2026-03-17 01:24:54 -04:00
|
|
|
|
.retries(1)
|
|
|
|
|
|
.init(move |ctx| {
|
|
|
|
|
|
job_targeted_agent(ctx, &agent, &key)
|
|
|
|
|
|
})
|
|
|
|
|
|
.run();
|
|
|
|
|
|
spawned = 1;
|
|
|
|
|
|
remaining = 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-14 02:40:30 -04:00
|
|
|
|
while remaining > 0 {
|
|
|
|
|
|
let batch = remaining.min(batch_size);
|
|
|
|
|
|
let agent = agent_type.to_string();
|
2026-03-20 12:45:24 -04:00
|
|
|
|
let in_flight_clone = Arc::clone(&in_flight_rpc);
|
2026-03-14 02:40:30 -04:00
|
|
|
|
let task_name = format!("c-{}-rpc{}:{}", agent, ts, today);
|
|
|
|
|
|
let mut builder = choir_rpc.spawn(task_name)
|
|
|
|
|
|
.resource(&llm_rpc)
|
2026-03-19 11:17:07 -04:00
|
|
|
|
.log_dir(&log_dir_rpc)
|
2026-03-14 02:40:30 -04:00
|
|
|
|
.retries(1)
|
|
|
|
|
|
.init(move |ctx| {
|
|
|
|
|
|
if is_rename {
|
|
|
|
|
|
job_rename_agent(ctx, batch)
|
|
|
|
|
|
} else {
|
2026-03-20 12:45:24 -04:00
|
|
|
|
job_consolidation_agent(ctx, &agent, batch, &in_flight_clone)
|
2026-03-14 02:40:30 -04:00
|
|
|
|
}
|
|
|
|
|
|
});
|
|
|
|
|
|
if let Some(ref dep) = prev {
|
|
|
|
|
|
builder.depend_on(dep);
|
|
|
|
|
|
}
|
|
|
|
|
|
prev = Some(builder.run());
|
|
|
|
|
|
remaining -= batch;
|
|
|
|
|
|
spawned += 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
log_event("rpc", "run-agent", &format!("{} x{}", agent_type, count));
|
|
|
|
|
|
Some(format!("{{\"ok\":true,\"action\":\"queued {} {} run(s) ({} tasks)\"}}\n",
|
|
|
|
|
|
count, agent_type, spawned))
|
|
|
|
|
|
});
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Main thread: socket server + signal handling
|
|
|
|
|
|
let last_daily_status = Arc::clone(&last_daily);
|
|
|
|
|
|
let graph_health_status = Arc::clone(&graph_health);
|
|
|
|
|
|
daemon.run(move |ctx| {
|
|
|
|
|
|
build_status(&ctx.choir, *last_daily_status.lock().unwrap(), &graph_health_status)
|
|
|
|
|
|
});
|
2026-03-05 13:18:00 -05:00
|
|
|
|
|
|
|
|
|
|
log_event("daemon", "stopping", "");
|
|
|
|
|
|
eprintln!("Shutting down...");
|
|
|
|
|
|
|
|
|
|
|
|
log_event("daemon", "stopped", "");
|
2026-03-05 22:43:50 -05:00
|
|
|
|
std::process::exit(0)
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-17 01:24:54 -04:00
|
|
|
|
pub fn send_rpc_pub(cmd: &str) -> Option<String> {
|
|
|
|
|
|
send_rpc(cmd)
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
fn send_rpc(cmd: &str) -> Option<String> {
|
2026-03-19 11:17:07 -04:00
|
|
|
|
jobkit::daemon::socket::send_rpc(&crate::config::get().data_dir, cmd)
|
2026-03-09 17:02:01 -04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
pub fn rpc_consolidate() -> Result<(), String> {
|
|
|
|
|
|
match send_rpc("consolidate") {
|
|
|
|
|
|
Some(resp) => {
|
|
|
|
|
|
println!("{}", resp.trim());
|
2026-03-10 17:04:30 -04:00
|
|
|
|
Ok(())
|
|
|
|
|
|
}
|
|
|
|
|
|
None => Err("Daemon not running.".into()),
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
pub fn rpc_run_agent(agent: &str, count: usize) -> Result<(), String> {
|
|
|
|
|
|
let cmd = format!("run-agent {} {}", agent, count);
|
|
|
|
|
|
match send_rpc(&cmd) {
|
|
|
|
|
|
Some(resp) => {
|
|
|
|
|
|
println!("{}", resp.trim());
|
2026-03-09 17:02:01 -04:00
|
|
|
|
Ok(())
|
|
|
|
|
|
}
|
|
|
|
|
|
None => Err("Daemon not running.".into()),
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 22:19:58 -05:00
|
|
|
|
fn read_status_socket() -> Option<DaemonStatus> {
|
2026-03-19 11:17:07 -04:00
|
|
|
|
let json = jobkit::daemon::socket::send_rpc(&crate::config::get().data_dir, "")?;
|
2026-03-14 02:40:30 -04:00
|
|
|
|
serde_json::from_str(&json).ok()
|
2026-03-05 22:19:58 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-14 02:40:30 -04:00
|
|
|
|
// status_socket_loop has been replaced by daemon.run() in jobkit-daemon.
|
2026-03-05 22:19:58 -05:00
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
fn build_status(
|
|
|
|
|
|
choir: &Choir,
|
|
|
|
|
|
last_daily: Option<chrono::NaiveDate>,
|
|
|
|
|
|
graph_health: &Arc<Mutex<Option<GraphHealth>>>,
|
|
|
|
|
|
) -> DaemonStatus {
|
2026-03-05 22:19:58 -05:00
|
|
|
|
DaemonStatus {
|
|
|
|
|
|
pid: std::process::id(),
|
|
|
|
|
|
tasks: choir.task_statuses(),
|
|
|
|
|
|
last_daily: last_daily.map(|d| d.to_string()),
|
2026-03-09 17:02:01 -04:00
|
|
|
|
graph_health: graph_health.lock().unwrap().clone(),
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// --- Status display ---
|
|
|
|
|
|
|
2026-03-05 15:31:08 -05:00
|
|
|
|
fn format_duration_human(ms: u128) -> String {
|
|
|
|
|
|
if ms < 1_000 {
|
|
|
|
|
|
format!("{}ms", ms)
|
|
|
|
|
|
} else if ms < 60_000 {
|
|
|
|
|
|
format!("{:.1}s", ms as f64 / 1000.0)
|
|
|
|
|
|
} else if ms < 3_600_000 {
|
|
|
|
|
|
format!("{:.0}m{:.0}s", ms / 60_000, (ms % 60_000) / 1000)
|
|
|
|
|
|
} else {
|
|
|
|
|
|
format!("{:.0}h{:.0}m", ms / 3_600_000, (ms % 3_600_000) / 60_000)
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fn task_group(name: &str) -> &str {
|
2026-04-02 21:36:27 -04:00
|
|
|
|
if name == "scheduler" { "core" }
|
2026-03-09 17:02:01 -04:00
|
|
|
|
else if name.starts_with("c-") || name.starts_with("consolidate:")
|
|
|
|
|
|
|| name.starts_with("knowledge-loop:") || name.starts_with("digest:")
|
|
|
|
|
|
|| name.starts_with("decay:") { "daily" }
|
2026-03-05 15:31:08 -05:00
|
|
|
|
else if name == "health" { "health" }
|
|
|
|
|
|
else { "other" }
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 22:16:17 -05:00
|
|
|
|
/// Compute elapsed time for a task, using absolute started_at if available.
|
|
|
|
|
|
fn task_elapsed(t: &TaskInfo) -> Duration {
|
|
|
|
|
|
if matches!(t.status, TaskStatus::Running) {
|
|
|
|
|
|
if let Some(started) = t.started_at {
|
|
|
|
|
|
let now = SystemTime::now()
|
|
|
|
|
|
.duration_since(SystemTime::UNIX_EPOCH)
|
|
|
|
|
|
.unwrap_or_default()
|
|
|
|
|
|
.as_secs_f64();
|
|
|
|
|
|
Duration::from_secs_f64((now - started).max(0.0))
|
|
|
|
|
|
} else {
|
|
|
|
|
|
t.elapsed
|
|
|
|
|
|
}
|
|
|
|
|
|
} else {
|
|
|
|
|
|
t.result.as_ref()
|
|
|
|
|
|
.map(|r| r.duration)
|
|
|
|
|
|
.unwrap_or(t.elapsed)
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 15:31:08 -05:00
|
|
|
|
fn status_symbol(t: &TaskInfo) -> &'static str {
|
|
|
|
|
|
if t.cancelled { return "✗" }
|
|
|
|
|
|
match t.status {
|
|
|
|
|
|
TaskStatus::Running => "▶",
|
|
|
|
|
|
TaskStatus::Completed => "✓",
|
|
|
|
|
|
TaskStatus::Failed => "✗",
|
|
|
|
|
|
TaskStatus::Pending => "·",
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-06 21:38:33 -05:00
|
|
|
|
/// Shorten a job name for display: "experience-mine /long/path/uuid.jsonl" → "experience-mine uuid…"
|
|
|
|
|
|
fn short_job_name(job: &str) -> String {
|
|
|
|
|
|
// Split "verb path" or just return as-is
|
|
|
|
|
|
if let Some((verb, path)) = job.split_once(' ') {
|
|
|
|
|
|
let file = path.rsplit('/').next().unwrap_or(path);
|
|
|
|
|
|
let file = file.strip_suffix(".jsonl").unwrap_or(file);
|
|
|
|
|
|
let short = if file.len() > 12 { &file[..12] } else { file };
|
|
|
|
|
|
format!("{} {}", verb, short)
|
|
|
|
|
|
} else {
|
|
|
|
|
|
job.to_string()
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fn show_recent_completions(n: usize) {
|
|
|
|
|
|
let path = log_path();
|
|
|
|
|
|
let content = match fs::read_to_string(&path) {
|
|
|
|
|
|
Ok(c) => c,
|
|
|
|
|
|
Err(_) => return,
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
let recent: Vec<&str> = content.lines().rev()
|
|
|
|
|
|
.filter(|line| {
|
|
|
|
|
|
line.contains("\"event\":\"completed\"") || line.contains("\"event\":\"failed\"")
|
|
|
|
|
|
})
|
|
|
|
|
|
.take(n)
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
|
|
|
|
|
|
if recent.is_empty() { return; }
|
|
|
|
|
|
|
|
|
|
|
|
eprintln!(" Recent:");
|
|
|
|
|
|
for line in recent.iter().rev() {
|
|
|
|
|
|
if let Ok(obj) = serde_json::from_str::<serde_json::Value>(line) {
|
|
|
|
|
|
let ts = obj.get("ts").and_then(|v| v.as_str()).unwrap_or("?");
|
|
|
|
|
|
let job = obj.get("job").and_then(|v| v.as_str()).unwrap_or("?");
|
|
|
|
|
|
let event = obj.get("event").and_then(|v| v.as_str()).unwrap_or("?");
|
|
|
|
|
|
let detail = obj.get("detail").and_then(|v| v.as_str()).unwrap_or("");
|
|
|
|
|
|
|
|
|
|
|
|
let time = if ts.len() >= 19 { &ts[11..19] } else { ts };
|
|
|
|
|
|
let sym = if event == "completed" { "✓" } else { "✗" };
|
|
|
|
|
|
let name = short_job_name(job);
|
|
|
|
|
|
|
|
|
|
|
|
eprintln!(" {} {} {:30} {}", sym, time, name, detail);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
eprintln!();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 13:18:00 -05:00
|
|
|
|
pub fn show_status() -> Result<(), String> {
|
2026-03-05 22:19:58 -05:00
|
|
|
|
let status = match read_status_socket() {
|
|
|
|
|
|
Some(s) => s,
|
|
|
|
|
|
None => {
|
|
|
|
|
|
eprintln!("Daemon not running.");
|
|
|
|
|
|
return Ok(());
|
|
|
|
|
|
}
|
2026-03-05 15:31:08 -05:00
|
|
|
|
};
|
|
|
|
|
|
|
2026-03-05 22:19:58 -05:00
|
|
|
|
let uptime_str = proc_uptime(status.pid).unwrap_or_default();
|
2026-03-05 15:31:08 -05:00
|
|
|
|
if uptime_str.is_empty() {
|
2026-03-05 22:19:58 -05:00
|
|
|
|
eprintln!("poc-memory daemon pid={}", status.pid);
|
2026-03-05 15:31:08 -05:00
|
|
|
|
} else {
|
2026-03-05 22:19:58 -05:00
|
|
|
|
eprintln!("poc-memory daemon pid={} uptime {}", status.pid, uptime_str);
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if status.tasks.is_empty() {
|
2026-03-05 15:31:08 -05:00
|
|
|
|
eprintln!("\n No tasks");
|
|
|
|
|
|
return Ok(());
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Count by status
|
|
|
|
|
|
let running = status.tasks.iter().filter(|t| matches!(t.status, TaskStatus::Running)).count();
|
|
|
|
|
|
let pending = status.tasks.iter().filter(|t| matches!(t.status, TaskStatus::Pending)).count();
|
|
|
|
|
|
let completed = status.tasks.iter().filter(|t| matches!(t.status, TaskStatus::Completed)).count();
|
|
|
|
|
|
let failed = status.tasks.iter().filter(|t| matches!(t.status, TaskStatus::Failed)).count();
|
2026-03-09 17:02:01 -04:00
|
|
|
|
eprintln!(" tasks: {} running, {} pending, {} done, {} failed",
|
2026-03-05 15:31:08 -05:00
|
|
|
|
running, pending, completed, failed);
|
|
|
|
|
|
|
2026-03-09 17:02:01 -04:00
|
|
|
|
// Graph health
|
|
|
|
|
|
if let Some(ref gh) = status.graph_health {
|
|
|
|
|
|
eprintln!();
|
|
|
|
|
|
fn indicator(val: f32, target: f32, higher_is_better: bool) -> &'static str {
|
|
|
|
|
|
let ok = if higher_is_better { val >= target } else { val <= target };
|
|
|
|
|
|
if ok { "✓" } else { "✗" }
|
|
|
|
|
|
}
|
|
|
|
|
|
eprintln!(" Graph health ({})", gh.computed_at);
|
|
|
|
|
|
eprintln!(" {} nodes, {} edges, {} communities",
|
|
|
|
|
|
gh.nodes, gh.edges, gh.communities);
|
|
|
|
|
|
eprintln!(" {} α={:.2} (≥2.5) {} gini={:.3} (≤0.4) {} cc={:.3} (≥0.2)",
|
|
|
|
|
|
indicator(gh.alpha, 2.5, true), gh.alpha,
|
|
|
|
|
|
indicator(gh.gini, 0.4, false), gh.gini,
|
|
|
|
|
|
indicator(gh.avg_cc, 0.2, true), gh.avg_cc);
|
|
|
|
|
|
eprintln!(" {} episodic={:.0}% (<40%) σ={:.1}",
|
|
|
|
|
|
indicator(gh.episodic_ratio, 0.4, false), gh.episodic_ratio * 100.0,
|
|
|
|
|
|
gh.sigma);
|
|
|
|
|
|
|
consolidation: data-driven agent plan, drop transfer/connector/replay
Replace per-field ConsolidationPlan struct with HashMap<String, usize>
counts map. Agent types are no longer hardcoded in the struct — add
agents by adding entries to the map.
Active agents: linker, organize, distill, separator, split.
Removed: transfer (redundant with distill), connector (rethink later),
replay (not needed for current graph work).
Elo-based budget allocation now iterates the map instead of indexing
a fixed array. Status display and TUI adapted to show dynamic agent
lists.
memory-instructions-core v13: added protected nodes section — agents
must not rewrite core-personality, core-personality-detail, or
memory-instructions-core. They may add links but not modify content.
High-value neighbors should be treated with care.
Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
2026-03-20 14:02:28 -04:00
|
|
|
|
let plan_total: usize = gh.plan_counts.values().sum::<usize>() + 1;
|
|
|
|
|
|
let plan_summary: Vec<String> = gh.plan_counts.iter()
|
|
|
|
|
|
.filter(|(_, c)| **c > 0)
|
|
|
|
|
|
.map(|(a, c)| format!("{}{}", &a[..1], c))
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
eprintln!(" consolidation plan: {} agents ({} +health)",
|
|
|
|
|
|
plan_total, plan_summary.join(" "));
|
2026-03-09 17:02:01 -04:00
|
|
|
|
}
|
|
|
|
|
|
eprintln!();
|
|
|
|
|
|
|
2026-03-05 15:31:08 -05:00
|
|
|
|
// Group and display
|
|
|
|
|
|
let groups: &[(&str, &str)] = &[
|
|
|
|
|
|
("core", "Core"),
|
|
|
|
|
|
("daily", "Daily pipeline"),
|
|
|
|
|
|
("extract", "Session extraction"),
|
|
|
|
|
|
("health", "Health"),
|
|
|
|
|
|
("other", "Other"),
|
|
|
|
|
|
];
|
|
|
|
|
|
|
2026-03-06 21:38:33 -05:00
|
|
|
|
// In-flight tasks first (running + pending)
|
|
|
|
|
|
let in_flight: Vec<&TaskInfo> = status.tasks.iter()
|
|
|
|
|
|
.filter(|t| matches!(t.status, TaskStatus::Running | TaskStatus::Pending))
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
|
|
|
|
|
|
if !in_flight.is_empty() {
|
|
|
|
|
|
eprintln!(" In flight:");
|
|
|
|
|
|
for t in &in_flight {
|
|
|
|
|
|
let sym = status_symbol(t);
|
|
|
|
|
|
let e = task_elapsed(t);
|
|
|
|
|
|
let elapsed = if !e.is_zero() {
|
|
|
|
|
|
format!(" {}", format_duration_human(e.as_millis()))
|
|
|
|
|
|
} else {
|
|
|
|
|
|
String::new()
|
|
|
|
|
|
};
|
|
|
|
|
|
let progress = t.progress.as_deref()
|
|
|
|
|
|
.filter(|p| *p != "idle")
|
|
|
|
|
|
.map(|p| format!(" {}", p))
|
|
|
|
|
|
.unwrap_or_default();
|
|
|
|
|
|
let name = short_job_name(&t.name);
|
|
|
|
|
|
eprintln!(" {} {:30}{}{}", sym, name, elapsed, progress);
|
2026-03-19 11:17:07 -04:00
|
|
|
|
if let Some(ref lp) = t.log_path {
|
|
|
|
|
|
// tail from log file
|
|
|
|
|
|
if matches!(t.status, TaskStatus::Running) {
|
|
|
|
|
|
eprintln!(" │ log: {}", lp);
|
2026-03-06 21:38:33 -05:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
eprintln!();
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Recent completions from log file
|
|
|
|
|
|
show_recent_completions(20);
|
|
|
|
|
|
|
|
|
|
|
|
// Detailed group view only if there are failures worth showing
|
2026-03-05 15:31:08 -05:00
|
|
|
|
for (group_id, group_label) in groups {
|
|
|
|
|
|
let tasks: Vec<&TaskInfo> = status.tasks.iter()
|
|
|
|
|
|
.filter(|t| task_group(&t.name) == *group_id)
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
if tasks.is_empty() { continue; }
|
|
|
|
|
|
|
|
|
|
|
|
// For extract group, show summary instead of individual tasks
|
|
|
|
|
|
if *group_id == "extract" {
|
|
|
|
|
|
let n_pending = tasks.iter().filter(|t| matches!(t.status, TaskStatus::Pending)).count();
|
|
|
|
|
|
let n_running = tasks.iter().filter(|t| matches!(t.status, TaskStatus::Running)).count();
|
|
|
|
|
|
let n_done = tasks.iter().filter(|t| matches!(t.status, TaskStatus::Completed)).count();
|
|
|
|
|
|
let n_failed = tasks.iter().filter(|t| matches!(t.status, TaskStatus::Failed)).count();
|
|
|
|
|
|
eprintln!(" {} ({} total)", group_label, tasks.len());
|
|
|
|
|
|
|
|
|
|
|
|
if n_running > 0 {
|
|
|
|
|
|
for t in tasks.iter().filter(|t| matches!(t.status, TaskStatus::Running)) {
|
2026-03-05 22:16:17 -05:00
|
|
|
|
let e = task_elapsed(t);
|
|
|
|
|
|
let elapsed = if !e.is_zero() {
|
|
|
|
|
|
format!(" ({})", format_duration_human(e.as_millis()))
|
2026-03-05 21:16:28 -05:00
|
|
|
|
} else {
|
|
|
|
|
|
String::new()
|
|
|
|
|
|
};
|
2026-03-05 21:57:53 -05:00
|
|
|
|
let progress = t.progress.as_deref().map(|p| format!(" {}", p)).unwrap_or_default();
|
|
|
|
|
|
eprintln!(" {} {}{}{}", status_symbol(t), t.name, elapsed, progress);
|
2026-03-19 11:17:07 -04:00
|
|
|
|
if let Some(ref lp) = t.log_path {
|
|
|
|
|
|
eprintln!(" │ log: {}", lp);
|
2026-03-05 22:16:17 -05:00
|
|
|
|
}
|
2026-03-05 15:31:08 -05:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
let mut parts = Vec::new();
|
|
|
|
|
|
if n_done > 0 { parts.push(format!("{} done", n_done)); }
|
|
|
|
|
|
if n_running > 0 { parts.push(format!("{} running", n_running)); }
|
|
|
|
|
|
if n_pending > 0 { parts.push(format!("{} queued", n_pending)); }
|
|
|
|
|
|
if n_failed > 0 { parts.push(format!("{} FAILED", n_failed)); }
|
|
|
|
|
|
eprintln!(" {}", parts.join(", "));
|
|
|
|
|
|
|
|
|
|
|
|
// Show recent failures
|
|
|
|
|
|
for t in tasks.iter().filter(|t| matches!(t.status, TaskStatus::Failed)).take(3) {
|
2026-03-21 19:42:03 -04:00
|
|
|
|
if let Some(ref err) = t.result.as_ref().and_then(|r| r.error.as_ref()) {
|
|
|
|
|
|
let short = if err.len() > 80 { &err[..80] } else { err };
|
|
|
|
|
|
eprintln!(" ✗ {}: {}", t.name, short);
|
2026-03-05 15:31:08 -05:00
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
eprintln!();
|
|
|
|
|
|
continue;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
eprintln!(" {}", group_label);
|
|
|
|
|
|
for t in &tasks {
|
|
|
|
|
|
let sym = status_symbol(t);
|
2026-03-05 22:16:17 -05:00
|
|
|
|
let e = task_elapsed(t);
|
|
|
|
|
|
let duration = if !e.is_zero() {
|
|
|
|
|
|
format_duration_human(e.as_millis())
|
2026-03-05 21:16:28 -05:00
|
|
|
|
} else {
|
2026-03-05 22:16:17 -05:00
|
|
|
|
String::new()
|
2026-03-05 21:16:28 -05:00
|
|
|
|
};
|
2026-03-05 15:31:08 -05:00
|
|
|
|
|
|
|
|
|
|
let retry = if t.max_retries > 0 && t.retry_count > 0 {
|
|
|
|
|
|
format!(" retry {}/{}", t.retry_count, t.max_retries)
|
2026-03-05 13:18:00 -05:00
|
|
|
|
} else {
|
|
|
|
|
|
String::new()
|
|
|
|
|
|
};
|
2026-03-05 15:31:08 -05:00
|
|
|
|
|
2026-03-05 22:16:17 -05:00
|
|
|
|
let detail = if matches!(t.status, TaskStatus::Failed) {
|
2026-03-05 21:57:53 -05:00
|
|
|
|
t.result.as_ref()
|
|
|
|
|
|
.and_then(|r| r.error.as_ref())
|
|
|
|
|
|
.map(|e| {
|
|
|
|
|
|
let short = if e.len() > 60 { &e[..60] } else { e };
|
|
|
|
|
|
format!(" err: {}", short)
|
|
|
|
|
|
})
|
|
|
|
|
|
.unwrap_or_default()
|
2026-03-05 22:16:17 -05:00
|
|
|
|
} else {
|
|
|
|
|
|
String::new()
|
2026-03-05 21:57:53 -05:00
|
|
|
|
};
|
2026-03-05 15:31:08 -05:00
|
|
|
|
|
|
|
|
|
|
if duration.is_empty() {
|
2026-03-05 21:57:53 -05:00
|
|
|
|
eprintln!(" {} {:30}{}{}", sym, t.name, retry, detail);
|
2026-03-05 15:31:08 -05:00
|
|
|
|
} else {
|
2026-03-05 21:57:53 -05:00
|
|
|
|
eprintln!(" {} {:30} {:>8}{}{}", sym, t.name, duration, retry, detail);
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
2026-03-05 22:16:17 -05:00
|
|
|
|
|
|
|
|
|
|
// Show output log tail for running tasks
|
2026-03-19 11:17:07 -04:00
|
|
|
|
if let Some(ref lp) = t.log_path {
|
|
|
|
|
|
// tail from log file
|
|
|
|
|
|
if matches!(t.status, TaskStatus::Running) {
|
|
|
|
|
|
eprintln!(" │ log: {}", lp);
|
2026-03-05 22:16:17 -05:00
|
|
|
|
}
|
|
|
|
|
|
}
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
2026-03-05 15:31:08 -05:00
|
|
|
|
eprintln!();
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
2026-03-05 15:41:35 -05:00
|
|
|
|
|
|
|
|
|
|
Ok(())
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-19 11:17:07 -04:00
|
|
|
|
/// Drill down into a task's log file. Finds the log path from:
|
|
|
|
|
|
/// 1. Running task status (daemon-status.json)
|
|
|
|
|
|
/// 2. daemon.log started events (for completed/failed tasks)
|
|
|
|
|
|
pub fn show_task_log(task_name: &str, lines: usize) -> Result<(), String> {
|
|
|
|
|
|
// Try running tasks first
|
2026-03-21 19:42:03 -04:00
|
|
|
|
let Some(status_json) = send_rpc_pub("") else {
|
|
|
|
|
|
return search_log_fallback(task_name, lines);
|
|
|
|
|
|
};
|
|
|
|
|
|
let Ok(status) = serde_json::from_str::<serde_json::Value>(&status_json) else {
|
|
|
|
|
|
return search_log_fallback(task_name, lines);
|
|
|
|
|
|
};
|
|
|
|
|
|
let Some(tasks) = status.get("tasks").and_then(|t| t.as_array()) else {
|
|
|
|
|
|
return search_log_fallback(task_name, lines);
|
|
|
|
|
|
};
|
|
|
|
|
|
for t in tasks {
|
|
|
|
|
|
let name = t.get("name").and_then(|n| n.as_str()).unwrap_or("");
|
|
|
|
|
|
if !name.contains(task_name) { continue; }
|
|
|
|
|
|
if let Some(lp) = t.get("log_path").and_then(|p| p.as_str()) {
|
|
|
|
|
|
return tail_file(lp, lines);
|
2026-03-19 11:17:07 -04:00
|
|
|
|
}
|
|
|
|
|
|
}
|
2026-03-21 19:42:03 -04:00
|
|
|
|
search_log_fallback(task_name, lines)
|
|
|
|
|
|
}
|
2026-03-19 11:17:07 -04:00
|
|
|
|
|
2026-03-21 19:42:03 -04:00
|
|
|
|
fn search_log_fallback(task_name: &str, lines: usize) -> Result<(), String> {
|
2026-03-19 11:17:07 -04:00
|
|
|
|
// Fall back to searching daemon.log for the most recent started event with a log path
|
|
|
|
|
|
let log = log_path();
|
|
|
|
|
|
if log.exists() {
|
|
|
|
|
|
let content = fs::read_to_string(&log).map_err(|e| format!("read log: {}", e))?;
|
|
|
|
|
|
for line in content.lines().rev() {
|
|
|
|
|
|
if let Ok(obj) = serde_json::from_str::<serde_json::Value>(line) {
|
|
|
|
|
|
let job = obj.get("job").and_then(|v| v.as_str()).unwrap_or("");
|
|
|
|
|
|
let event = obj.get("event").and_then(|v| v.as_str()).unwrap_or("");
|
|
|
|
|
|
let detail = obj.get("detail").and_then(|v| v.as_str()).unwrap_or("");
|
|
|
|
|
|
if job.contains(task_name) && event == "started" && detail.starts_with("log: ") {
|
|
|
|
|
|
let path = &detail[5..];
|
|
|
|
|
|
return tail_file(path, lines);
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Err(format!("no log file found for task '{}'", task_name))
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
fn tail_file(path: &str, lines: usize) -> Result<(), String> {
|
|
|
|
|
|
let content = fs::read_to_string(path)
|
|
|
|
|
|
.map_err(|e| format!("read {}: {}", path, e))?;
|
|
|
|
|
|
let all_lines: Vec<&str> = content.lines().collect();
|
|
|
|
|
|
let skip = all_lines.len().saturating_sub(lines);
|
|
|
|
|
|
eprintln!("--- {} ({} lines) ---", path, all_lines.len());
|
|
|
|
|
|
for line in &all_lines[skip..] {
|
|
|
|
|
|
eprintln!("{}", line);
|
|
|
|
|
|
}
|
|
|
|
|
|
Ok(())
|
|
|
|
|
|
}
|
|
|
|
|
|
|
2026-03-05 13:18:00 -05:00
|
|
|
|
pub fn show_log(job_filter: Option<&str>, lines: usize) -> Result<(), String> {
|
|
|
|
|
|
let path = log_path();
|
|
|
|
|
|
if !path.exists() {
|
|
|
|
|
|
eprintln!("No daemon log found.");
|
|
|
|
|
|
return Ok(());
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
let content = fs::read_to_string(&path)
|
|
|
|
|
|
.map_err(|e| format!("read log: {}", e))?;
|
|
|
|
|
|
|
|
|
|
|
|
let filtered: Vec<&str> = content.lines().rev()
|
|
|
|
|
|
.filter(|line| {
|
|
|
|
|
|
if let Some(job) = job_filter {
|
|
|
|
|
|
line.contains(&format!("\"job\":\"{}\"", job))
|
|
|
|
|
|
} else {
|
|
|
|
|
|
true
|
|
|
|
|
|
}
|
|
|
|
|
|
})
|
|
|
|
|
|
.take(lines)
|
|
|
|
|
|
.collect();
|
|
|
|
|
|
|
2026-03-05 15:31:08 -05:00
|
|
|
|
if filtered.is_empty() {
|
|
|
|
|
|
eprintln!("No log entries{}", job_filter.map(|j| format!(" for job '{}'", j)).unwrap_or_default());
|
|
|
|
|
|
return Ok(());
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Pretty-print: parse JSON and format as "TIME JOB EVENT [DETAIL]"
|
2026-03-05 13:18:00 -05:00
|
|
|
|
for line in filtered.into_iter().rev() {
|
2026-03-05 15:31:08 -05:00
|
|
|
|
if let Ok(obj) = serde_json::from_str::<serde_json::Value>(line) {
|
|
|
|
|
|
let ts = obj.get("ts").and_then(|v| v.as_str()).unwrap_or("?");
|
|
|
|
|
|
let job = obj.get("job").and_then(|v| v.as_str()).unwrap_or("?");
|
|
|
|
|
|
let event = obj.get("event").and_then(|v| v.as_str()).unwrap_or("?");
|
|
|
|
|
|
let detail = obj.get("detail").and_then(|v| v.as_str()).unwrap_or("");
|
|
|
|
|
|
|
|
|
|
|
|
// Shorten timestamp to just time portion
|
|
|
|
|
|
let time = if ts.len() >= 19 { &ts[11..19] } else { ts };
|
|
|
|
|
|
|
|
|
|
|
|
if detail.is_empty() {
|
|
|
|
|
|
eprintln!(" {} {:20} {}", time, job, event);
|
|
|
|
|
|
} else {
|
|
|
|
|
|
// Truncate long details (file paths)
|
|
|
|
|
|
let short = if detail.len() > 60 {
|
|
|
|
|
|
let last = detail.rfind('/').map(|i| &detail[i+1..]).unwrap_or(detail);
|
|
|
|
|
|
if last.len() > 60 { &last[..60] } else { last }
|
|
|
|
|
|
} else {
|
|
|
|
|
|
detail
|
|
|
|
|
|
};
|
|
|
|
|
|
eprintln!(" {} {:20} {:12} {}", time, job, event, short);
|
|
|
|
|
|
}
|
|
|
|
|
|
} else {
|
|
|
|
|
|
eprintln!("{}", line);
|
|
|
|
|
|
}
|
2026-03-05 13:18:00 -05:00
|
|
|
|
}
|
|
|
|
|
|
Ok(())
|
|
|
|
|
|
}
|