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
|
/*
--
-- CANCEL.CPP
--
-- Lane cancellation support
--
-- Author: Benoit Germain <bnt.germain@gmail.com>
--
--[[
===============================================================================
Copyright (C) 2011-2024 Benoit Germain <bnt.germain@gmail.com>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
===============================================================================
]]--
*/
#include "_pch.hpp"
#include "cancel.hpp"
#include "debugspew.hpp"
#include "lane.hpp"
// #################################################################################################
// #################################################################################################
/*
* Check if the thread in question ('L') has been signalled for cancel.
*
* Called by cancellation hooks and/or pending Linda operations (because then
* the check won't affect performance).
*
* Returns CANCEL_SOFT/HARD if any locks are to be exited, and 'raise_cancel_error()' called,
* to make execution of the lane end.
*/
[[nodiscard]]
CancelRequest CheckCancelRequest(lua_State* const L_)
{
auto const* const _lane{ kLanePointerRegKey.readLightUserDataValue<Lane>(L_) };
// 'lane' is nullptr for the original main state (and no-one can cancel that)
return _lane ? _lane->cancelRequest.load(std::memory_order_relaxed) : CancelRequest::None;
}
// #################################################################################################
// #################################################################################################
//---
// = lane_cancel( lane_ud [,timeout_secs=0.0] [,wake_lindas_bool=false] )
//
// The originator thread asking us specifically to cancel the other thread.
//
// 'timeout': <0: wait forever, until the lane is finished
// 0.0: just signal it to cancel, no time waited
// >0: time to wait for the lane to detect cancellation
//
// 'wake_lindas_bool': if true, signal any linda the thread is waiting on
// instead of waiting for its timeout (if any)
//
// Returns: true if the lane was already finished (Done/Error/Cancelled) or if we
// managed to cancel it.
// false if the cancellation timed out, or a kill was needed.
//
// #################################################################################################
// #################################################################################################
static std::optional<CancelOp> WhichCancelOp(std::string_view const& opString_)
{
if (opString_ == "soft") {
return std::make_optional<CancelOp>(CancelRequest::Soft, LuaHookMask::None);
} else if (opString_ == "hard") {
return std::make_optional<CancelOp>(CancelRequest::Hard, LuaHookMask::None);
} else if (opString_== "call") {
return std::make_optional<CancelOp>(CancelRequest::Hard, LuaHookMask::Call);
} else if (opString_ == "ret") {
return std::make_optional<CancelOp>(CancelRequest::Hard, LuaHookMask::Ret);
} else if (opString_ == "line") {
return std::make_optional<CancelOp>(CancelRequest::Hard, LuaHookMask::Line);
} else if (opString_ == "count") {
return std::make_optional<CancelOp>(CancelRequest::Hard, LuaHookMask::Count);
} else if (opString_ == "all") {
return std::make_optional<CancelOp>(CancelRequest::Hard, LuaHookMask::All);
}
return std::nullopt;
}
// #################################################################################################
[[nodiscard]]
static CancelOp WhichCancelOp(lua_State* const L_, StackIndex const idx_)
{
if (luaG_type(L_, idx_) == LuaType::STRING) {
std::string_view const _str{ luaG_tostring(L_, idx_) };
auto const _op{ WhichCancelOp(_str) };
lua_remove(L_, idx_); // argument is processed, remove it
if (!_op.has_value()) {
raise_luaL_error(L_, "Invalid cancel operation '%s'", _str.data());
}
return _op.value();
}
return CancelOp{ CancelRequest::Hard, LuaHookMask::None };
}
// #################################################################################################
// #################################################################################################
// ######################################### Lua API ###############################################
// #################################################################################################
// #################################################################################################
//---
// bool = cancel_test()
//
// Available inside the global namespace of a lane
// returns a boolean saying if a cancel request is pending
//
LUAG_FUNC(cancel_test)
{
CancelRequest const _test{ CheckCancelRequest(L_) };
lua_pushboolean(L_, _test != CancelRequest::None);
return 1;
}
// #################################################################################################
// bool[,reason] = lane_h:cancel( [cancel_op, hookcount] [, timeout] [, wake_lane])
LUAG_FUNC(lane_cancel)
{
Lane* const _lane{ ToLane(L_, StackIndex{ 1 }) }; // L_: lane [cancel_op, hookcount] [, timeout] [, wake_lane]
CancelOp const _op{ WhichCancelOp(L_, StackIndex{ 2 }) }; // L_: lane [hookcount] [, timeout] [, wake_lane]
int const _hook_count{ std::invoke([_op, L_]() {
if (_op.hookMask == LuaHookMask::None) {
// the caller shouldn't have provided a hook count in that case
return 0;
}
if (luaG_type(L_, StackIndex{ 2 }) != LuaType::NUMBER) {
raise_luaL_error(L_, "Hook count expected");
}
auto const _hook_count{ static_cast<int>(lua_tointeger(L_, 2)) };
lua_remove(L_, 2); // argument is processed, remove it // L_: lane [timeout] [, wake_lane]
if (_hook_count < 1) {
raise_luaL_error(L_, "Hook count cannot be < 1");
}
return _hook_count;
}) };
std::chrono::time_point<std::chrono::steady_clock> _until{ std::chrono::time_point<std::chrono::steady_clock>::max() };
if (luaG_type(L_, StackIndex{ 2 }) == LuaType::NUMBER) { // we don't want to use lua_isnumber() because of autocoercion
lua_Duration const duration{ lua_tonumber(L_, 2) };
if (duration.count() >= 0.0) {
_until = std::chrono::steady_clock::now() + std::chrono::duration_cast<std::chrono::steady_clock::duration>(duration);
} else {
raise_luaL_error(L_, "Duration cannot be < 0");
}
lua_remove(L_, 2); // argument is processed, remove it // L_: lane [wake_lane]
} else if (lua_isnil(L_, 2)) { // alternate explicit "infinite timeout" by passing nil
lua_remove(L_, 2); // argument is processed, remove it // L_: lane [wake_lane]
}
// we wake by default in "hard" mode (remember that hook is hard too), but this can be turned off if desired
WakeLane _wake_lane{ (_op.mode == CancelRequest::Hard) ? WakeLane::Yes : WakeLane::No };
if (lua_gettop(L_) >= 2) {
if (!lua_isboolean(L_, 2)) {
raise_luaL_error(L_, "Boolean expected for wake_lane argument, got %s", luaG_typename(L_, StackIndex{ 2 }).data());
}
_wake_lane = lua_toboolean(L_, 2) ? WakeLane::Yes : WakeLane::No;
lua_remove(L_, 2); // argument is processed, remove it // L_: lane
}
// if the caller didn't fumble, we should have removed everything from the stack but the lane itself
if (lua_gettop(L_) > 1) {
raise_luaL_error(L_, "Too many arguments");
}
lua_pop(L_, 1); // L_:
STACK_CHECK_START_ABS(L_, 0);
switch (_lane->cancel(_op, _until, _wake_lane, _hook_count)) {
default: // should never happen unless we added a case and forgot to handle it
raise_luaL_error(L_, "Should not get here!");
break;
case CancelResult::Timeout:
lua_pushboolean(L_, 0); // L_: false
luaG_pushstring(L_, "timeout"); // L_: false "timeout"
break;
case CancelResult::Cancelled:
lua_pushboolean(L_, 1); // L_: true
_lane->pushStatusString(L_); // L_: true "<status>"
break;
}
STACK_CHECK(L_, 2);
return 2;
}
|
