/*********************************************************************
 *                
 * Copyright (C) 2002,  Karlsruhe University
 *                
 * File path:     generic/memregion.h
 * Description:   memory region management
 *                
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. 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.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 THE AUTHOR OR CONTRIBUTORS 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.
 *                
 * $Id: memregion.h,v 1.5 2003/10/27 15:57:42 joshua Exp $
 *                
 ********************************************************************/
#ifndef __GENERIC__MEMREGION_H__
#define __GENERIC__MEMREGION_H__

/**
 * mem_region_t:
 */
class mem_region_t
{
public:
    bool is_adjacent(const mem_region_t & reg);
    bool is_intersection(const mem_region_t & reg);
    bool is_empty();
    void set_empty();
    void operator += (const mem_region_t & reg);
    void set(addr_t low, addr_t high);
    word_t get_size() 
	{ return is_empty() ? 0 : (word_t)high-(word_t)low; }

public:
    addr_t	low;
    addr_t	high;
};


INLINE void mem_region_t::operator += (const mem_region_t & reg)
{
    if (this->low > reg.low) this->low = reg.low;
    if (this->high < reg.high) this->high = reg.high;
}

INLINE bool mem_region_t::is_adjacent(const mem_region_t & reg)
{
    return ((this->high == reg.low) ||
	    (this->low == reg.high));
}

INLINE bool mem_region_t::is_intersection(const mem_region_t & reg)
{
    return ((reg.low >= this->low) && (reg.low < this->high)) ||
	   ((reg.high > this->low) && (reg.high <= this->high)) ||
	   ((reg.low <= this->low) && (reg.high >= this->high));
}

INLINE bool mem_region_t::is_empty()
{
    return high == 0;
}
 
INLINE void mem_region_t::set_empty()
{
    high = 0; 
}

INLINE void mem_region_t::set(addr_t low, addr_t high)
{ 
    this->low = low; 
    this->high = high; 
}


#endif /* !__GENERIC__MEMREGION_H__ */