Searched refs:BLOCK_CAP (Results 1 – 4 of 4) sorted by relevance
40 struct Values<T>([UnsafeCell<MaybeUninit<T>>; BLOCK_CAP]);42 use super::BLOCK_CAP;45 const BLOCK_MASK: usize = !(BLOCK_CAP - 1);48 const SLOT_MASK: usize = BLOCK_CAP - 1;53 const RELEASED: usize = 1 << BLOCK_CAP;105 other_index.wrapping_sub(self.start_index) / BLOCK_CAP in distance()235 ret.map(|block| block.as_ref().start_index == self.start_index.wrapping_add(BLOCK_CAP)) in load_next()264 block.as_mut().start_index = self.start_index.wrapping_add(BLOCK_CAP); in try_push()295 let new_block = Box::new(Block::new(self.start_index + BLOCK_CAP)); in grow()371 for i in 0..BLOCK_CAP { in uninitialized()
92 const BLOCK_CAP: usize = 32; constant95 const BLOCK_CAP: usize = 16; constant98 const BLOCK_CAP: usize = 2; constant
34 const BLOCK_CAP: usize = LAP - 1; constant69 slots: [Slot<T>; BLOCK_CAP],100 for i in start..BLOCK_CAP - 1 { in destroy()213 if offset == BLOCK_CAP { in start_send()222 if offset + 1 == BLOCK_CAP && next_block.is_none() { in start_send()258 if offset + 1 == BLOCK_CAP { in start_send()308 if offset == BLOCK_CAP { in start_recv()358 if offset + 1 == BLOCK_CAP { in start_recv()398 if offset + 1 == BLOCK_CAP { in read()576 if offset < BLOCK_CAP { in drop()
1063 const BLOCK_CAP: usize = LAP - 1; constant1096 slots: [Slot<T>; BLOCK_CAP],1238 if offset == BLOCK_CAP { in push()1247 if offset + 1 == BLOCK_CAP && next_block.is_none() { in push()1262 if offset + 1 == BLOCK_CAP { in push()1316 if offset == BLOCK_CAP { in steal()1352 if offset + 1 == BLOCK_CAP { in steal()1370 … if (offset + 1 == BLOCK_CAP) || (slot.state.fetch_or(READ, Ordering::AcqRel) & DESTROY != 0) { in steal()1413 if offset == BLOCK_CAP { in steal_batch()1437 advance = (BLOCK_CAP - offset).min(MAX_BATCH); in steal_batch()[all …]