1 |
|
|
/* $OpenBSD: doi.c,v 1.11 2013/03/21 04:30:14 deraadt Exp $ */ |
2 |
|
|
/* $EOM: doi.c,v 1.4 1999/04/02 00:57:36 niklas Exp $ */ |
3 |
|
|
|
4 |
|
|
/* |
5 |
|
|
* Copyright (c) 1998, 1999 Niklas Hallqvist. All rights reserved. |
6 |
|
|
* |
7 |
|
|
* Redistribution and use in source and binary forms, with or without |
8 |
|
|
* modification, are permitted provided that the following conditions |
9 |
|
|
* are met: |
10 |
|
|
* 1. Redistributions of source code must retain the above copyright |
11 |
|
|
* notice, this list of conditions and the following disclaimer. |
12 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright |
13 |
|
|
* notice, this list of conditions and the following disclaimer in the |
14 |
|
|
* documentation and/or other materials provided with the distribution. |
15 |
|
|
* |
16 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
17 |
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
18 |
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 |
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 |
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 |
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 |
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 |
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 |
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 |
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 |
|
|
*/ |
27 |
|
|
|
28 |
|
|
/* |
29 |
|
|
* This code was written under funding by Ericsson Radio Systems. |
30 |
|
|
*/ |
31 |
|
|
|
32 |
|
|
#include <sys/types.h> |
33 |
|
|
|
34 |
|
|
#include "doi.h" |
35 |
|
|
|
36 |
|
|
static |
37 |
|
|
LIST_HEAD(doi_list, doi) doi_tab; |
38 |
|
|
|
39 |
|
|
void |
40 |
|
|
doi_init(void) |
41 |
|
|
{ |
42 |
|
|
LIST_INIT(&doi_tab); |
43 |
|
|
} |
44 |
|
|
|
45 |
|
|
struct doi * |
46 |
|
|
doi_lookup(u_int8_t doi_id) |
47 |
|
|
{ |
48 |
|
|
struct doi *doi; |
49 |
|
|
|
50 |
|
|
for (doi = LIST_FIRST(&doi_tab); doi && doi->id != doi_id; |
51 |
|
|
doi = LIST_NEXT(doi, link)); |
52 |
|
|
return doi; |
53 |
|
|
} |
54 |
|
|
|
55 |
|
|
void |
56 |
|
|
doi_register(struct doi *doi) |
57 |
|
|
{ |
58 |
|
|
LIST_INSERT_HEAD(&doi_tab, doi, link); |
59 |
|
|
} |