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
|
/* Copyright (C) 2008 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by David Bartley <dtbartle@csclub.uwaterloo.ca>, 2008.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, write to the Free
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. */
#include <inline-syscall.h>
#include <pthreadP.h>
#include <synch.h>
#include <errno.h>
#include <time.h>
#include <synchP.h>
DECLARE_INLINE_SYSCALL (int, lwp_mutex_timedlock, mutex_t *lp,
struct timespec *tsp);
extern int __mutex_lock_fast (mutex_t *mutex, bool try);
int __mutex_reltimedlock (mutex, reltime)
mutex_t *mutex;
const struct timespec *reltime;
{
/* Handle inconsistent robust mutexes. */
if ((mutex->mutex_type & LOCK_ROBUST) &&
(mutex->mutex_flag & LOCK_NOTRECOVERABLE))
return ENOTRECOVERABLE;
/* Always hit the kernel for priority inherit locks. */
if ((mutex->mutex_type & LOCK_PRIO_INHERIT) == 0)
{
int res = __mutex_lock_fast (mutex, false);
if(res >= 0)
return res;
}
else
{
/* Except when we already hold a recursive lock. */
if ((mutex->mutex_type & LOCK_RECURSIVE) && MUTEX_IS_OWNER (mutex))
{
/* XXX: Solaris mutexes have no overflow check and don't know about
EAGAIN; in practice overflow will not occur so we don't care. */
if (mutex->mutex_rcount == RECURSION_MAX)
return EAGAIN;
++mutex->mutex_rcount;
return 0;
}
}
/* Reject invalid timeouts. */
if (PAST_TIMESPEC (reltime))
return ETIME;
else if (INVALID_TIMESPEC (reltime))
return EINVAL;
int errval;
COPY_TIMESPEC (reltime)
do
errval = INLINE_SYSCALL (lwp_mutex_timedlock, 2, mutex, __reltime);
while (errval == EINTR);
/* The kernel sets EDEADLK for priority inherit mutexes. */
if (errval == EDEADLK && (mutex->mutex_type & LOCK_PRIO_INHERIT) &&
(mutex->mutex_type & LOCK_ERRORCHECK) == 0)
{
/* We aren't an error checking mutex so we need to block. */
INTERNAL_SYSCALL_DECL (err);
if (reltime)
{
int res = INTERNAL_SYSCALL (nanosleep, err, 2, __reltime, __reltime);
do
errval = INTERNAL_SYSCALL_ERRNO (res, err) ? EINTR : ETIMEDOUT;
while (errval == EINTR);
}
else
{
do
INTERNAL_SYSCALL (pause, err, 1, 0);
while (1);
}
}
if (errval != 0 && errval != EOWNERDEAD)
return errval;
/* The kernel does not set mutex_owner so we set it here. */
mutex->mutex_owner = THREAD_GETMEM (THREAD_SELF, tid);
/* The kernel does not set the lockbyte for priority inherit mutexes. */
if (mutex->mutex_type & LOCK_PRIO_INHERIT)
mutex->mutex_lockbyte = 1;
return errval;
}
|
