diff options
author | Steve French <sfrench@us.ibm.com> | 2008-01-25 10:12:41 +0000 |
---|---|---|
committer | Steve French <sfrench@us.ibm.com> | 2008-01-25 10:12:41 +0000 |
commit | 366781c19635d861f43ff5e03388a3873ec912d9 (patch) | |
tree | beef581849a76dd7b1c1e365c19314409f2189fb /fs/cifs/cifsglob.h | |
parent | 6d5ae0deb1641bf615eafd8fef64218e10cb2fd0 (diff) | |
download | kernel_samsung_tuna-366781c19635d861f43ff5e03388a3873ec912d9.zip kernel_samsung_tuna-366781c19635d861f43ff5e03388a3873ec912d9.tar.gz kernel_samsung_tuna-366781c19635d861f43ff5e03388a3873ec912d9.tar.bz2 |
[CIFS] DFS build fixes
Also includes a few minor changes suggested by Christoph
Signed-off-by: Steve French <sfrench@us.ibm.com>
Diffstat (limited to 'fs/cifs/cifsglob.h')
-rw-r--r-- | fs/cifs/cifsglob.h | 41 |
1 files changed, 32 insertions, 9 deletions
diff --git a/fs/cifs/cifsglob.h b/fs/cifs/cifsglob.h index 1fde219..5d32d8d 100644 --- a/fs/cifs/cifsglob.h +++ b/fs/cifs/cifsglob.h @@ -1,7 +1,7 @@ /* * fs/cifs/cifsglob.h * - * Copyright (C) International Business Machines Corp., 2002,2007 + * Copyright (C) International Business Machines Corp., 2002,2008 * Author(s): Steve French (sfrench@us.ibm.com) * Jeremy Allison (jra@samba.org) * @@ -70,14 +70,6 @@ #endif /* - * This information is kept on every Server we know about. - * - * Some things to note: - * - */ -#define SERVER_NAME_LEN_WITH_NULL (SERVER_NAME_LENGTH + 1) - -/* * CIFS vfs client Status information (based on what we know.) */ @@ -460,6 +452,37 @@ struct dir_notify_req { struct file *pfile; }; +struct dfs_info3_param { + int flags; /* DFSREF_REFERRAL_SERVER, DFSREF_STORAGE_SERVER*/ + int PathConsumed; + int server_type; + int ref_flag; + char *path_name; + char *node_name; +}; + +static inline void free_dfs_info_param(struct dfs_info3_param *param) +{ + if (param) { + kfree(param->path_name); + kfree(param->node_name); + kfree(param); + } +} + +static inline void free_dfs_info_array(struct dfs_info3_param *param, + int number_of_items) +{ + int i; + if ((number_of_items == 0) || (param == NULL)) + return; + for (i = 0; i < number_of_items; i++) { + kfree(param[i].path_name); + kfree(param[i].node_name); + } + kfree(param); +} + #define MID_FREE 0 #define MID_REQUEST_ALLOCATED 1 #define MID_REQUEST_SUBMITTED 2 |