3 Copyright (C) 2010, 2011 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/>. */
24 mem_ranges_overlap (CORE_ADDR start1
, int len1
,
25 CORE_ADDR start2
, int len2
)
29 l
= max (start1
, start2
);
30 h
= min (start1
+ len1
, start2
+ len2
);
34 /* qsort comparison function, that compares mem_ranges. */
37 compare_mem_ranges (const void *ap
, const void *bp
)
39 const struct mem_range
*r1
= ap
;
40 const struct mem_range
*r2
= bp
;
42 if (r1
->start
> r2
->start
)
44 else if (r1
->start
< r2
->start
)
51 normalize_mem_ranges (VEC(mem_range_s
) *ranges
)
53 if (!VEC_empty (mem_range_s
, ranges
))
55 struct mem_range
*ra
, *rb
;
58 qsort (VEC_address (mem_range_s
, ranges
),
59 VEC_length (mem_range_s
, ranges
),
64 ra
= VEC_index (mem_range_s
, ranges
, a
);
65 for (b
= 1; VEC_iterate (mem_range_s
, ranges
, b
, rb
); b
++)
67 /* If mem_range B overlaps or is adjacent to mem_range A,
69 if (rb
->start
<= ra
->start
+ ra
->length
)
71 ra
->length
= (rb
->start
+ rb
->length
) - ra
->start
;
72 continue; /* next b, same a */
75 ra
= VEC_index (mem_range_s
, ranges
, a
);
80 VEC_truncate (mem_range_s
, ranges
, a
+ 1);
This page took 0.032892 seconds and 5 git commands to generate.