Struct PairingTokensRepo 

pub struct PairingTokensRepo<'a> { /* private fields */ }

Implementations

impl PairingTokensRepo<'_>

pub fn create( &self, token_hash: &str, label: Option<&str>, expires_at: Option<&str>, ) -> Result<PairingTokenRecord, Error>

pub fn get(&self, id: &str) -> Result<Option<PairingTokenRecord>, Error>

pub fn verify_token( &self, token_hash: &str, ) -> Result<Option<PairingTokenRecord>, Error>

Look up an enabled, unexpired pairing token by hash.

The hash is not matched in SQL (WHERE token_hash = ?) — that is a DB-level equality on the secret and a theoretical timing channel. Instead we fetch the enabled, unexpired candidates (neither predicate is secret) and compare each hash in constant time. The candidate count is tiny and not secret. All candidates are scanned without early exit so the timing doesn’t reveal which (if any) token matched.

pub fn list(&self) -> Result<Vec<PairingTokenRecord>, Error>

pub fn list_redacted(&self) -> Result<Vec<PairingTokenRecord>, Error>

Like list, but with token_hash blanked. Use for any surface that crosses a trust boundary — e.g. the daemon snapshot served over the local socket to same-UID processes. The hash is secret-equivalent (it’s all verify_token compares against) and must not leave the store.

pub fn mark_used(&self, id: &str) -> Result<(), Error>

pub fn revoke(&self, id: &str) -> Result<bool, Error>

Revoke a token by disabling it. Returns true if a live token was revoked, false if it was already disabled or unknown.