/* Test of allocating memory with given alignment.

   Copyright (C) 2020-2026 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>, 2020.  */

#include <config.h>

/* Specification.  */
#include <stdlib.h>

#include <stdcountof.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>

#include "macros.h"

int
main (int argc, char *argv[])
{
#if HAVE_POSIX_MEMALIGN
  static size_t sizes[] =
    {
      13, 8, 17, 450, 320, 1, 99, 4, 15, 16, 2, 76, 37, 127, 2406, 641, 5781,
      /* Test also a zero size.  */
      0
    };
  void *aligned2_blocks[countof (sizes)];
  void *aligned4_blocks[countof (sizes)];
  void *aligned8_blocks[countof (sizes)];
  void *aligned16_blocks[countof (sizes)];
  void *aligned32_blocks[countof (sizes)];
  void *aligned64_blocks[countof (sizes)];

  for (size_t i = 0; i < countof (sizes); i++)
    {
      size_t size = sizes[i];

      if (sizeof (void *) <= 2)
        {
          ASSERT (posix_memalign (&aligned2_blocks[i], 2, size) == 0);
          ASSERT (aligned2_blocks[i] != NULL);
          ASSERT (((uintptr_t) aligned2_blocks[i] % 2) == 0);
          memset (aligned2_blocks[i], 'u', size);
        }

      if (sizeof (void *) <= 4)
        {
          ASSERT (posix_memalign (&aligned4_blocks[i], 4, size) == 0);
          ASSERT (aligned4_blocks[i] != NULL);
          ASSERT (((uintptr_t) aligned4_blocks[i] % 4) == 0);
          memset (aligned4_blocks[i], 'v', size);
        }

      if (sizeof (void *) <= 8)
        {
          ASSERT (posix_memalign (&aligned8_blocks[i], 8, size) == 0);
          ASSERT (aligned8_blocks[i] != NULL);
          ASSERT (((uintptr_t) aligned8_blocks[i] % 8) == 0);
          memset (aligned8_blocks[i], 'w', size);
        }

      ASSERT (posix_memalign (&aligned16_blocks[i], 16, size) == 0);
      ASSERT (aligned16_blocks[i] != NULL);
      ASSERT (((uintptr_t) aligned16_blocks[i] % 16) == 0);
      memset (aligned16_blocks[i], 'x', size);

      ASSERT (posix_memalign (&aligned32_blocks[i], 32, size) == 0);
      ASSERT (aligned32_blocks[i] != NULL);
      ASSERT (((uintptr_t) aligned32_blocks[i] % 32) == 0);
      memset (aligned32_blocks[i], 'y', size);

      ASSERT (posix_memalign (&aligned64_blocks[i], 64, size) == 0);
      ASSERT (aligned64_blocks[i] != NULL);
      ASSERT (((uintptr_t) aligned64_blocks[i] % 64) == 0);
      memset (aligned64_blocks[i], 'z', size);
    }

  for (size_t i = 0; i < countof (sizes); i++)
    {
      if (sizeof (void *) <= 2)
        free (aligned2_blocks[i]);
      if (sizeof (void *) <= 4)
        free (aligned4_blocks[i]);
      if (sizeof (void *) <= 8)
        free (aligned8_blocks[i]);
      free (aligned16_blocks[i]);
      free (aligned32_blocks[i]);
      free (aligned64_blocks[i]);
    }

  return test_exit_status;
#else
  fputs ("Skipping test: function 'posix_memalign' does not exist\n", stderr);
  return 77;
#endif
}
