Lines Matching refs:data

18     data: Vec<u8>,  field
36 available += self.data.len() as isize; in available()
45 let mut newsize = if self.data.len() < CUTOFF_SIZE { in grow()
46 2 * self.data.len() in grow()
48 5 * self.data.len() / 4 in grow()
63 if newsize <= self.data.len() { in grow()
73 newdata[..n].copy_from_slice(&self.data[self.head..self.tail]); in grow()
76 n = self.data.len() - self.head; in grow()
77 newdata[..n].copy_from_slice(&self.data[self.head..]); in grow()
78 newdata[n..n + self.tail].copy_from_slice(&self.data[..self.tail]); in grow()
83 self.data = newdata; in grow()
91 size += self.data.len() as isize; in size()
107 data: vec![], in new()
150 b.data[tail] = (packet.len() >> 8) as u8; in write()
152 if b.tail >= b.data.len() { in write()
157 b.data[tail] = packet.len() as u8; in write()
159 if b.tail >= b.data.len() { in write()
164 let end = std::cmp::min(b.data.len(), b.tail + packet.len()); in write()
167 b.data[tail..end].copy_from_slice(&packet[..n]); in write()
169 if b.tail >= b.data.len() { in write()
172 b.data[..m].copy_from_slice(&packet[n..]); in write()
198 let n1 = b.data[b.head]; in read()
200 if b.head >= b.data.len() { in read()
203 let n2 = b.data[b.head]; in read()
205 if b.head >= b.data.len() { in read()
217 if b.head + copied < b.data.len() { in read()
218 packet[..copied].copy_from_slice(&b.data[b.head..b.head + copied]); in read()
220 let k = b.data.len() - b.head; in read()
221 packet[..k].copy_from_slice(&b.data[b.head..]); in read()
222 packet[k..copied].copy_from_slice(&b.data[..copied - k]); in read()
227 if b.head >= b.data.len() { in read()
228 b.head -= b.data.len(); in read()