2006-11-23 07:42:57 +01:00
|
|
|
/*
|
2012-09-19 12:15:44 +02:00
|
|
|
* Copyright (c) 2012 ARM Limited
|
|
|
|
* All rights reserved
|
|
|
|
*
|
|
|
|
* The license below extends only to copyright in the software and shall
|
|
|
|
* not be construed as granting a license to any other intellectual
|
|
|
|
* property including but not limited to intellectual property relating
|
|
|
|
* to a hardware implementation of the functionality of the software
|
|
|
|
* licensed hereunder. You may use the software subject to the license
|
|
|
|
* terms below provided that you ensure that this notice is replicated
|
|
|
|
* unmodified and in its entirety in all distributions of the software,
|
|
|
|
* modified or unmodified, in source code or in binary form.
|
|
|
|
*
|
2006-11-23 07:42:57 +01:00
|
|
|
* Copyright (c) 2006 The Regents of The University of Michigan
|
|
|
|
* 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 the copyright holders 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 THE COPYRIGHT
|
|
|
|
* OWNER 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.
|
|
|
|
*
|
|
|
|
* Authors: Ali Saidi
|
2012-09-19 12:15:44 +02:00
|
|
|
* Andreas Hansson
|
2006-11-23 07:42:57 +01:00
|
|
|
*/
|
|
|
|
|
2012-09-19 12:15:44 +02:00
|
|
|
#ifndef __BASE_ADDR_RANGE_MAP_HH__
|
|
|
|
#define __BASE_ADDR_RANGE_MAP_HH__
|
2006-11-23 07:42:57 +01:00
|
|
|
|
|
|
|
#include <map>
|
2012-03-19 11:36:09 +01:00
|
|
|
#include <utility>
|
2006-11-23 07:42:57 +01:00
|
|
|
|
2012-09-19 12:15:44 +02:00
|
|
|
#include "base/addr_range.hh"
|
2011-04-15 19:44:06 +02:00
|
|
|
|
2012-03-26 11:37:00 +02:00
|
|
|
/**
|
2012-09-19 12:15:44 +02:00
|
|
|
* The AddrRangeMap uses an STL map to implement an interval tree for
|
|
|
|
* address decoding. The value stored is a template type and can be
|
|
|
|
* e.g. a port identifier, or a pointer.
|
2012-03-26 11:37:00 +02:00
|
|
|
*/
|
2012-09-19 12:15:44 +02:00
|
|
|
template <typename V>
|
|
|
|
class AddrRangeMap
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
private:
|
2012-09-19 12:15:44 +02:00
|
|
|
typedef std::map<AddrRange, V> RangeMap;
|
2006-11-23 07:42:57 +01:00
|
|
|
RangeMap tree;
|
|
|
|
|
|
|
|
public:
|
|
|
|
typedef typename RangeMap::iterator iterator;
|
2012-03-26 11:37:00 +02:00
|
|
|
typedef typename RangeMap::const_iterator const_iterator;
|
2006-11-23 07:42:57 +01:00
|
|
|
|
2012-03-26 11:37:00 +02:00
|
|
|
const_iterator
|
2012-09-19 12:15:44 +02:00
|
|
|
find(const AddrRange &r) const
|
2012-03-26 11:37:00 +02:00
|
|
|
{
|
2013-01-07 19:05:38 +01:00
|
|
|
if (tree.empty())
|
|
|
|
return tree.end();
|
2006-11-23 07:42:57 +01:00
|
|
|
|
2013-01-07 19:05:38 +01:00
|
|
|
const_iterator i = tree.upper_bound(r);
|
2006-11-23 07:42:57 +01:00
|
|
|
|
2006-12-12 23:55:27 +01:00
|
|
|
if (i == tree.begin()) {
|
2013-01-07 19:05:38 +01:00
|
|
|
if (i->first.intersects(r)) {
|
2006-12-12 23:55:27 +01:00
|
|
|
return i;
|
2013-01-07 19:05:38 +01:00
|
|
|
} else {
|
2006-12-12 23:55:27 +01:00
|
|
|
return tree.end();
|
2013-01-07 19:05:38 +01:00
|
|
|
}
|
2006-12-12 23:55:27 +01:00
|
|
|
}
|
2006-11-23 07:42:57 +01:00
|
|
|
|
2012-03-26 11:37:00 +02:00
|
|
|
--i;
|
2006-11-23 07:42:57 +01:00
|
|
|
|
2013-01-07 19:05:38 +01:00
|
|
|
if (i->first.intersects(r))
|
2006-11-23 07:42:57 +01:00
|
|
|
return i;
|
|
|
|
|
2013-01-07 19:05:38 +01:00
|
|
|
// if we are looking at an interleaved range, also step
|
|
|
|
// backwards through the ranges while we are looking at ranges
|
|
|
|
// that are part of the same contigous chunk
|
|
|
|
if (i->first.interleaved()) {
|
|
|
|
AddrRange orig_range = i->first;
|
|
|
|
|
|
|
|
while (i != tree.begin() && i->first.mergesWith(orig_range)) {
|
|
|
|
--i;
|
|
|
|
if (i->first.intersects(r)) {
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// we could leave the loop based on reaching the first
|
|
|
|
// element, so we must still check for an intersection
|
|
|
|
if (i->first.intersects(r))
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2006-11-23 07:42:57 +01:00
|
|
|
return tree.end();
|
|
|
|
}
|
|
|
|
|
2012-03-26 11:37:00 +02:00
|
|
|
const_iterator
|
2012-09-19 12:15:44 +02:00
|
|
|
find(const Addr &r) const
|
2012-03-26 11:37:00 +02:00
|
|
|
{
|
|
|
|
return find(RangeSize(r, 1));
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
bool
|
2013-01-07 19:05:38 +01:00
|
|
|
intersect(const AddrRange &r) const
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
2013-01-07 19:05:38 +01:00
|
|
|
return find(r) != tree.end();
|
2006-11-23 07:42:57 +01:00
|
|
|
}
|
|
|
|
|
2013-01-07 19:05:38 +01:00
|
|
|
const_iterator
|
2012-09-19 12:15:44 +02:00
|
|
|
insert(const AddrRange &r, const V& d)
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
if (intersect(r))
|
|
|
|
return tree.end();
|
|
|
|
|
2012-03-19 11:36:09 +01:00
|
|
|
return tree.insert(std::make_pair(r, d)).first;
|
2006-11-23 07:42:57 +01:00
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
void
|
|
|
|
erase(iterator p)
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
tree.erase(p);
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
void
|
|
|
|
erase(iterator p, iterator q)
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
tree.erase(p,q);
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
void
|
|
|
|
clear()
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
tree.erase(tree.begin(), tree.end());
|
|
|
|
}
|
|
|
|
|
2012-03-26 11:37:00 +02:00
|
|
|
const_iterator
|
|
|
|
begin() const
|
|
|
|
{
|
|
|
|
return tree.begin();
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
iterator
|
|
|
|
begin()
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
return tree.begin();
|
|
|
|
}
|
|
|
|
|
2012-03-26 11:37:00 +02:00
|
|
|
const_iterator
|
|
|
|
end() const
|
|
|
|
{
|
|
|
|
return tree.end();
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
iterator
|
|
|
|
end()
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
return tree.end();
|
|
|
|
}
|
|
|
|
|
2012-09-19 12:15:44 +02:00
|
|
|
std::size_t
|
2012-03-26 11:37:00 +02:00
|
|
|
size() const
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
return tree.size();
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
bool
|
2012-03-26 11:37:00 +02:00
|
|
|
empty() const
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
return tree.empty();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2012-09-19 12:15:44 +02:00
|
|
|
#endif //__BASE_ADDR_RANGE_MAP_HH__
|