nis/nis_subr.c

   1 /* Copyright (c) 1997, 1999 Free Software Foundation, Inc.
   2    This file is part of the GNU C Library.
   3    Contributed by Thorsten Kukuk <kukuk@vt.uni-paderborn.de>, 1997.
   4
   5    The GNU C Library is free software; you can redistribute it and/or
   6    modify it under the terms of the GNU Library General Public License as
   7    published by the Free Software Foundation; either version 2 of the
   8    License, or (at your option) any later version.
   9
  10    The GNU C Library is distributed in the hope that it will be useful,
  11    but WITHOUT ANY WARRANTY; without even the implied warranty of
  12    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13    Library General Public License for more details.
  14
  15    You should have received a copy of the GNU Library General Public
  16    License along with the GNU C Library; see the file COPYING.LIB.  If not,
  17    write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  18    Boston, MA 02111-1307, USA.  */
  19
  20 #include <errno.h>
  21 #include <string.h>
  22 #include <rpcsvc/nis.h>
  23
  24 nis_name
  25 nis_leaf_of (const_nis_name name)
  26 {
  27   static char result[NIS_MAXNAMELEN + 1];
  28
  29   return nis_leaf_of_r (name, result, NIS_MAXNAMELEN);
  30 }
  31
  32 nis_name
  33 nis_leaf_of_r (const_nis_name name, char *buffer, size_t buflen)
  34 {
  35   size_t i = 0;
  36
  37   buffer[0] = '\0';
  38
  39   while (name[i] != '.' && name[i] != '\0')
  40     i++;
  41
  42   if (i > buflen - 1)
  43     {
  44       errno = ERANGE;
  45       return NULL;
  46     }
  47
  48   if (i > 0)
  49     {
  50       if ((size_t)i >= buflen)
  51         {
  52           errno = ERANGE;
  53           return NULL;
  54         }
  55
  56       *((char *) __mempcpy (buffer, name, i)) = '\0';
  57     }
  58
  59   return buffer;
  60 }
  61
  62 nis_name
  63 nis_name_of (const_nis_name name)
  64 {
  65   static char result[NIS_MAXNAMELEN + 1];
  66
  67   return nis_name_of_r (name, result, NIS_MAXNAMELEN);
  68 }
  69
  70 nis_name
  71 nis_name_of_r (const_nis_name name, char *buffer, size_t buflen)
  72 {
  73   char *local_domain;
  74   int diff;
  75
  76   local_domain = nis_local_directory ();
  77
  78   diff = strlen (name) - strlen (local_domain);
  79   if (diff <= 0)
  80     return NULL;
  81
  82   if (strcmp (&name[diff], local_domain) != 0)
  83     return NULL;
  84
  85   if ((size_t) diff >= buflen)
  86     {
  87       errno = ERANGE;
  88       return NULL;
  89     }
  90
  91   *((char *) __mempcpy (buffer, name, diff - 1)) = '\0';
  92
  93   if (diff - 1 == 0)
  94     return NULL;
  95
  96   return buffer;
  97 }
  98
  99 static int
 100 count_dots (const_nis_name str)
 101 {
 102   int count = 0;
 103   size_t i;
 104
 105   for (i = 0; i < strlen (str); ++i)
 106     if (str[i] == '.')
 107       ++count;
 108
 109   return count;
 110 }
 111
 112 /* If we run out of memory, we don't give already allocated memory
 113    free. The overhead for bringing getnames back in a safe state to
 114    free it is to big. */
 115 nis_name *
 116 nis_getnames (const_nis_name name)
 117 {
 118   nis_name *getnames = NULL;
 119   char local_domain[NIS_MAXNAMELEN + 1];
 120   char *path, *cp;
 121   int count, pos, have_point;
 122   char *saveptr;
 123
 124   strncpy (local_domain, nis_local_directory (), NIS_MAXNAMELEN);
 125   local_domain[NIS_MAXNAMELEN] = '\0';
 126
 127   count = 1;
 128   getnames = malloc ((count + 1) * sizeof (char *));
 129   if (getnames == NULL)
 130       return NULL;
 131
 132   /* Do we have a fully qualified NIS+ name ? If yes, give it back */
 133   if (name[strlen (name) - 1] == '.')
 134     {
 135       if ((getnames[0] = strdup (name)) == NULL)
 136         return NULL;
 137
 138       getnames[1] = NULL;
 139
 140       return getnames;
 141     }
 142
 143   /* Get the search path, where we have to search "name" */
 144   path = getenv ("NIS_PATH");
 145   if (path == NULL)
 146     path = strdupa ("$");
 147   else
 148     path = strdupa (path);
 149
 150   have_point = (strchr (name, '.') != NULL);
 151
 152   pos = 0;
 153
 154   cp = __strtok_r (path, ":", &saveptr);
 155   while (cp)
 156     {
 157       if (strcmp (cp, "$") == 0)
 158         {
 159           char *cptr = local_domain;
 160           char *tmp;
 161
 162           while ((have_point && *cptr != '\0') || (count_dots (cptr) >= 2))
 163             {
 164               if (pos >= count)
 165                 {
 166                   count += 5;
 167                   getnames = realloc (getnames, (count + 1) * sizeof (char *));
 168                   if (getnames == NULL)
 169                     return NULL;
 170                 }
 171               tmp = malloc (strlen (cptr) + strlen (local_domain) +
 172                             strlen (name) + 2);
 173               if (tmp == NULL)
 174                 return NULL;
 175
 176               getnames[pos] = tmp;
 177               tmp = stpcpy (tmp, name);
 178               *tmp++ = '.';
 179               if (cptr[1] != '\0')
 180                 stpcpy (tmp, cptr);
 181               else
 182                 ++cptr;
 183
 184               ++pos;
 185
 186               while (*cptr != '.' && *cptr != '\0')
 187                 ++cptr;
 188               if (cptr[0] != '\0' && cptr[1] != '\0')
 189                 /* If we have only ".", don't remove the "." */
 190                 ++cptr;
 191             }
 192         }
 193       else
 194         {
 195           char *tmp;
 196           size_t cplen = strlen (cp);
 197
 198           if (cp[cplen - 1] == '$')
 199             {
 200               char *p;
 201
 202               tmp = malloc (cplen + strlen (local_domain) + strlen (name) + 2);
 203               if (tmp == NULL)
 204                 return NULL;
 205
 206               p = __stpcpy (tmp, name);
 207               *p++ = '.';
 208               p = __mempcpy (p, cp, cplen);
 209               --p;
 210               if (p[-1] != '.')
 211                 *p++ = '.';
 212               __stpcpy (p, local_domain);
 213             }
 214           else
 215             {
 216               char *p;
 217
 218               tmp = malloc (cplen + strlen (name) + 2);
 219               if (tmp == NULL)
 220                 return NULL;
 221
 222               p = __stpcpy (tmp, name);
 223               *p++ = '.';
 224               memcpy (p, cp, cplen + 1);
 225             }
 226
 227           if (pos >= count)
 228             {
 229               count += 5;
 230               getnames = realloc (getnames, (count + 1) * sizeof (char *));
 231               if (getnames == NULL)
 232                 return NULL;
 233             }
 234           getnames[pos] = tmp;
 235           ++pos;
 236         }
 237       cp = __strtok_r (NULL, ":", &saveptr);
 238     }
 239
 240   getnames[pos] = NULL;
 241
 242   return getnames;
 243 }
 244
 245 void
 246 nis_freenames (nis_name *names)
 247 {
 248   int i = 0;
 249
 250   while (names[i] != NULL)
 251     {
 252       free (names[i]);
 253       ++i;
 254     }
 255
 256   free (names);
 257 }
 258
 259 name_pos
 260 nis_dir_cmp (const_nis_name n1, const_nis_name n2)
 261 {
 262   int len1, len2;
 263
 264   len1 = strlen (n1);
 265   len2 = strlen (n2);
 266
 267   if (len1 == len2)
 268     {
 269       if (strcmp (n1, n2) == 0)
 270         return SAME_NAME;
 271       else
 272         return NOT_SEQUENTIAL;
 273     }
 274
 275   if (len1 < len2)
 276     {
 277       if (n2[len2 - len1 - 1] != '.')
 278         return NOT_SEQUENTIAL;
 279       else if (strcmp (&n2[len2 - len1], n1) == 0)
 280         return HIGHER_NAME;
 281       else
 282         return NOT_SEQUENTIAL;
 283     }
 284   else
 285     {
 286       if (n1[len1 - len2 - 1] != '.')
 287         return NOT_SEQUENTIAL;
 288       else if (strcmp (&n1[len1 - len2], n2) == 0)
 289         return LOWER_NAME;
 290       else
 291         return NOT_SEQUENTIAL;
 292
 293     }
 294 }
 295
 296 void
 297 nis_destroy_object (nis_object *obj)
 298 {
 299   nis_free_object (obj);
 300 }