Function insert

src/e9patch/e9alloc.cpp:517–541

* Insert a new allocation or reservation into the interval tree node `root`. */

 * Insert a new allocation or reservation into the interval tree node `root`.
 */
static Node *insert(Node *root, intptr_t lb, intptr_t ub,
    size_t size, uint32_t flags)
{
    if ((intptr_t)size > ub - lb)
        return nullptr;
    if (root == nullptr)
        return node(nullptr, lb, ub, size, flags);

    Node *n = nullptr;
    if (size <= root->gap)
    {
        intptr_t rlb = std::max(lb, root->lb);
        intptr_t rub = std::min(ub, root->ub);
        if (n == nullptr)
            n = insertRightChild(root, rlb, rub, size, flags);
        if (n == nullptr)
            n = insertLeftChild(root, rlb, rub, size, flags);
    }
    if (n == nullptr && ub > root->ub)
        n = insertRightChild(root, std::max(lb, root->ub), ub, size, flags);
    if (n == nullptr && lb < root->lb)
        n = insertLeftChild(root, lb, std::min(ub, root->lb), size, flags);

    return n;
}

/*
 * Verify bounds.