1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
/* Memory ranges
Copyright (C) 2010-2019 Free Software Foundation, Inc.
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/>. */
#include "defs.h"
#include "memrange.h"
#include <algorithm>
int
mem_ranges_overlap (CORE_ADDR start1, int len1,
CORE_ADDR start2, int len2)
{
ULONGEST h, l;
l = std::max (start1, start2);
h = std::min (start1 + len1, start2 + len2);
return (l < h);
}
/* See memrange.h. */
int
address_in_mem_range (CORE_ADDR address, const struct mem_range *r)
{
return (r->start <= address
&& (address - r->start) < r->length);
}
void
normalize_mem_ranges (std::vector<mem_range> *memory)
{
/* This function must not use any VEC operation on RANGES that
reallocates the memory block as that invalidates the RANGES
pointer, which callers expect to remain valid. */
if (!memory->empty ())
{
std::vector<mem_range> &m = *memory;
std::sort (m.begin (), m.end ());
int a = 0;
for (int b = 1; b < m.size (); b++)
{
/* If mem_range B overlaps or is adjacent to mem_range A,
merge them. */
if (m[b].start <= m[a].start + m[a].length)
{
m[a].length = std::max ((CORE_ADDR) m[a].length,
(m[b].start - m[a].start) + m[b].length);
continue; /* next b, same a */
}
a++; /* next a */
if (a != b)
m[a] = m[b];
}
m.resize (a + 1);
}
}
|
