cannam@95: /*
cannam@95:  * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95:  *
cannam@95:  * This program is free software; you can redistribute it and/or modify
cannam@95:  * it under the terms of the GNU General Public License as published by
cannam@95:  * the Free Software Foundation; either version 2 of the License, or
cannam@95:  * (at your option) any later version.
cannam@95:  *
cannam@95:  * This program is distributed in the hope that it will be useful,
cannam@95:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@95:  * GNU General Public License for more details.
cannam@95:  *
cannam@95:  * You should have received a copy of the GNU General Public License
cannam@95:  * along with this program; if not, write to the Free Software
cannam@95:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@95:  *
cannam@95:  */
cannam@95: 
cannam@95: #include "ifftw.h"
cannam@95: 
cannam@95: /**********************************************************
cannam@95:  *   DEBUGGING CODE
cannam@95:  **********************************************************/
cannam@95: #if defined(FFTW_DEBUG_MALLOC)
cannam@95: 
cannam@95: #include <stdio.h>
cannam@95: 
cannam@95: /*
cannam@95:   debugging malloc/free. 
cannam@95:  
cannam@95:   1) Initialize every malloced and freed area to random values, just
cannam@95:   to make sure we are not using uninitialized pointers.
cannam@95:  
cannam@95:   2) check for blocks freed twice.
cannam@95:  
cannam@95:   3) Check for writes past the ends of allocated blocks
cannam@95:  
cannam@95:   4) destroy contents of freed blocks in order to detect incorrect reuse.
cannam@95:  
cannam@95:   5) keep track of who allocates what and report memory leaks
cannam@95:  
cannam@95:   This code is a quick and dirty hack.  May be nonportable. 
cannam@95:   Use at your own risk.
cannam@95:  
cannam@95: */
cannam@95: 
cannam@95: #define MAGIC ((size_t)0xABadCafe)
cannam@95: #define PAD_FACTOR 2
cannam@95: #define SZ_HEADER (4 * sizeof(size_t))
cannam@95: #define HASHSZ 1031
cannam@95: 
cannam@95: static unsigned int hashaddr(void *p)
cannam@95: {
cannam@95:      return ((unsigned long)p) % HASHSZ;
cannam@95: }
cannam@95: 
cannam@95: struct mstat {
cannam@95:      int siz;
cannam@95:      int maxsiz;
cannam@95:      int cnt;
cannam@95:      int maxcnt;
cannam@95: };
cannam@95: 
cannam@95: static struct mstat mstat[MALLOC_WHAT_LAST];
cannam@95: 
cannam@95: struct minfo {
cannam@95:      const char *file;
cannam@95:      int line;
cannam@95:      size_t n;
cannam@95:      void *p;
cannam@95:      struct minfo *next;
cannam@95: };
cannam@95: 
cannam@95: static struct minfo *minfo[HASHSZ] = {0};
cannam@95: 
cannam@95: #if defined(HAVE_THREADS) || defined(HAVE_OPENMP)
cannam@95: int X(in_thread) = 0;
cannam@95: #endif
cannam@95: 
cannam@95: void *X(malloc_debug)(size_t n, enum malloc_tag what,
cannam@95:                       const char *file, int line)
cannam@95: {
cannam@95:      char *p;
cannam@95:      size_t i;
cannam@95:      struct minfo *info;
cannam@95:      struct mstat *stat = mstat + what;
cannam@95:      struct mstat *estat = mstat + EVERYTHING;
cannam@95: 
cannam@95:      if (n == 0)
cannam@95:           n = 1;
cannam@95: 
cannam@95:      if (!IN_THREAD) {
cannam@95: 	  stat->siz += n;
cannam@95: 	  if (stat->siz > stat->maxsiz)
cannam@95: 	       stat->maxsiz = stat->siz;
cannam@95: 	  estat->siz += n;
cannam@95: 	  if (estat->siz > estat->maxsiz)
cannam@95: 	       estat->maxsiz = estat->siz;
cannam@95:      }
cannam@95: 
cannam@95:      p = (char *) X(kernel_malloc)(PAD_FACTOR * n + SZ_HEADER);
cannam@95:      A(p);
cannam@95: 
cannam@95:      /* store the sz in a known position */
cannam@95:      ((size_t *) p)[0] = n;
cannam@95:      ((size_t *) p)[1] = MAGIC;
cannam@95:      ((size_t *) p)[2] = what;
cannam@95: 
cannam@95:      /* fill with junk */
cannam@95:      for (i = 0; i < PAD_FACTOR * n; i++)
cannam@95:           p[i + SZ_HEADER] = (char) (i ^ 0xEF);
cannam@95: 
cannam@95:      if (!IN_THREAD) {
cannam@95: 	  ++stat->cnt;
cannam@95: 	  ++estat->cnt;
cannam@95: 	  
cannam@95: 	  if (stat->cnt > stat->maxcnt)
cannam@95: 	       stat->maxcnt = stat->cnt;
cannam@95: 	  if (estat->cnt > estat->maxcnt)
cannam@95: 	       estat->maxcnt = estat->cnt;
cannam@95:      }
cannam@95: 
cannam@95:      /* skip the info we stored previously */
cannam@95:      p = p + SZ_HEADER;
cannam@95: 
cannam@95:      if (!IN_THREAD) {
cannam@95: 	  unsigned int h = hashaddr(p);
cannam@95: 	  /* record allocation in allocation list */
cannam@95: 	  info = (struct minfo *) malloc(sizeof(struct minfo));
cannam@95: 	  info->n = n;
cannam@95: 	  info->file = file;
cannam@95: 	  info->line = line;
cannam@95: 	  info->p = p;
cannam@95: 	  info->next = minfo[h];
cannam@95: 	  minfo[h] = info;
cannam@95:      }
cannam@95: 
cannam@95:      return (void *) p;
cannam@95: }
cannam@95: 
cannam@95: void X(ifree)(void *p)
cannam@95: {
cannam@95:      char *q;
cannam@95: 
cannam@95:      A(p);
cannam@95: 
cannam@95:      q = ((char *) p) - SZ_HEADER;
cannam@95:      A(q);
cannam@95: 
cannam@95:      {
cannam@95:           size_t n = ((size_t *) q)[0];
cannam@95:           size_t magic = ((size_t *) q)[1];
cannam@95:           int what = ((size_t *) q)[2];
cannam@95:           size_t i;
cannam@95:           struct mstat *stat = mstat + what;
cannam@95:           struct mstat *estat = mstat + EVERYTHING;
cannam@95: 
cannam@95:           /* set to zero to detect duplicate free's */
cannam@95:           ((size_t *) q)[0] = 0;
cannam@95: 
cannam@95:           A(magic == MAGIC);
cannam@95:           ((size_t *) q)[1] = ~MAGIC;
cannam@95: 
cannam@95: 	  if (!IN_THREAD) {
cannam@95: 	       stat->siz -= n;
cannam@95: 	       A(stat->siz >= 0);
cannam@95: 	       estat->siz -= n;
cannam@95: 	       A(estat->siz >= 0);
cannam@95: 	  }
cannam@95: 
cannam@95:           /* check for writing past end of array: */
cannam@95:           for (i = n; i < PAD_FACTOR * n; ++i)
cannam@95:                if (q[i + SZ_HEADER] != (char) (i ^ 0xEF)) {
cannam@95:                     A(0 /* array bounds overwritten */ );
cannam@95:                }
cannam@95:           for (i = 0; i < PAD_FACTOR * n; ++i)
cannam@95:                q[i + SZ_HEADER] = (char) (i ^ 0xAD);
cannam@95: 
cannam@95: 	  if (!IN_THREAD) {
cannam@95: 	       --stat->cnt;
cannam@95: 	       --estat->cnt;
cannam@95: 	       
cannam@95: 	       A(stat->cnt >= 0);
cannam@95: 	       A((stat->cnt == 0 && stat->siz == 0) ||
cannam@95: 		 (stat->cnt > 0 && stat->siz > 0));
cannam@95: 	       A(estat->cnt >= 0);
cannam@95: 	       A((estat->cnt == 0 && estat->siz == 0) ||
cannam@95: 		 (estat->cnt > 0 && estat->siz > 0));
cannam@95: 	  }
cannam@95: 
cannam@95:           X(kernel_free)(q);
cannam@95:      }
cannam@95: 
cannam@95:      if (!IN_THREAD) {
cannam@95:           /* delete minfo entry */
cannam@95: 	  unsigned int h = hashaddr(p);
cannam@95:           struct minfo **i;
cannam@95: 
cannam@95:           for (i = minfo + h; *i; i = &((*i)->next)) {
cannam@95:                if ((*i)->p == p) {
cannam@95:                     struct minfo *i0 = (*i)->next;
cannam@95:                     free(*i);
cannam@95:                     *i = i0;
cannam@95:                     return;
cannam@95:                }
cannam@95:           }
cannam@95: 
cannam@95:           A(0 /* no entry in minfo list */ );
cannam@95:      }
cannam@95: }
cannam@95: 
cannam@95: void X(malloc_print_minfo)(int verbose)
cannam@95: {
cannam@95:      struct minfo *info;
cannam@95:      int what;
cannam@95:      unsigned int h;
cannam@95:      int leak = 0;
cannam@95: 
cannam@95:      if (verbose > 2) {
cannam@95: 	  static const char *names[MALLOC_WHAT_LAST] = {
cannam@95: 	       "EVERYTHING",
cannam@95: 	       "PLANS", "SOLVERS", "PROBLEMS", "BUFFERS",
cannam@95: 	       "HASHT", "TENSORS", "PLANNERS", "SLVDSC", "TWIDDLES",
cannam@95: 	       "STRIDES", "OTHER"
cannam@95: 	  };
cannam@95: 
cannam@95: 	  printf("%12s %8s %8s %10s %10s\n",
cannam@95: 		 "what", "cnt", "maxcnt", "siz", "maxsiz");
cannam@95: 
cannam@95: 	  for (what = 0; what < MALLOC_WHAT_LAST; ++what) {
cannam@95: 	       struct mstat *stat = mstat + what;
cannam@95: 	       printf("%12s %8d %8d %10d %10d\n",
cannam@95: 		      names[what], stat->cnt, stat->maxcnt,
cannam@95: 		      stat->siz, stat->maxsiz);
cannam@95: 	  }
cannam@95:      }
cannam@95: 
cannam@95:      for (h = 0; h < HASHSZ; ++h) 
cannam@95: 	  if (minfo[h]) {
cannam@95: 	       printf("\nUnfreed allocations:\n");
cannam@95: 	       break;
cannam@95: 	  }
cannam@95: 
cannam@95:      for (h = 0; h < HASHSZ; ++h) 
cannam@95: 	  for (info = minfo[h]; info; info = info->next) {
cannam@95: 	       leak = 1;
cannam@95: 	       printf("%s:%d:  %zd bytes at %p\n",
cannam@95: 		      info->file, info->line, info->n, info->p);
cannam@95: 	  }
cannam@95: 
cannam@95:      if (leak)
cannam@95: 	  abort();
cannam@95: }
cannam@95: 
cannam@95: #else
cannam@95: /**********************************************************
cannam@95:  *   NON DEBUGGING CODE
cannam@95:  **********************************************************/
cannam@95: /* production version, no hacks */
cannam@95: 
cannam@95: void *X(malloc_plain)(size_t n)
cannam@95: {
cannam@95:      void *p;
cannam@95:      if (n == 0)
cannam@95:           n = 1;
cannam@95:      p = X(kernel_malloc)(n);
cannam@95:      CK(p);
cannam@95: 
cannam@95: #ifdef MIN_ALIGNMENT
cannam@95:      A((((uintptr_t)p) % MIN_ALIGNMENT) == 0);
cannam@95: #endif
cannam@95: 
cannam@95:      return p;
cannam@95: }
cannam@95: 
cannam@95: void X(ifree)(void *p)
cannam@95: {
cannam@95:      X(kernel_free)(p);
cannam@95: }
cannam@95: 
cannam@95: #endif
cannam@95: 
cannam@95: void X(ifree0)(void *p)
cannam@95: {
cannam@95:      /* common pattern */
cannam@95:      if (p) X(ifree)(p);
cannam@95: }