| @@ -1,14 +1,14 @@ | | | @@ -1,14 +1,14 @@ |
1 | /* $NetBSD: idr.h,v 1.1.2.5 2013/07/24 02:51:35 riastradh Exp $ */ | | 1 | /* $NetBSD: idr.h,v 1.1.2.6 2013/07/24 03:13:59 riastradh Exp $ */ |
2 | | | 2 | |
3 | /*- | | 3 | /*- |
4 | * Copyright (c) 2013 The NetBSD Foundation, Inc. | | 4 | * Copyright (c) 2013 The NetBSD Foundation, Inc. |
5 | * All rights reserved. | | 5 | * All rights reserved. |
6 | * | | 6 | * |
7 | * This code is derived from software contributed to The NetBSD Foundation | | 7 | * This code is derived from software contributed to The NetBSD Foundation |
8 | * by Taylor R. Campbell. | | 8 | * by Taylor R. Campbell. |
9 | * | | 9 | * |
10 | * Redistribution and use in source and binary forms, with or without | | 10 | * Redistribution and use in source and binary forms, with or without |
11 | * modification, are permitted provided that the following conditions | | 11 | * modification, are permitted provided that the following conditions |
12 | * are met: | | 12 | * are met: |
13 | * 1. Redistributions of source code must retain the above copyright | | 13 | * 1. Redistributions of source code must retain the above copyright |
14 | * notice, this list of conditions and the following disclaimer. | | 14 | * notice, this list of conditions and the following disclaimer. |
| @@ -34,24 +34,35 @@ | | | @@ -34,24 +34,35 @@ |
34 | | | 34 | |
35 | #include <sys/types.h> | | 35 | #include <sys/types.h> |
36 | #include <sys/rwlock.h> | | 36 | #include <sys/rwlock.h> |
37 | #include <sys/rbtree.h> | | 37 | #include <sys/rbtree.h> |
38 | | | 38 | |
39 | /* XXX Stupid expedient algorithm should be replaced by something better. */ | | 39 | /* XXX Stupid expedient algorithm should be replaced by something better. */ |
40 | | | 40 | |
41 | struct idr { | | 41 | struct idr { |
42 | krwlock_t idr_lock; | | 42 | krwlock_t idr_lock; |
43 | rb_tree_t idr_tree; | | 43 | rb_tree_t idr_tree; |
44 | struct idr_node *idr_temp; | | 44 | struct idr_node *idr_temp; |
45 | }; | | 45 | }; |
46 | | | 46 | |
| | | 47 | /* XXX Make the nm output a little more greppable... */ |
| | | 48 | #define idr_init linux_idr_init |
| | | 49 | #define idr_destroy linux_idr_destroy |
| | | 50 | #define idr_find linux_idr_find |
| | | 51 | #define idr_replace linux_idr_replace |
| | | 52 | #define idr_remove linux_idr_remove |
| | | 53 | #define idr_remove_all linux_idr_remove_all |
| | | 54 | #define idr_pre_get linux_idr_pre_get |
| | | 55 | #define idr_get_new_above linux_idr_get_new_above |
| | | 56 | #define idr_for_each linux_idr_for_each |
| | | 57 | |
47 | void idr_init(struct idr *); | | 58 | void idr_init(struct idr *); |
48 | void idr_destroy(struct idr *); | | 59 | void idr_destroy(struct idr *); |
49 | void *idr_find(struct idr *, int); | | 60 | void *idr_find(struct idr *, int); |
50 | void *idr_replace(struct idr *, void *, int); | | 61 | void *idr_replace(struct idr *, void *, int); |
51 | void idr_remove(struct idr *, int); | | 62 | void idr_remove(struct idr *, int); |
52 | void idr_remove_all(struct idr *); | | 63 | void idr_remove_all(struct idr *); |
53 | int idr_pre_get(struct idr *, int); | | 64 | int idr_pre_get(struct idr *, int); |
54 | int idr_get_new_above(struct idr *, void *, int, int *); | | 65 | int idr_get_new_above(struct idr *, void *, int, int *); |
55 | int idr_for_each(struct idr *, int (*)(int, void *, void *), void *); | | 66 | int idr_for_each(struct idr *, int (*)(int, void *, void *), void *); |
56 | | | 67 | |
57 | #endif /* _LINUX_IDR_H_ */ | | 68 | #endif /* _LINUX_IDR_H_ */ |