bsnmp/snmpd/snmpmod.h

59 #define INSERT_OBJECT_OID_LINK_INDEX(PTR, LIST, LINK, INDEX) do {	\
62 	TAILQ_FOREACH(_lelem, (LIST), LINK)				\
66 		TAILQ_INSERT_TAIL((LIST), (PTR), LINK);			\
71 #define INSERT_OBJECT_INT_LINK_INDEX(PTR, LIST, LINK, INDEX) do {	\
74 	TAILQ_FOREACH(_lelem, (LIST), LINK)				\
78 		TAILQ_INSERT_TAIL((LIST), (PTR), LINK);			\
83 #define	INSERT_OBJECT_FUNC_LINK(PTR, LIST, LINK, FUNC) do {		\
86 	TAILQ_FOREACH(_lelem, (LIST), LINK)				\
90 		TAILQ_INSERT_TAIL((LIST), (PTR), LINK);			\
95 #define	INSERT_OBJECT_FUNC_LINK_REV(PTR, LIST, HEAD, LINK, FUNC) do {	\
98 	TAILQ_FOREACH_REVERSE(_lelem, (LIST), HEAD, LINK)		\
102 		TAILQ_INSERT_HEAD((LIST), (PTR), LINK);			\
104 		TAILQ_INSERT_AFTER((LIST), _lelem, (PTR), LINK);	\
107 #define FIND_OBJECT_OID_LINK_INDEX(LIST, OID, SUB, LINK, INDEX) ({	\
108 	__typeof (TAILQ_FIRST(LIST)) _lelem;				\
110 	TAILQ_FOREACH(_lelem, (LIST), LINK)				\
116 #define NEXT_OBJECT_OID_LINK_INDEX(LIST, OID, SUB, LINK, INDEX) ({	\
117 	__typeof (TAILQ_FIRST(LIST)) _lelem;				\
119 	TAILQ_FOREACH(_lelem, (LIST), LINK)				\
125 #define FIND_OBJECT_INT_LINK_INDEX(LIST, OID, SUB, LINK, INDEX) ({	\
126 	__typeof (TAILQ_FIRST(LIST)) _lelem;				\
131 		TAILQ_FOREACH(_lelem, (LIST), LINK)			\
137 #define NEXT_OBJECT_INT_LINK_INDEX(LIST, OID, SUB, LINK, INDEX) ({	\
138 	__typeof (TAILQ_FIRST(LIST)) _lelem;				\
141 		_lelem = TAILQ_FIRST(LIST);				\
143 		TAILQ_FOREACH(_lelem, (LIST), LINK)			\
149 #define FIND_OBJECT_FUNC_LINK(LIST, OID, SUB, LINK, FUNC) ({		\
150 	__typeof (TAILQ_FIRST(LIST)) _lelem;				\
152 	TAILQ_FOREACH(_lelem, (LIST), LINK)				\
158 #define NEXT_OBJECT_FUNC_LINK(LIST, OID, SUB, LINK, FUNC) ({		\
159 	__typeof (TAILQ_FIRST(LIST)) _lelem;				\
161 	TAILQ_FOREACH(_lelem, (LIST), LINK)				\
170 #define INSERT_OBJECT_OID_LINK(PTR, LIST, LINK)				\
171     INSERT_OBJECT_OID_LINK_INDEX(PTR, LIST, LINK, index)
173 #define INSERT_OBJECT_INT_LINK(PTR, LIST, LINK) do {			\
174     INSERT_OBJECT_INT_LINK_INDEX(PTR, LIST, LINK, index)
176 #define FIND_OBJECT_OID_LINK(LIST, OID, SUB, LINK)			\
177     FIND_OBJECT_OID_LINK_INDEX(LIST, OID, SUB, LINK, index)
179 #define NEXT_OBJECT_OID_LINK(LIST, OID, SUB, LINK)			\
180     NEXT_OBJECT_OID_LINK_INDEX(LIST, OID, SUB, LINK, index)
182 #define FIND_OBJECT_INT_LINK(LIST, OID, SUB, LINK)			\
183     FIND_OBJECT_INT_LINK_INDEX(LIST, OID, SUB, LINK, index)
185 #define NEXT_OBJECT_INT_LINK(LIST, OID, SUB, LINK)			\
186     NEXT_OBJECT_INT_LINK_INDEX(LIST, OID, SUB, LINK, index)
192 #define INSERT_OBJECT_OID(PTR, LIST)					\
193     INSERT_OBJECT_OID_LINK_INDEX(PTR, LIST, link, index)
195 #define INSERT_OBJECT_INT(PTR, LIST)					\
196     INSERT_OBJECT_INT_LINK_INDEX(PTR, LIST, link, index)
198 #define	INSERT_OBJECT_FUNC_REV(PTR, LIST, HEAD, FUNC)			\
199     INSERT_OBJECT_FUNC_LINK_REV(PTR, LIST, HEAD, link, FUNC)
201 #define FIND_OBJECT_OID(LIST, OID, SUB)					\
202     FIND_OBJECT_OID_LINK_INDEX(LIST, OID, SUB, link, index)
204 #define FIND_OBJECT_INT(LIST, OID, SUB)					\
205     FIND_OBJECT_INT_LINK_INDEX(LIST, OID, SUB, link, index)
207 #define	FIND_OBJECT_FUNC(LIST, OID, SUB, FUNC)				\
208     FIND_OBJECT_FUNC_LINK(LIST, OID, SUB, link, FUNC)
210 #define NEXT_OBJECT_OID(LIST, OID, SUB)					\
211     NEXT_OBJECT_OID_LINK_INDEX(LIST, OID, SUB, link, index)
213 #define NEXT_OBJECT_INT(LIST, OID, SUB)					\
214     NEXT_OBJECT_INT_LINK_INDEX(LIST, OID, SUB, link, index)
216 #define	NEXT_OBJECT_FUNC(LIST, OID, SUB, FUNC)				\
217     NEXT_OBJECT_FUNC_LINK(LIST, OID, SUB, link, FUNC)