57dea9f62e
2005-01-12 Toon Moene <toon@moene.indiv.nluug.nl> PR libfortran/19280 c99_protos.h: License changed to GPL+exception. libgfortran.h: Ditto. intrinsics/abort.c: Ditto. intrinsics/args.c: Ditto. intrinsics/associated.c: Ditto. intrinsics/bessel.c: Ditto. intrinsics/c99_functions.c: Ditto. intrinsics/cpu_time.c: Ditto. intrinsics/cshift0.c: Ditto. intrinsics/date_and_time.c: Ditto. intrinsics/env.c: Ditto. intrinsics/eoshift0.c: Ditto. intrinsics/eoshift2.c: Ditto. intrinsics/erf.c: Ditto. intrinsics/etime.c: Ditto. intrinsics/exit.c: Ditto. intrinsics/flush.c: Ditto. intrinsics/fnum.c: Ditto. intrinsics/getXid.c: Ditto. intrinsics/getcwd.c: Ditto. intrinsics/ishftc.c: Ditto. intrinsics/mvbits.c: Ditto. intrinsics/pack_generic.c: Ditto. intrinsics/rand.c: Ditto. intrinsics/random.c: Ditto. intrinsics/reshape_generic.c: Ditto. intrinsics/reshape_packed.c: Ditto. intrinsics/size.c: Ditto. intrinsics/spread_generic.c: Ditto. intrinsics/stat.c: Ditto. intrinsics/string_intrinsics.c: Ditto. intrinsics/system.c: Ditto. intrinsics/system_clock.c: Ditto. intrinsics/transpose_generic.c: Ditto. intrinsics/umask.c: Ditto. intrinsics/unlink.c: Ditto. intrinsics/unpack_generic.c: Ditto. io/backspace.c: Ditto. io/close.c: Ditto. io/endfile.c: Ditto. io/format.c: Ditto. io/inquire.c: Ditto. io/io.h: Ditto. io/list_read.c: Ditto. io/lock.c: Ditto. io/open.c: Ditto. io/read.c: Ditto. io/rewind.c: Ditto. io/transfer.c: Ditto. io/unit.c: Ditto. io/unix.c: Ditto. io/write.c: Ditto. m4/all.m4: Ditto. m4/any.m4: Ditto. m4/cexp.m4: Ditto. m4/chyp.m4: Ditto. m4/count.m4: Ditto. m4/cshift1.m4: Ditto. m4/ctrig.m4: Ditto. m4/dotprod.m4: Ditto. m4/dotprodc.m4: Ditto. m4/dotprodl.m4: Ditto. m4/eoshift1.m4: Ditto. m4/eoshift3.m4: Ditto. m4/exponent.m4: Ditto. m4/fraction.m4: Ditto. m4/head.m4: Ditto. m4/iforeach.m4: Ditto. m4/ifunction.m4: Ditto. m4/in_pack.m4: Ditto. m4/in_unpack.m4: Ditto. m4/iparm.m4: Ditto. m4/matmul.m4: Ditto. m4/matmull.m4: Ditto. m4/maxloc0.m4: Ditto. m4/maxloc1.m4: Ditto. m4/maxval.m4: Ditto. m4/minloc0.m4: Ditto. m4/minloc1.m4: Ditto. m4/minval.m4: Ditto. m4/mtype.m4: Ditto. m4/nearest.m4: Ditto. m4/pow.m4: Ditto. m4/product.m4: Ditto. m4/reshape.m4: Ditto. m4/set_exponent.m4: Ditto. m4/shape.m4: Ditto. m4/specific.m4: Ditto. m4/specific2.m4: Ditto. m4/sum.m4: Ditto. m4/transpose.m4: Ditto. m4/types.m4: Ditto. runtime/environ.c: Ditto. runtime/error.c: Ditto. runtime/in_pack_generic.c: Ditto. runtime/in_unpack_generic.c: Ditto. runtime/main.c: Ditto. runtime/memory.c: Ditto. runtime/normalize.c: Ditto. runtime/pause.c: Ditto. runtime/select.c: Ditto. runtime/stop.c: Ditto. runtime/string.c: Ditto. generated/_abs_c4.f90: Regenerated. generated/_abs_c8.f90: Regenerated. generated/_abs_i4.f90: Regenerated. generated/_abs_i8.f90: Regenerated. generated/_abs_r4.f90: Regenerated. generated/_abs_r8.f90: Regenerated. generated/_acos_r4.f90: Regenerated. generated/_acos_r8.f90: Regenerated. generated/_aint_r4.f90: Regenerated. generated/_aint_r8.f90: Regenerated. generated/_anint_r4.f90: Regenerated. generated/_anint_r8.f90: Regenerated. generated/_asin_r4.f90: Regenerated. generated/_asin_r8.f90: Regenerated. generated/_atan2_r4.f90: Regenerated. generated/_atan2_r8.f90: Regenerated. generated/_atan_r4.f90: Regenerated. generated/_atan_r8.f90: Regenerated. generated/_conjg_c4.f90: Regenerated. generated/_conjg_c8.f90: Regenerated. generated/_cos_c4.f90: Regenerated. generated/_cos_c8.f90: Regenerated. generated/_cos_r4.f90: Regenerated. generated/_cos_r8.f90: Regenerated. generated/_cosh_r4.f90: Regenerated. generated/_cosh_r8.f90: Regenerated. generated/_dim_i4.f90: Regenerated. generated/_dim_i8.f90: Regenerated. generated/_dim_r4.f90: Regenerated. generated/_dim_r8.f90: Regenerated. generated/_exp_c4.f90: Regenerated. generated/_exp_c8.f90: Regenerated. generated/_exp_r4.f90: Regenerated. generated/_exp_r8.f90: Regenerated. generated/_log10_r4.f90: Regenerated. generated/_log10_r8.f90: Regenerated. generated/_log_c4.f90: Regenerated. generated/_log_c8.f90: Regenerated. generated/_log_r4.f90: Regenerated. generated/_log_r8.f90: Regenerated. generated/_mod_i4.f90: Regenerated. generated/_mod_i8.f90: Regenerated. generated/_mod_r4.f90: Regenerated. generated/_mod_r8.f90: Regenerated. generated/_sign_i4.f90: Regenerated. generated/_sign_i8.f90: Regenerated. generated/_sign_r4.f90: Regenerated. generated/_sign_r8.f90: Regenerated. generated/_sin_c4.f90: Regenerated. generated/_sin_c8.f90: Regenerated. generated/_sin_r4.f90: Regenerated. generated/_sin_r8.f90: Regenerated. generated/_sinh_r4.f90: Regenerated. generated/_sinh_r8.f90: Regenerated. generated/_sqrt_c4.f90: Regenerated. generated/_sqrt_c8.f90: Regenerated. generated/_sqrt_r4.f90: Regenerated. generated/_sqrt_r8.f90: Regenerated. generated/_tan_r4.f90: Regenerated. generated/_tan_r8.f90: Regenerated. generated/_tanh_r4.f90: Regenerated. generated/_tanh_r8.f90: Regenerated. generated/all_l4.c: Regenerated. generated/all_l8.c: Regenerated. generated/any_l4.c: Regenerated. generated/any_l8.c: Regenerated. generated/count_4_l4.c: Regenerated. generated/count_4_l8.c: Regenerated. generated/count_8_l4.c: Regenerated. generated/count_8_l8.c: Regenerated. generated/cshift1_4.c: Regenerated. generated/cshift1_8.c: Regenerated. generated/dotprod_c4.c: Regenerated. generated/dotprod_c8.c: Regenerated. generated/dotprod_i4.c: Regenerated. generated/dotprod_i8.c: Regenerated. generated/dotprod_l4.c: Regenerated. generated/dotprod_l8.c: Regenerated. generated/dotprod_r4.c: Regenerated. generated/dotprod_r8.c: Regenerated. generated/eoshift1_4.c: Regenerated. generated/eoshift1_8.c: Regenerated. generated/eoshift3_4.c: Regenerated. generated/eoshift3_8.c: Regenerated. generated/exp_c4.c: Regenerated. generated/exp_c8.c: Regenerated. generated/exponent_r4.c: Regenerated. generated/exponent_r8.c: Regenerated. generated/fraction_r4.c: Regenerated. generated/fraction_r8.c: Regenerated. generated/hyp_c4.c: Regenerated. generated/hyp_c8.c: Regenerated. generated/in_pack_i4.c: Regenerated. generated/in_pack_i8.c: Regenerated. generated/in_unpack_i4.c: Regenerated. generated/in_unpack_i8.c: Regenerated. generated/matmul_c4.c: Regenerated. generated/matmul_c8.c: Regenerated. generated/matmul_i4.c: Regenerated. generated/matmul_i8.c: Regenerated. generated/matmul_l4.c: Regenerated. generated/matmul_l8.c: Regenerated. generated/matmul_r4.c: Regenerated. generated/matmul_r8.c: Regenerated. generated/maxloc0_4_i4.c: Regenerated. generated/maxloc0_4_i8.c: Regenerated. generated/maxloc0_4_r4.c: Regenerated. generated/maxloc0_4_r8.c: Regenerated. generated/maxloc0_8_i4.c: Regenerated. generated/maxloc0_8_i8.c: Regenerated. generated/maxloc0_8_r4.c: Regenerated. generated/maxloc0_8_r8.c: Regenerated. generated/maxloc1_4_i4.c: Regenerated. generated/maxloc1_4_i8.c: Regenerated. generated/maxloc1_4_r4.c: Regenerated. generated/maxloc1_4_r8.c: Regenerated. generated/maxloc1_8_i4.c: Regenerated. generated/maxloc1_8_i8.c: Regenerated. generated/maxloc1_8_r4.c: Regenerated. generated/maxloc1_8_r8.c: Regenerated. generated/maxval_i4.c: Regenerated. generated/maxval_i8.c: Regenerated. generated/maxval_r4.c: Regenerated. generated/maxval_r8.c: Regenerated. generated/minloc0_4_i4.c: Regenerated. generated/minloc0_4_i8.c: Regenerated. generated/minloc0_4_r4.c: Regenerated. generated/minloc0_4_r8.c: Regenerated. generated/minloc0_8_i4.c: Regenerated. generated/minloc0_8_i8.c: Regenerated. generated/minloc0_8_r4.c: Regenerated. generated/minloc0_8_r8.c: Regenerated. generated/minloc1_4_i4.c: Regenerated. generated/minloc1_4_i8.c: Regenerated. generated/minloc1_4_r4.c: Regenerated. generated/minloc1_4_r8.c: Regenerated. generated/minloc1_8_i4.c: Regenerated. generated/minloc1_8_i8.c: Regenerated. generated/minloc1_8_r4.c: Regenerated. generated/minloc1_8_r8.c: Regenerated. generated/minval_i4.c: Regenerated. generated/minval_i8.c: Regenerated. generated/minval_r4.c: Regenerated. generated/minval_r8.c: Regenerated. generated/nearest_r4.c: Regenerated. generated/nearest_r8.c: Regenerated. generated/pow_c4_i4.c: Regenerated. generated/pow_c4_i8.c: Regenerated. generated/pow_c8_i4.c: Regenerated. generated/pow_c8_i8.c: Regenerated. generated/pow_i4_i4.c: Regenerated. generated/pow_i4_i8.c: Regenerated. generated/pow_i8_i4.c: Regenerated. generated/pow_i8_i8.c: Regenerated. generated/pow_r4_i4.c: Regenerated. generated/pow_r4_i8.c: Regenerated. generated/pow_r8_i4.c: Regenerated. generated/pow_r8_i8.c: Regenerated. generated/product_c4.c: Regenerated. generated/product_c8.c: Regenerated. generated/product_i4.c: Regenerated. generated/product_i8.c: Regenerated. generated/product_r4.c: Regenerated. generated/product_r8.c: Regenerated. generated/reshape_i4.c: Regenerated. generated/reshape_i8.c: Regenerated. generated/set_exponent_r4.c: Regenerated. generated/set_exponent_r8.c: Regenerated. generated/shape_i4.c: Regenerated. generated/shape_i8.c: Regenerated. generated/sum_c4.c: Regenerated. generated/sum_c8.c: Regenerated. generated/sum_i4.c: Regenerated. generated/sum_i8.c: Regenerated. generated/sum_r4.c: Regenerated. generated/sum_r8.c: Regenerated. generated/transpose_i4.c: Regenerated. generated/transpose_i8.c: Regenerated. generated/trig_c4.c: Regenerated. generated/trig_c8.c: Regenerated. From-SVN: r93235
317 lines
7.4 KiB
C
317 lines
7.4 KiB
C
/* Memory mamagement routines.
|
|
Copyright 2002 Free Software Foundation, Inc.
|
|
Contributed by Paul Brook <paul@nowt.org>
|
|
|
|
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
|
|
|
Libgfortran is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2 of the License, or (at your option) any later version.
|
|
|
|
In addition to the permissions in the GNU General Public License, the
|
|
Free Software Foundation gives you unlimited permission to link the
|
|
compiled version of this file into combinations with other programs,
|
|
and to distribute those combinations without any restriction coming
|
|
from the use of this file. (The General Public License restrictions
|
|
do apply in other respects; for example, they cover modification of
|
|
the file, and distribution when not linked into a combine
|
|
executable.)
|
|
|
|
Libgfortran is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public
|
|
License along with libgfortran; see the file COPYING. If not,
|
|
write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
#include "config.h"
|
|
#include <stdlib.h>
|
|
#include "libgfortran.h"
|
|
|
|
/* If GFC_CLEAR_MEMORY is defined, the memory allocation routines will
|
|
return memory that is guaranteed to be set to zero. This can have
|
|
a severe efficiency penalty, so it should never be set if good
|
|
performance is desired, but it can help when you're debugging code. */
|
|
#define GFC_CLEAR_MEMORY
|
|
|
|
/* If GFC_CHECK_MEMORY is defined, we do some sanity checks at runtime.
|
|
This causes small overhead, but again, it also helps debugging. */
|
|
#define GFC_CHECK_MEMORY
|
|
|
|
/* We use a double linked list of these structures to keep track of
|
|
the memory we allocate internally. We could also use this for user
|
|
allocated memory (ALLOCATE/DEALLOCATE). This should be stored in a
|
|
seperate list. */
|
|
typedef struct malloc_t
|
|
{
|
|
int magic;
|
|
int marker;
|
|
struct malloc_t *prev, *next;
|
|
|
|
/* The start of the block. */
|
|
void *data;
|
|
}
|
|
malloc_t;
|
|
|
|
/* We try to make sure we don't get memory corruption by checking for
|
|
a magic number. */
|
|
#define GFC_MALLOC_MAGIC 0x4d353941 /* "G95M" */
|
|
|
|
#define HEADER_SIZE offsetof (malloc_t, data)
|
|
#define DATA_POINTER(pheader) (&((pheader)->data))
|
|
#define DATA_HEADER(pdata) ((malloc_t *)((char *) (pdata) - HEADER_SIZE))
|
|
|
|
/* The root of the circular double linked list for compiler generated
|
|
malloc calls. */
|
|
static malloc_t mem_root = {
|
|
.next = &mem_root,
|
|
.prev = &mem_root
|
|
};
|
|
|
|
#if 0
|
|
/* ??? Disabled because, well, it wasn't being called before transforming
|
|
it to a destructor, and turning it on causes testsuite failures. */
|
|
/* Doesn't actually do any cleaning up, just throws an error if something
|
|
has got out of sync somewhere. */
|
|
|
|
static void __attribute__((destructor))
|
|
runtime_cleanup (void)
|
|
{
|
|
/* Make sure all memory we've allocated is freed on exit. */
|
|
if (mem_root.next != &mem_root)
|
|
runtime_error ("Unfreed memory on program termination");
|
|
}
|
|
#endif
|
|
|
|
|
|
void *
|
|
get_mem (size_t n)
|
|
{
|
|
void *p;
|
|
|
|
#ifdef GFC_CLEAR_MEMORY
|
|
p = (void *) calloc (1, n);
|
|
#else
|
|
p = (void *) malloc (n);
|
|
#endif
|
|
if (p == NULL)
|
|
os_error ("Memory allocation failed");
|
|
|
|
return p;
|
|
}
|
|
|
|
|
|
void
|
|
free_mem (void *p)
|
|
{
|
|
free (p);
|
|
}
|
|
|
|
|
|
/* Allocates a block of memory with a size of N bytes. N does not
|
|
include the size of the header. */
|
|
|
|
static malloc_t *
|
|
malloc_with_header (size_t n)
|
|
{
|
|
malloc_t *newmem;
|
|
|
|
n = n + HEADER_SIZE;
|
|
|
|
newmem = (malloc_t *) get_mem (n);
|
|
|
|
if (newmem)
|
|
{
|
|
newmem->magic = GFC_MALLOC_MAGIC;
|
|
newmem->marker = 0;
|
|
}
|
|
|
|
return newmem;
|
|
}
|
|
|
|
|
|
/* Allocate memory for internal (compiler generated) use. */
|
|
|
|
void *
|
|
internal_malloc_size (size_t size)
|
|
{
|
|
malloc_t *newmem;
|
|
|
|
newmem = malloc_with_header (size);
|
|
|
|
if (!newmem)
|
|
os_error ("Out of memory.");
|
|
|
|
/* Add to end of list. */
|
|
newmem->next = &mem_root;
|
|
newmem->prev = mem_root.prev;
|
|
mem_root.prev->next = newmem;
|
|
mem_root.prev = newmem;
|
|
|
|
return DATA_POINTER (newmem);
|
|
}
|
|
|
|
extern void *internal_malloc (GFC_INTEGER_4);
|
|
export_proto(internal_malloc);
|
|
|
|
void *
|
|
internal_malloc (GFC_INTEGER_4 size)
|
|
{
|
|
#ifdef GFC_CHECK_MEMORY
|
|
/* Under normal circumstances, this is _never_ going to happen! */
|
|
if (size < 0)
|
|
runtime_error ("Attempt to allocate a negative amount of memory.");
|
|
|
|
#endif
|
|
return internal_malloc_size ((size_t) size);
|
|
}
|
|
|
|
extern void *internal_malloc64 (GFC_INTEGER_8);
|
|
export_proto(internal_malloc64);
|
|
|
|
void *
|
|
internal_malloc64 (GFC_INTEGER_8 size)
|
|
{
|
|
#ifdef GFC_CHECK_MEMORY
|
|
/* Under normal circumstances, this is _never_ going to happen! */
|
|
if (size < 0)
|
|
runtime_error ("Attempt to allocate a negative amount of memory.");
|
|
#endif
|
|
return internal_malloc_size ((size_t) size);
|
|
}
|
|
|
|
|
|
/* Free internally allocated memory. Pointer is NULLified. Also used to
|
|
free user allocated memory. */
|
|
/* TODO: keep a list of previously allocated blocks and reuse them. */
|
|
|
|
void
|
|
internal_free (void *mem)
|
|
{
|
|
malloc_t *m;
|
|
|
|
if (!mem)
|
|
runtime_error ("Internal: Possible double free of temporary.");
|
|
|
|
m = DATA_HEADER (mem);
|
|
|
|
if (m->magic != GFC_MALLOC_MAGIC)
|
|
runtime_error ("Internal: No magic memblock marker. "
|
|
"Possible memory corruption");
|
|
|
|
/* Move markers up the chain, so they don't get lost. */
|
|
m->prev->marker += m->marker;
|
|
/* Remove from list. */
|
|
m->prev->next = m->next;
|
|
m->next->prev = m->prev;
|
|
|
|
free (m);
|
|
}
|
|
iexport(internal_free);
|
|
|
|
|
|
/* User-allocate, one call for each member of the alloc-list of an
|
|
ALLOCATE statement. */
|
|
|
|
static void
|
|
allocate_size (void **mem, size_t size, GFC_INTEGER_4 * stat)
|
|
{
|
|
malloc_t *newmem;
|
|
|
|
if (!mem)
|
|
runtime_error ("Internal: NULL mem pointer in ALLOCATE.");
|
|
|
|
newmem = malloc_with_header (size);
|
|
if (!newmem)
|
|
{
|
|
if (stat)
|
|
{
|
|
*stat = 1;
|
|
return;
|
|
}
|
|
else
|
|
runtime_error ("ALLOCATE: Out of memory.");
|
|
}
|
|
|
|
/* We don't keep a list of these at the moment, so just link to itself. */
|
|
newmem->next = newmem;
|
|
newmem->prev = newmem;
|
|
|
|
(*mem) = DATA_POINTER (newmem);
|
|
|
|
if (stat)
|
|
*stat = 0;
|
|
}
|
|
|
|
extern void allocate (void **, GFC_INTEGER_4, GFC_INTEGER_4 *);
|
|
export_proto(allocate);
|
|
|
|
void
|
|
allocate (void **mem, GFC_INTEGER_4 size, GFC_INTEGER_4 * stat)
|
|
{
|
|
if (size < 0)
|
|
{
|
|
runtime_error ("Attempt to allocate negative amount of memory. "
|
|
"Possible integer overflow");
|
|
abort ();
|
|
}
|
|
|
|
allocate_size (mem, (size_t) size, stat);
|
|
}
|
|
|
|
extern void allocate64 (void **, GFC_INTEGER_8, GFC_INTEGER_4 *);
|
|
export_proto(allocate64);
|
|
|
|
void
|
|
allocate64 (void **mem, GFC_INTEGER_8 size, GFC_INTEGER_4 * stat)
|
|
{
|
|
if (size < 0)
|
|
{
|
|
runtime_error
|
|
("ALLOCATE64: Attempt to allocate negative amount of memory. "
|
|
"Possible integer overflow");
|
|
abort ();
|
|
}
|
|
|
|
allocate_size (mem, (size_t) size, stat);
|
|
}
|
|
|
|
|
|
/* User-deallocate; pointer is NULLified. */
|
|
|
|
extern void deallocate (void **, GFC_INTEGER_4 *);
|
|
export_proto(deallocate);
|
|
|
|
void
|
|
deallocate (void **mem, GFC_INTEGER_4 * stat)
|
|
{
|
|
if (!mem)
|
|
runtime_error ("Internal: NULL mem pointer in ALLOCATE.");
|
|
|
|
if (!*mem)
|
|
{
|
|
if (stat)
|
|
{
|
|
*stat = 1;
|
|
return;
|
|
}
|
|
else
|
|
{
|
|
runtime_error
|
|
("Internal: Attempt to DEALLOCATE unallocated memory.");
|
|
abort ();
|
|
}
|
|
}
|
|
|
|
/* Just use the internal routine. */
|
|
internal_free (*mem);
|
|
*mem = NULL;
|
|
|
|
if (stat)
|
|
*stat = 0;
|
|
}
|