summary refs log tree commit diff
path: root/nis/nis_lookup.c
blob: bdce5d5a0ac20028a15835b6911577caa3dffdd1 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/* Copyright (C) 1997 Free Software Foundation, Inc.
   This file is part of the GNU C Library.
   Contributed by Thorsten Kukuk <kukuk@uni-paderborn.de>, 1997.

   The GNU C Library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Library General Public License as
   published by the Free Software Foundation; either version 2 of the
   License, or (at your option) any later version.

   The GNU C Library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Library General Public License for more details.

   You should have received a copy of the GNU Library General Public
   License along with the GNU C Library; see the file COPYING.LIB.  If not,
   write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.  */

#include <string.h>
#include <rpcsvc/nis.h>
#include <rpcsvc/nislib.h>

#include "nis_intern.h"

nis_result *
nis_lookup (const_nis_name name, const u_long flags)
{
  nis_result *res;
  struct ns_request req;
  nis_name *names;
  nis_error status;
  int count_links = 0;	 /* We will follow only 16 links in the deep */
  int done = 0;
  int name_nr = 0;
  nis_name namebuf[2] = {NULL, NULL};

  res = calloc (1, sizeof (nis_result));

  if (flags & EXPAND_NAME)
    {
      names = nis_getnames (name);
      if (names == NULL)
	{
	  res->status = NIS_NAMEUNREACHABLE;
	  return res;
	}
    }
  else
    {
      names = namebuf;
      names[0] = (nis_name) name;
    }

  req.ns_name = names[0];
  while (!done)
    {
      req.ns_object.ns_object_len = 0;
      req.ns_object.ns_object_val = NULL;
      memset (res, '\0', sizeof (nis_result));

      status = __do_niscall (req.ns_name, NIS_LOOKUP,
			     (xdrproc_t) xdr_ns_request,
			     (caddr_t) & req,
			     (xdrproc_t) xdr_nis_result,
			     (caddr_t) res, flags, NULL);
      if (status != NIS_SUCCESS)
	res->status = status;

      switch (res->status)
	{
	case NIS_PARTIAL:
	case NIS_SUCCESS:
	case NIS_S_SUCCESS:
	  if (__type_of(NIS_RES_OBJECT (res)) == LINK_OBJ &&
	      flags & FOLLOW_LINKS) /* We are following links */
	    {
	      /* if we hit the link limit, bail */
	      if (count_links > NIS_MAXLINKS)
		{
		  res->status = NIS_LINKNAMEERROR;
		  ++done;
		  break;
		}
	      if (count_links)
		free (req.ns_name);
	      ++count_links;
	      req.ns_name = strdup (NIS_RES_OBJECT (res)->LI_data.li_name);
	      nis_freeresult (res);
	      res = calloc (1, sizeof (nis_result));
	    }
	  else
	    ++done;
	  break;
	case NIS_CBRESULTS:
	  /* XXX Implement CALLBACK here ! */
	  ++done;
	  break;
	case NIS_UNAVAIL:
	  /* NIS+ is not installed, or all servers are down */
	  ++done;
	  break;
	default:
	  /* Try the next domainname if we don't follow a link */
	  if (count_links)
	    {
	      free (req.ns_name);
	      res->status = NIS_LINKNAMEERROR;
	      ++done;
	      break;
	    }
	  ++name_nr;
	  if (names[name_nr] == NULL)
	    {
	      ++done;
	      break;
	    }
	  req.ns_name = names[name_nr];
	  break;
	}
    }

  if (names != namebuf)
    nis_freenames (names);

  return res;
}