Home
last modified time | relevance | path

Searched refs:Node (Results 1 – 6 of 6) sorted by relevance

/kernel/lib/topology/include/lib/
A Dsystem-topology.h23 struct Node { struct
30 Node* parent; argument
31 fbl::Vector<Node*> children; argument
36 typedef const fbl::Vector<Node*>& IterableProcessors;
59 zx_status_t ProcessorByLogicalId(uint16_t id, Node** processor) { in ProcessorByLogicalId()
76 fbl::unique_ptr<Node[]> nodes_;
77 fbl::Vector<Node*> processors_;
81 fbl::Vector<Node*> processors_by_logical_id_;
/kernel/lib/fbl/include/fbl/
A Darena.h59 struct Node : public SinglyLinkedListable<Node*> { struct
60 explicit Node(void* s) in Node() argument
65 SinglyLinkedList<Node*> free_; argument
/kernel/lib/fbl/
A Darena.cpp50 const size_t control_mem_sz = ROUNDUP(count * sizeof(Node), PAGE_SIZE); in Init()
129 control_.Init("control", control_mapping, sizeof(Node)); in Init()
244 Node* node = free_.pop_front(); in Alloc()
264 Node* node = new (reinterpret_cast<void*>(control_.Pop())) Node{addr}; in Free()
A Darena_tests.cpp261 return sizeof(Arena::Node); in control_slot_size()
/kernel/lib/topology/
A Dsystem-topology_test.cpp10 using system_topology::Node;
40 system_topology::Node* node; in test_flat_to_heap_simple()
70 for (Node* processor : graph.processors()) { in test_flat_to_heap_walk_result()
71 Node* current = processor; in test_flat_to_heap_walk_result()
72 Node* next = current->parent; in test_flat_to_heap_walk_result()
76 for (Node* child : next->children) { in test_flat_to_heap_walk_result()
A Dsystem-topology.cpp24 nodes_.reset(new Node[count]{{}}); in Update()
26 Node* node = nullptr; in Update()

Completed in 16 milliseconds