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
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
|
/**
* @file llluamanager_test.cpp
* @author Nat Goodspeed
* @date 2023-09-28
* @brief Test for llluamanager.
*
* $LicenseInfo:firstyear=2023&license=viewerlgpl$
* Copyright (c) 2023, Linden Research, Inc.
* $/LicenseInfo$
*/
// Precompiled header
//#include "llviewerprecompiledheaders.h"
// associated header
#include "../newview/llluamanager.h"
// STL headers
// std headers
#include <vector>
// external library headers
// other Linden headers
#include "../llcommon/tests/StringVec.h"
#include "../test/lltut.h"
#include "llapp.h"
#include "lldate.h"
#include "llevents.h"
#include "lleventcoro.h"
#include "llsdutil.h"
#include "lluri.h"
#include "lluuid.h"
#include "lua_function.h"
#include "lualistener.h"
#include "stringize.h"
class LLTestApp : public LLApp
{
public:
bool init() override { return true; }
bool cleanup() override { return true; }
bool frame() override { return true; }
};
template <typename CALLABLE>
auto listener(CALLABLE&& callable)
{
return [callable=std::forward<CALLABLE>(callable)]
(const LLSD& data)
{
callable(data);
return false;
};
}
/*****************************************************************************
* TUT
*****************************************************************************/
namespace tut
{
struct llluamanager_data
{
// We need an LLApp instance because LLLUAmanager uses coroutines,
// which suspend, and when a coroutine suspends it checks LLApp state,
// and if it's not APP_STATUS_RUNNING the coroutine terminates.
LLTestApp mApp;
};
typedef test_group<llluamanager_data> llluamanager_group;
typedef llluamanager_group::object object;
llluamanager_group llluamanagergrp("llluamanager");
static struct LuaExpr
{
std::string desc, expr;
LLSD expect;
} lua_expressions[] = {
{ "nil", "nil", LLSD() },
{ "true", "true", true },
{ "false", "false", false },
{ "int", "17", 17 },
{ "real", "3.14", 3.14 },
{ "string", "'string'", "string" },
// can't synthesize Lua userdata in Lua code: that can only be
// constructed by a C function
{ "empty table", "{}", LLSD() },
{ "nested empty table", "{ 1, 2, 3, {}, 5 }",
llsd::array(1, 2, 3, LLSD(), 5) },
{ "nested non-empty table", "{ 1, 2, 3, {a=0, b=1}, 5 }",
llsd::array(1, 2, 3, llsd::map("a", 0, "b", 1), 5) },
};
template<> template<>
void object::test<1>()
{
set_test_name("test Lua results");
LuaState L;
for (auto& luax : lua_expressions)
{
auto [count, result] =
LLLUAmanager::waitScriptLine(L, "return " + luax.expr);
auto desc{ stringize("waitScriptLine(", luax.desc, "): ") };
// if count < 0, report Lua error message
ensure_equals(desc + result.asString(), count, 1);
ensure_equals(desc + "result", result, luax.expect);
}
}
void from_lua(const std::string& desc, const std::string_view& construct, const LLSD& expect)
{
LLSD fromlua;
LLEventStream replypump("testpump");
LLTempBoundListener conn(
replypump.listen("llluamanager_test",
listener([&fromlua](const LLSD& data){ fromlua = data; })));
const std::string lua(stringize(
"data = ", construct, "\n"
"post_on('testpump', data)\n"
));
LuaState L;
auto [count, result] = LLLUAmanager::waitScriptLine(L, lua);
// We woke up again ourselves because the coroutine running Lua has
// finished. But our Lua chunk didn't actually return anything, so we
// expect count to be 0 and result to be undefined.
ensure_equals(desc + ": " + result.asString(), count, 0);
ensure_equals(desc, fromlua, expect);
}
template<> template<>
void object::test<2>()
{
set_test_name("LLSD from post_on()");
for (auto& luax : lua_expressions)
{
from_lua(luax.desc, luax.expr, luax.expect);
}
}
template<> template<>
void object::test<3>()
{
set_test_name("test post_on(), get_event_pumps(), get_event_next()");
StringVec posts;
LLEventStream replypump("testpump");
LLTempBoundListener conn(
replypump.listen("test<3>",
listener([&posts](const LLSD& data)
{ posts.push_back(data.asString()); })));
const std::string lua(
"-- test post_on,get_event_pumps,get_event_next\n"
"post_on('testpump', 'entry')\n"
"post_on('testpump', 'get_event_pumps()')\n"
"replypump, cmdpump = get_event_pumps()\n"
"post_on('testpump', replypump)\n"
"post_on('testpump', 'get_event_next()')\n"
"pump, data = get_event_next()\n"
"post_on('testpump', data)\n"
"post_on('testpump', 'exit')\n"
);
LuaState L;
// It's important to let the startScriptLine() coroutine run
// concurrently with ours until we've had a chance to post() our
// reply.
auto future = LLLUAmanager::startScriptLine(L, lua);
StringVec expected{
"entry",
"get_event_pumps()",
"",
"get_event_next()",
"message",
"exit"
};
expected[2] = posts.at(2);
LL_DEBUGS() << "Found pumpname '" << expected[2] << "'" << LL_ENDL;
LLEventPump& luapump{ LLEventPumps::instance().obtain(expected[2]) };
LL_DEBUGS() << "Found pump '" << luapump.getName() << "', type '"
<< LLError::Log::classname(luapump)
<< "': post('" << expected[4] << "')" << LL_ENDL;
luapump.post(expected[4]);
auto [count, result] = future.get();
ensure_equals("post_on(): " + result.asString(), count, 0);
ensure_equals("post_on() sequence", posts, expected);
}
void round_trip(const std::string& desc, const LLSD& send, const LLSD& expect)
{
LLEventMailDrop replypump("testpump");
const std::string lua(
"-- test LLSD round trip\n"
"replypump, cmdpump = get_event_pumps()\n"
"post_on('testpump', replypump)\n"
"pump, data = get_event_next()\n"
"return data\n"
);
LuaState L;
auto future = LLLUAmanager::startScriptLine(L, lua);
// We woke up again ourselves because the coroutine running Lua has
// reached the get_event_next() call, which suspends the calling C++
// coroutine (including the Lua code running on it) until we post
// something to that reply pump.
auto luapump{ llcoro::suspendUntilEventOn(replypump).asString() };
LLEventPumps::instance().post(luapump, send);
// The C++ coroutine running the Lua script is now ready to run. Run
// it so it will echo the LLSD back to us.
auto [count, result] = future.get();
ensure_equals(stringize("round_trip(", desc, "): ", result.asString()), count, 1);
ensure_equals(desc, result, expect);
}
// Define an RTItem to be used for round-trip LLSD testing: what it is,
// what we send to Lua, what we expect to get back. They could be the
// same.
struct RTItem
{
RTItem(const std::string& name, const LLSD& send, const LLSD& expect):
mName(name),
mSend(send),
mExpect(expect)
{}
RTItem(const std::string& name, const LLSD& both):
mName(name),
mSend(both),
mExpect(both)
{}
std::string mName;
LLSD mSend, mExpect;
};
template<> template<>
void object::test<4>()
{
set_test_name("LLSD round trip");
LLSD::Binary binary{ 3, 1, 4, 1, 5, 9, 2, 6, 5 };
const char* uuid{ "01234567-abcd-0123-4567-0123456789ab" };
const char* date{ "2023-10-04T21:06:00Z" };
const char* uri{ "https://secondlife.com/index.html" };
std::vector<RTItem> items{
RTItem("undefined", LLSD()),
RTItem("true", true),
RTItem("false", false),
RTItem("int", 17),
RTItem("real", 3.14),
RTItem("int real", 27.0, 27),
RTItem("string", "string"),
RTItem("binary", binary),
RTItem("empty array", LLSD::emptyArray(), LLSD()),
RTItem("empty map", LLSD::emptyMap(), LLSD()),
RTItem("UUID", LLUUID(uuid), uuid),
RTItem("date", LLDate(date), date),
RTItem("uri", LLURI(uri), uri)
};
// scalars
for (const auto& item: items)
{
round_trip(item.mName, item.mSend, item.mExpect);
}
// array
LLSD send_array{ LLSD::emptyArray() }, expect_array{ LLSD::emptyArray() };
for (const auto& item: items)
{
send_array.append(item.mSend);
expect_array.append(item.mExpect);
}
// exercise the array tail trimming below
send_array.append(items[0].mSend);
expect_array.append(items[0].mExpect);
// Lua takes a table value of nil to mean: don't store this key. An
// LLSD array containing undefined entries (converted to nil) leaves
// "holes" in the Lua table. These will be converted back to undefined
// LLSD entries -- except at the end. Trailing undefined entries are
// simply omitted from the table -- so the table converts back to a
// shorter LLSD array. We've constructed send_array and expect_array
// according to 'items' above -- but truncate from expect_array any
// trailing entries whose mSend will map to Lua nil.
while (expect_array.size() > 0 &&
send_array[expect_array.size() - 1].isUndefined())
{
expect_array.erase(expect_array.size() - 1);
}
round_trip("array", send_array, expect_array);
// map
LLSD send_map{ LLSD::emptyMap() }, expect_map{ LLSD::emptyMap() };
for (const auto& item: items)
{
send_map[item.mName] = item.mSend;
// see comment in the expect_array truncation loop above --
// Lua never stores table entries with nil values
if (item.mSend.isDefined())
{
expect_map[item.mName] = item.mExpect;
}
}
round_trip("map", send_map, expect_map);
// deeply nested map: exceed Lua's default stack space (20),
// i.e. verify that we have the right checkstack() calls
for (int i = 0; i < 20; ++i)
{
LLSD new_send_map{ send_map }, new_expect_map{ expect_map };
new_send_map["nested map"] = send_map;
new_expect_map["nested map"] = expect_map;
send_map = new_send_map;
expect_map = new_expect_map;
}
round_trip("nested map", send_map, expect_map);
}
template<> template<>
void object::test<5>()
{
set_test_name("test leap.lua");
const std::string lua(
"-- test leap.lua\n"
"\n"
"fiber = require('fiber')\n"
"leap = require('leap')\n"
"-- debug = require('printf')\n"
"local function debug(...) end\n"
"\n"
"-- negative priority ensures catchall is always last\n"
"catchall = leap.WaitFor:new(-1, 'catchall')\n"
"function catchall:filter(pump, data)\n"
" debug('catchall:filter(%s, %s)', pump, data)\n"
" return data\n"
"end\n"
"\n"
"-- but first, catch events with 'special' key\n"
"catch_special = leap.WaitFor:new(2, 'catch_special')\n"
"function catch_special:filter(pump, data)\n"
" debug('catch_special:filter(%s, %s)', pump, data)\n"
" return if data['special'] ~= nil then data else nil\n"
"end\n"
"\n"
"function drain(waitfor)\n"
" debug('%s start', waitfor.name)\n"
" -- It seems as though we ought to be able to code this loop\n"
" -- over waitfor:wait() as:\n"
" -- for item in waitfor.wait, waitfor do\n"
" -- However, that seems to stitch a detour through C code into\n"
" -- the coroutine call stack, which prohibits coroutine.yield():\n"
" -- 'attempt to yield across metamethod/C-call boundary'\n"
" -- So we resort to two different calls to waitfor:wait().\n"
" local item = waitfor:wait()\n"
" while item do\n"
" debug('%s caught %s', waitfor.name, item)\n"
" item = waitfor:wait()\n"
" end\n"
" debug('%s done', waitfor.name)\n"
"end\n"
"\n"
"function requester(name)\n"
" debug('requester(%s) start', name)\n"
" local response = leap.request('testpump', {name=name})\n"
" debug('requester(%s) got %s', name, response)\n"
" -- verify that the correct response was dispatched to this coroutine\n"
" assert(response.name == name)\n"
"end\n"
"\n"
"-- fiber.print_all()\n"
"fiber.launch('catchall', drain, catchall)\n"
"fiber.launch('catch_special', drain, catch_special)\n"
"fiber.launch('requester(a)', requester, 'a')\n"
"-- requester(a)\n"
"fiber.launch('requester(b)', requester, 'b')\n"
"-- fiber.print_all()\n"
"-- fiber.run()\n"
);
LLSD requests;
LLEventStream pump("testpump", false);
LLTempBoundListener conn{
pump.listen("test<5>()",
listener([&requests](const LLSD& data)
{
LL_DEBUGS("Lua") << "testpump got: " << data << LL_ENDL;
requests.append(data);
}))
};
LuaState L;
auto future = LLLUAmanager::startScriptLine(L, lua);
auto replyname{ L.obtainListener()->getReplyName() };
auto& replypump{ LLEventPumps::instance().obtain(replyname) };
// By the time leap.process() calls get_event_next() and wakes us up,
// we expect that both requester() coroutines have posted and are
// waiting for a reply.
ensure_equals("didn't get both requests", requests.size(), 2);
// moreover, we expect they arrived in the order they were created
ensure_equals("a wasn't first", requests[0]["name"].asString(), "a");
ensure_equals("b wasn't second", requests[1]["name"].asString(), "b");
replypump.post(llsd::map("special", "K"));
// respond to requester(b) FIRST
replypump.post(requests[1]);
replypump.post(llsd::map("name", "not special"));
// now respond to requester(a)
replypump.post(requests[0]);
// tell leap.process() we're done
replypump.post(LLSD());
auto [count, result] = future.get();
ensure_equals("leap.lua: " + result.asString(), count, 0);
}
} // namespace tut
|