MCPcopy Create free account
hub / github.com/ZDoom/Raze / ConstPoolTree_splitNode

Function ConstPoolTree_splitNode

libraries/asmjit/asmjit/base/constpool.cpp:49–62  ·  view source on GitHub ↗

\internal Remove consecutive horizontal links.

Source from the content-addressed store, hash-verified

47//!
48//! Remove consecutive horizontal links.
49static ASMJIT_INLINE ConstPool::Node* ConstPoolTree_splitNode(ConstPool::Node* node) noexcept {
50 ConstPool::Node* link = node->_link[1];
51 uint32_t level = node->_level;
52
53 if (level != 0 && link && link->_link[1] && link->_link[1]->_level == level) {
54 node->_link[1] = link->_link[0];
55 link->_link[0] = node;
56
57 node = link;
58 node->_level++;
59 }
60
61 return node;
62}
63
64ConstPool::Node* ConstPool::Tree::get(const void* data) noexcept {
65 ConstPool::Node* node = _root;

Callers 1

putMethod · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected