File: mallinfo.c

package info (click to toggle)
valgrind 1%3A3.24.0-3
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 176,332 kB
  • sloc: ansic: 795,029; exp: 26,134; xml: 23,472; asm: 14,393; cpp: 9,397; makefile: 7,464; sh: 6,122; perl: 5,446; python: 1,498; javascript: 981; awk: 166; csh: 1
file content (133 lines) | stat: -rw-r--r-- 2,786 bytes parent folder | download | duplicates (10)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
#include "tests/malloc.h"
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h> // getopt()
#include "../config.h"


static int s_quiet = 0;


#if defined(HAVE_MALLINFO)
static size_t check(size_t min, size_t max)
{
  struct mallinfo mi;
  size_t used;

  mi = mallinfo();

  if (! s_quiet)
  {
    printf("arena = %d\n", mi.arena);	    /* non-mmapped space allocated from system */
    printf("ordblks = %d\n", mi.ordblks);   /* number of free chunks */
    printf("smblks = %d\n", mi.smblks);	    /* number of fastbin blocks */
    printf("hblks = %d\n", mi.hblks);	    /* number of mmapped regions */
    printf("hblkhd = %d\n", mi.hblkhd);	    /* space in mmapped regions */
    printf("usmblks = %d\n", mi.usmblks);   /* maximum total allocated space */
    printf("fsmblks = %d\n", mi.fsmblks);   /* space available in freed fastbin blocks */
    printf("uordblks = %d\n", mi.uordblks); /* total allocated space */
    printf("fordblks = %d\n", mi.fordblks); /* total free space */
    printf("keepcost = %d\n", mi.keepcost); /* top-most, releasable (via malloc_trim) space */
    printf("(min = %zu, max = %zu)\n", min, max);
    printf("\n");
  }

  // size checks
  used = mi.uordblks + mi.hblkhd;
  if (used < min)
    exit(1);

  if (used > max)
    exit(2);

  // used should be reasonably close to min
  // define "reasonably" as within 20%
  if (used/5*4 > min)
    exit(3);

  // sanity checks
  if ((mi.ordblks == 0) != (mi.fordblks == 0))
    exit(10);

  if ((mi.smblks == 0) != (mi.fsmblks == 0))
    exit(11);

  if ((mi.hblks == 0) != (mi.hblkhd == 0))
    exit(12);

  if (mi.keepcost > mi.fordblks)
    exit(13);

  if (mi.fsmblks > mi.fordblks)
    exit(14);

  // arena should be reasonably close to fordblks + uordblks
  if (mi.arena < mi.fordblks + mi.uordblks)
    exit(15);

  if (mi.arena/5*4 > mi.fordblks + mi.uordblks)
    exit(16);

  return used;
}
#else
static size_t check(size_t min, size_t max)
{
  if (! s_quiet)
  {
    printf("mallinfo() is not supported on this platform.\n");
    printf("\n");
  }
  return 0;
}
#endif

int main(int argc, char** argv)
{
  void* ptr[40];
  int i;
  size_t min, max;
  int optchar;

  while ((optchar = getopt(argc, argv, "q")) != EOF)
  {
    switch (optchar)
    {
    case 'q':
      s_quiet = 1;
      break;
    default:
      fprintf(stderr, "Usage: %s [-q].\n", argv[0]);
      return 1;
    }
  }

  min = 0;
  for (i = 1; i <= 40; i++)
  {
    int size = i * i * 8;
    min += size;
    ptr[i - 1] = malloc(size);
  };

  max = check(min, (size_t)-1);

  for (i = 1; i <= 20; i++)
  {
    int size = i * i * 8;
    min -= size;
    max -= size;
    free(ptr[i - 1]);
  };

  check(min, max);

  for ( ; i <= 40; i++)
  {
    free(ptr[i - 1]);
  }

  fprintf(stderr, "Success.\n");

  return 0;
}