66 #define INSERT_OBJECT_OID_LINK_INDEX_TYPE(PTR, LIST, LINK, INDEX, SUBF) do {\  argument
67 	typedef __typeof ((PTR)->SUBF) _subf_type;			\
71 		if (asn_compare_oid(&_lelem->INDEX, &(PTR)->SUBF.INDEX) > 0)\
74 		TAILQ_INSERT_TAIL((LIST), &(PTR)->SUBF, LINK);		\
76 		TAILQ_INSERT_BEFORE(_lelem, &(PTR)->SUBF, LINK);	\
101 #define INSERT_OBJECT_OID_LINK_INDEX(PTR, LIST, LINK, INDEX) do {	\  argument
102 	__typeof (PTR) _lelem;						\
105 		if (asn_compare_oid(&_lelem->INDEX, &(PTR)->INDEX) > 0)	\
108 		TAILQ_INSERT_TAIL((LIST), (PTR), LINK);			\
110 		TAILQ_INSERT_BEFORE(_lelem, (PTR), LINK);		\
113 #define INSERT_OBJECT_INT_LINK_INDEX(PTR, LIST, LINK, INDEX) do {	\  argument
114 	__typeof (PTR) _lelem;						\
117 		if ((asn_subid_t)_lelem->INDEX > (asn_subid_t)(PTR)->INDEX)\
120 		TAILQ_INSERT_TAIL((LIST), (PTR), LINK);			\
122 		TAILQ_INSERT_BEFORE(_lelem, (PTR), LINK);		\
125 #define	INSERT_OBJECT_FUNC_LINK(PTR, LIST, LINK, FUNC) do {		\  argument
126 	__typeof (PTR) _lelem;						\
129 		if ((FUNC)(_lelem, (PTR)) > 0)				\
132 		TAILQ_INSERT_TAIL((LIST), (PTR), LINK);			\
134 		TAILQ_INSERT_BEFORE(_lelem, (PTR), LINK);		\
137 #define	INSERT_OBJECT_FUNC_LINK_REV(PTR, LIST, HEAD, LINK, FUNC) do {	\  argument
138 	__typeof (PTR) _lelem;						\
141 		if ((FUNC)(_lelem, (PTR)) < 0)				\
144 		TAILQ_INSERT_HEAD((LIST), (PTR), LINK);			\
146 		TAILQ_INSERT_AFTER((LIST), _lelem, (PTR), LINK);	\
212 #define INSERT_OBJECT_OID_LINK(PTR, LIST, LINK)				\  argument
213     INSERT_OBJECT_OID_LINK_INDEX(PTR, LIST, LINK, index)
215 #define INSERT_OBJECT_INT_LINK(PTR, LIST, LINK) do {			\  argument
216     INSERT_OBJECT_INT_LINK_INDEX(PTR, LIST, LINK, index)
234 #define INSERT_OBJECT_OID(PTR, LIST)					\  argument
235     INSERT_OBJECT_OID_LINK_INDEX(PTR, LIST, link, index)
237 #define INSERT_OBJECT_INT(PTR, LIST)					\  argument
238     INSERT_OBJECT_INT_LINK_INDEX(PTR, LIST, link, index)
240 #define	INSERT_OBJECT_FUNC_REV(PTR, LIST, HEAD, FUNC)			\  argument
241     INSERT_OBJECT_FUNC_LINK_REV(PTR, LIST, HEAD, link, FUNC)