2 * Unix SMB/CIFS implementation.
3 * RPC Pipe client / server routines for Dfs
4 * Copyright (C) Shirish Kalele 2000.
5 * Copyright (C) Jeremy Allison 2001.
6 * Copyright (C) Jelmer Vernooij 2005-2006.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
23 /* This is the implementation of the dfs pipe. */
28 #define DBGC_CLASS DBGC_MSDFS
30 /* This function does not return a WERROR or NTSTATUS code but rather 1 if
31 dfs exists, or 0 otherwise. */
33 void _dfs_GetManagerVersion(pipes_struct *p, struct dfs_GetManagerVersion *r)
36 *r->out.exist_flag = 1;
38 *r->out.exist_flag = 0;
41 WERROR _dfs_Add(pipes_struct *p, struct dfs_Add *r)
43 struct junction_map jn;
44 struct referral* old_referral_list = NULL;
49 if (p->pipe_user.ut.uid != 0) {
50 DEBUG(10,("_dfs_add: uid != 0. Access denied.\n"));
51 return WERR_ACCESS_DENIED;
54 DEBUG(5,("init_reply_dfs_add: Request to add %s -> %s\\%s.\n",
55 r->in.path, r->in.server, r->in.share));
57 pstrcpy(altpath, r->in.server);
58 pstrcat(altpath, "\\");
59 pstrcat(altpath, r->in.share);
61 /* The following call can change the cwd. */
62 if(get_referred_path(p->mem_ctx, r->in.path, &jn, NULL, NULL)) {
64 jn.referral_count += 1;
65 old_referral_list = jn.referral_list;
67 jn.referral_count = 1;
70 vfs_ChDir(p->conn,p->conn->connectpath);
72 jn.referral_list = TALLOC_ARRAY(p->mem_ctx, struct referral, jn.referral_count);
73 if(jn.referral_list == NULL) {
74 DEBUG(0,("init_reply_dfs_add: talloc failed for referral list!\n"));
75 return WERR_DFS_INTERNAL_ERROR;
78 if(old_referral_list) {
79 memcpy(jn.referral_list, old_referral_list, sizeof(struct referral)*jn.referral_count-1);
82 jn.referral_list[jn.referral_count-1].proximity = 0;
83 jn.referral_list[jn.referral_count-1].ttl = REFERRAL_TTL;
85 pstrcpy(jn.referral_list[jn.referral_count-1].alternate_path, altpath);
87 if(!create_msdfs_link(&jn, exists)) {
88 vfs_ChDir(p->conn,p->conn->connectpath);
89 return WERR_DFS_CANT_CREATE_JUNCT;
91 vfs_ChDir(p->conn,p->conn->connectpath);
96 WERROR _dfs_Remove(pipes_struct *p, struct dfs_Remove *r)
98 struct junction_map jn;
103 if (p->pipe_user.ut.uid != 0) {
104 DEBUG(10,("_dfs_remove: uid != 0. Access denied.\n"));
105 return WERR_ACCESS_DENIED;
108 if (r->in.server && r->in.share) {
109 pstrcpy(altpath, r->in.server);
110 pstrcat(altpath, "\\");
111 pstrcat(altpath, r->in.share);
115 DEBUG(5,("init_reply_dfs_remove: Request to remove %s -> %s\\%s.\n",
116 r->in.path, r->in.server, r->in.share));
118 if(!get_referred_path(p->mem_ctx, r->in.path, &jn, NULL, NULL)) {
119 return WERR_DFS_NO_SUCH_VOL;
122 /* if no server-share pair given, remove the msdfs link completely */
123 if(!r->in.server && !r->in.share) {
124 if(!remove_msdfs_link(&jn)) {
125 vfs_ChDir(p->conn,p->conn->connectpath);
126 return WERR_DFS_NO_SUCH_VOL;
128 vfs_ChDir(p->conn,p->conn->connectpath);
131 /* compare each referral in the list with the one to remove */
132 DEBUG(10,("altpath: .%s. refcnt: %d\n", altpath, jn.referral_count));
133 for(i=0;i<jn.referral_count;i++) {
135 pstrcpy(refpath,jn.referral_list[i].alternate_path);
136 trim_char(refpath, '\\', '\\');
137 DEBUG(10,("_dfs_remove: refpath: .%s.\n", refpath));
138 if(strequal(refpath, altpath)) {
139 *(jn.referral_list[i].alternate_path)='\0';
140 DEBUG(10,("_dfs_remove: Removal request matches referral %s\n",
147 return WERR_DFS_NO_SUCH_SHARE;
150 /* Only one referral, remove it */
151 if(jn.referral_count == 1) {
152 if(!remove_msdfs_link(&jn)) {
153 vfs_ChDir(p->conn,p->conn->connectpath);
154 return WERR_DFS_NO_SUCH_VOL;
157 if(!create_msdfs_link(&jn, True)) {
158 vfs_ChDir(p->conn,p->conn->connectpath);
159 return WERR_DFS_CANT_CREATE_JUNCT;
162 vfs_ChDir(p->conn,p->conn->connectpath);
168 static BOOL init_reply_dfs_info_1(TALLOC_CTX *mem_ctx, struct junction_map* j, struct dfs_Info1* dfs1)
170 dfs1->path = talloc_asprintf(mem_ctx,
171 "\\\\%s\\%s\\%s", global_myname(),
172 j->service_name, j->volume_name);
173 if (dfs1->path == NULL)
176 DEBUG(5,("init_reply_dfs_info_1: initing entrypath: %s\n",dfs1->path));
180 static BOOL init_reply_dfs_info_2(TALLOC_CTX *mem_ctx, struct junction_map* j, struct dfs_Info2* dfs2)
182 dfs2->path = talloc_asprintf(mem_ctx,
183 "\\\\%s\\%s\\%s", global_myname(), j->service_name, j->volume_name);
184 if (dfs2->path == NULL)
186 dfs2->comment = talloc_strdup(mem_ctx, j->comment);
187 dfs2->state = 1; /* set up state of dfs junction as OK */
188 dfs2->num_stores = j->referral_count;
192 static BOOL init_reply_dfs_info_3(TALLOC_CTX *mem_ctx, struct junction_map* j, struct dfs_Info3* dfs3)
195 if (j->volume_name[0] == '\0')
196 dfs3->path = talloc_asprintf(mem_ctx, "\\\\%s\\%s",
197 global_myname(), j->service_name);
199 dfs3->path = talloc_asprintf(mem_ctx, "\\\\%s\\%s\\%s", global_myname(),
200 j->service_name, j->volume_name);
202 if (dfs3->path == NULL)
205 dfs3->comment = talloc_strdup(mem_ctx, j->comment);
207 dfs3->num_stores = j->referral_count;
209 /* also enumerate the stores */
210 dfs3->stores = TALLOC_ARRAY(mem_ctx, struct dfs_StorageInfo, j->referral_count);
214 memset(dfs3->stores, '\0', j->referral_count * sizeof(struct dfs_StorageInfo));
216 for(ii=0;ii<j->referral_count;ii++) {
219 struct dfs_StorageInfo* stor = &(dfs3->stores[ii]);
220 struct referral* ref = &(j->referral_list[ii]);
222 pstrcpy(path, ref->alternate_path);
223 trim_char(path,'\\','\0');
224 p = strrchr_m(path,'\\');
226 DEBUG(4,("init_reply_dfs_info_3: invalid path: no \\ found in %s\n",path));
230 DEBUG(5,("storage %d: %s.%s\n",ii,path,p+1));
231 stor->state = 2; /* set all stores as ONLINE */
232 stor->server = talloc_strdup(mem_ctx, path);
233 stor->share = talloc_strdup(mem_ctx, p+1);
238 static BOOL init_reply_dfs_info_100(TALLOC_CTX *mem_ctx, struct junction_map* j, struct dfs_Info100* dfs100)
240 dfs100->comment = talloc_strdup(mem_ctx, j->comment);
245 WERROR _dfs_Enum(pipes_struct *p, struct dfs_Enum *r)
247 struct junction_map jn[MAX_MSDFS_JUNCTIONS];
251 num_jn = enum_msdfs_links(p->mem_ctx, jn, ARRAY_SIZE(jn));
252 vfs_ChDir(p->conn,p->conn->connectpath);
254 DEBUG(5,("_dfs_Enum: %d junctions found in Dfs, doing level %d\n", num_jn, r->in.level));
256 *r->out.total = num_jn;
258 /* Create the return array */
259 switch (r->in.level) {
261 if ((r->out.info->e.info1->s = TALLOC_ARRAY(p->mem_ctx, struct dfs_Info1, num_jn)) == NULL) {
264 r->out.info->e.info1->count = num_jn;
267 if ((r->out.info->e.info2->s = TALLOC_ARRAY(p->mem_ctx, struct dfs_Info2, num_jn)) == NULL) {
270 r->out.info->e.info2->count = num_jn;
273 if ((r->out.info->e.info3->s = TALLOC_ARRAY(p->mem_ctx, struct dfs_Info3, num_jn)) == NULL) {
276 r->out.info->e.info3->count = num_jn;
279 return WERR_INVALID_PARAM;
282 for (i = 0; i < num_jn; i++) {
283 switch (r->in.level) {
285 init_reply_dfs_info_1(p->mem_ctx, &jn[i], &r->out.info->e.info1->s[i]);
288 init_reply_dfs_info_2(p->mem_ctx, &jn[i], &r->out.info->e.info2->s[i]);
291 init_reply_dfs_info_3(p->mem_ctx, &jn[i], &r->out.info->e.info3->s[i]);
294 return WERR_INVALID_PARAM;
301 WERROR _dfs_GetInfo(pipes_struct *p, struct dfs_GetInfo *r)
303 int consumedcnt = sizeof(pstring);
304 struct junction_map jn;
307 if(!create_junction(r->in.path, &jn))
308 return WERR_DFS_NO_SUCH_SERVER;
310 /* The following call can change the cwd. */
311 if(!get_referred_path(p->mem_ctx, r->in.path, &jn, &consumedcnt, NULL) || consumedcnt < strlen(r->in.path)) {
312 vfs_ChDir(p->conn,p->conn->connectpath);
313 return WERR_DFS_NO_SUCH_VOL;
316 vfs_ChDir(p->conn,p->conn->connectpath);
318 switch (r->in.level) {
319 case 1: ret = init_reply_dfs_info_1(p->mem_ctx, &jn, r->out.info->info1); break;
320 case 2: ret = init_reply_dfs_info_2(p->mem_ctx, &jn, r->out.info->info2); break;
321 case 3: ret = init_reply_dfs_info_3(p->mem_ctx, &jn, r->out.info->info3); break;
322 case 100: ret = init_reply_dfs_info_100(p->mem_ctx, &jn, r->out.info->info100); break;
324 r->out.info->info1 = NULL;
325 return WERR_INVALID_PARAM;
329 return WERR_INVALID_PARAM;
334 WERROR _dfs_SetInfo(pipes_struct *p, struct dfs_SetInfo *r)
336 /* FIXME: Implement your code here */
337 p->rng_fault_state = True;
338 return WERR_NOT_SUPPORTED;
341 WERROR _dfs_Rename(pipes_struct *p, struct dfs_Rename *r)
343 /* FIXME: Implement your code here */
344 p->rng_fault_state = True;
345 return WERR_NOT_SUPPORTED;
348 WERROR _dfs_Move(pipes_struct *p, struct dfs_Move *r)
350 /* FIXME: Implement your code here */
351 p->rng_fault_state = True;
352 return WERR_NOT_SUPPORTED;
355 WERROR _dfs_ManagerGetConfigInfo(pipes_struct *p, struct dfs_ManagerGetConfigInfo *r)
357 /* FIXME: Implement your code here */
358 p->rng_fault_state = True;
359 return WERR_NOT_SUPPORTED;
362 WERROR _dfs_ManagerSendSiteInfo(pipes_struct *p, struct dfs_ManagerSendSiteInfo *r)
364 /* FIXME: Implement your code here */
365 p->rng_fault_state = True;
366 return WERR_NOT_SUPPORTED;
369 WERROR _dfs_AddFtRoot(pipes_struct *p, struct dfs_AddFtRoot *r)
371 /* FIXME: Implement your code here */
372 p->rng_fault_state = True;
373 return WERR_NOT_SUPPORTED;
376 WERROR _dfs_RemoveFtRoot(pipes_struct *p, struct dfs_RemoveFtRoot *r)
378 /* FIXME: Implement your code here */
379 p->rng_fault_state = True;
380 return WERR_NOT_SUPPORTED;
383 WERROR _dfs_AddStdRoot(pipes_struct *p, struct dfs_AddStdRoot *r)
385 /* FIXME: Implement your code here */
386 p->rng_fault_state = True;
387 return WERR_NOT_SUPPORTED;
390 WERROR _dfs_RemoveStdRoot(pipes_struct *p, struct dfs_RemoveStdRoot *r)
392 /* FIXME: Implement your code here */
393 p->rng_fault_state = True;
394 return WERR_NOT_SUPPORTED;
397 WERROR _dfs_ManagerInitialize(pipes_struct *p, struct dfs_ManagerInitialize *r)
399 /* FIXME: Implement your code here */
400 p->rng_fault_state = True;
401 return WERR_NOT_SUPPORTED;
404 WERROR _dfs_AddStdRootForced(pipes_struct *p, struct dfs_AddStdRootForced *r)
406 /* FIXME: Implement your code here */
407 p->rng_fault_state = True;
408 return WERR_NOT_SUPPORTED;
411 WERROR _dfs_GetDcAddress(pipes_struct *p, struct dfs_GetDcAddress *r)
413 /* FIXME: Implement your code here */
414 p->rng_fault_state = True;
415 return WERR_NOT_SUPPORTED;
418 WERROR _dfs_SetDcAddress(pipes_struct *p, struct dfs_SetDcAddress *r)
420 /* FIXME: Implement your code here */
421 p->rng_fault_state = True;
422 return WERR_NOT_SUPPORTED;
425 WERROR _dfs_FlushFtTable(pipes_struct *p, struct dfs_FlushFtTable *r)
427 /* FIXME: Implement your code here */
428 p->rng_fault_state = True;
429 return WERR_NOT_SUPPORTED;
432 WERROR _dfs_Add2(pipes_struct *p, struct dfs_Add2 *r)
434 /* FIXME: Implement your code here */
435 p->rng_fault_state = True;
436 return WERR_NOT_SUPPORTED;
439 WERROR _dfs_Remove2(pipes_struct *p, struct dfs_Remove2 *r)
441 /* FIXME: Implement your code here */
442 p->rng_fault_state = True;
443 return WERR_NOT_SUPPORTED;
446 WERROR _dfs_EnumEx(pipes_struct *p, struct dfs_EnumEx *r)
448 /* FIXME: Implement your code here */
449 p->rng_fault_state = True;
450 return WERR_NOT_SUPPORTED;
453 WERROR _dfs_SetInfo2(pipes_struct *p, struct dfs_SetInfo2 *r)
455 /* FIXME: Implement your code here */
456 p->rng_fault_state = True;
457 return WERR_NOT_SUPPORTED;