blob: 194298d5f1585ea1774af58649043cfa27a42333 [file] [log] [blame]
Guido van Rossumc3f82b61995-01-17 16:29:31 +00001/***********************************************************
2Copyright 1991-1995 by Stichting Mathematisch Centrum, Amsterdam,
3The Netherlands.
4
5 All Rights Reserved
6
Guido van Rossumd266eb41996-10-25 14:44:06 +00007Permission to use, copy, modify, and distribute this software and its
8documentation for any purpose and without fee is hereby granted,
Guido van Rossumc3f82b61995-01-17 16:29:31 +00009provided that the above copyright notice appear in all copies and that
Guido van Rossumd266eb41996-10-25 14:44:06 +000010both that copyright notice and this permission notice appear in
Guido van Rossumc3f82b61995-01-17 16:29:31 +000011supporting documentation, and that the names of Stichting Mathematisch
Guido van Rossumd266eb41996-10-25 14:44:06 +000012Centrum or CWI or Corporation for National Research Initiatives or
13CNRI not be used in advertising or publicity pertaining to
14distribution of the software without specific, written prior
15permission.
Guido van Rossumc3f82b61995-01-17 16:29:31 +000016
Guido van Rossumd266eb41996-10-25 14:44:06 +000017While CWI is the initial source for this software, a modified version
18is made available by the Corporation for National Research Initiatives
19(CNRI) at the Internet address ftp://ftp.python.org.
20
21STICHTING MATHEMATISCH CENTRUM AND CNRI DISCLAIM ALL WARRANTIES WITH
22REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF
23MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH
24CENTRUM OR CNRI BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL
25DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
26PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
27TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
28PERFORMANCE OF THIS SOFTWARE.
Guido van Rossumc3f82b61995-01-17 16:29:31 +000029
30******************************************************************/
31
32/* This code implemented by Dag.Gruneau@elsa.preseco.comm.se */
33
Guido van Rossum49b12261997-08-14 20:12:58 +000034#include <windows.h>
35#include <limits.h>
36#include <process.h>
Guido van Rossumc3f82b61995-01-17 16:29:31 +000037
38long get_thread_ident(void);
39
40/*
41 * Change all headers to pure ANSI as no one will use K&R style on an
42 * NT
43 */
44
45/*
46 * Initialization of the C package, should not be needed.
47 */
48static void _init_thread(void)
49{
50}
51
52/*
53 * Thread support.
54 */
55int start_new_thread(void (*func)(void *), void *arg)
56{
Guido van Rossum49b12261997-08-14 20:12:58 +000057 long rv;
58 int success = 0;
Guido van Rossumc3f82b61995-01-17 16:29:31 +000059
Guido van Rossumc3f82b61995-01-17 16:29:31 +000060 dprintf(("%ld: start_new_thread called\n", get_thread_ident()));
61 if (!initialized)
62 init_thread();
63
Guido van Rossum49b12261997-08-14 20:12:58 +000064 rv = _beginthread(func, 0, arg); /* use default stack size */
Guido van Rossumc3f82b61995-01-17 16:29:31 +000065
Guido van Rossum49b12261997-08-14 20:12:58 +000066 if (rv != -1) {
Guido van Rossumc3f82b61995-01-17 16:29:31 +000067 success = 1;
68 dprintf(("%ld: start_new_thread succeeded: %ld\n", get_thread_ident(), aThreadId));
69 }
70
71 return success;
72}
73
74/*
75 * Return the thread Id instead of an handle. The Id is said to uniquely identify the
76 * thread in the system
77 */
78long get_thread_ident(void)
79{
80 if (!initialized)
81 init_thread();
82
83 return GetCurrentThreadId();
84}
85
86static void do_exit_thread(int no_cleanup)
87{
88 dprintf(("%ld: exit_thread called\n", get_thread_ident()));
89 if (!initialized)
90 if (no_cleanup)
91 _exit(0);
92 else
93 exit(0);
Guido van Rossum49b12261997-08-14 20:12:58 +000094 _endthread();
Guido van Rossumc3f82b61995-01-17 16:29:31 +000095}
96
97void exit_thread(void)
98{
99 do_exit_thread(0);
100}
101
102void _exit_thread(void)
103{
104 do_exit_thread(1);
105}
106
107#ifndef NO_EXIT_PROG
108static void do_exit_prog(int status, int no_cleanup)
109{
110 dprintf(("exit_prog(%d) called\n", status));
111 if (!initialized)
112 if (no_cleanup)
113 _exit(status);
114 else
115 exit(status);
116}
117
118void exit_prog(int status)
119{
120 do_exit_prog(status, 0);
121}
122
123void _exit_prog _P1(int status)
124{
125 do_exit_prog(status, 1);
126}
127#endif /* NO_EXIT_PROG */
128
129/*
130 * Lock support. It has too be implemented as semaphores.
131 * I [Dag] tried to implement it with mutex but I could find a way to
132 * tell whether a thread already own the lock or not.
133 */
134type_lock allocate_lock(void)
135{
136 HANDLE aLock;
137
138 dprintf(("allocate_lock called\n"));
139 if (!initialized)
140 init_thread();
141
142 aLock = CreateSemaphore(NULL, /* Security attributes */
143 1, /* Initial value */
144 1, /* Maximum value */
145 NULL);
146 /* Name of semaphore */
147
148 dprintf(("%ld: allocate_lock() -> %lx\n", get_thread_ident(), (long)aLock));
149
150 return (type_lock) aLock;
151}
152
153void free_lock(type_lock aLock)
154{
155 dprintf(("%ld: free_lock(%lx) called\n", get_thread_ident(),(long)aLock));
156
157 CloseHandle((HANDLE) aLock);
158}
159
160/*
161 * Return 1 on success if the lock was acquired
162 *
163 * and 0 if the lock was not acquired. This means a 0 is returned
164 * if the lock has already been acquired by this thread!
165 */
166int acquire_lock(type_lock aLock, int waitflag)
167{
168 int success = 1;
169 DWORD waitResult;
170
171 dprintf(("%ld: acquire_lock(%lx, %d) called\n", get_thread_ident(),(long)aLock, waitflag));
172
173 waitResult = WaitForSingleObject((HANDLE) aLock, (waitflag == 1 ? INFINITE : 0));
174
175 if (waitResult != WAIT_OBJECT_0) {
176 success = 0; /* We failed */
177 }
178
179 dprintf(("%ld: acquire_lock(%lx, %d) -> %d\n", get_thread_ident(),(long)aLock, waitflag, success));
180
181 return success;
182}
183
184void release_lock(type_lock aLock)
185{
186 dprintf(("%ld: release_lock(%lx) called\n", get_thread_ident(),(long)aLock));
187
188 if (!ReleaseSemaphore(
189 (HANDLE) aLock, /* Handle of semaphore */
190 1, /* increment count by one */
191 NULL)) /* not interested in previous count */
192 {
193 dprintf(("%ld: Could not release_lock(%lx) error: %l\n", get_thread_ident(), (long)aLock, GetLastError()));
194 }
195}
196
197/*
198 * Semaphore support.
199 */
200type_sema allocate_sema(int value)
201{
202 HANDLE aSemaphore;
203
204 dprintf(("%ld: allocate_sema called\n", get_thread_ident()));
205 if (!initialized)
206 init_thread();
207
208 aSemaphore = CreateSemaphore( NULL, /* Security attributes */
209 value, /* Initial value */
210 INT_MAX, /* Maximum value */
211 NULL); /* Name of semaphore */
212
213 dprintf(("%ld: allocate_sema() -> %lx\n", get_thread_ident(), (long)aSemaphore));
214
215 return (type_sema) aSemaphore;
216}
217
218void free_sema(type_sema aSemaphore)
219{
220 dprintf(("%ld: free_sema(%lx) called\n", get_thread_ident(), (long)aSemaphore));
221
222 CloseHandle((HANDLE) aSemaphore);
223}
224
Guido van Rossumcf1474b1996-10-08 14:17:53 +0000225/*
226 XXX must do something about waitflag
227 */
228int down_sema(type_sema aSemaphore, int waitflag)
Guido van Rossumc3f82b61995-01-17 16:29:31 +0000229{
230 DWORD waitResult;
231
232 dprintf(("%ld: down_sema(%lx) called\n", get_thread_ident(), (long)aSemaphore));
233
234 waitResult = WaitForSingleObject( (HANDLE) aSemaphore, INFINITE);
235
236 dprintf(("%ld: down_sema(%lx) return: %l\n", get_thread_ident(),(long) aSemaphore, waitResult));
Guido van Rossumcf1474b1996-10-08 14:17:53 +0000237 return 0;
Guido van Rossumc3f82b61995-01-17 16:29:31 +0000238}
239
240void up_sema(type_sema aSemaphore)
241{
242 ReleaseSemaphore(
243 (HANDLE) aSemaphore, /* Handle of semaphore */
244 1, /* increment count by one */
245 NULL); /* not interested in previous count */
246
247 dprintf(("%ld: up_sema(%lx)\n", get_thread_ident(), (long)aSemaphore));
248}