2011-02-14 19:20:27 +08:00
|
|
|
/* The memory range data structure, and associated utilities.
|
|
|
|
|
|
2013-01-01 14:33:28 +08:00
|
|
|
Copyright (C) 2010-2013 Free Software Foundation, Inc.
|
2011-02-14 19:20:27 +08:00
|
|
|
|
|
|
|
|
This file is part of GDB.
|
|
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
|
the Free Software Foundation; either version 3 of the License, or
|
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
|
|
|
|
|
|
|
|
|
#ifndef MEMRANGE_H
|
|
|
|
|
#define MEMRANGE_H
|
|
|
|
|
|
|
|
|
|
#include "vec.h"
|
|
|
|
|
|
|
|
|
|
/* Defines a [START, START + LENGTH) memory range. */
|
|
|
|
|
|
|
|
|
|
struct mem_range
|
|
|
|
|
{
|
|
|
|
|
/* Lowest address in the range. */
|
|
|
|
|
CORE_ADDR start;
|
|
|
|
|
|
|
|
|
|
/* Length of the range. */
|
|
|
|
|
int length;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
typedef struct mem_range mem_range_s;
|
|
|
|
|
|
|
|
|
|
DEF_VEC_O(mem_range_s);
|
|
|
|
|
|
|
|
|
|
/* Returns true if the ranges defined by [start1, start1+len1) and
|
|
|
|
|
[start2, start2+len2) overlap. */
|
|
|
|
|
|
|
|
|
|
extern int mem_ranges_overlap (CORE_ADDR start1, int len1,
|
|
|
|
|
CORE_ADDR start2, int len2);
|
|
|
|
|
|
|
|
|
|
/* Sort ranges by start address, then coalesce contiguous or
|
|
|
|
|
overlapping ranges. */
|
|
|
|
|
|
|
|
|
|
extern void normalize_mem_ranges (VEC(mem_range_s) *memory);
|
|
|
|
|
|
|
|
|
|
#endif
|
