Lines Matching refs:graph
35 system_topology::Graph graph; in test_flat_to_heap_simple() local
36 ASSERT_EQ(ZX_OK, graph.Update(topo.nodes, topo.node_count)); in test_flat_to_heap_simple()
37 ASSERT_EQ(3, graph.processors().size()); in test_flat_to_heap_simple()
41 ASSERT_EQ(ZX_OK, graph.ProcessorByLogicalId(1, &node)); in test_flat_to_heap_simple()
54 system_topology::Graph graph; in test_flat_to_heap_complex() local
55 ASSERT_EQ(ZX_OK, graph.Update(topo.nodes, topo.node_count)); in test_flat_to_heap_complex()
56 ASSERT_EQ(32, graph.processors().size()); in test_flat_to_heap_complex()
65 system_topology::Graph graph; in test_flat_to_heap_walk_result() local
66 ASSERT_EQ(ZX_OK, graph.Update(topo.nodes, topo.node_count)); in test_flat_to_heap_walk_result()
67 ASSERT_EQ(32, graph.processors().size()); in test_flat_to_heap_walk_result()
70 for (Node* processor : graph.processors()) { in test_flat_to_heap_walk_result()
97 system_topology::Graph graph; in test_validate_processor_not_leaf() local
98 ASSERT_EQ(ZX_ERR_INVALID_ARGS, graph.Update(topo.nodes, topo.node_count)); in test_validate_processor_not_leaf()
110 system_topology::Graph graph; in test_validate_leaf_not_processor() local
111 ASSERT_EQ(ZX_ERR_INVALID_ARGS, graph.Update(topo.nodes, topo.node_count)); in test_validate_leaf_not_processor()
123 system_topology::Graph graph; in test_validate_cycle() local
124 ASSERT_EQ(ZX_ERR_INVALID_ARGS, graph.Update(topo.nodes, topo.node_count)); in test_validate_cycle()
138 system_topology::Graph graph; in test_validate_cycle_shared_parent() local
139 ASSERT_EQ(ZX_ERR_INVALID_ARGS, graph.Update(topo.nodes, topo.node_count)); in test_validate_cycle_shared_parent()
155 system_topology::Graph graph; in test_validate_hierarchical_storage() local
156 ASSERT_EQ(ZX_ERR_INVALID_ARGS, graph.Update(topo.nodes, topo.node_count)); in test_validate_hierarchical_storage()