Lines Matching defs:last

632 		// find the last attribute
633 small_data* last = next;
634 while (!last->IsLast(node))
635 last = last->Next();
637 int32 size = (uint8*)last - (uint8*)next;
644 // Move the "last" one to its new location and
646 last = (small_data*)((uint8*)last - ((uint8*)next - (uint8*)item));
647 memset(last, 0, (uint8*)node + fVolume->BlockSize() - (uint8*)last);
734 // Find the last item or one with the same name we have to add
745 // find last attribute
746 small_data* last = item;
747 while (!last->IsLast(node))
748 last = last->Next();
753 || ((uint8*)last + pos + length - item->DataSize())
757 if (force && ((uint8*)last + pos + length - item->DataSize())
763 - (uint8*)last);
777 last = item;
778 while (!last->IsLast(node))
779 last = last->Next();
791 (uint8*)last - (uint8*)next);
794 // Move the "last" one to its new location and
796 last = (small_data*)((uint8*)last
798 if ((uint8*)last < (uint8*)node + fVolume->BlockSize()) {
799 memset(last, 0, (uint8*)node + fVolume->BlockSize()
800 - (uint8*)last);
833 // get new last item!
893 // is already last item?
1587 // update the last modification time in memory, it will be written
1589 // TODO: should update the internal last modified time only at this point!
1835 // can we merge the last allocated run with the new one?
1836 int32 last = free - 1;
1837 if (free > 0 && data->direct[last].MergeableWith(run)) {
1838 data->direct[last].length = HOST_ENDIAN_TO_BFS_INT16(
1839 data->direct[last].Length() + run.Length());
1900 // try to insert the run to the last one - note that this
1905 int32 last = free - 1;
1906 if (free > 0 && runs[last].MergeableWith(run)) {
1907 runs[last].length = HOST_ENDIAN_TO_BFS_INT16(
1908 runs[last].Length() + run.Length());
2146 It also trims the last block_run that contain the size.
2147 "offset" and "max" are maintained until the last block_run that doesn't
2562 // remove_vnode() allows the inode to be accessed until the last put_vnode()