mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-12 05:56:41 +07:00
5072010ccf
As per MS-DFSC, when a DFS cache entry is expired and it is a DFS link, then a new DFS referral must be sent to root server in order to refresh the expired entry. This patch ensures that all new DFS referrals for refreshing the cache are sent to DFS root. Signed-off-by: Paulo Alcantara (SUSE) <paulo@paulo.ac> Signed-off-by: Steve French <stfrench@microsoft.com>
99 lines
2.7 KiB
C
99 lines
2.7 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
/*
|
|
* DFS referral cache routines
|
|
*
|
|
* Copyright (c) 2018-2019 Paulo Alcantara <palcantara@suse.de>
|
|
*/
|
|
|
|
#ifndef _CIFS_DFS_CACHE_H
|
|
#define _CIFS_DFS_CACHE_H
|
|
|
|
#include <linux/nls.h>
|
|
#include <linux/list.h>
|
|
#include "cifsglob.h"
|
|
|
|
struct dfs_cache_tgt_list {
|
|
int tl_numtgts;
|
|
struct list_head tl_list;
|
|
};
|
|
|
|
struct dfs_cache_tgt_iterator {
|
|
char *it_name;
|
|
struct list_head it_list;
|
|
};
|
|
|
|
extern int dfs_cache_init(void);
|
|
extern void dfs_cache_destroy(void);
|
|
extern const struct file_operations dfscache_proc_fops;
|
|
|
|
extern int dfs_cache_find(const unsigned int xid, struct cifs_ses *ses,
|
|
const struct nls_table *nls_codepage, int remap,
|
|
const char *path, struct dfs_info3_param *ref,
|
|
struct dfs_cache_tgt_list *tgt_list);
|
|
extern int dfs_cache_noreq_find(const char *path, struct dfs_info3_param *ref,
|
|
struct dfs_cache_tgt_list *tgt_list);
|
|
extern int dfs_cache_update_tgthint(const unsigned int xid,
|
|
struct cifs_ses *ses,
|
|
const struct nls_table *nls_codepage,
|
|
int remap, const char *path,
|
|
const struct dfs_cache_tgt_iterator *it);
|
|
extern int
|
|
dfs_cache_noreq_update_tgthint(const char *path,
|
|
const struct dfs_cache_tgt_iterator *it);
|
|
extern int dfs_cache_get_tgt_referral(const char *path,
|
|
const struct dfs_cache_tgt_iterator *it,
|
|
struct dfs_info3_param *ref);
|
|
extern int dfs_cache_add_vol(char *mntdata, struct smb_vol *vol,
|
|
const char *fullpath);
|
|
extern int dfs_cache_update_vol(const char *fullpath,
|
|
struct TCP_Server_Info *server);
|
|
extern void dfs_cache_del_vol(const char *fullpath);
|
|
|
|
static inline struct dfs_cache_tgt_iterator *
|
|
dfs_cache_get_next_tgt(struct dfs_cache_tgt_list *tl,
|
|
struct dfs_cache_tgt_iterator *it)
|
|
{
|
|
if (!tl || list_empty(&tl->tl_list) || !it ||
|
|
list_is_last(&it->it_list, &tl->tl_list))
|
|
return NULL;
|
|
return list_next_entry(it, it_list);
|
|
}
|
|
|
|
static inline struct dfs_cache_tgt_iterator *
|
|
dfs_cache_get_tgt_iterator(struct dfs_cache_tgt_list *tl)
|
|
{
|
|
if (!tl)
|
|
return NULL;
|
|
return list_first_entry_or_null(&tl->tl_list,
|
|
struct dfs_cache_tgt_iterator,
|
|
it_list);
|
|
}
|
|
|
|
static inline void dfs_cache_free_tgts(struct dfs_cache_tgt_list *tl)
|
|
{
|
|
struct dfs_cache_tgt_iterator *it, *nit;
|
|
|
|
if (!tl || list_empty(&tl->tl_list))
|
|
return;
|
|
list_for_each_entry_safe(it, nit, &tl->tl_list, it_list) {
|
|
list_del(&it->it_list);
|
|
kfree(it->it_name);
|
|
kfree(it);
|
|
}
|
|
tl->tl_numtgts = 0;
|
|
}
|
|
|
|
static inline const char *
|
|
dfs_cache_get_tgt_name(const struct dfs_cache_tgt_iterator *it)
|
|
{
|
|
return it ? it->it_name : NULL;
|
|
}
|
|
|
|
static inline int
|
|
dfs_cache_get_nr_tgts(const struct dfs_cache_tgt_list *tl)
|
|
{
|
|
return tl ? tl->tl_numtgts : 0;
|
|
}
|
|
|
|
#endif /* _CIFS_DFS_CACHE_H */
|