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.
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 uint32
_dfs_GetManagerVersion(pipes_struct
*p
, NETDFS_Q_DFS_GETMANAGERVERSION
*q_u
, NETDFS_R_DFS_GETMANAGERVERSION
*r_u
)
41 WERROR
_dfs_Add(pipes_struct
*p
, NETDFS_Q_DFS_ADD
* q_u
, NETDFS_R_DFS_ADD
*r_u
)
43 struct current_user user
;
44 struct junction_map jn
;
45 struct referral
* old_referral_list
= NULL
;
48 pstring dfspath
, servername
, sharename
;
51 get_current_user(&user
,p
);
53 if (user
.ut
.uid
!= 0) {
54 DEBUG(10,("_dfs_add: uid != 0. Access denied.\n"));
55 return WERR_ACCESS_DENIED
;
58 unistr2_to_ascii(dfspath
, &q_u
->path
, sizeof(dfspath
)-1);
59 unistr2_to_ascii(servername
, &q_u
->server
, sizeof(servername
)-1);
60 unistr2_to_ascii(sharename
, &q_u
->share
, sizeof(sharename
)-1);
62 DEBUG(5,("init_reply_dfs_add: Request to add %s -> %s\\%s.\n",
63 dfspath
, servername
, sharename
));
65 pstrcpy(altpath
, servername
);
66 pstrcat(altpath
, "\\");
67 pstrcat(altpath
, sharename
);
69 /* The following call can change the cwd. */
70 if(get_referred_path(p
->mem_ctx
, dfspath
, &jn
, NULL
, NULL
)) {
72 jn
.referral_count
+= 1;
73 old_referral_list
= jn
.referral_list
;
75 jn
.referral_count
= 1;
78 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
80 jn
.referral_list
= TALLOC_ARRAY(p
->mem_ctx
, struct referral
, jn
.referral_count
);
81 if(jn
.referral_list
== NULL
) {
82 DEBUG(0,("init_reply_dfs_add: talloc failed for referral list!\n"));
83 return WERR_DFS_INTERNAL_ERROR
;
86 if(old_referral_list
) {
87 memcpy(jn
.referral_list
, old_referral_list
, sizeof(struct referral
)*jn
.referral_count
-1);
90 jn
.referral_list
[jn
.referral_count
-1].proximity
= 0;
91 jn
.referral_list
[jn
.referral_count
-1].ttl
= REFERRAL_TTL
;
93 pstrcpy(jn
.referral_list
[jn
.referral_count
-1].alternate_path
, altpath
);
95 if(!create_msdfs_link(&jn
, exists
)) {
96 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
97 return WERR_DFS_CANT_CREATE_JUNCT
;
99 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
104 WERROR
_dfs_Remove(pipes_struct
*p
, NETDFS_Q_DFS_REMOVE
*q_u
,
105 NETDFS_R_DFS_REMOVE
*r_u
)
107 struct current_user user
;
108 struct junction_map jn
;
111 pstring dfspath
, servername
, sharename
;
114 get_current_user(&user
,p
);
116 if (user
.ut
.uid
!= 0) {
117 DEBUG(10,("_dfs_remove: uid != 0. Access denied.\n"));
118 return WERR_ACCESS_DENIED
;
121 unistr2_to_ascii(dfspath
, &q_u
->path
, sizeof(dfspath
)-1);
122 if(q_u
->ptr0_server
) {
123 unistr2_to_ascii(servername
, &q_u
->server
, sizeof(servername
)-1);
126 if(q_u
->ptr0_share
) {
127 unistr2_to_ascii(sharename
, &q_u
->share
, sizeof(sharename
)-1);
130 if(q_u
->ptr0_server
&& q_u
->ptr0_share
) {
131 pstrcpy(altpath
, servername
);
132 pstrcat(altpath
, "\\");
133 pstrcat(altpath
, sharename
);
137 DEBUG(5,("init_reply_dfs_remove: Request to remove %s -> %s\\%s.\n",
138 dfspath
, servername
, sharename
));
140 if(!get_referred_path(p
->mem_ctx
, dfspath
, &jn
, NULL
, NULL
)) {
141 return WERR_DFS_NO_SUCH_VOL
;
144 /* if no server-share pair given, remove the msdfs link completely */
145 if(!q_u
->ptr0_server
&& !q_u
->ptr0_share
) {
146 if(!remove_msdfs_link(&jn
)) {
147 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
148 return WERR_DFS_NO_SUCH_VOL
;
150 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
153 /* compare each referral in the list with the one to remove */
154 DEBUG(10,("altpath: .%s. refcnt: %d\n", altpath
, jn
.referral_count
));
155 for(i
=0;i
<jn
.referral_count
;i
++) {
157 pstrcpy(refpath
,jn
.referral_list
[i
].alternate_path
);
158 trim_char(refpath
, '\\', '\\');
159 DEBUG(10,("_dfs_remove: refpath: .%s.\n", refpath
));
160 if(strequal(refpath
, altpath
)) {
161 *(jn
.referral_list
[i
].alternate_path
)='\0';
162 DEBUG(10,("_dfs_remove: Removal request matches referral %s\n",
169 return WERR_DFS_NO_SUCH_SHARE
;
172 /* Only one referral, remove it */
173 if(jn
.referral_count
== 1) {
174 if(!remove_msdfs_link(&jn
)) {
175 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
176 return WERR_DFS_NO_SUCH_VOL
;
179 if(!create_msdfs_link(&jn
, True
)) {
180 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
181 return WERR_DFS_CANT_CREATE_JUNCT
;
184 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
190 static BOOL
init_reply_dfs_info_1(struct junction_map
* j
, NETDFS_DFS_INFO1
* dfs1
)
194 slprintf(str
, sizeof(pstring
)-1, "\\\\%s\\%s\\%s", global_myname(),
195 j
->service_name
, j
->volume_name
);
196 DEBUG(5,("init_reply_dfs_info_1: initing entrypath: %s\n",str
));
197 init_unistr2(&dfs1
->path
,str
,UNI_STR_TERMINATE
);
201 static BOOL
init_reply_dfs_info_2(struct junction_map
* j
, NETDFS_DFS_INFO2
* dfs2
)
205 slprintf(str
, sizeof(pstring
)-1, "\\\\%s\\%s\\%s", global_myname(),
206 j
->service_name
, j
->volume_name
);
207 init_unistr2(&dfs2
->path
, str
, UNI_STR_TERMINATE
);
208 dfs2
->ptr0_comment
= 0;
209 init_unistr2(&dfs2
->comment
, j
->comment
, UNI_STR_TERMINATE
);
210 dfs2
->state
= 1; /* set up state of dfs junction as OK */
211 dfs2
->num_stores
= j
->referral_count
;
215 static BOOL
init_reply_dfs_info_3(TALLOC_CTX
*ctx
, struct junction_map
* j
, NETDFS_DFS_INFO3
* dfs3
)
220 if (j
->volume_name
[0] == '\0')
221 slprintf(str
, sizeof(pstring
)-1, "\\\\%s\\%s",
222 global_myname(), j
->service_name
);
224 slprintf(str
, sizeof(pstring
)-1, "\\\\%s\\%s\\%s", global_myname(),
225 j
->service_name
, j
->volume_name
);
227 init_unistr2(&dfs3
->path
, str
, UNI_STR_TERMINATE
);
228 dfs3
->ptr0_comment
= 1;
229 init_unistr2(&dfs3
->comment
, j
->comment
, UNI_STR_TERMINATE
);
231 dfs3
->num_stores
= dfs3
->size_stores
= j
->referral_count
;
232 dfs3
->ptr0_stores
= 1;
234 /* also enumerate the stores */
235 dfs3
->stores
= TALLOC_ARRAY(ctx
, NETDFS_DFS_STORAGEINFO
, j
->referral_count
);
239 memset(dfs3
->stores
, '\0', j
->referral_count
* sizeof(NETDFS_DFS_STORAGEINFO
));
241 for(ii
=0;ii
<j
->referral_count
;ii
++) {
244 NETDFS_DFS_STORAGEINFO
* stor
= &(dfs3
->stores
[ii
]);
245 struct referral
* ref
= &(j
->referral_list
[ii
]);
247 pstrcpy(path
, ref
->alternate_path
);
248 trim_char(path
,'\\','\0');
249 p
= strrchr_m(path
,'\\');
251 DEBUG(4,("init_reply_dfs_info_3: invalid path: no \\ found in %s\n",path
));
255 DEBUG(5,("storage %d: %s.%s\n",ii
,path
,p
+1));
256 stor
->state
= 2; /* set all stores as ONLINE */
257 init_unistr2(&stor
->server
, path
, UNI_STR_TERMINATE
);
258 init_unistr2(&stor
->share
, p
+1, UNI_STR_TERMINATE
);
259 stor
->ptr0_server
= stor
->ptr0_share
= 1;
264 static BOOL
init_reply_dfs_info_100(struct junction_map
* j
, NETDFS_DFS_INFO100
* dfs100
)
266 dfs100
->ptr0_comment
= 1;
267 init_unistr2(&dfs100
->comment
, j
->comment
, UNI_STR_TERMINATE
);
272 WERROR
_dfs_Enum(pipes_struct
*p
, NETDFS_Q_DFS_ENUM
*q_u
, NETDFS_R_DFS_ENUM
*r_u
)
274 uint32 level
= q_u
->level
;
275 struct junction_map jn
[MAX_MSDFS_JUNCTIONS
];
279 num_jn
= enum_msdfs_links(p
->mem_ctx
, jn
, ARRAY_SIZE(jn
));
280 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
282 DEBUG(5,("_dfs_Enum: %d junctions found in Dfs, doing level %d\n", num_jn
, level
));
284 r_u
->ptr0_info
= q_u
->ptr0_info
;
285 r_u
->ptr0_total
= q_u
->ptr0_total
;
288 r_u
->info
= q_u
->info
;
290 /* Create the return array */
293 if ((r_u
->info
.e
.u
.info1
.s
= TALLOC_ARRAY(p
->mem_ctx
, NETDFS_DFS_INFO1
, num_jn
)) == NULL
) {
296 r_u
->info
.e
.u
.info1
.count
= num_jn
;
297 r_u
->info
.e
.u
.info1
.ptr0_s
= 1;
298 r_u
->info
.e
.u
.info1
.size_s
= num_jn
;
301 if ((r_u
->info
.e
.u
.info2
.s
= TALLOC_ARRAY(p
->mem_ctx
, NETDFS_DFS_INFO2
, num_jn
)) == NULL
) {
304 r_u
->info
.e
.u
.info2
.count
= num_jn
;
305 r_u
->info
.e
.u
.info2
.ptr0_s
= 1;
306 r_u
->info
.e
.u
.info2
.size_s
= num_jn
;
309 if ((r_u
->info
.e
.u
.info3
.s
= TALLOC_ARRAY(p
->mem_ctx
, NETDFS_DFS_INFO3
, num_jn
)) == NULL
) {
312 r_u
->info
.e
.u
.info3
.count
= num_jn
;
313 r_u
->info
.e
.u
.info3
.ptr0_s
= 1;
314 r_u
->info
.e
.u
.info3
.size_s
= num_jn
;
317 return WERR_INVALID_PARAM
;
320 for (i
= 0; i
< num_jn
; i
++) {
323 init_reply_dfs_info_1(&jn
[i
], &r_u
->info
.e
.u
.info1
.s
[i
]);
326 init_reply_dfs_info_2(&jn
[i
], &r_u
->info
.e
.u
.info2
.s
[i
]);
329 init_reply_dfs_info_3(p
->mem_ctx
, &jn
[i
], &r_u
->info
.e
.u
.info3
.s
[i
]);
332 return WERR_INVALID_PARAM
;
336 r_u
->status
= WERR_OK
;
341 WERROR
_dfs_GetInfo(pipes_struct
*p
, NETDFS_Q_DFS_GETINFO
*q_u
,
342 NETDFS_R_DFS_GETINFO
*r_u
)
344 UNISTR2
* uni_path
= &q_u
->path
;
345 uint32 level
= q_u
->level
;
346 int consumedcnt
= sizeof(pstring
);
349 struct junction_map jn
;
351 unistr2_to_ascii(path
, uni_path
, sizeof(path
)-1);
352 if(!create_junction(path
, &jn
))
353 return WERR_DFS_NO_SUCH_SERVER
;
355 /* The following call can change the cwd. */
356 if(!get_referred_path(p
->mem_ctx
, path
, &jn
, &consumedcnt
, NULL
) || consumedcnt
< strlen(path
)) {
357 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
358 return WERR_DFS_NO_SUCH_VOL
;
361 vfs_ChDir(p
->conn
,p
->conn
->connectpath
);
362 r_u
->info
.switch_value
= level
;
364 r_u
->status
= WERR_OK
;
367 case 1: ret
= init_reply_dfs_info_1(&jn
, &r_u
->info
.u
.info1
); break;
368 case 2: ret
= init_reply_dfs_info_2(&jn
, &r_u
->info
.u
.info2
); break;
369 case 3: ret
= init_reply_dfs_info_3(p
->mem_ctx
, &jn
, &r_u
->info
.u
.info3
); break;
370 case 100: ret
= init_reply_dfs_info_100(&jn
, &r_u
->info
.u
.info100
); break;
373 r_u
->info
.switch_value
= 0;
374 r_u
->status
= WERR_OK
;
380 r_u
->status
= WERR_INVALID_PARAM
;
385 WERROR
_dfs_SetInfo(pipes_struct
*p
, NETDFS_Q_DFS_SETINFO
*q_u
, NETDFS_R_DFS_SETINFO
*r_u
)
387 /* FIXME: Implement your code here */
388 return WERR_NOT_SUPPORTED
;
391 WERROR
_dfs_Rename(pipes_struct
*p
, NETDFS_Q_DFS_RENAME
*q_u
, NETDFS_R_DFS_RENAME
*r_u
)
393 /* FIXME: Implement your code here */
394 return WERR_NOT_SUPPORTED
;
397 WERROR
_dfs_Move(pipes_struct
*p
, NETDFS_Q_DFS_MOVE
*q_u
, NETDFS_R_DFS_MOVE
*r_u
)
399 /* FIXME: Implement your code here */
400 return WERR_NOT_SUPPORTED
;
403 WERROR
_dfs_ManagerGetConfigInfo(pipes_struct
*p
, NETDFS_Q_DFS_MANAGERGETCONFIGINFO
*q_u
, NETDFS_R_DFS_MANAGERGETCONFIGINFO
*r_u
)
405 /* FIXME: Implement your code here */
406 return WERR_NOT_SUPPORTED
;
409 WERROR
_dfs_ManagerSendSiteInfo(pipes_struct
*p
, NETDFS_Q_DFS_MANAGERSENDSITEINFO
*q_u
, NETDFS_R_DFS_MANAGERSENDSITEINFO
*r_u
)
411 /* FIXME: Implement your code here */
412 return WERR_NOT_SUPPORTED
;
415 WERROR
_dfs_AddFtRoot(pipes_struct
*p
, NETDFS_Q_DFS_ADDFTROOT
*q_u
, NETDFS_R_DFS_ADDFTROOT
*r_u
)
417 /* FIXME: Implement your code here */
418 return WERR_NOT_SUPPORTED
;
421 WERROR
_dfs_RemoveFtRoot(pipes_struct
*p
, NETDFS_Q_DFS_REMOVEFTROOT
*q_u
, NETDFS_R_DFS_REMOVEFTROOT
*r_u
)
423 /* FIXME: Implement your code here */
424 return WERR_NOT_SUPPORTED
;
427 WERROR
_dfs_AddStdRoot(pipes_struct
*p
, NETDFS_Q_DFS_ADDSTDROOT
*q_u
, NETDFS_R_DFS_ADDSTDROOT
*r_u
)
429 /* FIXME: Implement your code here */
430 return WERR_NOT_SUPPORTED
;
433 WERROR
_dfs_RemoveStdRoot(pipes_struct
*p
, NETDFS_Q_DFS_REMOVESTDROOT
*q_u
, NETDFS_R_DFS_REMOVESTDROOT
*r_u
)
435 /* FIXME: Implement your code here */
436 return WERR_NOT_SUPPORTED
;
439 WERROR
_dfs_ManagerInitialize(pipes_struct
*p
, NETDFS_Q_DFS_MANAGERINITIALIZE
*q_u
, NETDFS_R_DFS_MANAGERINITIALIZE
*r_u
)
441 /* FIXME: Implement your code here */
442 return WERR_NOT_SUPPORTED
;
445 WERROR
_dfs_AddStdRootForced(pipes_struct
*p
, NETDFS_Q_DFS_ADDSTDROOTFORCED
*q_u
, NETDFS_R_DFS_ADDSTDROOTFORCED
*r_u
)
447 /* FIXME: Implement your code here */
448 return WERR_NOT_SUPPORTED
;
451 WERROR
_dfs_GetDcAddress(pipes_struct
*p
, NETDFS_Q_DFS_GETDCADDRESS
*q_u
, NETDFS_R_DFS_GETDCADDRESS
*r_u
)
453 /* FIXME: Implement your code here */
454 return WERR_NOT_SUPPORTED
;
457 WERROR
_dfs_SetDcAddress(pipes_struct
*p
, NETDFS_Q_DFS_SETDCADDRESS
*q_u
, NETDFS_R_DFS_SETDCADDRESS
*r_u
)
459 /* FIXME: Implement your code here */
460 return WERR_NOT_SUPPORTED
;
463 WERROR
_dfs_FlushFtTable(pipes_struct
*p
, NETDFS_Q_DFS_FLUSHFTTABLE
*q_u
, NETDFS_R_DFS_FLUSHFTTABLE
*r_u
)
465 /* FIXME: Implement your code here */
466 return WERR_NOT_SUPPORTED
;
469 WERROR
_dfs_Add2(pipes_struct
*p
, NETDFS_Q_DFS_ADD2
*q_u
, NETDFS_R_DFS_ADD2
*r_u
)
471 /* FIXME: Implement your code here */
472 return WERR_NOT_SUPPORTED
;
475 WERROR
_dfs_Remove2(pipes_struct
*p
, NETDFS_Q_DFS_REMOVE2
*q_u
, NETDFS_R_DFS_REMOVE2
*r_u
)
477 /* FIXME: Implement your code here */
478 return WERR_NOT_SUPPORTED
;
481 WERROR
_dfs_EnumEx(pipes_struct
*p
, NETDFS_Q_DFS_ENUMEX
*q_u
, NETDFS_R_DFS_ENUMEX
*r_u
)
483 /* FIXME: Implement your code here */
484 return WERR_NOT_SUPPORTED
;
487 WERROR
_dfs_SetInfo2(pipes_struct
*p
, NETDFS_Q_DFS_SETINFO2
*q_u
, NETDFS_R_DFS_SETINFO2
*r_u
)
489 /* FIXME: Implement your code here */
490 return WERR_NOT_SUPPORTED
;