Branch
Hash :
7b089321
Author :
Date :
2025-01-01T09:24:36
maint: run 'make update-copyright'
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 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210
/* Test of obstack_[v]zprintf() with big results.
Copyright (C) 2024-2025 Free Software Foundation, Inc.
This program 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 3 of the License, or
(at your option) any later version.
This program 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, see <https://www.gnu.org/licenses/>. */
/* Written by Bruno Haible <bruno@clisp.org>, 2024. */
#include <config.h>
#include <stdio.h>
#include "obstack.h"
#include "physmem.h"
/* Get INT_MAX. */
#include <limits.h>
/* Get PTRDIFF_MAX. */
#include <stdint.h>
#include <errno.h>
#include <string.h>
#if HAVE_SETRLIMIT
# include <sys/types.h>
# include <sys/time.h>
# include <sys/resource.h>
#endif
#include "macros.h"
#define obstack_chunk_alloc malloc
#define obstack_chunk_free free
int
main ()
{
#if PTRDIFF_MAX == INT_MAX
fputs ("Skipping test: ptrdiff_t is not 64-bits wide\n", stderr);
return 77;
#else
bool skipped = false;
/* Disable core files that would be huge. */
# if HAVE_SETRLIMIT && defined RLIMIT_CORE
struct rlimit rl;
rl.rlim_cur = rl.rlim_max = 0;
setrlimit (RLIMIT_CORE, &rl);
# endif
/* The test below needs about 15 GiB of memory:
$ time /usr/bin/time -f "Max RSS: %M KiB" ./test-obstack-zprintf-big
Max RSS: 15730184 KiB
real 0m38,356s
user 0m29,715s
sys 0m8,640s
5 GiB for the inputs and up to 10 GiB for temporary output buffers. */
double needed = 15.0 * 1024 * 1024 * 1024;
double avail = physmem_claimable (1.0);
printf ("memory needed = %g MiB, available = %g MiB\n",
needed / 1024 / 1024, avail / 1024 / 1024);
if (avail >= needed)
{
/* Note: The malloc() calls can fail, due to ulimit of RLIMIT_DATA.
For example, on OpenBSD 7.5, the soft limit is 1.0 GiB or 1.5 GiB,
and you need "ulimit -d 16777216". */
struct obstack obs;
obstack_init (&obs);
/* Verify that obstack_zprintf() can return a string of size > 4 GiB. */
{
size_t n1 = 3 * (INT_MAX / 4) + 10;
size_t n2 = 3 * (INT_MAX / 4) + 20;
char *s1;
char *s2;
s1 = (char *) malloc (n1 + 1);
if (s1 != NULL)
{
memset (s1, 'a', n1);
s1[n1] = '\0';
s2 = (char *) malloc (n2 + 1);
if (s2 != NULL)
{
memset (s2, 'b', n2);
s1[n1] = '\0';
ptrdiff_t len = obstack_zprintf (&obs, "x%sy%sz", s1, s2);
if (len < 0)
{
ASSERT (errno == ENOMEM);
skipped = true;
}
else
{
char *s = obstack_finish (&obs);
ASSERT (len == n1 + n2 + 3);
size_t i;
for (i = 0; i < len; i++)
s[i] = (i == 0 ? 'x' :
i <= n1 ? 'a' :
i == n1 + 1 ? 'y' :
i <= n1 + n2 + 1 ? 'b' :
i == n1 + n2 + 2 ? 'z' :
'\0');
obstack_free (&obs, s);
}
free (s2);
}
free (s1);
}
}
/* Verify that obstack_zprintf() can take a string of size
> 2 GiB, < 4 GiB as argument. */
{
size_t n1 = 3 * (size_t) (INT_MAX / 2) + 10;
char *s1;
s1 = (char *) malloc (n1 + 1);
if (s1 != NULL)
{
memset (s1, 'a', n1);
s1[n1] = '\0';
ptrdiff_t len = obstack_zprintf (&obs, "x%sy", s1);
if (len < 0)
{
ASSERT (errno == ENOMEM);
skipped = true;
}
else
{
char *s = obstack_finish (&obs);
ASSERT (len == n1 + 2);
size_t i;
for (i = 0; i < len; i++)
s[i] = (i == 0 ? 'x' :
i <= n1 ? 'a' :
i == n1 + 1 ? 'y' :
'\0');
obstack_free (&obs, s);
}
free (s1);
}
}
/* Verify that obstack_zprintf() can take a string of size > 4 GiB
as argument. */
{
size_t n1 = 5 * (size_t) (INT_MAX / 2) + 10;
if (n1 > (size_t) INT_MAX)
{
char *s1;
s1 = (char *) malloc (n1 + 1);
if (s1 != NULL)
{
memset (s1, 'a', n1);
s1[n1] = '\0';
ptrdiff_t len = obstack_zprintf (&obs, "x%sy", s1);
if (len < 0)
{
ASSERT (errno == ENOMEM);
skipped = true;
}
else
{
char *s = obstack_finish (&obs);
ASSERT (len == n1 + 2);
size_t i;
for (i = 0; i < len; i++)
s[i] = (i == 0 ? 'x' :
i <= n1 ? 'a' :
i == n1 + 1 ? 'y' :
'\0');
obstack_free (&obs, s);
}
free (s1);
}
}
}
obstack_free (&obs, NULL);
}
else
skipped = true;
if (test_exit_status != EXIT_SUCCESS)
return test_exit_status;
if (skipped)
{
fputs ("Skipping test: not enough memory available\n", stderr);
return 77;
}
return 0;
#endif
}