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