coregrind/m_aspacehl.c

   1
   2 /*--------------------------------------------------------------------*/
   3 /*--- Services layered on top of m_aspacemgr.         m_aspacehl.c ---*/
   4 /*--------------------------------------------------------------------*/
   5
   6 /*
   7    This file is part of Valgrind, a dynamic binary instrumentation
   8    framework.
   9
  10    Copyright (C) 2006-2013 Julian Seward
  11       jseward@acm.org
  12
  13    This program is free software; you can redistribute it and/or
  14    modify it under the terms of the GNU General Public License as
  15    published by the Free Software Foundation; either version 2 of the
  16    License, or (at your option) any later version.
  17
  18    This program is distributed in the hope that it will be useful, but
  19    WITHOUT ANY WARRANTY; without even the implied warranty of
  20    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  21    General Public License for more details.
  22
  23    You should have received a copy of the GNU General Public License
  24    along with this program; if not, write to the Free Software
  25    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  26    02111-1307, USA.
  27
  28    The GNU General Public License is contained in the file COPYING.
  29 */
  30
  31 #include "pub_core_basics.h"
  32 #include "pub_core_aspacemgr.h"
  33 #include "pub_core_mallocfree.h"
  34
  35 #include "pub_core_aspacehl.h"
  36
  37 // Extract from aspacem a vector of the current segment start
  38 // addresses.  The vector is dynamically allocated and should be freed
  39 // by the caller when done.  REQUIRES m_mallocfree to be running.
  40 // Writes the number of addresses required into *n_acquired.
  41 Addr* VG_(get_segment_starts) ( /*OUT*/Int* n_acquired )
  42 {
  43    Addr* starts;
  44    Int   n_starts, r = 0;
  45
  46    n_starts = 1;
  47    while (True) {
  48       starts = VG_(malloc)( "main.gss.1", n_starts * sizeof(Addr) );
  49       r = VG_(am_get_segment_starts)( starts, n_starts );
  50       if (r >= 0)
  51          break;
  52       VG_(free)(starts);
  53       n_starts *= 2;
  54    }
  55
  56    *n_acquired = r;
  57    return starts;
  58 }
  59
  60 /*--------------------------------------------------------------------*/
  61 /*--- end                                                          ---*/
  62 /*--------------------------------------------------------------------*/