nis/nis_util.c

   1 /* Copyright (c) 1997, 1998 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 <string.h>
  21 #include <rpcsvc/nis.h>
  22
  23 #include "nis_xdr.h"
  24 #include "nis_intern.h"
  25
  26 fd_result *
  27 __nis_finddirectory (directory_obj *dir, const_nis_name name)
  28 {
  29   nis_error status;
  30   fd_args fd_args;
  31   fd_result *fd_res;
  32
  33   fd_args.dir_name = strdup (name);
  34   fd_args.requester = nis_local_host();
  35   fd_res = calloc (1, sizeof (fd_result));
  36
  37   status = __do_niscall2 (dir->do_servers.do_servers_val,
  38                           dir->do_servers.do_servers_len,
  39                           NIS_FINDDIRECTORY, (xdrproc_t) _xdr_fd_args,
  40                           (caddr_t) &fd_args, (xdrproc_t) _xdr_fd_result,
  41                           (caddr_t) fd_res, NO_AUTHINFO|USE_DGRAM, NULL);
  42   if (status != NIS_SUCCESS)
  43     fd_res->status = status;
  44
  45   return fd_res;
  46 }
  47
  48 /* This is from libc/db/hash/hash_func.c, hash3 is static there */
  49 /*
  50  * This is INCREDIBLY ugly, but fast.  We break the string up into 8 byte
  51  * units.  On the first time through the loop we get the "leftover bytes"
  52  * (strlen % 8).  On every other iteration, we perform 8 HASHC's so we handle
  53  * all 8 bytes.  Essentially, this saves us 7 cmp & branch instructions.  If
  54  * this routine is heavily used enough, it's worth the ugly coding.
  55  *
  56  * OZ's original sdbm hash
  57  */
  58 uint32_t
  59 __nis_hash (const void *keyarg, register size_t len)
  60 {
  61   register const u_char *key;
  62   register size_t loop;
  63   register uint32_t h;
  64
  65 #define HASHC   h = *key++ + 65599 * h
  66
  67   h = 0;
  68   key = keyarg;
  69   if (len > 0)
  70     {
  71       loop = (len + 8 - 1) >> 3;
  72       switch (len & (8 - 1))
  73         {
  74         case 0:
  75           do {
  76             HASHC;
  77             /* FALLTHROUGH */
  78           case 7:
  79             HASHC;
  80             /* FALLTHROUGH */
  81           case 6:
  82             HASHC;
  83             /* FALLTHROUGH */
  84           case 5:
  85             HASHC;
  86             /* FALLTHROUGH */
  87           case 4:
  88             HASHC;
  89             /* FALLTHROUGH */
  90           case 3:
  91             HASHC;
  92             /* FALLTHROUGH */
  93           case 2:
  94             HASHC;
  95             /* FALLTHROUGH */
  96           case 1:
  97             HASHC;
  98           } while (--loop);
  99         }
 100     }
 101   return (h);
 102 }