Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 112) sorted by relevance

12345

/system/ulib/async-testutils/
A Dtest_loop_dispatcher.cpp39 list_node_t* node; in InsertTask() local
40 for (node = task_list->prev; node != task_list; node = node->prev) { in InsertTask()
96 if (!list_in_list(node)) { in CancelWait()
112 list_delete(node); in CancelWait()
134 list_delete(node); in CancelTask()
152 if (!node) { in GetNextTaskDueTime()
181 if (node) { in DispatchNextDueTask()
182 list_delete(node); in DispatchNextDueTask()
221 list_node_t* node; in ExtractDueTasks() local
226 tail = node; in ExtractDueTasks()
[all …]
/system/ulib/sync/include/lib/sync/internal/
A Dcondition-template.h106 Waiter node; in timedwait() local
111 c->head = &node; in timedwait()
113 c->tail = &node; in timedwait()
115 node.next->prev = &node; in timedwait()
149 if (c->head == &node) { in timedwait()
152 node.prev->next = node.next; in timedwait()
158 node.next->prev = node.prev; in timedwait()
172 if (node.notify) { in timedwait()
204 if (!node.prev) { in timedwait()
207 if (!node.next) { in timedwait()
[all …]
/system/utest/fbl/include/fbl/tests/intrusive_containers/
A Dintrusive_wavl_tree_checker.h25 ASSERT_TRUE(valid_sentinel_ptr(node), ""); in VerifyParentBackLinks()
26 const auto& ns = NodeTraits::node_state(*node); in VerifyParentBackLinks()
86 RawPtrType node = tree.root_; in SanityCheck() local
90 while (valid_sentinel_ptr(node)) { in SanityCheck()
93 auto& ns = NodeTraits::node_state(*node); in SanityCheck()
99 node = ns.left_; in SanityCheck()
113 while (valid_sentinel_ptr(node)) { in SanityCheck()
130 const auto& ns = NodeTraits::node_state(*node); in SanityCheck()
133 node = ns.right_; in SanityCheck()
144 node = ns.left_; in SanityCheck()
[all …]
/system/utest/util/
A Dlistnode.cpp12 list_node_t node; member
19 list_for_every_entry(list, entry, list_elem_t, node) { in expect_list_sorted()
21 EXPECT_EQ(list_next_wrap_type(list, &entry->node, list_elem_t, node)->value, in expect_list_sorted()
23 EXPECT_EQ(list_prev_wrap_type(list, &entry->node, list_elem_t, node)->value, in expect_list_sorted()
83 list_add_tail(&list, &first_set[i].node); in element_add_remove()
90 list_add_head(&list, &second_set[0].node); in element_add_remove()
91 list_add_tail(&list, &second_set[1].node); in element_add_remove()
99 list_node_t* node = NULL; in element_add_remove() local
101 list_for_every_safe(&list, node, to_del) { in element_add_remove()
102 list_delete(node); in element_add_remove()
[all …]
/system/ulib/blobfs/test/
A Dblob-cache-test.cpp90 node->SetCache(false); in NullTest()
102 ASSERT_EQ(ZX_OK, cache.Add(node)); in AddLookupEvictTest()
112 ASSERT_EQ(ZX_OK, cache.Evict(node)); in AddLookupEvictTest()
131 node->SetCache(false); in StopCachingTest()
173 node->SetCache(true); in EvictWhileCachingTest()
203 node_ptr = node.get(); in CacheAfterRecycleTest()
221 fbl::RefPtr<CacheNode> node; in CacheAfterRecycleTest() local
267 ASSERT_EQ(ZX_OK, cache.Add(node)); in ResetOpenTest()
348 node->SetHighMemory(); in CachePolicyEvictImmediatelyTest()
370 node->SetHighMemory(); in CachePolicyNeverEvictTest()
[all …]
A Dnode-populator-test.cpp47 auto on_node = [&](const ReservedNode& node) { in NullTest() argument
48 ZX_DEBUG_ASSERT(node_index == node.index()); in NullTest()
81 auto on_node = [&](const ReservedNode& node) { in WalkOneTest() argument
82 ZX_DEBUG_ASSERT(node_index == node.index()); in WalkOneTest()
142 auto on_node = [&](const ReservedNode& node) { in WalkAllInlineExtentsTest() argument
143 ZX_DEBUG_ASSERT(allocated_nodes[nodes_visited] == node.index()); in WalkAllInlineExtentsTest()
206 auto on_node = [&](const ReservedNode& node) { in WalkManyNodesTest() argument
207 ZX_DEBUG_ASSERT(allocated_nodes[nodes_visited] == node.index()); in WalkManyNodesTest()
289 auto on_node = [&](const ReservedNode& node) { in WalkManyContainersTest() argument
378 auto on_node = [&](const ReservedNode& node) { in WalkExtraNodesTest() argument
[all …]
/system/ulib/lockdep/include/lockdep/
A Dlock_class_state.h272 node->index = index; in Connect()
273 node->least = index; in Connect()
274 Push(node); in Connect()
282 node->least = fbl::min(node->least, related_node->least); in Connect()
284 node->least = fbl::min(node->least, related_node->index); in Connect()
290 if (node->index == node->least) { in Connect()
311 node->next = stack; in Push()
312 stack = node; in Push()
319 stack = node->next; in Pop()
321 return node; in Pop()
[all …]
/system/uapp/lsusb/
A Dlsusb.c300 if (node->depth >= 0) return node->depth; in get_node_depth()
316 while (node) { in do_list_tree()
318 do_list_device(node->svc, -1, false, node->devname, node->depth, max_depth); in do_list_tree()
321 node = node->next; in do_list_tree()
375 strlcpy(node->devname, de->d_name, sizeof(node->devname)); in list_tree()
381 tail = node; in list_tree()
389 while (node) { in list_tree()
393 node = node->next; in list_tree()
406 node = devices; in list_tree()
407 while (node) { in list_tree()
[all …]
/system/ulib/async-loop/
A Dloop.c68 list_node_t node; member
210 list_node_t* node; in async_loop_shutdown() local
350 list_node_t* node; in async_loop_dispatch_tasks() local
357 tail = node; in async_loop_dispatch_tasks()
521 if (!list_in_list(node)) { in async_loop_cancel_wait()
532 list_delete(node); in async_loop_cancel_wait()
577 if (!list_in_list(node)) { in async_loop_cancel_task()
588 list_delete(node); in async_loop_cancel_task()
683 list_delete(node); in async_loop_unbind_exception_port()
709 list_node_t* node; in async_loop_insert_task_locked() local
[all …]
/system/ulib/unittest/
A Dcrash-list.cpp20 list_node_t node; member
77 list_add_head(&crash_list->should_crash_procs, &crash_proc->node); in crash_list_register()
91 list_for_every_entry (&crash_list->should_crash_procs, cur, crash_proc_t, node) { in crash_list_lookup_koid()
112 list_for_every_entry_safe (&crash_list->should_crash_procs, cur, tmp, crash_proc_t, node) { in crash_list_delete_koid()
115 list_delete(&cur->node); in crash_list_delete_koid()
134 list_for_every_entry_safe (&crash_list->should_crash_procs, cur, tmp, crash_proc_t, node) { in crash_list_delete()
137 list_delete(&cur->node); in crash_list_delete()
/system/ulib/fbl/include/fbl/
A Dintrusive_wavl_tree.h307 RawPtrType node = root_;
633 iterator_impl(typename PtrTraits::RawPtrType node) : node_(node) { }
1015 RawPtrType node = root_;
1033 node = ns.right_;
1038 found = node;
1044 node = NodeTraits::node_state(*node).left_;
1170 ZX_DEBUG_ASSERT(node != nullptr);
1267 if (parent_ns.left_ == node)
1331 RawPtrType X = node;
1473 node = parent;
[all …]
A Dintrusive_double_list.h528 iterator_impl(const typename PtrTraits::RawPtrType node)
529 : node_(const_cast<typename PtrTraits::RawPtrType>(node)) { }
588 PtrType internal_erase(RawPtrType node) {
589 if (!node || internal::is_sentinel_ptr(node))
592 auto& node_ns = NodeTraits::node_state(*node);
612 return PtrTraits::Reclaim(node);
620 auto& node_ns = NodeTraits::node_state(node);
626 ZX_DEBUG_ASSERT(head_ == &node);
628 ZX_DEBUG_ASSERT(&node == node_ns.prev_);
636 return PtrTraits::Reclaim(&node);
[all …]
/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
239 for (node = (list)->next, temp_node = (node)->next; node != (list); \
240 node = temp_node, temp_node = (node)->next)
261 const list_node_t* node = list; in list_length() local
262 list_for_every(list, node) { in list_length()
/system/utest/fs-vnode/
A Dpseudo-dir-tests.cpp81 fbl::RefPtr<fs::Vnode> node; in TestPseudoDir() local
82 EXPECT_EQ(ZX_OK, dir->Lookup(&node, "subdir")); in TestPseudoDir()
83 EXPECT_EQ(subdir.get(), node.get()); in TestPseudoDir()
84 EXPECT_EQ(ZX_OK, dir->Lookup(&node, "file1")); in TestPseudoDir()
85 EXPECT_EQ(file1.get(), node.get()); in TestPseudoDir()
86 EXPECT_EQ(ZX_ERR_NOT_FOUND, dir->Lookup(&node, "file2")); in TestPseudoDir()
87 EXPECT_EQ(ZX_OK, dir->Lookup(&node, "file2b")); in TestPseudoDir()
88 EXPECT_EQ(file2.get(), node.get()); in TestPseudoDir()
136 EXPECT_EQ(ZX_ERR_NOT_FOUND, dir->Lookup(&node, "file1")); in TestPseudoDir()
/system/uapp/psutils/
A Dtop.c31 struct list_node node; member
122 list_for_every_entry (&thread_list, temp, thread_info_t, node) { in thread_callback()
139 list_add_tail(&thread_list, &new_entry->node); in thread_callback()
152 while ((e = list_remove_head_type(&thread_list, thread_info_t, node))) { in sort_threads()
156 list_for_every_entry (&new_list, t, thread_info_t, node) { in sort_threads()
159 list_add_before(&t->node, &e->node); in sort_threads()
168 list_add_tail(&new_list, &e->node); in sort_threads()
180 list_for_every_entry (&thread_list, e, thread_info_t, node) { in print_threads()
319 list_for_every_entry (&thread_list, e, thread_info_t, node) { in main()
339 list_for_every_entry_safe (&thread_list, e, temp, thread_info_t, node) { in main()
[all …]
/system/ulib/blobfs/
A Dnode-reserver.cpp53 ReservedNode::ReservedNode(NodeReserver* reserver, uint32_t node) in ReservedNode() argument
54 : reserver_(reserver), node_(node) { in ReservedNode()
55 reserver_->Reserve(node); in ReservedNode()
A Dblob-cache.cpp25 ForAllOpenNodes([this](fbl::RefPtr<CacheNode> node) { in Reset() argument
28 __UNUSED zx_status_t status = Evict(node); in Reset()
38 CacheNode* node = nullptr; in ResetLocked() local
39 while ((node = closed_hash_.pop_front()) != nullptr) { in ResetLocked()
40 delete node; in ResetLocked()
A Drules.mk26 $(LOCAL_DIR)/node-reserver.cpp \
34 $(LOCAL_DIR)/cache-node.cpp \
35 $(LOCAL_DIR)/iterator/node-populator.cpp \
105 $(TEST_DIR)/node-populator-test.cpp \
106 $(TEST_DIR)/node-reserver-test.cpp \
/system/ulib/blobfs/iterator/
A Dnode-populator.cpp57 const ReservedNode& node = nodes_[node_count + 1]; in Walk() local
58 uint32_t next = node.index(); in Walk()
60 allocator_->MarkContainerNodeAllocated(node, previous); in Walk()
/system/dev/bus/platform/
A Dplatform-i2c.cpp78 while ((txn = list_remove_head_type(&queued_txns_, I2cTxn, node)) != nullptr) { in I2cThread()
106 list_add_tail(&free_txns_, &txn->node); in I2cThread()
134 I2cTxn* txn = list_remove_head_type(&free_txns_, I2cTxn, node); in Transact()
158 list_add_tail(&free_txns_, &txn->node); in Transact()
164 list_add_tail(&queued_txns_, &txn->node); in Transact()
/system/core/virtcon/
A Dvc-input.cpp125 list_for_every_entry (&g_vc_list, vc, vc_t, node) { in vc_set_active()
149 list_for_every_entry (&g_vc_list, vc, vc_t, node) { in vc_show_active()
180 list_for_every_entry (&g_vc_list, vc, vc_t, node) { in vc_status_update()
251 list_add_tail(&g_vc_list, &vc->node); in vc_create()
266 list_delete(&vc->node); in vc_destroy()
/system/fidl/fuchsia-net/
A Dsocket.fidl31 // missing node name or service name
37 // no address found for node name
70 2: GetAddrInfo(string:256? node, string:256? service, AddrInfoHints? hints)
/system/core/devmgr/devmgr/
A Dmetadata.h15 fbl::DoublyLinkedListNodeState<fbl::unique_ptr<Metadata>> node; member
19 return obj.node; in node_state()
/system/ulib/fs/
A Dpseudo-dir.cpp39 *out = it->node(); in Lookup()
74 if ((r = it->node()->Getattr(&attr)) != ZX_OK) { in Readdir()
139 PseudoDir::Entry::Entry(uint64_t id, fbl::String name, fbl::RefPtr<fs::Vnode> node) in Entry() argument
140 : id_(id), name_(std::move(name)), node_(std::move(node)) { in Entry()
/system/dev/lib/usb/
A Dusb-request.c348 list_node_t* node; in usb_request_pool_get() local
349 list_for_every(&pool->free_reqs, node) { in usb_request_pool_get()
350 req = (usb_request_t*)((uintptr_t)node - pool->node_offset); in usb_request_pool_get()
357 list_delete(node); in usb_request_pool_get()
368 list_node_t* node; in usb_request_pool_release() local
369 while ((node = list_remove_tail(&pool->free_reqs)) != NULL) { in usb_request_pool_release()
370 req = (usb_request_t*)((uintptr_t)node - pool->node_offset); in usb_request_pool_release()
383 list_add_head(list, &req_int->node); in usb_req_list_add_head()
393 list_add_tail(list, &req_int->node); in usb_req_list_add_tail()
398 usb_req_internal_t* req_int = list_remove_head_type(list, usb_req_internal_t, node); in usb_req_list_remove_head()

Completed in 82 milliseconds

12345