Lines Matching defs:Tail
165 Segment *Tail;
263 DCHECK_EQ(Tail, &SentinelSegment);
271 Tail = S;
272 DCHECK_EQ(Head, Tail);
273 DCHECK_EQ(Tail->Next, &SentinelSegment);
274 DCHECK_EQ(Tail->Prev, &SentinelSegment);
282 DCHECK_NE(Tail, &SentinelSegment);
283 DCHECK_EQ(Tail->Next, &SentinelSegment);
286 S->Prev = Tail;
287 Tail->Next = S;
288 Tail = S;
290 DCHECK_EQ(Tail->Next, &SentinelSegment);
298 Tail(&SentinelSegment),
304 Tail(&SentinelSegment),
313 Tail(O.Tail),
318 O.Tail = &SentinelSegment;
328 Tail = O.Tail;
329 O.Tail = &SentinelSegment;
353 DCHECK((Size == 0 && Head == &SentinelSegment && Head == Tail) ||
354 (Size != 0 && Head != &SentinelSegment && Tail != &SentinelSegment));
362 DCHECK_NE(Tail, &SentinelSegment);
369 DCHECK_NE(Tail, &SentinelSegment);
370 auto Base = &Tail->Data;
385 DCHECK((Size == 0 && Head == &SentinelSegment && Head == Tail) ||
386 (Size != 0 && Head != &SentinelSegment && Tail != &SentinelSegment));
394 DCHECK_NE(Tail, &SentinelSegment);
401 DCHECK_NE(Tail, &SentinelSegment);
402 auto Base = &Tail->Data;
405 reinterpret_cast<unsigned char *>(Tail) + SegmentSize);
435 DCHECK_NE(Tail, &SentinelSegment);
515 DCHECK_NE(Tail, &SentinelSegment);
516 DCHECK_EQ(Tail->Next, &SentinelSegment);
523 // ^ Head ^ Tail
529 // ^ Head ^ Tail
553 // Tail = sPT
555 auto SPT = Tail->Prev;
557 Tail->Prev = &SentinelSegment;
558 Tail->Next = Freelist;
559 Freelist = Tail;
560 Tail = SPT;
563 DCHECK_EQ(Tail->Next, &SentinelSegment);
574 // ^ Head ^ Tail
581 // ^ Head ^ Tail
591 // Tail = sPT
595 auto SPT = Tail->Prev;
596 auto ST = Tail;
601 Tail = SPT;
605 DCHECK_EQ(Tail->Next, &SentinelSegment);
614 if (Tail == &SentinelSegment)
615 Head = Tail;
618 (Size == 0 && Head == &SentinelSegment && Tail == &SentinelSegment) ||
619 (Size != 0 && Head != &SentinelSegment && Tail != &SentinelSegment));
622 (Freelist == &SentinelSegment && Tail->Next == &SentinelSegment));
630 return Iterator<T>(Tail, Size, Size);
636 return Iterator<const T>(Tail, Size, Size);