Home
last modified time | relevance | path

Searched defs:node (Results 1 – 25 of 81) sorted by relevance

1234

/system/ulib/blobfs/test/
A Dblob-cache-test.cpp88 fbl::RefPtr<TestNode> node = fbl::AdoptRef(new TestNode(digest, &cache)); in NullTest() local
101 fbl::RefPtr<TestNode> node = fbl::AdoptRef(new TestNode(digest, &cache)); in AddLookupEvictTest() local
128 fbl::RefPtr<TestNode> node = fbl::AdoptRef(new TestNode(digest, &cache)); in StopCachingTest() local
148 fbl::RefPtr<TestNode> node = fbl::AdoptRef(new TestNode(digest, &cache)); in EvictNoCacheTest() local
169 fbl::RefPtr<TestNode> node = fbl::AdoptRef(new TestNode(digest, &cache)); in EvictWhileCachingTest() local
202 fbl::RefPtr<TestNode> node = fbl::AdoptRef(new TestNode(digest, &cache)); in CacheAfterRecycleTest() local
221 fbl::RefPtr<CacheNode> node; in CacheAfterRecycleTest() local
248 fbl::RefPtr<TestNode> node = fbl::AdoptRef(new TestNode(digest, &cache)); in ResetClosedTest() local
266 fbl::RefPtr<TestNode> node = fbl::AdoptRef(new TestNode(digest, &cache)); in ResetOpenTest() local
355 auto node = fbl::RefPtr<TestNode>::Downcast(std::move(cache_node)); in CachePolicyEvictImmediatelyTest() local
[all …]
A Dnode-populator-test.cpp47 auto on_node = [&](const ReservedNode& node) { in NullTest()
81 auto on_node = [&](const ReservedNode& node) { in WalkOneTest()
142 auto on_node = [&](const ReservedNode& node) { in WalkAllInlineExtentsTest()
206 auto on_node = [&](const ReservedNode& node) { in WalkManyNodesTest()
289 auto on_node = [&](const ReservedNode& node) { in WalkManyContainersTest()
378 auto on_node = [&](const ReservedNode& node) { in WalkExtraNodesTest()
454 auto on_node = [&](const ReservedNode& node) { in WalkExtraExtentsTest()
A Dnode-reserver-test.cpp125 ReservedNode node(&reserver, 0); in LowerBoundAutoResetTest() local
A Dallocator-test.cpp39 std::optional<ReservedNode> node = allocator->ReserveNode(); in SingleTest() local
56 ReservedNode& node = *maybe_node; in SingleCollisionTest() local
/system/ulib/async-testutils/
A Dtest_loop_dispatcher.cpp26 inline async_wait_t* NodeToWait(list_node_t* node) { in NodeToWait()
34 inline async_task_t* NodeToTask(list_node_t* node) { in NodeToTask()
39 list_node_t* node; in InsertTask() local
95 list_node_t* node = WaitToNode(wait); in CancelWait() local
130 list_node_t* node = TaskToNode(task); in CancelTask() local
149 list_node_t* node = list_is_empty(&due_list_) ? in GetNextTaskDueTime() local
180 list_node_t* node = list_peek_head(&due_list_); in DispatchNextDueTask() local
221 list_node_t* node; in ExtractDueTasks() local
240 list_node_t* node; in Shutdown() local
/system/utest/fbl/include/fbl/tests/intrusive_containers/
A Dintrusive_wavl_tree_checker.h21 typename TreeType::RawPtrType node) { in VerifyParentBackLinks()
86 RawPtrType node = tree.root_; in SanityCheck() local
/system/ulib/async-loop/
A Dloop.c68 list_node_t node; member
127 static inline async_wait_t* node_to_wait(list_node_t* node) { in node_to_wait()
135 static inline async_task_t* node_to_task(list_node_t* node) { in node_to_task()
143 static inline async_exception_t* node_to_exception(list_node_t* node) { in node_to_exception()
210 list_node_t* node; in async_loop_shutdown() local
350 list_node_t* node; in async_loop_dispatch_tasks() local
520 list_node_t* node = wait_to_node(wait); in async_loop_cancel_wait() local
576 list_node_t* node = task_to_node(task); in async_loop_cancel_task() local
672 list_node_t* node = exception_to_node(exception); in async_loop_unbind_exception_port() local
709 list_node_t* node; in async_loop_insert_task_locked() local
/system/utest/util/
A Dlistnode.cpp12 list_node_t node; member
99 list_node_t* node = NULL; in element_add_remove() local
/system/uapp/lsusb/
A Dlsusb.c299 static int get_node_depth(struct device_node* node, struct device_node* devices) { in get_node_depth()
315 struct device_node* node = devices; in do_list_tree() local
353 struct device_node* node = (struct device_node *)malloc(sizeof(struct device_node)); in list_tree() local
388 struct device_node* node = devices; in list_tree() local
/system/ulib/blobfs/
A Dallocator.cpp182 std::optional<ReservedNode> node = ReserveNode(); in ReserveNodes() local
205 std::optional<ReservedNode> node(ReservedNode(this, node_index)); in ReserveNode() local
214 void Allocator::MarkInodeAllocated(const ReservedNode& node) { in MarkInodeAllocated()
220 void Allocator::MarkContainerNodeAllocated(const ReservedNode& node, uint32_t previous_node) { in MarkContainerNodeAllocated()
A Dblob-cache.cpp25 ForAllOpenNodes([this](fbl::RefPtr<CacheNode> node) { in Reset()
38 CacheNode* node = nullptr; in ResetLocked() local
A Dnode-reserver.cpp53 ReservedNode::ReservedNode(NodeReserver* reserver, uint32_t node) in ReservedNode()
/system/dev/gpio/pl061/include/gpio/pl061/
A Dpl061.h15 list_node_t node; member
/system/dev/usb/usb-composite/
A Dusb-interface.h25 list_node_t node; member
/system/dev/block/zxcrypt/
A Dextra.h26 list_node_t node; member
/system/dev/lib/usb/include/usb/
A Dusb-request.h33 list_node_t node; member
/system/dev/nand/nandpart/test/
A Daml-bad-block-test.cpp179 auto node = fbl::make_unique<TableNode>(op->rw.offset_nand + i, std::move(bad_blocks), in MockQueue() local
353 const auto it = table_entries.find_if([](const TableNode& node) { in MarkBlockBadTest()
388 const auto it = table_entries.find_if([](const TableNode& node) { in FindBadBlockLastPageInvalidTest()
471 const auto it = table_entries.find_if([](const TableNode& node) { in MarkBlockBadFullBlockTest()
/system/dev/bus/platform/
A Dplatform-i2c.h32 list_node_t node; member
/system/ulib/blobfs/iterator/
A Dnode-populator.cpp57 const ReservedNode& node = nodes_[node_count + 1]; in Walk() local
/system/core/devmgr/devmgr/
A Dmetadata.h15 fbl::DoublyLinkedListNodeState<fbl::unique_ptr<Metadata>> node; member
/system/dev/display/display/
A Dimage.h83 image_node_t node = { variable
/system/dev/nand/nand/
A Dnand.h34 list_node_t node; member
/system/public/zircon/
A Dlistnode.h234 #define list_for_every(list, node) for (node = (list)->next; node != (list); node = node->next) argument
238 #define list_for_every_safe(list, node, temp_node) \ argument
261 const list_node_t* node = list; in list_length() local
/system/ulib/fs/include/fs/
A Dpseudo-dir.h78 const fbl::RefPtr<fs::Vnode>& node() const { return node_; } in node() function
/system/utest/fs-vnode/
A Dpseudo-dir-tests.cpp81 fbl::RefPtr<fs::Vnode> node; in TestPseudoDir() local

Completed in 704 milliseconds

1234