blob: 142b3634c114645e51063a993997549836da4017 (
plain)
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
|
/* process.h
Copyright 2001, 2002 Red Hat Inc.
Written by Robert Collins <rbtcollins@hotmail.com>
This file is part of Cygwin.
This software is a copyrighted work licensed under the terms of the
Cygwin license. Please consult the file "CYGWIN_LICENSE" for
details. */
#ifndef _PROCESS_H
#define _PROCESS_H
#include <assert.h>
#include "threaded_queue.h"
class process_cleanup : public queue_request
{
public:
process_cleanup (class process *const theprocess)
: _process (theprocess)
{
assert (_process);
}
virtual ~process_cleanup ();
virtual void process ();
private:
class process *const _process;
};
class process;
class cleanup_routine
{
friend class process;
public:
cleanup_routine (void *const key)
: _key (key),
_next (NULL)
{}
virtual ~cleanup_routine ();
bool operator== (const cleanup_routine &rhs) const
{
return _key == rhs._key;
}
void *key () const { return _key; }
/* MUST BE SYNCHRONOUS */
virtual void cleanup (class process *) = 0;
private:
void *const _key;
cleanup_routine *_next;
};
class process_cache;
class process
{
friend class process_cache;
friend class process_cleanup;
public:
process (pid_t cygpid, DWORD winpid);
~process ();
pid_t cygpid () const { return _cygpid; }
DWORD winpid () const { return _winpid; }
HANDLE handle () const { return _hProcess; }
bool is_active () const { return _exit_status == STILL_ACTIVE; }
void hold () { EnterCriticalSection (&_access); }
void release () { LeaveCriticalSection (&_access); }
bool add (cleanup_routine *);
bool remove (const cleanup_routine *);
private:
const pid_t _cygpid;
const DWORD _winpid;
HANDLE _hProcess;
long _cleaning_up;
DWORD _exit_status; // Set in the constructor and in exit_code ().
cleanup_routine *_routines_head;
/* used to prevent races-on-delete */
CRITICAL_SECTION _access;
class process *_next;
DWORD check_exit_code ();
void cleanup ();
};
class process_cache
{
// Number of special (i.e., non-process) handles in _wait_array.
// See wait_for_processes () and sync_wait_array () for details.
enum {
SPECIALS_COUNT = 2
};
class submission_loop : public queue_submission_loop
{
public:
submission_loop (process_cache *const cache, threaded_queue *const queue)
: queue_submission_loop (queue, true),
_cache (cache)
{
assert (_cache);
}
private:
process_cache *const _cache;
virtual void request_loop ();
};
friend class submission_loop;
public:
process_cache (unsigned int initial_workers);
~process_cache ();
class process *process (pid_t cygpid, DWORD winpid);
bool running () const { return _queue.running (); }
bool start () { return _queue.start (); }
bool stop () { return _queue.stop (); }
private:
threaded_queue _queue;
submission_loop _submitter;
size_t _processes_count;
class process *_processes_head; // A list sorted by winpid.
// Access to the _wait_array and related fields is not thread-safe,
// since they are used solely by wait_for_processes () and its callees.
HANDLE _wait_array[MAXIMUM_WAIT_OBJECTS];
class process *_process_array[MAXIMUM_WAIT_OBJECTS];
HANDLE _cache_add_trigger; // Actually both add and remove.
CRITICAL_SECTION _cache_write_access; // Actually both read and write access.
void wait_for_processes (HANDLE interrupt);
size_t sync_wait_array (HANDLE interrupt);
void check_and_remove_process (const size_t index);
class process *find (DWORD winpid, class process **previous = NULL);
};
#endif /* _PROCESS_H */
|
