Lines Matching defs:header
109 struct Header {
110 int fTotalLength; // The length of an entry including header, item, and data in TAligns.
174 Header* header = reinterpret_cast<Header*>(
175 reinterpret_cast<TAlign*>(fLastItem) - length_of<Header>::kValue);
176 fTailBlock->fBack -= header->fTotalLength;
179 int lastItemLength = header->fPrevLength;
181 if (!header->fPrevLength) {
194 &(*fTailBlock)[fTailBlock->fBack - lastItemLength + length_of<Header>::kValue]);
200 // Find the header of the previous entry and get its length. We need to store that in the new
201 // header for backwards iteration (pop_back()).
204 Header* lastHeader = reinterpret_cast<Header*>(
205 reinterpret_cast<TAlign*>(fLastItem) - length_of<Header>::kValue);
209 const int totalLength = length_of<Header>::kValue + length_of<TItem>::kValue + dataLength;
223 Header* header = reinterpret_cast<Header*>(&(*fTailBlock)[fTailBlock->fBack]);
225 &(*fTailBlock)[fTailBlock->fBack + length_of<Header>::kValue]);
227 header->fTotalLength = totalLength;
228 header->fPrevLength = prevLength;
268 Header* header = reinterpret_cast<Header*>(&(*fBlock)[fPosition]);
269 fItem = reinterpret_cast<TBase*>(&(*fBlock)[fPosition + length_of<Header>::kValue]);
270 fPosition += header->fTotalLength;
303 Header* lastHeader = reinterpret_cast<Header*>(
304 reinterpret_cast<TAlign*>(fItem) - length_of<Header>::kValue);
309 Header* header = reinterpret_cast<Header*>(&(*fBlock)[fPosition]);
320 fPosition -= header->fPrevLength;
323 fItem = reinterpret_cast<TBase*>(&(*fBlock)[fPosition + length_of<Header>::kValue]);
