source3/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 int DEBUGLEVEL;
  31 extern pstring global_myname;
  32
  33 #ifdef WITH_MSDFS
  34
  35 #define MAX_MSDFS_JUNCTIONS 256
  36
  37 uint32 _dfs_exist(pipes_struct *p, DFS_Q_DFS_EXIST *q_u, DFS_R_DFS_EXIST *r_u)
  38 {
  39         if(lp_host_msdfs())
  40                 return 1;
  41         else
  42                 return 0;
  43 }
  44
  45 uint32 _dfs_add(pipes_struct *p, DFS_Q_DFS_ADD* q_u, DFS_R_DFS_ADD *r_u)
  46 {
  47   struct current_user user;
  48   struct junction_map jn;
  49   struct referral* old_referral_list = NULL;
  50   BOOL exists = False;
  51
  52   pstring dfspath, servername, sharename;
  53   pstring altpath;
  54
  55   get_current_user(&user,p);
  56
  57   if (user.uid != 0) {
  58         DEBUG(10,("_dfs_add: uid != 0. Access denied.\n"));
  59         return ERROR_ACCESS_DENIED;
  60   }
  61
  62   unistr2_to_ascii(dfspath, &q_u->DfsEntryPath, sizeof(dfspath)-1);
  63   unistr2_to_ascii(servername, &q_u->ServerName, sizeof(servername)-1);
  64   unistr2_to_ascii(sharename, &q_u->ShareName, sizeof(sharename)-1);
  65
  66   DEBUG(5,("init_reply_dfs_add: Request to add %s -> %s\\%s.\n",
  67            dfspath, servername, sharename));
  68
  69   pstrcpy(altpath, servername);
  70   pstrcat(altpath, "\\");
  71   pstrcat(altpath, sharename);
  72
  73   if(!create_junction(dfspath, &jn))
  74     return NERR_DfsNoSuchServer;
  75
  76   if(get_referred_path(&jn))
  77     {
  78       exists = True;
  79       jn.referral_count += 1;
  80       old_referral_list = jn.referral_list;
  81     }
  82   else
  83     jn.referral_count = 1;
  84
  85   jn.referral_list = (struct referral*) talloc(p->mem_ctx, jn.referral_count
  86                                                * sizeof(struct referral));
  87
  88   if(jn.referral_list == NULL)
  89     {
  90       DEBUG(0,("init_reply_dfs_add: talloc failed for referral list!\n"));
  91       return NERR_DfsInternalError;
  92     }
  93
  94   if(old_referral_list)
  95     {
  96       memcpy(jn.referral_list, old_referral_list,
  97              sizeof(struct referral)*jn.referral_count-1);
  98       free(old_referral_list);
  99     }
 100
 101   jn.referral_list[jn.referral_count-1].proximity = 0;
 102   jn.referral_list[jn.referral_count-1].ttl = REFERRAL_TTL;
 103
 104   pstrcpy(jn.referral_list[jn.referral_count-1].alternate_path, altpath);
 105
 106   if(!create_msdfs_link(&jn, exists))
 107     return NERR_DfsCantCreateJunctionPoint;
 108
 109   return NT_STATUS_NOPROBLEMO;
 110 }
 111
 112 uint32 _dfs_remove(pipes_struct *p, DFS_Q_DFS_REMOVE *q_u, DFS_R_DFS_REMOVE *r_u)
 113 {
 114   struct current_user user;
 115   struct junction_map jn;
 116   BOOL found = False;
 117
 118   pstring dfspath, servername, sharename;
 119   pstring altpath;
 120
 121   get_current_user(&user,p);
 122
 123   if (user.uid != 0) {
 124         DEBUG(10,("_dfs_remove: uid != 0. Access denied.\n"));
 125         return ERROR_ACCESS_DENIED;
 126   }
 127
 128   unistr2_to_ascii(dfspath, &q_u->DfsEntryPath, sizeof(dfspath)-1);
 129   if(q_u->ptr_ServerName)
 130     unistr2_to_ascii(servername, &q_u->ServerName, sizeof(servername)-1);
 131
 132   if(q_u->ptr_ShareName)
 133     unistr2_to_ascii(sharename, &q_u->ShareName, sizeof(sharename)-1);
 134
 135   if(q_u->ptr_ServerName && q_u->ptr_ShareName)
 136     {
 137       pstrcpy(altpath, servername);
 138       pstrcat(altpath, "\\");
 139       pstrcat(altpath, sharename);
 140     }
 141
 142   DEBUG(5,("init_reply_dfs_remove: Request to remove %s -> %s\\%s.\n",
 143            dfspath, servername, sharename));
 144
 145   if(!create_junction(dfspath, &jn))
 146     return NERR_DfsNoSuchServer;
 147
 148   if(!get_referred_path(&jn))
 149     return NERR_DfsNoSuchVolume;
 150
 151   /* if no server-share pair given, remove the msdfs link completely */
 152   if(!q_u->ptr_ServerName && !q_u->ptr_ShareName)
 153     {
 154       if(!remove_msdfs_link(&jn))
 155         return NERR_DfsNoSuchVolume;
 156     }
 157   else
 158     {
 159       int i=0;
 160       /* compare each referral in the list with the one to remove */
 161       for(i=0;i<jn.referral_count;i++)
 162         {
 163           pstring refpath;
 164           pstrcpy(refpath,jn.referral_list[i].alternate_path);
 165           trim_string(refpath, "\\", "\\");
 166           if(strequal(refpath, altpath))
 167             {
 168               *(jn.referral_list[i].alternate_path)='\0';
 169               found = True;
 170             }
 171         }
 172       if(!found)
 173         return NERR_DfsNoSuchShare;
 174
 175       /* Only one referral, remove it */
 176       if(jn.referral_count == 1)
 177         {
 178           if(!remove_msdfs_link(&jn))
 179             return NERR_DfsNoSuchVolume;
 180         }
 181       else
 182         {
 183           if(!create_msdfs_link(&jn, True))
 184             return NERR_DfsCantCreateJunctionPoint;
 185         }
 186     }
 187
 188   return NT_STATUS_NOPROBLEMO;
 189 }
 190
 191 static BOOL init_reply_dfs_info_1(struct junction_map* j, DFS_INFO_1* dfs1, int num_j)
 192 {
 193   int i=0;
 194   for(i=0;i<num_j;i++)
 195     {
 196       pstring str;
 197       dfs1[i].ptr_entrypath = 1;
 198       slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname,
 199                j[i].service_name, j[i].volume_name);
 200       DEBUG(5,("init_reply_dfs_info_1: %d) initing entrypath: %s\n",i,str));
 201       init_unistr2(&dfs1[i].entrypath,str,strlen(str)+1);
 202     }
 203   return True;
 204 }
 205
 206 static BOOL init_reply_dfs_info_2(struct junction_map* j, DFS_INFO_2* dfs2, int num_j)
 207 {
 208   int i=0;
 209   for(i=0;i<num_j;i++)
 210     {
 211       pstring str;
 212       dfs2[i].ptr_entrypath = 1;
 213       slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname,
 214                j[i].service_name, j[i].volume_name);
 215       init_unistr2(&dfs2[i].entrypath, str, strlen(str)+1);
 216       dfs2[i].ptr_comment = 0;
 217       dfs2[i].state = 1; /* set up state of dfs junction as OK */
 218       dfs2[i].num_storages = j[i].referral_count;
 219     }
 220   return True;
 221 }
 222
 223 static BOOL init_reply_dfs_info_3(TALLOC_CTX *ctx, struct junction_map* j, DFS_INFO_3* dfs3, int num_j)
 224 {
 225   int i=0,ii=0;
 226   for(i=0;i<num_j;i++)
 227     {
 228       pstring str;
 229       dfs3[i].ptr_entrypath = 1;
 230       slprintf(str, sizeof(pstring)-1, "\\\\%s\\%s\\%s", global_myname,
 231                j[i].service_name, j[i].volume_name);
 232       init_unistr2(&dfs3[i].entrypath, str, strlen(str)+1);
 233       dfs3[i].ptr_comment = 1;
 234       init_unistr2(&dfs3[i].comment, "", 1);
 235       dfs3[i].state = 1;
 236       dfs3[i].num_storages = dfs3[i].num_storage_infos = j[i].referral_count;
 237       dfs3[i].ptr_storages = 1;
 238
 239       /* also enumerate the storages */
 240       dfs3[i].storages = (DFS_STORAGE_INFO*) talloc(ctx, j[i].referral_count *
 241                                                     sizeof(DFS_STORAGE_INFO));
 242       if (!dfs3[i].storages)
 243         return False;
 244
 245       memset(dfs3[i].storages, '\0', j[i].referral_count * sizeof(DFS_STORAGE_INFO));
 246
 247       for(ii=0;ii<j[i].referral_count;ii++)
 248         {
 249           char* p;
 250           pstring path;
 251           DFS_STORAGE_INFO* stor = &(dfs3[i].storages[ii]);
 252           struct referral* ref = &(j[i].referral_list[ii]);
 253
 254           pstrcpy(path, ref->alternate_path);
 255           trim_string(path,"\\","");
 256           p = strrchr(path,'\\');
 257           if(p==NULL)
 258             {
 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 storages as ONLINE */
 265           init_unistr2(&stor->servername, path, strlen(path)+1);
 266           init_unistr2(&stor->sharename,  p+1, strlen(p+1)+1);
 267           stor->ptr_servername = stor->ptr_sharename = 1;
 268         }
 269     }
 270   return True;
 271 }
 272
 273 static uint32 init_reply_dfs_ctr(TALLOC_CTX *ctx, uint32 level, DFS_INFO_CTR* ctr,
 274                                struct junction_map* jn, int num_jn)
 275 {
 276   /* do the levels */
 277   switch(level)
 278     {
 279     case 1:
 280       {
 281         DFS_INFO_1* dfs1;
 282         dfs1 = (DFS_INFO_1*) talloc(ctx, num_jn * sizeof(DFS_INFO_1));
 283         if (!dfs1)
 284                 return NT_STATUS_NO_MEMORY;
 285         init_reply_dfs_info_1(jn, dfs1, num_jn);
 286         ctr->dfs.info1 = dfs1;
 287         break;
 288       }
 289     case 2:
 290       {
 291         DFS_INFO_2* dfs2;
 292         dfs2 = (DFS_INFO_2*) talloc(ctx, num_jn * sizeof(DFS_INFO_2));
 293         if (!dfs2)
 294                 return NT_STATUS_NO_MEMORY;
 295         init_reply_dfs_info_2(jn, dfs2, num_jn);
 296         ctr->dfs.info2 = dfs2;
 297         break;
 298       }
 299     case 3:
 300       {
 301         DFS_INFO_3* dfs3;
 302         dfs3 = (DFS_INFO_3*) talloc(ctx, num_jn * sizeof(DFS_INFO_3));
 303         if (!dfs3)
 304                 return NT_STATUS_NO_MEMORY;
 305         init_reply_dfs_info_3(ctx, jn, dfs3, num_jn);
 306         ctr->dfs.info3 = dfs3;
 307         break;
 308       }
 309         default:
 310                 return NT_STATUS_INVALID_LEVEL;
 311     }
 312   return NT_STATUS_NOPROBLEMO;
 313 }
 314
 315 uint32 _dfs_enum(pipes_struct *p, DFS_Q_DFS_ENUM *q_u, DFS_R_DFS_ENUM *r_u)
 316 {
 317   uint32 level = q_u->level;
 318   struct junction_map jn[MAX_MSDFS_JUNCTIONS];
 319   int num_jn = 0;
 320
 321   num_jn = enum_msdfs_links(jn);
 322
 323   DEBUG(5,("make_reply_dfs_enum: %d junctions found in Dfs, doing level %d\n", num_jn, level));
 324
 325   r_u->ptr_buffer = level;
 326   r_u->level = r_u->level2 = level;
 327   r_u->ptr_num_entries = r_u->ptr_num_entries2 = 1;
 328   r_u->num_entries = r_u->num_entries2 = num_jn;
 329   r_u->reshnd.ptr_hnd = 1;
 330   r_u->reshnd.handle = num_jn;
 331
 332   r_u->ctr = (DFS_INFO_CTR*)talloc(p->mem_ctx, sizeof(DFS_INFO_CTR));
 333   if (!r_u->ctr)
 334     return NT_STATUS_NO_MEMORY;
 335   ZERO_STRUCTP(r_u->ctr);
 336   r_u->ctr->switch_value = level;
 337   r_u->ctr->num_entries = num_jn;
 338   r_u->ctr->ptr_dfs_ctr = 1;
 339
 340   r_u->status = init_reply_dfs_ctr(p->mem_ctx, level, r_u->ctr, jn, num_jn);
 341
 342   return r_u->status;
 343 }
 344
 345 uint32 _dfs_get_info(pipes_struct *p, DFS_Q_DFS_GET_INFO *q_u, DFS_R_DFS_GET_INFO *r_u)
 346 {
 347   UNISTR2* uni_path = &q_u->uni_path;
 348   uint32 level = q_u->level;
 349   pstring path;
 350   struct junction_map jn;
 351
 352   unistr2_to_ascii(path, uni_path, sizeof(path)-1);
 353   if(!create_junction(path, &jn))
 354      return NERR_DfsNoSuchServer;
 355
 356   if(!get_referred_path(&jn))
 357     return NERR_DfsNoSuchVolume;
 358
 359   r_u->level = level;
 360   r_u->ptr_ctr = 1;
 361   r_u->status = init_reply_dfs_ctr(p->mem_ctx, level, &r_u->ctr, &jn, 1);
 362
 363   return r_u->status;
 364 }
 365 #else
 366         void dfs_dummy1(void) {;} /* So some compilers don't complain. */
 367 #endif