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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
/*
Unix SMB/CIFS implementation.
POSIX NTVFS backend - structure definitions
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.
*/
#ifndef _VFS_POSIX_H_
#define _VFS_POSIX_H_
#include "smb_server/smb_server.h"
/* this is the private structure for the posix vfs backend. It is used
to hold per-connection (per tree connect) state information */
struct pvfs_state {
struct smbsrv_tcon *tcon;
const char *base_directory;
const char *share_name;
uint_t flags;
struct pvfs_file *open_files;
struct pvfs_mangle_context *mangle_ctx;
struct brl_context *brl_context;
struct odb_context *odb_context;
/* an id tree mapping open search ID to a pvfs_search_state structure */
struct idr_context *idtree_search;
/* an id tree mapping open file handle -> struct pvfs_file */
struct idr_context *idtree_fnum;
/* a list of pending async requests. Needed to support
ntcancel */
struct pvfs_wait *wait_list;
/* the sharing violation timeout */
uint_t sharing_violation_delay;
};
/* this is the basic information needed about a file from the filesystem */
struct pvfs_dos_fileinfo {
NTTIME create_time;
NTTIME access_time;
NTTIME write_time;
NTTIME change_time;
uint32_t attrib;
uint64_t alloc_size;
uint32_t nlink;
uint32_t ea_size;
uint64_t file_id;
};
/*
this is the structure returned by pvfs_resolve_name(). It holds the posix details of
a filename passed by the client to any function
*/
struct pvfs_filename {
const char *original_name;
char *full_name;
const char *stream_name;
BOOL has_wildcard;
BOOL exists;
struct stat st;
struct pvfs_dos_fileinfo dos;
};
/* open file state */
struct pvfs_file {
struct pvfs_file *next, *prev;
int fd;
uint16_t fnum;
struct pvfs_filename *name;
/* we need to remember the session it was opened on,
as it is illegal to operate on someone elses fnum */
struct smbsrv_session *session;
/* we need to remember the client pid that
opened the file so SMBexit works */
uint16_t smbpid;
/* a unique file key to be used for file locking */
DATA_BLOB locking_key;
/* we need this hook back to our parent for lock destruction */
struct pvfs_state *pvfs;
/* a list of pending locks - used for locking cancel operations */
struct pvfs_pending_lock *pending_list;
/* a count of active locks - used to avoid calling brl_close on
file close */
uint64_t lock_count;
uint32_t create_options;
uint32_t share_access;
uint32_t access_mask;
/* yes, we need 2 independent positions ... */
uint64_t seek_offset;
uint64_t position;
BOOL have_opendb_entry;
};
struct pvfs_mangle_context {
uint8_t char_flags[256];
/*
this determines how many characters are used from the original
filename in the 8.3 mangled name. A larger value leads to a weaker
hash and more collisions. The largest possible value is 6.
*/
int mangle_prefix;
uint32_t mangle_modulus;
/* we will use a very simple direct mapped prefix cache. The big
advantage of this cache structure is speed and low memory usage
The cache is indexed by the low-order bits of the hash, and confirmed by
hashing the resulting cache entry to match the known hash
*/
char **prefix_cache;
uint32_t *prefix_cache_hashes;
/* this is used to reverse the base 36 mapping */
unsigned char base_reverse[256];
};
/* flags to pvfs_resolve_name() */
#define PVFS_RESOLVE_NO_WILDCARD (1<<0)
#define PVFS_RESOLVE_STREAMS (1<<1)
/* flags in pvfs->flags */
#define PVFS_FLAG_CI_FILESYSTEM (1<<0) /* the filesystem is case insensitive */
#define PVFS_FLAG_MAP_ARCHIVE (1<<1)
#define PVFS_FLAG_MAP_SYSTEM (1<<2)
#define PVFS_FLAG_MAP_HIDDEN (1<<3)
#define PVFS_FLAG_READONLY (1<<4)
#define PVFS_FLAG_STRICT_SYNC (1<<5)
#define PVFS_FLAG_STRICT_LOCKING (1<<6)
/* forward declare some anonymous structures */
struct pvfs_dir;
#endif /* _VFS_POSIX_H_ */
|
