source/rpc_server/srv_dfs_nt.c

   1 /*
   2  *  Unix SMB/Netbios implementation.
   3  *  Version 1.9.
   4  *  RPC Pipe client / server routines for Dfs
   5  *  Copyright (C) Andrew Tridgell              1992-1997,
   6  *  Copyright (C) Luke Kenneth Casson Leighton 1996-1997,
   7  *  Copyright (C) Shirish Kalele               2000.
   8  *  Copyright (C) Jeremy Allison                                2001.
   9  *
  10  *  This program is free software; you can redistribute it and/or modify
  11  *  it under the terms of the GNU General Public License as published by
  12  *  the Free Software Foundation; either version 2 of the License, or
  13  *  (at your option) any later version.
  14  *
  15  *  This program is distributed in the hope that it will be useful,
  16  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  17  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  18  *  GNU General Public License for more details.
  19  *
  20  *  You should have received a copy of the GNU General Public License
  21  *  along with this program; if not, write to the Free Software
  22  *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  23  */
  24
  25 /* This is the implementation of the dfs pipe. */
  26
  27 #include "includes.h"
  28 #include "nterr.h"
  29
  30 extern pstring global_myname;
  31
  32 #define MAX_MSDFS_JUNCTIONS 256
  33 #ifdef WITH_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 uint32 _dfs_exist(pipes_struct *p, DFS_Q_DFS_EXIST *q_u, DFS_R_DFS_EXIST *r_u)
  39 {
  40         if(lp_host_msdfs())
  41                 return 1;
  42         else
  43                 return 0;
  44 }
  45
  46 WERROR _dfs_add(pipes_struct *p, DFS_Q_DFS_ADD* q_u, DFS_R_DFS_ADD *r_u)
  47 {
  48   struct current_user user;
  49   struct junction_map jn;
  50   struct referral* old_referral_list = NULL;
  51   BOOL exists = False;
  52
  53   pstring dfspath, servername, sharename;
  54   pstring altpath;
  55
  56   get_current_user(&user,p);
  57
  58   if (user.uid != 0) {
  59         DEBUG(10,("_dfs_add: uid != 0. Access denied.\n"));
  60         return WERR_ACCESS_DENIED;
  61   }
  62
  63   unistr2_to_ascii(dfspath, &q_u->DfsEntryPath, sizeof(dfspath)-1);
  64   unistr2_to_ascii(servername, &q_u->ServerName, sizeof(servername)-1);
  65   unistr2_to_ascii(sharename, &q_u->ShareName, sizeof(sharename)-1);
  66
  67   DEBUG(5,("init_reply_dfs_add: Request to add %s -> %s\\%s.\n",
  68            dfspath, servername, sharename));
  69
  70   pstrcpy(altpath, servername);
  71   pstrcat(altpath, "\\");
  72   pstrcat(altpath, sharename);
  73
  74   if(get_referred_path(dfspath, &jn, NULL, NULL))
  75     {
  76       exists = True;
  77       jn.referral_count += 1;
  78       old_referral_list = jn.referral_list;
  79     }
  80   else
  81     jn.referral_count = 1;
  82
  83   jn.referral_list = (struct referral*) talloc(p->mem_ctx, jn.referral_count
  84                                                * sizeof(struct referral));
  85
  86   if(jn.referral_list == NULL)
  87     {
  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)
  93     {
  94       memcpy(jn.referral_list, old_referral_list,
  95              sizeof(struct referral)*jn.referral_count-1);
  96       SAFE_FREE(old_referral_list);
  97     }
  98
  99   jn.referral_list[jn.referral_count-1].proximity = 0;
 100   jn.referral_list[jn.referral_count-1].ttl = REFERRAL_TTL;
 101
 102   pstrcpy(jn.referral_list[jn.referral_count-1].alternate_path, altpath);
 103
 104   if(!create_msdfs_link(&jn, exists))
 105     return WERR_DFS_CANT_CREATE_JUNCT;
 106
 107   return WERR_OK;
 108 }
 109
 110 WERROR _dfs_remove(pipes_struct *p, DFS_Q_DFS_REMOVE *q_u,
 111                    DFS_R_DFS_REMOVE *r_u)
 112 {
 113   struct current_user user;
 114   struct junction_map jn;
 115   BOOL found = False;
 116
 117   pstring dfspath, servername, sharename;
 118   pstring altpath;
 119
 120   get_current_user(&user,p);
 121
 122   if (user.uid != 0) {
 123         DEBUG(10,("_dfs_remove: uid != 0. Access denied.\n"));
 124         return WERR_ACCESS_DENIED;
 125   }
 126
 127   unistr2_to_ascii(dfspath, &q_u->DfsEntryPath, sizeof(dfspath)-1);
 128   if(q_u->ptr_ServerName)
 129     unistr2_to_ascii(servername, &q_u->ServerName, sizeof(servername)-1);
 130
 131   if(q_u->ptr_ShareName)
 132     unistr2_to_ascii(sharename, &q_u->ShareName, sizeof(sharename)-1);
 133
 134   if(q_u->ptr_ServerName && q_u->ptr_ShareName)
 135     {
 136       pstrcpy(altpath, servername);
 137       pstrcat(altpath, "\\");
 138       pstrcat(altpath, sharename);
 139       strlower(altpath);
 140     }
 141
 142   DEBUG(5,("init_reply_dfs_remove: Request to remove %s -> %s\\%s.\n",
 143            dfspath, servername, sharename));
 144
 145   if(!get_referred_path(dfspath, &jn, NULL, NULL))
 146           return WERR_DFS_NO_SUCH_VOL;
 147
 148   /* if no server-share pair given, remove the msdfs link completely */
 149   if(!q_u->ptr_ServerName && !q_u->ptr_ShareName)
 150     {
 151       if(!remove_msdfs_link(&jn))
 152         return WERR_DFS_NO_SUCH_VOL;
 153     }
 154   else
 155     {
 156       int i=0;
 157       /* compare each referral in the list with the one to remove */
 158       DEBUG(10,("altpath: .%s. refcnt: %d\n", altpath, jn.referral_count));
 159       for(i=0;i<jn.referral_count;i++)
 160         {
 161           pstring refpath;
 162           pstrcpy(refpath,jn.referral_list[i].alternate_path);
 163           trim_string(refpath, "\\", "\\");
 164           DEBUG(10,("_dfs_remove:  refpath: .%s.\n", refpath));
 165           if(strequal(refpath, altpath))
 166             {
 167               *(jn.referral_list[i].alternate_path)='\0';
 168               DEBUG(10,("_dfs_remove: Removal request matches referral %s\n",
 169                         refpath));
 170               found = True;
 171             }
 172         }
 173       if(!found)
 174         return WERR_DFS_NO_SUCH_SHARE;
 175
 176       /* Only one referral, remove it */
 177       if(jn.referral_count == 1)
 178         {
 179           if(!remove_msdfs_link(&jn))
 180             return WERR_DFS_NO_SUCH_VOL;
 181         }
 182       else
 183         {
 184           if(!create_msdfs_link(&jn, True))
 185             return WERR_DFS_CANT_CREATE_JUNCT;
 186         }
 187     }
 188
 189   return WERR_OK;
 190 }
 191
 192 static BOOL init_reply_dfs_info_1(struct junction_map* j, DFS_INFO_1* dfs1, int num_j)
 193 {
 194   int i=0;
 195   for(i=0;i<num_j;i++)
 196     {
 197       pstring str;
 198       dfs1[i].ptr_entrypath = 1;
 199       slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname,
 200                j[i].service_name, j[i].volume_name);
 201       DEBUG(5,("init_reply_dfs_info_1: %d) initing entrypath: %s\n",i,str));
 202       init_unistr2(&dfs1[i].entrypath,str,strlen(str)+1);
 203     }
 204   return True;
 205 }
 206
 207 static BOOL init_reply_dfs_info_2(struct junction_map* j, DFS_INFO_2* dfs2, int num_j)
 208 {
 209   int i=0;
 210   for(i=0;i<num_j;i++)
 211     {
 212       pstring str;
 213       dfs2[i].ptr_entrypath = 1;
 214       slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname,
 215                j[i].service_name, j[i].volume_name);
 216       init_unistr2(&dfs2[i].entrypath, str, strlen(str)+1);
 217       dfs2[i].ptr_comment = 0;
 218       dfs2[i].state = 1; /* set up state of dfs junction as OK */
 219       dfs2[i].num_storages = j[i].referral_count;
 220     }
 221   return True;
 222 }
 223
 224 static BOOL init_reply_dfs_info_3(TALLOC_CTX *ctx, struct junction_map* j, DFS_INFO_3* dfs3, int num_j)
 225 {
 226   int i=0,ii=0;
 227   for(i=0;i<num_j;i++)
 228     {
 229       pstring str;
 230       dfs3[i].ptr_entrypath = 1;
 231       if (j[i].volume_name[0] == '\0')
 232               slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s",
 233                        global_myname, j[i].service_name);
 234       else
 235               slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname,
 236                        j[i].service_name, j[i].volume_name);
 237
 238       init_unistr2(&dfs3[i].entrypath, str, strlen(str)+1);
 239       dfs3[i].ptr_comment = 1;
 240       init_unistr2(&dfs3[i].comment, "", 1);
 241       dfs3[i].state = 1;
 242       dfs3[i].num_storages = dfs3[i].num_storage_infos = j[i].referral_count;
 243       dfs3[i].ptr_storages = 1;
 244
 245       /* also enumerate the storages */
 246       dfs3[i].storages = (DFS_STORAGE_INFO*) talloc(ctx, j[i].referral_count *
 247                                                     sizeof(DFS_STORAGE_INFO));
 248       if (!dfs3[i].storages)
 249         return False;
 250
 251       memset(dfs3[i].storages, '\0', j[i].referral_count * sizeof(DFS_STORAGE_INFO));
 252
 253       for(ii=0;ii<j[i].referral_count;ii++)
 254         {
 255           char* p;
 256           pstring path;
 257           DFS_STORAGE_INFO* stor = &(dfs3[i].storages[ii]);
 258           struct referral* ref = &(j[i].referral_list[ii]);
 259
 260           pstrcpy(path, ref->alternate_path);
 261           trim_string(path,"\\","");
 262           p = strrchr(path,'\\');
 263           if(p==NULL)
 264             {
 265               DEBUG(4,("init_reply_dfs_info_3: invalid path: no \\ found in %s\n",path));
 266               continue;
 267             }
 268           *p = '\0';
 269           DEBUG(5,("storage %d: %s.%s\n",ii,path,p+1));
 270           stor->state = 2; /* set all storages as ONLINE */
 271           init_unistr2(&stor->servername, path, strlen(path)+1);
 272           init_unistr2(&stor->sharename,  p+1, strlen(p+1)+1);
 273           stor->ptr_servername = stor->ptr_sharename = 1;
 274         }
 275     }
 276   return True;
 277 }
 278
 279 static WERROR init_reply_dfs_ctr(TALLOC_CTX *ctx, uint32 level,
 280                                    DFS_INFO_CTR* ctr, struct junction_map* jn,
 281                                    int num_jn)
 282 {
 283   /* do the levels */
 284   switch(level)
 285     {
 286     case 1:
 287       {
 288         DFS_INFO_1* dfs1;
 289         dfs1 = (DFS_INFO_1*) talloc(ctx, num_jn * sizeof(DFS_INFO_1));
 290         if (!dfs1)
 291                 return WERR_NOMEM;
 292         init_reply_dfs_info_1(jn, dfs1, num_jn);
 293         ctr->dfs.info1 = dfs1;
 294         break;
 295       }
 296     case 2:
 297       {
 298         DFS_INFO_2* dfs2;
 299         dfs2 = (DFS_INFO_2*) talloc(ctx, num_jn * sizeof(DFS_INFO_2));
 300         if (!dfs2)
 301                 return WERR_NOMEM;
 302         init_reply_dfs_info_2(jn, dfs2, num_jn);
 303         ctr->dfs.info2 = dfs2;
 304         break;
 305       }
 306     case 3:
 307       {
 308         DFS_INFO_3* dfs3;
 309         dfs3 = (DFS_INFO_3*) talloc(ctx, num_jn * sizeof(DFS_INFO_3));
 310         if (!dfs3)
 311                 return WERR_NOMEM;
 312         init_reply_dfs_info_3(ctx, jn, dfs3, num_jn);
 313         ctr->dfs.info3 = dfs3;
 314         break;
 315       }
 316         default:
 317                 return WERR_INVALID_PARAM;
 318     }
 319   return WERR_OK;
 320 }
 321
 322 WERROR _dfs_enum(pipes_struct *p, DFS_Q_DFS_ENUM *q_u, DFS_R_DFS_ENUM *r_u)
 323 {
 324   uint32 level = q_u->level;
 325   struct junction_map jn[MAX_MSDFS_JUNCTIONS];
 326   int num_jn = 0;
 327
 328   num_jn = enum_msdfs_links(jn);
 329
 330   DEBUG(5,("make_reply_dfs_enum: %d junctions found in Dfs, doing level %d\n", num_jn, level));
 331
 332   r_u->ptr_buffer = level;
 333   r_u->level = r_u->level2 = level;
 334   r_u->ptr_num_entries = r_u->ptr_num_entries2 = 1;
 335   r_u->num_entries = r_u->num_entries2 = num_jn;
 336   r_u->reshnd.ptr_hnd = 1;
 337   r_u->reshnd.handle = num_jn;
 338
 339   r_u->ctr = (DFS_INFO_CTR*)talloc(p->mem_ctx, sizeof(DFS_INFO_CTR));
 340   if (!r_u->ctr)
 341     return WERR_NOMEM;
 342   ZERO_STRUCTP(r_u->ctr);
 343   r_u->ctr->switch_value = level;
 344   r_u->ctr->num_entries = num_jn;
 345   r_u->ctr->ptr_dfs_ctr = 1;
 346
 347   r_u->status = init_reply_dfs_ctr(p->mem_ctx, level, r_u->ctr, jn, num_jn);
 348
 349   return r_u->status;
 350 }
 351
 352 WERROR _dfs_get_info(pipes_struct *p, DFS_Q_DFS_GET_INFO *q_u,
 353                      DFS_R_DFS_GET_INFO *r_u)
 354 {
 355   UNISTR2* uni_path = &q_u->uni_path;
 356   uint32 level = q_u->level;
 357   pstring path;
 358   struct junction_map jn;
 359
 360   unistr2_to_ascii(path, uni_path, sizeof(path)-1);
 361   if(!create_junction(path, &jn))
 362      return WERR_DFS_NO_SUCH_SERVER;
 363
 364     return WERR_DFS_NO_SUCH_VOL;
 365   if(!get_referred_path(path, &jn, NULL, NULL))
 366
 367   r_u->level = level;
 368   r_u->ptr_ctr = 1;
 369   r_u->status = init_reply_dfs_ctr(p->mem_ctx, level, &r_u->ctr, &jn, 1);
 370
 371   return r_u->status;
 372 }
 373 #else
 374         void dfs_dummy1(void) {;} /* So some compilers don't complain. */
 375 #endif