26 CORE_ADDR start2,
int len2)
30 l = std::max (start1, start2);
31 h = std::min (start1 + len1, start2 + len2);
40 return (r->
start <= address
47 if (!memory->empty ())
49 std::vector<mem_range> &m = *memory;
51 std::sort (m.begin (), m.end ());
54 for (
int b = 1; b < m.size (); b++)
58 if (m[b].start <= m[a].start + m[a].length)
60 m[a].length = std::max ((CORE_ADDR) m[a].length,
61 (m[b].start - m[a].start) + m[b].length);
int address_in_mem_range(CORE_ADDR address, const struct mem_range *r)
int mem_ranges_overlap(CORE_ADDR start1, int len1, CORE_ADDR start2, int len2)
void normalize_mem_ranges(std::vector< mem_range > *memory)