Home
last modified time | relevance | path

Searched refs:kContainerMaxExtents (Results 1 – 5 of 5) sorted by relevance

/system/ulib/blobfs/iterator/
A Dnode-populator.cpp27 return 1 + ((remaining_extents + kContainerMaxExtents - 1) / kContainerMaxExtents); in NodeCountForExtents()
48 } else if (local_index == kContainerMaxExtents) { in Walk()
A Dallocated-extent-iterator.cpp60 ZX_DEBUG_ASSERT(local_index_ < (IsInode() ? kInlineMaxExtents : kContainerMaxExtents)); in ValidateExtentCount()
/system/ulib/blobfs/test/
A Dnode-populator-test.cpp21 i <= kInlineMaxExtents + kContainerMaxExtents; i++) { in NodeCountTest()
25 for (ExtentCountType i = kInlineMaxExtents + kContainerMaxExtents + 1; in NodeCountTest()
26 i <= kInlineMaxExtents + kContainerMaxExtents * 2; i++) { in NodeCountTest()
258 constexpr size_t kExpectedExtents = kInlineMaxExtents + kContainerMaxExtents + 1; in WalkManyContainersTest()
323 ASSERT_EQ(kContainerMaxExtents, container->extent_count); in WalkManyContainersTest()
324 for (size_t i = 0; i < kContainerMaxExtents; i++) { in WalkManyContainersTest()
334 … ASSERT_TRUE(allocated_extents[kInlineMaxExtents + kContainerMaxExtents] == container->extents[0]); in WalkManyContainersTest()
421 constexpr size_t kAllocatedExtents = kInlineMaxExtents + kContainerMaxExtents + 1; in WalkExtraExtentsTest()
A Dallocated-extent-iterator-test.cpp135 constexpr size_t kAllocatedExtents = kInlineMaxExtents + kContainerMaxExtents + 1; in MultiNodeTest()
156 } else if (i < kInlineMaxExtents + kContainerMaxExtents) { in MultiNodeTest()
186 constexpr size_t kAllocatedExtents = kInlineMaxExtents + kContainerMaxExtents + 1; in BadInodeNextNodeTest()
259 constexpr size_t kAllocatedExtents = kInlineMaxExtents + kContainerMaxExtents + 1; in BlockIteratorFragmentedTest()
/system/ulib/blobfs/include/blobfs/
A Dformat.h269 constexpr uint32_t kContainerMaxExtents = 6; variable
313 Extent extents[kContainerMaxExtents];

Completed in 9 milliseconds