1b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch// This test does enough allocation and deallocation that the time-unit, 2b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch// when measured in bytes -- 6,000,000,000 -- exceeds 32-bits. It also does 3b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch// it in a slightly uneven fashion so we get a range of different totals 4b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch// for the snapshots, including a zero-sized detailed snapshot. 5b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch 6b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch#include <stdlib.h> 7b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch 8014dc512cdd3e367bee49a713fdc5ed92584a3e5Ben Murdochint main(void) 9014dc512cdd3e367bee49a713fdc5ed92584a3e5Ben Murdoch{ 10b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch int i, *x1, *x2, *x3, *x4; 11958fae7ec3f466955f8e5b50fa5b8d38b9e91675Emily Bernier for (i = 0; i < 1500; i++) { 12b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch x1 = malloc( 800 * 1000); 13b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch x2 = malloc(1100 * 1000); 14b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch free(x1); 15b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch x3 = malloc(1200 * 1000); 16b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch free(x2); 17958fae7ec3f466955f8e5b50fa5b8d38b9e91675Emily Bernier free(x3); 18958fae7ec3f466955f8e5b50fa5b8d38b9e91675Emily Bernier x4 = malloc( 900 * 1000); 19958fae7ec3f466955f8e5b50fa5b8d38b9e91675Emily Bernier free(x4); 20958fae7ec3f466955f8e5b50fa5b8d38b9e91675Emily Bernier } 21958fae7ec3f466955f8e5b50fa5b8d38b9e91675Emily Bernier return 0; 22958fae7ec3f466955f8e5b50fa5b8d38b9e91675Emily Bernier} 23b8a8cc1952d61a2f3a2568848933943a543b5d3eBen Murdoch