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
| | /* Thread definitions
Copyright (C) 2012-2024 Free Software Foundation, Inc.
This file is part of GNU Emacs.
GNU Emacs 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 3 of the License, or
(at your option) any later version.
GNU Emacs 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 GNU Emacs. If not, see <https://www.gnu.org/licenses/>. */
#ifndef THREAD_H
#define THREAD_H
#include "regex-emacs.h"
#ifdef WINDOWSNT
#include <sys/socket.h>
#endif
#ifdef MSDOS
#include <time.h> /* struct rpl_timespec */
#include <signal.h> /* sigset_t */
#endif
#ifdef HAVE_ANDROID
#ifndef ANDROID_STUBIFY
#include "android.h"
#endif /* ANDROID_STUBIFY */
#endif /* HAVE_ANDROID */
#include "sysselect.h" /* FIXME */
#include "systhread.h"
/* Yield an address close enough to the top of the stack that the
garbage collector need not scan above it. Callers should be
declared NO_INLINE. */
#ifdef HAVE___BUILTIN_FRAME_ADDRESS
# define NEAR_STACK_TOP(addr) ((void) (addr), __builtin_frame_address (0))
#else
# define NEAR_STACK_TOP(addr) (addr)
#endif
INLINE_HEADER_BEGIN
/* Byte-code interpreter thread state. */
struct bc_thread_state {
struct bc_frame *fp; /* current frame pointer */
/* start and end of allocated bytecode stack */
char *stack;
char *stack_end;
};
struct thread_state
{
union vectorlike_header header;
/* The buffer in which the last search was performed, or
Qt if the last search was done in a string;
Qnil if no searching has been done yet. */
Lisp_Object m_last_thing_searched;
#define last_thing_searched (current_thread->m_last_thing_searched)
Lisp_Object m_saved_last_thing_searched;
#define saved_last_thing_searched (current_thread->m_saved_last_thing_searched)
/* The thread's name. */
Lisp_Object name;
/* The thread's function. */
Lisp_Object function;
/* The thread's result, if function has finished. */
Lisp_Object result;
/* If non-nil, this thread has been signaled. */
Lisp_Object error_symbol;
Lisp_Object error_data;
/* If we are waiting for some event, this holds the object we are
waiting on. */
Lisp_Object event_object;
/* event_object must be the last Lisp field. */
#if defined HAVE_ANDROID && !defined ANDROID_STUBIFY
/* Pointer to an object to call Java functions through. */
JNIEnv *java_env;
#endif /* HAVE_ANDROID && !ANDROID_STUBIFY */
/* An address near the bottom of the stack.
Tells GC how to save a copy of the stack. */
char const *m_stack_bottom;
#define stack_bottom (current_thread->m_stack_bottom)
/* The address of an object near the C stack top, used to determine
which words need to be scanned by the garbage collector. This is
also used to detect heuristically whether segmentation violation
address indicates stack overflow, as opposed to some internal
error in Emacs. If the C function F calls G which calls H which
calls ... F, then at least one of the functions in the chain
should set this to the address of a local variable. */
void const *stack_top;
struct catchtag *m_catchlist;
#define catchlist (current_thread->m_catchlist)
/* Chain of condition handlers currently in effect.
The elements of this chain are contained in the stack frames
of Fcondition_case and internal_condition_case.
When an error is signaled (by calling Fsignal),
this chain is searched for an element that applies. */
struct handler *m_handlerlist;
#define handlerlist (current_thread->m_handlerlist)
struct handler *m_handlerlist_sentinel;
#define handlerlist_sentinel (current_thread->m_handlerlist_sentinel)
/* Pointer to beginning of specpdl. */
union specbinding *m_specpdl;
#define specpdl (current_thread->m_specpdl)
/* End of specpld (just beyond the last element). */
union specbinding *m_specpdl_end;
#define specpdl_end (current_thread->m_specpdl_end)
/* Pointer to first unused element in specpdl. */
union specbinding *m_specpdl_ptr;
#define specpdl_ptr (current_thread->m_specpdl_ptr)
/* Depth in Lisp evaluations and function calls. */
intmax_t m_lisp_eval_depth;
#define lisp_eval_depth (current_thread->m_lisp_eval_depth)
/* This points to the current buffer. */
struct buffer *m_current_buffer;
#define current_buffer (current_thread->m_current_buffer)
/* Every call to re_search, etc., must pass &search_regs as the regs
argument unless you can show it is unnecessary (i.e., if re_search
is certainly going to be called again before region-around-match
can be called). However, this is unnecessary if using precompiled
regexp and match objects with `make-regexp' and `make-match-data'.
Since the registers are now dynamically allocated, we need to make
sure not to refer to the Nth register before checking that it has
been allocated by checking search_regs.num_regs. This is *slightly*
less necessary with precompiled regexp and match objects, since:
(1) precompiled regexps know how many subexpressions they need, so
they can set this to REGS_FIXED,
(2) further DEFUNs in regex-emacs.c allow explicit lisp-level
control over allocating match object size,
but we still generally rely on the search methods checking
.num_regs, just not specifically from the search_regs thread-local.
The regex code keeps track of whether it has allocated the search
buffer using bits in the re_pattern_buffer. This means that whenever
you compile a new pattern, it completely forgets whether it has
allocated any registers, and will allocate new registers the next
time you call a searching or matching function. Therefore, we need
to call re_set_registers after compiling a new pattern or after
setting the match registers, so that the regex functions will be
able to free or re-allocate it properly. This is not an issue for
precompiled regexp objects, which set REGS_FIXED and can therefore
avoid dynamic allocation of match objects during matching. */
struct re_registers m_search_regs;
#define search_regs (current_thread->m_search_regs)
struct re_registers m_saved_search_regs;
#define saved_search_regs (current_thread->m_saved_search_regs)
/* This member is different from waiting_for_input.
It is used to communicate to a lisp process-filter/sentinel (via the
function Fwaiting_for_user_input_p) whether Emacs was waiting
for user-input when that process-filter was called.
waiting_for_input cannot be used as that is by definition 0 when
lisp code is being evalled.
For that purpose, this must be 0
when not inside wait_reading_process_output. */
int m_waiting_for_user_input_p;
#define waiting_for_user_input_p (current_thread->m_waiting_for_user_input_p)
/* True while doing kbd input. */
bool m_waiting_for_input;
#define waiting_for_input (current_thread->m_waiting_for_input)
/* For longjmp to where kbd input is being done. This is per-thread
so that if more than one thread calls read_char, they don't
clobber each other's getcjmp, which will cause
quit_throw_to_read_char crash due to using a wrong stack. */
sys_jmp_buf m_getcjmp;
#define getcjmp (current_thread->m_getcjmp)
/* The OS identifier for this thread. */
sys_thread_t thread_id;
/* The condition variable for this thread. This is associated with
the global lock. This thread broadcasts to it when it exits. */
sys_cond_t thread_condvar;
/* This thread might be waiting for some condition. If so, this
points to the condition. If the thread is interrupted, the
interrupter should broadcast to this condition. */
sys_cond_t *wait_condvar;
/* Thread's name in the locale encoding. */
char *thread_name;
/* This thread might have released the global lock. If so, this is
non-zero. When a thread runs outside thread_select with this
flag non-zero, it means it has been interrupted by SIGINT while
in thread_select, and didn't have a chance of acquiring the lock.
It must do so ASAP. */
int not_holding_lock;
/* Threads are kept on a linked list. */
struct thread_state *next_thread;
struct bc_thread_state bc;
} GCALIGNED_STRUCT;
INLINE bool
THREADP (Lisp_Object a)
{
return PSEUDOVECTORP (a, PVEC_THREAD);
}
INLINE void
CHECK_THREAD (Lisp_Object x)
{
CHECK_TYPE (THREADP (x), Qthreadp, x);
}
INLINE struct thread_state *
XTHREAD (Lisp_Object a)
{
eassert (THREADP (a));
return XUNTAG (a, Lisp_Vectorlike, struct thread_state);
}
/* A mutex in lisp is represented by a system condition variable.
The system mutex associated with this condition variable is the
global lock.
Using a condition variable lets us implement interruptibility for
lisp mutexes. */
typedef struct
{
/* The owning thread, or NULL if unlocked. */
struct thread_state *owner;
/* The lock count. */
unsigned int count;
/* The underlying system condition variable. */
sys_cond_t condition;
} lisp_mutex_t;
/* A mutex as a lisp object. */
struct Lisp_Mutex
{
union vectorlike_header header;
/* The name of the mutex, or nil. */
Lisp_Object name;
/* The lower-level mutex object. */
lisp_mutex_t mutex;
} GCALIGNED_STRUCT;
INLINE bool
MUTEXP (Lisp_Object a)
{
return PSEUDOVECTORP (a, PVEC_MUTEX);
}
INLINE void
CHECK_MUTEX (Lisp_Object x)
{
CHECK_TYPE (MUTEXP (x), Qmutexp, x);
}
INLINE struct Lisp_Mutex *
XMUTEX (Lisp_Object a)
{
eassert (MUTEXP (a));
return XUNTAG (a, Lisp_Vectorlike, struct Lisp_Mutex);
}
/* A condition variable as a lisp object. */
struct Lisp_CondVar
{
union vectorlike_header header;
/* The associated mutex. */
Lisp_Object mutex;
/* The name of the condition variable, or nil. */
Lisp_Object name;
/* The lower-level condition variable object. */
sys_cond_t cond;
} GCALIGNED_STRUCT;
INLINE bool
CONDVARP (Lisp_Object a)
{
return PSEUDOVECTORP (a, PVEC_CONDVAR);
}
INLINE void
CHECK_CONDVAR (Lisp_Object x)
{
CHECK_TYPE (CONDVARP (x), Qcondition_variable_p, x);
}
INLINE struct Lisp_CondVar *
XCONDVAR (Lisp_Object a)
{
eassert (CONDVARP (a));
return XUNTAG (a, Lisp_Vectorlike, struct Lisp_CondVar);
}
extern struct thread_state *current_thread;
extern struct thread_state *all_threads;
extern void finalize_one_thread (struct thread_state *state);
extern void finalize_one_mutex (struct Lisp_Mutex *);
extern void finalize_one_condvar (struct Lisp_CondVar *);
extern void maybe_reacquire_global_lock (void);
extern void init_threads (void);
extern void syms_of_threads (void);
extern bool main_thread_p (const void *);
extern bool in_current_thread (void);
typedef int select_func (int, fd_set *, fd_set *, fd_set *,
const struct timespec *, const sigset_t *);
int thread_select (select_func *func, int max_fds, fd_set *rfds,
fd_set *wfds, fd_set *efds, struct timespec *timeout,
sigset_t *sigmask);
bool thread_check_current_buffer (struct buffer *);
INLINE_HEADER_END
#endif /* THREAD_H */
|