Searched refs:bd_next (Results 1 – 2 of 2) sorted by relevance
70 curdesc = curdesc->bd_next) { in bhv_insert()89 bdp->bd_next = bhp->bh_first; in bhv_insert()93 bdp->bd_next = prev->bd_next; in bhv_insert()94 prev->bd_next = bdp; in bhv_insert()111 ASSERT(bhp->bh_first->bd_next != NULL); in bhv_remove_not_first()114 for (curdesc = bhp->bh_first->bd_next; in bhv_remove_not_first()116 curdesc = curdesc->bd_next) { in bhv_remove_not_first()124 prev->bd_next = bdp->bd_next; /* remove from after prev */ in bhv_remove_not_first()138 curdesc = curdesc->bd_next) { in bhv_lookup()158 curdesc = curdesc->bd_next) { in bhv_lookup_range()[all …]
114 struct bhv_desc *bd_next; /* next behavior in chain */ member144 #define BHV_NEXT(bdp) (ASSERT((bdp)->bd_next), (bdp)->bd_next)145 #define BHV_NEXTNULL(bdp) ((bdp)->bd_next)171 (bdp)->bd_next = NULL; \184 (bhp)->bh_first = (bdp)->bd_next; \