Lines Matching defs:Tail

166   Segment *Tail;
264 DCHECK_EQ(Tail, &SentinelSegment);
272 Tail = S;
273 DCHECK_EQ(Head, Tail);
274 DCHECK_EQ(Tail->Next, &SentinelSegment);
275 DCHECK_EQ(Tail->Prev, &SentinelSegment);
283 DCHECK_NE(Tail, &SentinelSegment);
284 DCHECK_EQ(Tail->Next, &SentinelSegment);
287 S->Prev = Tail;
288 Tail->Next = S;
289 Tail = S;
291 DCHECK_EQ(Tail->Next, &SentinelSegment);
299 Tail(&SentinelSegment),
305 Tail(&SentinelSegment),
314 Tail(O.Tail),
319 O.Tail = &SentinelSegment;
329 Tail = O.Tail;
330 O.Tail = &SentinelSegment;
354 DCHECK((Size == 0 && Head == &SentinelSegment && Head == Tail) ||
355 (Size != 0 && Head != &SentinelSegment && Tail != &SentinelSegment));
363 DCHECK_NE(Tail, &SentinelSegment);
370 DCHECK_NE(Tail, &SentinelSegment);
371 auto Base = &Tail->Data;
386 DCHECK((Size == 0 && Head == &SentinelSegment && Head == Tail) ||
387 (Size != 0 && Head != &SentinelSegment && Tail != &SentinelSegment));
395 DCHECK_NE(Tail, &SentinelSegment);
402 DCHECK_NE(Tail, &SentinelSegment);
403 auto Base = &Tail->Data;
406 reinterpret_cast<unsigned char *>(Tail) + SegmentSize);
436 DCHECK_NE(Tail, &SentinelSegment);
516 DCHECK_NE(Tail, &SentinelSegment);
517 DCHECK_EQ(Tail->Next, &SentinelSegment);
524 // ^ Head ^ Tail
530 // ^ Head ^ Tail
554 // Tail = sPT
556 auto SPT = Tail->Prev;
558 Tail->Prev = &SentinelSegment;
559 Tail->Next = Freelist;
560 Freelist = Tail;
561 Tail = SPT;
564 DCHECK_EQ(Tail->Next, &SentinelSegment);
575 // ^ Head ^ Tail
582 // ^ Head ^ Tail
592 // Tail = sPT
596 auto SPT = Tail->Prev;
597 auto ST = Tail;
602 Tail = SPT;
606 DCHECK_EQ(Tail->Next, &SentinelSegment);
615 if (Tail == &SentinelSegment)
616 Head = Tail;
619 (Size == 0 && Head == &SentinelSegment && Tail == &SentinelSegment) ||
620 (Size != 0 && Head != &SentinelSegment && Tail != &SentinelSegment));
623 (Freelist == &SentinelSegment && Tail->Next == &SentinelSegment));
631 return Iterator<T>(Tail, Size, Size);
637 return Iterator<const T>(Tail, Size, Size);