3 Copyright (C) 2010-2017 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
25 mem_ranges_overlap (CORE_ADDR start1
, int len1
,
26 CORE_ADDR start2
, int len2
)
30 l
= std::max (start1
, start2
);
31 h
= std::min (start1
+ len1
, start2
+ len2
);
38 address_in_mem_range (CORE_ADDR address
, const struct mem_range
*r
)
40 return (r
->start
<= address
41 && (address
- r
->start
) < r
->length
);
45 normalize_mem_ranges (std::vector
<mem_range
> *memory
)
47 /* This function must not use any VEC operation on RANGES that
48 reallocates the memory block as that invalidates the RANGES
49 pointer, which callers expect to remain valid. */
51 if (!memory
->empty ())
53 std::vector
<mem_range
> &m
= *memory
;
55 std::sort (m
.begin (), m
.end ());
58 for (int b
= 1; b
< m
.size (); b
++)
60 /* If mem_range B overlaps or is adjacent to mem_range A,
62 if (m
[b
].start
<= m
[a
].start
+ m
[a
].length
)
64 m
[a
].length
= std::max ((CORE_ADDR
) m
[a
].length
,
65 (m
[b
].start
- m
[a
].start
) + m
[b
].length
);
66 continue; /* next b, same a */
This page took 0.031018 seconds and 4 git commands to generate.