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