Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * fs/cifs/misc.c | |
3 | * | |
790fe579 | 4 | * Copyright (C) International Business Machines Corp., 2002,2007 |
1da177e4 LT |
5 | * Author(s): Steve French (sfrench@us.ibm.com) |
6 | * | |
7 | * This library is free software; you can redistribute it and/or modify | |
8 | * it under the terms of the GNU Lesser General Public License as published | |
9 | * by the Free Software Foundation; either version 2.1 of the License, or | |
10 | * (at your option) any later version. | |
11 | * | |
12 | * This library is distributed in the hope that it will be useful, | |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See | |
15 | * the GNU Lesser General Public License for more details. | |
16 | * | |
17 | * You should have received a copy of the GNU Lesser General Public License | |
18 | * along with this library; if not, write to the Free Software | |
fb8c4b14 | 19 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
1da177e4 LT |
20 | */ |
21 | ||
22 | #include <linux/slab.h> | |
23 | #include <linux/ctype.h> | |
24 | #include <linux/mempool.h> | |
25 | #include "cifspdu.h" | |
26 | #include "cifsglob.h" | |
27 | #include "cifsproto.h" | |
28 | #include "cifs_debug.h" | |
29 | #include "smberr.h" | |
30 | #include "nterr.h" | |
6c91d362 | 31 | #include "cifs_unicode.h" |
1da177e4 LT |
32 | |
33 | extern mempool_t *cifs_sm_req_poolp; | |
34 | extern mempool_t *cifs_req_poolp; | |
fb8c4b14 | 35 | extern struct task_struct *oplockThread; |
1da177e4 | 36 | |
fb8c4b14 SF |
37 | /* The xid serves as a useful identifier for each incoming vfs request, |
38 | in a similar way to the mid which is useful to track each sent smb, | |
39 | and CurrentXid can also provide a running counter (although it | |
40 | will eventually wrap past zero) of the total vfs operations handled | |
1da177e4 LT |
41 | since the cifs fs was mounted */ |
42 | ||
43 | unsigned int | |
44 | _GetXid(void) | |
45 | { | |
46 | unsigned int xid; | |
47 | ||
48 | spin_lock(&GlobalMid_Lock); | |
49 | GlobalTotalActiveXid++; | |
50c2f753 SF |
50 | |
51 | /* keep high water mark for number of simultaneous ops in filesystem */ | |
1da177e4 | 52 | if (GlobalTotalActiveXid > GlobalMaxActiveXid) |
50c2f753 | 53 | GlobalMaxActiveXid = GlobalTotalActiveXid; |
790fe579 | 54 | if (GlobalTotalActiveXid > 65000) |
fb8c4b14 | 55 | cFYI(1, ("warning: more than 65000 requests active")); |
1da177e4 LT |
56 | xid = GlobalCurrentXid++; |
57 | spin_unlock(&GlobalMid_Lock); | |
58 | return xid; | |
59 | } | |
60 | ||
61 | void | |
62 | _FreeXid(unsigned int xid) | |
63 | { | |
64 | spin_lock(&GlobalMid_Lock); | |
790fe579 | 65 | /* if (GlobalTotalActiveXid == 0) |
1da177e4 LT |
66 | BUG(); */ |
67 | GlobalTotalActiveXid--; | |
68 | spin_unlock(&GlobalMid_Lock); | |
69 | } | |
70 | ||
71 | struct cifsSesInfo * | |
72 | sesInfoAlloc(void) | |
73 | { | |
74 | struct cifsSesInfo *ret_buf; | |
75 | ||
76849e3e | 76 | ret_buf = kzalloc(sizeof (struct cifsSesInfo), GFP_KERNEL); |
1da177e4 | 77 | if (ret_buf) { |
1da177e4 LT |
78 | write_lock(&GlobalSMBSeslock); |
79 | atomic_inc(&sesInfoAllocCount); | |
80 | ret_buf->status = CifsNew; | |
81 | list_add(&ret_buf->cifsSessionList, &GlobalSMBSessionList); | |
82 | init_MUTEX(&ret_buf->sesSem); | |
83 | write_unlock(&GlobalSMBSeslock); | |
84 | } | |
85 | return ret_buf; | |
86 | } | |
87 | ||
88 | void | |
89 | sesInfoFree(struct cifsSesInfo *buf_to_free) | |
90 | { | |
91 | if (buf_to_free == NULL) { | |
92 | cFYI(1, ("Null buffer passed to sesInfoFree")); | |
93 | return; | |
94 | } | |
95 | ||
96 | write_lock(&GlobalSMBSeslock); | |
97 | atomic_dec(&sesInfoAllocCount); | |
98 | list_del(&buf_to_free->cifsSessionList); | |
99 | write_unlock(&GlobalSMBSeslock); | |
f99d49ad JJ |
100 | kfree(buf_to_free->serverOS); |
101 | kfree(buf_to_free->serverDomain); | |
102 | kfree(buf_to_free->serverNOS); | |
103 | kfree(buf_to_free->password); | |
3979877e | 104 | kfree(buf_to_free->domainName); |
1da177e4 LT |
105 | kfree(buf_to_free); |
106 | } | |
107 | ||
108 | struct cifsTconInfo * | |
109 | tconInfoAlloc(void) | |
110 | { | |
111 | struct cifsTconInfo *ret_buf; | |
76849e3e | 112 | ret_buf = kzalloc(sizeof (struct cifsTconInfo), GFP_KERNEL); |
1da177e4 | 113 | if (ret_buf) { |
1da177e4 LT |
114 | write_lock(&GlobalSMBSeslock); |
115 | atomic_inc(&tconInfoAllocCount); | |
116 | list_add(&ret_buf->cifsConnectionList, | |
117 | &GlobalTreeConnectionList); | |
118 | ret_buf->tidStatus = CifsNew; | |
119 | INIT_LIST_HEAD(&ret_buf->openFileList); | |
120 | init_MUTEX(&ret_buf->tconSem); | |
121 | #ifdef CONFIG_CIFS_STATS | |
122 | spin_lock_init(&ret_buf->stat_lock); | |
123 | #endif | |
124 | write_unlock(&GlobalSMBSeslock); | |
125 | } | |
126 | return ret_buf; | |
127 | } | |
128 | ||
129 | void | |
130 | tconInfoFree(struct cifsTconInfo *buf_to_free) | |
131 | { | |
132 | if (buf_to_free == NULL) { | |
133 | cFYI(1, ("Null buffer passed to tconInfoFree")); | |
134 | return; | |
135 | } | |
136 | write_lock(&GlobalSMBSeslock); | |
137 | atomic_dec(&tconInfoAllocCount); | |
138 | list_del(&buf_to_free->cifsConnectionList); | |
139 | write_unlock(&GlobalSMBSeslock); | |
f99d49ad | 140 | kfree(buf_to_free->nativeFileSystem); |
1da177e4 LT |
141 | kfree(buf_to_free); |
142 | } | |
143 | ||
144 | struct smb_hdr * | |
145 | cifs_buf_get(void) | |
146 | { | |
147 | struct smb_hdr *ret_buf = NULL; | |
148 | ||
fb8c4b14 SF |
149 | /* We could use negotiated size instead of max_msgsize - |
150 | but it may be more efficient to always alloc same size | |
151 | albeit slightly larger than necessary and maxbuffersize | |
1da177e4 | 152 | defaults to this and can not be bigger */ |
50c2f753 SF |
153 | ret_buf = (struct smb_hdr *) mempool_alloc(cifs_req_poolp, |
154 | GFP_KERNEL | GFP_NOFS); | |
1da177e4 LT |
155 | |
156 | /* clear the first few header bytes */ | |
157 | /* for most paths, more is cleared in header_assemble */ | |
158 | if (ret_buf) { | |
159 | memset(ret_buf, 0, sizeof(struct smb_hdr) + 3); | |
160 | atomic_inc(&bufAllocCount); | |
4498eed5 SF |
161 | #ifdef CONFIG_CIFS_STATS2 |
162 | atomic_inc(&totBufAllocCount); | |
163 | #endif /* CONFIG_CIFS_STATS2 */ | |
1da177e4 LT |
164 | } |
165 | ||
166 | return ret_buf; | |
167 | } | |
168 | ||
169 | void | |
170 | cifs_buf_release(void *buf_to_free) | |
171 | { | |
172 | ||
173 | if (buf_to_free == NULL) { | |
174 | /* cFYI(1, ("Null buffer passed to cifs_buf_release"));*/ | |
175 | return; | |
176 | } | |
fb8c4b14 | 177 | mempool_free(buf_to_free, cifs_req_poolp); |
1da177e4 LT |
178 | |
179 | atomic_dec(&bufAllocCount); | |
180 | return; | |
181 | } | |
182 | ||
183 | struct smb_hdr * | |
184 | cifs_small_buf_get(void) | |
185 | { | |
186 | struct smb_hdr *ret_buf = NULL; | |
187 | ||
fb8c4b14 SF |
188 | /* We could use negotiated size instead of max_msgsize - |
189 | but it may be more efficient to always alloc same size | |
190 | albeit slightly larger than necessary and maxbuffersize | |
1da177e4 | 191 | defaults to this and can not be bigger */ |
50c2f753 SF |
192 | ret_buf = (struct smb_hdr *) mempool_alloc(cifs_sm_req_poolp, |
193 | GFP_KERNEL | GFP_NOFS); | |
1da177e4 LT |
194 | if (ret_buf) { |
195 | /* No need to clear memory here, cleared in header assemble */ | |
196 | /* memset(ret_buf, 0, sizeof(struct smb_hdr) + 27);*/ | |
197 | atomic_inc(&smBufAllocCount); | |
4498eed5 SF |
198 | #ifdef CONFIG_CIFS_STATS2 |
199 | atomic_inc(&totSmBufAllocCount); | |
200 | #endif /* CONFIG_CIFS_STATS2 */ | |
201 | ||
1da177e4 LT |
202 | } |
203 | return ret_buf; | |
204 | } | |
205 | ||
206 | void | |
207 | cifs_small_buf_release(void *buf_to_free) | |
208 | { | |
209 | ||
210 | if (buf_to_free == NULL) { | |
211 | cFYI(1, ("Null buffer passed to cifs_small_buf_release")); | |
212 | return; | |
213 | } | |
fb8c4b14 | 214 | mempool_free(buf_to_free, cifs_sm_req_poolp); |
1da177e4 LT |
215 | |
216 | atomic_dec(&smBufAllocCount); | |
217 | return; | |
218 | } | |
219 | ||
fb8c4b14 | 220 | /* |
1982c344 SF |
221 | Find a free multiplex id (SMB mid). Otherwise there could be |
222 | mid collisions which might cause problems, demultiplexing the | |
223 | wrong response to this request. Multiplex ids could collide if | |
224 | one of a series requests takes much longer than the others, or | |
225 | if a very large number of long lived requests (byte range | |
226 | locks or FindNotify requests) are pending. No more than | |
fb8c4b14 | 227 | 64K-1 requests can be outstanding at one time. If no |
1982c344 SF |
228 | mids are available, return zero. A future optimization |
229 | could make the combination of mids and uid the key we use | |
fb8c4b14 | 230 | to demultiplex on (rather than mid alone). |
1982c344 SF |
231 | In addition to the above check, the cifs demultiplex |
232 | code already used the command code as a secondary | |
233 | check of the frame and if signing is negotiated the | |
234 | response would be discarded if the mid were the same | |
235 | but the signature was wrong. Since the mid is not put in the | |
236 | pending queue until later (when it is about to be dispatched) | |
fb8c4b14 | 237 | we do have to limit the number of outstanding requests |
1982c344 SF |
238 | to somewhat less than 64K-1 although it is hard to imagine |
239 | so many threads being in the vfs at one time. | |
240 | */ | |
241 | __u16 GetNextMid(struct TCP_Server_Info *server) | |
242 | { | |
243 | __u16 mid = 0; | |
244 | __u16 last_mid; | |
fb8c4b14 | 245 | int collision; |
1982c344 | 246 | |
790fe579 | 247 | if (server == NULL) |
1982c344 SF |
248 | return mid; |
249 | ||
250 | spin_lock(&GlobalMid_Lock); | |
251 | last_mid = server->CurrentMid; /* we do not want to loop forever */ | |
252 | server->CurrentMid++; | |
253 | /* This nested loop looks more expensive than it is. | |
fb8c4b14 | 254 | In practice the list of pending requests is short, |
1982c344 SF |
255 | fewer than 50, and the mids are likely to be unique |
256 | on the first pass through the loop unless some request | |
257 | takes longer than the 64 thousand requests before it | |
258 | (and it would also have to have been a request that | |
259 | did not time out) */ | |
fb8c4b14 | 260 | while (server->CurrentMid != last_mid) { |
1982c344 SF |
261 | struct list_head *tmp; |
262 | struct mid_q_entry *mid_entry; | |
263 | ||
264 | collision = 0; | |
790fe579 | 265 | if (server->CurrentMid == 0) |
1982c344 SF |
266 | server->CurrentMid++; |
267 | ||
268 | list_for_each(tmp, &server->pending_mid_q) { | |
269 | mid_entry = list_entry(tmp, struct mid_q_entry, qhead); | |
270 | ||
271 | if ((mid_entry->mid == server->CurrentMid) && | |
272 | (mid_entry->midState == MID_REQUEST_SUBMITTED)) { | |
273 | /* This mid is in use, try a different one */ | |
274 | collision = 1; | |
275 | break; | |
276 | } | |
277 | } | |
790fe579 | 278 | if (collision == 0) { |
1982c344 SF |
279 | mid = server->CurrentMid; |
280 | break; | |
281 | } | |
282 | server->CurrentMid++; | |
283 | } | |
284 | spin_unlock(&GlobalMid_Lock); | |
285 | return mid; | |
286 | } | |
287 | ||
288 | /* NB: MID can not be set if treeCon not passed in, in that | |
289 | case it is responsbility of caller to set the mid */ | |
1da177e4 LT |
290 | void |
291 | header_assemble(struct smb_hdr *buffer, char smb_command /* command */ , | |
292 | const struct cifsTconInfo *treeCon, int word_count | |
293 | /* length of fixed section (word count) in two byte units */) | |
294 | { | |
fb8c4b14 SF |
295 | struct list_head *temp_item; |
296 | struct cifsSesInfo *ses; | |
1da177e4 LT |
297 | char *temp = (char *) buffer; |
298 | ||
fb8c4b14 | 299 | memset(temp, 0, 256); /* bigger than MAX_CIFS_HDR_SIZE */ |
1da177e4 LT |
300 | |
301 | buffer->smb_buf_length = | |
302 | (2 * word_count) + sizeof (struct smb_hdr) - | |
303 | 4 /* RFC 1001 length field does not count */ + | |
304 | 2 /* for bcc field itself */ ; | |
1982c344 SF |
305 | /* Note that this is the only network field that has to be converted |
306 | to big endian and it is done just before we send it */ | |
1da177e4 LT |
307 | |
308 | buffer->Protocol[0] = 0xFF; | |
309 | buffer->Protocol[1] = 'S'; | |
310 | buffer->Protocol[2] = 'M'; | |
311 | buffer->Protocol[3] = 'B'; | |
312 | buffer->Command = smb_command; | |
313 | buffer->Flags = 0x00; /* case sensitive */ | |
314 | buffer->Flags2 = SMBFLG2_KNOWS_LONG_NAMES; | |
315 | buffer->Pid = cpu_to_le16((__u16)current->tgid); | |
316 | buffer->PidHigh = cpu_to_le16((__u16)(current->tgid >> 16)); | |
317 | spin_lock(&GlobalMid_Lock); | |
1da177e4 LT |
318 | spin_unlock(&GlobalMid_Lock); |
319 | if (treeCon) { | |
320 | buffer->Tid = treeCon->tid; | |
321 | if (treeCon->ses) { | |
322 | if (treeCon->ses->capabilities & CAP_UNICODE) | |
323 | buffer->Flags2 |= SMBFLG2_UNICODE; | |
324 | if (treeCon->ses->capabilities & CAP_STATUS32) { | |
325 | buffer->Flags2 |= SMBFLG2_ERR_STATUS; | |
326 | } | |
1982c344 SF |
327 | /* Uid is not converted */ |
328 | buffer->Uid = treeCon->ses->Suid; | |
329 | buffer->Mid = GetNextMid(treeCon->ses->server); | |
790fe579 | 330 | if (multiuser_mount != 0) { |
1da177e4 LT |
331 | /* For the multiuser case, there are few obvious technically */ |
332 | /* possible mechanisms to match the local linux user (uid) */ | |
333 | /* to a valid remote smb user (smb_uid): */ | |
334 | /* 1) Query Winbind (or other local pam/nss daemon */ | |
335 | /* for userid/password/logon_domain or credential */ | |
336 | /* 2) Query Winbind for uid to sid to username mapping */ | |
337 | /* and see if we have a matching password for existing*/ | |
338 | /* session for that user perhas getting password by */ | |
339 | /* adding a new pam_cifs module that stores passwords */ | |
340 | /* so that the cifs vfs can get at that for all logged*/ | |
341 | /* on users */ | |
342 | /* 3) (Which is the mechanism we have chosen) */ | |
343 | /* Search through sessions to the same server for a */ | |
344 | /* a match on the uid that was passed in on mount */ | |
345 | /* with the current processes uid (or euid?) and use */ | |
346 | /* that smb uid. If no existing smb session for */ | |
347 | /* that uid found, use the default smb session ie */ | |
348 | /* the smb session for the volume mounted which is */ | |
349 | /* the same as would be used if the multiuser mount */ | |
350 | /* flag were disabled. */ | |
351 | ||
352 | /* BB Add support for establishing new tCon and SMB Session */ | |
fb8c4b14 | 353 | /* with userid/password pairs found on the smb session */ |
1da177e4 | 354 | /* for other target tcp/ip addresses BB */ |
790fe579 | 355 | if (current->fsuid != treeCon->ses->linux_uid) { |
83451879 | 356 | cFYI(1,("Multiuser mode and UID did not match tcon uid")); |
1da177e4 LT |
357 | read_lock(&GlobalSMBSeslock); |
358 | list_for_each(temp_item, &GlobalSMBSessionList) { | |
359 | ses = list_entry(temp_item, struct cifsSesInfo, cifsSessionList); | |
790fe579 SF |
360 | if (ses->linux_uid == current->fsuid) { |
361 | if (ses->server == treeCon->ses->server) { | |
fb8c4b14 | 362 | cFYI(1, ("found matching uid substitute right smb_uid")); |
1da177e4 LT |
363 | buffer->Uid = ses->Suid; |
364 | break; | |
365 | } else { | |
fb8c4b14 SF |
366 | /* BB eventually call cifs_setup_session here */ |
367 | cFYI(1, ("local UID found but no smb sess with this server exists")); | |
1da177e4 LT |
368 | } |
369 | } | |
370 | } | |
371 | read_unlock(&GlobalSMBSeslock); | |
372 | } | |
373 | } | |
374 | } | |
375 | if (treeCon->Flags & SMB_SHARE_IS_IN_DFS) | |
376 | buffer->Flags2 |= SMBFLG2_DFS; | |
d3485d37 SF |
377 | if (treeCon->nocase) |
378 | buffer->Flags |= SMBFLG_CASELESS; | |
790fe579 SF |
379 | if ((treeCon->ses) && (treeCon->ses->server)) |
380 | if (treeCon->ses->server->secMode & | |
1da177e4 LT |
381 | (SECMODE_SIGN_REQUIRED | SECMODE_SIGN_ENABLED)) |
382 | buffer->Flags2 |= SMBFLG2_SECURITY_SIGNATURE; | |
383 | } | |
384 | ||
385 | /* endian conversion of flags is now done just before sending */ | |
386 | buffer->WordCount = (char) word_count; | |
387 | return; | |
388 | } | |
389 | ||
2cd646a2 | 390 | static int |
1da177e4 LT |
391 | checkSMBhdr(struct smb_hdr *smb, __u16 mid) |
392 | { | |
fb8c4b14 | 393 | /* Make sure that this really is an SMB, that it is a response, |
1da177e4 | 394 | and that the message ids match */ |
fb8c4b14 SF |
395 | if ((*(__le32 *) smb->Protocol == cpu_to_le32(0x424d53ff)) && |
396 | (mid == smb->Mid)) { | |
790fe579 | 397 | if (smb->Flags & SMBFLG_RESPONSE) |
fb8c4b14 SF |
398 | return 0; |
399 | else { | |
1da177e4 | 400 | /* only one valid case where server sends us request */ |
790fe579 | 401 | if (smb->Command == SMB_COM_LOCKING_ANDX) |
1da177e4 LT |
402 | return 0; |
403 | else | |
fb8c4b14 | 404 | cERROR(1, ("Received Request not response")); |
1da177e4 LT |
405 | } |
406 | } else { /* bad signature or mid */ | |
407 | if (*(__le32 *) smb->Protocol != cpu_to_le32(0x424d53ff)) | |
408 | cERROR(1, | |
6ab16d24 | 409 | ("Bad protocol string signature header %x", |
1da177e4 LT |
410 | *(unsigned int *) smb->Protocol)); |
411 | if (mid != smb->Mid) | |
412 | cERROR(1, ("Mids do not match")); | |
413 | } | |
414 | cERROR(1, ("bad smb detected. The Mid=%d", smb->Mid)); | |
415 | return 1; | |
416 | } | |
417 | ||
418 | int | |
d103e164 | 419 | checkSMB(struct smb_hdr *smb, __u16 mid, unsigned int length) |
1da177e4 | 420 | { |
70ca734a | 421 | __u32 len = smb->smb_buf_length; |
190fdeb8 | 422 | __u32 clc_len; /* calculated length */ |
184ed211 | 423 | cFYI(0, ("checkSMB Length: 0x%x, smb_buf_length: 0x%x", length, len)); |
d103e164 SF |
424 | |
425 | if (length < 2 + sizeof (struct smb_hdr)) { | |
426 | if ((length >= sizeof (struct smb_hdr) - 1) | |
1da177e4 | 427 | && (smb->Status.CifsError != 0)) { |
d103e164 SF |
428 | smb->WordCount = 0; |
429 | /* some error cases do not return wct and bcc */ | |
430 | return 0; | |
fb8c4b14 | 431 | } else if ((length == sizeof(struct smb_hdr) + 1) && |
d103e164 | 432 | (smb->WordCount == 0)) { |
fb8c4b14 | 433 | char *tmp = (char *)smb; |
d103e164 SF |
434 | /* Need to work around a bug in two servers here */ |
435 | /* First, check if the part of bcc they sent was zero */ | |
436 | if (tmp[sizeof(struct smb_hdr)] == 0) { | |
437 | /* some servers return only half of bcc | |
438 | * on simple responses (wct, bcc both zero) | |
439 | * in particular have seen this on | |
440 | * ulogoffX and FindClose. This leaves | |
441 | * one byte of bcc potentially unitialized | |
442 | */ | |
443 | /* zero rest of bcc */ | |
444 | tmp[sizeof(struct smb_hdr)+1] = 0; | |
46c79a64 | 445 | return 0; |
1da177e4 | 446 | } |
fb8c4b14 | 447 | cERROR(1, ("rcvd invalid byte count (bcc)")); |
d103e164 SF |
448 | } else { |
449 | cERROR(1, ("Length less than smb header size")); | |
1da177e4 | 450 | } |
d103e164 SF |
451 | return 1; |
452 | } | |
453 | if (len > CIFSMaxBufSize + MAX_CIFS_HDR_SIZE - 4) { | |
454 | cERROR(1, ("smb length greater than MaxBufSize, mid=%d", | |
184ed211 | 455 | smb->Mid)); |
1da177e4 LT |
456 | return 1; |
457 | } | |
458 | ||
459 | if (checkSMBhdr(smb, mid)) | |
460 | return 1; | |
190fdeb8 | 461 | clc_len = smbCalcSize_LE(smb); |
184ed211 | 462 | |
790fe579 | 463 | if (4 + len != length) { |
184ed211 SF |
464 | cERROR(1, ("Length read does not match RFC1001 length %d",len)); |
465 | return 1; | |
466 | } | |
467 | ||
468 | if (4 + len != clc_len) { | |
469 | /* check if bcc wrapped around for large read responses */ | |
790fe579 | 470 | if ((len > 64 * 1024) && (len > clc_len)) { |
184ed211 | 471 | /* check if lengths match mod 64K */ |
790fe579 | 472 | if (((4 + len) & 0xFFFF) == (clc_len & 0xFFFF)) |
fb8c4b14 | 473 | return 0; /* bcc wrapped */ |
184ed211 | 474 | } |
46c79a64 SF |
475 | cFYI(1, ("Calculated size %d vs length %d mismatch for mid %d", |
476 | clc_len, 4 + len, smb->Mid)); | |
190fdeb8 | 477 | /* Windows XP can return a few bytes too much, presumably |
fb8c4b14 | 478 | an illegal pad, at the end of byte range lock responses |
6ab16d24 | 479 | so we allow for that three byte pad, as long as actual |
190fdeb8 | 480 | received length is as long or longer than calculated length */ |
fb8c4b14 | 481 | /* We have now had to extend this more, since there is a |
6ab16d24 SF |
482 | case in which it needs to be bigger still to handle a |
483 | malformed response to transact2 findfirst from WinXP when | |
484 | access denied is returned and thus bcc and wct are zero | |
485 | but server says length is 0x21 bytes too long as if the server | |
486 | forget to reset the smb rfc1001 length when it reset the | |
487 | wct and bcc to minimum size and drop the t2 parms and data */ | |
790fe579 | 488 | if ((4+len > clc_len) && (len <= clc_len + 512)) |
190fdeb8 | 489 | return 0; |
46c79a64 SF |
490 | else { |
491 | cERROR(1, ("RFC1001 size %d bigger than SMB for Mid=%d", | |
492 | len, smb->Mid)); | |
190fdeb8 | 493 | return 1; |
46c79a64 | 494 | } |
1da177e4 | 495 | } |
20962438 | 496 | return 0; |
1da177e4 LT |
497 | } |
498 | int | |
d7c8c94d | 499 | is_valid_oplock_break(struct smb_hdr *buf, struct TCP_Server_Info *srv) |
fb8c4b14 SF |
500 | { |
501 | struct smb_com_lock_req *pSMB = (struct smb_com_lock_req *)buf; | |
1da177e4 LT |
502 | struct list_head *tmp; |
503 | struct list_head *tmp1; | |
504 | struct cifsTconInfo *tcon; | |
505 | struct cifsFileInfo *netfile; | |
506 | ||
fb8c4b14 | 507 | cFYI(1, ("Checking for oplock break or dnotify response")); |
790fe579 | 508 | if ((pSMB->hdr.Command == SMB_COM_NT_TRANSACT) && |
1da177e4 | 509 | (pSMB->hdr.Flags & SMBFLG_RESPONSE)) { |
fb8c4b14 | 510 | struct smb_com_transaction_change_notify_rsp *pSMBr = |
1da177e4 | 511 | (struct smb_com_transaction_change_notify_rsp *)buf; |
fb8c4b14 | 512 | struct file_notify_information *pnotify; |
1da177e4 | 513 | __u32 data_offset = 0; |
790fe579 | 514 | if (pSMBr->ByteCount > sizeof(struct file_notify_information)) { |
1da177e4 LT |
515 | data_offset = le32_to_cpu(pSMBr->DataOffset); |
516 | ||
3979877e SF |
517 | pnotify = (struct file_notify_information *) |
518 | ((char *)&pSMBr->hdr.Protocol + data_offset); | |
fb8c4b14 | 519 | cFYI(1,("dnotify on %s Action: 0x%x", pnotify->FileName, |
1da177e4 | 520 | pnotify->Action)); /* BB removeme BB */ |
fb8c4b14 | 521 | /* cifs_dump_mem("Rcvd notify Data: ",buf, |
3979877e | 522 | sizeof(struct smb_hdr)+60); */ |
1da177e4 LT |
523 | return TRUE; |
524 | } | |
790fe579 | 525 | if (pSMBr->hdr.Status.CifsError) { |
fb8c4b14 SF |
526 | cFYI(1, ("notify err 0x%d", |
527 | pSMBr->hdr.Status.CifsError)); | |
1da177e4 LT |
528 | return TRUE; |
529 | } | |
530 | return FALSE; | |
fb8c4b14 | 531 | } |
790fe579 | 532 | if (pSMB->hdr.Command != SMB_COM_LOCKING_ANDX) |
1da177e4 | 533 | return FALSE; |
790fe579 | 534 | if (pSMB->hdr.Flags & SMBFLG_RESPONSE) { |
1da177e4 LT |
535 | /* no sense logging error on invalid handle on oplock |
536 | break - harmless race between close request and oplock | |
537 | break response is expected from time to time writing out | |
538 | large dirty files cached on the client */ | |
fb8c4b14 SF |
539 | if ((NT_STATUS_INVALID_HANDLE) == |
540 | le32_to_cpu(pSMB->hdr.Status.CifsError)) { | |
541 | cFYI(1, ("invalid handle on oplock break")); | |
1da177e4 | 542 | return TRUE; |
fb8c4b14 | 543 | } else if (ERRbadfid == |
1da177e4 | 544 | le16_to_cpu(pSMB->hdr.Status.DosError.Error)) { |
fb8c4b14 | 545 | return TRUE; |
1da177e4 LT |
546 | } else { |
547 | return FALSE; /* on valid oplock brk we get "request" */ | |
548 | } | |
549 | } | |
790fe579 | 550 | if (pSMB->hdr.WordCount != 8) |
1da177e4 LT |
551 | return FALSE; |
552 | ||
fb8c4b14 SF |
553 | cFYI(1, ("oplock type 0x%d level 0x%d", |
554 | pSMB->LockType, pSMB->OplockLevel)); | |
790fe579 | 555 | if (!(pSMB->LockType & LOCKING_ANDX_OPLOCK_RELEASE)) |
fb8c4b14 | 556 | return FALSE; |
1da177e4 LT |
557 | |
558 | /* look up tcon based on tid & uid */ | |
559 | read_lock(&GlobalSMBSeslock); | |
560 | list_for_each(tmp, &GlobalTreeConnectionList) { | |
561 | tcon = list_entry(tmp, struct cifsTconInfo, cifsConnectionList); | |
d7c8c94d | 562 | if ((tcon->tid == buf->Tid) && (srv == tcon->ses->server)) { |
a4544347 | 563 | cifs_stats_inc(&tcon->num_oplock_brks); |
fb8c4b14 SF |
564 | list_for_each(tmp1, &tcon->openFileList) { |
565 | netfile = list_entry(tmp1, struct cifsFileInfo, | |
57337e42 | 566 | tlist); |
790fe579 | 567 | if (pSMB->Fid == netfile->netfid) { |
1da177e4 LT |
568 | struct cifsInodeInfo *pCifsInode; |
569 | read_unlock(&GlobalSMBSeslock); | |
57337e42 | 570 | cFYI(1,("file id match, oplock break")); |
fb8c4b14 | 571 | pCifsInode = |
1da177e4 LT |
572 | CIFS_I(netfile->pInode); |
573 | pCifsInode->clientCanCacheAll = FALSE; | |
790fe579 | 574 | if (pSMB->OplockLevel == 0) |
57337e42 SF |
575 | pCifsInode->clientCanCacheRead |
576 | = FALSE; | |
1da177e4 | 577 | pCifsInode->oplockPending = TRUE; |
57337e42 SF |
578 | AllocOplockQEntry(netfile->pInode, |
579 | netfile->netfid, | |
580 | tcon); | |
1da177e4 | 581 | cFYI(1,("about to wake up oplock thd")); |
790fe579 | 582 | if (oplockThread) |
57337e42 | 583 | wake_up_process(oplockThread); |
1da177e4 LT |
584 | return TRUE; |
585 | } | |
586 | } | |
587 | read_unlock(&GlobalSMBSeslock); | |
fb8c4b14 | 588 | cFYI(1, ("No matching file for oplock break")); |
1da177e4 LT |
589 | return TRUE; |
590 | } | |
591 | } | |
592 | read_unlock(&GlobalSMBSeslock); | |
fb8c4b14 | 593 | cFYI(1, ("Can not process oplock break for non-existent connection")); |
1da177e4 LT |
594 | return TRUE; |
595 | } | |
596 | ||
597 | void | |
598 | dump_smb(struct smb_hdr *smb_buf, int smb_buf_length) | |
599 | { | |
600 | int i, j; | |
601 | char debug_line[17]; | |
602 | unsigned char *buffer; | |
603 | ||
604 | if (traceSMB == 0) | |
605 | return; | |
606 | ||
607 | buffer = (unsigned char *) smb_buf; | |
608 | for (i = 0, j = 0; i < smb_buf_length; i++, j++) { | |
57337e42 | 609 | if (i % 8 == 0) { /* have reached the beginning of line */ |
1da177e4 LT |
610 | printk(KERN_DEBUG "| "); |
611 | j = 0; | |
612 | } | |
613 | printk("%0#4x ", buffer[i]); | |
614 | debug_line[2 * j] = ' '; | |
615 | if (isprint(buffer[i])) | |
616 | debug_line[1 + (2 * j)] = buffer[i]; | |
617 | else | |
618 | debug_line[1 + (2 * j)] = '_'; | |
619 | ||
57337e42 | 620 | if (i % 8 == 7) { /* reached end of line, time to print ascii */ |
1da177e4 LT |
621 | debug_line[16] = 0; |
622 | printk(" | %s\n", debug_line); | |
623 | } | |
624 | } | |
625 | for (; j < 8; j++) { | |
626 | printk(" "); | |
627 | debug_line[2 * j] = ' '; | |
628 | debug_line[1 + (2 * j)] = ' '; | |
629 | } | |
630 | printk( " | %s\n", debug_line); | |
631 | return; | |
632 | } | |
6a0b4824 | 633 | |
6a0b4824 SF |
634 | /* Windows maps these to the user defined 16 bit Unicode range since they are |
635 | reserved symbols (along with \ and /), otherwise illegal to store | |
636 | in filenames in NTFS */ | |
d0724714 SF |
637 | #define UNI_ASTERIK (__u16) ('*' + 0xF000) |
638 | #define UNI_QUESTION (__u16) ('?' + 0xF000) | |
639 | #define UNI_COLON (__u16) (':' + 0xF000) | |
640 | #define UNI_GRTRTHAN (__u16) ('>' + 0xF000) | |
641 | #define UNI_LESSTHAN (__u16) ('<' + 0xF000) | |
642 | #define UNI_PIPE (__u16) ('|' + 0xF000) | |
643 | #define UNI_SLASH (__u16) ('\\' + 0xF000) | |
6a0b4824 SF |
644 | |
645 | /* Convert 16 bit Unicode pathname from wire format to string in current code | |
646 | page. Conversion may involve remapping up the seven characters that are | |
647 | only legal in POSIX-like OS (if they are present in the string). Path | |
648 | names are little endian 16 bit Unicode on the wire */ | |
649 | int | |
fb8c4b14 SF |
650 | cifs_convertUCSpath(char *target, const __le16 *source, int maxlen, |
651 | const struct nls_table *cp) | |
6a0b4824 | 652 | { |
fb8c4b14 | 653 | int i, j, len; |
d0724714 | 654 | __u16 src_char; |
6a0b4824 | 655 | |
fb8c4b14 | 656 | for (i = 0, j = 0; i < maxlen; i++) { |
6a0b4824 SF |
657 | src_char = le16_to_cpu(source[i]); |
658 | switch (src_char) { | |
659 | case 0: | |
660 | goto cUCS_out; /* BB check this BB */ | |
661 | case UNI_COLON: | |
662 | target[j] = ':'; | |
663 | break; | |
664 | case UNI_ASTERIK: | |
665 | target[j] = '*'; | |
666 | break; | |
667 | case UNI_QUESTION: | |
668 | target[j] = '?'; | |
669 | break; | |
6c91d362 SF |
670 | /* BB We can not handle remapping slash until |
671 | all the calls to build_path_from_dentry | |
672 | are modified, as they use slash as separator BB */ | |
673 | /* case UNI_SLASH: | |
674 | target[j] = '\\'; | |
675 | break;*/ | |
6a0b4824 SF |
676 | case UNI_PIPE: |
677 | target[j] = '|'; | |
678 | break; | |
679 | case UNI_GRTRTHAN: | |
680 | target[j] = '>'; | |
681 | break; | |
682 | case UNI_LESSTHAN: | |
683 | target[j] = '<'; | |
67594feb | 684 | break; |
fb8c4b14 SF |
685 | default: |
686 | len = cp->uni2char(src_char, &target[j], | |
6a0b4824 | 687 | NLS_MAX_CHARSET_SIZE); |
790fe579 | 688 | if (len > 0) { |
6a0b4824 SF |
689 | j += len; |
690 | continue; | |
691 | } else { | |
692 | target[j] = '?'; | |
693 | } | |
694 | } | |
695 | j++; | |
57337e42 | 696 | /* make sure we do not overrun callers allocated temp buffer */ |
790fe579 | 697 | if (j >= (2 * NAME_MAX)) |
6a0b4824 SF |
698 | break; |
699 | } | |
700 | cUCS_out: | |
701 | target[j] = 0; | |
702 | return j; | |
703 | } | |
6c91d362 SF |
704 | |
705 | /* Convert 16 bit Unicode pathname to wire format from string in current code | |
706 | page. Conversion may involve remapping up the seven characters that are | |
707 | only legal in POSIX-like OS (if they are present in the string). Path | |
708 | names are little endian 16 bit Unicode on the wire */ | |
709 | int | |
fb8c4b14 SF |
710 | cifsConvertToUCS(__le16 *target, const char *source, int maxlen, |
711 | const struct nls_table *cp, int mapChars) | |
6c91d362 | 712 | { |
fb8c4b14 | 713 | int i, j, charlen; |
6c91d362 SF |
714 | int len_remaining = maxlen; |
715 | char src_char; | |
70ca734a | 716 | __u16 temp; |
6c91d362 | 717 | |
790fe579 | 718 | if (!mapChars) |
e89dc920 | 719 | return cifs_strtoUCS(target, source, PATH_MAX, cp); |
6c91d362 | 720 | |
fb8c4b14 | 721 | for (i = 0, j = 0; i < maxlen; j++) { |
6c91d362 SF |
722 | src_char = source[i]; |
723 | switch (src_char) { | |
724 | case 0: | |
f4cfd69c | 725 | target[j] = 0; |
6c91d362 SF |
726 | goto ctoUCS_out; |
727 | case ':': | |
728 | target[j] = cpu_to_le16(UNI_COLON); | |
729 | break; | |
730 | case '*': | |
731 | target[j] = cpu_to_le16(UNI_ASTERIK); | |
732 | break; | |
733 | case '?': | |
734 | target[j] = cpu_to_le16(UNI_QUESTION); | |
735 | break; | |
736 | case '<': | |
737 | target[j] = cpu_to_le16(UNI_LESSTHAN); | |
738 | break; | |
739 | case '>': | |
740 | target[j] = cpu_to_le16(UNI_GRTRTHAN); | |
741 | break; | |
742 | case '|': | |
743 | target[j] = cpu_to_le16(UNI_PIPE); | |
fb8c4b14 | 744 | break; |
6c91d362 SF |
745 | /* BB We can not handle remapping slash until |
746 | all the calls to build_path_from_dentry | |
747 | are modified, as they use slash as separator BB */ | |
748 | /* case '\\': | |
749 | target[j] = cpu_to_le16(UNI_SLASH); | |
750 | break;*/ | |
751 | default: | |
752 | charlen = cp->char2uni(source+i, | |
70ca734a | 753 | len_remaining, &temp); |
6c91d362 SF |
754 | /* if no match, use question mark, which |
755 | at least in some cases servers as wild card */ | |
790fe579 | 756 | if (charlen < 1) { |
6c91d362 SF |
757 | target[j] = cpu_to_le16(0x003f); |
758 | charlen = 1; | |
70ca734a SF |
759 | } else |
760 | target[j] = cpu_to_le16(temp); | |
6c91d362 SF |
761 | len_remaining -= charlen; |
762 | /* character may take more than one byte in the | |
763 | the source string, but will take exactly two | |
764 | bytes in the target string */ | |
fb8c4b14 | 765 | i += charlen; |
6c91d362 SF |
766 | continue; |
767 | } | |
768 | i++; /* move to next char in source string */ | |
769 | len_remaining--; | |
770 | } | |
771 | ||
772 | ctoUCS_out: | |
773 | return i; | |
774 | } |