summary refs log tree commit diff
path: root/hurd/hurdprio.c
blob: 7530c8f34cd25a8513fe3637b8b83c6f33513d7c (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
/* Support code for dealing with priorities in the Hurd.
   Copyright (C) 1994,95,96,97,99 Free Software Foundation, Inc.
   This file is part of the GNU C Library.

   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 <hurd/resource.h>
#include <hurd.h>

error_t
_hurd_priority_which_map (enum __priority_which which, int who,
			  error_t (*function) (pid_t, struct procinfo *),
			  int pi_flags)
{
  mach_msg_type_number_t npids = 64, i;
  pid_t pidbuf[npids], *pids = pidbuf;
  error_t err;
  struct procinfo *pip;
  int pibuf[sizeof *pip + 5 * sizeof (pip->threadinfos[0])], *pi = pibuf;
  mach_msg_type_number_t pisize = sizeof (pibuf) / sizeof (int);

  switch (which)
    {
    case PRIO_PROCESS:
      npids = 1;
      pids[0] = who ?: getpid (); /* XXX function could special-case self? */
      err = 0;
      break;

    case PRIO_PGRP:
      err = __USEPORT (PROC, __proc_getpgrppids (port, who, &pids, &npids));
      break;

    case PRIO_USER:
      if (who == 0)
	who = geteuid ();
      err = __USEPORT (PROC, __proc_getallpids (port, &pids, &npids));
      break;

    default:
      return EINVAL;
    }

  for (i = 0; !err && i < npids; ++i)
    {
      if (which == PRIO_USER)
	{
	  /* Get procinfo to check the owner.  */
	  int *oldpi = pi;
	  mach_msg_type_number_t oldpisize = pisize;
	  char *tw = 0;
	  size_t twsz = 0;
	  if (err = __USEPORT (PROC, __proc_getprocinfo (port, pids[i],
							 &pi_flags,
							 &pi, &pisize,
							 &tw, &twsz)))
	    continue;
	  if (twsz)
	    /* Gratuitous.  */
	    __vm_deallocate (__mach_task_self (), (vm_address_t) tw, twsz);
	  if (pi != oldpi && oldpi != pibuf)
	    /* Old buffer from last call was not reused; free it.  */
	    __vm_deallocate (__mach_task_self (),
			     (vm_address_t) oldpi, oldpisize * sizeof pi[0]);

	  pip = (struct procinfo *) pi;
	  if (pip->owner != (uid_t) who)
	    continue;
	}
      else
	pip = NULL;

      err = (*function) (pids[i], pip);
    }

  if (pids != pidbuf)
    __vm_deallocate (__mach_task_self (),
		     (vm_address_t) pids, npids * sizeof pids[0]);
  if (pi != pibuf)
    __vm_deallocate (__mach_task_self (),
		     (vm_address_t) pi, pisize * sizeof pi[0]);

  return err;
}