source3/rpc_server/dfs/srv_dfs_nt.c

   1 /*
   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-2007.
   6  *  Copyright (C) Jelmer Vernooij       2005-2006.
   7  *
   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 3 of the License, or
  11  *  (at your option) any later version.
  12  *
  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.
  17  *
  18  *  You should have received a copy of the GNU General Public License
  19  *  along with this program; if not, see <http://www.gnu.org/licenses/>.
  20  */
  21
  22 /* This is the implementation of the dfs pipe. */
  23
  24 #include "includes.h"
  25 #include "ntdomain.h"
  26 #include "../librpc/gen_ndr/srv_dfs.h"
  27 #include "msdfs.h"
  28 #include "smbd/smbd.h"
  29 #include "smbd/globals.h"
  30 #include "auth.h"
  31
  32 #undef DBGC_CLASS
  33 #define DBGC_CLASS DBGC_MSDFS
  34
  35 /* This function does not return a WERROR or NTSTATUS code but rather 1 if
  36    dfs exists, or 0 otherwise. */
  37
  38 void _dfs_GetManagerVersion(struct pipes_struct *p, struct dfs_GetManagerVersion *r)
  39 {
  40         if (lp_host_msdfs()) {
  41                 *r->out.version = DFS_MANAGER_VERSION_NT4;
  42         } else {
  43                 *r->out.version = (enum dfs_ManagerVersion)0;
  44         }
  45 }
  46
  47 WERROR _dfs_Add(struct pipes_struct *p, struct dfs_Add *r)
  48 {
  49         struct junction_map *jn = NULL;
  50         struct referral *old_referral_list = NULL;
  51         bool self_ref = False;
  52         int consumedcnt = 0;
  53         char *altpath = NULL;
  54         NTSTATUS status;
  55         TALLOC_CTX *ctx = talloc_tos();
  56
  57         if (p->session_info->unix_token->uid != sec_initial_uid()) {
  58                 DEBUG(10,("_dfs_add: uid != 0. Access denied.\n"));
  59                 return WERR_ACCESS_DENIED;
  60         }
  61
  62         jn = talloc_zero(ctx, struct junction_map);
  63         if (!jn) {
  64                 return WERR_NOMEM;
  65         }
  66
  67         DEBUG(5,("init_reply_dfs_add: Request to add %s -> %s\\%s.\n",
  68                 r->in.path, r->in.server, r->in.share));
  69
  70         altpath = talloc_asprintf(ctx, "%s\\%s",
  71                         r->in.server,
  72                         r->in.share);
  73         if (!altpath) {
  74                 return WERR_NOMEM;
  75         }
  76
  77         /* The following call can change the cwd. */
  78         status = get_referred_path(ctx, r->in.path, smbd_server_conn, jn,
  79                                    &consumedcnt, &self_ref);
  80         if(!NT_STATUS_IS_OK(status)) {
  81                 return ntstatus_to_werror(status);
  82         }
  83
  84         jn->referral_count += 1;
  85         old_referral_list = jn->referral_list;
  86
  87         if (jn->referral_count < 1) {
  88                 return WERR_NOMEM;
  89         }
  90
  91         jn->referral_list = talloc_array(ctx, struct referral, jn->referral_count);
  92         if(jn->referral_list == NULL) {
  93                 DEBUG(0,("init_reply_dfs_add: talloc failed for referral list!\n"));
  94                 return WERR_DFS_INTERNAL_ERROR;
  95         }
  96
  97         if(old_referral_list && jn->referral_list) {
  98                 memcpy(jn->referral_list, old_referral_list,
  99                                 sizeof(struct referral)*jn->referral_count-1);
 100         }
 101
 102         jn->referral_list[jn->referral_count-1].proximity = 0;
 103         jn->referral_list[jn->referral_count-1].ttl = REFERRAL_TTL;
 104         jn->referral_list[jn->referral_count-1].alternate_path = altpath;
 105
 106         if(!create_msdfs_link(jn)) {
 107                 return WERR_DFS_CANT_CREATE_JUNCT;
 108         }
 109
 110         return WERR_OK;
 111 }
 112
 113 WERROR _dfs_Remove(struct pipes_struct *p, struct dfs_Remove *r)
 114 {
 115         struct junction_map *jn = NULL;
 116         bool self_ref = False;
 117         int consumedcnt = 0;
 118         bool found = False;
 119         TALLOC_CTX *ctx = talloc_tos();
 120         char *altpath = NULL;
 121         NTSTATUS status;
 122
 123         if (p->session_info->unix_token->uid != sec_initial_uid()) {
 124                 DEBUG(10,("_dfs_remove: uid != 0. Access denied.\n"));
 125                 return WERR_ACCESS_DENIED;
 126         }
 127
 128         jn = talloc_zero(ctx, struct junction_map);
 129         if (!jn) {
 130                 return WERR_NOMEM;
 131         }
 132
 133         if (r->in.servername && r->in.sharename) {
 134                 altpath = talloc_asprintf(ctx, "%s\\%s",
 135                         r->in.servername,
 136                         r->in.sharename);
 137                 if (!altpath) {
 138                         return WERR_NOMEM;
 139                 }
 140                 strlower_m(altpath);
 141                 DEBUG(5,("init_reply_dfs_remove: Request to remove %s -> %s\\%s.\n",
 142                         r->in.dfs_entry_path, r->in.servername, r->in.sharename));
 143         }
 144
 145         status = get_referred_path(ctx, r->in.dfs_entry_path, smbd_server_conn,
 146                                    jn, &consumedcnt, &self_ref);
 147         if(!NT_STATUS_IS_OK(status)) {
 148                 return WERR_DFS_NO_SUCH_VOL;
 149         }
 150
 151         /* if no server-share pair given, remove the msdfs link completely */
 152         if(!r->in.servername && !r->in.sharename) {
 153                 if(!remove_msdfs_link(jn)) {
 154                         return WERR_DFS_NO_SUCH_VOL;
 155                 }
 156         } else {
 157                 int i=0;
 158                 /* compare each referral in the list with the one to remove */
 159                 DEBUG(10,("altpath: .%s. refcnt: %d\n", altpath, jn->referral_count));
 160                 for(i=0;i<jn->referral_count;i++) {
 161                         char *refpath = talloc_strdup(ctx,
 162                                         jn->referral_list[i].alternate_path);
 163                         if (!refpath) {
 164                                 return WERR_NOMEM;
 165                         }
 166                         trim_char(refpath, '\\', '\\');
 167                         DEBUG(10,("_dfs_remove:  refpath: .%s.\n", refpath));
 168                         if(strequal(refpath, altpath)) {
 169                                 *(jn->referral_list[i].alternate_path)='\0';
 170                                 DEBUG(10,("_dfs_remove: Removal request matches referral %s\n",
 171                                         refpath));
 172                                 found = True;
 173                         }
 174                 }
 175
 176                 if(!found) {
 177                         return WERR_DFS_NO_SUCH_SHARE;
 178                 }
 179
 180                 /* Only one referral, remove it */
 181                 if(jn->referral_count == 1) {
 182                         if(!remove_msdfs_link(jn)) {
 183                                 return WERR_DFS_NO_SUCH_VOL;
 184                         }
 185                 } else {
 186                         if(!create_msdfs_link(jn)) {
 187                                 return WERR_DFS_CANT_CREATE_JUNCT;
 188                         }
 189                 }
 190         }
 191
 192         return WERR_OK;
 193 }
 194
 195 static bool init_reply_dfs_info_1(TALLOC_CTX *mem_ctx, struct junction_map* j,struct dfs_Info1* dfs1)
 196 {
 197         dfs1->path = talloc_asprintf(mem_ctx,
 198                                 "\\\\%s\\%s\\%s", lp_netbios_name(),
 199                                 j->service_name, j->volume_name);
 200         if (dfs1->path == NULL)
 201                 return False;
 202
 203         DEBUG(5,("init_reply_dfs_info_1: initing entrypath: %s\n",dfs1->path));
 204         return True;
 205 }
 206
 207 static bool init_reply_dfs_info_2(TALLOC_CTX *mem_ctx, struct junction_map* j, struct dfs_Info2* dfs2)
 208 {
 209         dfs2->path = talloc_asprintf(mem_ctx,
 210                         "\\\\%s\\%s\\%s", lp_netbios_name(), j->service_name, j->volume_name);
 211         if (dfs2->path == NULL)
 212                 return False;
 213         dfs2->comment = talloc_strdup(mem_ctx, j->comment);
 214         dfs2->state = 1; /* set up state of dfs junction as OK */
 215         dfs2->num_stores = j->referral_count;
 216         return True;
 217 }
 218
 219 static bool init_reply_dfs_info_3(TALLOC_CTX *mem_ctx, struct junction_map* j, struct dfs_Info3* dfs3)
 220 {
 221         int ii;
 222         if (j->volume_name[0] == '\0')
 223                 dfs3->path = talloc_asprintf(mem_ctx, "\\\\%s\\%s",
 224                         lp_netbios_name(), j->service_name);
 225         else
 226                 dfs3->path = talloc_asprintf(mem_ctx, "\\\\%s\\%s\\%s", lp_netbios_name(),
 227                         j->service_name, j->volume_name);
 228
 229         if (dfs3->path == NULL)
 230                 return False;
 231
 232         dfs3->comment = talloc_strdup(mem_ctx, j->comment);
 233         dfs3->state = 1;
 234         dfs3->num_stores = j->referral_count;
 235
 236         /* also enumerate the stores */
 237         if (j->referral_count) {
 238                 dfs3->stores = talloc_array(mem_ctx, struct dfs_StorageInfo, j->referral_count);
 239                 if (!dfs3->stores)
 240                         return False;
 241                 memset(dfs3->stores, '\0', j->referral_count * sizeof(struct dfs_StorageInfo));
 242         } else {
 243                 dfs3->stores = NULL;
 244         }
 245
 246         for(ii=0;ii<j->referral_count;ii++) {
 247                 char* p;
 248                 char *path = NULL;
 249                 struct dfs_StorageInfo* stor = &(dfs3->stores[ii]);
 250                 struct referral* ref = &(j->referral_list[ii]);
 251
 252                 path = talloc_strdup(mem_ctx, ref->alternate_path);
 253                 if (!path) {
 254                         return False;
 255                 }
 256                 trim_char(path,'\\','\0');
 257                 p = strrchr_m(path,'\\');
 258                 if(p==NULL) {
 259                         DEBUG(4,("init_reply_dfs_info_3: invalid path: no \\ found in %s\n",path));
 260                         continue;
 261                 }
 262                 *p = '\0';
 263                 DEBUG(5,("storage %d: %s.%s\n",ii,path,p+1));
 264                 stor->state = 2; /* set all stores as ONLINE */
 265                 stor->server = talloc_strdup(mem_ctx, path);
 266                 stor->share = talloc_strdup(mem_ctx, p+1);
 267         }
 268         return True;
 269 }
 270
 271 static bool init_reply_dfs_info_100(TALLOC_CTX *mem_ctx, struct junction_map* j, struct dfs_Info100* dfs100)
 272 {
 273         dfs100->comment = talloc_strdup(mem_ctx, j->comment);
 274         return True;
 275 }
 276
 277 WERROR _dfs_Enum(struct pipes_struct *p, struct dfs_Enum *r)
 278 {
 279         struct junction_map *jn = NULL;
 280         size_t num_jn = 0;
 281         size_t i;
 282         TALLOC_CTX *ctx = talloc_tos();
 283
 284         jn = enum_msdfs_links(ctx, &num_jn);
 285         if (!jn || num_jn == 0) {
 286                 num_jn = 0;
 287                 jn = NULL;
 288         }
 289
 290         DEBUG(5,("_dfs_Enum: %u junctions found in Dfs, doing level %d\n",
 291                                 (unsigned int)num_jn, r->in.level));
 292
 293         *r->out.total = num_jn;
 294
 295         /* Create the return array */
 296         switch (r->in.level) {
 297         case 1:
 298                 if (num_jn) {
 299                         if ((r->out.info->e.info1->s = talloc_array(ctx, struct dfs_Info1, num_jn)) == NULL) {
 300                                 return WERR_NOMEM;
 301                         }
 302                 } else {
 303                         r->out.info->e.info1->s = NULL;
 304                 }
 305                 r->out.info->e.info1->count = num_jn;
 306                 break;
 307         case 2:
 308                 if (num_jn) {
 309                         if ((r->out.info->e.info2->s = talloc_array(ctx, struct dfs_Info2, num_jn)) == NULL) {
 310                                 return WERR_NOMEM;
 311                         }
 312                 } else {
 313                         r->out.info->e.info2->s = NULL;
 314                 }
 315                 r->out.info->e.info2->count = num_jn;
 316                 break;
 317         case 3:
 318                 if (num_jn) {
 319                         if ((r->out.info->e.info3->s = talloc_array(ctx, struct dfs_Info3, num_jn)) == NULL) {
 320                                 return WERR_NOMEM;
 321                         }
 322                 } else {
 323                         r->out.info->e.info3->s = NULL;
 324                 }
 325                 r->out.info->e.info3->count = num_jn;
 326                 break;
 327         default:
 328                 return WERR_INVALID_PARAM;
 329         }
 330
 331         for (i = 0; i < num_jn; i++) {
 332                 switch (r->in.level) {
 333                 case 1:
 334                         init_reply_dfs_info_1(ctx, &jn[i], &r->out.info->e.info1->s[i]);
 335                         break;
 336                 case 2:
 337                         init_reply_dfs_info_2(ctx, &jn[i], &r->out.info->e.info2->s[i]);
 338                         break;
 339                 case 3:
 340                         init_reply_dfs_info_3(ctx, &jn[i], &r->out.info->e.info3->s[i]);
 341                         break;
 342                 default:
 343                         return WERR_INVALID_PARAM;
 344                 }
 345         }
 346
 347         return WERR_OK;
 348 }
 349
 350 WERROR _dfs_GetInfo(struct pipes_struct *p, struct dfs_GetInfo *r)
 351 {
 352         int consumedcnt = strlen(r->in.dfs_entry_path);
 353         struct junction_map *jn = NULL;
 354         bool self_ref = False;
 355         TALLOC_CTX *ctx = talloc_tos();
 356         bool ret;
 357         NTSTATUS status;
 358
 359         jn = talloc_zero(ctx, struct junction_map);
 360         if (!jn) {
 361                 return WERR_NOMEM;
 362         }
 363
 364         if(!create_junction(ctx, r->in.dfs_entry_path,
 365                             !smbd_server_conn->using_smb2, jn)) {
 366                 return WERR_DFS_NO_SUCH_SERVER;
 367         }
 368
 369         /* The following call can change the cwd. */
 370         status = get_referred_path(ctx, r->in.dfs_entry_path, smbd_server_conn,
 371                                    jn, &consumedcnt, &self_ref);
 372         if(!NT_STATUS_IS_OK(status) ||
 373                         consumedcnt < strlen(r->in.dfs_entry_path)) {
 374                 return WERR_DFS_NO_SUCH_VOL;
 375         }
 376
 377         switch (r->in.level) {
 378                 case 1:
 379                         r->out.info->info1 = talloc_zero(ctx,struct dfs_Info1);
 380                         if (!r->out.info->info1) {
 381                                 return WERR_NOMEM;
 382                         }
 383                         ret = init_reply_dfs_info_1(ctx, jn, r->out.info->info1);
 384                         break;
 385                 case 2:
 386                         r->out.info->info2 = talloc_zero(ctx,struct dfs_Info2);
 387                         if (!r->out.info->info2) {
 388                                 return WERR_NOMEM;
 389                         }
 390                         ret = init_reply_dfs_info_2(ctx, jn, r->out.info->info2);
 391                         break;
 392                 case 3:
 393                         r->out.info->info3 = talloc_zero(ctx,struct dfs_Info3);
 394                         if (!r->out.info->info3) {
 395                                 return WERR_NOMEM;
 396                         }
 397                         ret = init_reply_dfs_info_3(ctx, jn, r->out.info->info3);
 398                         break;
 399                 case 100:
 400                         r->out.info->info100 = talloc_zero(ctx,struct dfs_Info100);
 401                         if (!r->out.info->info100) {
 402                                 return WERR_NOMEM;
 403                         }
 404                         ret = init_reply_dfs_info_100(ctx, jn, r->out.info->info100);
 405                         break;
 406                 default:
 407                         r->out.info->info1 = NULL;
 408                         return WERR_INVALID_PARAM;
 409         }
 410
 411         if (!ret)
 412                 return WERR_INVALID_PARAM;
 413
 414         return WERR_OK;
 415 }
 416
 417 WERROR _dfs_SetInfo(struct pipes_struct *p, struct dfs_SetInfo *r)
 418 {
 419         /* FIXME: Implement your code here */
 420         p->rng_fault_state = True;
 421         return WERR_NOT_SUPPORTED;
 422 }
 423
 424 WERROR _dfs_Rename(struct pipes_struct *p, struct dfs_Rename *r)
 425 {
 426         /* FIXME: Implement your code here */
 427         p->rng_fault_state = True;
 428         return WERR_NOT_SUPPORTED;
 429 }
 430
 431 WERROR _dfs_Move(struct pipes_struct *p, struct dfs_Move *r)
 432 {
 433         /* FIXME: Implement your code here */
 434         p->rng_fault_state = True;
 435         return WERR_NOT_SUPPORTED;
 436 }
 437
 438 WERROR _dfs_ManagerGetConfigInfo(struct pipes_struct *p, struct dfs_ManagerGetConfigInfo *r)
 439 {
 440         /* FIXME: Implement your code here */
 441         p->rng_fault_state = True;
 442         return WERR_NOT_SUPPORTED;
 443 }
 444
 445 WERROR _dfs_ManagerSendSiteInfo(struct pipes_struct *p, struct dfs_ManagerSendSiteInfo *r)
 446 {
 447         /* FIXME: Implement your code here */
 448         p->rng_fault_state = True;
 449         return WERR_NOT_SUPPORTED;
 450 }
 451
 452 WERROR _dfs_AddFtRoot(struct pipes_struct *p, struct dfs_AddFtRoot *r)
 453 {
 454         /* FIXME: Implement your code here */
 455         p->rng_fault_state = True;
 456         return WERR_NOT_SUPPORTED;
 457 }
 458
 459 WERROR _dfs_RemoveFtRoot(struct pipes_struct *p, struct dfs_RemoveFtRoot *r)
 460 {
 461         /* FIXME: Implement your code here */
 462         p->rng_fault_state = True;
 463         return WERR_NOT_SUPPORTED;
 464 }
 465
 466 WERROR _dfs_AddStdRoot(struct pipes_struct *p, struct dfs_AddStdRoot *r)
 467 {
 468         /* FIXME: Implement your code here */
 469         p->rng_fault_state = True;
 470         return WERR_NOT_SUPPORTED;
 471 }
 472
 473 WERROR _dfs_RemoveStdRoot(struct pipes_struct *p, struct dfs_RemoveStdRoot *r)
 474 {
 475         /* FIXME: Implement your code here */
 476         p->rng_fault_state = True;
 477         return WERR_NOT_SUPPORTED;
 478 }
 479
 480 WERROR _dfs_ManagerInitialize(struct pipes_struct *p, struct dfs_ManagerInitialize *r)
 481 {
 482         /* FIXME: Implement your code here */
 483         p->rng_fault_state = True;
 484         return WERR_NOT_SUPPORTED;
 485 }
 486
 487 WERROR _dfs_AddStdRootForced(struct pipes_struct *p, struct dfs_AddStdRootForced *r)
 488 {
 489         /* FIXME: Implement your code here */
 490         p->rng_fault_state = True;
 491         return WERR_NOT_SUPPORTED;
 492 }
 493
 494 WERROR _dfs_GetDcAddress(struct pipes_struct *p, struct dfs_GetDcAddress *r)
 495 {
 496         /* FIXME: Implement your code here */
 497         p->rng_fault_state = True;
 498         return WERR_NOT_SUPPORTED;
 499 }
 500
 501 WERROR _dfs_SetDcAddress(struct pipes_struct *p, struct dfs_SetDcAddress *r)
 502 {
 503         /* FIXME: Implement your code here */
 504         p->rng_fault_state = True;
 505         return WERR_NOT_SUPPORTED;
 506 }
 507
 508 WERROR _dfs_FlushFtTable(struct pipes_struct *p, struct dfs_FlushFtTable *r)
 509 {
 510         /* FIXME: Implement your code here */
 511         p->rng_fault_state = True;
 512         return WERR_NOT_SUPPORTED;
 513 }
 514
 515 WERROR _dfs_Add2(struct pipes_struct *p, struct dfs_Add2 *r)
 516 {
 517         /* FIXME: Implement your code here */
 518         p->rng_fault_state = True;
 519         return WERR_NOT_SUPPORTED;
 520 }
 521
 522 WERROR _dfs_Remove2(struct pipes_struct *p, struct dfs_Remove2 *r)
 523 {
 524         /* FIXME: Implement your code here */
 525         p->rng_fault_state = True;
 526         return WERR_NOT_SUPPORTED;
 527 }
 528
 529 WERROR _dfs_EnumEx(struct pipes_struct *p, struct dfs_EnumEx *r)
 530 {
 531         /* FIXME: Implement your code here */
 532         p->rng_fault_state = True;
 533         return WERR_NOT_SUPPORTED;
 534 }
 535
 536 WERROR _dfs_SetInfo2(struct pipes_struct *p, struct dfs_SetInfo2 *r)
 537 {
 538         /* FIXME: Implement your code here */
 539         p->rng_fault_state = True;
 540         return WERR_NOT_SUPPORTED;
 541 }