1bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 2bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 3f5256e16dfc425c1d466f6308d4026d529ce9e0bHoward Hinnant// The LLVM Compiler Infrastructure 4bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 5b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 6b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// Source Licenses. See LICENSE.TXT for details. 7bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 8bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 9bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 10bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <list> 11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 12bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// iterator insert(const_iterator position, size_type n, const value_type& x); 13bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 145e57142c5902c3f73a6fdcb8cab55e88ffb43a56Howard Hinnant#if _LIBCPP_DEBUG >= 1 1579a35570a588a2e2a203afe87ca7dc52026ef7dbHoward Hinnant#define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) 1679a35570a588a2e2a203afe87ca7dc52026ef7dbHoward Hinnant#endif 1779a35570a588a2e2a203afe87ca7dc52026ef7dbHoward Hinnant 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <list> 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cstdlib> 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 22061d0cc4db18d17bf01ed14c5db0be098205bd47Marshall Clow#include "min_allocator.h" 2329f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint throw_next = 0xFFFF; 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint count = 0; 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid* operator new(std::size_t s) throw(std::bad_alloc) 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant if (throw_next == 0) 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant throw std::bad_alloc(); 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant --throw_next; 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant ++count; 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant return std::malloc(s); 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid operator delete(void* p) throw() 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant --count; 39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::free(p); 40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 43bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 4429f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant { 45bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int a1[] = {1, 2, 3}; 46bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int a2[] = {1, 4, 4, 4, 4, 4, 2, 3}; 47bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::list<int> l1(a1, a1+3); 48bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4); 49bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(i == next(l1.begin())); 50bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(l1 == std::list<int>(a2, a2+8)); 51bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant throw_next = 4; 52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int save_count = count; 53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant try 54bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 55bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant i = l1.insert(i, 5, 5); 56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(false); 57bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant catch (...) 59bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 60bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 61bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant throw_next = 0xFFFF; 62bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(save_count == count); 63bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(l1 == std::list<int>(a2, a2+8)); 6429f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant } 655e57142c5902c3f73a6fdcb8cab55e88ffb43a56Howard Hinnant#if _LIBCPP_DEBUG >= 1 6679a35570a588a2e2a203afe87ca7dc52026ef7dbHoward Hinnant { 6779a35570a588a2e2a203afe87ca7dc52026ef7dbHoward Hinnant std::list<int> c1(100); 6879a35570a588a2e2a203afe87ca7dc52026ef7dbHoward Hinnant std::list<int> c2; 6979a35570a588a2e2a203afe87ca7dc52026ef7dbHoward Hinnant std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1); 7079a35570a588a2e2a203afe87ca7dc52026ef7dbHoward Hinnant assert(false); 7179a35570a588a2e2a203afe87ca7dc52026ef7dbHoward Hinnant } 7279a35570a588a2e2a203afe87ca7dc52026ef7dbHoward Hinnant#endif 7329f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant#if __cplusplus >= 201103L 7429f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant { 7529f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant int a1[] = {1, 2, 3}; 7629f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant int a2[] = {1, 4, 4, 4, 4, 4, 2, 3}; 7729f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant std::list<int, min_allocator<int>> l1(a1, a1+3); 7829f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 5, 4); 7929f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant assert(i == next(l1.begin())); 8029f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant assert((l1 == std::list<int, min_allocator<int>>(a2, a2+8))); 8129f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant throw_next = 4; 8229f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant int save_count = count; 8329f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant try 8429f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant { 8529f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant i = l1.insert(i, 5, 5); 8629f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant assert(false); 8729f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant } 8829f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant catch (...) 8929f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant { 9029f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant } 9129f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant throw_next = 0xFFFF; 9229f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant assert(save_count == count); 9329f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant assert((l1 == std::list<int, min_allocator<int>>(a2, a2+8))); 9429f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant } 955e57142c5902c3f73a6fdcb8cab55e88ffb43a56Howard Hinnant#if _LIBCPP_DEBUG >= 1 9629f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant { 9729f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant std::list<int, min_allocator<int>> c1(100); 9829f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant std::list<int, min_allocator<int>> c2; 9929f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1); 10029f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant assert(false); 10129f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant } 10229f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant#endif 10329f7432ff3a5c503a98a66ae46dd571b651c88b5Howard Hinnant#endif 104bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 105