/src/opensips/mem/f_parallel_malloc.h

Source (jump to first uncovered line)
/*
 * Copyright (C) 2001-2003 FhG Fokus
 * Copyright (C) 2025 OpenSIPS Project
 *
 * This file is part of opensips, a free SIP server.
 *
 * opensips 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
 *
 * opensips 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 this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 */

#ifndef parallel_malloc_h
#define parallel_malloc_h

#include <stdio.h>
#include "meminfo.h"
#include "common.h"

#undef ROUNDTO

#define ROUNDTO 8UL /* address alignment, in bytes */

#define F_PARALLEL_MALLOC_OPTIMIZE_FACTOR 14UL /*used below */

/* size to optimize for, (most allocs <= this size), must be 2^k */
#define F_PARALLEL_MALLOC_OPTIMIZE  (1UL << F_PARALLEL_MALLOC_OPTIMIZE_FACTOR)

#define F_PARALLEL_HASH_SIZE (F_PARALLEL_MALLOC_OPTIMIZE/ROUNDTO + \
    (sizeof(long)*8-F_PARALLEL_MALLOC_OPTIMIZE_FACTOR)+1)

/* get the fragment which corresponds to a pointer */
#define F_PARALLEL_FRAG(p) \
  ((struct parallel_frag *)((char *)(p) - sizeof(struct parallel_frag)))

/* hash structure:
 * 0 .... F_MALLOC_OPTIMIZE/ROUNDTO  - small buckets, size increases with
 *                            ROUNDTO from bucket to bucket
 * +1 .... end -  size = 2^k, big buckets */

struct parallel_frag {
  unsigned long size;
  union {
    struct parallel_frag *nxt_free;
    long reserved;
  } u;
  struct parallel_frag **prev;
#ifdef DBG_MALLOC
  const char *file;
  const char *func;
  unsigned long line;
#endif

  /* we are hashing, need to know which is the big block for this allocation */
  struct parallel_block *block_ptr;

#ifdef SHM_EXTRA_STATS
  unsigned long statistic_index;
#endif
} __attribute__ ((aligned (ROUNDTO)));

#define F_PARALLEL_FRAG_OVERHEAD (sizeof(struct parallel_frag))

struct parallel_frag_lnk {
  struct parallel_frag *first;
  unsigned long no;
};

struct parallel_block {
  char *name; /* purpose of this memory block */

  unsigned long size; /* total size */
  unsigned long fragments; /* number of fragments in use */
#if defined(DBG_MALLOC) || defined(STATISTICS)
  unsigned long used; /* alloc'ed size */
  unsigned long real_used; /* used + malloc overhead */
  unsigned long max_real_used;
#endif

  int idx;

  struct parallel_frag *first_frag;
  struct parallel_frag *last_frag;

  struct parallel_frag_lnk free_hash[F_PARALLEL_HASH_SIZE];
} __attribute__ ((aligned (ROUNDTO)));

struct parallel_block *parallel_malloc_init(char *address, unsigned long size, char *name,int idx);

#ifdef DBG_MALLOC
void *parallel_malloc(struct parallel_block *fm, unsigned long size,
                const char *file, const char *func, unsigned int line);
void parallel_free(struct parallel_block *fm, void *p, const char *file,
             const char *func, unsigned int line);
void *parallel_realloc(struct parallel_block *fm, void *p, unsigned long size,
                 const char *file, const char *func, unsigned int line);
#ifndef INLINE_ALLOC
void *parallel_malloc_dbg(struct parallel_block *fm, unsigned long size,
                    const char *file, const char *func, unsigned int line);
void parallel_free_dbg(struct parallel_block *fm, void *p, const char *file,
                 const char *func, unsigned int line);
void *parallel_realloc_dbg(struct parallel_block *fm, void *p, unsigned long size,
                     const char *file, const char *func, unsigned int line);
#endif
#else
void *parallel_malloc(struct parallel_block *fm, unsigned long size);
void parallel_free(struct parallel_block *fm, void *p);
void *parallel_realloc(struct parallel_block *fm, void *p, unsigned long size);
#endif

void parallel_status(struct parallel_block *);
#if !defined INLINE_ALLOC && defined DBG_MALLOC
void parallel_status_dbg(struct parallel_block *);
#endif
void parallel_info(struct parallel_block *, struct mem_info *);

static inline unsigned long parallel_frag_size(void *p)
{
  if (!p)
    return 0;

  return F_PARALLEL_FRAG(p)->size;
}

#ifdef SHM_EXTRA_STATS
void parallel_stats_core_init(struct parallel_block *fm, int core_index);
unsigned long parallel_stats_get_index(void *ptr);
void parallel_stats_set_index(void *ptr, unsigned long idx);

#ifdef DBG_MALLOC
static inline const char *parallel_frag_file(void *p) { return F_PARALLEL_FRAG(p)->file; }
static inline const char *parallel_frag_func(void *p) { return F_PARALLEL_FRAG(p)->func; }
static inline unsigned long parallel_frag_line(void *p) { return F_PARALLEL_FRAG(p)->line; }
#else
static inline const char *parallel_frag_file(void *p) { return NULL; }
static inline const char *parallel_frag_func(void *p) { return NULL; }
static inline unsigned long parallel_frag_line(void *p) { return 0; }
#endif
#endif

#ifdef STATISTICS
static inline unsigned long parallel_get_size(struct parallel_block *fm)
{
  int i;
  unsigned long total_size=0;

  for (i=0;i<TOTAL_F_PARALLEL_POOLS;i++) {
    total_size += ((struct parallel_block *)shm_blocks[i])->size;
  }

  return total_size;
}
static inline unsigned long parallel_get_used(struct parallel_block *fm)
{
  int i;
  unsigned long total_size=0;

  for (i=0;i<TOTAL_F_PARALLEL_POOLS;i++) {
    total_size += ((struct parallel_block *)shm_blocks[i])->used;
  }

  return total_size;
}
static inline unsigned long parallel_get_free(struct parallel_block *fm)
{
  int i;
  unsigned long total_size=0;

  for (i=0;i<TOTAL_F_PARALLEL_POOLS;i++) {
    total_size += ((struct parallel_block *)shm_blocks[i])->size - 
      ((struct parallel_block *)shm_blocks[i])->real_used;
  }

  return total_size;
}
static inline unsigned long parallel_get_real_used(struct parallel_block *fm)
{
  int i;
  unsigned long total_size=0;

  for (i=0;i<TOTAL_F_PARALLEL_POOLS;i++) {
    total_size += ((struct parallel_block *)shm_blocks[i])->real_used;
  }

  return total_size;
}
static inline unsigned long parallel_get_max_real_used(struct parallel_block *fm)
{
  int i;
  unsigned long total_size=0;

  for (i=0;i<TOTAL_F_PARALLEL_POOLS;i++) {
    total_size += ((struct parallel_block *)shm_blocks[i])->max_real_used;
  }

  return total_size;
}
static inline unsigned long parallel_get_frags(struct parallel_block *fm)
{
  int i;
  unsigned long total_size=0;

  for (i=0;i<TOTAL_F_PARALLEL_POOLS;i++) {
    total_size += ((struct parallel_block *)shm_blocks[i])->fragments;
  }

  return total_size;
}

#endif /*STATISTICS*/

#endif

Coverage Report

Created: 2025-08-28 06:16

Line	Count	Source (jump to first uncovered line)
1		/*
2		* Copyright (C) 2001-2003 FhG Fokus
3		* Copyright (C) 2025 OpenSIPS Project
4		*
5		* This file is part of opensips, a free SIP server.
6		*
7		* opensips 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 2 of the License, or
10		* (at your option) any later version
11		*
12		* opensips 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, write to the Free Software
19		* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20		*/
21
22		#ifndef parallel_malloc_h
23		#define parallel_malloc_h
24
25		#include <stdio.h>
26		#include "meminfo.h"
27		#include "common.h"
28
29		#undef ROUNDTO
30
31	0	#define ROUNDTO 8UL /* address alignment, in bytes */
32
33	0	#define F_PARALLEL_MALLOC_OPTIMIZE_FACTOR 14UL /used below /
34
35		/* size to optimize for, (most allocs <= this size), must be 2^k */
36	0	#define F_PARALLEL_MALLOC_OPTIMIZE (1UL << F_PARALLEL_MALLOC_OPTIMIZE_FACTOR)
37
38	0	#define F_PARALLEL_HASH_SIZE (F_PARALLEL_MALLOC_OPTIMIZE/ROUNDTO + \
39	0	(sizeof(long)*8-F_PARALLEL_MALLOC_OPTIMIZE_FACTOR)+1)