blob: a85b7863ac73e3717b71706ce3cbdf8b02a89a52 (
plain)
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
|
/*
Copyright (C) 1995 Free Software Foundation, Inc.
Written by Michael I. Bushnell.
This file is part of the GNU Hurd.
The GNU Hurd is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2, or (at
your option) any later version.
The GNU Hurd 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
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA. */
#include "ports.h"
/* This is obsecenely ineffecient. ihash and ports need to cooperate
more closely to do it effeciently. */
void
ports_bucket_iterate (struct port_bucket *bucket,
void (*fun)(void *))
{
struct item
{
struct item *next;
void *p;
} *list = 0;
struct item *i, nxt;
error_t enqueue (void *pi)
{
struct item *j;
j = malloc (sizeof (struct item));
j->next = list;
j->p = pi;
list = j;
((struct port_info *)pi)->refcnt++;
return 0;
}
mutex_lock (&_ports_lock);
ihash_iterate (bucket->htable, enqueue);
mutex_unlock (&_ports_lock);
for (i = list; i; i = nxt)
{
(*fun)(i->p);
ports_port_deref (i->p);
nxt = i->next;
free (i);
}
}
|
