15821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Copyright (c) 2004, Google Inc. 25821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// All rights reserved. 35821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 45821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Redistribution and use in source and binary forms, with or without 55821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// modification, are permitted provided that the following conditions are 65821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// met: 75821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 85821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// * Redistributions of source code must retain the above copyright 95821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// notice, this list of conditions and the following disclaimer. 105821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// * Redistributions in binary form must reproduce the above 115821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// copyright notice, this list of conditions and the following disclaimer 125821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// in the documentation and/or other materials provided with the 135821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// distribution. 145821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// * Neither the name of Google Inc. nor the names of its 155821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// contributors may be used to endorse or promote products derived from 165821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// this software without specific prior written permission. 175821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 185821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 195821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 205821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 215821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 225821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 235821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 245821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 255821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 265821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 275821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 285821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 295821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 305821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// --- 315821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Author: Sanjay Ghemawat 325821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 335821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Check memalign related routines. 345821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 355821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// We can't really do a huge amount of checking, but at the very 365821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// least, the following code checks that return values are properly 375821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// aligned, and that writing into the objects works. 385821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 395821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include "config_for_unittests.h" 405821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 415821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Complicated ordering requirements. tcmalloc.h defines (indirectly) 425821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// _POSIX_C_SOURCE, which it needs so stdlib.h defines posix_memalign. 435821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// unistd.h, on the other hand, requires _POSIX_C_SOURCE to be unset, 445821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// at least on Mac OS X, in order to define getpagesize. The solution 455821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// is to #include unistd.h first. This is safe because unistd.h 465821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// doesn't sub-include stdlib.h, so we'll still get posix_memalign 475821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// when we #include stdlib.h. Blah. 485821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#ifdef HAVE_UNISTD_H 495821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <unistd.h> // for getpagesize() 505821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#endif 515821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include "tcmalloc.h" // must come early, to pick up posix_memalign 525821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <assert.h> 535821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <stdlib.h> // defines posix_memalign 545821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <stdio.h> // for the printf at the end 555821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#ifdef HAVE_STDINT_H 565821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <stdint.h> // for uintptr_t 575821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#endif 585821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#ifdef HAVE_UNISTD_H 595821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <unistd.h> // for getpagesize() 605821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#endif 615821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Malloc can be in several places on older versions of OS X. 625821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#if defined(HAVE_MALLOC_H) 635821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <malloc.h> // for memalign() and valloc() 645821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#elif defined(HAVE_MALLOC_MALLOC_H) 655821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <malloc/malloc.h> 665821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#elif defined(HAVE_SYS_MALLOC_H) 675821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <sys/malloc.h> 685821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#endif 695821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include "base/basictypes.h" 705821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include "base/logging.h" 715821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include "tests/testutil.h" 725821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 735821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 745821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Return the next interesting size/delta to check. Returns -1 if no more. 755821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)static int NextSize(int size) { 765821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) if (size < 100) { 775821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return size+1; 785821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } else if (size < 1048576) { 795821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // Find next power of two 805821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) int power = 1; 815821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) while (power < size) { 825821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) power <<= 1; 835821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 845821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 855821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // Yield (power-1, power, power+1) 865821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) if (size < power-1) { 875821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return power-1; 885821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } else if (size == power-1) { 895821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return power; 905821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } else { 915821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) assert(size == power); 925821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return power+1; 935821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 945821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } else { 955821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return -1; 965821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 975821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 985821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 995821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Shortform for cast 1005821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)static uintptr_t Number(void* p) { 1015821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return reinterpret_cast<uintptr_t>(p); 1025821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1035821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1045821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Check alignment 1055821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)static void CheckAlignment(void* p, int align) { 1065821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) if ((Number(p) & (align-1)) != 0) 1075821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) LOG(FATAL, "wrong alignment; wanted 0x%x; got %p\n", align, p); 1085821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1095821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1105821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Fill a buffer of the specified size with a predetermined pattern 1115821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)static void Fill(void* p, int n, char seed) { 1125821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) unsigned char* buffer = reinterpret_cast<unsigned char*>(p); 1135821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int i = 0; i < n; i++) { 1145821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) buffer[i] = ((seed + i) & 0xff); 1155821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1165821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1175821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1185821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Check that the specified buffer has the predetermined pattern 1195821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// generated by Fill() 1205821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)static bool Valid(const void* p, int n, char seed) { 1215821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) const unsigned char* buffer = reinterpret_cast<const unsigned char*>(p); 1225821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int i = 0; i < n; i++) { 1235821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) if (buffer[i] != ((seed + i) & 0xff)) { 1245821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return false; 1255821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1265821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1275821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return true; 1285821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1295821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1305821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)int main(int argc, char** argv) { 1315821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) SetTestResourceLimit(); 1325821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1335821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // Try allocating data with a bunch of alignments and sizes 1345821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int a = 1; a < 1048576; a *= 2) { 1355821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int s = 0; s != -1; s = NextSize(s)) { 1365821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) void* ptr = memalign(a, s); 1375821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CheckAlignment(ptr, a); 1385821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) Fill(ptr, s, 'x'); 1395821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(Valid(ptr, s, 'x')); 1405821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) free(ptr); 1415821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1425821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) if ((a >= sizeof(void*)) && ((a & (a-1)) == 0)) { 1435821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(posix_memalign(&ptr, a, s) == 0); 1445821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CheckAlignment(ptr, a); 1455821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) Fill(ptr, s, 'y'); 1465821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(Valid(ptr, s, 'y')); 1475821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) free(ptr); 1485821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1495821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1505821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1515821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1525821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) { 1535821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // Check various corner cases 1545821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) void* p1 = memalign(1<<20, 1<<19); 1555821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) void* p2 = memalign(1<<19, 1<<19); 1565821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) void* p3 = memalign(1<<21, 1<<19); 1575821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CheckAlignment(p1, 1<<20); 1585821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CheckAlignment(p2, 1<<19); 1595821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CheckAlignment(p3, 1<<21); 1605821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) Fill(p1, 1<<19, 'a'); 1615821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) Fill(p2, 1<<19, 'b'); 1625821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) Fill(p3, 1<<19, 'c'); 1635821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(Valid(p1, 1<<19, 'a')); 1645821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(Valid(p2, 1<<19, 'b')); 1655821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(Valid(p3, 1<<19, 'c')); 1665821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) free(p1); 1675821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) free(p2); 1685821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) free(p3); 1695821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1705821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1715821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) { 1725821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // posix_memalign 1735821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) void* ptr; 1745821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(posix_memalign(&ptr, 0, 1) == EINVAL); 1755821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(posix_memalign(&ptr, sizeof(void*)/2, 1) == EINVAL); 1765821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(posix_memalign(&ptr, sizeof(void*)+1, 1) == EINVAL); 1775821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(posix_memalign(&ptr, 4097, 1) == EINVAL); 1785821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1795821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // Grab some memory so that the big allocation below will definitely fail. 1805821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) void* p_small = malloc(4*1048576); 1815821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(p_small != NULL); 1825821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1835821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // Make sure overflow is returned as ENOMEM 1845821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) const size_t zero = 0; 1855821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) static const size_t kMinusNTimes = 10; 1865821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for ( size_t i = 1; i < kMinusNTimes; ++i ) { 1875821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) int r = posix_memalign(&ptr, 1024, zero - i); 1885821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(r == ENOMEM); 1895821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1905821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1915821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) free(p_small); 1925821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1935821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1945821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) const int pagesize = getpagesize(); 1955821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) { 1965821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // valloc 1975821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int s = 0; s != -1; s = NextSize(s)) { 1985821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) void* p = valloc(s); 1995821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CheckAlignment(p, pagesize); 2005821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) Fill(p, s, 'v'); 2015821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(Valid(p, s, 'v')); 2025821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) free(p); 2035821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 2045821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 2055821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 2065821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) { 2075821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) // pvalloc 2085821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) for (int s = 0; s != -1; s = NextSize(s)) { 2095821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) void* p = pvalloc(s); 2105821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CheckAlignment(p, pagesize); 2115821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) int alloc_needed = ((s + pagesize - 1) / pagesize) * pagesize; 2125821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) Fill(p, alloc_needed, 'x'); 2135821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) CHECK(Valid(p, alloc_needed, 'x')); 2145821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) free(p); 2155821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 2165821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 2175821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 2185821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) printf("PASS\n"); 2195821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return 0; 2205821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 221