Merge Chromium + Blink git repositories
[chromium-blink-merge.git] / native_client_sdk / src / libraries / third_party / pthreads-win32 / pthread_mutex_timedlock.c
blob1745316795ddbb6c3c20d01fd966d04babf93516
1 /*
2 * pthread_mutex_timedlock.c
4 * Description:
5 * This translation unit implements mutual exclusion (mutex) primitives.
7 * --------------------------------------------------------------------------
9 * Pthreads-win32 - POSIX Threads Library for Win32
10 * Copyright(C) 1998 John E. Bossom
11 * Copyright(C) 1999,2005 Pthreads-win32 contributors
13 * Contact Email: rpj@callisto.canberra.edu.au
15 * The current list of contributors is contained
16 * in the file CONTRIBUTORS included with the source
17 * code distribution. The list can also be seen at the
18 * following World Wide Web location:
19 * http://sources.redhat.com/pthreads-win32/contributors.html
21 * This library is free software; you can redistribute it and/or
22 * modify it under the terms of the GNU Lesser General Public
23 * License as published by the Free Software Foundation; either
24 * version 2 of the License, or (at your option) any later version.
26 * This library is distributed in the hope that it will be useful,
27 * but WITHOUT ANY WARRANTY; without even the implied warranty of
28 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
29 * Lesser General Public License for more details.
31 * You should have received a copy of the GNU Lesser General Public
32 * License along with this library in the file COPYING.LIB;
33 * if not, write to the Free Software Foundation, Inc.,
34 * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
37 #include "pthread.h"
38 #include "implement.h"
41 static INLINE int
42 ptw32_timed_eventwait (HANDLE event, const struct timespec *abstime)
44 * ------------------------------------------------------
45 * DESCRIPTION
46 * This function waits on an event until signaled or until
47 * abstime passes.
48 * If abstime has passed when this routine is called then
49 * it returns a result to indicate this.
51 * If 'abstime' is a NULL pointer then this function will
52 * block until it can successfully decrease the value or
53 * until interrupted by a signal.
55 * This routine is not a cancelation point.
57 * RESULTS
58 * 0 successfully signaled,
59 * ETIMEDOUT abstime passed
60 * EINVAL 'event' is not a valid event,
62 * ------------------------------------------------------
66 DWORD milliseconds;
67 DWORD status;
69 if (event == NULL)
71 return EINVAL;
73 else
75 if (abstime == NULL)
77 milliseconds = INFINITE;
79 else
81 /*
82 * Calculate timeout as milliseconds from current system time.
84 milliseconds = ptw32_relmillisecs (abstime);
87 status = WaitForSingleObject (event, milliseconds);
89 if (status == WAIT_OBJECT_0)
91 return 0;
93 else if (status == WAIT_TIMEOUT)
95 return ETIMEDOUT;
97 else
99 return EINVAL;
103 return 0;
105 } /* ptw32_timed_semwait */
109 pthread_mutex_timedlock (pthread_mutex_t * mutex,
110 const struct timespec *abstime)
112 pthread_mutex_t mx;
113 int kind;
114 int result = 0;
117 * Let the system deal with invalid pointers.
121 * We do a quick check to see if we need to do more work
122 * to initialise a static mutex. We check
123 * again inside the guarded section of ptw32_mutex_check_need_init()
124 * to avoid race conditions.
126 if (*mutex >= PTHREAD_ERRORCHECK_MUTEX_INITIALIZER)
128 if ((result = ptw32_mutex_check_need_init (mutex)) != 0)
130 return (result);
134 mx = *mutex;
135 kind = mx->kind;
137 if (kind >= 0)
139 if (mx->kind == PTHREAD_MUTEX_NORMAL)
141 if ((PTW32_INTERLOCKED_LONG) PTW32_INTERLOCKED_EXCHANGE_LONG(
142 (PTW32_INTERLOCKED_LONGPTR) &mx->lock_idx,
143 (PTW32_INTERLOCKED_LONG) 1) != 0)
145 while ((PTW32_INTERLOCKED_LONG) PTW32_INTERLOCKED_EXCHANGE_LONG(
146 (PTW32_INTERLOCKED_LONGPTR) &mx->lock_idx,
147 (PTW32_INTERLOCKED_LONG) -1) != 0)
149 if (0 != (result = ptw32_timed_eventwait (mx->event, abstime)))
151 return result;
156 else
158 pthread_t self = pthread_self();
160 if ((PTW32_INTERLOCKED_LONG) PTW32_INTERLOCKED_COMPARE_EXCHANGE_LONG(
161 (PTW32_INTERLOCKED_LONGPTR) &mx->lock_idx,
162 (PTW32_INTERLOCKED_LONG) 1,
163 (PTW32_INTERLOCKED_LONG) 0) == 0)
165 mx->recursive_count = 1;
166 mx->ownerThread = self;
168 else
170 if (pthread_equal (mx->ownerThread, self))
172 if (mx->kind == PTHREAD_MUTEX_RECURSIVE)
174 mx->recursive_count++;
176 else
178 return EDEADLK;
181 else
183 while ((PTW32_INTERLOCKED_LONG) PTW32_INTERLOCKED_EXCHANGE_LONG(
184 (PTW32_INTERLOCKED_LONGPTR) &mx->lock_idx,
185 (PTW32_INTERLOCKED_LONG) -1) != 0)
187 if (0 != (result = ptw32_timed_eventwait (mx->event, abstime)))
189 return result;
193 mx->recursive_count = 1;
194 mx->ownerThread = self;
199 else
202 * Robust types
203 * All types record the current owner thread.
204 * The mutex is added to a per thread list when ownership is acquired.
206 ptw32_robust_state_t* statePtr = &mx->robustNode->stateInconsistent;
208 if ((PTW32_INTERLOCKED_LONG)PTW32_ROBUST_NOTRECOVERABLE == PTW32_INTERLOCKED_EXCHANGE_ADD_LONG(
209 (PTW32_INTERLOCKED_LONGPTR)statePtr,
210 (PTW32_INTERLOCKED_LONG)0))
212 result = ENOTRECOVERABLE;
214 else
216 pthread_t self = pthread_self();
218 kind = -kind - 1; /* Convert to non-robust range */
220 if (PTHREAD_MUTEX_NORMAL == kind)
222 if ((PTW32_INTERLOCKED_LONG) PTW32_INTERLOCKED_EXCHANGE_LONG(
223 (PTW32_INTERLOCKED_LONGPTR) &mx->lock_idx,
224 (PTW32_INTERLOCKED_LONG) 1) != 0)
226 while (0 == (result = ptw32_robust_mutex_inherit(mutex))
227 && (PTW32_INTERLOCKED_LONG) PTW32_INTERLOCKED_EXCHANGE_LONG(
228 (PTW32_INTERLOCKED_LONGPTR) &mx->lock_idx,
229 (PTW32_INTERLOCKED_LONG) -1) != 0)
231 if (0 != (result = ptw32_timed_eventwait (mx->event, abstime)))
233 return result;
235 if ((PTW32_INTERLOCKED_LONG)PTW32_ROBUST_NOTRECOVERABLE ==
236 PTW32_INTERLOCKED_EXCHANGE_ADD_LONG(
237 (PTW32_INTERLOCKED_LONGPTR)statePtr,
238 (PTW32_INTERLOCKED_LONG)0))
240 /* Unblock the next thread */
241 SetEvent(mx->event);
242 result = ENOTRECOVERABLE;
243 break;
247 if (0 == result || EOWNERDEAD == result)
250 * Add mutex to the per-thread robust mutex currently-held list.
251 * If the thread terminates, all mutexes in this list will be unlocked.
253 ptw32_robust_mutex_add(mutex, self);
257 else
259 pthread_t self = pthread_self();
261 if (0 == (PTW32_INTERLOCKED_LONG) PTW32_INTERLOCKED_COMPARE_EXCHANGE_LONG(
262 (PTW32_INTERLOCKED_LONGPTR) &mx->lock_idx,
263 (PTW32_INTERLOCKED_LONG) 1,
264 (PTW32_INTERLOCKED_LONG) 0))
266 mx->recursive_count = 1;
268 * Add mutex to the per-thread robust mutex currently-held list.
269 * If the thread terminates, all mutexes in this list will be unlocked.
271 ptw32_robust_mutex_add(mutex, self);
273 else
275 if (pthread_equal (mx->ownerThread, self))
277 if (PTHREAD_MUTEX_RECURSIVE == kind)
279 mx->recursive_count++;
281 else
283 return EDEADLK;
286 else
288 while (0 == (result = ptw32_robust_mutex_inherit(mutex))
289 && (PTW32_INTERLOCKED_LONG) PTW32_INTERLOCKED_EXCHANGE_LONG(
290 (PTW32_INTERLOCKED_LONGPTR) &mx->lock_idx,
291 (PTW32_INTERLOCKED_LONG) -1) != 0)
293 if (0 != (result = ptw32_timed_eventwait (mx->event, abstime)))
295 return result;
299 if ((PTW32_INTERLOCKED_LONG)PTW32_ROBUST_NOTRECOVERABLE ==
300 PTW32_INTERLOCKED_EXCHANGE_ADD_LONG(
301 (PTW32_INTERLOCKED_LONGPTR)statePtr,
302 (PTW32_INTERLOCKED_LONG)0))
304 /* Unblock the next thread */
305 SetEvent(mx->event);
306 result = ENOTRECOVERABLE;
308 else if (0 == result || EOWNERDEAD == result)
310 mx->recursive_count = 1;
312 * Add mutex to the per-thread robust mutex currently-held list.
313 * If the thread terminates, all mutexes in this list will be unlocked.
315 ptw32_robust_mutex_add(mutex, self);
323 return result;