1 | /*
|
---|
2 | Unix SMB/CIFS implementation.
|
---|
3 | Locking functions
|
---|
4 | Copyright (C) Jeremy Allison 1992-2006
|
---|
5 |
|
---|
6 | This program is free software; you can redistribute it and/or modify
|
---|
7 | it under the terms of the GNU General Public License as published by
|
---|
8 | the Free Software Foundation; either version 3 of the License, or
|
---|
9 | (at your option) any later version.
|
---|
10 |
|
---|
11 | This program is distributed in the hope that it will be useful,
|
---|
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
14 | GNU General Public License for more details.
|
---|
15 |
|
---|
16 | You should have received a copy of the GNU General Public License
|
---|
17 | along with this program. If not, see <http://www.gnu.org/licenses/>.
|
---|
18 |
|
---|
19 | Revision History:
|
---|
20 |
|
---|
21 | POSIX locking support. Jeremy Allison (jeremy@valinux.com), Apr. 2000.
|
---|
22 | */
|
---|
23 |
|
---|
24 | #include "includes.h"
|
---|
25 |
|
---|
26 | #undef DBGC_CLASS
|
---|
27 | #define DBGC_CLASS DBGC_LOCKING
|
---|
28 |
|
---|
29 | /*
|
---|
30 | * The pending close database handle.
|
---|
31 | */
|
---|
32 |
|
---|
33 | static struct db_context *posix_pending_close_db;
|
---|
34 |
|
---|
35 | /****************************************************************************
|
---|
36 | First - the functions that deal with the underlying system locks - these
|
---|
37 | functions are used no matter if we're mapping CIFS Windows locks or CIFS
|
---|
38 | POSIX locks onto POSIX.
|
---|
39 | ****************************************************************************/
|
---|
40 |
|
---|
41 | /****************************************************************************
|
---|
42 | Utility function to map a lock type correctly depending on the open
|
---|
43 | mode of a file.
|
---|
44 | ****************************************************************************/
|
---|
45 |
|
---|
46 | static int map_posix_lock_type( files_struct *fsp, enum brl_type lock_type)
|
---|
47 | {
|
---|
48 | if((lock_type == WRITE_LOCK) && !fsp->can_write) {
|
---|
49 | /*
|
---|
50 | * Many UNIX's cannot get a write lock on a file opened read-only.
|
---|
51 | * Win32 locking semantics allow this.
|
---|
52 | * Do the best we can and attempt a read-only lock.
|
---|
53 | */
|
---|
54 | DEBUG(10,("map_posix_lock_type: Downgrading write lock to read due to read-only file.\n"));
|
---|
55 | return F_RDLCK;
|
---|
56 | }
|
---|
57 |
|
---|
58 | /*
|
---|
59 | * This return should be the most normal, as we attempt
|
---|
60 | * to always open files read/write.
|
---|
61 | */
|
---|
62 |
|
---|
63 | return (lock_type == READ_LOCK) ? F_RDLCK : F_WRLCK;
|
---|
64 | }
|
---|
65 |
|
---|
66 | /****************************************************************************
|
---|
67 | Debugging aid :-).
|
---|
68 | ****************************************************************************/
|
---|
69 |
|
---|
70 | static const char *posix_lock_type_name(int lock_type)
|
---|
71 | {
|
---|
72 | return (lock_type == F_RDLCK) ? "READ" : "WRITE";
|
---|
73 | }
|
---|
74 |
|
---|
75 | /****************************************************************************
|
---|
76 | Check to see if the given unsigned lock range is within the possible POSIX
|
---|
77 | range. Modifies the given args to be in range if possible, just returns
|
---|
78 | False if not.
|
---|
79 | ****************************************************************************/
|
---|
80 |
|
---|
81 | static bool posix_lock_in_range(SMB_OFF_T *offset_out, SMB_OFF_T *count_out,
|
---|
82 | uint64_t u_offset, uint64_t u_count)
|
---|
83 | {
|
---|
84 | SMB_OFF_T offset = (SMB_OFF_T)u_offset;
|
---|
85 | SMB_OFF_T count = (SMB_OFF_T)u_count;
|
---|
86 |
|
---|
87 | /*
|
---|
88 | * For the type of system we are, attempt to
|
---|
89 | * find the maximum positive lock offset as an SMB_OFF_T.
|
---|
90 | */
|
---|
91 |
|
---|
92 | #if defined(MAX_POSITIVE_LOCK_OFFSET) /* Some systems have arbitrary limits. */
|
---|
93 |
|
---|
94 | SMB_OFF_T max_positive_lock_offset = (MAX_POSITIVE_LOCK_OFFSET);
|
---|
95 |
|
---|
96 | #elif defined(LARGE_SMB_OFF_T) && !defined(HAVE_BROKEN_FCNTL64_LOCKS)
|
---|
97 |
|
---|
98 | /*
|
---|
99 | * In this case SMB_OFF_T is 64 bits,
|
---|
100 | * and the underlying system can handle 64 bit signed locks.
|
---|
101 | */
|
---|
102 |
|
---|
103 | SMB_OFF_T mask2 = ((SMB_OFF_T)0x4) << (SMB_OFF_T_BITS-4);
|
---|
104 | SMB_OFF_T mask = (mask2<<1);
|
---|
105 | SMB_OFF_T max_positive_lock_offset = ~mask;
|
---|
106 |
|
---|
107 | #else /* !LARGE_SMB_OFF_T || HAVE_BROKEN_FCNTL64_LOCKS */
|
---|
108 |
|
---|
109 | /*
|
---|
110 | * In this case either SMB_OFF_T is 32 bits,
|
---|
111 | * or the underlying system cannot handle 64 bit signed locks.
|
---|
112 | * All offsets & counts must be 2^31 or less.
|
---|
113 | */
|
---|
114 |
|
---|
115 | SMB_OFF_T max_positive_lock_offset = 0x7FFFFFFF;
|
---|
116 |
|
---|
117 | #endif /* !LARGE_SMB_OFF_T || HAVE_BROKEN_FCNTL64_LOCKS */
|
---|
118 |
|
---|
119 | /*
|
---|
120 | * POSIX locks of length zero mean lock to end-of-file.
|
---|
121 | * Win32 locks of length zero are point probes. Ignore
|
---|
122 | * any Win32 locks of length zero. JRA.
|
---|
123 | */
|
---|
124 |
|
---|
125 | if (count == (SMB_OFF_T)0) {
|
---|
126 | DEBUG(10,("posix_lock_in_range: count = 0, ignoring.\n"));
|
---|
127 | return False;
|
---|
128 | }
|
---|
129 |
|
---|
130 | /*
|
---|
131 | * If the given offset was > max_positive_lock_offset then we cannot map this at all
|
---|
132 | * ignore this lock.
|
---|
133 | */
|
---|
134 |
|
---|
135 | if (u_offset & ~((uint64_t)max_positive_lock_offset)) {
|
---|
136 | DEBUG(10,("posix_lock_in_range: (offset = %.0f) offset > %.0f and we cannot handle this. Ignoring lock.\n",
|
---|
137 | (double)u_offset, (double)((uint64_t)max_positive_lock_offset) ));
|
---|
138 | return False;
|
---|
139 | }
|
---|
140 |
|
---|
141 | /*
|
---|
142 | * We must truncate the count to less than max_positive_lock_offset.
|
---|
143 | */
|
---|
144 |
|
---|
145 | if (u_count & ~((uint64_t)max_positive_lock_offset)) {
|
---|
146 | count = max_positive_lock_offset;
|
---|
147 | }
|
---|
148 |
|
---|
149 | /*
|
---|
150 | * Truncate count to end at max lock offset.
|
---|
151 | */
|
---|
152 |
|
---|
153 | if (offset + count < 0 || offset + count > max_positive_lock_offset) {
|
---|
154 | count = max_positive_lock_offset - offset;
|
---|
155 | }
|
---|
156 |
|
---|
157 | /*
|
---|
158 | * If we ate all the count, ignore this lock.
|
---|
159 | */
|
---|
160 |
|
---|
161 | if (count == 0) {
|
---|
162 | DEBUG(10,("posix_lock_in_range: Count = 0. Ignoring lock u_offset = %.0f, u_count = %.0f\n",
|
---|
163 | (double)u_offset, (double)u_count ));
|
---|
164 | return False;
|
---|
165 | }
|
---|
166 |
|
---|
167 | /*
|
---|
168 | * The mapping was successful.
|
---|
169 | */
|
---|
170 |
|
---|
171 | DEBUG(10,("posix_lock_in_range: offset_out = %.0f, count_out = %.0f\n",
|
---|
172 | (double)offset, (double)count ));
|
---|
173 |
|
---|
174 | *offset_out = offset;
|
---|
175 | *count_out = count;
|
---|
176 |
|
---|
177 | return True;
|
---|
178 | }
|
---|
179 |
|
---|
180 | bool smb_vfs_call_lock(struct vfs_handle_struct *handle,
|
---|
181 | struct files_struct *fsp, int op, SMB_OFF_T offset,
|
---|
182 | SMB_OFF_T count, int type)
|
---|
183 | {
|
---|
184 | VFS_FIND(lock);
|
---|
185 | return handle->fns->lock(handle, fsp, op, offset, count, type);
|
---|
186 | }
|
---|
187 |
|
---|
188 | /****************************************************************************
|
---|
189 | Actual function that does POSIX locks. Copes with 64 -> 32 bit cruft and
|
---|
190 | broken NFS implementations.
|
---|
191 | ****************************************************************************/
|
---|
192 |
|
---|
193 | static bool posix_fcntl_lock(files_struct *fsp, int op, SMB_OFF_T offset, SMB_OFF_T count, int type)
|
---|
194 | {
|
---|
195 | bool ret;
|
---|
196 |
|
---|
197 | DEBUG(8,("posix_fcntl_lock %d %d %.0f %.0f %d\n",fsp->fh->fd,op,(double)offset,(double)count,type));
|
---|
198 |
|
---|
199 | ret = SMB_VFS_LOCK(fsp, op, offset, count, type);
|
---|
200 |
|
---|
201 | if (!ret && ((errno == EFBIG) || (errno == ENOLCK) || (errno == EINVAL))) {
|
---|
202 |
|
---|
203 | DEBUG(0,("posix_fcntl_lock: WARNING: lock request at offset %.0f, length %.0f returned\n",
|
---|
204 | (double)offset,(double)count));
|
---|
205 | DEBUGADD(0,("an %s error. This can happen when using 64 bit lock offsets\n", strerror(errno)));
|
---|
206 | DEBUGADD(0,("on 32 bit NFS mounted file systems.\n"));
|
---|
207 |
|
---|
208 | /*
|
---|
209 | * If the offset is > 0x7FFFFFFF then this will cause problems on
|
---|
210 | * 32 bit NFS mounted filesystems. Just ignore it.
|
---|
211 | */
|
---|
212 |
|
---|
213 | if (offset & ~((SMB_OFF_T)0x7fffffff)) {
|
---|
214 | DEBUG(0,("Offset greater than 31 bits. Returning success.\n"));
|
---|
215 | return True;
|
---|
216 | }
|
---|
217 |
|
---|
218 | if (count & ~((SMB_OFF_T)0x7fffffff)) {
|
---|
219 | /* 32 bit NFS file system, retry with smaller offset */
|
---|
220 | DEBUG(0,("Count greater than 31 bits - retrying with 31 bit truncated length.\n"));
|
---|
221 | errno = 0;
|
---|
222 | count &= 0x7fffffff;
|
---|
223 | ret = SMB_VFS_LOCK(fsp, op, offset, count, type);
|
---|
224 | }
|
---|
225 | }
|
---|
226 |
|
---|
227 | DEBUG(8,("posix_fcntl_lock: Lock call %s\n", ret ? "successful" : "failed"));
|
---|
228 | return ret;
|
---|
229 | }
|
---|
230 |
|
---|
231 | bool smb_vfs_call_getlock(struct vfs_handle_struct *handle,
|
---|
232 | struct files_struct *fsp, SMB_OFF_T *poffset,
|
---|
233 | SMB_OFF_T *pcount, int *ptype, pid_t *ppid)
|
---|
234 | {
|
---|
235 | VFS_FIND(getlock);
|
---|
236 | return handle->fns->getlock(handle, fsp, poffset, pcount, ptype, ppid);
|
---|
237 | }
|
---|
238 |
|
---|
239 | /****************************************************************************
|
---|
240 | Actual function that gets POSIX locks. Copes with 64 -> 32 bit cruft and
|
---|
241 | broken NFS implementations.
|
---|
242 | ****************************************************************************/
|
---|
243 |
|
---|
244 | static bool posix_fcntl_getlock(files_struct *fsp, SMB_OFF_T *poffset, SMB_OFF_T *pcount, int *ptype)
|
---|
245 | {
|
---|
246 | pid_t pid;
|
---|
247 | bool ret;
|
---|
248 |
|
---|
249 | DEBUG(8,("posix_fcntl_getlock %d %.0f %.0f %d\n",
|
---|
250 | fsp->fh->fd,(double)*poffset,(double)*pcount,*ptype));
|
---|
251 |
|
---|
252 | ret = SMB_VFS_GETLOCK(fsp, poffset, pcount, ptype, &pid);
|
---|
253 |
|
---|
254 | #ifndef __OS2__ /* file locks currently fail with OS/2's libc */
|
---|
255 | if (!ret && ((errno == EFBIG) || (errno == ENOLCK) || (errno == EINVAL))) {
|
---|
256 |
|
---|
257 | DEBUG(0,("posix_fcntl_getlock: WARNING: lock request at offset %.0f, length %.0f returned\n",
|
---|
258 | (double)*poffset,(double)*pcount));
|
---|
259 | DEBUGADD(0,("an %s error. This can happen when using 64 bit lock offsets\n", strerror(errno)));
|
---|
260 | DEBUGADD(0,("on 32 bit NFS mounted file systems.\n"));
|
---|
261 |
|
---|
262 | /*
|
---|
263 | * If the offset is > 0x7FFFFFFF then this will cause problems on
|
---|
264 | * 32 bit NFS mounted filesystems. Just ignore it.
|
---|
265 | */
|
---|
266 |
|
---|
267 | if (*poffset & ~((SMB_OFF_T)0x7fffffff)) {
|
---|
268 | DEBUG(0,("Offset greater than 31 bits. Returning success.\n"));
|
---|
269 | return True;
|
---|
270 | }
|
---|
271 |
|
---|
272 | if (*pcount & ~((SMB_OFF_T)0x7fffffff)) {
|
---|
273 | /* 32 bit NFS file system, retry with smaller offset */
|
---|
274 | DEBUG(0,("Count greater than 31 bits - retrying with 31 bit truncated length.\n"));
|
---|
275 | errno = 0;
|
---|
276 | *pcount &= 0x7fffffff;
|
---|
277 | ret = SMB_VFS_GETLOCK(fsp,poffset,pcount,ptype,&pid);
|
---|
278 | }
|
---|
279 | }
|
---|
280 | #endif
|
---|
281 |
|
---|
282 | DEBUG(8,("posix_fcntl_getlock: Lock query call %s\n", ret ? "successful" : "failed"));
|
---|
283 | return ret;
|
---|
284 | }
|
---|
285 |
|
---|
286 | /****************************************************************************
|
---|
287 | POSIX function to see if a file region is locked. Returns True if the
|
---|
288 | region is locked, False otherwise.
|
---|
289 | ****************************************************************************/
|
---|
290 |
|
---|
291 | bool is_posix_locked(files_struct *fsp,
|
---|
292 | uint64_t *pu_offset,
|
---|
293 | uint64_t *pu_count,
|
---|
294 | enum brl_type *plock_type,
|
---|
295 | enum brl_flavour lock_flav)
|
---|
296 | {
|
---|
297 | SMB_OFF_T offset;
|
---|
298 | SMB_OFF_T count;
|
---|
299 | int posix_lock_type = map_posix_lock_type(fsp,*plock_type);
|
---|
300 |
|
---|
301 | DEBUG(10,("is_posix_locked: File %s, offset = %.0f, count = %.0f, "
|
---|
302 | "type = %s\n", fsp_str_dbg(fsp), (double)*pu_offset,
|
---|
303 | (double)*pu_count, posix_lock_type_name(*plock_type)));
|
---|
304 |
|
---|
305 | /*
|
---|
306 | * If the requested lock won't fit in the POSIX range, we will
|
---|
307 | * never set it, so presume it is not locked.
|
---|
308 | */
|
---|
309 |
|
---|
310 | if(!posix_lock_in_range(&offset, &count, *pu_offset, *pu_count)) {
|
---|
311 | return False;
|
---|
312 | }
|
---|
313 |
|
---|
314 | if (!posix_fcntl_getlock(fsp,&offset,&count,&posix_lock_type)) {
|
---|
315 | return False;
|
---|
316 | }
|
---|
317 |
|
---|
318 | if (posix_lock_type == F_UNLCK) {
|
---|
319 | return False;
|
---|
320 | }
|
---|
321 |
|
---|
322 | if (lock_flav == POSIX_LOCK) {
|
---|
323 | /* Only POSIX lock queries need to know the details. */
|
---|
324 | *pu_offset = (uint64_t)offset;
|
---|
325 | *pu_count = (uint64_t)count;
|
---|
326 | *plock_type = (posix_lock_type == F_RDLCK) ? READ_LOCK : WRITE_LOCK;
|
---|
327 | }
|
---|
328 | return True;
|
---|
329 | }
|
---|
330 |
|
---|
331 | /****************************************************************************
|
---|
332 | Next - the functions that deal with in memory database storing representations
|
---|
333 | of either Windows CIFS locks or POSIX CIFS locks.
|
---|
334 | ****************************************************************************/
|
---|
335 |
|
---|
336 | /* The key used in the in-memory POSIX databases. */
|
---|
337 |
|
---|
338 | struct lock_ref_count_key {
|
---|
339 | struct file_id id;
|
---|
340 | char r;
|
---|
341 | };
|
---|
342 |
|
---|
343 | /*******************************************************************
|
---|
344 | Form a static locking key for a dev/inode pair for the lock ref count
|
---|
345 | ******************************************************************/
|
---|
346 |
|
---|
347 | static TDB_DATA locking_ref_count_key_fsp(files_struct *fsp,
|
---|
348 | struct lock_ref_count_key *tmp)
|
---|
349 | {
|
---|
350 | ZERO_STRUCTP(tmp);
|
---|
351 | tmp->id = fsp->file_id;
|
---|
352 | tmp->r = 'r';
|
---|
353 | return make_tdb_data((uint8_t *)tmp, sizeof(*tmp));
|
---|
354 | }
|
---|
355 |
|
---|
356 | /*******************************************************************
|
---|
357 | Convenience function to get an fd_array key from an fsp.
|
---|
358 | ******************************************************************/
|
---|
359 |
|
---|
360 | static TDB_DATA fd_array_key_fsp(files_struct *fsp)
|
---|
361 | {
|
---|
362 | return make_tdb_data((uint8 *)&fsp->file_id, sizeof(fsp->file_id));
|
---|
363 | }
|
---|
364 |
|
---|
365 | /*******************************************************************
|
---|
366 | Create the in-memory POSIX lock databases.
|
---|
367 | ********************************************************************/
|
---|
368 |
|
---|
369 | bool posix_locking_init(bool read_only)
|
---|
370 | {
|
---|
371 | if (posix_pending_close_db != NULL) {
|
---|
372 | return true;
|
---|
373 | }
|
---|
374 |
|
---|
375 | posix_pending_close_db = db_open_rbt(NULL);
|
---|
376 |
|
---|
377 | if (posix_pending_close_db == NULL) {
|
---|
378 | DEBUG(0,("Failed to open POSIX pending close database.\n"));
|
---|
379 | return false;
|
---|
380 | }
|
---|
381 |
|
---|
382 | return true;
|
---|
383 | }
|
---|
384 |
|
---|
385 | /*******************************************************************
|
---|
386 | Delete the in-memory POSIX lock databases.
|
---|
387 | ********************************************************************/
|
---|
388 |
|
---|
389 | bool posix_locking_end(void)
|
---|
390 | {
|
---|
391 | /*
|
---|
392 | * Shouldn't we close all fd's here?
|
---|
393 | */
|
---|
394 | TALLOC_FREE(posix_pending_close_db);
|
---|
395 | return true;
|
---|
396 | }
|
---|
397 |
|
---|
398 | /****************************************************************************
|
---|
399 | Next - the functions that deal with storing fd's that have outstanding
|
---|
400 | POSIX locks when closed.
|
---|
401 | ****************************************************************************/
|
---|
402 |
|
---|
403 | /****************************************************************************
|
---|
404 | The records in posix_pending_close_tdb are composed of an array of ints
|
---|
405 | keyed by dev/ino pair.
|
---|
406 | The first int is a reference count of the number of outstanding locks on
|
---|
407 | all open fd's on this dev/ino pair. Any subsequent ints are the fd's that
|
---|
408 | were open on this dev/ino pair that should have been closed, but can't as
|
---|
409 | the lock ref count is non zero.
|
---|
410 | ****************************************************************************/
|
---|
411 |
|
---|
412 | /****************************************************************************
|
---|
413 | Keep a reference count of the number of Windows locks open on this dev/ino
|
---|
414 | pair. Creates entry if it doesn't exist.
|
---|
415 | ****************************************************************************/
|
---|
416 |
|
---|
417 | static void increment_windows_lock_ref_count(files_struct *fsp)
|
---|
418 | {
|
---|
419 | struct lock_ref_count_key tmp;
|
---|
420 | struct db_record *rec;
|
---|
421 | int lock_ref_count = 0;
|
---|
422 | NTSTATUS status;
|
---|
423 |
|
---|
424 | rec = posix_pending_close_db->fetch_locked(
|
---|
425 | posix_pending_close_db, talloc_tos(),
|
---|
426 | locking_ref_count_key_fsp(fsp, &tmp));
|
---|
427 |
|
---|
428 | SMB_ASSERT(rec != NULL);
|
---|
429 |
|
---|
430 | if (rec->value.dptr != NULL) {
|
---|
431 | SMB_ASSERT(rec->value.dsize == sizeof(lock_ref_count));
|
---|
432 | memcpy(&lock_ref_count, rec->value.dptr,
|
---|
433 | sizeof(lock_ref_count));
|
---|
434 | }
|
---|
435 |
|
---|
436 | lock_ref_count++;
|
---|
437 |
|
---|
438 | status = rec->store(rec, make_tdb_data((uint8 *)&lock_ref_count,
|
---|
439 | sizeof(lock_ref_count)), 0);
|
---|
440 |
|
---|
441 | SMB_ASSERT(NT_STATUS_IS_OK(status));
|
---|
442 |
|
---|
443 | TALLOC_FREE(rec);
|
---|
444 |
|
---|
445 | DEBUG(10,("increment_windows_lock_ref_count for file now %s = %d\n",
|
---|
446 | fsp_str_dbg(fsp), lock_ref_count));
|
---|
447 | }
|
---|
448 |
|
---|
449 | /****************************************************************************
|
---|
450 | Bulk delete - subtract as many locks as we've just deleted.
|
---|
451 | ****************************************************************************/
|
---|
452 |
|
---|
453 | void reduce_windows_lock_ref_count(files_struct *fsp, unsigned int dcount)
|
---|
454 | {
|
---|
455 | struct lock_ref_count_key tmp;
|
---|
456 | struct db_record *rec;
|
---|
457 | int lock_ref_count = 0;
|
---|
458 | NTSTATUS status;
|
---|
459 |
|
---|
460 | rec = posix_pending_close_db->fetch_locked(
|
---|
461 | posix_pending_close_db, talloc_tos(),
|
---|
462 | locking_ref_count_key_fsp(fsp, &tmp));
|
---|
463 |
|
---|
464 | SMB_ASSERT((rec != NULL)
|
---|
465 | && (rec->value.dptr != NULL)
|
---|
466 | && (rec->value.dsize == sizeof(lock_ref_count)));
|
---|
467 |
|
---|
468 | memcpy(&lock_ref_count, rec->value.dptr, sizeof(lock_ref_count));
|
---|
469 |
|
---|
470 | SMB_ASSERT(lock_ref_count > 0);
|
---|
471 |
|
---|
472 | lock_ref_count -= dcount;
|
---|
473 |
|
---|
474 | status = rec->store(rec, make_tdb_data((uint8 *)&lock_ref_count,
|
---|
475 | sizeof(lock_ref_count)), 0);
|
---|
476 |
|
---|
477 | SMB_ASSERT(NT_STATUS_IS_OK(status));
|
---|
478 |
|
---|
479 | TALLOC_FREE(rec);
|
---|
480 |
|
---|
481 | DEBUG(10,("reduce_windows_lock_ref_count for file now %s = %d\n",
|
---|
482 | fsp_str_dbg(fsp), lock_ref_count));
|
---|
483 | }
|
---|
484 |
|
---|
485 | static void decrement_windows_lock_ref_count(files_struct *fsp)
|
---|
486 | {
|
---|
487 | reduce_windows_lock_ref_count(fsp, 1);
|
---|
488 | }
|
---|
489 |
|
---|
490 | /****************************************************************************
|
---|
491 | Fetch the lock ref count.
|
---|
492 | ****************************************************************************/
|
---|
493 |
|
---|
494 | static int get_windows_lock_ref_count(files_struct *fsp)
|
---|
495 | {
|
---|
496 | struct lock_ref_count_key tmp;
|
---|
497 | TDB_DATA dbuf;
|
---|
498 | int res;
|
---|
499 | int lock_ref_count = 0;
|
---|
500 |
|
---|
501 | res = posix_pending_close_db->fetch(
|
---|
502 | posix_pending_close_db, talloc_tos(),
|
---|
503 | locking_ref_count_key_fsp(fsp, &tmp), &dbuf);
|
---|
504 |
|
---|
505 | SMB_ASSERT(res == 0);
|
---|
506 |
|
---|
507 | if (dbuf.dsize != 0) {
|
---|
508 | SMB_ASSERT(dbuf.dsize == sizeof(lock_ref_count));
|
---|
509 | memcpy(&lock_ref_count, dbuf.dptr, sizeof(lock_ref_count));
|
---|
510 | TALLOC_FREE(dbuf.dptr);
|
---|
511 | }
|
---|
512 |
|
---|
513 | DEBUG(10,("get_windows_lock_count for file %s = %d\n",
|
---|
514 | fsp_str_dbg(fsp), lock_ref_count));
|
---|
515 |
|
---|
516 | return lock_ref_count;
|
---|
517 | }
|
---|
518 |
|
---|
519 | /****************************************************************************
|
---|
520 | Delete a lock_ref_count entry.
|
---|
521 | ****************************************************************************/
|
---|
522 |
|
---|
523 | static void delete_windows_lock_ref_count(files_struct *fsp)
|
---|
524 | {
|
---|
525 | struct lock_ref_count_key tmp;
|
---|
526 | struct db_record *rec;
|
---|
527 |
|
---|
528 | rec = posix_pending_close_db->fetch_locked(
|
---|
529 | posix_pending_close_db, talloc_tos(),
|
---|
530 | locking_ref_count_key_fsp(fsp, &tmp));
|
---|
531 |
|
---|
532 | SMB_ASSERT(rec != NULL);
|
---|
533 |
|
---|
534 | /* Not a bug if it doesn't exist - no locks were ever granted. */
|
---|
535 |
|
---|
536 | rec->delete_rec(rec);
|
---|
537 | TALLOC_FREE(rec);
|
---|
538 |
|
---|
539 | DEBUG(10,("delete_windows_lock_ref_count for file %s\n",
|
---|
540 | fsp_str_dbg(fsp)));
|
---|
541 | }
|
---|
542 |
|
---|
543 | /****************************************************************************
|
---|
544 | Add an fd to the pending close tdb.
|
---|
545 | ****************************************************************************/
|
---|
546 |
|
---|
547 | static void add_fd_to_close_entry(files_struct *fsp)
|
---|
548 | {
|
---|
549 | struct db_record *rec;
|
---|
550 | uint8_t *new_data;
|
---|
551 | NTSTATUS status;
|
---|
552 |
|
---|
553 | rec = posix_pending_close_db->fetch_locked(
|
---|
554 | posix_pending_close_db, talloc_tos(),
|
---|
555 | fd_array_key_fsp(fsp));
|
---|
556 |
|
---|
557 | SMB_ASSERT(rec != NULL);
|
---|
558 |
|
---|
559 | new_data = TALLOC_ARRAY(
|
---|
560 | rec, uint8_t, rec->value.dsize + sizeof(fsp->fh->fd));
|
---|
561 |
|
---|
562 | SMB_ASSERT(new_data != NULL);
|
---|
563 |
|
---|
564 | memcpy(new_data, rec->value.dptr, rec->value.dsize);
|
---|
565 | memcpy(new_data + rec->value.dsize,
|
---|
566 | &fsp->fh->fd, sizeof(fsp->fh->fd));
|
---|
567 |
|
---|
568 | status = rec->store(
|
---|
569 | rec, make_tdb_data(new_data,
|
---|
570 | rec->value.dsize + sizeof(fsp->fh->fd)), 0);
|
---|
571 |
|
---|
572 | SMB_ASSERT(NT_STATUS_IS_OK(status));
|
---|
573 |
|
---|
574 | TALLOC_FREE(rec);
|
---|
575 |
|
---|
576 | DEBUG(10,("add_fd_to_close_entry: added fd %d file %s\n",
|
---|
577 | fsp->fh->fd, fsp_str_dbg(fsp)));
|
---|
578 | }
|
---|
579 |
|
---|
580 | /****************************************************************************
|
---|
581 | Remove all fd entries for a specific dev/inode pair from the tdb.
|
---|
582 | ****************************************************************************/
|
---|
583 |
|
---|
584 | static void delete_close_entries(files_struct *fsp)
|
---|
585 | {
|
---|
586 | struct db_record *rec;
|
---|
587 |
|
---|
588 | rec = posix_pending_close_db->fetch_locked(
|
---|
589 | posix_pending_close_db, talloc_tos(),
|
---|
590 | fd_array_key_fsp(fsp));
|
---|
591 |
|
---|
592 | SMB_ASSERT(rec != NULL);
|
---|
593 | rec->delete_rec(rec);
|
---|
594 | TALLOC_FREE(rec);
|
---|
595 | }
|
---|
596 |
|
---|
597 | /****************************************************************************
|
---|
598 | Get the array of POSIX pending close records for an open fsp. Returns number
|
---|
599 | of entries.
|
---|
600 | ****************************************************************************/
|
---|
601 |
|
---|
602 | static size_t get_posix_pending_close_entries(TALLOC_CTX *mem_ctx,
|
---|
603 | files_struct *fsp, int **entries)
|
---|
604 | {
|
---|
605 | TDB_DATA dbuf;
|
---|
606 | int res;
|
---|
607 |
|
---|
608 | res = posix_pending_close_db->fetch(
|
---|
609 | posix_pending_close_db, mem_ctx, fd_array_key_fsp(fsp),
|
---|
610 | &dbuf);
|
---|
611 |
|
---|
612 | SMB_ASSERT(res == 0);
|
---|
613 |
|
---|
614 | if (dbuf.dsize == 0) {
|
---|
615 | *entries = NULL;
|
---|
616 | return 0;
|
---|
617 | }
|
---|
618 |
|
---|
619 | *entries = (int *)dbuf.dptr;
|
---|
620 | return (size_t)(dbuf.dsize / sizeof(int));
|
---|
621 | }
|
---|
622 |
|
---|
623 | /****************************************************************************
|
---|
624 | Deal with pending closes needed by POSIX locking support.
|
---|
625 | Note that posix_locking_close_file() is expected to have been called
|
---|
626 | to delete all locks on this fsp before this function is called.
|
---|
627 | ****************************************************************************/
|
---|
628 |
|
---|
629 | int fd_close_posix(struct files_struct *fsp)
|
---|
630 | {
|
---|
631 | int saved_errno = 0;
|
---|
632 | int ret;
|
---|
633 | int *fd_array = NULL;
|
---|
634 | size_t count, i;
|
---|
635 |
|
---|
636 | if (!lp_locking(fsp->conn->params) ||
|
---|
637 | !lp_posix_locking(fsp->conn->params))
|
---|
638 | {
|
---|
639 | /*
|
---|
640 | * No locking or POSIX to worry about or we want POSIX semantics
|
---|
641 | * which will lose all locks on all fd's open on this dev/inode,
|
---|
642 | * just close.
|
---|
643 | */
|
---|
644 | return close(fsp->fh->fd);
|
---|
645 | }
|
---|
646 |
|
---|
647 | if (get_windows_lock_ref_count(fsp)) {
|
---|
648 |
|
---|
649 | /*
|
---|
650 | * There are outstanding locks on this dev/inode pair on
|
---|
651 | * other fds. Add our fd to the pending close tdb and set
|
---|
652 | * fsp->fh->fd to -1.
|
---|
653 | */
|
---|
654 |
|
---|
655 | add_fd_to_close_entry(fsp);
|
---|
656 | return 0;
|
---|
657 | }
|
---|
658 |
|
---|
659 | /*
|
---|
660 | * No outstanding locks. Get the pending close fd's
|
---|
661 | * from the tdb and close them all.
|
---|
662 | */
|
---|
663 |
|
---|
664 | count = get_posix_pending_close_entries(talloc_tos(), fsp, &fd_array);
|
---|
665 |
|
---|
666 | if (count) {
|
---|
667 | DEBUG(10,("fd_close_posix: doing close on %u fd's.\n",
|
---|
668 | (unsigned int)count));
|
---|
669 |
|
---|
670 | for(i = 0; i < count; i++) {
|
---|
671 | if (close(fd_array[i]) == -1) {
|
---|
672 | saved_errno = errno;
|
---|
673 | }
|
---|
674 | }
|
---|
675 |
|
---|
676 | /*
|
---|
677 | * Delete all fd's stored in the tdb
|
---|
678 | * for this dev/inode pair.
|
---|
679 | */
|
---|
680 |
|
---|
681 | delete_close_entries(fsp);
|
---|
682 | }
|
---|
683 |
|
---|
684 | TALLOC_FREE(fd_array);
|
---|
685 |
|
---|
686 | /* Don't need a lock ref count on this dev/ino anymore. */
|
---|
687 | delete_windows_lock_ref_count(fsp);
|
---|
688 |
|
---|
689 | /*
|
---|
690 | * Finally close the fd associated with this fsp.
|
---|
691 | */
|
---|
692 |
|
---|
693 | ret = close(fsp->fh->fd);
|
---|
694 |
|
---|
695 | if (ret == 0 && saved_errno != 0) {
|
---|
696 | errno = saved_errno;
|
---|
697 | ret = -1;
|
---|
698 | }
|
---|
699 |
|
---|
700 | return ret;
|
---|
701 | }
|
---|
702 |
|
---|
703 | /****************************************************************************
|
---|
704 | Next - the functions that deal with the mapping CIFS Windows locks onto
|
---|
705 | the underlying system POSIX locks.
|
---|
706 | ****************************************************************************/
|
---|
707 |
|
---|
708 | /*
|
---|
709 | * Structure used when splitting a lock range
|
---|
710 | * into a POSIX lock range. Doubly linked list.
|
---|
711 | */
|
---|
712 |
|
---|
713 | struct lock_list {
|
---|
714 | struct lock_list *next;
|
---|
715 | struct lock_list *prev;
|
---|
716 | SMB_OFF_T start;
|
---|
717 | SMB_OFF_T size;
|
---|
718 | };
|
---|
719 |
|
---|
720 | /****************************************************************************
|
---|
721 | Create a list of lock ranges that don't overlap a given range. Used in calculating
|
---|
722 | POSIX locks and unlocks. This is a difficult function that requires ASCII art to
|
---|
723 | understand it :-).
|
---|
724 | ****************************************************************************/
|
---|
725 |
|
---|
726 | static struct lock_list *posix_lock_list(TALLOC_CTX *ctx,
|
---|
727 | struct lock_list *lhead,
|
---|
728 | const struct lock_context *lock_ctx, /* Lock context lhead belongs to. */
|
---|
729 | files_struct *fsp,
|
---|
730 | const struct lock_struct *plocks,
|
---|
731 | int num_locks)
|
---|
732 | {
|
---|
733 | int i;
|
---|
734 |
|
---|
735 | /*
|
---|
736 | * Check the current lock list on this dev/inode pair.
|
---|
737 | * Quit if the list is deleted.
|
---|
738 | */
|
---|
739 |
|
---|
740 | DEBUG(10,("posix_lock_list: curr: start=%.0f,size=%.0f\n",
|
---|
741 | (double)lhead->start, (double)lhead->size ));
|
---|
742 |
|
---|
743 | for (i=0; i<num_locks && lhead; i++) {
|
---|
744 | const struct lock_struct *lock = &plocks[i];
|
---|
745 | struct lock_list *l_curr;
|
---|
746 |
|
---|
747 | /* Ignore all but read/write locks. */
|
---|
748 | if (lock->lock_type != READ_LOCK && lock->lock_type != WRITE_LOCK) {
|
---|
749 | continue;
|
---|
750 | }
|
---|
751 |
|
---|
752 | /* Ignore locks not owned by this process. */
|
---|
753 | if (!procid_equal(&lock->context.pid, &lock_ctx->pid)) {
|
---|
754 | continue;
|
---|
755 | }
|
---|
756 |
|
---|
757 | /*
|
---|
758 | * Walk the lock list, checking for overlaps. Note that
|
---|
759 | * the lock list can expand within this loop if the current
|
---|
760 | * range being examined needs to be split.
|
---|
761 | */
|
---|
762 |
|
---|
763 | for (l_curr = lhead; l_curr;) {
|
---|
764 |
|
---|
765 | DEBUG(10,("posix_lock_list: lock: fnum=%d: start=%.0f,size=%.0f:type=%s", lock->fnum,
|
---|
766 | (double)lock->start, (double)lock->size, posix_lock_type_name(lock->lock_type) ));
|
---|
767 |
|
---|
768 | if ( (l_curr->start >= (lock->start + lock->size)) ||
|
---|
769 | (lock->start >= (l_curr->start + l_curr->size))) {
|
---|
770 |
|
---|
771 | /* No overlap with existing lock - leave this range alone. */
|
---|
772 | /*********************************************
|
---|
773 | +---------+
|
---|
774 | | l_curr |
|
---|
775 | +---------+
|
---|
776 | +-------+
|
---|
777 | | lock |
|
---|
778 | +-------+
|
---|
779 | OR....
|
---|
780 | +---------+
|
---|
781 | | l_curr |
|
---|
782 | +---------+
|
---|
783 | **********************************************/
|
---|
784 |
|
---|
785 | DEBUG(10,(" no overlap case.\n" ));
|
---|
786 |
|
---|
787 | l_curr = l_curr->next;
|
---|
788 |
|
---|
789 | } else if ( (l_curr->start >= lock->start) &&
|
---|
790 | (l_curr->start + l_curr->size <= lock->start + lock->size) ) {
|
---|
791 |
|
---|
792 | /*
|
---|
793 | * This range is completely overlapped by this existing lock range
|
---|
794 | * and thus should have no effect. Delete it from the list.
|
---|
795 | */
|
---|
796 | /*********************************************
|
---|
797 | +---------+
|
---|
798 | | l_curr |
|
---|
799 | +---------+
|
---|
800 | +---------------------------+
|
---|
801 | | lock |
|
---|
802 | +---------------------------+
|
---|
803 | **********************************************/
|
---|
804 | /* Save the next pointer */
|
---|
805 | struct lock_list *ul_next = l_curr->next;
|
---|
806 |
|
---|
807 | DEBUG(10,(" delete case.\n" ));
|
---|
808 |
|
---|
809 | DLIST_REMOVE(lhead, l_curr);
|
---|
810 | if(lhead == NULL) {
|
---|
811 | break; /* No more list... */
|
---|
812 | }
|
---|
813 |
|
---|
814 | l_curr = ul_next;
|
---|
815 |
|
---|
816 | } else if ( (l_curr->start >= lock->start) &&
|
---|
817 | (l_curr->start < lock->start + lock->size) &&
|
---|
818 | (l_curr->start + l_curr->size > lock->start + lock->size) ) {
|
---|
819 |
|
---|
820 | /*
|
---|
821 | * This range overlaps the existing lock range at the high end.
|
---|
822 | * Truncate by moving start to existing range end and reducing size.
|
---|
823 | */
|
---|
824 | /*********************************************
|
---|
825 | +---------------+
|
---|
826 | | l_curr |
|
---|
827 | +---------------+
|
---|
828 | +---------------+
|
---|
829 | | lock |
|
---|
830 | +---------------+
|
---|
831 | BECOMES....
|
---|
832 | +-------+
|
---|
833 | | l_curr|
|
---|
834 | +-------+
|
---|
835 | **********************************************/
|
---|
836 |
|
---|
837 | l_curr->size = (l_curr->start + l_curr->size) - (lock->start + lock->size);
|
---|
838 | l_curr->start = lock->start + lock->size;
|
---|
839 |
|
---|
840 | DEBUG(10,(" truncate high case: start=%.0f,size=%.0f\n",
|
---|
841 | (double)l_curr->start, (double)l_curr->size ));
|
---|
842 |
|
---|
843 | l_curr = l_curr->next;
|
---|
844 |
|
---|
845 | } else if ( (l_curr->start < lock->start) &&
|
---|
846 | (l_curr->start + l_curr->size > lock->start) &&
|
---|
847 | (l_curr->start + l_curr->size <= lock->start + lock->size) ) {
|
---|
848 |
|
---|
849 | /*
|
---|
850 | * This range overlaps the existing lock range at the low end.
|
---|
851 | * Truncate by reducing size.
|
---|
852 | */
|
---|
853 | /*********************************************
|
---|
854 | +---------------+
|
---|
855 | | l_curr |
|
---|
856 | +---------------+
|
---|
857 | +---------------+
|
---|
858 | | lock |
|
---|
859 | +---------------+
|
---|
860 | BECOMES....
|
---|
861 | +-------+
|
---|
862 | | l_curr|
|
---|
863 | +-------+
|
---|
864 | **********************************************/
|
---|
865 |
|
---|
866 | l_curr->size = lock->start - l_curr->start;
|
---|
867 |
|
---|
868 | DEBUG(10,(" truncate low case: start=%.0f,size=%.0f\n",
|
---|
869 | (double)l_curr->start, (double)l_curr->size ));
|
---|
870 |
|
---|
871 | l_curr = l_curr->next;
|
---|
872 |
|
---|
873 | } else if ( (l_curr->start < lock->start) &&
|
---|
874 | (l_curr->start + l_curr->size > lock->start + lock->size) ) {
|
---|
875 | /*
|
---|
876 | * Worst case scenario. Range completely overlaps an existing
|
---|
877 | * lock range. Split the request into two, push the new (upper) request
|
---|
878 | * into the dlink list, and continue with the entry after l_new (as we
|
---|
879 | * know that l_new will not overlap with this lock).
|
---|
880 | */
|
---|
881 | /*********************************************
|
---|
882 | +---------------------------+
|
---|
883 | | l_curr |
|
---|
884 | +---------------------------+
|
---|
885 | +---------+
|
---|
886 | | lock |
|
---|
887 | +---------+
|
---|
888 | BECOMES.....
|
---|
889 | +-------+ +---------+
|
---|
890 | | l_curr| | l_new |
|
---|
891 | +-------+ +---------+
|
---|
892 | **********************************************/
|
---|
893 | struct lock_list *l_new = TALLOC_P(ctx, struct lock_list);
|
---|
894 |
|
---|
895 | if(l_new == NULL) {
|
---|
896 | DEBUG(0,("posix_lock_list: talloc fail.\n"));
|
---|
897 | return NULL; /* The talloc_destroy takes care of cleanup. */
|
---|
898 | }
|
---|
899 |
|
---|
900 | ZERO_STRUCTP(l_new);
|
---|
901 | l_new->start = lock->start + lock->size;
|
---|
902 | l_new->size = l_curr->start + l_curr->size - l_new->start;
|
---|
903 |
|
---|
904 | /* Truncate the l_curr. */
|
---|
905 | l_curr->size = lock->start - l_curr->start;
|
---|
906 |
|
---|
907 | DEBUG(10,(" split case: curr: start=%.0f,size=%.0f \
|
---|
908 | new: start=%.0f,size=%.0f\n", (double)l_curr->start, (double)l_curr->size,
|
---|
909 | (double)l_new->start, (double)l_new->size ));
|
---|
910 |
|
---|
911 | /*
|
---|
912 | * Add into the dlink list after the l_curr point - NOT at lhead.
|
---|
913 | * Note we can't use DLINK_ADD here as this inserts at the head of the given list.
|
---|
914 | */
|
---|
915 |
|
---|
916 | l_new->prev = l_curr;
|
---|
917 | l_new->next = l_curr->next;
|
---|
918 | l_curr->next = l_new;
|
---|
919 |
|
---|
920 | /* And move after the link we added. */
|
---|
921 | l_curr = l_new->next;
|
---|
922 |
|
---|
923 | } else {
|
---|
924 |
|
---|
925 | /*
|
---|
926 | * This logic case should never happen. Ensure this is the
|
---|
927 | * case by forcing an abort.... Remove in production.
|
---|
928 | */
|
---|
929 | char *msg = NULL;
|
---|
930 |
|
---|
931 | if (asprintf(&msg, "logic flaw in cases: l_curr: start = %.0f, size = %.0f : \
|
---|
932 | lock: start = %.0f, size = %.0f", (double)l_curr->start, (double)l_curr->size, (double)lock->start, (double)lock->size ) != -1) {
|
---|
933 | smb_panic(msg);
|
---|
934 | } else {
|
---|
935 | smb_panic("posix_lock_list");
|
---|
936 | }
|
---|
937 | }
|
---|
938 | } /* end for ( l_curr = lhead; l_curr;) */
|
---|
939 | } /* end for (i=0; i<num_locks && ul_head; i++) */
|
---|
940 |
|
---|
941 | return lhead;
|
---|
942 | }
|
---|
943 |
|
---|
944 | /****************************************************************************
|
---|
945 | POSIX function to acquire a lock. Returns True if the
|
---|
946 | lock could be granted, False if not.
|
---|
947 | ****************************************************************************/
|
---|
948 |
|
---|
949 | bool set_posix_lock_windows_flavour(files_struct *fsp,
|
---|
950 | uint64_t u_offset,
|
---|
951 | uint64_t u_count,
|
---|
952 | enum brl_type lock_type,
|
---|
953 | const struct lock_context *lock_ctx,
|
---|
954 | const struct lock_struct *plocks,
|
---|
955 | int num_locks,
|
---|
956 | int *errno_ret)
|
---|
957 | {
|
---|
958 | SMB_OFF_T offset;
|
---|
959 | SMB_OFF_T count;
|
---|
960 | int posix_lock_type = map_posix_lock_type(fsp,lock_type);
|
---|
961 | bool ret = True;
|
---|
962 | size_t lock_count;
|
---|
963 | TALLOC_CTX *l_ctx = NULL;
|
---|
964 | struct lock_list *llist = NULL;
|
---|
965 | struct lock_list *ll = NULL;
|
---|
966 |
|
---|
967 | DEBUG(5,("set_posix_lock_windows_flavour: File %s, offset = %.0f, "
|
---|
968 | "count = %.0f, type = %s\n", fsp_str_dbg(fsp),
|
---|
969 | (double)u_offset, (double)u_count,
|
---|
970 | posix_lock_type_name(lock_type)));
|
---|
971 |
|
---|
972 | /*
|
---|
973 | * If the requested lock won't fit in the POSIX range, we will
|
---|
974 | * pretend it was successful.
|
---|
975 | */
|
---|
976 |
|
---|
977 | if(!posix_lock_in_range(&offset, &count, u_offset, u_count)) {
|
---|
978 | increment_windows_lock_ref_count(fsp);
|
---|
979 | return True;
|
---|
980 | }
|
---|
981 |
|
---|
982 | /*
|
---|
983 | * Windows is very strange. It allows read locks to be overlayed
|
---|
984 | * (even over a write lock), but leaves the write lock in force until the first
|
---|
985 | * unlock. It also reference counts the locks. This means the following sequence :
|
---|
986 | *
|
---|
987 | * process1 process2
|
---|
988 | * ------------------------------------------------------------------------
|
---|
989 | * WRITE LOCK : start = 2, len = 10
|
---|
990 | * READ LOCK: start =0, len = 10 - FAIL
|
---|
991 | * READ LOCK : start = 0, len = 14
|
---|
992 | * READ LOCK: start =0, len = 10 - FAIL
|
---|
993 | * UNLOCK : start = 2, len = 10
|
---|
994 | * READ LOCK: start =0, len = 10 - OK
|
---|
995 | *
|
---|
996 | * Under POSIX, the same sequence in steps 1 and 2 would not be reference counted, but
|
---|
997 | * would leave a single read lock over the 0-14 region.
|
---|
998 | */
|
---|
999 |
|
---|
1000 | if ((l_ctx = talloc_init("set_posix_lock")) == NULL) {
|
---|
1001 | DEBUG(0,("set_posix_lock_windows_flavour: unable to init talloc context.\n"));
|
---|
1002 | return False;
|
---|
1003 | }
|
---|
1004 |
|
---|
1005 | if ((ll = TALLOC_P(l_ctx, struct lock_list)) == NULL) {
|
---|
1006 | DEBUG(0,("set_posix_lock_windows_flavour: unable to talloc unlock list.\n"));
|
---|
1007 | talloc_destroy(l_ctx);
|
---|
1008 | return False;
|
---|
1009 | }
|
---|
1010 |
|
---|
1011 | /*
|
---|
1012 | * Create the initial list entry containing the
|
---|
1013 | * lock we want to add.
|
---|
1014 | */
|
---|
1015 |
|
---|
1016 | ZERO_STRUCTP(ll);
|
---|
1017 | ll->start = offset;
|
---|
1018 | ll->size = count;
|
---|
1019 |
|
---|
1020 | DLIST_ADD(llist, ll);
|
---|
1021 |
|
---|
1022 | /*
|
---|
1023 | * The following call calculates if there are any
|
---|
1024 | * overlapping locks held by this process on
|
---|
1025 | * fd's open on the same file and splits this list
|
---|
1026 | * into a list of lock ranges that do not overlap with existing
|
---|
1027 | * POSIX locks.
|
---|
1028 | */
|
---|
1029 |
|
---|
1030 | llist = posix_lock_list(l_ctx,
|
---|
1031 | llist,
|
---|
1032 | lock_ctx, /* Lock context llist belongs to. */
|
---|
1033 | fsp,
|
---|
1034 | plocks,
|
---|
1035 | num_locks);
|
---|
1036 |
|
---|
1037 | /*
|
---|
1038 | * Add the POSIX locks on the list of ranges returned.
|
---|
1039 | * As the lock is supposed to be added atomically, we need to
|
---|
1040 | * back out all the locks if any one of these calls fail.
|
---|
1041 | */
|
---|
1042 |
|
---|
1043 | for (lock_count = 0, ll = llist; ll; ll = ll->next, lock_count++) {
|
---|
1044 | offset = ll->start;
|
---|
1045 | count = ll->size;
|
---|
1046 |
|
---|
1047 | DEBUG(5,("set_posix_lock_windows_flavour: Real lock: Type = %s: offset = %.0f, count = %.0f\n",
|
---|
1048 | posix_lock_type_name(posix_lock_type), (double)offset, (double)count ));
|
---|
1049 |
|
---|
1050 | if (!posix_fcntl_lock(fsp,SMB_F_SETLK,offset,count,posix_lock_type)) {
|
---|
1051 | *errno_ret = errno;
|
---|
1052 | DEBUG(5,("set_posix_lock_windows_flavour: Lock fail !: Type = %s: offset = %.0f, count = %.0f. Errno = %s\n",
|
---|
1053 | posix_lock_type_name(posix_lock_type), (double)offset, (double)count, strerror(errno) ));
|
---|
1054 | ret = False;
|
---|
1055 | break;
|
---|
1056 | }
|
---|
1057 | }
|
---|
1058 |
|
---|
1059 | if (!ret) {
|
---|
1060 |
|
---|
1061 | /*
|
---|
1062 | * Back out all the POSIX locks we have on fail.
|
---|
1063 | */
|
---|
1064 |
|
---|
1065 | for (ll = llist; lock_count; ll = ll->next, lock_count--) {
|
---|
1066 | offset = ll->start;
|
---|
1067 | count = ll->size;
|
---|
1068 |
|
---|
1069 | DEBUG(5,("set_posix_lock_windows_flavour: Backing out locks: Type = %s: offset = %.0f, count = %.0f\n",
|
---|
1070 | posix_lock_type_name(posix_lock_type), (double)offset, (double)count ));
|
---|
1071 |
|
---|
1072 | posix_fcntl_lock(fsp,SMB_F_SETLK,offset,count,F_UNLCK);
|
---|
1073 | }
|
---|
1074 | } else {
|
---|
1075 | /* Remember the number of Windows locks we have on this dev/ino pair. */
|
---|
1076 | increment_windows_lock_ref_count(fsp);
|
---|
1077 | }
|
---|
1078 |
|
---|
1079 | talloc_destroy(l_ctx);
|
---|
1080 | return ret;
|
---|
1081 | }
|
---|
1082 |
|
---|
1083 | /****************************************************************************
|
---|
1084 | POSIX function to release a lock. Returns True if the
|
---|
1085 | lock could be released, False if not.
|
---|
1086 | ****************************************************************************/
|
---|
1087 |
|
---|
1088 | bool release_posix_lock_windows_flavour(files_struct *fsp,
|
---|
1089 | uint64_t u_offset,
|
---|
1090 | uint64_t u_count,
|
---|
1091 | enum brl_type deleted_lock_type,
|
---|
1092 | const struct lock_context *lock_ctx,
|
---|
1093 | const struct lock_struct *plocks,
|
---|
1094 | int num_locks)
|
---|
1095 | {
|
---|
1096 | SMB_OFF_T offset;
|
---|
1097 | SMB_OFF_T count;
|
---|
1098 | bool ret = True;
|
---|
1099 | TALLOC_CTX *ul_ctx = NULL;
|
---|
1100 | struct lock_list *ulist = NULL;
|
---|
1101 | struct lock_list *ul = NULL;
|
---|
1102 |
|
---|
1103 | DEBUG(5,("release_posix_lock_windows_flavour: File %s, offset = %.0f, "
|
---|
1104 | "count = %.0f\n", fsp_str_dbg(fsp),
|
---|
1105 | (double)u_offset, (double)u_count));
|
---|
1106 |
|
---|
1107 | /* Remember the number of Windows locks we have on this dev/ino pair. */
|
---|
1108 | decrement_windows_lock_ref_count(fsp);
|
---|
1109 |
|
---|
1110 | /*
|
---|
1111 | * If the requested lock won't fit in the POSIX range, we will
|
---|
1112 | * pretend it was successful.
|
---|
1113 | */
|
---|
1114 |
|
---|
1115 | if(!posix_lock_in_range(&offset, &count, u_offset, u_count)) {
|
---|
1116 | return True;
|
---|
1117 | }
|
---|
1118 |
|
---|
1119 | if ((ul_ctx = talloc_init("release_posix_lock")) == NULL) {
|
---|
1120 | DEBUG(0,("release_posix_lock_windows_flavour: unable to init talloc context.\n"));
|
---|
1121 | return False;
|
---|
1122 | }
|
---|
1123 |
|
---|
1124 | if ((ul = TALLOC_P(ul_ctx, struct lock_list)) == NULL) {
|
---|
1125 | DEBUG(0,("release_posix_lock_windows_flavour: unable to talloc unlock list.\n"));
|
---|
1126 | talloc_destroy(ul_ctx);
|
---|
1127 | return False;
|
---|
1128 | }
|
---|
1129 |
|
---|
1130 | /*
|
---|
1131 | * Create the initial list entry containing the
|
---|
1132 | * lock we want to remove.
|
---|
1133 | */
|
---|
1134 |
|
---|
1135 | ZERO_STRUCTP(ul);
|
---|
1136 | ul->start = offset;
|
---|
1137 | ul->size = count;
|
---|
1138 |
|
---|
1139 | DLIST_ADD(ulist, ul);
|
---|
1140 |
|
---|
1141 | /*
|
---|
1142 | * The following call calculates if there are any
|
---|
1143 | * overlapping locks held by this process on
|
---|
1144 | * fd's open on the same file and creates a
|
---|
1145 | * list of unlock ranges that will allow
|
---|
1146 | * POSIX lock ranges to remain on the file whilst the
|
---|
1147 | * unlocks are performed.
|
---|
1148 | */
|
---|
1149 |
|
---|
1150 | ulist = posix_lock_list(ul_ctx,
|
---|
1151 | ulist,
|
---|
1152 | lock_ctx, /* Lock context ulist belongs to. */
|
---|
1153 | fsp,
|
---|
1154 | plocks,
|
---|
1155 | num_locks);
|
---|
1156 |
|
---|
1157 | /*
|
---|
1158 | * If there were any overlapped entries (list is > 1 or size or start have changed),
|
---|
1159 | * and the lock_type we just deleted from
|
---|
1160 | * the upper layer tdb was a write lock, then before doing the unlock we need to downgrade
|
---|
1161 | * the POSIX lock to a read lock. This allows any overlapping read locks
|
---|
1162 | * to be atomically maintained.
|
---|
1163 | */
|
---|
1164 |
|
---|
1165 | if (deleted_lock_type == WRITE_LOCK &&
|
---|
1166 | (!ulist || ulist->next != NULL || ulist->start != offset || ulist->size != count)) {
|
---|
1167 |
|
---|
1168 | DEBUG(5,("release_posix_lock_windows_flavour: downgrading lock to READ: offset = %.0f, count = %.0f\n",
|
---|
1169 | (double)offset, (double)count ));
|
---|
1170 |
|
---|
1171 | if (!posix_fcntl_lock(fsp,SMB_F_SETLK,offset,count,F_RDLCK)) {
|
---|
1172 | DEBUG(0,("release_posix_lock_windows_flavour: downgrade of lock failed with error %s !\n", strerror(errno) ));
|
---|
1173 | talloc_destroy(ul_ctx);
|
---|
1174 | return False;
|
---|
1175 | }
|
---|
1176 | }
|
---|
1177 |
|
---|
1178 | /*
|
---|
1179 | * Release the POSIX locks on the list of ranges returned.
|
---|
1180 | */
|
---|
1181 |
|
---|
1182 | for(; ulist; ulist = ulist->next) {
|
---|
1183 | offset = ulist->start;
|
---|
1184 | count = ulist->size;
|
---|
1185 |
|
---|
1186 | DEBUG(5,("release_posix_lock_windows_flavour: Real unlock: offset = %.0f, count = %.0f\n",
|
---|
1187 | (double)offset, (double)count ));
|
---|
1188 |
|
---|
1189 | if (!posix_fcntl_lock(fsp,SMB_F_SETLK,offset,count,F_UNLCK)) {
|
---|
1190 | ret = False;
|
---|
1191 | }
|
---|
1192 | }
|
---|
1193 |
|
---|
1194 | talloc_destroy(ul_ctx);
|
---|
1195 | return ret;
|
---|
1196 | }
|
---|
1197 |
|
---|
1198 | /****************************************************************************
|
---|
1199 | Next - the functions that deal with mapping CIFS POSIX locks onto
|
---|
1200 | the underlying system POSIX locks.
|
---|
1201 | ****************************************************************************/
|
---|
1202 |
|
---|
1203 | /****************************************************************************
|
---|
1204 | POSIX function to acquire a lock. Returns True if the
|
---|
1205 | lock could be granted, False if not.
|
---|
1206 | As POSIX locks don't stack or conflict (they just overwrite)
|
---|
1207 | we can map the requested lock directly onto a system one. We
|
---|
1208 | know it doesn't conflict with locks on other contexts as the
|
---|
1209 | upper layer would have refused it.
|
---|
1210 | ****************************************************************************/
|
---|
1211 |
|
---|
1212 | bool set_posix_lock_posix_flavour(files_struct *fsp,
|
---|
1213 | uint64_t u_offset,
|
---|
1214 | uint64_t u_count,
|
---|
1215 | enum brl_type lock_type,
|
---|
1216 | int *errno_ret)
|
---|
1217 | {
|
---|
1218 | SMB_OFF_T offset;
|
---|
1219 | SMB_OFF_T count;
|
---|
1220 | int posix_lock_type = map_posix_lock_type(fsp,lock_type);
|
---|
1221 |
|
---|
1222 | DEBUG(5,("set_posix_lock_posix_flavour: File %s, offset = %.0f, count "
|
---|
1223 | "= %.0f, type = %s\n", fsp_str_dbg(fsp),
|
---|
1224 | (double)u_offset, (double)u_count,
|
---|
1225 | posix_lock_type_name(lock_type)));
|
---|
1226 |
|
---|
1227 | /*
|
---|
1228 | * If the requested lock won't fit in the POSIX range, we will
|
---|
1229 | * pretend it was successful.
|
---|
1230 | */
|
---|
1231 |
|
---|
1232 | if(!posix_lock_in_range(&offset, &count, u_offset, u_count)) {
|
---|
1233 | return True;
|
---|
1234 | }
|
---|
1235 |
|
---|
1236 | if (!posix_fcntl_lock(fsp,SMB_F_SETLK,offset,count,posix_lock_type)) {
|
---|
1237 | *errno_ret = errno;
|
---|
1238 | DEBUG(5,("set_posix_lock_posix_flavour: Lock fail !: Type = %s: offset = %.0f, count = %.0f. Errno = %s\n",
|
---|
1239 | posix_lock_type_name(posix_lock_type), (double)offset, (double)count, strerror(errno) ));
|
---|
1240 | return False;
|
---|
1241 | }
|
---|
1242 | return True;
|
---|
1243 | }
|
---|
1244 |
|
---|
1245 | /****************************************************************************
|
---|
1246 | POSIX function to release a lock. Returns True if the
|
---|
1247 | lock could be released, False if not.
|
---|
1248 | We are given a complete lock state from the upper layer which is what the lock
|
---|
1249 | state should be after the unlock has already been done, so what
|
---|
1250 | we do is punch out holes in the unlock range where locks owned by this process
|
---|
1251 | have a different lock context.
|
---|
1252 | ****************************************************************************/
|
---|
1253 |
|
---|
1254 | bool release_posix_lock_posix_flavour(files_struct *fsp,
|
---|
1255 | uint64_t u_offset,
|
---|
1256 | uint64_t u_count,
|
---|
1257 | const struct lock_context *lock_ctx,
|
---|
1258 | const struct lock_struct *plocks,
|
---|
1259 | int num_locks)
|
---|
1260 | {
|
---|
1261 | bool ret = True;
|
---|
1262 | SMB_OFF_T offset;
|
---|
1263 | SMB_OFF_T count;
|
---|
1264 | TALLOC_CTX *ul_ctx = NULL;
|
---|
1265 | struct lock_list *ulist = NULL;
|
---|
1266 | struct lock_list *ul = NULL;
|
---|
1267 |
|
---|
1268 | DEBUG(5,("release_posix_lock_posix_flavour: File %s, offset = %.0f, "
|
---|
1269 | "count = %.0f\n", fsp_str_dbg(fsp),
|
---|
1270 | (double)u_offset, (double)u_count));
|
---|
1271 |
|
---|
1272 | /*
|
---|
1273 | * If the requested lock won't fit in the POSIX range, we will
|
---|
1274 | * pretend it was successful.
|
---|
1275 | */
|
---|
1276 |
|
---|
1277 | if(!posix_lock_in_range(&offset, &count, u_offset, u_count)) {
|
---|
1278 | return True;
|
---|
1279 | }
|
---|
1280 |
|
---|
1281 | if ((ul_ctx = talloc_init("release_posix_lock")) == NULL) {
|
---|
1282 | DEBUG(0,("release_posix_lock_windows_flavour: unable to init talloc context.\n"));
|
---|
1283 | return False;
|
---|
1284 | }
|
---|
1285 |
|
---|
1286 | if ((ul = TALLOC_P(ul_ctx, struct lock_list)) == NULL) {
|
---|
1287 | DEBUG(0,("release_posix_lock_windows_flavour: unable to talloc unlock list.\n"));
|
---|
1288 | talloc_destroy(ul_ctx);
|
---|
1289 | return False;
|
---|
1290 | }
|
---|
1291 |
|
---|
1292 | /*
|
---|
1293 | * Create the initial list entry containing the
|
---|
1294 | * lock we want to remove.
|
---|
1295 | */
|
---|
1296 |
|
---|
1297 | ZERO_STRUCTP(ul);
|
---|
1298 | ul->start = offset;
|
---|
1299 | ul->size = count;
|
---|
1300 |
|
---|
1301 | DLIST_ADD(ulist, ul);
|
---|
1302 |
|
---|
1303 | /*
|
---|
1304 | * Walk the given array creating a linked list
|
---|
1305 | * of unlock requests.
|
---|
1306 | */
|
---|
1307 |
|
---|
1308 | ulist = posix_lock_list(ul_ctx,
|
---|
1309 | ulist,
|
---|
1310 | lock_ctx, /* Lock context ulist belongs to. */
|
---|
1311 | fsp,
|
---|
1312 | plocks,
|
---|
1313 | num_locks);
|
---|
1314 |
|
---|
1315 | /*
|
---|
1316 | * Release the POSIX locks on the list of ranges returned.
|
---|
1317 | */
|
---|
1318 |
|
---|
1319 | for(; ulist; ulist = ulist->next) {
|
---|
1320 | offset = ulist->start;
|
---|
1321 | count = ulist->size;
|
---|
1322 |
|
---|
1323 | DEBUG(5,("release_posix_lock_posix_flavour: Real unlock: offset = %.0f, count = %.0f\n",
|
---|
1324 | (double)offset, (double)count ));
|
---|
1325 |
|
---|
1326 | if (!posix_fcntl_lock(fsp,SMB_F_SETLK,offset,count,F_UNLCK)) {
|
---|
1327 | ret = False;
|
---|
1328 | }
|
---|
1329 | }
|
---|
1330 |
|
---|
1331 | talloc_destroy(ul_ctx);
|
---|
1332 | return ret;
|
---|
1333 | }
|
---|