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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
|
/**
* @file llsdutil.cpp
* @author Phoenix
* @date 2006-05-24
* @brief Implementation of classes, functions, etc, for using structured data.
*
* Copyright (c) 2006-2007, Linden Research, Inc.
*
* The source code in this file ("Source Code") is provided by Linden Lab
* to you under the terms of the GNU General Public License, version 2.0
* ("GPL"), unless you have obtained a separate licensing agreement
* ("Other License"), formally executed by you and Linden Lab. Terms of
* the GPL can be found in doc/GPL-license.txt in this distribution, or
* online at http://secondlife.com/developers/opensource/gplv2
*
* There are special exceptions to the terms and conditions of the GPL as
* it is applied to this Source Code. View the full text of the exception
* in the file doc/FLOSS-exception.txt in this software distribution, or
* online at http://secondlife.com/developers/opensource/flossexception
*
* By copying, modifying or distributing this software, you acknowledge
* that you have read and understood your obligations described above,
* and agree to abide by those obligations.
*
* ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
* WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
* COMPLETENESS OR PERFORMANCE.
*/
#include "linden_common.h"
#include "llsdutil.h"
#if LL_WINDOWS
# define WIN32_LEAN_AND_MEAN
# include <winsock2.h> // for htonl
#elif LL_LINUX
# include <netinet/in.h>
#elif LL_DARWIN
# include <arpa/inet.h>
#endif
// vector3
LLSD ll_sd_from_vector3(const LLVector3& vec)
{
LLSD rv;
rv.append((F64)vec.mV[VX]);
rv.append((F64)vec.mV[VY]);
rv.append((F64)vec.mV[VZ]);
return rv;
}
LLVector3 ll_vector3_from_sd(const LLSD& sd, S32 start_index)
{
LLVector3 rv;
rv.mV[VX] = (F32)sd[start_index].asReal();
rv.mV[VY] = (F32)sd[++start_index].asReal();
rv.mV[VZ] = (F32)sd[++start_index].asReal();
return rv;
}
// vector3d
LLSD ll_sd_from_vector3d(const LLVector3d& vec)
{
LLSD rv;
rv.append(vec.mdV[VX]);
rv.append(vec.mdV[VY]);
rv.append(vec.mdV[VZ]);
return rv;
}
LLVector3d ll_vector3d_from_sd(const LLSD& sd, S32 start_index)
{
LLVector3d rv;
rv.mdV[VX] = sd[start_index].asReal();
rv.mdV[VY] = sd[++start_index].asReal();
rv.mdV[VZ] = sd[++start_index].asReal();
return rv;
}
//vector2
LLSD ll_sd_from_vector2(const LLVector2& vec)
{
LLSD rv;
rv.append((F64)vec.mV[VX]);
rv.append((F64)vec.mV[VY]);
return rv;
}
LLVector2 ll_vector2_from_sd(const LLSD& sd)
{
LLVector2 rv;
rv.mV[VX] = (F32)sd[0].asReal();
rv.mV[VY] = (F32)sd[1].asReal();
return rv;
}
// Quaternion
LLSD ll_sd_from_quaternion(const LLQuaternion& quat)
{
LLSD rv;
rv.append((F64)quat.mQ[VX]);
rv.append((F64)quat.mQ[VY]);
rv.append((F64)quat.mQ[VZ]);
rv.append((F64)quat.mQ[VW]);
return rv;
}
LLQuaternion ll_quaternion_from_sd(const LLSD& sd)
{
LLQuaternion quat;
quat.mQ[VX] = (F32)sd[0].asReal();
quat.mQ[VY] = (F32)sd[1].asReal();
quat.mQ[VZ] = (F32)sd[2].asReal();
quat.mQ[VW] = (F32)sd[3].asReal();
return quat;
}
// color4
LLSD ll_sd_from_color4(const LLColor4& c)
{
LLSD rv;
rv.append(c.mV[0]);
rv.append(c.mV[1]);
rv.append(c.mV[2]);
rv.append(c.mV[3]);
return rv;
}
LLColor4 ll_color4_from_sd(const LLSD& sd)
{
LLColor4 c;
c.mV[0] = (F32)sd[0].asReal();
c.mV[1] = (F32)sd[1].asReal();
c.mV[2] = (F32)sd[2].asReal();
c.mV[3] = (F32)sd[3].asReal();
return c;
}
// U32
LLSD ll_sd_from_U32(const U32 val)
{
std::vector<U8> v;
U32 net_order = htonl(val);
v.resize(4);
memcpy(&(v[0]), &net_order, 4); /* Flawfinder: ignore */
return LLSD(v);
}
U32 ll_U32_from_sd(const LLSD& sd)
{
U32 ret;
std::vector<U8> v = sd.asBinary();
if (v.size() < 4)
{
return 0;
}
memcpy(&ret, &(v[0]), 4); /* Flawfinder: ignore */
ret = ntohl(ret);
return ret;
}
//U64
LLSD ll_sd_from_U64(const U64 val)
{
std::vector<U8> v;
U32 high, low;
high = (U32)(val >> 32);
low = (U32)val;
high = htonl(high);
low = htonl(low);
v.resize(8);
memcpy(&(v[0]), &high, 4); /* Flawfinder: ignore */
memcpy(&(v[4]), &low, 4); /* Flawfinder: ignore */
return LLSD(v);
}
U64 ll_U64_from_sd(const LLSD& sd)
{
U32 high, low;
std::vector<U8> v = sd.asBinary();
if (v.size() < 8)
{
return 0;
}
memcpy(&high, &(v[0]), 4); /* Flawfinder: ignore */
memcpy(&low, &(v[4]), 4); /* Flawfinder: ignore */
high = ntohl(high);
low = ntohl(low);
return ((U64)high) << 32 | low;
}
// IP Address (stored in net order in a U32, so don't need swizzling)
LLSD ll_sd_from_ipaddr(const U32 val)
{
std::vector<U8> v;
v.resize(4);
memcpy(&(v[0]), &val, 4); /* Flawfinder: ignore */
return LLSD(v);
}
U32 ll_ipaddr_from_sd(const LLSD& sd)
{
U32 ret;
std::vector<U8> v = sd.asBinary();
if (v.size() < 4)
{
return 0;
}
memcpy(&ret, &(v[0]), 4); /* Flawfinder: ignore */
return ret;
}
// Converts an LLSD binary to an LLSD string
LLSD ll_string_from_binary(const LLSD& sd)
{
std::vector<U8> value = sd.asBinary();
char* c_str = new char[value.size() + 1];
memcpy(c_str, &value[0], value.size());
c_str[value.size()] = '\0';
return c_str;
}
|
