blob: 474cf4506d2ac2d9d9dc2328a5badc4c18f74e14 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
#include "common.hpp"
#include <string>
namespace
{
int allocate_count = 0;
int deallocate_count = 0;
void* allocate(size_t size)
{
++allocate_count;
return new char[size];
}
void deallocate(void* ptr)
{
++deallocate_count;
delete[] reinterpret_cast<char*>(ptr);
}
}
TEST(custom_memory_management)
{
// remember old functions
allocation_function old_allocate = get_memory_allocation_function();
deallocation_function old_deallocate = get_memory_deallocation_function();
// replace functions
set_memory_management_functions(allocate, deallocate);
{
// parse document
xml_document doc;
CHECK(doc.load(STR("<node />")));
CHECK(allocate_count == 2);
CHECK(deallocate_count == 0);
// modify document
doc.child(STR("node")).set_name(STR("foobars"));
CHECK(allocate_count == 2);
CHECK(deallocate_count == 0);
}
CHECK(allocate_count == 2);
CHECK(deallocate_count == 2);
// restore old functions
set_memory_management_functions(old_allocate, old_deallocate);
}
TEST(large_allocations)
{
xml_document doc;
// initial fill
for (size_t i = 0; i < 128; ++i)
{
std::basic_string<pugi::char_t> s(i * 128, 'x');
CHECK(doc.append_child(node_pcdata).set_value(s.c_str()));
}
// grow-prune loop
while (doc.first_child())
{
pugi::xml_node node;
// grow
for (node = doc.first_child(); node; node = node.next_sibling())
{
std::basic_string<pugi::char_t> s = node.value();
CHECK(node.set_value((s + s).c_str()));
}
// prune
for (node = doc.first_child(); node; )
{
pugi::xml_node next = node.next_sibling().next_sibling();
node.parent().remove_child(node);
node = next;
}
}
}
|
