forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
85 lines
1.7 KiB
C++
85 lines
1.7 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// #include <memory>
|
|
|
|
// void* align(size_t alignment, size_t size, void*& ptr, size_t& space);
|
|
|
|
#include <memory>
|
|
#include <cassert>
|
|
|
|
int main()
|
|
{
|
|
const unsigned N = 20;
|
|
char buf[N];
|
|
void* r;
|
|
void* p = &buf[0];
|
|
std::size_t s = N;
|
|
r = std::align(4, 10, p, s);
|
|
assert(p == &buf[0]);
|
|
assert(r == p);
|
|
assert(s == N);
|
|
|
|
p = &buf[1];
|
|
s = N;
|
|
r = std::align(4, 10, p, s);
|
|
assert(p == &buf[4]);
|
|
assert(r == p);
|
|
assert(s == N-3);
|
|
|
|
p = &buf[2];
|
|
s = N;
|
|
r = std::align(4, 10, p, s);
|
|
assert(p == &buf[4]);
|
|
assert(r == p);
|
|
assert(s == N-2);
|
|
|
|
p = &buf[3];
|
|
s = N;
|
|
r = std::align(4, 10, p, s);
|
|
assert(p == &buf[4]);
|
|
assert(r == p);
|
|
assert(s == N-1);
|
|
|
|
p = &buf[4];
|
|
s = N;
|
|
r = std::align(4, 10, p, s);
|
|
assert(p == &buf[4]);
|
|
assert(r == p);
|
|
assert(s == N);
|
|
|
|
p = &buf[0];
|
|
s = N;
|
|
r = std::align(4, N, p, s);
|
|
assert(p == &buf[0]);
|
|
assert(r == p);
|
|
assert(s == N);
|
|
|
|
p = &buf[1];
|
|
s = N-1;
|
|
r = std::align(4, N-4, p, s);
|
|
assert(p == &buf[4]);
|
|
assert(r == p);
|
|
assert(s == N-4);
|
|
|
|
p = &buf[1];
|
|
s = N-1;
|
|
r = std::align(4, N-3, p, s);
|
|
assert(p == &buf[1]);
|
|
assert(r == nullptr);
|
|
assert(s == N-1);
|
|
|
|
p = &buf[0];
|
|
s = N;
|
|
r = std::align(1, N+1, p, s);
|
|
assert(p == &buf[0]);
|
|
assert(r == nullptr);
|
|
assert(s == N);
|
|
}
|