gdb/memrange.c

   1 /* Memory ranges
   2
   3    Copyright (C) 2010-2024 Free Software Foundation, Inc.
   4
   5    This file is part of GDB.
   6
   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.
  11
  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.
  16
  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/>.  */
  19
  20 #include "memrange.h"
  21 #include <algorithm>
  22
  23 int
  24 mem_ranges_overlap (CORE_ADDR start1, int len1,
  25                     CORE_ADDR start2, int len2)
  26 {
  27   ULONGEST h, l;
  28
  29   l = std::max (start1, start2);
  30   h = std::min (start1 + len1, start2 + len2);
  31   return (l < h);
  32 }
  33
  34 /* See memrange.h.  */
  35
  36 int
  37 address_in_mem_range (CORE_ADDR address, const struct mem_range *r)
  38 {
  39   return (r->start <= address
  40           && (address - r->start) < r->length);
  41 }
  42
  43 void
  44 normalize_mem_ranges (std::vector<mem_range> *memory)
  45 {
  46   if (!memory->empty ())
  47     {
  48       std::vector<mem_range> &m = *memory;
  49
  50       std::sort (m.begin (), m.end ());
  51
  52       int a = 0;
  53       for (int b = 1; b < m.size (); b++)
  54         {
  55           /* If mem_range B overlaps or is adjacent to mem_range A,
  56              merge them.  */
  57           if (m[b].start <= m[a].start + m[a].length)
  58             {
  59               m[a].length = std::max ((CORE_ADDR) m[a].length,
  60                                       (m[b].start - m[a].start) + m[b].length);
  61               continue;         /* next b, same a */
  62             }
  63           a++;                  /* next a */
  64
  65           if (a != b)
  66             m[a] = m[b];
  67         }
  68
  69       m.resize (a + 1);
  70     }
  71 }