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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
// libTorrent - BitTorrent library
// Copyright (C) 2005-2007, Jari Sundell
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// In addition, as a special exception, the copyright holders give
// permission to link the code of portions of this program with the
// OpenSSL library under certain conditions as described in each
// individual source file, and distribute linked combinations
// including the two.
//
// You must obey the GNU General Public License in all respects for
// all of the code used other than OpenSSL. If you modify file(s)
// with this exception, you may extend this exception to your version
// of the file(s), but you are not obligated to do so. If you do not
// wish to do so, delete this exception statement from your version.
// If you delete this exception statement from all source files in the
// program, then also delete it here.
//
// Contact: Jari Sundell <jaris@ifi.uio.no>
//
// Skomakerveien 33
// 3185 Skoppum, NORWAY
#include "config.h"
#include <algorithm>
#include <rak/functional.h>
#include "object.h"
namespace torrent {
Object::Object(const Object& b) : m_state(b.type()) {
switch (type()) {
case type_none: break;
case type_value: m_value = b.m_value; break;
case type_string: m_string = new string_type(*b.m_string); break;
case type_list: m_list = new list_type(*b.m_list); break;
case type_map: m_map = new map_type(*b.m_map); break;
}
}
Object&
Object::operator = (const Object& src) {
if (&src == this)
return *this;
clear();
m_state = src.m_state;
switch (type()) {
case type_none: break;
case type_value: m_value = src.m_value; break;
case type_string: m_string = new string_type(*src.m_string); break;
case type_list: m_list = new list_type(*src.m_list); break;
case type_map: m_map = new map_type(*src.m_map); break;
}
return *this;
}
void
Object::clear() {
switch (type()) {
case type_none:
case type_value: break;
case type_string: delete m_string; break;
case type_list: delete m_list; break;
case type_map: delete m_map; break;
}
m_state = type_none;
}
Object&
Object::get_key(const std::string& k) {
check_throw(type_map);
map_type::iterator itr = m_map->find(k);
if (itr == m_map->end())
throw bencode_error("Object operator [" + k + "] could not find element");
return itr->second;
}
const Object&
Object::get_key(const std::string& k) const {
check_throw(type_map);
map_type::const_iterator itr = m_map->find(k);
if (itr == m_map->end())
throw bencode_error("Object operator [" + k + "] could not find element");
return itr->second;
}
Object&
Object::move(Object& src) {
if (this == &src)
return *this;
clear();
std::memcpy(this, &src, sizeof(Object));
std::memset(&src, 0, sizeof(Object));
return *this;
}
Object&
Object::swap(Object& src) {
char tmp[sizeof(Object)];
std::memcpy(tmp, &src, sizeof(Object));
std::memcpy(&src, this, sizeof(Object));
std::memcpy(this, tmp, sizeof(Object));
return *this;
}
Object&
Object::merge_copy(const Object& object, uint32_t maxDepth) {
if (maxDepth == 0)
return (*this = object);
if (object.is_map()) {
if (!is_map())
*this = Object(type_map);
map_type& dest = as_map();
map_type::iterator destItr = dest.begin();
map_type::const_iterator srcItr = object.as_map().begin();
map_type::const_iterator srcLast = object.as_map().end();
while (srcItr != srcLast) {
destItr = std::find_if(destItr, dest.end(), rak::less_equal(srcItr->first, rak::mem_ref(&map_type::value_type::first)));
if (srcItr->first < destItr->first)
// destItr remains valid and pointing to the next possible
// position.
dest.insert(destItr, *srcItr);
else
destItr->second.merge_copy(srcItr->second, maxDepth - 1);
srcItr++;
}
} else if (object.is_list()) {
if (!is_list())
*this = Object(type_list);
list_type& dest = as_list();
list_type::iterator destItr = dest.begin();
list_type::const_iterator srcItr = object.as_list().begin();
list_type::const_iterator srcLast = object.as_list().end();
while (srcItr != srcLast) {
if (destItr == dest.end())
destItr = dest.insert(destItr, *srcItr);
else
destItr->merge_copy(*srcItr, maxDepth - 1);
destItr++;
}
} else {
*this = object;
}
return *this;
}
}
|
