bintree_node.h

Go to the documentation of this file.

/*
 * Copyright (c) 2010-2018, NVIDIA Corporation
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *   * Redistributions of source code must retain the above copyright
 *     notice, this list of conditions and the following disclaimer.
 *   * Redistributions in binary form must reproduce the above copyright
 *     notice, this list of conditions and the following disclaimer in the
 *     documentation and/or other materials provided with the distribution.
 *   * Neither the name of NVIDIA Corporation nor the
 *     names of its contributors may be used to endorse or promote products
 *     derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#pragma once

#include <cugar/basic/types.h>

namespace cugar {



struct leaf_index_tag {};

struct leaf_range_tag {};

template <typename leaf_type_tag>
struct Bintree_node {};

template <>
struct Bintree_node<leaf_index_tag>
{
    typedef leaf_index_tag node_tag;

    static const uint32 kInvalid = uint32(-1);

    CUGAR_HOST_DEVICE Bintree_node() {}

    CUGAR_HOST_DEVICE Bintree_node(bool child0, bool child1, uint32 index) :
        m_packed_info( (child0 ? 1u : 0u) | (child1 ? 2u : 0u) | (index << 2) ) {}

    CUGAR_HOST_DEVICE uint32 is_leaf() const
    {
        return (m_packed_info & 3u) == 0u;
    }
    CUGAR_HOST_DEVICE uint32 get_child_index() const
    {
        return m_packed_info >> 2u;
    }
    CUGAR_HOST_DEVICE uint32 get_leaf_index() const
    {
        return m_packed_info >> 2u;
    }
    CUGAR_HOST_DEVICE uint32 get_child_count() const
    {
        return ((m_packed_info & 1u) ? 1u : 0u) +
               ((m_packed_info & 2u) ? 1u : 0u);
    }
    CUGAR_HOST_DEVICE uint32 get_child(const uint32 i) const
    {
        return get_child_index() + i;
    }
    CUGAR_HOST_DEVICE bool has_child(const uint32 i) const
    {
        return m_packed_info & (1u << i) ? true : false;
    }
    CUGAR_HOST_DEVICE uint32 get_left() const
    {
        return has_child(0) ? get_child_index() : kInvalid;
    }
    CUGAR_HOST_DEVICE uint32 get_right() const
    {
        return has_child(1) ? get_child_index() + (has_child(0) ? 1u : 0u) : kInvalid;
    }

    uint32 m_packed_info;
};

template <>
struct CUGAR_ALIGN_BEGIN(8) Bintree_node<leaf_range_tag>
{
    typedef leaf_range_tag node_tag;

    static const uint32 kInvalid = uint32(-1);

    CUGAR_HOST_DEVICE Bintree_node() {}

    CUGAR_HOST_DEVICE Bintree_node(bool child0, bool child1, uint32 index, const uint32 range_size = 0) :
        m_packed_info( (child0 ? 1u : 0u) | (child1 ? 2u : 0u) | (index << 2) ), m_range_size(range_size) {}

    CUGAR_HOST_DEVICE Bintree_node(const uint32 leaf_begin, const uint32 leaf_end) :
        m_packed_info( (leaf_begin << 2) ), m_range_size( leaf_end - leaf_begin ) {}

    CUGAR_HOST_DEVICE uint32 is_leaf() const
    {
        return (m_packed_info & 3u) == 0u;
    }
    CUGAR_HOST_DEVICE uint32 get_child_index() const
    {
        return m_packed_info >> 2u;
    }
    CUGAR_HOST_DEVICE uint32 get_leaf_begin() const
    {
        return m_packed_info >> 2u;
    }
    CUGAR_HOST_DEVICE uint32 get_range_size() const
    {
        return m_range_size;
    }
    CUGAR_HOST_DEVICE uint2 get_leaf_range() const
    {
        const uint32 leaf_begin = m_packed_info >> 2u;
        return make_uint2( leaf_begin, leaf_begin + m_range_size );
    }
    CUGAR_HOST_DEVICE uint32 get_leaf_size() const
    {
        return m_range_size;
    }
    CUGAR_HOST_DEVICE uint32 get_child_count() const
    {
        return ((m_packed_info & 1u) ? 1u : 0u) +
               ((m_packed_info & 2u) ? 1u : 0u);
    }
    CUGAR_HOST_DEVICE uint32 get_child(const uint32 i) const
    {
        return get_child_index() + i;
    }
    CUGAR_HOST_DEVICE bool has_child(const uint32 i) const
    {
        return m_packed_info & (1u << i) ? true : false;
    }
    CUGAR_HOST_DEVICE uint32 get_left() const
    {
        return has_child(0) ? get_child_index() : kInvalid;
    }
    CUGAR_HOST_DEVICE uint32 get_right() const
    {
        return has_child(1) ? get_child_index() + (has_child(0) ? 1u : 0u) : kInvalid;
    }

    uint32 m_packed_info;
    uint32 m_range_size;
};
CUGAR_ALIGN_END(8)


} // namespace cugar