feat(jitter): adaptive playout delay driven by buffer feedback
Replace the fixed 3-frame (~60ms) playout delay with a feedback controller that tunes depth to real network behavior, no wall clock needed: - Grow (+1 frame) on a late-arriving packet (one for a sequence already played past) or a gap that forces Opus PLC — jitter beat the cushion. - Shrink (-1 frame) after a long unbroken run of real frames — the link is comfortably ahead. Fast grow, slow shrink (AIMD-style). - Bounded to [2, 12] frames (40-240ms), well under MAX_BUFFERED_FRAMES. - Benign silence (a talker pausing) emits none of these signals, so the delay is untouched across quiet stretches — avoids the classic "inflate delay because someone went quiet" bug. - Prime-timeout safety net: since the mixer polls every ~20ms, prime after ~500ms even under a grown target so a short utterance isn't held forever and startup latency stays bounded. No public API change; all logic stays in jitter.rs. Adds 8 unit tests (grow/shrink, both bounds, silence-neutrality, prime timeout). Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
This commit is contained in:
+267
-11
@@ -3,9 +3,26 @@
|
|||||||
//! Incoming audio arrives as unreliable QUIC datagrams that can be reordered,
|
//! Incoming audio arrives as unreliable QUIC datagrams that can be reordered,
|
||||||
//! duplicated, or dropped on real networks. Each packet carries a monotonic
|
//! duplicated, or dropped on real networks. Each packet carries a monotonic
|
||||||
//! sequence number (assigned by the sender). This buffer reorders packets by
|
//! sequence number (assigned by the sender). This buffer reorders packets by
|
||||||
//! sequence, holds a small fixed playout delay to absorb jitter, and — when a
|
//! sequence, holds an *adaptive* playout delay to absorb jitter, and — when a
|
||||||
//! sequence is missing but later packets have already arrived — synthesizes a
|
//! sequence is missing but later packets have already arrived — synthesizes a
|
||||||
//! concealment frame via Opus PLC instead of emitting a click of silence.
|
//! concealment frame via Opus PLC instead of emitting a click of silence.
|
||||||
|
//!
|
||||||
|
//! ## Adaptive playout delay
|
||||||
|
//!
|
||||||
|
//! The playout delay (how many frames we accumulate before (re)starting
|
||||||
|
//! playout) is a feedback controller, not a fixed constant. It reacts to the
|
||||||
|
//! buffer's own observations, with no wall clock required:
|
||||||
|
//!
|
||||||
|
//! * **Grow** (jitter beat the cushion): a late-arriving packet (one for a
|
||||||
|
//! sequence we already played past) or a gap that forced Opus PLC each bumps
|
||||||
|
//! the target up one frame.
|
||||||
|
//! * **Shrink** (comfortably ahead): a long unbroken run of real decoded frames
|
||||||
|
//! shaves the target back down one frame.
|
||||||
|
//!
|
||||||
|
//! Growth is fast and shrink is slow (AIMD-style) so we react to badness
|
||||||
|
//! immediately but reclaim latency cautiously. Benign silence — a talker
|
||||||
|
//! pausing, so packets simply stop — produces none of these signals, so the
|
||||||
|
//! target is left untouched across quiet stretches.
|
||||||
|
|
||||||
use crate::codec::{AudioDecoder, CodecError, opus_impl::OpusDecoder};
|
use crate::codec::{AudioDecoder, CodecError, opus_impl::OpusDecoder};
|
||||||
use opus::Channels;
|
use opus::Channels;
|
||||||
@@ -14,10 +31,29 @@ use std::collections::BTreeMap;
|
|||||||
/// Samples per channel in one transmitted frame (20ms @ 48kHz mono).
|
/// Samples per channel in one transmitted frame (20ms @ 48kHz mono).
|
||||||
pub const FRAME_SAMPLES: usize = 960;
|
pub const FRAME_SAMPLES: usize = 960;
|
||||||
|
|
||||||
/// How many frames to buffer before playout begins (~60ms). This is the
|
/// Starting (and most common) playout delay (~60ms): the number of frames to
|
||||||
/// tolerance window for reordering and jitter; larger = more resilient but
|
/// accumulate before playout begins. The adaptive controller moves the live
|
||||||
/// more latency.
|
/// target up and down from here within `[MIN_DELAY_FRAMES, MAX_DELAY_FRAMES]`.
|
||||||
const TARGET_DELAY_FRAMES: usize = 3;
|
const DEFAULT_DELAY_FRAMES: usize = 3;
|
||||||
|
|
||||||
|
/// Floor for the adaptive delay (~40ms). Below this there's no slack left to
|
||||||
|
/// reorder even a single packet, so we never shrink past it.
|
||||||
|
const MIN_DELAY_FRAMES: usize = 2;
|
||||||
|
|
||||||
|
/// Ceiling for the adaptive delay (~240ms). Kept well under
|
||||||
|
/// `MAX_BUFFERED_FRAMES` so a deep cushion still leaves reorder headroom, and
|
||||||
|
/// bounded so a pathological link can't drive playout latency unboundedly.
|
||||||
|
const MAX_DELAY_FRAMES: usize = 12;
|
||||||
|
|
||||||
|
/// Consecutive cleanly-played real frames (~5s) required to shave one frame off
|
||||||
|
/// the target. Deliberately long so we reclaim latency slowly and don't flap.
|
||||||
|
const CLEAN_RUN_TO_SHRINK: usize = 250;
|
||||||
|
|
||||||
|
/// While buffering, prime playout after this many `pop_frame` polls even if the
|
||||||
|
/// target delay isn't met yet (~500ms; the mixer polls every 20ms). This
|
||||||
|
/// rescues a short utterance that never reaches a grown target, and bounds the
|
||||||
|
/// worst-case startup latency.
|
||||||
|
const PRIME_TIMEOUT_TICKS: usize = 25;
|
||||||
|
|
||||||
/// Hard cap on buffered frames (~640ms). If we ever exceed this we've fallen
|
/// Hard cap on buffered frames (~640ms). If we ever exceed this we've fallen
|
||||||
/// badly behind, so we drop the oldest and resync rather than grow unbounded.
|
/// badly behind, so we drop the oldest and resync rather than grow unbounded.
|
||||||
@@ -28,8 +64,17 @@ pub struct JitterBuffer {
|
|||||||
/// Reorder window: sequence number -> encoded Opus payload.
|
/// Reorder window: sequence number -> encoded Opus payload.
|
||||||
packets: BTreeMap<u32, Vec<u8>>,
|
packets: BTreeMap<u32, Vec<u8>>,
|
||||||
/// Next sequence we expect to play. `None` means idle/buffering: we are
|
/// Next sequence we expect to play. `None` means idle/buffering: we are
|
||||||
/// waiting to accumulate `TARGET_DELAY_FRAMES` before (re)starting playout.
|
/// waiting to accumulate `target_delay` frames before (re)starting playout.
|
||||||
next_seq: Option<u32>,
|
next_seq: Option<u32>,
|
||||||
|
/// Live adaptive playout delay, in frames. Moved by the controller within
|
||||||
|
/// `[MIN_DELAY_FRAMES, MAX_DELAY_FRAMES]`.
|
||||||
|
target_delay: usize,
|
||||||
|
/// Consecutive cleanly-played real frames since the last disruption; drives
|
||||||
|
/// the slow shrink toward `MIN_DELAY_FRAMES`.
|
||||||
|
clean_run: usize,
|
||||||
|
/// `pop_frame` polls spent buffering with packets present; drives the
|
||||||
|
/// `PRIME_TIMEOUT_TICKS` safety prime.
|
||||||
|
buffering_ticks: usize,
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Wrapping-aware "is `a` strictly before `b`" for sequence numbers.
|
/// Wrapping-aware "is `a` strictly before `b`" for sequence numbers.
|
||||||
@@ -43,16 +88,43 @@ impl JitterBuffer {
|
|||||||
decoder: OpusDecoder::new(48000, Channels::Mono, FRAME_SAMPLES)?,
|
decoder: OpusDecoder::new(48000, Channels::Mono, FRAME_SAMPLES)?,
|
||||||
packets: BTreeMap::new(),
|
packets: BTreeMap::new(),
|
||||||
next_seq: None,
|
next_seq: None,
|
||||||
|
target_delay: DEFAULT_DELAY_FRAMES,
|
||||||
|
clean_run: 0,
|
||||||
|
buffering_ticks: 0,
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// Current adaptive playout delay, in frames. Exposed for metrics/tests.
|
||||||
|
pub fn target_delay(&self) -> usize {
|
||||||
|
self.target_delay
|
||||||
|
}
|
||||||
|
|
||||||
|
/// Grow the playout delay one frame (bounded): jitter beat the cushion, so
|
||||||
|
/// next time we (re)prime we hold a deeper buffer. Resets the clean run.
|
||||||
|
fn note_disruption(&mut self) {
|
||||||
|
self.target_delay = (self.target_delay + 1).min(MAX_DELAY_FRAMES);
|
||||||
|
self.clean_run = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// Count one cleanly-played real frame; after a long unbroken run, shave one
|
||||||
|
/// frame off the delay (bounded below) to reclaim latency on a calm link.
|
||||||
|
fn note_clean(&mut self) {
|
||||||
|
self.clean_run += 1;
|
||||||
|
if self.clean_run >= CLEAN_RUN_TO_SHRINK {
|
||||||
|
self.target_delay = self.target_delay.saturating_sub(1).max(MIN_DELAY_FRAMES);
|
||||||
|
self.clean_run = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/// Store a received packet, dropping ones we've already played past and
|
/// Store a received packet, dropping ones we've already played past and
|
||||||
/// bounding total depth.
|
/// bounding total depth.
|
||||||
pub fn insert(&mut self, seq: u32, payload: Vec<u8>) {
|
pub fn insert(&mut self, seq: u32, payload: Vec<u8>) {
|
||||||
// Too late: this sequence has already been played (or concealed).
|
// Too late: this sequence has already been played (or concealed). Its
|
||||||
|
// arrival after the playout head means our cushion was too shallow.
|
||||||
if let Some(next) = self.next_seq
|
if let Some(next) = self.next_seq
|
||||||
&& seq_before(seq, next)
|
&& seq_before(seq, next)
|
||||||
{
|
{
|
||||||
|
self.note_disruption();
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
self.packets.insert(seq, payload);
|
self.packets.insert(seq, payload);
|
||||||
@@ -62,6 +134,8 @@ impl JitterBuffer {
|
|||||||
self.packets.remove(&oldest);
|
self.packets.remove(&oldest);
|
||||||
// We've discarded backlog; resync the playout head to the new front.
|
// We've discarded backlog; resync the playout head to the new front.
|
||||||
self.next_seq = self.packets.keys().next().copied();
|
self.next_seq = self.packets.keys().next().copied();
|
||||||
|
// The resync breaks sequence continuity; restart the clean run.
|
||||||
|
self.clean_run = 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -70,8 +144,19 @@ impl JitterBuffer {
|
|||||||
pub fn pop_frame(&mut self) -> Option<Vec<i16>> {
|
pub fn pop_frame(&mut self) -> Option<Vec<i16>> {
|
||||||
match self.next_seq {
|
match self.next_seq {
|
||||||
None => {
|
None => {
|
||||||
// Buffering: start playout once we have enough to absorb jitter.
|
// Idle with nothing buffered: genuinely silent, no prime pending.
|
||||||
if self.packets.len() >= TARGET_DELAY_FRAMES {
|
if self.packets.is_empty() {
|
||||||
|
self.buffering_ticks = 0;
|
||||||
|
return None;
|
||||||
|
}
|
||||||
|
// Buffering: prime once we've accumulated the adaptive target, or
|
||||||
|
// after a bounded wait so a short utterance isn't held forever.
|
||||||
|
self.buffering_ticks += 1;
|
||||||
|
if self.packets.len() >= self.target_delay
|
||||||
|
|| self.buffering_ticks >= PRIME_TIMEOUT_TICKS
|
||||||
|
{
|
||||||
|
self.buffering_ticks = 0;
|
||||||
|
self.clean_run = 0;
|
||||||
self.next_seq = self.packets.keys().next().copied();
|
self.next_seq = self.packets.keys().next().copied();
|
||||||
self.pop_frame()
|
self.pop_frame()
|
||||||
} else {
|
} else {
|
||||||
@@ -81,16 +166,24 @@ impl JitterBuffer {
|
|||||||
Some(next) => {
|
Some(next) => {
|
||||||
if let Some(payload) = self.packets.remove(&next) {
|
if let Some(payload) = self.packets.remove(&next) {
|
||||||
self.next_seq = Some(next.wrapping_add(1));
|
self.next_seq = Some(next.wrapping_add(1));
|
||||||
self.decoder.decode(Some(&payload)).ok()
|
let frame = self.decoder.decode(Some(&payload)).ok();
|
||||||
|
// A real, in-order frame played: the link is keeping up.
|
||||||
|
self.note_clean();
|
||||||
|
frame
|
||||||
} else if self.packets.is_empty() {
|
} else if self.packets.is_empty() {
|
||||||
// Underrun: the talker has gone quiet (or stopped). Go idle
|
// Underrun: the talker has gone quiet (or stopped). Go idle
|
||||||
// and re-buffer before resuming, rather than concealing forever.
|
// and re-buffer before resuming, rather than concealing forever.
|
||||||
|
// This is benign (silence), so we don't grow the delay; just
|
||||||
|
// end the clean run since playout is breaking.
|
||||||
self.next_seq = None;
|
self.next_seq = None;
|
||||||
|
self.clean_run = 0;
|
||||||
None
|
None
|
||||||
} else {
|
} else {
|
||||||
// Gap with later packets already buffered: a packet was lost
|
// Gap with later packets already buffered: a packet was lost
|
||||||
// or reordered out of window. Conceal this frame via Opus PLC.
|
// or reordered out of window. Conceal this frame via Opus PLC
|
||||||
|
// and grow the cushion — the jitter beat our current delay.
|
||||||
self.next_seq = Some(next.wrapping_add(1));
|
self.next_seq = Some(next.wrapping_add(1));
|
||||||
|
self.note_disruption();
|
||||||
self.decoder.decode(None).ok()
|
self.decoder.decode(None).ok()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -311,5 +404,168 @@ mod tests {
|
|||||||
assert_eq!(jb.packets.len(), MAX_BUFFERED_FRAMES);
|
assert_eq!(jb.packets.len(), MAX_BUFFERED_FRAMES);
|
||||||
assert_eq!(jb.next_seq, jb.packets.keys().next().copied());
|
assert_eq!(jb.next_seq, jb.packets.keys().next().copied());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// ---- Adaptive playout delay ------------------------------------------
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn starts_at_default_delay() {
|
||||||
|
let jb = JitterBuffer::new().unwrap();
|
||||||
|
assert_eq!(jb.target_delay(), DEFAULT_DELAY_FRAMES);
|
||||||
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn grows_delay_on_late_arrival() {
|
||||||
|
let mut enc = OpusEncoder::new(48000, Channels::Mono, Application::Voip).unwrap();
|
||||||
|
let mut jb = JitterBuffer::new().unwrap();
|
||||||
|
|
||||||
|
// Prime and play two frames so the playout head sits at seq 2.
|
||||||
|
jb.insert(0, frame(&mut enc, 1000));
|
||||||
|
jb.insert(1, frame(&mut enc, 1000));
|
||||||
|
jb.insert(2, frame(&mut enc, 1000));
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
assert_eq!(jb.next_seq, Some(2));
|
||||||
|
assert_eq!(jb.target_delay(), DEFAULT_DELAY_FRAMES);
|
||||||
|
|
||||||
|
// A packet for an already-played sequence arrives too late: grow by one.
|
||||||
|
jb.insert(0, vec![0u8]);
|
||||||
|
assert_eq!(jb.target_delay(), DEFAULT_DELAY_FRAMES + 1);
|
||||||
|
// The stale payload was dropped, not buffered.
|
||||||
|
assert!(!jb.packets.contains_key(&0));
|
||||||
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn grows_delay_on_gap_conceal() {
|
||||||
|
let mut enc = OpusEncoder::new(48000, Channels::Mono, Application::Voip).unwrap();
|
||||||
|
let mut jb = JitterBuffer::new().unwrap();
|
||||||
|
|
||||||
|
// Seq 2 is missing but 0, 1, 3 arrive — enough to prime.
|
||||||
|
jb.insert(0, frame(&mut enc, 1200));
|
||||||
|
jb.insert(1, frame(&mut enc, 1200));
|
||||||
|
jb.insert(3, frame(&mut enc, 1200));
|
||||||
|
|
||||||
|
assert!(jb.pop_frame().is_some()); // seq 0 (clean)
|
||||||
|
assert!(jb.pop_frame().is_some()); // seq 1 (clean)
|
||||||
|
assert_eq!(jb.target_delay(), DEFAULT_DELAY_FRAMES);
|
||||||
|
|
||||||
|
// Seq 2 missing with seq 3 buffered -> PLC conceal -> grow by one.
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
assert_eq!(jb.target_delay(), DEFAULT_DELAY_FRAMES + 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn silence_does_not_change_delay() {
|
||||||
|
let mut enc = OpusEncoder::new(48000, Channels::Mono, Application::Voip).unwrap();
|
||||||
|
let mut jb = JitterBuffer::new().unwrap();
|
||||||
|
|
||||||
|
// A clean short utterance that drains to an underrun (talker stops).
|
||||||
|
jb.insert(0, frame(&mut enc, 1000));
|
||||||
|
jb.insert(1, frame(&mut enc, 1000));
|
||||||
|
jb.insert(2, frame(&mut enc, 1000));
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
|
||||||
|
// Underrun + further idle polls must leave the delay untouched: a quiet
|
||||||
|
// talker is not a network problem.
|
||||||
|
assert!(jb.pop_frame().is_none());
|
||||||
|
assert!(jb.is_idle());
|
||||||
|
assert!(jb.pop_frame().is_none());
|
||||||
|
assert!(jb.pop_frame().is_none());
|
||||||
|
assert_eq!(jb.target_delay(), DEFAULT_DELAY_FRAMES);
|
||||||
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn shrinks_delay_after_clean_run() {
|
||||||
|
let mut enc = OpusEncoder::new(48000, Channels::Mono, Application::Voip).unwrap();
|
||||||
|
let mut jb = JitterBuffer::new().unwrap();
|
||||||
|
|
||||||
|
// Steady state: keep the cushion topped up so every pop yields a real,
|
||||||
|
// in-order frame (no conceal, no underrun, no overflow).
|
||||||
|
let mut next = 0u32;
|
||||||
|
for _ in 0..DEFAULT_DELAY_FRAMES {
|
||||||
|
jb.insert(next, frame(&mut enc, 800));
|
||||||
|
next += 1;
|
||||||
|
}
|
||||||
|
for _ in 0..CLEAN_RUN_TO_SHRINK {
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
jb.insert(next, frame(&mut enc, 800));
|
||||||
|
next += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
// One clean run's worth of frames shaves exactly one off the delay.
|
||||||
|
assert_eq!(jb.target_delay(), DEFAULT_DELAY_FRAMES - 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn delay_is_bounded_above() {
|
||||||
|
let mut enc = OpusEncoder::new(48000, Channels::Mono, Application::Voip).unwrap();
|
||||||
|
let mut jb = JitterBuffer::new().unwrap();
|
||||||
|
|
||||||
|
// Prime and advance the head, then hammer late arrivals.
|
||||||
|
jb.insert(0, frame(&mut enc, 500));
|
||||||
|
jb.insert(1, frame(&mut enc, 500));
|
||||||
|
jb.insert(2, frame(&mut enc, 500));
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
|
||||||
|
for _ in 0..100 {
|
||||||
|
jb.insert(0, vec![0u8]); // always "too late" -> disruption
|
||||||
|
}
|
||||||
|
assert_eq!(jb.target_delay(), MAX_DELAY_FRAMES);
|
||||||
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn delay_is_bounded_below() {
|
||||||
|
let mut enc = OpusEncoder::new(48000, Channels::Mono, Application::Voip).unwrap();
|
||||||
|
let mut jb = JitterBuffer::new().unwrap();
|
||||||
|
|
||||||
|
// Many clean runs would shrink forever; it must stop at the floor.
|
||||||
|
let mut next = 0u32;
|
||||||
|
for _ in 0..DEFAULT_DELAY_FRAMES {
|
||||||
|
jb.insert(next, frame(&mut enc, 800));
|
||||||
|
next += 1;
|
||||||
|
}
|
||||||
|
for _ in 0..(CLEAN_RUN_TO_SHRINK * 4) {
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
jb.insert(next, frame(&mut enc, 800));
|
||||||
|
next += 1;
|
||||||
|
assert!(jb.target_delay() >= MIN_DELAY_FRAMES);
|
||||||
|
}
|
||||||
|
assert_eq!(jb.target_delay(), MIN_DELAY_FRAMES);
|
||||||
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn prime_timeout_rescues_short_utterance() {
|
||||||
|
let mut enc = OpusEncoder::new(48000, Channels::Mono, Application::Voip).unwrap();
|
||||||
|
let mut jb = JitterBuffer::new().unwrap();
|
||||||
|
|
||||||
|
// Drive the target above what a short utterance can reach.
|
||||||
|
jb.insert(0, frame(&mut enc, 500));
|
||||||
|
jb.insert(1, frame(&mut enc, 500));
|
||||||
|
jb.insert(2, frame(&mut enc, 500));
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
assert!(jb.pop_frame().is_some());
|
||||||
|
while jb.target_delay() < 6 {
|
||||||
|
jb.insert(0, vec![0u8]);
|
||||||
|
}
|
||||||
|
assert!(jb.pop_frame().is_some()); // drain seq 2
|
||||||
|
assert!(jb.pop_frame().is_none()); // underrun -> idle
|
||||||
|
assert!(jb.is_idle());
|
||||||
|
|
||||||
|
// A 2-frame utterance is below the grown target of 6, so only the
|
||||||
|
// timeout can start it — and it must, exactly at PRIME_TIMEOUT_TICKS.
|
||||||
|
jb.insert(100, frame(&mut enc, 700));
|
||||||
|
jb.insert(101, frame(&mut enc, 700));
|
||||||
|
let mut polls = 0;
|
||||||
|
loop {
|
||||||
|
polls += 1;
|
||||||
|
assert!(polls <= PRIME_TIMEOUT_TICKS, "must prime by the timeout");
|
||||||
|
if jb.pop_frame().is_some() {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
assert_eq!(polls, PRIME_TIMEOUT_TICKS);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user