mirror of
https://github.com/samba-team/samba.git
synced 2025-11-22 16:23:49 +03:00
r13316: Let the carnage begin....
Sync with trunk as off r13315
This commit is contained in:
committed by
Gerald (Jerry) Carter
parent
50c894a6e9
commit
17e63ac4ed
@@ -1,10 +1,9 @@
|
||||
/*
|
||||
* Unix SMB/CIFS implementation.
|
||||
* RPC Pipe client / server routines for Dfs
|
||||
* Copyright (C) Andrew Tridgell 1992-1997,
|
||||
* Copyright (C) Luke Kenneth Casson Leighton 1996-1997,
|
||||
* Copyright (C) Shirish Kalele 2000.
|
||||
* Copyright (C) Jeremy Allison 2001.
|
||||
* Copyright (C) Shirish Kalele 2000.
|
||||
* Copyright (C) Jeremy Allison 2001.
|
||||
* Copyright (C) Jelmer Vernooij 2005.
|
||||
*
|
||||
* 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
|
||||
@@ -24,7 +23,6 @@
|
||||
/* This is the implementation of the dfs pipe. */
|
||||
|
||||
#include "includes.h"
|
||||
#include "nterr.h"
|
||||
|
||||
#undef DBGC_CLASS
|
||||
#define DBGC_CLASS DBGC_MSDFS
|
||||
@@ -32,7 +30,7 @@
|
||||
/* This function does not return a WERROR or NTSTATUS code but rather 1 if
|
||||
dfs exists, or 0 otherwise. */
|
||||
|
||||
uint32 _dfs_exist(pipes_struct *p, DFS_Q_DFS_EXIST *q_u, DFS_R_DFS_EXIST *r_u)
|
||||
uint32 _dfs_GetManagerVersion(pipes_struct *p, NETDFS_Q_DFS_GETMANAGERVERSION *q_u, NETDFS_R_DFS_GETMANAGERVERSION *r_u)
|
||||
{
|
||||
if(lp_host_msdfs())
|
||||
return 1;
|
||||
@@ -40,7 +38,7 @@ uint32 _dfs_exist(pipes_struct *p, DFS_Q_DFS_EXIST *q_u, DFS_R_DFS_EXIST *r_u)
|
||||
return 0;
|
||||
}
|
||||
|
||||
WERROR _dfs_add(pipes_struct *p, DFS_Q_DFS_ADD* q_u, DFS_R_DFS_ADD *r_u)
|
||||
WERROR _dfs_Add(pipes_struct *p, NETDFS_Q_DFS_ADD* q_u, NETDFS_R_DFS_ADD *r_u)
|
||||
{
|
||||
struct current_user user;
|
||||
struct junction_map jn;
|
||||
@@ -57,9 +55,9 @@ WERROR _dfs_add(pipes_struct *p, DFS_Q_DFS_ADD* q_u, DFS_R_DFS_ADD *r_u)
|
||||
return WERR_ACCESS_DENIED;
|
||||
}
|
||||
|
||||
unistr2_to_ascii(dfspath, &q_u->DfsEntryPath, sizeof(dfspath)-1);
|
||||
unistr2_to_ascii(servername, &q_u->ServerName, sizeof(servername)-1);
|
||||
unistr2_to_ascii(sharename, &q_u->ShareName, sizeof(sharename)-1);
|
||||
unistr2_to_ascii(dfspath, &q_u->path, sizeof(dfspath)-1);
|
||||
unistr2_to_ascii(servername, &q_u->server, sizeof(servername)-1);
|
||||
unistr2_to_ascii(sharename, &q_u->share, sizeof(sharename)-1);
|
||||
|
||||
DEBUG(5,("init_reply_dfs_add: Request to add %s -> %s\\%s.\n",
|
||||
dfspath, servername, sharename));
|
||||
@@ -103,8 +101,8 @@ WERROR _dfs_add(pipes_struct *p, DFS_Q_DFS_ADD* q_u, DFS_R_DFS_ADD *r_u)
|
||||
return WERR_OK;
|
||||
}
|
||||
|
||||
WERROR _dfs_remove(pipes_struct *p, DFS_Q_DFS_REMOVE *q_u,
|
||||
DFS_R_DFS_REMOVE *r_u)
|
||||
WERROR _dfs_Remove(pipes_struct *p, NETDFS_Q_DFS_REMOVE *q_u,
|
||||
NETDFS_R_DFS_REMOVE *r_u)
|
||||
{
|
||||
struct current_user user;
|
||||
struct junction_map jn;
|
||||
@@ -120,16 +118,16 @@ WERROR _dfs_remove(pipes_struct *p, DFS_Q_DFS_REMOVE *q_u,
|
||||
return WERR_ACCESS_DENIED;
|
||||
}
|
||||
|
||||
unistr2_to_ascii(dfspath, &q_u->DfsEntryPath, sizeof(dfspath)-1);
|
||||
if(q_u->ptr_ServerName) {
|
||||
unistr2_to_ascii(servername, &q_u->ServerName, sizeof(servername)-1);
|
||||
unistr2_to_ascii(dfspath, &q_u->path, sizeof(dfspath)-1);
|
||||
if(q_u->ptr0_server) {
|
||||
unistr2_to_ascii(servername, &q_u->server, sizeof(servername)-1);
|
||||
}
|
||||
|
||||
if(q_u->ptr_ShareName) {
|
||||
unistr2_to_ascii(sharename, &q_u->ShareName, sizeof(sharename)-1);
|
||||
if(q_u->ptr0_share) {
|
||||
unistr2_to_ascii(sharename, &q_u->share, sizeof(sharename)-1);
|
||||
}
|
||||
|
||||
if(q_u->ptr_ServerName && q_u->ptr_ShareName) {
|
||||
if(q_u->ptr0_server && q_u->ptr0_share) {
|
||||
pstrcpy(altpath, servername);
|
||||
pstrcat(altpath, "\\");
|
||||
pstrcat(altpath, sharename);
|
||||
@@ -144,7 +142,7 @@ WERROR _dfs_remove(pipes_struct *p, DFS_Q_DFS_REMOVE *q_u,
|
||||
}
|
||||
|
||||
/* if no server-share pair given, remove the msdfs link completely */
|
||||
if(!q_u->ptr_ServerName && !q_u->ptr_ShareName) {
|
||||
if(!q_u->ptr0_server && !q_u->ptr0_share) {
|
||||
if(!remove_msdfs_link(&jn)) {
|
||||
vfs_ChDir(p->conn,p->conn->connectpath);
|
||||
return WERR_DFS_NO_SUCH_VOL;
|
||||
@@ -189,167 +187,164 @@ WERROR _dfs_remove(pipes_struct *p, DFS_Q_DFS_REMOVE *q_u,
|
||||
return WERR_OK;
|
||||
}
|
||||
|
||||
static BOOL init_reply_dfs_info_1(struct junction_map* j, DFS_INFO_1* dfs1, int num_j)
|
||||
static BOOL init_reply_dfs_info_1(struct junction_map* j, NETDFS_DFS_INFO1* dfs1)
|
||||
{
|
||||
int i=0;
|
||||
for(i=0;i<num_j;i++) {
|
||||
pstring str;
|
||||
dfs1[i].ptr_entrypath = 1;
|
||||
slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname(),
|
||||
j[i].service_name, j[i].volume_name);
|
||||
DEBUG(5,("init_reply_dfs_info_1: %d) initing entrypath: %s\n",i,str));
|
||||
init_unistr2(&dfs1[i].entrypath,str,UNI_STR_TERMINATE);
|
||||
}
|
||||
pstring str;
|
||||
dfs1->ptr0_path = 1;
|
||||
slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname(),
|
||||
j->service_name, j->volume_name);
|
||||
DEBUG(5,("init_reply_dfs_info_1: initing entrypath: %s\n",str));
|
||||
init_unistr2(&dfs1->path,str,UNI_STR_TERMINATE);
|
||||
return True;
|
||||
}
|
||||
|
||||
static BOOL init_reply_dfs_info_2(struct junction_map* j, DFS_INFO_2* dfs2, int num_j)
|
||||
static BOOL init_reply_dfs_info_2(struct junction_map* j, NETDFS_DFS_INFO2* dfs2)
|
||||
{
|
||||
int i=0;
|
||||
for(i=0;i<num_j;i++) {
|
||||
pstring str;
|
||||
dfs2[i].ptr_entrypath = 1;
|
||||
pstring str;
|
||||
dfs2->ptr0_path = 1;
|
||||
slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname(),
|
||||
j->service_name, j->volume_name);
|
||||
init_unistr2(&dfs2->path, str, UNI_STR_TERMINATE);
|
||||
dfs2->ptr0_comment = 0;
|
||||
dfs2->state = 1; /* set up state of dfs junction as OK */
|
||||
dfs2->num_stores = j->referral_count;
|
||||
return True;
|
||||
}
|
||||
|
||||
static BOOL init_reply_dfs_info_3(TALLOC_CTX *ctx, struct junction_map* j, NETDFS_DFS_INFO3* dfs3)
|
||||
{
|
||||
int ii;
|
||||
pstring str;
|
||||
dfs3->ptr0_path = 1;
|
||||
if (j->volume_name[0] == '\0')
|
||||
slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s",
|
||||
global_myname(), j->service_name);
|
||||
else
|
||||
slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname(),
|
||||
j[i].service_name, j[i].volume_name);
|
||||
init_unistr2(&dfs2[i].entrypath, str, UNI_STR_TERMINATE);
|
||||
dfs2[i].ptr_comment = 0;
|
||||
dfs2[i].state = 1; /* set up state of dfs junction as OK */
|
||||
dfs2[i].num_storages = j[i].referral_count;
|
||||
j->service_name, j->volume_name);
|
||||
|
||||
init_unistr2(&dfs3->path, str, UNI_STR_TERMINATE);
|
||||
dfs3->ptr0_comment = 1;
|
||||
init_unistr2(&dfs3->comment, "", UNI_STR_TERMINATE);
|
||||
dfs3->state = 1;
|
||||
dfs3->num_stores = dfs3->size_stores = j->referral_count;
|
||||
dfs3->ptr0_stores = 1;
|
||||
|
||||
/* also enumerate the stores */
|
||||
dfs3->stores = TALLOC_ARRAY(ctx, NETDFS_DFS_STORAGEINFO, j->referral_count);
|
||||
if (!dfs3->stores)
|
||||
return False;
|
||||
|
||||
memset(dfs3->stores, '\0', j->referral_count * sizeof(NETDFS_DFS_STORAGEINFO));
|
||||
|
||||
for(ii=0;ii<j->referral_count;ii++) {
|
||||
char* p;
|
||||
pstring path;
|
||||
NETDFS_DFS_STORAGEINFO* stor = &(dfs3->stores[ii]);
|
||||
struct referral* ref = &(j->referral_list[ii]);
|
||||
|
||||
pstrcpy(path, ref->alternate_path);
|
||||
trim_char(path,'\\','\0');
|
||||
p = strrchr_m(path,'\\');
|
||||
if(p==NULL) {
|
||||
DEBUG(4,("init_reply_dfs_info_3: invalid path: no \\ found in %s\n",path));
|
||||
continue;
|
||||
}
|
||||
*p = '\0';
|
||||
DEBUG(5,("storage %d: %s.%s\n",ii,path,p+1));
|
||||
stor->state = 2; /* set all stores as ONLINE */
|
||||
init_unistr2(&stor->server, path, UNI_STR_TERMINATE);
|
||||
init_unistr2(&stor->share, p+1, UNI_STR_TERMINATE);
|
||||
stor->ptr0_server = stor->ptr0_share = 1;
|
||||
}
|
||||
return True;
|
||||
}
|
||||
|
||||
static BOOL init_reply_dfs_info_3(TALLOC_CTX *ctx, struct junction_map* j, DFS_INFO_3* dfs3, int num_j)
|
||||
{
|
||||
int i=0,ii=0;
|
||||
for(i=0;i<num_j;i++) {
|
||||
pstring str;
|
||||
dfs3[i].ptr_entrypath = 1;
|
||||
if (j[i].volume_name[0] == '\0')
|
||||
slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s",
|
||||
global_myname(), j[i].service_name);
|
||||
else
|
||||
slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname(),
|
||||
j[i].service_name, j[i].volume_name);
|
||||
|
||||
init_unistr2(&dfs3[i].entrypath, str, UNI_STR_TERMINATE);
|
||||
dfs3[i].ptr_comment = 1;
|
||||
init_unistr2(&dfs3[i].comment, "", UNI_STR_TERMINATE);
|
||||
dfs3[i].state = 1;
|
||||
dfs3[i].num_storages = dfs3[i].num_storage_infos = j[i].referral_count;
|
||||
dfs3[i].ptr_storages = 1;
|
||||
|
||||
/* also enumerate the storages */
|
||||
dfs3[i].storages = TALLOC_ARRAY(ctx, DFS_STORAGE_INFO, j[i].referral_count);
|
||||
if (!dfs3[i].storages)
|
||||
return False;
|
||||
|
||||
memset(dfs3[i].storages, '\0', j[i].referral_count * sizeof(DFS_STORAGE_INFO));
|
||||
|
||||
for(ii=0;ii<j[i].referral_count;ii++) {
|
||||
char* p;
|
||||
pstring path;
|
||||
DFS_STORAGE_INFO* stor = &(dfs3[i].storages[ii]);
|
||||
struct referral* ref = &(j[i].referral_list[ii]);
|
||||
|
||||
pstrcpy(path, ref->alternate_path);
|
||||
trim_char(path,'\\','\0');
|
||||
p = strrchr_m(path,'\\');
|
||||
if(p==NULL) {
|
||||
DEBUG(4,("init_reply_dfs_info_3: invalid path: no \\ found in %s\n",path));
|
||||
continue;
|
||||
}
|
||||
*p = '\0';
|
||||
DEBUG(5,("storage %d: %s.%s\n",ii,path,p+1));
|
||||
stor->state = 2; /* set all storages as ONLINE */
|
||||
init_unistr2(&stor->servername, path, UNI_STR_TERMINATE);
|
||||
init_unistr2(&stor->sharename, p+1, UNI_STR_TERMINATE);
|
||||
stor->ptr_servername = stor->ptr_sharename = 1;
|
||||
}
|
||||
}
|
||||
return True;
|
||||
}
|
||||
|
||||
static WERROR init_reply_dfs_ctr(TALLOC_CTX *ctx, uint32 level,
|
||||
DFS_INFO_CTR* ctr, struct junction_map* jn,
|
||||
int num_jn)
|
||||
{
|
||||
/* do the levels */
|
||||
switch(level) {
|
||||
case 1:
|
||||
{
|
||||
DFS_INFO_1* dfs1;
|
||||
dfs1 = TALLOC_ARRAY(ctx, DFS_INFO_1, num_jn);
|
||||
if (!dfs1)
|
||||
return WERR_NOMEM;
|
||||
init_reply_dfs_info_1(jn, dfs1, num_jn);
|
||||
ctr->dfs.info1 = dfs1;
|
||||
break;
|
||||
}
|
||||
case 2:
|
||||
{
|
||||
DFS_INFO_2* dfs2;
|
||||
dfs2 = TALLOC_ARRAY(ctx, DFS_INFO_2, num_jn);
|
||||
if (!dfs2)
|
||||
return WERR_NOMEM;
|
||||
init_reply_dfs_info_2(jn, dfs2, num_jn);
|
||||
ctr->dfs.info2 = dfs2;
|
||||
break;
|
||||
}
|
||||
case 3:
|
||||
{
|
||||
DFS_INFO_3* dfs3;
|
||||
dfs3 = TALLOC_ARRAY(ctx, DFS_INFO_3, num_jn);
|
||||
if (!dfs3)
|
||||
return WERR_NOMEM;
|
||||
init_reply_dfs_info_3(ctx, jn, dfs3, num_jn);
|
||||
ctr->dfs.info3 = dfs3;
|
||||
break;
|
||||
}
|
||||
default:
|
||||
return WERR_INVALID_PARAM;
|
||||
}
|
||||
return WERR_OK;
|
||||
}
|
||||
|
||||
WERROR _dfs_enum(pipes_struct *p, DFS_Q_DFS_ENUM *q_u, DFS_R_DFS_ENUM *r_u)
|
||||
WERROR _dfs_Enum(pipes_struct *p, NETDFS_Q_DFS_ENUM *q_u, NETDFS_R_DFS_ENUM *r_u)
|
||||
{
|
||||
uint32 level = q_u->level;
|
||||
struct junction_map jn[MAX_MSDFS_JUNCTIONS];
|
||||
int num_jn = 0;
|
||||
int i;
|
||||
|
||||
num_jn = enum_msdfs_links(p->mem_ctx, jn, ARRAY_SIZE(jn));
|
||||
vfs_ChDir(p->conn,p->conn->connectpath);
|
||||
|
||||
DEBUG(5,("make_reply_dfs_enum: %d junctions found in Dfs, doing level %d\n", num_jn, level));
|
||||
|
||||
r_u->ptr_buffer = level;
|
||||
r_u->level = r_u->level2 = level;
|
||||
r_u->ptr_num_entries = r_u->ptr_num_entries2 = 1;
|
||||
r_u->num_entries = r_u->num_entries2 = num_jn;
|
||||
r_u->reshnd.ptr_hnd = 1;
|
||||
r_u->reshnd.handle = num_jn;
|
||||
r_u->ptr0_info = q_u->ptr0_info;
|
||||
r_u->ptr0_total = q_u->ptr0_total;
|
||||
r_u->total = num_jn;
|
||||
|
||||
r_u->info = q_u->info;
|
||||
|
||||
/* Create the return array */
|
||||
switch (level) {
|
||||
case 1:
|
||||
if ((r_u->info.e.u.info1.s = TALLOC_ARRAY(p->mem_ctx, NETDFS_DFS_INFO1, num_jn)) == NULL) {
|
||||
return WERR_NOMEM;
|
||||
}
|
||||
r_u->info.e.u.info1.count = num_jn;
|
||||
r_u->info.e.u.info1.ptr0_s = 1;
|
||||
r_u->info.e.u.info1.size_s = num_jn;
|
||||
break;
|
||||
case 2:
|
||||
if ((r_u->info.e.u.info2.s = TALLOC_ARRAY(p->mem_ctx, NETDFS_DFS_INFO2, num_jn)) == NULL) {
|
||||
return WERR_NOMEM;
|
||||
}
|
||||
r_u->info.e.u.info2.count = num_jn;
|
||||
r_u->info.e.u.info2.ptr0_s = 1;
|
||||
r_u->info.e.u.info2.size_s = num_jn;
|
||||
break;
|
||||
case 3:
|
||||
if ((r_u->info.e.u.info3.s = TALLOC_ARRAY(p->mem_ctx, NETDFS_DFS_INFO3, num_jn)) == NULL) {
|
||||
return WERR_NOMEM;
|
||||
}
|
||||
r_u->info.e.u.info3.count = num_jn;
|
||||
r_u->info.e.u.info3.ptr0_s = 1;
|
||||
r_u->info.e.u.info3.size_s = num_jn;
|
||||
break;
|
||||
case 4:
|
||||
if ((r_u->info.e.u.info4.s = TALLOC_ARRAY(p->mem_ctx, NETDFS_DFS_INFO4, num_jn)) == NULL) {
|
||||
return WERR_NOMEM;
|
||||
}
|
||||
r_u->info.e.u.info4.count = num_jn;
|
||||
r_u->info.e.u.info4.ptr0_s = 1;
|
||||
r_u->info.e.u.info4.size_s = num_jn;
|
||||
break;
|
||||
default:
|
||||
return WERR_INVALID_PARAM;
|
||||
}
|
||||
|
||||
for (i = 0; i < num_jn; i++) {
|
||||
switch (level) {
|
||||
case 1:
|
||||
init_reply_dfs_info_1(&jn[i], &r_u->info.e.u.info1.s[i]);
|
||||
break;
|
||||
case 2:
|
||||
init_reply_dfs_info_2(&jn[i], &r_u->info.e.u.info2.s[i]);
|
||||
break;
|
||||
case 3:
|
||||
init_reply_dfs_info_3(p->mem_ctx, &jn[i], &r_u->info.e.u.info3.s[i]);
|
||||
break;
|
||||
default:
|
||||
return WERR_INVALID_PARAM;
|
||||
}
|
||||
}
|
||||
|
||||
r_u->ctr = TALLOC_P(p->mem_ctx, DFS_INFO_CTR);
|
||||
if (!r_u->ctr)
|
||||
return WERR_NOMEM;
|
||||
ZERO_STRUCTP(r_u->ctr);
|
||||
r_u->ctr->switch_value = level;
|
||||
r_u->ctr->num_entries = num_jn;
|
||||
r_u->ctr->ptr_dfs_ctr = 1;
|
||||
|
||||
r_u->status = init_reply_dfs_ctr(p->mem_ctx, level, r_u->ctr, jn, num_jn);
|
||||
r_u->status = WERR_OK;
|
||||
|
||||
return r_u->status;
|
||||
}
|
||||
|
||||
WERROR _dfs_get_info(pipes_struct *p, DFS_Q_DFS_GET_INFO *q_u,
|
||||
DFS_R_DFS_GET_INFO *r_u)
|
||||
WERROR _dfs_GetInfo(pipes_struct *p, NETDFS_Q_DFS_GETINFO *q_u,
|
||||
NETDFS_R_DFS_GETINFO *r_u)
|
||||
{
|
||||
UNISTR2* uni_path = &q_u->uni_path;
|
||||
UNISTR2* uni_path = &q_u->path;
|
||||
uint32 level = q_u->level;
|
||||
int consumedcnt = sizeof(pstring);
|
||||
pstring path;
|
||||
BOOL ret;
|
||||
struct junction_map jn;
|
||||
|
||||
unistr2_to_ascii(path, uni_path, sizeof(path)-1);
|
||||
@@ -363,9 +358,130 @@ WERROR _dfs_get_info(pipes_struct *p, DFS_Q_DFS_GET_INFO *q_u,
|
||||
}
|
||||
|
||||
vfs_ChDir(p->conn,p->conn->connectpath);
|
||||
r_u->level = level;
|
||||
r_u->ptr_ctr = 1;
|
||||
r_u->status = init_reply_dfs_ctr(p->mem_ctx, level, &r_u->ctr, &jn, 1);
|
||||
r_u->info.switch_value = level;
|
||||
r_u->info.ptr0 = 1;
|
||||
r_u->status = WERR_OK;
|
||||
|
||||
switch (level) {
|
||||
case 1: ret = init_reply_dfs_info_1(&jn, &r_u->info.u.info1); break;
|
||||
case 2: ret = init_reply_dfs_info_2(&jn, &r_u->info.u.info2); break;
|
||||
case 3: ret = init_reply_dfs_info_3(p->mem_ctx, &jn, &r_u->info.u.info3); break;
|
||||
default:
|
||||
ret = False;
|
||||
break;
|
||||
}
|
||||
|
||||
if (!ret)
|
||||
r_u->status = WERR_INVALID_PARAM;
|
||||
|
||||
return r_u->status;
|
||||
}
|
||||
|
||||
WERROR _dfs_SetInfo(pipes_struct *p, NETDFS_Q_DFS_SETINFO *q_u, NETDFS_R_DFS_SETINFO *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_Rename(pipes_struct *p, NETDFS_Q_DFS_RENAME *q_u, NETDFS_R_DFS_RENAME *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_Move(pipes_struct *p, NETDFS_Q_DFS_MOVE *q_u, NETDFS_R_DFS_MOVE *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_ManagerGetConfigInfo(pipes_struct *p, NETDFS_Q_DFS_MANAGERGETCONFIGINFO *q_u, NETDFS_R_DFS_MANAGERGETCONFIGINFO *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_ManagerSendSiteInfo(pipes_struct *p, NETDFS_Q_DFS_MANAGERSENDSITEINFO *q_u, NETDFS_R_DFS_MANAGERSENDSITEINFO *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_AddFtRoot(pipes_struct *p, NETDFS_Q_DFS_ADDFTROOT *q_u, NETDFS_R_DFS_ADDFTROOT *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_RemoveFtRoot(pipes_struct *p, NETDFS_Q_DFS_REMOVEFTROOT *q_u, NETDFS_R_DFS_REMOVEFTROOT *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_AddStdRoot(pipes_struct *p, NETDFS_Q_DFS_ADDSTDROOT *q_u, NETDFS_R_DFS_ADDSTDROOT *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_RemoveStdRoot(pipes_struct *p, NETDFS_Q_DFS_REMOVESTDROOT *q_u, NETDFS_R_DFS_REMOVESTDROOT *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_ManagerInitialize(pipes_struct *p, NETDFS_Q_DFS_MANAGERINITIALIZE *q_u, NETDFS_R_DFS_MANAGERINITIALIZE *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_AddStdRootForced(pipes_struct *p, NETDFS_Q_DFS_ADDSTDROOTFORCED *q_u, NETDFS_R_DFS_ADDSTDROOTFORCED *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_GetDcAddress(pipes_struct *p, NETDFS_Q_DFS_GETDCADDRESS *q_u, NETDFS_R_DFS_GETDCADDRESS *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_SetDcAddress(pipes_struct *p, NETDFS_Q_DFS_SETDCADDRESS *q_u, NETDFS_R_DFS_SETDCADDRESS *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_FlushFtTable(pipes_struct *p, NETDFS_Q_DFS_FLUSHFTTABLE *q_u, NETDFS_R_DFS_FLUSHFTTABLE *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_Add2(pipes_struct *p, NETDFS_Q_DFS_ADD2 *q_u, NETDFS_R_DFS_ADD2 *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_Remove2(pipes_struct *p, NETDFS_Q_DFS_REMOVE2 *q_u, NETDFS_R_DFS_REMOVE2 *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_EnumEx(pipes_struct *p, NETDFS_Q_DFS_ENUMEX *q_u, NETDFS_R_DFS_ENUMEX *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
WERROR _dfs_SetInfo2(pipes_struct *p, NETDFS_Q_DFS_SETINFO2 *q_u, NETDFS_R_DFS_SETINFO2 *r_u)
|
||||
{
|
||||
/* FIXME: Implement your code here */
|
||||
return WERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user