Lines Matching refs:found

92 	CachedExtent* found = Find(offset);
93 while (found != NULL && (found->flags != type || found->length < size))
94 found = Next(found);
96 if (found == NULL)
98 *chosen = found;
165 CachedExtent* found = Find(node->offset);
166 if (found == NULL) {
171 if ((found->IsData() && !node->IsData())
172 || (!found->IsData() && node->IsData())) {
179 if (found->IsAllocated() == false) {
180 // split free extents (found)
181 if (node->End() > found->End()) {
187 // |----- found ------|
189 uint64 diff = node->offset - found->offset;
190 found->offset += diff + node->length;
191 found->length -= diff + node->length;
195 node->offset - diff, diff, found->flags);
199 if (found->length == 0) {
201 _RemoveExtent(found);
208 if (found->length == node->length) {
209 found->refCount++;
226 CachedExtent* found = Find(node->offset);
227 if (found == NULL) {
233 if ((found->IsData() && !node->IsData())
234 || (!found->IsData() && node->IsData())) {
241 if (found->End() < node->End()) {
242 // |---- found-----|
244 CachedExtent* rightEmpty = CachedExtent::Create(found->End(),
245 node->End() - found->End(), node->flags);
247 node->length -= node->End() - found->End();
250 if (found->IsAllocated() == true) {
251 // free part of the allocated extents(found)
252 // |----- found ------|
254 uint64 diff = node->offset - found->offset;
255 found->offset += diff + node->length;
256 found->length -= diff + node->length;
260 diff, found->flags);
264 if (found->length == 0)
265 _RemoveExtent(found);
610 ExtentAllocator::_Allocate(uint64& found, uint64 start, uint64 size,
632 TRACE("ExtentAllocator::_Allocate() found %" B_PRIu64 "\n", start);
639 found = start;
647 ExtentAllocator::AllocateTreeBlock(uint64& found, uint64 start, uint64 flags)
663 status = _Allocate(found, start, fVolume->BlockSize(),
670 if (found >= blockGroup.End())
678 ExtentAllocator::AllocateDataBlock(uint64& found, uint64 size, uint64 start,
697 return _Allocate(found, start, size, BTRFS_EXTENT_FLAG_DATA);