Home
last modified time | relevance | path

Searched refs:LeftOf (Results 1 – 10 of 10) sorted by relevance

/external/deqp-deps/SPIRV-Tools/source/comp/
Dmove_to_front.cpp90 *rank = 1 + SizeOf(LeftOf(node)); in RankFromValue()
92 if (IsRightChild(node)) *rank += 1 + SizeOf(LeftOf(ParentOf(node))); in RankFromValue()
174 const uint32_t left_subtree_num_nodes = SizeOf(LeftOf(node)); in ValueFromRank()
193 node = LeftOf(node); in ValueFromRank()
256 iter = right_child ? RightOf(iter) : LeftOf(iter); in InsertNode()
309 if (LeftOf(node) && RightOf(node)) { in RemoveNode()
313 const uint32_t scapegoat = SizeOf(LeftOf(node)) >= SizeOf(RightOf(node)) in RemoveNode()
314 ? RightestDescendantOf(LeftOf(node)) in RemoveNode()
325 assert(!RightOf(node) || !LeftOf(node)); in RemoveNode()
328 uint32_t child = RightOf(node) ? RightOf(node) : LeftOf(node); in RemoveNode()
[all …]
Dhuffman_codec.h133 assert(!LeftOf(0) && !RightOf(0)); in HuffmanCodec()
188 if (!RightOf(node) && !LeftOf(node)) {
193 if (LeftOf(node)) queue.emplace(LeftOf(node), code + "0");
229 if (!RightOf(node) && !LeftOf(node)) { in DecodeFromStream()
240 node = LeftOf(node); in DecodeFromStream()
252 uint32_t LeftOf(uint32_t node) const { return nodes_.at(node).left; } in LeftOf() function
303 if (!RightOf(node) && !LeftOf(node)) { in PrintTreeInternal()
314 if (LeftOf(node)) { in PrintTreeInternal()
318 << WeightOf(LeftOf(node)); in PrintTreeInternal()
320 PrintTreeInternal(out, LeftOf(node), depth + 1); in PrintTreeInternal()
[all …]
Dmove_to_front.h135 uint32_t LeftOf(uint32_t node) const { return nodes_.at(node).left; } in LeftOf() function
200 return LeftOf(ParentOf(node)) == node; in IsLeftChild()
212 return !ParentOf(node) && !LeftOf(node) && !RightOf(node); in IsOrphan()
223 return int(HeightOf(RightOf(node))) - int(HeightOf(LeftOf(node))); in BalanceOf()
235 node = LeftOf(node); in LeftestDescendantOf()
/external/swiftshader/third_party/SPIRV-Tools/source/comp/
Dmove_to_front.cpp90 *rank = 1 + SizeOf(LeftOf(node)); in RankFromValue()
92 if (IsRightChild(node)) *rank += 1 + SizeOf(LeftOf(ParentOf(node))); in RankFromValue()
174 const uint32_t left_subtree_num_nodes = SizeOf(LeftOf(node)); in ValueFromRank()
193 node = LeftOf(node); in ValueFromRank()
256 iter = right_child ? RightOf(iter) : LeftOf(iter); in InsertNode()
309 if (LeftOf(node) && RightOf(node)) { in RemoveNode()
313 const uint32_t scapegoat = SizeOf(LeftOf(node)) >= SizeOf(RightOf(node)) in RemoveNode()
314 ? RightestDescendantOf(LeftOf(node)) in RemoveNode()
325 assert(!RightOf(node) || !LeftOf(node)); in RemoveNode()
328 uint32_t child = RightOf(node) ? RightOf(node) : LeftOf(node); in RemoveNode()
[all …]
Dhuffman_codec.h133 assert(!LeftOf(0) && !RightOf(0)); in HuffmanCodec()
188 if (!RightOf(node) && !LeftOf(node)) {
193 if (LeftOf(node)) queue.emplace(LeftOf(node), code + "0");
229 if (!RightOf(node) && !LeftOf(node)) { in DecodeFromStream()
240 node = LeftOf(node); in DecodeFromStream()
252 uint32_t LeftOf(uint32_t node) const { return nodes_.at(node).left; } in LeftOf() function
303 if (!RightOf(node) && !LeftOf(node)) { in PrintTreeInternal()
314 if (LeftOf(node)) { in PrintTreeInternal()
318 << WeightOf(LeftOf(node)); in PrintTreeInternal()
320 PrintTreeInternal(out, LeftOf(node), depth + 1); in PrintTreeInternal()
[all …]
Dmove_to_front.h135 uint32_t LeftOf(uint32_t node) const { return nodes_.at(node).left; } in LeftOf() function
200 return LeftOf(ParentOf(node)) == node; in IsLeftChild()
212 return !ParentOf(node) && !LeftOf(node) && !RightOf(node); in IsOrphan()
223 return int(HeightOf(RightOf(node))) - int(HeightOf(LeftOf(node))); in BalanceOf()
235 node = LeftOf(node); in LeftestDescendantOf()
/external/skqp/src/core/
DSkTDPQueue.h123 static int LeftOf(int x) { SkASSERT(x >= 0); return 2 * x + 1; } in LeftOf() function
160 int child = LeftOf(index); in percolateDownIfNecessary()
/external/skia/src/core/
DSkTDPQueue.h123 static int LeftOf(int x) { SkASSERT(x >= 0); return 2 * x + 1; } in LeftOf() function
160 int child = LeftOf(index); in percolateDownIfNecessary()
/external/deqp-deps/SPIRV-Tools/test/
Dmove_to_front_test.cpp101 if (LeftOf(node)) { in PrintTreeInternal()
103 PrintTreeInternal(out, LeftOf(node), depth + 1, print_timestamp); in PrintTreeInternal()
/external/swiftshader/third_party/SPIRV-Tools/test/
Dmove_to_front_test.cpp101 if (LeftOf(node)) { in PrintTreeInternal()
103 PrintTreeInternal(out, LeftOf(node), depth + 1, print_timestamp); in PrintTreeInternal()