Home
last modified time | relevance | path

Searched refs:node_ids (Results 1 - 2 of 2) sorted by relevance

/third_party/skia/third_party/externals/dawn/src/tests/unittests/
H A DLinkedListTests.cpp59 // tail to head, as determined by |forward|), we get back |node_ids|,
63 const int* node_ids, in ExpectListContentsForDirection()
70 EXPECT_EQ(node_ids[index_of_id], node->value()->id()); in ExpectListContentsForDirection()
76 void ExpectListContents(const LinkedList<Node>& list, int num_nodes, const int* node_ids) { in ExpectListContents() argument
79 ExpectListContentsForDirection(list, num_nodes, node_ids, true); in ExpectListContents()
83 ExpectListContentsForDirection(list, num_nodes, node_ids, false); in ExpectListContents()
61 ExpectListContentsForDirection(const LinkedList<Node>& list, int num_nodes, const int* node_ids, bool forward) ExpectListContentsForDirection() argument
/third_party/mesa3d/src/amd/vulkan/
H A Dradv_acceleration_structure.c579 optimize_bvh(const char *base_ptr, uint32_t *node_ids, uint32_t node_count) in optimize_bvh() argument
592 compute_bounds(base_ptr, node_ids[i], node_bounds); in optimize_bvh()
605 compute_bounds(base_ptr, node_ids[i], node_bounds); in optimize_bvh()
620 entries[i].node_id = node_ids[i]; in optimize_bvh()
625 node_ids[i] = entries[i].node_id; in optimize_bvh()

Completed in 5 milliseconds