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
|
/*
Unix SMB/CIFS implementation.
POSIX NTVFS backend - locking
Copyright (C) Andrew Tridgell 2004
This program 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 2 of the License, or
(at your option) any later version.
This program 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 this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "include/includes.h"
#include "vfs_posix.h"
/*
check if we can perform IO on a range that might be locked
*/
NTSTATUS pvfs_check_lock(struct pvfs_state *pvfs,
struct pvfs_file *f,
uint16_t smbpid,
uint64_t offset, uint64_t count,
enum brl_type rw)
{
if (!(pvfs->flags & PVFS_FLAG_STRICT_LOCKING)) {
return NT_STATUS_OK;
}
return brl_locktest(pvfs->brl_context,
&f->locking_key,
f->fnum,
smbpid,
offset, count, rw);
}
/*
lock or unlock a byte range
*/
NTSTATUS pvfs_lock(struct ntvfs_module_context *ntvfs,
struct smbsrv_request *req, union smb_lock *lck)
{
struct pvfs_state *pvfs = ntvfs->private_data;
struct pvfs_file *f;
struct smb_lock_entry *locks;
int i;
enum brl_type rw;
f = pvfs_find_fd(pvfs, req, lck->generic.in.fnum);
if (!f) {
return NT_STATUS_INVALID_HANDLE;
}
switch (lck->generic.level) {
case RAW_LOCK_LOCK:
return brl_lock(pvfs->brl_context,
&f->locking_key,
req->smbpid,
f->fnum,
lck->lock.in.offset,
lck->lock.in.count,
WRITE_LOCK);
case RAW_LOCK_UNLOCK:
return brl_unlock(pvfs->brl_context,
&f->locking_key,
req->smbpid,
f->fnum,
lck->lock.in.offset,
lck->lock.in.count);
case RAW_LOCK_GENERIC:
return NT_STATUS_INVALID_LEVEL;
case RAW_LOCK_LOCKX:
/* fall through to the most complex case */
break;
}
/* now the lockingX case, most common and also most complex */
if (lck->lockx.in.mode & LOCKING_ANDX_SHARED_LOCK) {
rw = READ_LOCK;
} else {
rw = WRITE_LOCK;
}
if (lck->lockx.in.mode &
(LOCKING_ANDX_OPLOCK_RELEASE |
LOCKING_ANDX_CHANGE_LOCKTYPE |
LOCKING_ANDX_CANCEL_LOCK)) {
/* todo: need to add support for these */
return NT_STATUS_NOT_IMPLEMENTED;
}
/* the unlocks happen first */
locks = lck->lockx.in.locks;
for (i=0;i<lck->lockx.in.ulock_cnt;i++) {
NTSTATUS status;
status = brl_unlock(pvfs->brl_context,
&f->locking_key,
locks[i].pid,
f->fnum,
locks[i].offset,
locks[i].count);
if (!NT_STATUS_IS_OK(status)) {
return status;
}
}
locks += i;
for (i=0;i<lck->lockx.in.lock_cnt;i++) {
NTSTATUS status;
status = brl_lock(pvfs->brl_context,
&f->locking_key,
locks[i].pid,
f->fnum,
locks[i].offset,
locks[i].count,
rw);
if (!NT_STATUS_IS_OK(status)) {
/* undo the locks we just did */
for (i=i-1;i>=0;i--) {
brl_unlock(pvfs->brl_context,
&f->locking_key,
locks[i].pid,
f->fnum,
locks[i].offset,
locks[i].count);
}
return status;
}
}
return NT_STATUS_OK;
}
|
