Struct ExecutorRegistry 

pub struct ExecutorRegistry { /* private fields */ }

Maps HookConfig → Arc<dyn HookExecutor>. Built once per hooks.toml load (see src/hooks/config.rs::spawn_reload_task) and held behind the same Arc<RwLock<…>> that owns the config snapshot. G5’s chain runner consumes the registry’s outputs.

The cache is keyed on HookConfig (full struct equality) so two different hooks pointing at the same binary still get distinct executors — one daemon child per [[hook]] block, never shared. Sharing would let one event’s slow fire starve another’s connection mutex, which is the opposite of what daemon mode buys us.

Backed by a Vec<(HookConfig, …)> rather than a HashMap: HookConfig carries a PathBuf and a String (no Hash derivation today), and the cache cardinality is bounded by the number of [[hook]] blocks in hooks.toml — a linear scan over a few dozen entries is dwarfed by the spawn cost it gates.

Implementations

impl ExecutorRegistry

pub fn new() -> Self

pub fn from_hooks(hooks: &[HookConfig]) -> Self

Build a registry pre-populated with one executor per entry in hooks. Convenience for the bootstrap path; callers driving the SIGHUP reload should call Self::get lazily instead so dropping a [[hook]] from the config tears down its long-lived child.

pub fn get(&mut self, hook: &HookConfig) -> Arc<dyn HookExecutor>

Return the executor for hook, constructing one on first touch. Subsequent calls with an equal HookConfig return the same Arc.

pub fn metrics(&self) -> Vec<(HookConfig, ExecutorMetrics)>

Iterate (HookConfig, ExecutorMetrics) pairs. ai-memory doctor --tokens --hooks calls this to render the per-executor backpressure table.

pub fn len(&self) -> usize

Number of cached executors. Cheap accessor for tests.

pub fn is_empty(&self) -> bool

Whether the registry is empty.

Trait Implementations

impl Default for ExecutorRegistry

fn default() -> Self

Returns the “default value” for a type.